| line |
true |
false |
branch |
|
145
|
4466 |
19135 |
for (; ent; ent = ent->next) { |
|
146
|
2232 |
2234 |
if (ent->key == key) |
|
168
|
1152 |
9 |
for (i = 0; i < old_size; i++, ary++) { |
|
172
|
413 |
739 |
if (!ent) |
|
178
|
625 |
537 |
if ((new_size & PTABLE_HASH(ent->key)) != i) { |
|
186
|
423 |
739 |
} while (ent); |
|
198
|
1860 |
17926 |
for (; ent; ent = ent->next) { |
|
199
|
0 |
1860 |
if (ent->key == key) |
|
210
|
1569 |
16357 |
if (ent->next && t->items > t->max) |
|
|
9 |
1560 |
if (ent->next && t->items > t->max) |
|
229
|
3702 |
15176 |
for (; ent; prev = ent, ent = ent->next) { |
|
230
|
0 |
3702 |
if (ent->key == key) { |
|
231
|
0 |
0 |
if (prev) |
|
254
|
0 |
45 |
if (init_buckets < 4) { |
|
284
|
2232 |
19135 |
return ent ? ent->val : NULL; |
|
383
|
0 |
15176 |
if (ent) { |
|
401
|
30 |
0 |
if (t && t->items) { |
|
|
15 |
15 |
if (t && t->items) { |
|
|
11391 |
0 |
if (t && t->items) { |
|
|
5434 |
5957 |
if (t && t->items) { |
|
407
|
1107 |
1504 |
while (entry) { |
|
|
16819 |
207424 |
while (entry) { |
|
416
|
1489 |
15 |
} while (idx--); |
|
|
201990 |
5434 |
} while (idx--); |
|
430
|
0 |
30 |
if (!t) |
|
|
0 |
15 |
if (!t) |