Lines Matching defs:hash
53 int lockdep_rht_bucket_is_held(const struct bucket_table *tbl, u32 hash)
59 return bit_spin_is_locked(0, (unsigned long *)&tbl->buckets[hash]);
375 * rhashtable_shrink - Shrink hash table while allowing concurrent lookups
376 * @ht: the hash table to shrink
378 * This function shrinks the hash table to fit, i.e., the smallest
492 struct bucket_table *tbl, unsigned int hash,
504 rht_for_each_from(head, rht_ptr(bkt, tbl, hash), tbl, hash) {
524 head = rht_dereference_bucket(head->next, tbl, hash);
543 struct bucket_table *tbl, unsigned int hash, struct rhash_head *obj,
568 head = rht_ptr(bkt, tbl, hash);
597 unsigned int hash;
604 hash = rht_head_hashfn(ht, tbl, obj, ht->p);
607 bkt = rht_bucket_var(tbl, hash);
609 bkt = rht_bucket_insert(ht, tbl, hash);
616 hash, key, obj);
618 hash, obj, data);
653 * This function prepares a hash table walk.
661 * structure outside the hash table.
701 * rhashtable_walk_start_check - Start a hash table walk
704 * Start a hash table walk at the current iterator position. Note that we take
928 * rhashtable_walk_stop - Finish a hash table walk
931 * Finish a hash table walk. Does not reset the iterator to the start of the
932 * hash table.
978 * rhashtable_init - initialize a new hash table
979 * @ht: hash table to be initialized
982 * Initializes a new hash table based on the provided configuration
1010 * return [... hash ...];
1082 * rhltable_init - initialize a new hash list table
1083 * @hlt: hash list table to be initialized
1086 * Initializes a new hash list table.
1120 * rhashtable_free_and_destroy - free elements and destroy hash table
1121 * @ht: the hash table to destroy
1179 const struct bucket_table *tbl, unsigned int hash)
1182 unsigned int index = hash & ((1 << tbl->nest) - 1);
1184 unsigned int subhash = hash;
1188 ntbl = rht_dereference_bucket_rcu(ntbl[index].table, tbl, hash);
1194 tbl, hash);
1208 const struct bucket_table *tbl, unsigned int hash)
1214 return __rht_bucket_nested(tbl, hash) ?: &rhnull;
1219 struct rhashtable *ht, struct bucket_table *tbl, unsigned int hash)
1222 unsigned int index = hash & ((1 << tbl->nest) - 1);
1227 hash >>= tbl->nest;
1232 index = hash & ((1 << shift) - 1);
1234 hash >>= shift;
1242 return &ntbl[hash].bucket;