Branch Coverage

ptable.h
Criterion Covered Total %
branch 0 60 0.0


line true false branch
99 0 0 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTABLE_ENTRY_t*);
115 0 0 for (; tblent; tblent = tblent->next) {
116 0 0 if (tblent->key == key)
126 0 0 return tblent ? tblent->value : NULL;
139 0 0 Renew(ary, newsize, PTABLE_ENTRY_t*);
140 0 0 Zero(&ary[oldsize], newsize - oldsize, PTABLE_ENTRY_t*);
144 0 0 for (i = 0; i < oldsize; i++, ary++) {
146 0 0 if (!*ary)
149 0 0 for (entp = ary, ent = *ary; ent; ent = *entp) {
150 0 0 if ((newsize & PTABLE_HASH(ent->key)) != i) {
169 0 0 if (tblent) {
180 0 0 if (tblent->next && (tbl->tbl_items > tbl->tbl_max))
0 0 if (tblent->next && (tbl->tbl_items > tbl->tbl_max))
193 0 0 if (tbl && tbl->tbl_items) {
0 0 if (tbl && tbl->tbl_items) {
200 0 0 while (entry) {
212 0 0 } while (riter--);
305 0 0 if (flags & PTABLE_FLAG_AUTOCLEAN)
318 0 0 if (tbl->tbl_items == 0) {
324 0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
342 0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
0 0 PTABLE_ITER_NEXT_ELEM(iter, tbl);
352 0 0 if (iter->table->cur_iter == iter)
374 0 0 if (!tbl)
378 0 0 if (tbl->cur_iter) {