Home
last modified time | relevance | path

Searched refs:hashv (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/elftoolchain/common/
H A Duthash.h129 #define HASH_BLOOM_ADD(tbl,hashv) \ argument
130 HASH_BLOOM_BITSET((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1)))
132 #define HASH_BLOOM_TEST(tbl,hashv) \ argument
133 HASH_BLOOM_BITTEST((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1)))
138 #define HASH_BLOOM_ADD(tbl,hashv) argument
139 #define HASH_BLOOM_TEST(tbl,hashv) (1) argument
182 (add)->hh.hashv, _ha_bkt); \
184 HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \
189 #define HASH_TO_BKT( hashv, num_bkts, bkt ) \ argument
191 bkt = ((hashv) & ((num_bkts) - 1)); \
[all …]
/freebsd/contrib/libucl/uthash/
H A Duthash.h128 #define HASH_BLOOM_ADD(tbl,hashv) \ argument
129 HASH_BLOOM_BITSET((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1)))
131 #define HASH_BLOOM_TEST(tbl,hashv) \ argument
132 HASH_BLOOM_BITTEST((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1)))
137 #define HASH_BLOOM_ADD(tbl,hashv) argument
138 #define HASH_BLOOM_TEST(tbl,hashv) (1) argument
192 (add)->hh.hashv, _ha_bkt); \
194 HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \
199 #define HASH_TO_BKT( hashv, num_bkts, bkt ) \ argument
201 bkt = ((hashv) & ((num_bkts) - 1)); \
[all …]
/freebsd/sys/netipsec/
H A Dkey.c943 uint32_t hashv; in key_allocsp() local
952 hashv = SPDCACHE_HASHVAL(spidx); in key_allocsp()
953 SPDCACHE_LOCK(hashv); in key_allocsp()
955 LIST_FOREACH_SAFE(entry, &V_spdcachehashtbl[hashv], chain, tmpentry) { in key_allocsp()
976 SPDCACHE_UNLOCK(hashv); in key_allocsp()
990 LIST_INSERT_HEAD(&V_spdcachehashtbl[hashv], entry, chain); in key_allocsp()
993 SPDCACHE_UNLOCK(hashv); in key_allocsp()