106 	size_t h, bkt;  in hashmap_grow()  local
118 		h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits);  in hashmap_grow()
119 		hashmap_add_entry(&new_buckets[h], cur);  in hashmap_grow()
159 	size_t h;  in hashmap__insert()  local
167 	h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits);  in hashmap__insert()
169 	    hashmap_find_entry(map, key, h, NULL, &entry)) {  in hashmap__insert()
191 		h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits);  in hashmap__insert()
200 	hashmap_add_entry(&map->buckets[h], entry);  in hashmap__insert()
209 	size_t h;  in hashmap__find()  local
211 	h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits);  in hashmap__find()
212 	if (!hashmap_find_entry(map, key, h, NULL, &entry))  in hashmap__find()
224 	size_t h;  in hashmap__delete()  local
226 	h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits);  in hashmap__delete()
227 	if (!hashmap_find_entry(map, key, h, &pprev, &entry))  in hashmap__delete()