9 i_mmarray_cr(i_mmarray *ar,int l) {
14 alloc_size = sizeof(minmax) * l;
15 /* check for overflow */
16 if (alloc_size / l != sizeof(minmax)) {
17 fprintf(stderr, "overflow calculating memory allocation");
20 ar->data=mymalloc(alloc_size); /* checked 5jul05 tonyc */
21 for(i=0;i<l;i++) { ar->data[i].max=-1; ar->data[i].min=MAXINT; }
25 i_mmarray_dst(i_mmarray *ar) {
27 if (ar->data != NULL) { myfree(ar->data); ar->data=NULL; }
31 i_mmarray_add(i_mmarray *ar,int x,int y) {
32 if (y>-1 && y<ar->lines)
34 if (x<ar->data[y].min) ar->data[y].min=x;
35 if (x>ar->data[y].max) ar->data[y].max=x;
40 i_mmarray_gmin(i_mmarray *ar,int y) {
41 if (y>-1 && y<ar->lines) return ar->data[y].min;
46 i_mmarray_getm(i_mmarray *ar,int y) {
47 if (y>-1 && y<ar->lines) return ar->data[y].max;
52 i_mmarray_render(i_img *im,i_mmarray *ar,i_color *val) {
54 for(i=0;i<ar->lines;i++) if (ar->data[i].max!=-1) for(x=ar->data[i].min;x<ar->data[i].max;x++) i_ppix(im,x,i,val);
58 i_mmarray_render_fill(i_img *im,i_mmarray *ar,i_fill_t *fill) {
60 if (im->bits == i_8_bits && fill->fill_with_color) {
61 i_color *line = mymalloc(sizeof(i_color) * im->xsize); /* checked 5jul05 tonyc */
64 work = mymalloc(sizeof(i_color) * im->xsize); /* checked 5jul05 tonyc */
65 for(y=0;y<ar->lines;y++) {
66 if (ar->data[y].max!=-1) {
68 w = ar->data[y].max-ar->data[y].min;
71 i_glin(im, x, x+w, y, line);
72 (fill->fill_with_color)(fill, x, y, w, im->channels, work);
73 (fill->combine)(line, work, im->channels, w);
76 (fill->fill_with_color)(fill, x, y, w, im->channels, line);
78 i_plin(im, x, x+w, y, line);
87 i_fcolor *line = mymalloc(sizeof(i_fcolor) * im->xsize); /* checked 5jul05 tonyc */
88 i_fcolor *work = NULL;
90 work = mymalloc(sizeof(i_fcolor) * im->xsize); /* checked 5jul05 tonyc */
91 for(y=0;y<ar->lines;y++) {
92 if (ar->data[y].max!=-1) {
94 w = ar->data[y].max-ar->data[y].min;
97 i_glinf(im, x, x+w, y, line);
98 (fill->fill_with_fcolor)(fill, x, y, w, im->channels, work);
99 (fill->combinef)(line, work, im->channels, w);
102 (fill->fill_with_fcolor)(fill, x, y, w, im->channels, line);
104 i_plinf(im, x, x+w, y, line);
117 i_arcdraw(int x1, int y1, int x2, int y2, i_mmarray *ar) {
121 alpha=(double)(y2-y1)/(double)(x2-x1);
122 if (fabs(alpha) <= 1)
124 if (x2<x1) { temp=x1; x1=x2; x2=temp; temp=y1; y1=y2; y2=temp; }
128 i_mmarray_add(ar,x1,(int)(dsec+0.5));
136 if (y2<y1) { temp=x1; x1=x2; x2=temp; temp=y1; y1=y2; y2=temp; }
140 i_mmarray_add(ar,(int)(dsec+0.5),y1);
148 i_mmarray_info(i_mmarray *ar) {
150 for(i=0;i<ar->lines;i++)
151 if (ar->data[i].max!=-1) printf("line %d: min=%d, max=%d.\n",i,ar->data[i].min,ar->data[i].max);
155 i_arc_minmax(i_int_hlines *hlines,int x,int y,float rad,float d1,float d2) {
160 /*mm_log((1,"i_arc(im* 0x%x,x %d,y %d,rad %.2f,d1 %.2f,d2 %.2f,val 0x%x)\n",im,x,y,rad,d1,d2,val));*/
162 i_mmarray_cr(&dot, hlines->limit_y);
164 x1=(int)(x+0.5+rad*cos(d1*PI/180.0));
165 y1=(int)(y+0.5+rad*sin(d1*PI/180.0));
166 fx=(float)x1; fy=(float)y1;
168 /* printf("x1: %d.\ny1: %d.\n",x1,y1); */
169 i_arcdraw(x, y, x1, y1, &dot);
171 x1=(int)(x+0.5+rad*cos(d2*PI/180.0));
172 y1=(int)(y+0.5+rad*sin(d2*PI/180.0));
174 for(f=d1;f<=d2;f+=0.01) i_mmarray_add(&dot,(int)(x+0.5+rad*cos(f*PI/180.0)),(int)(y+0.5+rad*sin(f*PI/180.0)));
176 /* printf("x1: %d.\ny1: %d.\n",x1,y1); */
177 i_arcdraw(x, y, x1, y1, &dot);
179 /* render the minmax values onto the hlines */
180 for (y = 0; y < dot.lines; y++) {
181 if (dot.data[y].max!=-1) {
183 minx = dot.data[y].min;
184 width = dot.data[y].max - dot.data[y].min + 1;
185 i_int_hlines_add(hlines, y, minx, width);
194 i_arc_hlines(i_int_hlines *hlines,int x,int y,float rad,float d1,float d2) {
196 i_arc_minmax(hlines, x, y, rad, d1, d2);
199 i_arc_minmax(hlines, x, y, rad, d1, 360);
200 i_arc_minmax(hlines, x, y, rad, 0, d2);
205 =item i_arc(im, x, y, rad, d1, d2, color)
208 =synopsis i_arc(im, 50, 50, 20, 45, 135, &color);
210 Fills an arc centered at (x,y) with radius I<rad> covering the range
211 of angles in degrees from d1 to d2, with the color.
217 i_arc(i_img *im,int x,int y,float rad,float d1,float d2,const i_color *val) {
220 i_int_init_hlines_img(&hlines, im);
222 i_arc_hlines(&hlines, x, y, rad, d1, d2);
224 i_int_hlines_fill_color(im, &hlines, val);
226 i_int_hlines_destroy(&hlines);
230 =item i_arc_cfill(im, x, y, rad, d1, d2, fill)
233 =synopsis i_arc_cfill(im, 50, 50, 35, 90, 135, fill);
235 Fills an arc centered at (x,y) with radius I<rad> covering the range
236 of angles in degrees from d1 to d2, with the fill object.
241 #define MIN_CIRCLE_STEPS 8
242 #define MAX_CIRCLE_STEPS 360
245 i_arc_cfill(i_img *im,int x,int y,float rad,float d1,float d2,i_fill_t *fill) {
248 i_int_init_hlines_img(&hlines, im);
250 i_arc_hlines(&hlines, x, y, rad, d1, d2);
252 i_int_hlines_fill_fill(im, &hlines, fill);
254 i_int_hlines_destroy(&hlines);
258 arc_poly(int *count, double **xvals, double **yvals,
259 double x, double y, double rad, double d1, double d2) {
260 double d1_rad, d2_rad;
262 int steps, point_count;
265 /* normalize the angles */
268 if (d2 >= 360) { /* default is 361 */
282 d1_rad = d1 * PI / 180;
283 d2_rad = d2 * PI / 180;
285 /* how many segments for the curved part?
286 we do a maximum of one per degree, with a minimum of 8/circle
287 we try to aim at having about one segment per 2 pixels
288 Work it out per circle to get a step size.
290 I was originally making steps = circum/2 but that looked horrible.
292 I think there might be an issue in the polygon filler.
294 circum = 2 * PI * rad;
296 if (steps > MAX_CIRCLE_STEPS)
297 steps = MAX_CIRCLE_STEPS;
298 else if (steps < MIN_CIRCLE_STEPS)
299 steps = MIN_CIRCLE_STEPS;
301 angle_inc = 2 * PI / steps;
303 point_count = steps + 5; /* rough */
304 *xvals = mymalloc(point_count * sizeof(double));
305 *yvals = mymalloc(point_count * sizeof(double));
307 /* from centre to edge at d1 */
310 (*xvals)[1] = x + rad * cos(d1_rad);
311 (*yvals)[1] = y + rad * sin(d1_rad);
314 /* step around the curve */
315 while (d1_rad < d2_rad) {
316 (*xvals)[*count] = x + rad * cos(d1_rad);
317 (*yvals)[*count] = y + rad * sin(d1_rad);
322 /* finish off the curve */
323 (*xvals)[*count] = x + rad * cos(d2_rad);
324 (*yvals)[*count] = y + rad * sin(d2_rad);
329 =item i_arc_aa(im, x, y, rad, d1, d2, color)
332 =synopsis i_arc_aa(im, 50, 50, 35, 90, 135, &color);
334 Antialias fills an arc centered at (x,y) with radius I<rad> covering
335 the range of angles in degrees from d1 to d2, with the color.
341 i_arc_aa(i_img *im, double x, double y, double rad, double d1, double d2,
342 const i_color *val) {
343 double *xvals, *yvals;
346 arc_poly(&count, &xvals, &yvals, x, y, rad, d1, d2);
348 i_poly_aa(im, count, xvals, yvals, val);
355 =item i_arc_aa_cfill(im, x, y, rad, d1, d2, fill)
358 =synopsis i_arc_aa_cfill(im, 50, 50, 35, 90, 135, fill);
360 Antialias fills an arc centered at (x,y) with radius I<rad> covering
361 the range of angles in degrees from d1 to d2, with the fill object.
367 i_arc_aa_cfill(i_img *im, double x, double y, double rad, double d1, double d2,
369 double *xvals, *yvals;
372 arc_poly(&count, &xvals, &yvals, x, y, rad, d1, d2);
374 i_poly_aa_cfill(im, count, xvals, yvals, fill);
380 /* Temporary AA HACK */
384 static frac float_to_frac(float x) { return (frac)(0.5+x*16.0); }
388 polar_to_plane(float cx, float cy, float angle, float radius, frac *x, frac *y) {
389 *x = float_to_frac(cx+radius*cos(angle));
390 *y = float_to_frac(cy+radius*sin(angle));
395 make_minmax_list(i_mmarray *dot, float x, float y, float radius) {
397 float astep = radius>0.1 ? .5/radius : 10;
398 frac cx, cy, lx, ly, sx, sy;
400 mm_log((1, "make_minmax_list(dot %p, x %.2f, y %.2f, radius %.2f)\n", dot, x, y, radius));
402 polar_to_plane(x, y, angle, radius, &sx, &sy);
404 for(angle = 0.0; angle<361; angle +=astep) {
406 polar_to_plane(x, y, angle, radius, &cx, &cy);
409 if (fabs(cx-lx) > fabs(cy-ly)) {
412 ccx = lx; lx = cx; cx = ccx;
413 ccy = ly; ly = cy; cy = ccy;
416 for(ccx=lx; ccx<=cx; ccx++) {
417 ccy = ly + ((cy-ly)*(ccx-lx))/(cx-lx);
418 i_mmarray_add(dot, ccx, ccy);
424 ccy = ly; ly = cy; cy = ccy;
425 ccx = lx; lx = cx; cx = ccx;
428 for(ccy=ly; ccy<=cy; ccy++) {
429 if (cy-ly) ccx = lx + ((cx-lx)*(ccy-ly))/(cy-ly); else ccx = lx;
430 i_mmarray_add(dot, ccx, ccy);
436 /* Get the number of subpixels covered */
440 i_pixel_coverage(i_mmarray *dot, int x, int y) {
446 for(cy=y*16; cy<(y+1)*16; cy++) {
447 frac tmin = dot->data[cy].min;
448 frac tmax = dot->data[cy].max;
450 if (tmax == -1 || tmin > maxx || tmax < minx) continue;
452 if (tmin < minx) tmin = minx;
453 if (tmax > maxx) tmax = maxx;
461 =item i_circle_aa(im, x, y, rad, color)
464 =synopsis i_circle_aa(im, 50, 50, 45, &color);
466 Antialias fills a circle centered at (x,y) for radius I<rad> with
472 i_circle_aa(i_img *im, float x, float y, float rad, const i_color *val) {
477 mm_log((1, "i_circle_aa(im %p, x %d, y %d, rad %.2f, val %p)\n", im, x, y, rad, val));
479 i_mmarray_cr(&dot,16*im->ysize);
480 make_minmax_list(&dot, x, y, rad);
482 for(ly = 0; ly<im->ysize; ly++) {
483 int ix, cy, minx = INT_MAX, maxx = INT_MIN;
485 /* Find the left/rightmost set subpixels */
486 for(cy = 0; cy<16; cy++) {
487 frac tmin = dot.data[ly*16+cy].min;
488 frac tmax = dot.data[ly*16+cy].max;
489 if (tmax == -1) continue;
491 if (minx > tmin) minx = tmin;
492 if (maxx < tmax) maxx = tmax;
495 if (maxx == INT_MIN) continue; /* no work to be done for this row of pixels */
499 for(ix=minx; ix<=maxx; ix++) {
500 int cnt = i_pixel_coverage(&dot, ix, ly);
501 if (cnt>255) cnt = 255;
502 if (cnt) { /* should never be true */
504 float ratio = (float)cnt/255.0;
505 i_gpix(im, ix, ly, &temp);
506 for(ch=0;ch<im->channels; ch++) temp.channel[ch] = (unsigned char)((float)val->channel[ch]*ratio + (float)temp.channel[ch]*(1.0-ratio));
507 i_ppix(im, ix, ly, &temp);
515 =item i_box(im, x1, y1, x2, y2, color)
518 =synopsis i_box(im, 0, 0, im->xsize-1, im->ysize-1, &color).
520 Outlines the box from (x1,y1) to (x2,y2) inclusive with I<color>.
526 i_box(i_img *im,int x1,int y1,int x2,int y2,const i_color *val) {
528 mm_log((1,"i_box(im* 0x%x,x1 %d,y1 %d,x2 %d,y2 %d,val 0x%x)\n",im,x1,y1,x2,y2,val));
529 for(x=x1;x<x2+1;x++) {
533 for(y=y1;y<y2+1;y++) {
540 =item i_box_filled(im, x1, y1, x2, y2, color)
543 =synopsis i_box_filled(im, 0, 0, im->xsize-1, im->ysize-1, &color);
545 Fills the box from (x1,y1) to (x2,y2) inclusive with color.
551 i_box_filled(i_img *im,int x1,int y1,int x2,int y2, const i_color *val) {
553 mm_log((1,"i_box_filled(im* 0x%x,x1 %d,y1 %d,x2 %d,y2 %d,val 0x%x)\n",im,x1,y1,x2,y2,val));
554 for(x=x1;x<x2+1;x++) for (y=y1;y<y2+1;y++) i_ppix(im,x,y,val);
558 =item i_box_cfill(im, x1, y1, x2, y2, fill)
561 =synopsis i_box_cfill(im, 0, 0, im->xsize-1, im->ysize-1, fill);
563 Fills the box from (x1,y1) to (x2,y2) inclusive with fill.
569 i_box_cfill(i_img *im,int x1,int y1,int x2,int y2,i_fill_t *fill) {
570 mm_log((1,"i_box_cfill(im* 0x%x,x1 %d,y1 %d,x2 %d,y2 %d,fill 0x%x)\n",im,x1,y1,x2,y2,fill));
581 if (x1 >= x2 || y1 > y2)
583 if (im->bits == i_8_bits && fill->fill_with_color) {
584 i_color *line = mymalloc(sizeof(i_color) * (x2 - x1)); /* checked 5jul05 tonyc */
585 i_color *work = NULL;
587 work = mymalloc(sizeof(i_color) * (x2-x1)); /* checked 5jul05 tonyc */
590 i_glin(im, x1, x2, y1, line);
591 (fill->fill_with_color)(fill, x1, y1, x2-x1, im->channels, work);
592 (fill->combine)(line, work, im->channels, x2-x1);
595 (fill->fill_with_color)(fill, x1, y1, x2-x1, im->channels, line);
597 i_plin(im, x1, x2, y1, line);
605 i_fcolor *line = mymalloc(sizeof(i_fcolor) * (x2 - x1)); /* checked 5jul05 tonyc */
607 work = mymalloc(sizeof(i_fcolor) * (x2 - x1)); /* checked 5jul05 tonyc */
611 i_glinf(im, x1, x2, y1, line);
612 (fill->fill_with_fcolor)(fill, x1, y1, x2-x1, im->channels, work);
613 (fill->combinef)(line, work, im->channels, x2-x1);
616 (fill->fill_with_fcolor)(fill, x1, y1, x2-x1, im->channels, line);
618 i_plinf(im, x1, x2, y1, line);
629 =item i_line(im, x1, y1, x2, y2, val, endp)
633 Draw a line to image using bresenhams linedrawing algorithm
635 im - image to draw to
636 x1 - starting x coordinate
637 y1 - starting x coordinate
638 x2 - starting x coordinate
639 y2 - starting x coordinate
640 val - color to write to image
641 endp - endpoint flag (boolean)
647 i_line(i_img *im, int x1, int y1, int x2, int y2, const i_color *val, int endp) {
656 /* choose variable to iterate on */
657 if (abs(dx)>abs(dy)) {
663 t = x1; x1 = x2; x2 = t;
664 t = y1; y1 = y2; y2 = t;
682 for(x=x1; x<x2-1; x++) {
689 i_ppix(im, x+1, y, val);
697 t = x1; x1 = x2; x2 = t;
698 t = y1; y1 = y2; y2 = t;
716 for(y=y1; y<y2-1; y++) {
723 i_ppix(im, x, y+1, val);
727 i_ppix(im, x1, y1, val);
728 i_ppix(im, x2, y2, val);
730 if (x1 != x2 || y1 != y2)
731 i_ppix(im, x1, y1, val);
737 i_line_dda(i_img *im, int x1, int y1, int x2, int y2, i_color *val) {
742 for(x=x1; x<=x2; x++) {
743 dy = y1+ (x-x1)/(float)(x2-x1)*(y2-y1);
744 i_ppix(im, x, (int)(dy+0.5), val);
775 i_line_aa3(i_img *im,int x1,int y1,int x2,int y2,i_color *val) {
779 int temp,dx,dy,isec,ch;
781 mm_log((1,"i_line_aa(im* 0x%x,x1 %d,y1 %d,x2 %d,y2 %d,val 0x%x)\n",im,x1,y1,x2,y2,val));
786 if (abs(dx)>abs(dy)) { /* alpha < 1 */
787 if (x2<x1) { temp=x1; x1=x2; x2=temp; temp=y1; y1=y2; y2=temp; }
788 alpha=(float)(y2-y1)/(float)(x2-x1);
794 /* dfrac=1-(1-dfrac)*(1-dfrac); */
795 /* This is something we can play with to try to get better looking lines */
797 i_gpix(im,x1,isec,&tval);
798 for(ch=0;ch<im->channels;ch++) tval.channel[ch]=(unsigned char)(dfrac*(float)tval.channel[ch]+(1-dfrac)*(float)val->channel[ch]);
799 i_ppix(im,x1,isec,&tval);
801 i_gpix(im,x1,isec+1,&tval);
802 for(ch=0;ch<im->channels;ch++) tval.channel[ch]=(unsigned char)((1-dfrac)*(float)tval.channel[ch]+dfrac*(float)val->channel[ch]);
803 i_ppix(im,x1,isec+1,&tval);
809 if (y2<y1) { temp=y1; y1=y2; y2=temp; temp=x1; x1=x2; x2=temp; }
810 alpha=(float)(x2-x1)/(float)(y2-y1);
815 /* dfrac=sqrt(dfrac); */
816 /* This is something we can play with */
817 i_gpix(im,isec,y1,&tval);
818 for(ch=0;ch<im->channels;ch++) tval.channel[ch]=(unsigned char)(dfrac*(float)tval.channel[ch]+(1-dfrac)*(float)val->channel[ch]);
819 i_ppix(im,isec,y1,&tval);
821 i_gpix(im,isec+1,y1,&tval);
822 for(ch=0;ch<im->channels;ch++) tval.channel[ch]=(unsigned char)((1-dfrac)*(float)tval.channel[ch]+dfrac*(float)val->channel[ch]);
823 i_ppix(im,isec+1,y1,&tval);
833 =item i_line_aa(im, x1, x2, y1, y2, color, endp)
837 Antialias draws a line from (x1,y1) to (x2, y2) in color.
839 The point (x2, y2) is drawn only if endp is set.
845 i_line_aa(i_img *im, int x1, int y1, int x2, int y2, const i_color *val, int endp) {
853 /* choose variable to iterate on */
854 if (abs(dx)>abs(dy)) {
860 t = x1; x1 = x2; x2 = t;
861 t = y1; y1 = y2; y2 = t;
875 p = dy2 - dx2; /* this has to be like this for AA */
879 for(x=x1; x<x2-1; x++) {
882 float t = (dy) ? -(float)(p)/(float)(dx2) : 1;
889 i_gpix(im,x+1,y,&tval);
890 for(ch=0;ch<im->channels;ch++)
891 tval.channel[ch]=(unsigned char)(t1*(float)tval.channel[ch]+t2*(float)val->channel[ch]);
892 i_ppix(im,x+1,y,&tval);
894 i_gpix(im,x+1,y+cpy,&tval);
895 for(ch=0;ch<im->channels;ch++)
896 tval.channel[ch]=(unsigned char)(t2*(float)tval.channel[ch]+t1*(float)val->channel[ch]);
897 i_ppix(im,x+1,y+cpy,&tval);
912 t = x1; x1 = x2; x2 = t;
913 t = y1; y1 = y2; y2 = t;
927 p = dx2 - dy2; /* this has to be like this for AA */
931 for(y=y1; y<y2-1; y++) {
934 float t = (dx) ? -(float)(p)/(float)(dy2) : 1;
941 i_gpix(im,x,y+1,&tval);
942 for(ch=0;ch<im->channels;ch++)
943 tval.channel[ch]=(unsigned char)(t1*(float)tval.channel[ch]+t2*(float)val->channel[ch]);
944 i_ppix(im,x,y+1,&tval);
946 i_gpix(im,x+cpx,y+1,&tval);
947 for(ch=0;ch<im->channels;ch++)
948 tval.channel[ch]=(unsigned char)(t2*(float)tval.channel[ch]+t1*(float)val->channel[ch]);
949 i_ppix(im,x+cpx,y+1,&tval);
962 i_ppix(im, x1, y1, val);
963 i_ppix(im, x2, y2, val);
965 if (x1 != x2 || y1 != y2)
966 i_ppix(im, x1, y1, val);
977 for(i=k+1;i<=n;i++) r*=i;
978 for(i=1;i<=(n-k);i++) r/=i;
983 /* Note in calculating t^k*(1-t)^(n-k)
984 we can start by using t^0=1 so this simplifies to
985 t^0*(1-t)^n - we want to multiply that with t/(1-t) each iteration
986 to get a new level - this may lead to errors who knows lets test it */
989 i_bezier_multi(i_img *im,int l,const double *x,const double *y, const i_color *val) {
997 /* this is the same size as the x and y arrays, so shouldn't overflow */
998 bzcoef=mymalloc(sizeof(double)*l); /* checked 5jul05 tonyc */
999 for(k=0;k<l;k++) bzcoef[k]=perm(n,k);
1003 /* for(k=0;k<l;k++) printf("bzcoef: %d -> %f\n",k,bzcoef[k]); */
1005 for(t=0;t<=1;t+=0.005) {
1010 /* cx+=bzcoef[k]*x[k]*pow(t,k)*pow(1-t,n-k);
1011 cy+=bzcoef[k]*y[k]*pow(t,k)*pow(1-t,n-k);*/
1013 cx+=bzcoef[k]*x[k]*ccoef;
1014 cy+=bzcoef[k]*y[k]*ccoef;
1017 /* printf("%f -> (%d,%d)\n",t,(int)(0.5+cx),(int)(0.5+cy)); */
1019 i_line_aa(im,lx,ly,(int)(0.5+cx),(int)(0.5+cy),val, 1);
1021 /* i_ppix(im,(int)(0.5+cx),(int)(0.5+cy),val); */
1031 REF: Graphics Gems I. page 282+
1035 /* This should be moved into a seperate file? */
1037 /* This is the truncation used:
1039 a double is multiplied by 16 and then truncated.
1040 This means that 0 -> 0
1041 So a triangle of (0,0) (10,10) (10,0) Will look like it's
1042 not filling the (10,10) point nor the (10,0)-(10,10) line segment
1047 /* Flood fill algorithm - based on the Ken Fishkins (pixar) gem in
1062 struct stack_element {
1070 /* create the link data to put push onto the stack */
1073 struct stack_element*
1074 crdata(int left,int right,int dadl,int dadr,int y, int dir) {
1075 struct stack_element *ste;
1076 ste = mymalloc(sizeof(struct stack_element)); /* checked 5jul05 tonyc */
1082 ste->myDirection = dir;
1086 /* i_ccomp compares two colors and gives true if they are the same */
1089 i_ccomp(i_color *val1,i_color *val2,int ch) {
1091 for(i=0;i<ch;i++) if (val1->channel[i] !=val2->channel[i]) return 0;
1097 i_lspan(i_img *im, int seedx, int seedy, i_color *val) {
1100 if (seedx-1 < 0) break;
1101 i_gpix(im,seedx-1,seedy,&cval);
1102 if (!i_ccomp(val,&cval,im->channels)) break;
1109 i_rspan(i_img *im, int seedx, int seedy, i_color *val) {
1112 if (seedx+1 > im->xsize-1) break;
1113 i_gpix(im,seedx+1,seedy,&cval);
1114 if (!i_ccomp(val,&cval,im->channels)) break;
1120 /* Macro to create a link and push on to the list */
1122 #define ST_PUSH(left,right,dadl,dadr,y,dir) do { \
1123 struct stack_element *s = crdata(left,right,dadl,dadr,y,dir); \
1124 llist_push(st,&s); \
1127 /* pops the shadow on TOS into local variables lx,rx,y,direction,dadLx and dadRx */
1128 /* No overflow check! */
1130 #define ST_POP() do { \
1131 struct stack_element *s; \
1138 direction = s->myDirection; \
1142 #define ST_STACK(dir,dadLx,dadRx,lx,rx,y) do { \
1143 int pushrx = rx+1; \
1144 int pushlx = lx-1; \
1145 ST_PUSH(lx,rx,pushlx,pushrx,y+dir,dir); \
1147 ST_PUSH(dadRx+1,rx,pushlx,pushrx,y-dir,-dir); \
1148 if (lx < dadLx) ST_PUSH(lx,dadLx-1,pushlx,pushrx,y-dir,-dir); \
1151 #define SET(x,y) btm_set(btm,x,y)
1153 /* INSIDE returns true if pixel is correct color and we haven't set it before. */
1154 #define INSIDE(x,y) ((!btm_test(btm,x,y) && ( i_gpix(im,x,y,&cval),i_ccomp(&val,&cval,channels) ) ))
1158 /* The function that does all the real work */
1160 static struct i_bitmap *
1161 i_flood_fill_low(i_img *im,int seedx,int seedy,
1162 int *bxminp, int *bxmaxp, int *byminp, int *bymaxp) {
1180 struct i_bitmap *btm;
1182 int channels,xsize,ysize;
1185 channels = im->channels;
1189 btm = btm_new(xsize, ysize);
1190 st = llist_new(100, sizeof(struct stack_element*));
1192 /* Get the reference color */
1193 i_gpix(im, seedx, seedy, &val);
1195 /* Find the starting span and fill it */
1196 ltx = i_lspan(im, seedx, seedy, &val);
1197 rtx = i_rspan(im, seedx, seedy, &val);
1198 for(tx=ltx; tx<=rtx; tx++) SET(tx, seedy);
1200 ST_PUSH(ltx, rtx, ltx, rtx, seedy+1, 1);
1201 ST_PUSH(ltx, rtx, ltx, rtx, seedy-1, -1);
1204 /* Stack variables */
1213 ST_POP(); /* sets lx, rx, dadLx, dadRx, y, direction */
1216 if (y<0 || y>ysize-1) continue;
1217 if (bymin > y) bymin=y; /* in the worst case an extra line */
1218 if (bymax < y) bymax=y;
1222 if ( lx >= 0 && (wasIn = INSIDE(lx, y)) ) {
1225 while(INSIDE(lx, y) && lx > 0) {
1231 if (bxmin > lx) bxmin = lx;
1232 while(x <= xsize-1) {
1233 /* printf("x=%d\n",x); */
1237 /* case 1: was inside, am still inside */
1240 /* case 2: was inside, am no longer inside: just found the
1241 right edge of a span */
1242 ST_STACK(direction, dadLx, dadRx, lx, (x-1), y);
1244 if (bxmax < x) bxmax = x;
1248 if (x > rx) goto EXT;
1251 /* case 3: Wasn't inside, am now: just found the start of a new run */
1255 /* case 4: Wasn't inside, still isn't */
1260 EXT: /* out of loop */
1262 /* hit an edge of the frame buffer while inside a run */
1263 ST_STACK(direction, dadLx, dadRx, lx, (x-1), y);
1264 if (bxmax < x) bxmax = x;
1279 =item i_flood_fill(im, seedx, seedy, color)
1282 =synopsis i_flood_fill(im, 50, 50, &color);
1284 Flood fills the 4-connected region starting from the point (seedx,
1285 seedy) with I<color>.
1287 Returns false if (seedx, seedy) are outside the image.
1293 i_flood_fill(i_img *im, int seedx, int seedy, const i_color *dcol) {
1294 int bxmin, bxmax, bymin, bymax;
1295 struct i_bitmap *btm;
1299 if (seedx < 0 || seedx >= im->xsize ||
1300 seedy < 0 || seedy >= im->ysize) {
1301 i_push_error(0, "i_flood_cfill: Seed pixel outside of image");
1305 btm = i_flood_fill_low(im, seedx, seedy, &bxmin, &bxmax, &bymin, &bymax);
1307 for(y=bymin;y<=bymax;y++)
1308 for(x=bxmin;x<=bxmax;x++)
1309 if (btm_test(btm,x,y))
1310 i_ppix(im,x,y,dcol);
1316 =item i_flood_cfill(im, seedx, seedy, fill)
1319 =synopsis i_flood_cfill(im, 50, 50, fill);
1321 Flood fills the 4-connected region starting from the point (seedx,
1322 seedy) with I<fill>.
1324 Returns false if (seedx, seedy) are outside the image.
1330 i_flood_cfill(i_img *im, int seedx, int seedy, i_fill_t *fill) {
1331 int bxmin, bxmax, bymin, bymax;
1332 struct i_bitmap *btm;
1338 if (seedx < 0 || seedx >= im->xsize ||
1339 seedy < 0 || seedy >= im->ysize) {
1340 i_push_error(0, "i_flood_cfill: Seed pixel outside of image");
1344 btm = i_flood_fill_low(im, seedx, seedy, &bxmin, &bxmax, &bymin, &bymax);
1346 if (im->bits == i_8_bits && fill->fill_with_color) {
1347 /* bxmax/bxmin are inside the image, hence this won't overflow */
1348 i_color *line = mymalloc(sizeof(i_color) * (bxmax - bxmin)); /* checked 5jul05 tonyc */
1349 i_color *work = NULL;
1351 work = mymalloc(sizeof(i_color) * (bxmax - bxmin)); /* checked 5jul05 tonyc */
1353 for(y=bymin; y<=bymax; y++) {
1356 while (x < bxmax && !btm_test(btm, x, y)) {
1359 if (btm_test(btm, x, y)) {
1361 while (x < bxmax && btm_test(btm, x, y)) {
1364 if (fill->combine) {
1365 i_glin(im, start, x, y, line);
1366 (fill->fill_with_color)(fill, start, y, x-start, im->channels,
1368 (fill->combine)(line, work, im->channels, x-start);
1371 (fill->fill_with_color)(fill, start, y, x-start, im->channels,
1374 i_plin(im, start, x, y, line);
1383 /* bxmax/bxmin are inside the image, hence this won't overflow */
1384 i_fcolor *line = mymalloc(sizeof(i_fcolor) * (bxmax - bxmin)); /* checked 5jul05 tonyc */
1385 i_fcolor *work = NULL;
1387 work = mymalloc(sizeof(i_fcolor) * (bxmax - bxmin)); /* checked 5jul05 tonyc */
1389 for(y=bymin;y<=bymax;y++) {
1392 while (x < bxmax && !btm_test(btm, x, y)) {
1395 if (btm_test(btm, x, y)) {
1397 while (x < bxmax && btm_test(btm, x, y)) {
1400 if (fill->combinef) {
1401 i_glinf(im, start, x, y, line);
1402 (fill->fill_with_fcolor)(fill, start, y, x-start, im->channels,
1404 (fill->combinef)(line, work, im->channels, x-start);
1407 (fill->fill_with_fcolor)(fill, start, y, x-start, im->channels,
1410 i_plinf(im, start, x, y, line);