| line |
true |
false |
branch |
|
57
|
73 |
22 |
for (i = 0; i < count; ++i) { |
|
72
|
17 |
56 |
if (node->children != NULL) { |
|
74
|
68 |
17 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
99
|
17 |
56 |
if (!last) { |
|
113
|
6 |
285 |
return (s->x <= inner_s->x && s->x2 >= inner_s->x2) |
|
114
|
291 |
789 |
&& (s->y <= inner_s->y && s->y2 >= inner_s->y2); |
|
|
5 |
1 |
&& (s->y <= inner_s->y && s->y2 >= inner_s->y2); |
|
|
3 |
2 |
&& (s->y <= inner_s->y && s->y2 >= inner_s->y2); |
|
119
|
1020 |
64 |
if (s1->type == s2->type) { |
|
132
|
1017 |
0 |
if (s1->type == shape_rectangle) { |
|
133
|
616 |
199 |
return (s1->x <= s2->x2 && s1->x2 >= s2->x) |
|
134
|
815 |
202 |
&& (s1->y <= s2->y2 && s1->y2 >= s2->y); |
|
|
508 |
108 |
&& (s1->y <= s2->y2 && s1->y2 >= s2->y); |
|
|
399 |
109 |
&& (s1->y <= s2->y2 && s1->y2 >= s2->y); |
|
142
|
0 |
64 |
if (s2->type == shape_circle) { |
|
151
|
20 |
44 |
: s1->x0 > s2->x2 |
|
153
|
7 |
37 |
: 0 |
|
158
|
20 |
44 |
: s1->y0 > s2->y2 |
|
160
|
7 |
37 |
: 0 |
|
168
|
40 |
618 |
if (!node->has_objects) return; |
|
170
|
596 |
22 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
|
3 |
593 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
171
|
593 |
25 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
|
327 |
266 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
174
|
161 |
291 |
for (i = 0; i < av_count(node->values); ++i) { |
|
176
|
161 |
0 |
if (fetched != NULL) { |
|
182
|
146 |
145 |
if (node->children != NULL) { |
|
183
|
584 |
146 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
191
|
0 |
475 |
if (shape_contained(node->dimensions, param)) { |
|
195
|
310 |
165 |
if (!shapes_overlap(param, node->dimensions)) return false; |
|
197
|
60 |
105 |
if (node->children == NULL) { |
|
202
|
420 |
105 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
216
|
0 |
9 |
if (!node->has_objects) return; |
|
218
|
9 |
0 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
|
0 |
9 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
219
|
9 |
0 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
|
6 |
3 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
224
|
1 |
2 |
if (av_count(node->values) > 0) { |
|
227
|
2 |
1 |
for (i = 0; i < av_count(node->values); ++i) { |
|
229
|
2 |
0 |
if (fetched != NULL && !sv_eq(*fetched, value)) { |
|
|
1 |
1 |
if (fetched != NULL && !sv_eq(*fetched, value)) { |
|
239
|
2 |
1 |
if (node->children != NULL) { |
|
240
|
8 |
2 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
242
|
0 |
8 |
node->has_objects = node->has_objects || node->children[i].has_objects; |
|
|
0 |
0 |
node->has_objects = node->has_objects || node->children[i].has_objects; |
|
249
|
13 |
59 |
if (!node->has_objects) return; |
|
253
|
16 |
43 |
if (node->children != NULL) { |
|
255
|
64 |
16 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
271
|
54 |
8 |
while ((value = hv_iternextsv(root->backref, &key, &retlen)) != NULL) { |
|
283
|
7 |
6 |
while ((he = hv_iternext(results)) != NULL) { |
|
285
|
0 |
7 |
char *key = HePV(he, len); |
|
289
|
4 |
3 |
if (!shapes_overlap(s, s2)) |
|
300
|
0 |
237 |
if (value == NULL) return NULL; |
|
307
|
0 |
138 |
if (value == NULL) |
|
319
|
157 |
74 |
while ((he = hv_iternext(hash)) != NULL) { |