Lines Matching full:bucket
179 __glxHashBucketPtr bucket;
187 for (bucket = table->buckets[i]; bucket;) {
188 next = bucket->next;
189 HASH_FREE(bucket);
190 bucket = next;
197 /* Find the bucket and organize the list so that this bucket is at the
205 __glxHashBucketPtr bucket;
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
211 if (bucket->key == key) {
214 prev->next = bucket->next;
215 bucket->next = table->buckets[hash];
216 table->buckets[hash] = bucket;
222 return bucket;
224 prev = bucket;
234 __glxHashBucketPtr bucket;
239 bucket = HashFind(table, key, NULL);
240 if (!bucket)
242 *value = bucket->value;
250 __glxHashBucketPtr bucket;
259 bucket = HASH_ALLOC(sizeof(*bucket));
260 if (!bucket)
262 bucket->key = key;
263 bucket->value = value;
264 bucket->next = table->buckets[hash];
265 table->buckets[hash] = bucket;
267 printf("Inserted %d at %d/%p\n", key, hash, bucket);
277 __glxHashBucketPtr bucket;
282 bucket = HashFind(table, key, &hash);
284 if (!bucket)
287 table->buckets[hash] = bucket->next;
288 HASH_FREE(bucket);
337 count_entries(__glxHashBucketPtr bucket)
341 for (; bucket; bucket = bucket->next)
359 __glxHashBucketPtr bucket;
365 bucket = table->buckets[i];
366 update_dist(count_entries(bucket));
