| line |
true |
false |
branch |
|
30
|
42 |
16 |
if (arr->max_size > 0) { |
|
41
|
1 |
47 |
if (arr->max_size >= MAX_SIZE_CLEAR) { |
|
49
|
51 |
92 |
if (arr->count == arr->max_size) { |
|
50
|
43 |
8 |
if (arr->max_size == 0) { |
|
79
|
32 |
1 |
for(i = 0; i < root->objects->count; ++i) { |
|
81
|
31 |
1 |
if (!sv_eq(fetched, value)) { |
|
101
|
68 |
20 |
for (i = 0; i < count; ++i) { |
|
114
|
52 |
16 |
if (node->values != NULL) { |
|
119
|
64 |
16 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
129
|
0 |
0 |
if (node->values == NULL) { |
|
131
|
0 |
0 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
132
|
0 |
0 |
if (node->children[i].has_objects) return; |
|
137
|
0 |
0 |
if (node->parent != NULL) { |
|
161
|
52 |
16 |
if (last) { |
|
180
|
629 |
198 |
return (s->x <= node->xmax && s->x2 >= node->xmin) |
|
181
|
827 |
196 |
&& (s->y <= node->ymax && s->y2 >= node->ymin); |
|
|
522 |
107 |
&& (s->y <= node->ymax && s->y2 >= node->ymin); |
|
|
413 |
109 |
&& (s->y <= node->ymax && s->y2 >= node->ymin); |
|
187
|
14 |
25 |
: s->x > node->xmax |
|
189
|
3 |
22 |
: 0 |
|
194
|
14 |
25 |
: s->y > node->ymax |
|
196
|
3 |
22 |
: 0 |
|
206
|
588 |
20 |
if (!node->has_objects || !is_within_node(node, param)) return; |
|
|
318 |
270 |
if (!node->has_objects || !is_within_node(node, param)) return; |
|
210
|
134 |
136 |
if (node->values != NULL) { |
|
211
|
150 |
134 |
for (i = 0; i < node->values->count; ++i) { |
|
218
|
544 |
136 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
226
|
304 |
161 |
if (!is_within_node(node, param)) return false; |
|
228
|
58 |
103 |
if (node->values != NULL) { |
|
233
|
412 |
103 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
246
|
9 |
0 |
if (!node->has_objects || !is_within_node(node, param)) return; |
|
|
6 |
3 |
if (!node->has_objects || !is_within_node(node, param)) return; |
|
250
|
1 |
2 |
if (node->values != NULL) { |
|
253
|
2 |
1 |
for (i = 0; i < node->values->count; ++i) { |
|
255
|
1 |
1 |
if (!sv_eq(fetched, value)) { |
|
262
|
0 |
1 |
if (new_list->count == 0) clear_has_objects(node); |
|
265
|
8 |
2 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
273
|
11 |
56 |
if (!node->has_objects) return; |
|
276
|
41 |
15 |
if (node->values != NULL) { |
|
281
|
60 |
15 |
for (i = 0; i < CHILDREN_PER_NODE; ++i) { |
|
297
|
52 |
7 |
while ((value = hv_iternextsv(root->backref, &key, &retlen)) != NULL) { |
|
301
|
52 |
7 |
for (i = 0; i < root->objects->count; ++i) { |
|
322
|
0 |
125 |
if (value == NULL) |
|
334
|
150 |
64 |
while ((he = hv_iternext(hash)) != NULL) { |