1 324891a5 2006-06-25 devnull #include <u.h>
2 324891a5 2006-06-25 devnull #include <libc.h>
3 324891a5 2006-06-25 devnull #include <draw.h>
4 324891a5 2006-06-25 devnull #include <memdraw.h>
8 324891a5 2006-06-25 devnull Arrow1 = 8,
9 324891a5 2006-06-25 devnull Arrow2 = 10,
10 324891a5 2006-06-25 devnull Arrow3 = 3
16 324891a5 2006-06-25 devnull lmin(int a, int b)
18 324891a5 2006-06-25 devnull if(a < b)
19 324891a5 2006-06-25 devnull return a;
20 324891a5 2006-06-25 devnull return b;
26 324891a5 2006-06-25 devnull lmax(int a, int b)
28 324891a5 2006-06-25 devnull if(a > b)
29 324891a5 2006-06-25 devnull return a;
30 324891a5 2006-06-25 devnull return b;
33 324891a5 2006-06-25 devnull #ifdef NOTUSED
35 324891a5 2006-06-25 devnull * Rather than line clip, we run the Bresenham loop over the full line,
36 324891a5 2006-06-25 devnull * and clip on each pixel. This is more expensive but means that
37 324891a5 2006-06-25 devnull * lines look the same regardless of how the windowing has tiled them.
38 324891a5 2006-06-25 devnull * For speed, we check for clipping outside the loop and make the
39 324891a5 2006-06-25 devnull * test easy when possible.
44 324891a5 2006-06-25 devnull horline1(Memimage *dst, Point p0, Point p1, int srcval, Rectangle clipr)
46 324891a5 2006-06-25 devnull int x, y, dy, deltay, deltax, maxx;
47 324891a5 2006-06-25 devnull int dd, easy, e, bpp, m, m0;
48 324891a5 2006-06-25 devnull uchar *d;
50 324891a5 2006-06-25 devnull deltax = p1.x - p0.x;
51 324891a5 2006-06-25 devnull deltay = p1.y - p0.y;
52 324891a5 2006-06-25 devnull dd = dst->width*sizeof(u32int);
54 324891a5 2006-06-25 devnull if(deltay < 0){
55 324891a5 2006-06-25 devnull dd = -dd;
56 324891a5 2006-06-25 devnull deltay = -deltay;
59 324891a5 2006-06-25 devnull maxx = lmin(p1.x, clipr.max.x-1);
60 324891a5 2006-06-25 devnull bpp = dst->depth;
61 324891a5 2006-06-25 devnull m0 = 0xFF^(0xFF>>bpp);
62 324891a5 2006-06-25 devnull m = m0 >> (p0.x&(7/dst->depth))*bpp;
63 324891a5 2006-06-25 devnull easy = ptinrect(p0, clipr) && ptinrect(p1, clipr);
64 324891a5 2006-06-25 devnull e = 2*deltay - deltax;
65 324891a5 2006-06-25 devnull y = p0.y;
66 324891a5 2006-06-25 devnull d = byteaddr(dst, p0);
67 324891a5 2006-06-25 devnull deltay *= 2;
68 324891a5 2006-06-25 devnull deltax = deltay - 2*deltax;
69 324891a5 2006-06-25 devnull for(x=p0.x; x<=maxx; x++){
70 324891a5 2006-06-25 devnull if(easy || (clipr.min.x<=x && clipr.min.y<=y && y<clipr.max.y))
71 324891a5 2006-06-25 devnull *d ^= (*d^srcval) & m;
72 324891a5 2006-06-25 devnull if(e > 0){
75 324891a5 2006-06-25 devnull e += deltax;
77 324891a5 2006-06-25 devnull e += deltay;
79 324891a5 2006-06-25 devnull m >>= bpp;
80 324891a5 2006-06-25 devnull if(m == 0)
87 324891a5 2006-06-25 devnull verline1(Memimage *dst, Point p0, Point p1, int srcval, Rectangle clipr)
89 324891a5 2006-06-25 devnull int x, y, deltay, deltax, maxy;
90 324891a5 2006-06-25 devnull int easy, e, bpp, m, m0, dd;
91 324891a5 2006-06-25 devnull uchar *d;
93 324891a5 2006-06-25 devnull deltax = p1.x - p0.x;
94 324891a5 2006-06-25 devnull deltay = p1.y - p0.y;
96 324891a5 2006-06-25 devnull if(deltax < 0){
98 324891a5 2006-06-25 devnull deltax = -deltax;
100 324891a5 2006-06-25 devnull maxy = lmin(p1.y, clipr.max.y-1);
101 324891a5 2006-06-25 devnull bpp = dst->depth;
102 324891a5 2006-06-25 devnull m0 = 0xFF^(0xFF>>bpp);
103 324891a5 2006-06-25 devnull m = m0 >> (p0.x&(7/dst->depth))*bpp;
104 324891a5 2006-06-25 devnull easy = ptinrect(p0, clipr) && ptinrect(p1, clipr);
105 324891a5 2006-06-25 devnull e = 2*deltax - deltay;
106 324891a5 2006-06-25 devnull x = p0.x;
107 324891a5 2006-06-25 devnull d = byteaddr(dst, p0);
108 324891a5 2006-06-25 devnull deltax *= 2;
109 324891a5 2006-06-25 devnull deltay = deltax - 2*deltay;
110 324891a5 2006-06-25 devnull for(y=p0.y; y<=maxy; y++){
111 324891a5 2006-06-25 devnull if(easy || (clipr.min.y<=y && clipr.min.x<=x && x<clipr.max.x))
112 324891a5 2006-06-25 devnull *d ^= (*d^srcval) & m;
113 324891a5 2006-06-25 devnull if(e > 0){
114 324891a5 2006-06-25 devnull x += dd;
115 324891a5 2006-06-25 devnull d += dd;
116 324891a5 2006-06-25 devnull e += deltay;
118 324891a5 2006-06-25 devnull e += deltax;
119 324891a5 2006-06-25 devnull d += dst->width*sizeof(u32int);
120 324891a5 2006-06-25 devnull m >>= bpp;
121 324891a5 2006-06-25 devnull if(m == 0)
128 324891a5 2006-06-25 devnull horliner(Memimage *dst, Point p0, Point p1, Memimage *src, Point dsrc, Rectangle clipr)
130 324891a5 2006-06-25 devnull int x, y, sx, sy, deltay, deltax, minx, maxx;
131 324891a5 2006-06-25 devnull int bpp, m, m0;
132 324891a5 2006-06-25 devnull uchar *d, *s;
134 324891a5 2006-06-25 devnull deltax = p1.x - p0.x;
135 324891a5 2006-06-25 devnull deltay = p1.y - p0.y;
136 324891a5 2006-06-25 devnull sx = drawreplxy(src->r.min.x, src->r.max.x, p0.x+dsrc.x);
137 324891a5 2006-06-25 devnull minx = lmax(p0.x, clipr.min.x);
138 324891a5 2006-06-25 devnull maxx = lmin(p1.x, clipr.max.x-1);
139 324891a5 2006-06-25 devnull bpp = dst->depth;
140 324891a5 2006-06-25 devnull m0 = 0xFF^(0xFF>>bpp);
141 324891a5 2006-06-25 devnull m = m0 >> (minx&(7/dst->depth))*bpp;
142 324891a5 2006-06-25 devnull for(x=minx; x<=maxx; x++){
143 324891a5 2006-06-25 devnull y = p0.y + (deltay*(x-p0.x)+deltax/2)/deltax;
144 324891a5 2006-06-25 devnull if(clipr.min.y<=y && y<clipr.max.y){
145 324891a5 2006-06-25 devnull d = byteaddr(dst, Pt(x, y));
146 324891a5 2006-06-25 devnull sy = drawreplxy(src->r.min.y, src->r.max.y, y+dsrc.y);
147 324891a5 2006-06-25 devnull s = byteaddr(src, Pt(sx, sy));
148 324891a5 2006-06-25 devnull *d ^= (*d^*s) & m;
150 324891a5 2006-06-25 devnull if(++sx >= src->r.max.x)
151 324891a5 2006-06-25 devnull sx = src->r.min.x;
152 324891a5 2006-06-25 devnull m >>= bpp;
153 324891a5 2006-06-25 devnull if(m == 0)
160 324891a5 2006-06-25 devnull verliner(Memimage *dst, Point p0, Point p1, Memimage *src, Point dsrc, Rectangle clipr)
162 324891a5 2006-06-25 devnull int x, y, sx, sy, deltay, deltax, miny, maxy;
163 324891a5 2006-06-25 devnull int bpp, m, m0;
164 324891a5 2006-06-25 devnull uchar *d, *s;
166 324891a5 2006-06-25 devnull deltax = p1.x - p0.x;
167 324891a5 2006-06-25 devnull deltay = p1.y - p0.y;
168 324891a5 2006-06-25 devnull sy = drawreplxy(src->r.min.y, src->r.max.y, p0.y+dsrc.y);
169 324891a5 2006-06-25 devnull miny = lmax(p0.y, clipr.min.y);
170 324891a5 2006-06-25 devnull maxy = lmin(p1.y, clipr.max.y-1);
171 324891a5 2006-06-25 devnull bpp = dst->depth;
172 324891a5 2006-06-25 devnull m0 = 0xFF^(0xFF>>bpp);
173 324891a5 2006-06-25 devnull for(y=miny; y<=maxy; y++){
174 324891a5 2006-06-25 devnull if(deltay == 0) /* degenerate line */
175 324891a5 2006-06-25 devnull x = p0.x;
177 324891a5 2006-06-25 devnull x = p0.x + (deltax*(y-p0.y)+deltay/2)/deltay;
178 324891a5 2006-06-25 devnull if(clipr.min.x<=x && x<clipr.max.x){
179 324891a5 2006-06-25 devnull m = m0 >> (x&(7/dst->depth))*bpp;
180 324891a5 2006-06-25 devnull d = byteaddr(dst, Pt(x, y));
181 324891a5 2006-06-25 devnull sx = drawreplxy(src->r.min.x, src->r.max.x, x+dsrc.x);
182 324891a5 2006-06-25 devnull s = byteaddr(src, Pt(sx, sy));
183 324891a5 2006-06-25 devnull *d ^= (*d^*s) & m;
185 324891a5 2006-06-25 devnull if(++sy >= src->r.max.y)
186 324891a5 2006-06-25 devnull sy = src->r.min.y;
192 324891a5 2006-06-25 devnull horline(Memimage *dst, Point p0, Point p1, Memimage *src, Point dsrc, Rectangle clipr)
194 324891a5 2006-06-25 devnull int x, y, deltay, deltax, minx, maxx;
195 324891a5 2006-06-25 devnull int bpp, m, m0;
196 324891a5 2006-06-25 devnull uchar *d, *s;
198 324891a5 2006-06-25 devnull deltax = p1.x - p0.x;
199 324891a5 2006-06-25 devnull deltay = p1.y - p0.y;
200 324891a5 2006-06-25 devnull minx = lmax(p0.x, clipr.min.x);
201 324891a5 2006-06-25 devnull maxx = lmin(p1.x, clipr.max.x-1);
202 324891a5 2006-06-25 devnull bpp = dst->depth;
203 324891a5 2006-06-25 devnull m0 = 0xFF^(0xFF>>bpp);
204 324891a5 2006-06-25 devnull m = m0 >> (minx&(7/dst->depth))*bpp;
205 324891a5 2006-06-25 devnull for(x=minx; x<=maxx; x++){
206 324891a5 2006-06-25 devnull y = p0.y + (deltay*(x-p0.x)+deltay/2)/deltax;
207 324891a5 2006-06-25 devnull if(clipr.min.y<=y && y<clipr.max.y){
208 324891a5 2006-06-25 devnull d = byteaddr(dst, Pt(x, y));
209 324891a5 2006-06-25 devnull s = byteaddr(src, addpt(dsrc, Pt(x, y)));
210 324891a5 2006-06-25 devnull *d ^= (*d^*s) & m;
212 324891a5 2006-06-25 devnull m >>= bpp;
213 324891a5 2006-06-25 devnull if(m == 0)
220 324891a5 2006-06-25 devnull verline(Memimage *dst, Point p0, Point p1, Memimage *src, Point dsrc, Rectangle clipr)
222 324891a5 2006-06-25 devnull int x, y, deltay, deltax, miny, maxy;
223 324891a5 2006-06-25 devnull int bpp, m, m0;
224 324891a5 2006-06-25 devnull uchar *d, *s;
226 324891a5 2006-06-25 devnull deltax = p1.x - p0.x;
227 324891a5 2006-06-25 devnull deltay = p1.y - p0.y;
228 324891a5 2006-06-25 devnull miny = lmax(p0.y, clipr.min.y);
229 324891a5 2006-06-25 devnull maxy = lmin(p1.y, clipr.max.y-1);
230 324891a5 2006-06-25 devnull bpp = dst->depth;
231 324891a5 2006-06-25 devnull m0 = 0xFF^(0xFF>>bpp);
232 324891a5 2006-06-25 devnull for(y=miny; y<=maxy; y++){
233 324891a5 2006-06-25 devnull if(deltay == 0) /* degenerate line */
234 324891a5 2006-06-25 devnull x = p0.x;
236 324891a5 2006-06-25 devnull x = p0.x + deltax*(y-p0.y)/deltay;
237 324891a5 2006-06-25 devnull if(clipr.min.x<=x && x<clipr.max.x){
238 324891a5 2006-06-25 devnull m = m0 >> (x&(7/dst->depth))*bpp;
239 324891a5 2006-06-25 devnull d = byteaddr(dst, Pt(x, y));
240 324891a5 2006-06-25 devnull s = byteaddr(src, addpt(dsrc, Pt(x, y)));
241 324891a5 2006-06-25 devnull *d ^= (*d^*s) & m;
245 324891a5 2006-06-25 devnull #endif /* NOTUSED */
247 324891a5 2006-06-25 devnull static Memimage*
248 324891a5 2006-06-25 devnull membrush(int radius)
250 324891a5 2006-06-25 devnull static Memimage *brush;
251 324891a5 2006-06-25 devnull static int brushradius;
253 324891a5 2006-06-25 devnull if(brush==nil || brushradius!=radius){
254 324891a5 2006-06-25 devnull freememimage(brush);
255 324891a5 2006-06-25 devnull brush = allocmemimage(Rect(0, 0, 2*radius+1, 2*radius+1), memopaque->chan);
256 324891a5 2006-06-25 devnull if(brush != nil){
257 324891a5 2006-06-25 devnull memfillcolor(brush, DTransparent); /* zeros */
258 324891a5 2006-06-25 devnull memellipse(brush, Pt(radius, radius), radius, radius, -1, memopaque, Pt(radius, radius), S);
260 324891a5 2006-06-25 devnull brushradius = radius;
262 324891a5 2006-06-25 devnull return brush;
267 324891a5 2006-06-25 devnull discend(Point p, int radius, Memimage *dst, Memimage *src, Point dsrc, int op)
269 324891a5 2006-06-25 devnull Memimage *disc;
270 324891a5 2006-06-25 devnull Rectangle r;
272 324891a5 2006-06-25 devnull disc = membrush(radius);
273 324891a5 2006-06-25 devnull if(disc != nil){
274 324891a5 2006-06-25 devnull r.min.x = p.x - radius;
275 324891a5 2006-06-25 devnull r.min.y = p.y - radius;
276 324891a5 2006-06-25 devnull r.max.x = p.x + radius+1;
277 324891a5 2006-06-25 devnull r.max.y = p.y + radius+1;
278 324891a5 2006-06-25 devnull memdraw(dst, r, src, addpt(r.min, dsrc), disc, Pt(0,0), op);
284 324891a5 2006-06-25 devnull arrowend(Point tip, Point *pp, int end, int sin, int cos, int radius)
286 324891a5 2006-06-25 devnull int x1, x2, x3;
288 324891a5 2006-06-25 devnull /* before rotation */
289 324891a5 2006-06-25 devnull if(end == Endarrow){
290 324891a5 2006-06-25 devnull x1 = Arrow1;
291 324891a5 2006-06-25 devnull x2 = Arrow2;
292 324891a5 2006-06-25 devnull x3 = Arrow3;
294 324891a5 2006-06-25 devnull x1 = (end>>5) & 0x1FF; /* distance along line from end of line to tip */
295 324891a5 2006-06-25 devnull x2 = (end>>14) & 0x1FF; /* distance along line from barb to tip */
296 324891a5 2006-06-25 devnull x3 = (end>>23) & 0x1FF; /* distance perpendicular from edge of line to barb */
299 324891a5 2006-06-25 devnull /* comments follow track of right-facing arrowhead */
300 324891a5 2006-06-25 devnull pp->x = tip.x+((2*radius+1)*sin/2-x1*cos); /* upper side of shaft */
301 324891a5 2006-06-25 devnull pp->y = tip.y-((2*radius+1)*cos/2+x1*sin);
303 324891a5 2006-06-25 devnull pp->x = tip.x+((2*radius+2*x3+1)*sin/2-x2*cos); /* upper barb */
304 324891a5 2006-06-25 devnull pp->y = tip.y-((2*radius+2*x3+1)*cos/2+x2*sin);
306 324891a5 2006-06-25 devnull pp->x = tip.x;
307 324891a5 2006-06-25 devnull pp->y = tip.y;
309 324891a5 2006-06-25 devnull pp->x = tip.x+(-(2*radius+2*x3+1)*sin/2-x2*cos); /* lower barb */
310 324891a5 2006-06-25 devnull pp->y = tip.y-(-(2*radius+2*x3+1)*cos/2+x2*sin);
312 324891a5 2006-06-25 devnull pp->x = tip.x+(-(2*radius+1)*sin/2-x1*cos); /* lower side of shaft */
313 324891a5 2006-06-25 devnull pp->y = tip.y+((2*radius+1)*cos/2-x1*sin);
317 324891a5 2006-06-25 devnull _memimageline(Memimage *dst, Point p0, Point p1, int end0, int end1, int radius, Memimage *src, Point sp, Rectangle clipr, int op)
320 324891a5 2006-06-25 devnull * BUG: We should really really pick off purely horizontal and purely
321 324891a5 2006-06-25 devnull * vertical lines and handle them separately with calls to memimagedraw
322 324891a5 2006-06-25 devnull * on rectangles.
325 324891a5 2006-06-25 devnull int hor;
326 324891a5 2006-06-25 devnull int sin, cos, dx, dy, t;
327 324891a5 2006-06-25 devnull Rectangle oclipr, r;
328 324891a5 2006-06-25 devnull Point q, pts[10], *pp, d;
330 324891a5 2006-06-25 devnull if(radius < 0)
332 324891a5 2006-06-25 devnull if(rectclip(&clipr, dst->r) == 0)
334 324891a5 2006-06-25 devnull if(rectclip(&clipr, dst->clipr) == 0)
336 324891a5 2006-06-25 devnull d = subpt(sp, p0);
337 324891a5 2006-06-25 devnull if(rectclip(&clipr, rectsubpt(src->clipr, d)) == 0)
339 324891a5 2006-06-25 devnull if((src->flags&Frepl)==0 && rectclip(&clipr, rectsubpt(src->r, d))==0)
341 324891a5 2006-06-25 devnull /* this means that only verline() handles degenerate lines (p0==p1) */
342 324891a5 2006-06-25 devnull hor = (abs(p1.x-p0.x) > abs(p1.y-p0.y));
344 324891a5 2006-06-25 devnull * Clipping is a little peculiar. We can't use Sutherland-Cohen
345 324891a5 2006-06-25 devnull * clipping because lines are wide. But this is probably just fine:
346 324891a5 2006-06-25 devnull * we do all math with the original p0 and p1, but clip when deciding
347 324891a5 2006-06-25 devnull * what pixels to draw. This means the layer code can call this routine,
348 324891a5 2006-06-25 devnull * using clipr to define the region being written, and get the same set
349 324891a5 2006-06-25 devnull * of pixels regardless of the dicing.
351 324891a5 2006-06-25 devnull if((hor && p0.x>p1.x) || (!hor && p0.y>p1.y)){
353 324891a5 2006-06-25 devnull p0 = p1;
355 324891a5 2006-06-25 devnull t = end0;
356 324891a5 2006-06-25 devnull end0 = end1;
357 324891a5 2006-06-25 devnull end1 = t;
360 324891a5 2006-06-25 devnull if((p0.x == p1.x || p0.y == p1.y) && (end0&0x1F) == Endsquare && (end1&0x1F) == Endsquare){
361 324891a5 2006-06-25 devnull r.min = p0;
362 324891a5 2006-06-25 devnull r.max = p1;
363 324891a5 2006-06-25 devnull if(p0.x == p1.x){
364 324891a5 2006-06-25 devnull r.min.x -= radius;
365 324891a5 2006-06-25 devnull r.max.x += radius+1;
368 324891a5 2006-06-25 devnull r.min.y -= radius;
369 324891a5 2006-06-25 devnull r.max.y += radius+1;
371 324891a5 2006-06-25 devnull oclipr = dst->clipr;
372 324891a5 2006-06-25 devnull dst->clipr = clipr;
373 324891a5 2006-06-25 devnull memimagedraw(dst, r, src, sp, memopaque, sp, op);
374 324891a5 2006-06-25 devnull dst->clipr = oclipr;
378 324891a5 2006-06-25 devnull /* Hard: */
379 324891a5 2006-06-25 devnull /* draw thick line using polygon fill */
380 324891a5 2006-06-25 devnull icossin2(p1.x-p0.x, p1.y-p0.y, &cos, &sin);
381 324891a5 2006-06-25 devnull dx = (sin*(2*radius+1))/2;
382 324891a5 2006-06-25 devnull dy = (cos*(2*radius+1))/2;
383 324891a5 2006-06-25 devnull pp = pts;
384 324891a5 2006-06-25 devnull oclipr = dst->clipr;
385 324891a5 2006-06-25 devnull dst->clipr = clipr;
386 324891a5 2006-06-25 devnull q.x = ICOSSCALE*p0.x+ICOSSCALE/2-cos/2;
387 324891a5 2006-06-25 devnull q.y = ICOSSCALE*p0.y+ICOSSCALE/2-sin/2;
388 324891a5 2006-06-25 devnull switch(end0 & 0x1F){
389 324891a5 2006-06-25 devnull case Enddisc:
390 324891a5 2006-06-25 devnull discend(p0, radius, dst, src, d, op);
391 324891a5 2006-06-25 devnull /* fall through */
392 324891a5 2006-06-25 devnull case Endsquare:
393 324891a5 2006-06-25 devnull default:
394 324891a5 2006-06-25 devnull pp->x = q.x-dx;
395 324891a5 2006-06-25 devnull pp->y = q.y+dy;
397 324891a5 2006-06-25 devnull pp->x = q.x+dx;
398 324891a5 2006-06-25 devnull pp->y = q.y-dy;
401 324891a5 2006-06-25 devnull case Endarrow:
402 324891a5 2006-06-25 devnull arrowend(q, pp, end0, -sin, -cos, radius);
403 324891a5 2006-06-25 devnull _memfillpolysc(dst, pts, 5, ~0, src, addpt(pts[0], mulpt(d, ICOSSCALE)), 1, 10, 1, op);
404 324891a5 2006-06-25 devnull pp[1] = pp[4];
405 324891a5 2006-06-25 devnull pp += 2;
407 324891a5 2006-06-25 devnull q.x = ICOSSCALE*p1.x+ICOSSCALE/2+cos/2;
408 324891a5 2006-06-25 devnull q.y = ICOSSCALE*p1.y+ICOSSCALE/2+sin/2;
409 324891a5 2006-06-25 devnull switch(end1 & 0x1F){
410 324891a5 2006-06-25 devnull case Enddisc:
411 324891a5 2006-06-25 devnull discend(p1, radius, dst, src, d, op);
412 324891a5 2006-06-25 devnull /* fall through */
413 324891a5 2006-06-25 devnull case Endsquare:
414 324891a5 2006-06-25 devnull default:
415 324891a5 2006-06-25 devnull pp->x = q.x+dx;
416 324891a5 2006-06-25 devnull pp->y = q.y-dy;
418 324891a5 2006-06-25 devnull pp->x = q.x-dx;
419 324891a5 2006-06-25 devnull pp->y = q.y+dy;
422 324891a5 2006-06-25 devnull case Endarrow:
423 324891a5 2006-06-25 devnull arrowend(q, pp, end1, sin, cos, radius);
424 324891a5 2006-06-25 devnull _memfillpolysc(dst, pp, 5, ~0, src, addpt(pts[0], mulpt(d, ICOSSCALE)), 1, 10, 1, op);
425 324891a5 2006-06-25 devnull pp[1] = pp[4];
426 324891a5 2006-06-25 devnull pp += 2;
428 324891a5 2006-06-25 devnull _memfillpolysc(dst, pts, pp-pts, ~0, src, addpt(pts[0], mulpt(d, ICOSSCALE)), 0, 10, 1, op);
429 324891a5 2006-06-25 devnull dst->clipr = oclipr;
434 324891a5 2006-06-25 devnull memimageline(Memimage *dst, Point p0, Point p1, int end0, int end1, int radius, Memimage *src, Point sp, int op)
436 324891a5 2006-06-25 devnull _memimageline(dst, p0, p1, end0, end1, radius, src, sp, dst->clipr, op);
440 324891a5 2006-06-25 devnull * Simple-minded conservative code to compute bounding box of line.
441 324891a5 2006-06-25 devnull * Result is probably a little larger than it needs to be.
445 324891a5 2006-06-25 devnull addbbox(Rectangle *r, Point p)
447 324891a5 2006-06-25 devnull if(r->min.x > p.x)
448 324891a5 2006-06-25 devnull r->min.x = p.x;
449 324891a5 2006-06-25 devnull if(r->min.y > p.y)
450 324891a5 2006-06-25 devnull r->min.y = p.y;
451 324891a5 2006-06-25 devnull if(r->max.x < p.x+1)
452 324891a5 2006-06-25 devnull r->max.x = p.x+1;
453 324891a5 2006-06-25 devnull if(r->max.y < p.y+1)
454 324891a5 2006-06-25 devnull r->max.y = p.y+1;
458 324891a5 2006-06-25 devnull memlineendsize(int end)
462 324891a5 2006-06-25 devnull if((end&0x3F) != Endarrow)
463 324891a5 2006-06-25 devnull return 0;
464 324891a5 2006-06-25 devnull if(end == Endarrow)
465 324891a5 2006-06-25 devnull x3 = Arrow3;
467 324891a5 2006-06-25 devnull x3 = (end>>23) & 0x1FF;
468 324891a5 2006-06-25 devnull return x3;
471 324891a5 2006-06-25 devnull Rectangle
472 324891a5 2006-06-25 devnull memlinebbox(Point p0, Point p1, int end0, int end1, int radius)
474 324891a5 2006-06-25 devnull Rectangle r, r1;
475 324891a5 2006-06-25 devnull int extra;
477 324891a5 2006-06-25 devnull r.min.x = 10000000;
478 324891a5 2006-06-25 devnull r.min.y = 10000000;
479 324891a5 2006-06-25 devnull r.max.x = -10000000;
480 324891a5 2006-06-25 devnull r.max.y = -10000000;
481 324891a5 2006-06-25 devnull extra = lmax(memlineendsize(end0), memlineendsize(end1));
482 324891a5 2006-06-25 devnull r1 = insetrect(canonrect(Rpt(p0, p1)), -(radius+extra));
483 324891a5 2006-06-25 devnull addbbox(&r, r1.min);
484 324891a5 2006-06-25 devnull addbbox(&r, r1.max);
485 324891a5 2006-06-25 devnull return r;
