Lines Matching refs:tbl
38 const struct bucket_table *tbl, in head_hashfn() argument
41 return rht_head_hashfn(ht, tbl, he, ht->p); in head_hashfn()
53 int lockdep_rht_bucket_is_held(const struct bucket_table *tbl, u32 hash) in lockdep_rht_bucket_is_held() argument
57 if (unlikely(tbl->nest)) in lockdep_rht_bucket_is_held()
59 return bit_spin_is_locked(0, (unsigned long *)&tbl->buckets[hash]); in lockdep_rht_bucket_is_held()
67 const struct bucket_table *tbl) in nested_table_top() argument
72 return (void *)rcu_dereference_protected(tbl->buckets[0], 1); in nested_table_top()
94 static void nested_bucket_table_free(const struct bucket_table *tbl) in nested_bucket_table_free() argument
96 unsigned int size = tbl->size >> tbl->nest; in nested_bucket_table_free()
97 unsigned int len = 1 << tbl->nest; in nested_bucket_table_free()
101 ntbl = nested_table_top(tbl); in nested_bucket_table_free()
109 static void bucket_table_free(const struct bucket_table *tbl) in bucket_table_free() argument
111 if (tbl->nest) in bucket_table_free()
112 nested_bucket_table_free(tbl); in bucket_table_free()
114 kvfree(tbl); in bucket_table_free()
152 struct bucket_table *tbl; in nested_bucket_table_alloc() local
158 size = sizeof(*tbl) + sizeof(tbl->buckets[0]); in nested_bucket_table_alloc()
160 tbl = kzalloc(size, gfp); in nested_bucket_table_alloc()
161 if (!tbl) in nested_bucket_table_alloc()
164 if (!nested_table_alloc(ht, (union nested_table __rcu **)tbl->buckets, in nested_bucket_table_alloc()
166 kfree(tbl); in nested_bucket_table_alloc()
170 tbl->nest = (ilog2(nbuckets) - 1) % shift + 1; in nested_bucket_table_alloc()
172 return tbl; in nested_bucket_table_alloc()
179 struct bucket_table *tbl = NULL; in bucket_table_alloc() local
184 tbl = kvzalloc(struct_size(tbl, buckets, nbuckets), gfp); in bucket_table_alloc()
188 if (tbl == NULL && (gfp & ~__GFP_NOFAIL) != GFP_KERNEL) { in bucket_table_alloc()
189 tbl = nested_bucket_table_alloc(ht, nbuckets, gfp); in bucket_table_alloc()
193 if (tbl == NULL) in bucket_table_alloc()
196 lockdep_init_map(&tbl->dep_map, "rhashtable_bucket", &__key, 0); in bucket_table_alloc()
198 tbl->size = size; in bucket_table_alloc()
200 rcu_head_init(&tbl->rcu); in bucket_table_alloc()
201 INIT_LIST_HEAD(&tbl->walkers); in bucket_table_alloc()
203 tbl->hash_rnd = get_random_u32(); in bucket_table_alloc()
206 INIT_RHT_NULLS_HEAD(tbl->buckets[i]); in bucket_table_alloc()
208 return tbl; in bucket_table_alloc()
212 struct bucket_table *tbl) in rhashtable_last_table() argument
217 new_tbl = tbl; in rhashtable_last_table()
218 tbl = rht_dereference_rcu(tbl->future_tbl, ht); in rhashtable_last_table()
219 } while (tbl); in rhashtable_last_table()
228 struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); in rhashtable_rehash_one()
277 struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); in rhashtable_rehash_chain()
314 struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); in rhashtable_rehash_table()
332 rcu_assign_pointer(ht->tbl, new_tbl); in rhashtable_rehash_table()
336 walker->tbl = NULL; in rhashtable_rehash_table()
389 struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); in rhashtable_shrink()
410 struct bucket_table *tbl; in rht_deferred_worker() local
416 tbl = rht_dereference(ht->tbl, ht); in rht_deferred_worker()
417 tbl = rhashtable_last_table(ht, tbl); in rht_deferred_worker()
419 if (rht_grow_above_75(ht, tbl)) in rht_deferred_worker()
420 err = rhashtable_rehash_alloc(ht, tbl, tbl->size * 2); in rht_deferred_worker()
421 else if (ht->p.automatic_shrinking && rht_shrink_below_30(ht, tbl)) in rht_deferred_worker()
423 else if (tbl->nest) in rht_deferred_worker()
424 err = rhashtable_rehash_alloc(ht, tbl, tbl->size); in rht_deferred_worker()
440 struct bucket_table *tbl) in rhashtable_insert_rehash() argument
447 old_tbl = rht_dereference_rcu(ht->tbl, ht); in rhashtable_insert_rehash()
449 size = tbl->size; in rhashtable_insert_rehash()
453 if (rht_grow_above_75(ht, tbl)) in rhashtable_insert_rehash()
456 else if (old_tbl != tbl) in rhashtable_insert_rehash()
465 err = rhashtable_rehash_attach(ht, tbl, new_tbl); in rhashtable_insert_rehash()
477 if (likely(rcu_access_pointer(tbl->future_tbl))) in rhashtable_insert_rehash()
489 struct bucket_table *tbl, unsigned int hash, in rhashtable_lookup_one() argument
501 rht_for_each_from(head, rht_ptr(bkt, tbl, hash), tbl, hash) { in rhashtable_lookup_one()
521 head = rht_dereference_bucket(head->next, tbl, hash); in rhashtable_lookup_one()
540 struct bucket_table *tbl, unsigned int hash, struct rhash_head *obj, in rhashtable_insert_one() argument
552 new_tbl = rht_dereference_rcu(tbl->future_tbl, ht); in rhashtable_insert_one()
559 if (unlikely(rht_grow_above_max(ht, tbl))) in rhashtable_insert_one()
562 if (unlikely(rht_grow_above_100(ht, tbl))) in rhashtable_insert_one()
565 head = rht_ptr(bkt, tbl, hash); in rhashtable_insert_one()
581 if (rht_grow_above_75(ht, tbl)) in rhashtable_insert_one()
591 struct bucket_table *tbl; in rhashtable_try_insert() local
596 new_tbl = rcu_dereference(ht->tbl); in rhashtable_try_insert()
599 tbl = new_tbl; in rhashtable_try_insert()
600 hash = rht_head_hashfn(ht, tbl, obj, ht->p); in rhashtable_try_insert()
601 if (rcu_access_pointer(tbl->future_tbl)) in rhashtable_try_insert()
603 bkt = rht_bucket_var(tbl, hash); in rhashtable_try_insert()
605 bkt = rht_bucket_insert(ht, tbl, hash); in rhashtable_try_insert()
607 new_tbl = rht_dereference_rcu(tbl->future_tbl, ht); in rhashtable_try_insert()
610 rht_lock(tbl, bkt); in rhashtable_try_insert()
611 data = rhashtable_lookup_one(ht, bkt, tbl, in rhashtable_try_insert()
613 new_tbl = rhashtable_insert_one(ht, bkt, tbl, in rhashtable_try_insert()
618 rht_unlock(tbl, bkt); in rhashtable_try_insert()
623 data = ERR_PTR(rhashtable_insert_rehash(ht, tbl) ?: in rhashtable_try_insert()
674 iter->walker.tbl = in rhashtable_walk_enter()
675 rcu_dereference_protected(ht->tbl, lockdep_is_held(&ht->lock)); in rhashtable_walk_enter()
676 list_add(&iter->walker.list, &iter->walker.tbl->walkers); in rhashtable_walk_enter()
690 if (iter->walker.tbl) in rhashtable_walk_exit()
723 if (iter->walker.tbl) in rhashtable_walk_start_check()
729 if (!iter->walker.tbl) { in rhashtable_walk_start_check()
730 iter->walker.tbl = rht_dereference_rcu(ht->tbl, ht); in rhashtable_walk_start_check()
743 rht_for_each_rcu(p, iter->walker.tbl, iter->slot) { in rhashtable_walk_start_check()
758 rht_for_each_rcu(p, iter->walker.tbl, iter->slot) { in rhashtable_walk_start_check()
789 struct bucket_table *tbl = iter->walker.tbl; in __rhashtable_walk_find_next() local
795 if (!tbl) in __rhashtable_walk_find_next()
798 for (; iter->slot < tbl->size; iter->slot++) { in __rhashtable_walk_find_next()
801 rht_for_each_rcu(p, tbl, iter->slot) { in __rhashtable_walk_find_next()
835 iter->walker.tbl = rht_dereference_rcu(tbl->future_tbl, ht); in __rhashtable_walk_find_next()
836 if (iter->walker.tbl) { in __rhashtable_walk_find_next()
934 struct bucket_table *tbl = iter->walker.tbl; in rhashtable_walk_stop() local
936 if (!tbl) in rhashtable_walk_stop()
942 if (rcu_head_after_call_rcu(&tbl->rcu, bucket_table_free_rcu)) in rhashtable_walk_stop()
944 iter->walker.tbl = NULL; in rhashtable_walk_stop()
946 list_add(&iter->walker.list, &tbl->walkers); in rhashtable_walk_stop()
1018 struct bucket_table *tbl; in rhashtable_init() local
1061 tbl = bucket_table_alloc(ht, size, GFP_KERNEL); in rhashtable_init()
1062 if (unlikely(tbl == NULL)) { in rhashtable_init()
1064 tbl = bucket_table_alloc(ht, size, GFP_KERNEL | __GFP_NOFAIL); in rhashtable_init()
1069 RCU_INIT_POINTER(ht->tbl, tbl); in rhashtable_init()
1134 struct bucket_table *tbl, *next_tbl; in rhashtable_free_and_destroy() local
1140 tbl = rht_dereference(ht->tbl, ht); in rhashtable_free_and_destroy()
1143 for (i = 0; i < tbl->size; i++) { in rhashtable_free_and_destroy()
1147 for (pos = rht_ptr_exclusive(rht_bucket(tbl, i)), in rhashtable_free_and_destroy()
1158 next_tbl = rht_dereference(tbl->future_tbl, ht); in rhashtable_free_and_destroy()
1159 bucket_table_free(tbl); in rhashtable_free_and_destroy()
1161 tbl = next_tbl; in rhashtable_free_and_destroy()
1175 const struct bucket_table *tbl, unsigned int hash) in __rht_bucket_nested() argument
1178 unsigned int index = hash & ((1 << tbl->nest) - 1); in __rht_bucket_nested()
1179 unsigned int size = tbl->size >> tbl->nest; in __rht_bucket_nested()
1183 ntbl = nested_table_top(tbl); in __rht_bucket_nested()
1184 ntbl = rht_dereference_bucket_rcu(ntbl[index].table, tbl, hash); in __rht_bucket_nested()
1185 subhash >>= tbl->nest; in __rht_bucket_nested()
1190 tbl, hash); in __rht_bucket_nested()
1204 const struct bucket_table *tbl, unsigned int hash) in rht_bucket_nested() argument
1210 return __rht_bucket_nested(tbl, hash) ?: &rhnull; in rht_bucket_nested()
1215 struct rhashtable *ht, struct bucket_table *tbl, unsigned int hash) in rht_bucket_nested_insert() argument
1218 unsigned int index = hash & ((1 << tbl->nest) - 1); in rht_bucket_nested_insert()
1219 unsigned int size = tbl->size >> tbl->nest; in rht_bucket_nested_insert()
1222 ntbl = nested_table_top(tbl); in rht_bucket_nested_insert()
1223 hash >>= tbl->nest; in rht_bucket_nested_insert()