134 |
for (i = 0; i < HASH_SIZE (hash); ++i) |
for (i = 0; i < HASH_SIZE (hash); ++i) |
135 |
if (BUCKET_NTH (hash, i)) |
if (BUCKET_NTH (hash, i)) |
136 |
bucket_delete (hash, i); |
bucket_delete (hash, i); |
137 |
XFREE (HASH_BUCKETS (hash)); |
xfree (HASH_BUCKETS (hash)); |
138 |
XFREE (hash); |
xfree (hash); |
139 |
} |
} |
140 |
|
|
141 |
/* Check that the nodes in bucket I have been cleared, and recycle |
/* Check that the nodes in bucket I have been cleared, and recycle |
354 |
bucket_insert (hash, original_buckets[i]); |
bucket_insert (hash, original_buckets[i]); |
355 |
} |
} |
356 |
|
|
357 |
XFREE (original_buckets); |
xfree (original_buckets); |
358 |
} |
} |
359 |
#endif |
#endif |
360 |
|
|
385 |
bucket_insert (hash, original_buckets[i]); |
bucket_insert (hash, original_buckets[i]); |
386 |
} |
} |
387 |
|
|
388 |
XFREE (original_buckets); |
xfree (original_buckets); |
389 |
} |
} |
390 |
} |
} |
391 |
|
|
484 |
/* If there are no more nodes to return, recycle the iterator memory. */ |
/* If there are no more nodes to return, recycle the iterator memory. */ |
485 |
if (! (ITERATOR_PLACE (place) || ITERATOR_NEXT (place))) |
if (! (ITERATOR_PLACE (place) || ITERATOR_NEXT (place))) |
486 |
{ |
{ |
487 |
XFREE (place); |
xfree (place); |
488 |
return 0; |
return 0; |
489 |
} |
} |
490 |
|
|