209 |
|
ot = oseti(i*OSTSIZ + osentry); |
210 |
|
if (*os > 0) /* found it */ |
211 |
|
return(ot); |
212 |
< |
if (!isfull(ot)) /* entry overflow */ |
212 |
> |
if (!isfull(ot)) { /* entry overflow */ |
213 |
|
if (++ntries < OSTSIZ) |
214 |
|
goto tryagain; |
215 |
|
else |
216 |
|
error(INTERNAL, "hash table overflow in fullnode"); |
217 |
+ |
} |
218 |
|
/* remember position */ |
219 |
|
i = os - ostable[osentry]; |
220 |
|
os = ostable[osentry] = (OBJECT *)realloc( |
230 |
|
return(ot); |
231 |
|
memerr: |
232 |
|
error(SYSTEM, "out of memory in fullnode"); |
233 |
< |
return NULL; /* pro forma return */ |
233 |
> |
return 0; /* pro forma return */ |
234 |
|
} |
235 |
|
|
236 |
|
|
255 |
|
return; |
256 |
|
noderr: |
257 |
|
error(CONSISTENCY, "bad node in objset"); |
257 |
– |
} |
258 |
– |
|
259 |
– |
|
260 |
– |
int |
261 |
– |
dosets(f) /* loop through all sets */ |
262 |
– |
int (*f)(); |
263 |
– |
{ |
264 |
– |
int res = 0; |
265 |
– |
int n; |
266 |
– |
register OBJECT *os; |
267 |
– |
|
268 |
– |
for (n = 0; n < OSTSIZ; n++) { |
269 |
– |
if ((os = ostable[n]) == NULL) |
270 |
– |
continue; |
271 |
– |
while (*os > 0) { |
272 |
– |
res += (*f)(os); |
273 |
– |
os += *os + 1; |
274 |
– |
} |
275 |
– |
} |
276 |
– |
return(res); |
258 |
|
} |
259 |
|
|
260 |
|
|