114             Entry* entry = map->buckets[i];  in expandIfNecessary()  local
115             while (entry != NULL) {  in expandIfNecessary()
116                 Entry* next = entry->next;  in expandIfNecessary()
117                 size_t index = calculateIndex(newBucketCount, entry->hash);  in expandIfNecessary()
118                 entry->next = newBuckets[index];  in expandIfNecessary()
119                 newBuckets[index] = entry;  in expandIfNecessary()
120                 entry = next;  in expandIfNecessary()
142         Entry* entry = map->buckets[i];  in hashmapFree()  local
143         while (entry != NULL) {  in hashmapFree()
144             Entry* next = entry->next;  in hashmapFree()
145             free(entry);  in hashmapFree()
146             entry = next;  in hashmapFree()
170     Entry* entry = static_cast<Entry*>(malloc(sizeof(Entry)));  in createEntry()  local
171     if (entry == NULL) {  in createEntry()
174     entry->key = key;  in createEntry()
175     entry->hash = hash;  in createEntry()
176     entry->value = value;  in createEntry()
177     entry->next = NULL;  in createEntry()
178     return entry;  in createEntry()
228     Entry* entry = map->buckets[index];  in hashmapGet()  local
229     while (entry != NULL) {  in hashmapGet()
230         if (equalKeys(entry->key, entry->hash, key, hash, map->equals)) {  in hashmapGet()
231             return entry->value;  in hashmapGet()
233         entry = entry->next;  in hashmapGet()
265         Entry* entry = map->buckets[i];  in hashmapForEach()  local
266         while (entry != NULL) {  in hashmapForEach()
267             Entry *next = entry->next;  in hashmapForEach()
268             if (!callback(entry->key, entry->value, context)) {  in hashmapForEach()
271             entry = next;  in hashmapForEach()