Home
last modified time | relevance | path

Searched refs:hash_bits (Results 1 – 5 of 5) sorted by relevance

/tools/perf/util/
A Dhashmap.c118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_delete()
A Dhashmap.h15 static inline size_t hash_bits(size_t h, int bits) in hash_bits() function
194 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
202 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
A Dsharded_mutex.h26 return &sm->mutexes[hash_bits(hash, sm->cap_bits)]; in sharded_mutex__get_mutex()
/tools/lib/bpf/
A Dhashmap.c118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap_delete()
A Dhashmap.h15 static inline size_t hash_bits(size_t h, int bits) in hash_bits() function
194 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
202 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \

Completed in 8 milliseconds