| line |
true |
false |
branch |
|
145
|
556652 |
588933 |
for (; ent; ent = ent->next) { |
|
146
|
312499 |
244153 |
if (ent->key == key) |
|
168
|
201184 |
65 |
for (i = 0; i < old_size; i++, ary++) { |
|
172
|
73643 |
127541 |
if (!ent) |
|
178
|
101356 |
99849 |
if ((new_size & PTABLE_HASH(ent->key)) != i) { |
|
186
|
73664 |
127541 |
} while (ent); |
|
198
|
117451 |
416466 |
for (; ent; ent = ent->next) { |
|
199
|
0 |
117451 |
if (ent->key == key) |
|
210
|
89217 |
327249 |
if (ent->next && t->items > t->max) |
|
|
65 |
89152 |
if (ent->next && t->items > t->max) |
|
229
|
213972 |
300446 |
for (; ent; prev = ent, ent = ent->next) { |
|
230
|
0 |
213972 |
if (ent->key == key) { |
|
231
|
0 |
0 |
if (prev) |
|
254
|
0 |
40 |
if (init_buckets < 4) { |
|
284
|
312499 |
588933 |
return ent ? ent->val : NULL; |
|
383
|
0 |
300446 |
if (ent) { |
|
401
|
20 |
0 |
if (t && t->items) { |
|
|
19 |
1 |
if (t && t->items) { |
|
|
150564 |
0 |
if (t && t->items) { |
|
|
75095 |
75469 |
if (t && t->items) { |
|
407
|
127878 |
201568 |
while (entry) { |
|
|
288588 |
2449440 |
while (entry) { |
|
416
|
201549 |
19 |
} while (idx--); |
|
|
2374345 |
75095 |
} while (idx--); |
|
430
|
0 |
20 |
if (!t) |
|
|
0 |
20 |
if (!t) |