| line |
true |
false |
branch |
|
36
|
0 |
0 |
if (fabs(y1 - y0) < 0.5) { |
|
41
|
0 |
0 |
if (!edge) { |
|
46
|
0 |
0 |
if (y0 > y1) { |
|
57
|
0 |
0 |
if (edge->y_min > edge->y_max) { |
|
82
|
0 |
0 |
if (!et) { |
|
92
|
0 |
0 |
for (i = 0; i < path->seg_count; i++) { |
|
103
|
0 |
0 |
if (has_current) { |
|
108
|
0 |
0 |
if (edge && edge->y_min >= y_min && edge->y_min <= y_max) { |
|
|
0 |
0 |
if (edge && edge->y_min >= y_min && edge->y_min <= y_max) { |
|
|
0 |
0 |
if (edge && edge->y_min >= y_min && edge->y_min <= y_max) { |
|
113
|
0 |
0 |
} else if (edge) { |
|
121
|
0 |
0 |
if (has_current) { |
|
126
|
0 |
0 |
if (edge && edge->y_min >= y_min && edge->y_min <= y_max) { |
|
|
0 |
0 |
if (edge && edge->y_min >= y_min && edge->y_min <= y_max) { |
|
|
0 |
0 |
if (edge && edge->y_min >= y_min && edge->y_min <= y_max) { |
|
131
|
0 |
0 |
} else if (edge) { |
|
154
|
0 |
0 |
if (*ael == NULL || edge->x < (*ael)->x) { |
|
|
0 |
0 |
if (*ael == NULL || edge->x < (*ael)->x) { |
|
161
|
0 |
0 |
while (curr->next && curr->next->x < edge->x) { |
|
|
0 |
0 |
while (curr->next && curr->next->x < edge->x) { |
|
175
|
0 |
0 |
if (!*ael || !(*ael)->next) { |
|
|
0 |
0 |
if (!*ael || !(*ael)->next) { |
|
183
|
0 |
0 |
while (curr) { |
|
198
|
0 |
0 |
if (y < 0 || y >= ctx->height) { |
|
|
0 |
0 |
if (y < 0 || y >= ctx->height) { |
|
202
|
0 |
0 |
x0 = CLAMP(x0, 0, ctx->width); |
|
203
|
0 |
0 |
x1 = CLAMP(x1, 0, ctx->width); |
|
207
|
0 |
0 |
for (x = x0; x < x1; x++) { |
|
208
|
0 |
0 |
if (ctx->has_clip && ctx->clip_mask) { |
|
|
0 |
0 |
if (ctx->has_clip && ctx->clip_mask) { |
|
209
|
0 |
0 |
if (ctx->clip_mask[y * ctx->width + x] == 0) { |
|
236
|
0 |
0 |
if (pdfmake_path_get_bounds(path, &x_min, &y_min, &x_max, &y_max) != PDFMAKE_RENDER_OK) { |
|
243
|
0 |
0 |
if (iy_min > iy_max) { |
|
248
|
0 |
0 |
if (!et) { |
|
254
|
0 |
0 |
for (y = iy_min; y <= iy_max; y++) { |
|
258
|
0 |
0 |
while (et[idx]) { |
|
272
|
0 |
0 |
while (curr) { |
|
273
|
0 |
0 |
if (winding == 0 && curr->dir != 0) { |
|
|
0 |
0 |
if (winding == 0 && curr->dir != 0) { |
|
277
|
0 |
0 |
if (winding == 0 && span_start >= 0) { |
|
|
0 |
0 |
if (winding == 0 && span_start >= 0) { |
|
288
|
0 |
0 |
while (curr) { |
|
290
|
0 |
0 |
if (y >= curr->y_max) { |
|
292
|
0 |
0 |
if (prev) { |
|
311
|
0 |
0 |
while (ael) { |
|
337
|
0 |
0 |
if (pdfmake_path_get_bounds(path, &x_min, &y_min, &x_max, &y_max) != PDFMAKE_RENDER_OK) { |
|
344
|
0 |
0 |
if (iy_min > iy_max) { |
|
349
|
0 |
0 |
if (!et) { |
|
355
|
0 |
0 |
for (y = iy_min; y <= iy_max; y++) { |
|
359
|
0 |
0 |
while (et[idx]) { |
|
372
|
0 |
0 |
while (curr) { |
|
373
|
0 |
0 |
if (parity == 0) { |
|
377
|
0 |
0 |
if (parity == 0 && span_start >= 0) { |
|
|
0 |
0 |
if (parity == 0 && span_start >= 0) { |
|
388
|
0 |
0 |
while (curr) { |
|
390
|
0 |
0 |
if (y >= curr->y_max) { |
|
391
|
0 |
0 |
if (prev) { |
|
407
|
0 |
0 |
while (ael) { |
|
424
|
0 |
0 |
if (!ctx || !path) { |
|
|
0 |
0 |
if (!ctx || !path) { |
|
428
|
0 |
0 |
if (pdfmake_path_is_empty(path)) { |
|
434
|
0 |
0 |
if (!flat) { |
|
440
|
0 |
0 |
if (rule == PDFMAKE_FILL_EVENODD) { |
|
455
|
0 |
0 |
if (!ctx) { |
|
471
|
0 |
0 |
if (!ctx) { |