Lines Matching full:bucket
127 HashBucketPtr bucket;
134 for (bucket = table->buckets[i]; bucket;) {
135 next = bucket->next;
136 drmFree(bucket);
137 bucket = next;
144 /* Find the bucket and organize the list so that this bucket is at the
152 HashBucketPtr bucket;
156 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
157 if (bucket->key == key) {
160 prev->next = bucket->next;
161 bucket->next = table->buckets[hash];
162 table->buckets[hash] = bucket;
167 return bucket;
169 prev = bucket;
178 HashBucketPtr bucket;
182 bucket = HashFind(table, key, NULL);
183 if (!bucket) return 1; /* Not found */
184 *value = bucket->value;
191 HashBucketPtr bucket;
198 bucket = drmMalloc(sizeof(*bucket));
199 if (!bucket) return -1; /* Error */
200 bucket->key = key;
201 bucket->value = value;
202 bucket->next = table->buckets[hash];
203 table->buckets[hash] = bucket;
205 printf("Inserted %lu at %lu/%p\n", key, hash, bucket);
214 HashBucketPtr bucket;
218 bucket = HashFind(table, key, &hash);
220 if (!bucket) return 1; /* Not found */
222 table->buckets[hash] = bucket->next;
223 drmFree(bucket);
