- start of external Imager API access:
[imager.git] / polygon.c
CommitLineData
92bda632 1#include "imager.h"
9982a307
AMH
2#include "draw.h"
3#include "log.h"
4
5
6#define IMTRUNC(x) ((int)((x)*16))
7
8#define coarse(x) ((x)/16)
9#define fine(x) ((x)%16)
10
11#define POLY_DEB(x)
12
13
14
15typedef int pcord;
16
17typedef struct {
18 int n;
19 pcord x,y;
20} p_point;
21
22typedef struct {
23 int n;
24 pcord x1,y1;
25 pcord x2,y2;
26 pcord miny,maxy;
27 pcord minx,maxx;
28 int updown; /* -1 means down, 0 vertical, 1 up */
29} p_line;
30
31typedef struct {
32 int n;
33 double x;
34} p_slice;
35
36typedef struct {
37 int start;
38 int stop;
39} ss_pair;
40
41typedef struct {
42 int *line; /* temporary buffer for scanline */
43 int linelen; /* length of scanline */
44 ss_pair *ss_list; /* list of start stop linepairs */
45 int ssnext; /* index of the next pair to use */
46 int sslen; /* maximum number of start stop pairs */
47} ss_scanline;
48
49
50
51
52
53
54
55
56static
57int
58p_compy(const p_point *p1, const p_point *p2) {
59 if (p1->y > p2->y) return 1;
60 if (p1->y < p2->y) return -1;
61 return 0;
62}
63
64static
65int
66p_compx(const p_slice *p1, const p_slice *p2) {
67 if (p1->x > p2->x) return 1;
68 if (p1->x < p2->x) return -1;
69 return 0;
70}
71
72/* Change this to int? and round right goddamn it! */
73
74static
75double
76p_eval_aty(p_line *l, pcord y) {
77 int t;
78 t=l->y2-l->y1;
79 if (t) return ( (y-l->y1)*l->x2 + (l->y2-y)*l->x1 )/t;
80 return (l->x1+l->x2)/2.0;
81}
82
83static
84double
85p_eval_atx(p_line *l, pcord x) {
86 int t;
87 t = l->x2-l->x1;
88 if (t) return ( (x-l->x1)*l->y2 + (l->x2-x)*l->y1 )/t;
89 return (l->y1+l->y2)/2.0;
90}
91
92static
93p_line *
94line_set_new(double *x, double *y, int l) {
95 int i;
96 p_line *lset = mymalloc(sizeof(p_line) * l);
97
98 for(i=0; i<l; i++) {
99 lset[i].n=i;
100 lset[i].x1 = IMTRUNC(x[i]);
101 lset[i].y1 = IMTRUNC(y[i]);
102 lset[i].x2 = IMTRUNC(x[(i+1)%l]);
103 lset[i].y2 = IMTRUNC(y[(i+1)%l]);
b33c08f8
TC
104 lset[i].miny=i_min(lset[i].y1,lset[i].y2);
105 lset[i].maxy=i_max(lset[i].y1,lset[i].y2);
106 lset[i].minx=i_min(lset[i].x1,lset[i].x2);
107 lset[i].maxx=i_max(lset[i].x1,lset[i].x2);
9982a307
AMH
108 }
109 return lset;
110}
111
112static
113p_point *
114point_set_new(double *x, double *y, int l) {
115 int i;
116 p_point *pset = mymalloc(sizeof(p_point) * l);
117
118 for(i=0; i<l; i++) {
119 pset[i].n=i;
120 pset[i].x=IMTRUNC(x[i]);
121 pset[i].y=IMTRUNC(y[i]);
122 }
123 return pset;
124}
125
a659442a 126#if 0
9982a307
AMH
127static
128void
129p_line_dump(p_line *l) {
130 printf("%d (%d,%d)->(%d,%d) [%d-%d,%d-%d]\n", l->n, l->x1, l->y1, l->x2, l->y2,
131 l->minx, l->maxx, l->miny, l->maxy);
132}
a659442a 133#endif
9982a307
AMH
134
135static
136void
137ss_scanline_reset(ss_scanline *ss) {
138 ss->ssnext = 0;
139 memset(ss->line, 0, sizeof(int) * ss->linelen);
140}
141
142static
143void
144ss_scanline_init(ss_scanline *ss, int linelen, int linepairs) {
145 ss->line = mymalloc( sizeof(int) * linelen );
146 ss->linelen = linelen;
147 ss->ss_list = mymalloc( sizeof(ss_pair) * linepairs );
148 ss->sslen = linepairs;
149 ss_scanline_reset(ss);
150}
151
d0e7bfee
AMH
152static
153void
154ss_scanline_exorcise(ss_scanline *ss) {
155 myfree(ss->line);
156 myfree(ss->ss_list);
157}
158
159
160
9982a307
AMH
161
162/* returns the number of matches */
163
164static
165int
fe24d684
AMH
166lines_in_interval(p_line *lset, int l, p_slice *tllist, pcord minc, pcord maxc) {
167 int k;
168 int count = 0;
169 for(k=0; k<l; k++) {
170 if (lset[k].maxy > minc && lset[k].miny < maxc) {
171 if (lset[k].miny == lset[k].maxy) {
172 POLY_DEB( printf(" HORIZONTAL - skipped\n") );
173 } else {
174 tllist[count].x=p_eval_aty(&lset[k],(minc+maxc)/2.0 );
175 tllist[count].n=k;
176 count++;
177 }
178 }
179 }
180 return count;
181}
182
a659442a 183#if 0
fe24d684
AMH
184static
185int
186lines_in_interval_old(p_line *lset, int l, p_slice *tllist, pcord cc) {
9982a307
AMH
187 int k;
188 int count = 0;
189 for(k=0; k<l; k++) {
190 if (cc >= lset[k].miny && cc <= lset[k].maxy) {
191 if (lset[k].miny == lset[k].maxy) {
192 POLY_DEB( printf(" HORIZONTAL - skipped\n") );
193 }
194 else {
195 tllist[count].x=p_eval_aty(&lset[k],cc);
196 tllist[count].n=k;
197 count++;
198 }
199 }
200 }
201 return count;
202}
a659442a 203#endif
9982a307
AMH
204
205/* marks the up variable for all lines in a slice */
206
207static
208void
209mark_updown_slices(p_line *lset, p_slice *tllist, int count) {
210 p_line *l, *r;
211 int k;
212 for(k=0; k<count; k+=2) {
213 l = lset + tllist[k].n;
9982a307
AMH
214
215 if (l->y1 == l->y2) {
216 mm_log((1, "mark_updown_slices: horizontal line being marked: internal error!\n"));
217 exit(3);
218 }
219
9982a307
AMH
220 l->updown = (l->x1 == l->x2) ?
221 0 :
222 (l->x1 > l->x2)
223 ?
224 (l->y1 > l->y2) ? -1 : 1
225 :
226 (l->y1 > l->y2) ? 1 : -1;
227
d0e7bfee
AMH
228 POLY_DEB( printf("marking left line %d as %s(%d)\n", l->n,
229 l->updown ? l->updown == 1 ? "up" : "down" : "vert", l->updown, l->updown)
230 );
231
232 if (k+1 >= count) {
233 mm_log((1, "Invalid polygon spec, odd number of line crossings.\n"));
234 return;
235 }
236
237 r = lset + tllist[k+1].n;
238 if (r->y1 == r->y2) {
239 mm_log((1, "mark_updown_slices: horizontal line being marked: internal error!\n"));
240 exit(3);
241 }
242
9982a307
AMH
243 r->updown = (r->x1 == r->x2) ?
244 0 :
245 (r->x1 > r->x2)
246 ?
247 (r->y1 > r->y2) ? -1 : 1
248 :
249 (r->y1 > r->y2) ? 1 : -1;
250
d0e7bfee
AMH
251 POLY_DEB( printf("marking right line %d as %s(%d)\n", r->n,
252 r->updown ? r->updown == 1 ? "up" : "down" : "vert", r->updown, r->updown)
9982a307
AMH
253 );
254 }
255}
256
257
258
259static
260unsigned char
261saturate(int in) {
262 if (in>255) { return 255; }
263 else if (in>0) return in;
264 return 0;
265}
266
43c5dacb 267typedef void (*scanline_flusher)(i_img *im, ss_scanline *ss, int y, void *ctx);
9982a307
AMH
268
269/* This function must be modified later to do proper blending */
270
b33c08f8 271static void
43c5dacb 272scanline_flush(i_img *im, ss_scanline *ss, int y, void *ctx) {
9982a307
AMH
273 int x, ch, tv;
274 i_color t;
43c5dacb 275 i_color *val = (i_color *)ctx;
9982a307
AMH
276 for(x=0; x<im->xsize; x++) {
277 tv = saturate(ss->line[x]);
278 i_gpix(im, x, y, &t);
279 for(ch=0; ch<im->channels; ch++)
280 t.channel[ch] = tv/255.0 * val->channel[ch] + (1.0-tv/255.0) * t.channel[ch];
281 i_ppix(im, x, y, &t);
282 }
283}
284
285
286
287static
288int
289trap_square(pcord xlen, pcord ylen, double xl, double yl) {
290 POLY_DEB( printf("trap_square: %d %d %.2f %.2f\n", xlen, ylen, xl, yl) );
291 return xlen*ylen-(xl*yl)/2.0;
292}
293
294
295/*
296 pixel_coverage calculates the 'left side' pixel coverage of a pixel that is
297 within the min/max ranges. The shape always corresponds to a square with some
298 sort of a triangle cut from it (which can also yield a triangle).
299*/
300
301
302static
303int
304pixel_coverage(p_line *line, pcord minx, pcord maxx, pcord miny, pcord maxy) {
305 double lycross, rycross;
306 int l, r;
307
9982a307
AMH
308 if (!line->updown) {
309 l = r = 0;
310 } else {
311 lycross = p_eval_atx(line, minx);
312 rycross = p_eval_atx(line, maxx);
313 l = lycross <= maxy && lycross >= miny; /* true if it enters through left side */
314 r = rycross <= maxy && rycross >= miny; /* true if it enters through left side */
315 }
316 POLY_DEB(
317 printf("%4s(%+d): ", line->updown ? line->updown == 1 ? "up" : "down" : "vert", line->updown);
318 printf("(%2d,%2d) [%3d-%3d, %3d-%3d] lycross=%.2f rycross=%.2f", coarse(minx), coarse(miny), minx, maxx, miny, maxy, lycross, rycross);
319 printf(" l=%d r=%d\n", l, r)
320 );
321
322 if (l && r)
323 return line->updown == 1 ?
324 (double)(maxx-minx) * (2.0*maxy-lycross-rycross)/2.0 /* up case */
325 :
326 (double)(maxx-minx) * (lycross+rycross-2*miny)/2.0; /* down case */
327
328 if (!l && !r) return (maxy-miny)*(maxx*2-p_eval_aty(line, miny)-p_eval_aty(line, maxy))/2.0;
329
330 if (l && !r)
331 return line->updown == 1 ?
332 trap_square(maxx-minx, maxy-miny, p_eval_aty(line, miny)-minx, p_eval_atx(line, minx)-miny) :
333 trap_square(maxx-minx, maxy-miny, p_eval_aty(line, maxy)-minx, maxy-p_eval_atx(line, minx));
334
335
336 if (!l && r) {
337 int r = line->updown == 1 ?
338 (maxx-p_eval_aty(line, maxy))*(maxy-p_eval_atx(line, maxx))/2.0 :
339 (maxx-p_eval_aty(line, miny))*(p_eval_atx(line, maxx)-miny)/2.0;
340 return r;
341 }
342}
343
344
345
346
347
348/*
349 handle the scanline slice in three steps
350
351 1. Where only the left edge is inside a pixel
352 2a. Where both left and right edge are inside a pixel
353 2b. Where neither left or right edge are inside a pixel
354 3. Where only the right edge is inside a pixel
355*/
356
357static
358void
359render_slice_scanline(ss_scanline *ss, int y, p_line *l, p_line *r) {
360
361 pcord miny, maxy; /* y bounds in fine coordinates */
362 pcord lminx, lmaxx; /* left line min/max within y bounds in fine coords */
363 pcord rminx, rmaxx; /* right line min/max within y bounds in fine coords */
364 int cpix; /* x-coordinate of current pixel */
365 int thin; /* boolean for thin/thick segment */
366 int startpix; /* temporary variable for "start of this interval" */
367 int stoppix; /* temporary variable for "end of this interval" */
9982a307
AMH
368
369 /* Find the y bounds of scanline_slice */
370
b33c08f8
TC
371 maxy = i_min( l->maxy, r->maxy );
372 miny = i_max( l->miny, r->miny );
9982a307 373
b33c08f8
TC
374 maxy = i_min( maxy, (y+1)*16 );
375 miny = i_max( miny, y*16 );
9982a307 376
b33c08f8
TC
377 lminx = i_min( p_eval_aty(l, maxy), p_eval_aty(l, miny) );
378 lmaxx = i_max( p_eval_aty(l, maxy), p_eval_aty(l, miny) );
9982a307 379
b33c08f8
TC
380 rminx = i_min( p_eval_aty(r, maxy), p_eval_aty(r, miny) );
381 rmaxx = i_max( p_eval_aty(r, maxy), p_eval_aty(r, miny) );
9982a307
AMH
382
383 thin = coarse(lmaxx) >= coarse(rminx);
384
b33c08f8
TC
385 startpix = i_max( coarse(lminx), 0 );
386 stoppix = i_min( coarse(rmaxx-1), ss->linelen-1 );
9982a307
AMH
387
388 for(cpix=startpix; cpix<=stoppix; cpix++) {
389 int lt = coarse(lmaxx-1) >= cpix;
390 int rt = coarse(rminx) <= cpix;
391
392 int A, B, C;
393
394 POLY_DEB( printf("(%d,%d) lt=%d rt=%d\n", cpix, y, lt, rt) );
395
396 A = lt ? pixel_coverage(l, cpix*16, cpix*16+16, miny, maxy) : 0;
397 B = lt ? 0 : 16*(maxy-miny);
398 C = rt ? pixel_coverage(r, cpix*16, cpix*16+16, miny, maxy) : 0;
399
400 POLY_DEB( printf("A=%d B=%d C=%d\n", A, B, C) );
401
402 ss->line[cpix] += A+B-C;
403
404 }
405
406}
407
408
a659442a 409#if 0
9982a307
AMH
410static
411void
412render_slice_scanline_old(ss_scanline *ss, int y, p_line *l, p_line *r) {
413
414 pcord miny, maxy; /* y bounds in fine coordinates */
415 pcord lminx, lmaxx; /* left line min/max within y bounds in fine coords */
416 pcord rminx, rmaxx; /* right line min/max within y bounds in fine coords */
417 int cpix; /* x-coordinate of current pixel */
418 int thin; /* boolean for thin/thick segment */
419 int startpix; /* temporary variable for "start of this interval" */
420 int stoppix; /* temporary variable for "end of this interval" */
9982a307
AMH
421
422 /* Find the y bounds of scanline_slice */
423
b33c08f8
TC
424 maxy = i_min( l->maxy, r->maxy );
425 miny = i_max( l->miny, r->miny );
9982a307 426
b33c08f8
TC
427 maxy = i_min( maxy, (y+1)*16 );
428 miny = i_max( miny, y*16 );
9982a307 429
b33c08f8
TC
430 lminx = i_min( p_eval_aty(l, maxy), p_eval_aty(l, miny) );
431 lmaxx = i_max( p_eval_aty(l, maxy), p_eval_aty(l, miny) );
9982a307 432
b33c08f8
TC
433 rminx = i_min( p_eval_aty(r, maxy), p_eval_aty(r, miny) );
434 rmaxx = i_max( p_eval_aty(r, maxy), p_eval_aty(r, miny) );
9982a307
AMH
435
436 thin = coarse(lmaxx) >= coarse(rminx);
437
438
439 /* First step */
440 startpix = coarse(lminx); /* includes tricky starting pixel */
b33c08f8 441 stoppix = i_min(coarse(lmaxx), coarse(rminx) ); /* last pixel is tricky */
9982a307
AMH
442
443 /* handle start pixel */
444
445 cpix = startpix;
446 if (cpix < stoppix) {
447 ss->line[cpix] += pixel_coverage(l, cpix*16, cpix*16+16, miny, maxy);
448 printf("%2d: step1 - start pixel\n", cpix);
449 }
450
451 for(cpix=startpix+1; cpix<stoppix; cpix++) {
452 printf("%2d: step1 pixel\n", cpix);
453 ss->line[cpix] += l->updown == 1 ?
454 8.0 * (2*maxy-p_eval_atx(l, 16*cpix)-p_eval_atx(l, 16*cpix+16)) /* up case */
455 :
456 8.0 * (p_eval_atx(l, 16*cpix)+p_eval_atx(l, 16*cpix+16)-2*miny); /* down case */
457 }
458
459
460 /* handle stop pixel */
461
462 if (thin) { /* step 2a */
463 startpix = coarse(rminx);
464 stoppix = coarse(lmaxx+15); /* one more than needed */
465
466 for(cpix=startpix; cpix<stoppix; cpix++) {
467 printf("%2d: step2a pixel\n", cpix);
468 ss->line[cpix] +=
469 pixel_coverage(l, cpix*16, cpix*16+16, miny, maxy)
b33c08f8 470 +(cpix*16+16-i_min(cpix*16+16, l->maxx))*(maxy-miny)
9982a307
AMH
471 -pixel_coverage(r, cpix*16, cpix*16+16, miny, maxy);
472 }
473 } else { /* step 2b */
474 stoppix = coarse(rminx);
475 for(/* cpix already correct */; cpix<stoppix; cpix++) {
476 printf("%2d: step2b pixel\n", cpix);
477 ss->line[cpix] += 16.0*(maxy-miny);
478 }
479 }
480
481 /* step 3 */
482
b33c08f8 483 cpix = i_max(coarse(rminx), coarse(lmaxx+15));
9982a307
AMH
484 stoppix = coarse(rmaxx-15);
485
486 printf("step3 from %d to %d\n", cpix, stoppix);
487
488 for(; cpix<stoppix; cpix++) {
489 printf("%2d: step3 pixel\n", cpix);
490 ss->line[cpix] += 0+
491 (l->updown == 1 ?
492 8.0 * (2*maxy-p_eval_atx(r, 16*cpix)-p_eval_atx(r, 16*cpix+16)) /* up case */
493 :
494 8.0 * (p_eval_atx(r, 16*cpix)+p_eval_atx(r, 16*cpix+16)-2*miny)); /* down case */
495 }
496
497 ss->line[cpix] += (16.0)*(maxy-miny) - pixel_coverage(r, cpix*16, cpix*16+16, miny, maxy);
498}
a659442a 499#endif
9982a307
AMH
500
501/* Antialiasing polygon algorithm
502 specs:
503 1. only nice polygons - no crossovers
504 2. 1/16 pixel resolution
505 3. full antialiasing ( complete spectrum of blends )
506 4. uses hardly any memory
507 5. no subsampling phase
508
509
510 Algorithm outline:
511 1. Split into vertical intervals.
512 2. handle each interval
513
514 For each interval we must:
515 1. find which lines are in it
516 2. order the lines from in increasing x order.
517 since we are assuming no crossovers it is sufficent
518 to check a single point on each line.
519*/
520
521/*
522 Definitions:
523
524 1. Interval: A vertical segment in which no lines cross nor end.
525 2. Scanline: A physical line, contains 16 subpixels in the horizontal direction
526 3. Slice: A start stop line pair.
527
528 */
529
530
b33c08f8 531static void
43c5dacb 532i_poly_aa_low(i_img *im, int l, double *x, double *y, void *ctx, scanline_flusher flusher) {
9982a307
AMH
533 int i ,k; /* Index variables */
534 int clc; /* Lines inside current interval */
9982a307
AMH
535 pcord tempy;
536 int cscl; /* Current scanline */
537
538 ss_scanline templine; /* scanline accumulator */
539 p_point *pset; /* List of points in polygon */
540 p_line *lset; /* List of lines in polygon */
541 p_slice *tllist; /* List of slices */
542
43c5dacb 543 mm_log((1, "i_poly_aa(im %p, l %d, x %p, y %p, ctx %p, flusher %p)\n", im, l, x, y, ctx, flusher));
d0e7bfee
AMH
544
545 for(i=0; i<l; i++) {
546 mm_log((2, "(%.2f, %.2f)\n", x[i], y[i]));
547 }
548
549
550 POLY_DEB(
551 fflush(stdout);
552 setbuf(stdout, NULL);
553 );
9982a307
AMH
554
555 tllist = mymalloc(sizeof(p_slice)*l);
556
557 ss_scanline_init(&templine, im->xsize, l);
558
559 pset = point_set_new(x, y, l);
560 lset = line_set_new(x, y, l);
561
562
563 qsort(pset, l, sizeof(p_point), (int(*)(const void *,const void *))p_compy);
564
565 POLY_DEB(
566 for(i=0;i<l;i++) {
567 printf("%d [ %d ] (%d , %d) -> (%d , %d) yspan ( %d , %d )\n",
568 i, lset[i].n, lset[i].x1, lset[i].y1, lset[i].x2, lset[i].y2, lset[i].miny, lset[i].maxy);
569 }
570 printf("MAIN LOOP\n\n");
571 );
572
573
574 /* loop on intervals */
575 for(i=0; i<l-1; i++) {
b33c08f8
TC
576 int startscan = i_max( coarse(pset[i].y), 0);
577 int stopscan = i_min( coarse(pset[i+1].y+15), im->ysize);
9982a307 578
fe24d684
AMH
579 if (pset[i].y == pset[i+1].y) {
580 POLY_DEB( printf("current slice thickness = 0 => skipping\n") );
581 continue;
582 }
583
9982a307
AMH
584 POLY_DEB(
585 printf("current slice is %d: %d to %d ( cpoint %d ) scanlines %d to %d\n",
586 i, pset[i].y, pset[i+1].y, cc, startscan, stopscan)
587 );
588
9982a307 589
fe24d684 590 clc = lines_in_interval(lset, l, tllist, pset[i].y, pset[i+1].y);
9982a307
AMH
591 qsort(tllist, clc, sizeof(p_slice), (int(*)(const void *,const void *))p_compx);
592
593 mark_updown_slices(lset, tllist, clc);
594
595 POLY_DEB( printf("Interval contains %d lines\n", clc) );
596
597 for(k=0; k<clc; k++) {
9982a307
AMH
598 POLY_DEB(
599 printf("%d: line #%2d: (%2d, %2d)->(%2d, %2d) (%2d/%2d, %2d/%2d) -> (%2d/%2d, %2d/%2d) alignment=%s\n",
600 k, lno, ln->x1, ln->y1, ln->x2, ln->y2,
601 coarse(ln->x1), fine(ln->x1),
602 coarse(ln->y1), fine(ln->y1),
603 coarse(ln->x2), fine(ln->x2),
604 coarse(ln->y2), fine(ln->y2),
605 ln->updown == 0 ? "vert" : ln->updown == 1 ? "up" : "down")
606 );
607 }
608 for(cscl=startscan; cscl<stopscan; cscl++) {
b33c08f8 609 tempy = i_min(cscl*16+16, pset[i+1].y);
9982a307
AMH
610 POLY_DEB( printf("evaluating scan line %d \n", cscl) );
611 for(k=0; k<clc-1; k+=2) {
fe24d684 612 POLY_DEB( printf("evaluating slice %d\n", k) );
9982a307
AMH
613 render_slice_scanline(&templine, cscl, lset+tllist[k].n, lset+tllist[k+1].n);
614 }
615 if (16*coarse(tempy) == tempy) {
616 POLY_DEB( printf("flushing scan line %d\n", cscl) );
43c5dacb 617 flusher(im, &templine, cscl, ctx);
9982a307
AMH
618 ss_scanline_reset(&templine);
619 }
620 /*
621 else {
622 scanline_flush(im, &templine, cscl, val);
623 ss_scanline_reset(&templine);
624 return 0;
625 }
626 */
627 }
628 } /* Intervals */
629 if (16*coarse(tempy) != tempy)
43c5dacb 630 flusher(im, &templine, cscl-1, ctx);
9982a307 631
d0e7bfee
AMH
632 ss_scanline_exorcise(&templine);
633 myfree(pset);
634 myfree(lset);
635 myfree(tllist);
636
637} /* Function */
43c5dacb
TC
638
639void
640i_poly_aa(i_img *im, int l, double *x, double *y, i_color *val) {
641 i_poly_aa_low(im, l, x, y, val, scanline_flush);
642}
643
644struct poly_cfill_state {
645 i_color *fillbuf;
646 i_color *linebuf;
647 int *cover;
648 i_fill_t *fill;
649};
650
b33c08f8 651static void
43c5dacb
TC
652scanline_flush_cfill(i_img *im, ss_scanline *ss, int y, void *ctx) {
653 int x, ch, tv;
43c5dacb
TC
654 int pos;
655 int left, right;
656 struct poly_cfill_state *state = (struct poly_cfill_state *)ctx;
657 i_color *fillbuf = state->fillbuf;
658 i_color *line = state->linebuf;
659
660 left = 0;
661 while (left < im->xsize && ss->line[left] <= 0)
662 ++left;
663 if (left < im->xsize) {
664 right = im->xsize;
665 /* since going from the left found something, moving from the
666 right should */
667 while (/* right > left && */ ss->line[right-1] <= 0)
668 --right;
669
670 (state->fill->fill_with_color)(state->fill, left, y, right-left,
671 im->channels, fillbuf);
672 i_glin(im, left, right, y, line);
673 pos = 0;
674 if (state->fill->combine) {
675 for (x = left; x < right; ++x) {
676 tv = saturate(ss->line[x]);
677 fillbuf[pos].channel[3] =
678 fillbuf[pos].channel[3] * tv / 255;
1bea77d7 679 pos++;
43c5dacb
TC
680 }
681 (state->fill->combine)(line, fillbuf, im->channels, right-left);
43c5dacb
TC
682 }
683 else {
684 for (x = left; x < right; ++x) {
685 tv = saturate(ss->line[x]);
686 if (tv) {
687 if (tv == 255) {
688 line[pos] = fillbuf[pos];
689 }
690 else {
691 i_color *to = line + pos;
692 i_color *from = fillbuf + pos;
693 for (ch = 0; ch < im->channels; ++ch) {
694 to->channel[ch] = (tv * from->channel[ch] +
695 (255 - tv) * to->channel[ch]) / 255;
696 }
697 }
698 }
699 pos++;
700 }
701 }
702 i_plin(im, left, right, y, line);
703 }
704}
705
706struct poly_cfill_state_f {
707 i_fcolor *fillbuf;
708 i_fcolor *linebuf;
709 int *cover;
710 i_fill_t *fill;
711};
712
b33c08f8 713static void
43c5dacb
TC
714scanline_flush_cfill_f(i_img *im, ss_scanline *ss, int y, void *ctx) {
715 int x, ch, tv;
716 int pos;
717 int left, right;
718 struct poly_cfill_state_f *state = (struct poly_cfill_state_f *)ctx;
719 i_fcolor *fillbuf = state->fillbuf;
720 i_fcolor *line = state->linebuf;
721
722 left = 0;
723 while (left < im->xsize && ss->line[left] <= 0)
724 ++left;
725 if (left < im->xsize) {
726 right = im->xsize;
727 /* since going from the left found something, moving from the
728 right should */
729 while (/* right > left && */ ss->line[right-1] <= 0)
730 --right;
731
732 (state->fill->fill_with_fcolor)(state->fill, left, y, right-left,
733 im->channels, fillbuf);
734 i_glinf(im, left, right, y, line);
735 pos = 0;
736 if (state->fill->combinef) {
737 for (x = left; x < right; ++x) {
738 tv = saturate(ss->line[x]);
739 fillbuf[pos].channel[3] =
740 fillbuf[pos].channel[3] * tv / 255;
1bea77d7 741 pos++;
43c5dacb
TC
742 }
743 (state->fill->combinef)(line, fillbuf, im->channels, right-left);
43c5dacb
TC
744 }
745 else {
746 for (x = left; x < right; ++x) {
747 tv = saturate(ss->line[x]);
748 if (tv) {
749 if (tv == 255) {
750 line[pos] = fillbuf[pos];
751 }
752 else {
753 i_fcolor *to = line + pos;
754 i_fcolor *from = fillbuf + pos;
755 for (ch = 0; ch < im->channels; ++ch) {
756 to->channel[ch] = (tv * from->channel[ch] +
757 (255 - tv) * to->channel[ch]) / 255;
758 }
759 }
760 }
761 pos++;
762 }
763 }
764 i_plinf(im, left, right, y, line);
765 }
766}
767
768void
769i_poly_aa_cfill(i_img *im, int l, double *x, double *y, i_fill_t *fill) {
770 if (im->bits == i_8_bits && fill->fill_with_color) {
771 struct poly_cfill_state ctx;
772 ctx.fillbuf = mymalloc(sizeof(i_color) * im->xsize * 2);
773 ctx.linebuf = ctx.fillbuf + im->xsize;
774 ctx.cover = mymalloc(sizeof(int) * im->xsize);
775 ctx.fill = fill;
776 i_poly_aa_low(im, l, x, y, &ctx, scanline_flush_cfill);
777 myfree(ctx.fillbuf);
778 myfree(ctx.cover);
779 }
780 else {
781 struct poly_cfill_state_f ctx;
782 ctx.fillbuf = mymalloc(sizeof(i_fcolor) * im->xsize * 2);
783 ctx.linebuf = ctx.fillbuf + im->xsize;
784 ctx.cover = mymalloc(sizeof(int) * im->xsize);
785 ctx.fill = fill;
786 i_poly_aa_low(im, l, x, y, &ctx, scanline_flush_cfill_f);
787 myfree(ctx.fillbuf);
788 myfree(ctx.cover);
789 }
790}