| line |
true |
false |
branch |
|
145
|
26398 |
26424 |
for (; ent; ent = ent->next) { |
|
146
|
7951 |
18447 |
if (ent->key == key) |
|
168
|
29280 |
37 |
for (i = 0; i < old_size; i++, ary++) { |
|
172
|
10746 |
18534 |
if (!ent) |
|
178
|
14548 |
14632 |
if ((new_size & PTABLE_HASH(ent->key)) != i) { |
|
186
|
10646 |
18534 |
} while (ent); |
|
198
|
16292 |
23386 |
for (; ent; ent = ent->next) { |
|
199
|
0 |
16292 |
if (ent->key == key) |
|
210
|
11745 |
11641 |
if (ent->next && t->items > t->max) |
|
|
37 |
11708 |
if (ent->next && t->items > t->max) |
|
229
|
39469 |
65570 |
for (; ent; prev = ent, ent = ent->next) { |
|
230
|
82 |
39387 |
if (ent->key == key) { |
|
231
|
5 |
77 |
if (prev) |
|
254
|
0 |
34 |
if (init_buckets < 4) { |
|
284
|
7951 |
26424 |
return ent ? ent->val : NULL; |
|
343
|
0 |
23386 |
PTABLE_VAL_FREE(ent->val); |
|
383
|
82 |
65570 |
if (ent) { |
|
384
|
82 |
0 |
PTABLE_VAL_FREE(ent->val); |
|
401
|
34 |
0 |
if (t && t->items) { |
|
|
28 |
6 |
if (t && t->items) { |
|
407
|
23304 |
30176 |
while (entry) { |
|
410
|
23304 |
0 |
PTABLE_VAL_FREE(entry->val); |
|
416
|
30148 |
28 |
} while (idx--); |
|
430
|
0 |
34 |
if (!t) |