| line |
true |
false |
branch |
|
18
|
0 |
0 |
if (!path) { |
|
23
|
0 |
0 |
if (!path->segs) { |
|
44
|
0 |
0 |
if (!path) { |
|
56
|
0 |
0 |
if (!path) { |
|
73
|
0 |
0 |
if (path->seg_count >= path->seg_cap) { |
|
77
|
0 |
0 |
if (!new_segs) { |
|
91
|
0 |
0 |
if (!path) { |
|
95
|
0 |
0 |
if (path_ensure_capacity(path) < 0) { |
|
119
|
0 |
0 |
if (!path) { |
|
124
|
0 |
0 |
if (!path->has_current) { |
|
128
|
0 |
0 |
if (path_ensure_capacity(path) < 0) { |
|
150
|
0 |
0 |
if (!path) { |
|
155
|
0 |
0 |
if (!path->has_current) { |
|
157
|
0 |
0 |
if (err != PDFMAKE_RENDER_OK) { |
|
162
|
0 |
0 |
if (path_ensure_capacity(path) < 0) { |
|
186
|
0 |
0 |
if (!path) { |
|
190
|
0 |
0 |
if (!path->has_subpath) { |
|
194
|
0 |
0 |
if (path_ensure_capacity(path) < 0) { |
|
215
|
0 |
0 |
if (err != PDFMAKE_RENDER_OK) return err; |
|
218
|
0 |
0 |
if (err != PDFMAKE_RENDER_OK) return err; |
|
221
|
0 |
0 |
if (err != PDFMAKE_RENDER_OK) return err; |
|
224
|
0 |
0 |
if (err != PDFMAKE_RENDER_OK) return err; |
|
233
|
0 |
0 |
return !path || path->seg_count == 0; |
|
|
0 |
0 |
return !path || path->seg_count == 0; |
|
247
|
0 |
0 |
if (!path || path->seg_count == 0) { |
|
|
0 |
0 |
if (!path || path->seg_count == 0) { |
|
254
|
0 |
0 |
for (i = 0; i < path->seg_count; i++) { |
|
271
|
0 |
0 |
for (j = 0; j < n_pts; j++) { |
|
272
|
0 |
0 |
if (seg->pts[j].x < x_min) x_min = seg->pts[j].x; |
|
273
|
0 |
0 |
if (seg->pts[j].y < y_min) y_min = seg->pts[j].y; |
|
274
|
0 |
0 |
if (seg->pts[j].x > x_max) x_max = seg->pts[j].x; |
|
275
|
0 |
0 |
if (seg->pts[j].y > y_max) y_max = seg->pts[j].y; |
|
279
|
0 |
0 |
if (min_x) *min_x = x_min; |
|
280
|
0 |
0 |
if (min_y) *min_y = y_min; |
|
281
|
0 |
0 |
if (max_x) *max_x = x_max; |
|
282
|
0 |
0 |
if (max_y) *max_y = y_max; |