Lines Matching refs:HASHMAP_BASE
348 #define bucket_hash(h, p) base_bucket_hash(HASHMAP_BASE(h), p)
353 #define hashmap_set_dirty(h) base_set_dirty(HASHMAP_BASE(h))
380 return (struct plain_hashmap_entry*) bucket_at(HASHMAP_BASE(h), idx); in plain_bucket_at()
384 return (struct ordered_hashmap_entry*) bucket_at(HASHMAP_BASE(h), idx); in ordered_bucket_at()
388 return (struct set_entry*) bucket_at(HASHMAP_BASE(h), idx); in set_bucket_at()
574 #define remove_entry(h, idx) base_remove_entry(HASHMAP_BASE(h), idx)
602 idx = prev_idx(HASHMAP_BASE(h), idx); in hashmap_iterate_in_insertion_order()
1058 hashmap_base_put_boldly(HASHMAP_BASE(h), idx, swap, may_resize)
1227 #define bucket_scan(h, idx, key) base_bucket_scan(HASHMAP_BASE(h), idx, key)
1504 old_key = bucket_at(HASHMAP_BASE(h), idx_old)->key; in hashmap_remove_and_replace()
1512 if (old_key != bucket_at(HASHMAP_BASE(h), idx_old)->key) in hashmap_remove_and_replace()
1513 idx_old = prev_idx(HASHMAP_BASE(h), idx_old); in hashmap_remove_and_replace()
1514 assert(old_key == bucket_at(HASHMAP_BASE(h), idx_old)->key); in hashmap_remove_and_replace()
1602 HASHMAP_FOREACH_IDX(idx, HASHMAP_BASE(other), i) { in _hashmap_merge()
1620 HASHMAP_FOREACH_IDX(idx, HASHMAP_BASE(other), i) { in set_merge()