| /kernel/linux/linux-5.10/fs/ |
| D | dcookies.c | 226 unsigned int i, hash_bits; in dcookie_init() local
248 hash_bits = 0; in dcookie_init()
250 hash_bits++; in dcookie_init()
251 } while ((hash_size >> hash_bits) != 0); in dcookie_init()
252 hash_bits--; in dcookie_init()
258 hash_size = 1UL << hash_bits; in dcookie_init()
|
| D | io_uring.c | 1199 int hash_bits; in io_ring_ctx_alloc() local
1213 hash_bits = ilog2(p->cq_entries); in io_ring_ctx_alloc()
1214 hash_bits -= 5; in io_ring_ctx_alloc()
1215 if (hash_bits <= 0) in io_ring_ctx_alloc()
1216 hash_bits = 1; in io_ring_ctx_alloc()
1217 ctx->cancel_hash_bits = hash_bits; in io_ring_ctx_alloc()
1218 ctx->cancel_hash = kmalloc((1U << hash_bits) * sizeof(struct hlist_head), in io_ring_ctx_alloc()
1222 __hash_init(ctx->cancel_hash, 1U << hash_bits); in io_ring_ctx_alloc()
|
| /kernel/linux/linux-5.10/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
181 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
189 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
|
| /kernel/linux/linux-5.10/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
181 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
189 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/cavium/thunder/ |
| D | nic.h | 143 u8 hash_bits; member
493 u8 hash_bits; member
|
| D | nicvf_main.c | 342 mbx.rss_cfg.hash_bits = rss->hash_bits; in nicvf_config_rss()
380 rss->hash_bits = 0; in nicvf_rss_init()
392 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()
|
| /kernel/linux/linux-5.10/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()
593 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
|
| /kernel/linux/linux-5.10/drivers/md/ |
| D | dm-cache-policy-smq.c | 575 unsigned long long hash_bits; member
589 ht->hash_bits = __ffs(nr_buckets); in h_init()
624 unsigned h = hash_64(from_oblock(e->oblock), ht->hash_bits); in h_insert()
659 unsigned h = hash_64(from_oblock(oblock), ht->hash_bits); in h_lookup()
676 unsigned h = hash_64(from_oblock(e->oblock), ht->hash_bits); in h_remove()
|
| /kernel/linux/patches/linux-5.10/imx8mm_patch/patches/drivers/ |
| D | 0036_linux_drivers_staging.patch | 3892 +#define CLASS_ROUTE_HASH_SIZE(hash_bits) (((hash_bits) & 0xff) << 16)
|