| line |
true |
false |
branch |
|
71
|
0 |
20 |
Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTABLE_ENTRY_t*); |
|
82
|
916 |
633 |
for (; tblent; tblent = tblent->next) { |
|
83
|
605 |
311 |
if (tblent->key == key) |
|
93
|
605 |
0 |
return tblent ? tblent->value : NULL; |
|
103
|
0 |
633 |
if (tblent) { |
|
114
|
125 |
508 |
if (tblent->next && (tbl->tbl_items > tbl->tbl_max)) |
|
|
0 |
125 |
if (tblent->next && (tbl->tbl_items > tbl->tbl_max)) |
|
129
|
0 |
0 |
Renew(ary, newsize, PTABLE_ENTRY_t*); |
|
130
|
0 |
0 |
Zero(&ary[oldsize], newsize - oldsize, PTABLE_ENTRY_t*); |
|
134
|
0 |
0 |
for (i = 0; i < oldsize; i++, ary++) { |
|
136
|
0 |
0 |
if (!*ary) |
|
139
|
0 |
0 |
for (entp = ary, ent = *ary; ent; ent = *entp) { |
|
140
|
0 |
0 |
if ((newsize & PTABLE_HASH(ent->key)) != i) { |
|
157
|
20 |
0 |
if (tbl && tbl->tbl_items) { |
|
|
14 |
6 |
if (tbl && tbl->tbl_items) { |
|
164
|
633 |
7168 |
while (entry) { |
|
176
|
7154 |
14 |
} while (riter--); |
|
187
|
0 |
20 |
if (!tbl) { |