| /linux-6.12.1/tools/lib/bpf/ |
| D | hashmap.c | 118 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()
|
| D | hashmap.h | 15 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)] \
|
| /linux-6.12.1/tools/perf/util/ |
| D | hashmap.c | 118 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()
|
| D | hashmap.h | 15 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)] \
|
| D | sharded_mutex.h | 26 return &sm->mutexes[hash_bits(hash, sm->cap_bits)]; in sharded_mutex__get_mutex()
|
| /linux-6.12.1/io_uring/ |
| D | poll.c | 124 u32 index = hash_long(req->cqe.user_data, table->hash_bits); in io_poll_req_insert()
135 u32 index = hash_long(req->cqe.user_data, table->hash_bits); in io_poll_req_delete()
146 u32 index = hash_long(req->cqe.user_data, table->hash_bits); in io_poll_req_insert_locked()
768 unsigned nr_buckets = 1U << table->hash_bits; in io_poll_remove_all_table()
810 u32 index = hash_long(cd->data, table->hash_bits); in io_poll_find()
837 unsigned nr_buckets = 1U << table->hash_bits; in io_poll_file_find()
|
| D | fdinfo.c | 193 for (i = 0; i < (1U << ctx->cancel_table.hash_bits); i++) { in io_uring_show_fdinfo()
|
| D | io_uring.c | 271 table->hash_bits = bits; in io_alloc_hash_table()
279 int hash_bits; in io_ring_ctx_alloc() local
293 hash_bits = ilog2(p->cq_entries) - 5; in io_ring_ctx_alloc()
294 hash_bits = clamp(hash_bits, 1, 8); in io_ring_ctx_alloc()
295 if (io_alloc_hash_table(&ctx->cancel_table, hash_bits)) in io_ring_ctx_alloc()
297 if (io_alloc_hash_table(&ctx->cancel_table_locked, hash_bits)) in io_ring_ctx_alloc()
|
| /linux-6.12.1/lib/zlib_deflate/ |
| D | deflate.c | 256 s->hash_bits = memLevel + 7; in zlib_deflateInit2()
257 s->hash_size = 1 << s->hash_bits; in zlib_deflateInit2()
259 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); in zlib_deflateInit2()
600 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
|
| D | defutil.h | 116 uInt hash_bits; /* log2(hash_size) */ member
|
| /linux-6.12.1/drivers/net/ethernet/cavium/thunder/ |
| D | nic.h | 143 u8 hash_bits; member
493 u8 hash_bits; member
|
| D | nicvf_main.c | 341 mbx.rss_cfg.hash_bits = rss->hash_bits; in nicvf_config_rss()
379 rss->hash_bits = 0; in nicvf_rss_init()
391 rss->hash_bits = ilog2(rounddown_pow_of_two(rss->rss_size)); in nicvf_rss_init()
|
| D | nic_main.c | 594 cpi_cfg |= (cfg->hash_bits << 20); in nic_config_rss()
|
| /linux-6.12.1/drivers/md/ |
| D | dm-cache-policy-smq.c | 577 unsigned long long hash_bits; member
591 ht->hash_bits = __ffs(nr_buckets); in h_init()
626 unsigned int h = hash_64(from_oblock(e->oblock), ht->hash_bits); in h_insert()
662 unsigned int h = hash_64(from_oblock(oblock), ht->hash_bits); in h_lookup()
679 unsigned int h = hash_64(from_oblock(e->oblock), ht->hash_bits); in h_remove()
|
| /linux-6.12.1/include/linux/ |
| D | io_uring_types.h | 76 unsigned hash_bits; member
|