Home
last modified time | relevance | path

Searched refs:hashtable (Results 1 – 20 of 20) sorted by relevance

/linux/include/linux/ !
H A Dhashtable.h44 * @hashtable: hashtable to be initialized
46 * Calculates the size of the hashtable from the given parameter, otherwise
52 #define hash_init(hashtable) __hash_init(hashtable, HASH_SIZE(hashtable)) argument
55 * hash_add - add an object to a hashtable
56 * @hashtable: hashtable to add to
60 #define hash_add(hashtable, nod argument
69 hash_add_rcu(hashtable,node,key) global() argument
99 hash_empty(hashtable) global() argument
[all...]
/linux/tools/include/linux/ !
H A Dhashtable.h41 * @hashtable: hashtable to be initialized
43 * Calculates the size of the hashtable from the given parameter, otherwise
49 #define hash_init(hashtable) __hash_init(hashtable, HASH_SIZE(hashtable)) argument
52 * hash_add - add an object to a hashtable
53 * @hashtable: hashtable to add to
57 #define hash_add(hashtable, nod argument
87 hash_empty(hashtable) global() argument
[all...]
/linux/drivers/net/wireguard/ !
H A Dpeerlookup.c19 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()
96 * amount to 2^20*3 items in this hashtable. The algorithm below works by
H A Dpeerlookup.h11 #include <linux/hashtable.h>
19 DECLARE_HASHTABLE(hashtable, 11);
35 DECLARE_HASHTABLE(hashtable, 13);
/linux/Documentation/translations/zh_CN/security/ !
H A Dsiphash.rst60 DECLARE_HASHTABLE(hashtable, 8);
71 return &table->hashtable[siphash(input, sizeof(*input), &table->key) & (HASH_SIZE(table->hashtable) - 1)];
174 DECLARE_HASHTABLE(hashtable, 8);
185 return &table->hashtable[hsiphash(input, sizeof(*input), &table->key) & (HASH_SIZE(table->hashtable) - 1)];
/linux/Documentation/livepatch/ !
H A Dshadow-vars.rst11 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/Documentation/security/ !
H A Dsiphash.rst55 DECLARE_HASHTABLE(hashtable, 8);
66 return &table->hashtable[siphash(input, sizeof(*input), &table->key) & (HASH_SIZE(table->hashtable) - 1)];
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->hashtable) - 1)];
197 will not be a problem, as the hashtable lookup isn't the bottleneck. And in
/linux/drivers/infiniband/ulp/opa_vnic/ !
H A Dopa_vnic_internal.h56 #include <linux/hashtable.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/fs/afs/ !
H A Dxdr_fs.h92 __be16 hashtable[AFS_DIR_HASHTBL_SIZE]; member
H A Ddir_edit.c359 de->u.hash_next = meta->meta.hashtable[iter.bucket]; in afs_edit_dir_add()
360 meta->meta.hashtable[iter.bucket] = htons(entry); in afs_edit_dir_add()
463 /* Adjust the hash chain: if iter->prev_entry is 0, the hashtable head in afs_edit_dir_remove()
467 __be16 prev_next = meta->meta.hashtable[iter.bucket]; in afs_edit_dir_remove()
476 meta->meta.hashtable[iter.bucket] = next; in afs_edit_dir_remove()
H A Ddir_search.c134 entry = ntohs(meta->meta.hashtable[iter->bucket & (AFS_DIR_HASHTBL_SIZE - 1)]); in afs_dir_search_bucket()
/linux/fs/affs/ !
H A Damigaffs.h58 __be32 hashtable[]; member
/linux/Documentation/admin-guide/device-mapper/ !
H A Dvdo-design.rst349 This claim is implemented as an entry in a hashtable where the key is
353 If a data_vio looks in the hashtable and finds that another data_vio is
363 hashtable. This implicit locking is handled by the zone divisions
375 lock, like the logical block lock in step 2, is a hashtable entry
412 added to a hashtable like the logical block locks in step 2. This
413 hashtable is also covered by the implicit physical zone lock. The
435 tracked in a hashtable similar to the way logical block locks are
436 tracked in step 2. This hashtable is covered by the implicit lock on
440 data_vio obtains a hash lock from the pool, adds it to the hashtable,
/linux/Documentation/bpf/ !
H A Dprog_sk_lookup.rst55 hashtable-based lookup, while ``SK_DROP`` causes the transport layer to drop the
/linux/Documentation/networking/ !
H A Dnf_flowtable.rst27 The flowtable uses a resizable hashtable. Lookups are based on the following
H A Dscaling.rst284 Per-flow rate is calculated by hashing each packet into a hashtable
/linux/Documentation/RCU/ !
H A DlistRCU.rst303 through a hashtable using an RCU-managed hlist for the hash chains. When a new
/linux/Documentation/driver-api/media/ !
H A Dv4l2-controls.rst90 handler is expected to handle. It will allocate a hashtable based on this
/linux/lib/ !
H A DKconfig.debug2765 This builds the hashtable KUnit test suite.
2767 include/linux/hashtable.h. For more information on KUnit and
/linux/Documentation/trace/ !
H A Dhistogram.rst119 are in terms of hashtable entries - if a run uses more entries than