202         Entry* current = *p;  in hashmapPut()  local
205         if (current == NULL) {  in hashmapPut()
217         if (equalKeys(current->key, current->hash, key, hash, map->equals)) {  in hashmapPut()
218             void* oldValue = current->value;  in hashmapPut()
219             current->value = value;  in hashmapPut()
224         p = &current->next;  in hashmapPut()
265         Entry* current = *p;  in hashmapMemoize()  local
268         if (current == NULL) {  in hashmapMemoize()
282         if (equalKeys(current->key, current->hash, key, hash, map->equals)) {  in hashmapMemoize()
283             return current->value;  in hashmapMemoize()
287         p = &current->next;  in hashmapMemoize()
297     Entry* current;  in hashmapRemove()  local
298     while ((current = *p) != NULL) {  in hashmapRemove()
299         if (equalKeys(current->key, current->hash, key, hash, map->equals)) {  in hashmapRemove()
300             void* value = current->value;  in hashmapRemove()
301             *p = current->next;  in hashmapRemove()
302             free(current);  in hashmapRemove()
307         p = &current->next;  in hashmapRemove()