Lines Matching refs:hash
100 static void *util_data_allocate_node(struct util_hash_data *hash)
102 return malloc(hash->nodeSize);
111 util_hash_create_node(struct util_hash *hash,
115 struct util_node *node = util_data_allocate_node(hash->data.d);
125 ++hash->data.d->size;
129 static void util_data_rehash(struct util_hash_data *hash, int hint)
135 hash->userNumBits = (short)hint;
136 while (primeForNumBits(hint) < (hash->size >> 1))
142 if (hash->numBits != hint) {
143 struct util_node *e = (struct util_node *)(hash);
144 struct util_node **oldBuckets = hash->buckets;
145 int oldNumBuckets = hash->numBuckets;
148 hash->numBits = (short)hint;
149 hash->numBuckets = primeForNumBits(hint);
150 hash->buckets = malloc(sizeof(struct util_node*) * hash->numBuckets);
151 for (i = 0; i < hash->numBuckets; ++i)
152 hash->buckets[i] = e;
166 beforeFirstNode = &hash->buckets[h % hash->numBuckets];
178 static void util_data_might_grow(struct util_hash_data *hash)
180 if (hash->size >= hash->numBuckets)
181 util_data_rehash(hash, hash->numBits + 1);
184 static void util_data_has_shrunk(struct util_hash_data *hash)
186 if (hash->size <= (hash->numBuckets >> 3) &&
187 hash->numBits > hash->userNumBits) {
188 int max = MAX(hash->numBits-2, hash->userNumBits);
189 util_data_rehash(hash, max);
193 static struct util_node *util_data_first_node(struct util_hash_data *hash)
195 struct util_node *e = (struct util_node *)(hash);
196 struct util_node **bucket = hash->buckets;
197 int n = hash->numBuckets;
206 static struct util_node **util_hash_find_node(struct util_hash *hash, unsigned akey)
210 if (hash->data.d->numBuckets) {
211 node = (struct util_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]);
212 assert(*node == hash->data.e || (*node)->next);
213 while (*node != hash->data.e && (*node)->key != akey)
216 node = (struct util_node **)((const struct util_node * const *)(&hash->data.e));
222 util_hash_insert(struct util_hash *hash, unsigned key, void *data)
224 util_data_might_grow(hash->data.d);
227 struct util_node **nextNode = util_hash_find_node(hash, key);
228 struct util_node *node = util_hash_create_node(hash, key, data, nextNode);
230 struct util_hash_iter null_iter = {hash, 0};
235 struct util_hash_iter iter = {hash, node};
243 struct util_hash *hash = malloc(sizeof(struct util_hash));
244 if (!hash)
247 hash->data.d = malloc(sizeof(struct util_hash_data));
248 if (!hash->data.d) {
249 free(hash);
253 hash->data.d->fakeNext = 0;
254 hash->data.d->buckets = 0;
255 hash->data.d->size = 0;
256 hash->data.d->nodeSize = sizeof(struct util_node);
257 hash->data.d->userNumBits = (short)MinNumBits;
258 hash->data.d->numBits = 0;
259 hash->data.d->numBuckets = 0;
261 return hash;
264 drm_private void util_hash_delete(struct util_hash *hash)
266 struct util_node *e_for_x = (struct util_node *)(hash->data.d);
267 struct util_node **bucket = (struct util_node **)(hash->data.d->buckets);
268 int n = hash->data.d->numBuckets;
277 free(hash->data.d->buckets);
278 free(hash->data.d);
279 free(hash);
283 util_hash_find(struct util_hash *hash, unsigned key)
285 struct util_node **nextNode = util_hash_find_node(hash, key);
286 struct util_hash_iter iter = {hash, *nextNode};
292 if (!iter.node || iter.hash->data.e == iter.node)
299 if (!iter.node || iter.hash->data.e == iter.node)
337 struct util_hash_iter next = {iter.hash, util_hash_data_next(iter.node)};
343 if (!iter.node || iter.node == iter.hash->data.e)
348 drm_private void *util_hash_take(struct util_hash *hash, unsigned akey)
350 struct util_node **node = util_hash_find_node(hash, akey);
351 if (*node != hash->data.e) {
356 --hash->data.d->size;
357 util_data_has_shrunk(hash->data.d);
363 drm_private struct util_hash_iter util_hash_first_node(struct util_hash *hash)
365 struct util_hash_iter iter = {hash, util_data_first_node(hash->data.d)};
370 util_hash_erase(struct util_hash *hash, struct util_hash_iter iter)
376 if (node == hash->data.e)
380 node_ptr = (struct util_node**)(&hash->data.d->buckets[node->key % hash->data.d->numBuckets]);
385 --hash->data.d->size;
