| line |
true |
false |
branch |
|
55
|
45 |
35 |
if (arr->max_size > 0) { |
|
66
|
1 |
66 |
if (arr->max_size >= MAX_SIZE_CLEAR) { |
|
74
|
54 |
93 |
if (arr->count == arr->max_size) { |
|
75
|
46 |
8 |
if (arr->max_size == 0) { |
|
104
|
32 |
1 |
for(i = 0; i < root->objects->count; ++i) { |
|
106
|
31 |
1 |
if (!sv_eq(fetched, value)) { |
|
126
|
73 |
22 |
for (i = 0; i < count; ++i) { |
|
142
|
17 |
56 |
if (node->children != NULL) { |
|
144
|
68 |
17 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
170
|
17 |
56 |
if (!last) { |
|
184
|
6 |
285 |
return (s->x <= inner_s->x && s->x2 >= inner_s->x2) |
|
185
|
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); |
|
190
|
1020 |
64 |
if (s1->type == s2->type) { |
|
203
|
1017 |
0 |
if (s1->type == shape_rectangle) { |
|
204
|
616 |
199 |
return (s1->x <= s2->x2 && s1->x2 >= s2->x) |
|
205
|
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); |
|
213
|
0 |
64 |
if (s2->type == shape_circle) { |
|
222
|
20 |
44 |
: s1->x0 > s2->x2 |
|
224
|
7 |
37 |
: 0 |
|
229
|
20 |
44 |
: s1->y0 > s2->y2 |
|
231
|
7 |
37 |
: 0 |
|
239
|
40 |
618 |
if (!node->has_objects) return; |
|
241
|
596 |
22 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
|
3 |
593 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
242
|
593 |
25 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
|
327 |
266 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
245
|
161 |
291 |
for (i = 0; i < node->values->count; ++i) { |
|
251
|
146 |
145 |
if (node->children != NULL) { |
|
252
|
584 |
146 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
260
|
0 |
475 |
if (shape_contained(node->dimensions, param)) { |
|
264
|
310 |
165 |
if (!shapes_overlap(param, node->dimensions)) return false; |
|
266
|
60 |
105 |
if (node->children == NULL) { |
|
271
|
420 |
105 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
285
|
0 |
9 |
if (!node->has_objects) return; |
|
287
|
9 |
0 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
|
0 |
9 |
fully_contained = fully_contained || shape_contained(node->dimensions, param); |
|
288
|
9 |
0 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
|
6 |
3 |
if (!(fully_contained || shapes_overlap(param, node->dimensions))) return; |
|
292
|
1 |
2 |
if (node->values->count > 0) { |
|
295
|
2 |
1 |
for (i = 0; i < node->values->count; ++i) { |
|
297
|
1 |
1 |
if (!sv_eq(fetched, value)) { |
|
307
|
2 |
1 |
if (node->children != NULL) { |
|
308
|
8 |
2 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
310
|
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; |
|
317
|
13 |
59 |
if (!node->has_objects) return; |
|
321
|
16 |
43 |
if (node->children != NULL) { |
|
323
|
64 |
16 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
339
|
54 |
8 |
while ((value = hv_iternextsv(root->backref, &key, &retlen)) != NULL) { |
|
343
|
54 |
8 |
for (i = 0; i < root->objects->count; ++i) { |
|
356
|
7 |
6 |
while ((he = hv_iternext(results)) != NULL) { |
|
358
|
0 |
7 |
char *key = HePV(he, len); |
|
362
|
4 |
3 |
if (!shapes_overlap(s, s2)) |
|
373
|
0 |
237 |
if (value == NULL) return NULL; |
|
380
|
0 |
138 |
if (value == NULL) |
|
392
|
157 |
74 |
while ((he = hv_iternext(hash)) != NULL) { |