| line |
true |
false |
branch |
|
51
|
6015 |
774 |
while (isize > 0) { |
|
58
|
0 |
774 |
Newz(0,S->keyval,S->maxsize,keyval_t); |
|
69
|
0 |
10 |
Newz(0, nkv, newmax, keyval_t); |
|
70
|
136 |
10 |
for (i = 0; i < max; i++) { |
|
72
|
105 |
31 |
if (key != 0) { |
|
74
|
26 |
105 |
while (nkv[h].key > 0 && nkv[h].key != key) |
|
|
26 |
0 |
while (nkv[h].key > 0 && nkv[h].key != key) |
|
84
|
0 |
10 |
MPUassert(newsize == S->size, "keyval set size mismatch"); |
|
89
|
62055 |
43786 |
while (S.keyval[h].key > 0 && S.keyval[h].key != key) |
|
|
21664 |
40391 |
while (S.keyval[h].key > 0 && S.keyval[h].key != key) |
|
91
|
40391 |
43786 |
return (S.keyval[h].key == key) ? h : -1; |
|
96
|
40391 |
43786 |
return (i == -1) ? 0 : S.keyval[i].val; |
|
101
|
53026 |
42180 |
while (S->keyval[h].key > 0 && S->keyval[h].key != kv.key) |
|
|
14374 |
38652 |
while (S->keyval[h].key > 0 && S->keyval[h].key != kv.key) |
|
103
|
38652 |
42180 |
if (S->keyval[h].key == kv.key) { |
|
108
|
10 |
42170 |
if (S->size++ > 0.65 * S->maxsize) |
|
115
|
510504 |
734 |
for (j = 0; j < T.maxsize; j++) |
|
116
|
40396 |
470108 |
if (T.keyval[j].key > 0) |
|
138
|
172 |
42 |
while (isize > 0) { |
|
145
|
0 |
42 |
Newz(0, L->keylist, L->maxsize, keylist_t); |
|
150
|
1080 |
42 |
for (i = 0; i < L->maxsize; i++) |
|
151
|
181 |
899 |
if (L->keylist[i].size > 0) |
|
160
|
0 |
2 |
Newz(0, nlist, newmax, keylist_t); |
|
161
|
32 |
2 |
for (i = 0; i < max; i++) { |
|
163
|
24 |
8 |
if (key != 0) { |
|
165
|
3 |
24 |
while (nlist[h].key > 0 && nlist[h].key != key) |
|
|
3 |
0 |
while (nlist[h].key > 0 && nlist[h].key != key) |
|
175
|
0 |
2 |
MPUassert(newsize == L->size, "setlist size mismatch"); |
|
180
|
163 |
298 |
while (L.keylist[h].key > 0 && L.keylist[h].key != key) |
|
|
22 |
141 |
while (L.keylist[h].key > 0 && L.keylist[h].key != key) |
|
182
|
141 |
298 |
return (L.keylist[h].key == key) ? h : -1; |
|
188
|
112 |
181 |
while (L->keylist[h].key > 0 && L->keylist[h].key != key) |
|
|
36 |
76 |
while (L->keylist[h].key > 0 && L->keylist[h].key != key) |
|
190
|
76 |
181 |
if (L->keylist[h].key == key) { |
|
193
|
2 |
74 |
if (size + nvals > maxsize) { |
|
195
|
0 |
2 |
Renew(L->keylist[h].vals, maxsize, UV); |
|
199
|
125 |
76 |
for (j = 0; j < nvals; j++) { |
|
205
|
2 |
179 |
long maxsize = (nvals < 5) ? 12 : (nvals+1) * 2; |
|
206
|
0 |
181 |
New(0, L->keylist[h].vals, maxsize, UV); |
|
209
|
202 |
181 |
for (j = 0; j < nvals; j++) { |
|
215
|
2 |
179 |
if (L->size++ > 0.65 * L->maxsize) |
|
226
|
298 |
141 |
if (i == -1) { |
|
236
|
808 |
37 |
for (j = 0; j < T.maxsize; j++) { |
|
237
|
116 |
692 |
if (T.keylist[j].key > 0) { |