Home
last modified time | relevance | path

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

12

/openbmc/linux/include/linux/
H A Dhashtable.h52 #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
/openbmc/linux/tools/include/linux/
H A Dhashtable.h49 #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
/openbmc/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()
H A Dpeerlookup.h19 DECLARE_HASHTABLE(hashtable, 11);
35 DECLARE_HASHTABLE(hashtable, 13);
/openbmc/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 …]
/openbmc/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…
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
/openbmc/linux/drivers/infiniband/ulp/opa_vnic/
H A Dopa_vnic_internal.h274 #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))])
/openbmc/linux/net/sunrpc/
H A Dauth.c25 struct hlist_head *hashtable; member
298 new->hashtable = kcalloc(hashsize, sizeof(new->hashtable[0]), GFP_KERNEL); in rpcauth_init_credcache()
299 if (!new->hashtable) in rpcauth_init_credcache()
389 head = &cache->hashtable[i]; in rpcauth_clear_credcache()
414 kfree(cache->hashtable); in rpcauth_destroy_credcache()
526 hlist_for_each_entry_rcu(entry, &cache->hashtable[nr], cr_hash) { in rpcauth_lookup_credcache()
545 hlist_for_each_entry(entry, &cache->hashtable[nr], cr_hash) { in rpcauth_lookup_credcache()
556 hlist_add_head_rcu(&cred->cr_hash, &cache->hashtable[nr]); in rpcauth_lookup_credcache()
/openbmc/u-boot/test/env/
H A DMakefile7 obj-y += hashtable.o
/openbmc/linux/security/selinux/
H A DKconfig50 int "SELinux sidtab hashtable size"
55 This option sets the number of buckets used in the sidtab hashtable
/openbmc/linux/fs/afs/
H A Dxdr_fs.h92 __be16 hashtable[AFS_DIR_HASHTBL_SIZE]; member
/openbmc/linux/fs/affs/
H A Damigaffs.h57 __be32 hashtable[1]; member
H A Daffs.h18 #define AFFS_GET_HASHENTRY(data,hashkey) be32_to_cpu(((struct dir_front *)data)->hashtable[hashkey])
/openbmc/u-boot/lib/
H A DMakefile82 obj-y += hashtable.o
/openbmc/linux/tools/perf/util/
H A Dauxtrace.c1961 struct hlist_head *hashtable; member
1989 c->hashtable = ht; in auxtrace_cache__new()
2012 hlist_for_each_entry_safe(entry, tmp, &c->hashtable[i], hash) { in auxtrace_cache__drop()
2027 zfree(&c->hashtable); in auxtrace_cache__free()
2049 hlist_add_head(&entry->hash, &c->hashtable[hash_32(key, c->bits)]); in auxtrace_cache__add()
2064 hlist = &c->hashtable[hash_32(key, c->bits)]; in auxtrace_cache__rm()
2090 hlist = &c->hashtable[hash_32(key, c->bits)]; in auxtrace_cache__lookup()
/openbmc/linux/Documentation/bpf/
H A Dprog_sk_lookup.rst55 hashtable-based lookup, while ``SK_DROP`` causes the transport layer to drop the
/openbmc/openbmc/poky/meta/recipes-core/udev/eudev/
H A D0001-random-util.c-sync-dev_urandom-implementation-to-sys.patch76 - * of seeding the hash functions for hashtable */
/openbmc/linux/Documentation/networking/
H A Dnf_flowtable.rst27 The flowtable uses a resizable hashtable. Lookups are based on the following
H A Dscaling.rst220 Per-flow rate is calculated by hashing each packet into a hashtable
/openbmc/openbmc/poky/meta/recipes-devtools/rust/
H A Dcargo-c-crates.inc113 crate://crates.io/gix-hashtable/0.5.2 \
453 SRC_URI[gix-hashtable-0.5.2.sha256sum] = "7ddf80e16f3c19ac06ce415a38b8591993d3f73aede049cb561becb5b…
/openbmc/linux/Documentation/RCU/
H A DlistRCU.rst294 through a hashtable using an RCU-managed hlist for the hash chains. When a new
/openbmc/linux/Documentation/driver-api/media/
H A Dv4l2-controls.rst90 handler is expected to handle. It will allocate a hashtable based on this
/openbmc/linux/lib/
H A DKconfig.debug2615 This builds the hashtable KUnit test suite.
2617 include/linux/hashtable.h. For more information on KUnit and
/openbmc/linux/Documentation/trace/
H A Dhistogram.rst119 are in terms of hashtable entries - if a run uses more entries than
/openbmc/u-boot/
H A DREADME2885 lib/hashtable.c for details.

12