Home
last modified time | relevance | path

Searched refs:cap_bits (Results 1 – 4 of 4) sorted by relevance

/linux/tools/lib/bpf/
H A Dhashmap.c47 map->cap_bits = 0; in hashmap__init()
73 map->cap = map->cap_bits = map->sz = 0; in hashmap__clear()
108 new_cap_bits = map->cap_bits + 1; in hashmap_grow()
123 map->cap_bits = 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()
/linux/tools/perf/util/
H A Dhashmap.c47 map->cap_bits = 0; in hashmap__init()
73 map->cap = map->cap_bits = map->sz = 0; in hashmap__clear()
108 new_cap_bits = map->cap_bits + 1; in hashmap_grow()
123 map->cap_bits = 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()
H A Dsharded_mutex.h17 unsigned int cap_bits; member
26 return &sm->mutexes[hash_bits(hash, sm->cap_bits)]; in sharded_mutex__get_mutex()
H A Dsharded_mutex.c20 result->cap_bits = bits; in sharded_mutex__new()
29 for (size_t i = 0; i < ((size_t)1 << sm->cap_bits); i++) in sharded_mutex__delete()