| line |
true |
false |
branch |
|
71
|
0 |
82 |
if (bytes / count_y != sizeof(i_int_hline_entry *)) { |
|
115
|
0 |
4744 |
if (width < 0) { |
|
121
|
4743 |
1 |
if (y < hlines->start_y || y >= hlines->limit_y) |
|
|
1 |
4742 |
if (y < hlines->start_y || y >= hlines->limit_y) |
|
124
|
4741 |
1 |
if (x >= hlines->limit_x || x_limit < hlines->start_x) |
|
|
0 |
4741 |
if (x >= hlines->limit_x || x_limit < hlines->start_x) |
|
128
|
3 |
4738 |
if (x < hlines->start_x) |
|
130
|
0 |
4741 |
if (x_limit > hlines->limit_x) |
|
133
|
1 |
4740 |
if (x == x_limit) |
|
136
|
133 |
4607 |
if (hlines->entries[y - hlines->start_y]) { |
|
140
|
324 |
120 |
for (i = 0; i < entry->count; ++i) { |
|
142
|
13 |
311 |
if (OVERLAPPED(x, x_limit, seg->minx, seg->x_limit)) { |
|
147
|
13 |
120 |
if (found >= 0) { |
|
159
|
22 |
11 |
while (i < entry->count) { |
|
161
|
22 |
0 |
if (OVERLAPPED(x, x_limit, seg->minx, seg->x_limit)) { |
|
167
|
20 |
2 |
if (i < entry->count-1) { |
|
187
|
2 |
118 |
if (entry->count == entry->alloc) { |
|
227
|
16710 |
82 |
for (i = 0; i < entry_count; ++i) { |
|
228
|
4607 |
12103 |
if (hlines->entries[i]) |
|
248
|
13300 |
70 |
for (y = hlines->start_y; y < hlines->limit_y; ++y) { |
|
250
|
4063 |
9237 |
if (entry) { |
|
251
|
4101 |
4063 |
for (i = 0; i < entry->count; ++i) { |
|
253
|
190948 |
4101 |
for (x = seg->minx; x < seg->x_limit; ++x) { |
|
275
|
3200 |
9 |
for (y = hlines->start_y; y < hlines->limit_y; ++y) { |
|
277
|
539 |
2661 |
if (entry) { |
|
278
|
599 |
539 |
for (i = 0; i < entry->count; ++i) { |