| line |
true |
false |
branch |
|
51
|
3957 |
3396 |
if (p1->y > p2->y) return 1; |
|
52
|
2845 |
551 |
if (p1->y < p2->y) return -1; |
|
59
|
2228 |
1824 |
if (p1->x > p2->x) return 1; |
|
60
|
1810 |
14 |
if (p1->x < p2->x) return -1; |
|
71
|
93277 |
0 |
if (t) return ( (y-l->y1)*l->x2 + (l->y2-y)*l->x1 )/t; |
|
80
|
57255 |
0 |
if (t) return ( (x-l->x1)*l->y2 + (l->x2-x)*l->y1 )/t; |
|
91
|
105 |
97 |
for (i = 0; i < count; ++i) |
|
97
|
105 |
97 |
for (i = 0; i < count; ++i) { |
|
100
|
1972 |
105 |
for(j = 0; j < p->count; j++) { |
|
108
|
94 |
1878 |
if (line->y1 == line->y2) |
|
131
|
105 |
97 |
for (i = 0; i < count; ++i) |
|
139
|
105 |
97 |
for (i = 0; i < count; ++i) { |
|
142
|
1972 |
105 |
for(j = 0; j < p->count; j++) { |
|
182
|
178565 |
1357 |
for(k=0; k
|
|
183
|
91266 |
87299 |
if (lset[k].maxy > minc && lset[k].miny < maxc) { |
|
|
4298 |
86968 |
if (lset[k].maxy > minc && lset[k].miny < maxc) { |
|
184
|
4298 |
0 |
if (lset[k].miny == lset[k].maxy) { |
|
203
|
2149 |
1357 |
for(k=0; k
|
|
206
|
0 |
2149 |
if (l->y1 == l->y2) { |
|
212
|
2071 |
78 |
0 : |
|
215
|
1050 |
3 |
(l->y1 > l->y2) ? -1 : 1 |
|
216
|
1053 |
1018 |
: |
|
217
|
1015 |
3 |
(l->y1 > l->y2) ? 1 : -1; |
|
218
|
15 |
2134 |
l->dir = l->y1 < l->y2 ? 1 : -1; |
|
224
|
0 |
2149 |
if (k+1 >= count) { |
|
230
|
0 |
2149 |
if (r->y1 == r->y2) { |
|
236
|
2090 |
59 |
0 : |
|
239
|
3 |
1038 |
(r->y1 > r->y2) ? -1 : 1 |
|
240
|
1041 |
1049 |
: |
|
241
|
3 |
1046 |
(r->y1 > r->y2) ? 1 : -1; |
|
242
|
2134 |
15 |
r->dir = r->y1 < r->y2 ? 1 : -1; |
|
253
|
188704 |
1484294 |
if (in>255) { return 255; } |
|
254
|
19200 |
1465094 |
else if (in>0) return in; |
|
268
|
1615480 |
4782 |
for(x=0; xxsize; x++) { |
|
271
|
4846440 |
1615480 |
for(ch=0; chchannels; ch++) |
|
306
|
520 |
22571 |
if (!line->updown) { |
|
311
|
16466 |
6105 |
l = lycross <= maxy && lycross >= miny; /* true if it enters through left side */ |
|
|
9968 |
6498 |
l = lycross <= maxy && lycross >= miny; /* true if it enters through left side */ |
|
312
|
16827 |
5744 |
r = rycross <= maxy && rycross >= miny; /* true if it enters through left side */ |
|
|
10619 |
6208 |
r = rycross <= maxy && rycross >= miny; /* true if it enters through left side */ |
|
320
|
9968 |
13123 |
if (l && r) |
|
|
4237 |
5731 |
if (l && r) |
|
321
|
2016 |
2221 |
return line->updown == 1 ? |
|
326
|
13123 |
5731 |
if (!l && !r) return (maxy-miny)*(maxx*2-p_eval_aty(line, miny)-p_eval_aty(line, maxy))/2.0; |
|
|
6741 |
6382 |
if (!l && !r) return (maxy-miny)*(maxx*2-p_eval_aty(line, miny)-p_eval_aty(line, maxy))/2.0; |
|
328
|
5731 |
6382 |
if (l && !r) |
|
|
5731 |
0 |
if (l && !r) |
|
330
|
3297 |
2434 |
trap_square(maxx-minx, maxy-miny, p_eval_aty(line, miny)-minx, p_eval_atx(line, minx)-miny) : |
|
334
|
6382 |
0 |
if (!l && r) { |
|
|
6382 |
0 |
if (!l && r) { |
|
335
|
3194 |
3188 |
int r = line->updown == 1 ? |
|
394
|
282359 |
7923 |
for(cpix=startpix; cpix<=stoppix; cpix++) { |
|
402
|
11470 |
270889 |
A = lt ? pixel_coverage(l, cpix*16, cpix*16+16, miny, maxy) : 0; |
|
403
|
270889 |
11470 |
B = lt ? 0 : 16*(maxy-miny); |
|
404
|
11621 |
270738 |
C = rt ? pixel_coverage(r, cpix*16, cpix*16+16, miny, maxy) : 0; |
|
465
|
0 |
99 |
if (count < 1) { |
|
470
|
107 |
97 |
for (k = 0; k < count; ++k) { |
|
471
|
2 |
105 |
if (polys[k].count < 3) { |
|
477
|
105 |
97 |
for (k = 0; k < count; ++k) { |
|
480
|
1972 |
105 |
for(i = 0; i < p->count; i++) { |
|
510
|
1875 |
97 |
for(i=0; i
|
|
522
|
518 |
1357 |
if (pset[i].y == pset[i+1].y) { |
|
550
|
4298 |
1357 |
for (k = 0; k < clc; ++k) { |
|
552
|
2006 |
2292 |
if (line->miny > miny) |
|
554
|
1989 |
2309 |
if (line->maxy < maxy) |
|
560
|
6463 |
1357 |
for(cscl=startscan; cscl
|
|
566
|
6223 |
240 |
if (mode == i_pfm_evenodd) { |
|
567
|
7603 |
6223 |
for(k=0; k
|
|
574
|
320 |
240 |
while (k < clc) { |
|
579
|
560 |
240 |
while (k < clc && acc) { |
|
|
480 |
80 |
while (k < clc && acc) { |
|
583
|
320 |
0 |
if (acc == 0) { |
|
589
|
5322 |
1141 |
if (16*coarse(tempy) == tempy) { |
|
603
|
83 |
14 |
if (16*coarse(tempy) != tempy) |
|
681
|
58408 |
0 |
while (left < im->xsize && ss->line[left] <= 0) |
|
|
57785 |
623 |
while (left < im->xsize && ss->line[left] <= 0) |
|
683
|
623 |
0 |
if (left < im->xsize) { |
|
687
|
54197 |
623 |
while (/* right > left && */ ss->line[right-1] <= 0) |
|
691
|
57518 |
623 |
for (x = left; x < right; ++x) { |