Lines Matching full:bucket
69 struct hash_bucket *bucket, *bucket_end;
74 bucket = hash->buckets;
75 bucket_end = bucket + hash->n_buckets;
76 for (; bucket < bucket_end; bucket++) {
79 entry = bucket->entries;
80 entry_end = entry + bucket->used;
84 free(bucket->entries);
151 struct hash_bucket *bucket = hash->buckets + pos;
154 if (bucket->used + 1 >= bucket->total) {
155 unsigned new_total = bucket->total + hash->step;
157 struct hash_entry *tmp = realloc(bucket->entries, size);
160 bucket->entries = tmp;
161 bucket->total = new_total;
164 entry = bucket->entries;
165 entry_end = entry + bucket->used;
183 bucket->used++;
194 struct hash_bucket *bucket = hash->buckets + pos;
197 if (bucket->used + 1 >= bucket->total) {
198 unsigned new_total = bucket->total + hash->step;
200 struct hash_entry *tmp = realloc(bucket->entries, size);
203 bucket->entries = tmp;
204 bucket->total = new_total;
207 entry = bucket->entries;
208 entry_end = entry + bucket->used;
222 bucket->used++;
239 const struct hash_bucket *bucket = hash->buckets + pos;
245 &se, bucket->entries, bucket->used,
258 struct hash_bucket *bucket = hash->buckets + pos;
265 entry = bsearch(&se, bucket->entries, bucket->used,
273 entry_end = bucket->entries + bucket->used;
277 bucket->used--;
280 steps_used = bucket->used / hash->step;
281 steps_total = bucket->total / hash->step;
285 struct hash_entry *tmp = realloc(bucket->entries, size);
287 bucket->entries = tmp;
288 bucket->total = (steps_used + 1) * hash->step;
303 iter->bucket = 0;
310 const struct hash_bucket *b = iter->hash->buckets + iter->bucket;
318 for (iter->bucket++; iter->bucket < iter->hash->n_buckets;
319 iter->bucket++) {
320 b = iter->hash->buckets + iter->bucket;
326 if (iter->bucket >= iter->hash->n_buckets)
