| /linux-6.1.9/include/linux/ |
| D | hashtable.h | 52 #define hash_init(hashtable) __hash_init(hashtable, HASH_SIZE(hashtable)) argument
60 #define hash_add(hashtable, node, key) \ argument
61 hlist_add_head(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
69 #define hash_add_rcu(hashtable, node, key) \ argument
70 hlist_add_head_rcu(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
99 #define hash_empty(hashtable) __hash_empty(hashtable, HASH_SIZE(hashtable)) argument
|
| /linux-6.1.9/tools/include/linux/ |
| D | hashtable.h | 49 #define hash_init(hashtable) __hash_init(hashtable, HASH_SIZE(hashtable)) argument
57 #define hash_add(hashtable, node, key) \ argument
58 hlist_add_head(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
87 #define hash_empty(hashtable) __hash_empty(hashtable, HASH_SIZE(hashtable)) argument
|
| /linux-6.1.9/drivers/net/wireguard/ |
| D | peerlookup.c | 19 return &table->hashtable[hash & (HASH_SIZE(table->hashtable) - 1)]; in pubkey_bucket()
30 hash_init(table->hashtable); in wg_pubkey_hashtable_alloc()
79 return &table->hashtable[(__force u32)index & in index_bucket()
80 (HASH_SIZE(table->hashtable) - 1)]; in index_bucket()
90 hash_init(table->hashtable); in wg_index_hashtable_alloc()
|
| D | peerlookup.h | 19 DECLARE_HASHTABLE(hashtable, 11);
35 DECLARE_HASHTABLE(hashtable, 13);
|
| /linux-6.1.9/Documentation/livepatch/ |
| D | shadow-vars.rst | 11 The implementation introduces a global, in-kernel hashtable that
15 specifically, the parent pointer serves as the hashtable key while the
16 numeric id subsequently filters hashtable queries. Multiple shadow
26 A hashtable references all shadow variables. These references are
49 - search hashtable for <obj, id> pair
52 - search hashtable for <obj, id> pair
62 - add <obj, id> to the global hashtable
65 - search hashtable for <obj, id> pair
75 - add <obj, id> pair to the global hashtable
78 - find and remove a <obj, id> reference from global hashtable
[all …]
|
| /linux-6.1.9/Documentation/security/ |
| D | siphash.rst | 55 DECLARE_HASHTABLE(hashtable, 8);
66 …return &table->hashtable[siphash(input, sizeof(*input), &table->key) & (HASH_SIZE(table->hashtable…
127 Do not ever use the hsiphash functions except for as a hashtable key
130 over `jhash` as a means of mitigating hashtable flooding denial of service
177 DECLARE_HASHTABLE(hashtable, 8);
188 …return &table->hashtable[hsiphash(input, sizeof(*input), &table->key) & (HASH_SIZE(table->hashtabl…
197 will not be a problem, as the hashtable lookup isn't the bottleneck. And in
|
| /linux-6.1.9/drivers/infiniband/ulp/opa_vnic/ |
| D | opa_vnic_internal.h | 274 #define vnic_hash_init(hashtable) __hash_init(hashtable, OPA_VNIC_MAC_TBL_SIZE) argument
276 #define vnic_hash_add(hashtable, node, key) \ argument
278 &hashtable[hash_min(key, ilog2(OPA_VNIC_MAC_TBL_SIZE))])
|
| /linux-6.1.9/net/sunrpc/ |
| D | auth.c | 25 struct hlist_head *hashtable; member
301 new->hashtable = kcalloc(hashsize, sizeof(new->hashtable[0]), GFP_KERNEL); in rpcauth_init_credcache()
302 if (!new->hashtable) in rpcauth_init_credcache()
392 head = &cache->hashtable[i]; in rpcauth_clear_credcache()
417 kfree(cache->hashtable); in rpcauth_destroy_credcache()
529 hlist_for_each_entry_rcu(entry, &cache->hashtable[nr], cr_hash) { in rpcauth_lookup_credcache()
548 hlist_for_each_entry(entry, &cache->hashtable[nr], cr_hash) { in rpcauth_lookup_credcache()
559 hlist_add_head_rcu(&cred->cr_hash, &cache->hashtable[nr]); in rpcauth_lookup_credcache()
|
| /linux-6.1.9/fs/afs/ |
| D | xdr_fs.h | 92 __be16 hashtable[AFS_DIR_HASHTBL_SIZE]; member
|
| /linux-6.1.9/fs/affs/ |
| D | amigaffs.h | 57 __be32 hashtable[1]; member
|
| D | affs.h | 18 #define AFFS_GET_HASHENTRY(data,hashkey) be32_to_cpu(((struct dir_front *)data)->hashtable[hashkey])
|
| /linux-6.1.9/security/selinux/ |
| D | Kconfig | 97 int "NSA SELinux sidtab hashtable size"
102 This option sets the number of buckets used in the sidtab hashtable
|
| /linux-6.1.9/tools/perf/util/ |
| D | auxtrace.c | 1950 struct hlist_head *hashtable; member
1978 c->hashtable = ht; in auxtrace_cache__new()
2001 hlist_for_each_entry_safe(entry, tmp, &c->hashtable[i], hash) { in auxtrace_cache__drop()
2016 zfree(&c->hashtable); in auxtrace_cache__free()
2038 hlist_add_head(&entry->hash, &c->hashtable[hash_32(key, c->bits)]); in auxtrace_cache__add()
2053 hlist = &c->hashtable[hash_32(key, c->bits)]; in auxtrace_cache__rm()
2079 hlist = &c->hashtable[hash_32(key, c->bits)]; in auxtrace_cache__lookup()
|
| /linux-6.1.9/Documentation/bpf/ |
| D | prog_sk_lookup.rst | 55 hashtable-based lookup, while ``SK_DROP`` causes the transport layer to drop the
|
| /linux-6.1.9/Documentation/networking/ |
| D | nf_flowtable.rst | 27 The flowtable uses a resizable hashtable. Lookups are based on the following
|
| D | scaling.rst | 220 Per-flow rate is calculated by hashing each packet into a hashtable
|
| /linux-6.1.9/Documentation/RCU/ |
| D | listRCU.rst | 274 through a hashtable using an RCU-managed hlist for the hash chains. When a new
|
| /linux-6.1.9/Documentation/driver-api/media/ |
| D | v4l2-controls.rst | 90 handler is expected to handle. It will allocate a hashtable based on this
|
| /linux-6.1.9/Documentation/trace/ |
| D | histogram.rst | 116 are in terms of hashtable entries - if a run uses more entries than
|