25 			      struct hashmap_entry *entry)  in hashmap_add_entry()  argument
27 	entry->next = *pprev;  in hashmap_add_entry()
28 	*pprev = entry;  in hashmap_add_entry()
32 			      struct hashmap_entry *entry)  in hashmap_del_entry()  argument
34 	*pprev = entry->next;  in hashmap_del_entry()
35 	entry->next = NULL;  in hashmap_del_entry()
133 			       struct hashmap_entry **entry)  in hashmap_find_entry()  argument
146 			*entry = cur;  in hashmap_find_entry()
158 	struct hashmap_entry *entry;  in hashmap__insert()  local
169 	    hashmap_find_entry(map, key, h, NULL, &entry)) {  in hashmap__insert()
171 			*old_key = entry->key;  in hashmap__insert()
173 			*old_value = entry->value;  in hashmap__insert()
176 			entry->key = key;  in hashmap__insert()
177 			entry->value = value;  in hashmap__insert()
194 	entry = malloc(sizeof(struct hashmap_entry));  in hashmap__insert()
195 	if (!entry)  in hashmap__insert()
198 	entry->key = key;  in hashmap__insert()
199 	entry->value = value;  in hashmap__insert()
200 	hashmap_add_entry(&map->buckets[h], entry);  in hashmap__insert()
208 	struct hashmap_entry *entry;  in hashmap__find()  local
212 	if (!hashmap_find_entry(map, key, h, NULL, &entry))  in hashmap__find()
216 		*value = entry->value;  in hashmap__find()
223 	struct hashmap_entry **pprev, *entry;  in hashmap__delete()  local
227 	if (!hashmap_find_entry(map, key, h, &pprev, &entry))  in hashmap__delete()
231 		*old_key = entry->key;  in hashmap__delete()
233 		*old_value = entry->value;  in hashmap__delete()
235 	hashmap_del_entry(pprev, entry);  in hashmap__delete()
236 	free(entry);  in hashmap__delete()