]>
Commit | Line | Data |
---|---|---|
7e1e7763 TG |
1 | /* |
2 | * Resizable, Scalable, Concurrent Hash Table | |
3 | * | |
02fd97c3 | 4 | * Copyright (c) 2015 Herbert Xu <herbert@gondor.apana.org.au> |
a5ec68e3 | 5 | * Copyright (c) 2014-2015 Thomas Graf <tgraf@suug.ch> |
7e1e7763 TG |
6 | * Copyright (c) 2008-2014 Patrick McHardy <kaber@trash.net> |
7 | * | |
7e1e7763 | 8 | * Code partially derived from nft_hash |
02fd97c3 HX |
9 | * Rewritten with rehash code from br_multicast plus single list |
10 | * pointer as suggested by Josh Triplett | |
7e1e7763 TG |
11 | * |
12 | * This program is free software; you can redistribute it and/or modify | |
13 | * it under the terms of the GNU General Public License version 2 as | |
14 | * published by the Free Software Foundation. | |
15 | */ | |
16 | ||
07ee0722 | 17 | #include <linux/atomic.h> |
7e1e7763 TG |
18 | #include <linux/kernel.h> |
19 | #include <linux/init.h> | |
20 | #include <linux/log2.h> | |
5beb5c90 | 21 | #include <linux/sched.h> |
7e1e7763 TG |
22 | #include <linux/slab.h> |
23 | #include <linux/vmalloc.h> | |
24 | #include <linux/mm.h> | |
87545899 | 25 | #include <linux/jhash.h> |
7e1e7763 TG |
26 | #include <linux/random.h> |
27 | #include <linux/rhashtable.h> | |
61d7b097 | 28 | #include <linux/err.h> |
6d795413 | 29 | #include <linux/export.h> |
7e1e7763 TG |
30 | |
31 | #define HASH_DEFAULT_SIZE 64UL | |
c2e213cf | 32 | #define HASH_MIN_SIZE 4U |
4cf0b354 | 33 | #define BUCKET_LOCKS_PER_CPU 32UL |
97defe1e | 34 | |
988dfbd7 | 35 | static u32 head_hashfn(struct rhashtable *ht, |
8d24c0b4 TG |
36 | const struct bucket_table *tbl, |
37 | const struct rhash_head *he) | |
7e1e7763 | 38 | { |
02fd97c3 | 39 | return rht_head_hashfn(ht, tbl, he, ht->p); |
7e1e7763 TG |
40 | } |
41 | ||
a03eaec0 | 42 | #ifdef CONFIG_PROVE_LOCKING |
a03eaec0 | 43 | #define ASSERT_RHT_MUTEX(HT) BUG_ON(!lockdep_rht_mutex_is_held(HT)) |
a03eaec0 TG |
44 | |
45 | int lockdep_rht_mutex_is_held(struct rhashtable *ht) | |
46 | { | |
47 | return (debug_locks) ? lockdep_is_held(&ht->mutex) : 1; | |
48 | } | |
49 | EXPORT_SYMBOL_GPL(lockdep_rht_mutex_is_held); | |
50 | ||
51 | int lockdep_rht_bucket_is_held(const struct bucket_table *tbl, u32 hash) | |
52 | { | |
02fd97c3 | 53 | spinlock_t *lock = rht_bucket_lock(tbl, hash); |
a03eaec0 TG |
54 | |
55 | return (debug_locks) ? lockdep_is_held(lock) : 1; | |
56 | } | |
57 | EXPORT_SYMBOL_GPL(lockdep_rht_bucket_is_held); | |
58 | #else | |
59 | #define ASSERT_RHT_MUTEX(HT) | |
a03eaec0 TG |
60 | #endif |
61 | ||
62 | ||
b9ecfdaa HX |
63 | static int alloc_bucket_locks(struct rhashtable *ht, struct bucket_table *tbl, |
64 | gfp_t gfp) | |
97defe1e TG |
65 | { |
66 | unsigned int i, size; | |
67 | #if defined(CONFIG_PROVE_LOCKING) | |
68 | unsigned int nr_pcpus = 2; | |
69 | #else | |
70 | unsigned int nr_pcpus = num_possible_cpus(); | |
71 | #endif | |
72 | ||
4cf0b354 | 73 | nr_pcpus = min_t(unsigned int, nr_pcpus, 64UL); |
97defe1e TG |
74 | size = roundup_pow_of_two(nr_pcpus * ht->p.locks_mul); |
75 | ||
a5ec68e3 TG |
76 | /* Never allocate more than 0.5 locks per bucket */ |
77 | size = min_t(unsigned int, size, tbl->size >> 1); | |
97defe1e TG |
78 | |
79 | if (sizeof(spinlock_t) != 0) { | |
9dbeea7f | 80 | tbl->locks = NULL; |
97defe1e | 81 | #ifdef CONFIG_NUMA |
b9ecfdaa HX |
82 | if (size * sizeof(spinlock_t) > PAGE_SIZE && |
83 | gfp == GFP_KERNEL) | |
97defe1e | 84 | tbl->locks = vmalloc(size * sizeof(spinlock_t)); |
97defe1e | 85 | #endif |
4cf0b354 FW |
86 | if (gfp != GFP_KERNEL) |
87 | gfp |= __GFP_NOWARN | __GFP_NORETRY; | |
88 | ||
9dbeea7f ED |
89 | if (!tbl->locks) |
90 | tbl->locks = kmalloc_array(size, sizeof(spinlock_t), | |
91 | gfp); | |
97defe1e TG |
92 | if (!tbl->locks) |
93 | return -ENOMEM; | |
94 | for (i = 0; i < size; i++) | |
95 | spin_lock_init(&tbl->locks[i]); | |
96 | } | |
97 | tbl->locks_mask = size - 1; | |
98 | ||
99 | return 0; | |
100 | } | |
101 | ||
102 | static void bucket_table_free(const struct bucket_table *tbl) | |
103 | { | |
104 | if (tbl) | |
105 | kvfree(tbl->locks); | |
106 | ||
107 | kvfree(tbl); | |
108 | } | |
109 | ||
9d901bc0 HX |
110 | static void bucket_table_free_rcu(struct rcu_head *head) |
111 | { | |
112 | bucket_table_free(container_of(head, struct bucket_table, rcu)); | |
113 | } | |
114 | ||
97defe1e | 115 | static struct bucket_table *bucket_table_alloc(struct rhashtable *ht, |
b9ecfdaa HX |
116 | size_t nbuckets, |
117 | gfp_t gfp) | |
7e1e7763 | 118 | { |
eb6d1abf | 119 | struct bucket_table *tbl = NULL; |
7e1e7763 | 120 | size_t size; |
f89bd6f8 | 121 | int i; |
7e1e7763 TG |
122 | |
123 | size = sizeof(*tbl) + nbuckets * sizeof(tbl->buckets[0]); | |
b9ecfdaa HX |
124 | if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER) || |
125 | gfp != GFP_KERNEL) | |
126 | tbl = kzalloc(size, gfp | __GFP_NOWARN | __GFP_NORETRY); | |
127 | if (tbl == NULL && gfp == GFP_KERNEL) | |
7e1e7763 | 128 | tbl = vzalloc(size); |
7e1e7763 TG |
129 | if (tbl == NULL) |
130 | return NULL; | |
131 | ||
132 | tbl->size = nbuckets; | |
133 | ||
b9ecfdaa | 134 | if (alloc_bucket_locks(ht, tbl, gfp) < 0) { |
97defe1e TG |
135 | bucket_table_free(tbl); |
136 | return NULL; | |
137 | } | |
7e1e7763 | 138 | |
eddee5ba HX |
139 | INIT_LIST_HEAD(&tbl->walkers); |
140 | ||
5269b53d HX |
141 | get_random_bytes(&tbl->hash_rnd, sizeof(tbl->hash_rnd)); |
142 | ||
f89bd6f8 TG |
143 | for (i = 0; i < nbuckets; i++) |
144 | INIT_RHT_NULLS_HEAD(tbl->buckets[i], ht, i); | |
145 | ||
97defe1e | 146 | return tbl; |
7e1e7763 TG |
147 | } |
148 | ||
b824478b HX |
149 | static struct bucket_table *rhashtable_last_table(struct rhashtable *ht, |
150 | struct bucket_table *tbl) | |
151 | { | |
152 | struct bucket_table *new_tbl; | |
153 | ||
154 | do { | |
155 | new_tbl = tbl; | |
156 | tbl = rht_dereference_rcu(tbl->future_tbl, ht); | |
157 | } while (tbl); | |
158 | ||
159 | return new_tbl; | |
160 | } | |
161 | ||
299e5c32 | 162 | static int rhashtable_rehash_one(struct rhashtable *ht, unsigned int old_hash) |
a5ec68e3 | 163 | { |
aa34a6cb | 164 | struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); |
b824478b HX |
165 | struct bucket_table *new_tbl = rhashtable_last_table(ht, |
166 | rht_dereference_rcu(old_tbl->future_tbl, ht)); | |
aa34a6cb HX |
167 | struct rhash_head __rcu **pprev = &old_tbl->buckets[old_hash]; |
168 | int err = -ENOENT; | |
169 | struct rhash_head *head, *next, *entry; | |
170 | spinlock_t *new_bucket_lock; | |
299e5c32 | 171 | unsigned int new_hash; |
aa34a6cb HX |
172 | |
173 | rht_for_each(entry, old_tbl, old_hash) { | |
174 | err = 0; | |
175 | next = rht_dereference_bucket(entry->next, old_tbl, old_hash); | |
176 | ||
177 | if (rht_is_a_nulls(next)) | |
178 | break; | |
a5ec68e3 | 179 | |
aa34a6cb HX |
180 | pprev = &entry->next; |
181 | } | |
a5ec68e3 | 182 | |
aa34a6cb HX |
183 | if (err) |
184 | goto out; | |
97defe1e | 185 | |
aa34a6cb | 186 | new_hash = head_hashfn(ht, new_tbl, entry); |
7e1e7763 | 187 | |
02fd97c3 | 188 | new_bucket_lock = rht_bucket_lock(new_tbl, new_hash); |
7e1e7763 | 189 | |
8f2484bd | 190 | spin_lock_nested(new_bucket_lock, SINGLE_DEPTH_NESTING); |
aa34a6cb HX |
191 | head = rht_dereference_bucket(new_tbl->buckets[new_hash], |
192 | new_tbl, new_hash); | |
97defe1e | 193 | |
7def0f95 | 194 | RCU_INIT_POINTER(entry->next, head); |
a5ec68e3 | 195 | |
aa34a6cb HX |
196 | rcu_assign_pointer(new_tbl->buckets[new_hash], entry); |
197 | spin_unlock(new_bucket_lock); | |
97defe1e | 198 | |
aa34a6cb | 199 | rcu_assign_pointer(*pprev, next); |
7e1e7763 | 200 | |
aa34a6cb HX |
201 | out: |
202 | return err; | |
203 | } | |
97defe1e | 204 | |
299e5c32 TG |
205 | static void rhashtable_rehash_chain(struct rhashtable *ht, |
206 | unsigned int old_hash) | |
aa34a6cb HX |
207 | { |
208 | struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); | |
209 | spinlock_t *old_bucket_lock; | |
210 | ||
02fd97c3 | 211 | old_bucket_lock = rht_bucket_lock(old_tbl, old_hash); |
a5ec68e3 | 212 | |
aa34a6cb HX |
213 | spin_lock_bh(old_bucket_lock); |
214 | while (!rhashtable_rehash_one(ht, old_hash)) | |
215 | ; | |
63d512d0 | 216 | old_tbl->rehash++; |
aa34a6cb | 217 | spin_unlock_bh(old_bucket_lock); |
97defe1e TG |
218 | } |
219 | ||
b824478b HX |
220 | static int rhashtable_rehash_attach(struct rhashtable *ht, |
221 | struct bucket_table *old_tbl, | |
222 | struct bucket_table *new_tbl) | |
97defe1e | 223 | { |
b824478b HX |
224 | /* Protect future_tbl using the first bucket lock. */ |
225 | spin_lock_bh(old_tbl->locks); | |
226 | ||
227 | /* Did somebody beat us to it? */ | |
228 | if (rcu_access_pointer(old_tbl->future_tbl)) { | |
229 | spin_unlock_bh(old_tbl->locks); | |
230 | return -EEXIST; | |
231 | } | |
7cd10db8 | 232 | |
aa34a6cb HX |
233 | /* Make insertions go into the new, empty table right away. Deletions |
234 | * and lookups will be attempted in both tables until we synchronize. | |
aa34a6cb | 235 | */ |
c4db8848 | 236 | rcu_assign_pointer(old_tbl->future_tbl, new_tbl); |
aa34a6cb | 237 | |
b824478b HX |
238 | spin_unlock_bh(old_tbl->locks); |
239 | ||
240 | return 0; | |
241 | } | |
242 | ||
243 | static int rhashtable_rehash_table(struct rhashtable *ht) | |
244 | { | |
245 | struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); | |
246 | struct bucket_table *new_tbl; | |
247 | struct rhashtable_walker *walker; | |
299e5c32 | 248 | unsigned int old_hash; |
b824478b HX |
249 | |
250 | new_tbl = rht_dereference(old_tbl->future_tbl, ht); | |
251 | if (!new_tbl) | |
252 | return 0; | |
253 | ||
aa34a6cb HX |
254 | for (old_hash = 0; old_hash < old_tbl->size; old_hash++) |
255 | rhashtable_rehash_chain(ht, old_hash); | |
256 | ||
257 | /* Publish the new table pointer. */ | |
258 | rcu_assign_pointer(ht->tbl, new_tbl); | |
259 | ||
ba7c95ea | 260 | spin_lock(&ht->lock); |
eddee5ba HX |
261 | list_for_each_entry(walker, &old_tbl->walkers, list) |
262 | walker->tbl = NULL; | |
ba7c95ea | 263 | spin_unlock(&ht->lock); |
eddee5ba | 264 | |
aa34a6cb HX |
265 | /* Wait for readers. All new readers will see the new |
266 | * table, and thus no references to the old table will | |
267 | * remain. | |
268 | */ | |
9d901bc0 | 269 | call_rcu(&old_tbl->rcu, bucket_table_free_rcu); |
b824478b HX |
270 | |
271 | return rht_dereference(new_tbl->future_tbl, ht) ? -EAGAIN : 0; | |
7e1e7763 TG |
272 | } |
273 | ||
274 | /** | |
275 | * rhashtable_expand - Expand hash table while allowing concurrent lookups | |
276 | * @ht: the hash table to expand | |
7e1e7763 | 277 | * |
aa34a6cb | 278 | * A secondary bucket array is allocated and the hash entries are migrated. |
7e1e7763 TG |
279 | * |
280 | * This function may only be called in a context where it is safe to call | |
281 | * synchronize_rcu(), e.g. not within a rcu_read_lock() section. | |
282 | * | |
97defe1e TG |
283 | * The caller must ensure that no concurrent resizing occurs by holding |
284 | * ht->mutex. | |
285 | * | |
286 | * It is valid to have concurrent insertions and deletions protected by per | |
287 | * bucket locks or concurrent RCU protected lookups and traversals. | |
7e1e7763 | 288 | */ |
b824478b | 289 | static int rhashtable_expand(struct rhashtable *ht) |
7e1e7763 TG |
290 | { |
291 | struct bucket_table *new_tbl, *old_tbl = rht_dereference(ht->tbl, ht); | |
b824478b | 292 | int err; |
7e1e7763 TG |
293 | |
294 | ASSERT_RHT_MUTEX(ht); | |
295 | ||
b824478b HX |
296 | old_tbl = rhashtable_last_table(ht, old_tbl); |
297 | ||
b9ecfdaa | 298 | new_tbl = bucket_table_alloc(ht, old_tbl->size * 2, GFP_KERNEL); |
7e1e7763 TG |
299 | if (new_tbl == NULL) |
300 | return -ENOMEM; | |
301 | ||
b824478b HX |
302 | err = rhashtable_rehash_attach(ht, old_tbl, new_tbl); |
303 | if (err) | |
304 | bucket_table_free(new_tbl); | |
305 | ||
306 | return err; | |
7e1e7763 | 307 | } |
7e1e7763 TG |
308 | |
309 | /** | |
310 | * rhashtable_shrink - Shrink hash table while allowing concurrent lookups | |
311 | * @ht: the hash table to shrink | |
7e1e7763 | 312 | * |
18093d1c HX |
313 | * This function shrinks the hash table to fit, i.e., the smallest |
314 | * size would not cause it to expand right away automatically. | |
7e1e7763 | 315 | * |
97defe1e TG |
316 | * The caller must ensure that no concurrent resizing occurs by holding |
317 | * ht->mutex. | |
318 | * | |
7e1e7763 TG |
319 | * The caller must ensure that no concurrent table mutations take place. |
320 | * It is however valid to have concurrent lookups if they are RCU protected. | |
97defe1e TG |
321 | * |
322 | * It is valid to have concurrent insertions and deletions protected by per | |
323 | * bucket locks or concurrent RCU protected lookups and traversals. | |
7e1e7763 | 324 | */ |
b824478b | 325 | static int rhashtable_shrink(struct rhashtable *ht) |
7e1e7763 | 326 | { |
a5b6846f | 327 | struct bucket_table *new_tbl, *old_tbl = rht_dereference(ht->tbl, ht); |
12311959 VN |
328 | unsigned int nelems = atomic_read(&ht->nelems); |
329 | unsigned int size = 0; | |
b824478b | 330 | int err; |
7e1e7763 TG |
331 | |
332 | ASSERT_RHT_MUTEX(ht); | |
333 | ||
12311959 VN |
334 | if (nelems) |
335 | size = roundup_pow_of_two(nelems * 3 / 2); | |
18093d1c HX |
336 | if (size < ht->p.min_size) |
337 | size = ht->p.min_size; | |
338 | ||
339 | if (old_tbl->size <= size) | |
340 | return 0; | |
341 | ||
b824478b HX |
342 | if (rht_dereference(old_tbl->future_tbl, ht)) |
343 | return -EEXIST; | |
344 | ||
b9ecfdaa | 345 | new_tbl = bucket_table_alloc(ht, size, GFP_KERNEL); |
97defe1e | 346 | if (new_tbl == NULL) |
7e1e7763 TG |
347 | return -ENOMEM; |
348 | ||
b824478b HX |
349 | err = rhashtable_rehash_attach(ht, old_tbl, new_tbl); |
350 | if (err) | |
351 | bucket_table_free(new_tbl); | |
352 | ||
353 | return err; | |
7e1e7763 | 354 | } |
7e1e7763 | 355 | |
97defe1e TG |
356 | static void rht_deferred_worker(struct work_struct *work) |
357 | { | |
358 | struct rhashtable *ht; | |
359 | struct bucket_table *tbl; | |
b824478b | 360 | int err = 0; |
97defe1e | 361 | |
57699a40 | 362 | ht = container_of(work, struct rhashtable, run_work); |
97defe1e | 363 | mutex_lock(&ht->mutex); |
28134a53 | 364 | |
97defe1e | 365 | tbl = rht_dereference(ht->tbl, ht); |
b824478b | 366 | tbl = rhashtable_last_table(ht, tbl); |
97defe1e | 367 | |
a5b6846f | 368 | if (rht_grow_above_75(ht, tbl)) |
97defe1e | 369 | rhashtable_expand(ht); |
b5e2c150 | 370 | else if (ht->p.automatic_shrinking && rht_shrink_below_30(ht, tbl)) |
97defe1e | 371 | rhashtable_shrink(ht); |
b824478b HX |
372 | |
373 | err = rhashtable_rehash_table(ht); | |
374 | ||
97defe1e | 375 | mutex_unlock(&ht->mutex); |
b824478b HX |
376 | |
377 | if (err) | |
378 | schedule_work(&ht->run_work); | |
97defe1e TG |
379 | } |
380 | ||
ccd57b1b HX |
381 | static bool rhashtable_check_elasticity(struct rhashtable *ht, |
382 | struct bucket_table *tbl, | |
299e5c32 | 383 | unsigned int hash) |
ccd57b1b | 384 | { |
299e5c32 | 385 | unsigned int elasticity = ht->elasticity; |
ccd57b1b HX |
386 | struct rhash_head *head; |
387 | ||
388 | rht_for_each(head, tbl, hash) | |
389 | if (!--elasticity) | |
390 | return true; | |
391 | ||
392 | return false; | |
393 | } | |
394 | ||
3cf92222 HX |
395 | int rhashtable_insert_rehash(struct rhashtable *ht, |
396 | struct bucket_table *tbl) | |
ccd57b1b HX |
397 | { |
398 | struct bucket_table *old_tbl; | |
399 | struct bucket_table *new_tbl; | |
ccd57b1b HX |
400 | unsigned int size; |
401 | int err; | |
402 | ||
403 | old_tbl = rht_dereference_rcu(ht->tbl, ht); | |
ccd57b1b HX |
404 | |
405 | size = tbl->size; | |
406 | ||
3cf92222 HX |
407 | err = -EBUSY; |
408 | ||
ccd57b1b HX |
409 | if (rht_grow_above_75(ht, tbl)) |
410 | size *= 2; | |
a87b9ebf TG |
411 | /* Do not schedule more than one rehash */ |
412 | else if (old_tbl != tbl) | |
3cf92222 HX |
413 | goto fail; |
414 | ||
415 | err = -ENOMEM; | |
ccd57b1b HX |
416 | |
417 | new_tbl = bucket_table_alloc(ht, size, GFP_ATOMIC); | |
3cf92222 HX |
418 | if (new_tbl == NULL) |
419 | goto fail; | |
ccd57b1b HX |
420 | |
421 | err = rhashtable_rehash_attach(ht, tbl, new_tbl); | |
422 | if (err) { | |
423 | bucket_table_free(new_tbl); | |
424 | if (err == -EEXIST) | |
425 | err = 0; | |
426 | } else | |
427 | schedule_work(&ht->run_work); | |
428 | ||
429 | return err; | |
3cf92222 HX |
430 | |
431 | fail: | |
432 | /* Do not fail the insert if someone else did a rehash. */ | |
433 | if (likely(rcu_dereference_raw(tbl->future_tbl))) | |
434 | return 0; | |
435 | ||
436 | /* Schedule async rehash to retry allocation in process context. */ | |
437 | if (err == -ENOMEM) | |
438 | schedule_work(&ht->run_work); | |
439 | ||
440 | return err; | |
ccd57b1b HX |
441 | } |
442 | EXPORT_SYMBOL_GPL(rhashtable_insert_rehash); | |
443 | ||
3cf92222 HX |
444 | struct bucket_table *rhashtable_insert_slow(struct rhashtable *ht, |
445 | const void *key, | |
446 | struct rhash_head *obj, | |
447 | struct bucket_table *tbl) | |
02fd97c3 HX |
448 | { |
449 | struct rhash_head *head; | |
299e5c32 | 450 | unsigned int hash; |
ccd57b1b | 451 | int err; |
02fd97c3 | 452 | |
b824478b | 453 | tbl = rhashtable_last_table(ht, tbl); |
02fd97c3 HX |
454 | hash = head_hashfn(ht, tbl, obj); |
455 | spin_lock_nested(rht_bucket_lock(tbl, hash), SINGLE_DEPTH_NESTING); | |
456 | ||
ccd57b1b | 457 | err = -EEXIST; |
02fd97c3 HX |
458 | if (key && rhashtable_lookup_fast(ht, key, ht->p)) |
459 | goto exit; | |
460 | ||
07ee0722 HX |
461 | err = -E2BIG; |
462 | if (unlikely(rht_grow_above_max(ht, tbl))) | |
463 | goto exit; | |
464 | ||
ccd57b1b HX |
465 | err = -EAGAIN; |
466 | if (rhashtable_check_elasticity(ht, tbl, hash) || | |
467 | rht_grow_above_100(ht, tbl)) | |
468 | goto exit; | |
469 | ||
02fd97c3 HX |
470 | err = 0; |
471 | ||
472 | head = rht_dereference_bucket(tbl->buckets[hash], tbl, hash); | |
473 | ||
474 | RCU_INIT_POINTER(obj->next, head); | |
475 | ||
476 | rcu_assign_pointer(tbl->buckets[hash], obj); | |
477 | ||
478 | atomic_inc(&ht->nelems); | |
479 | ||
480 | exit: | |
481 | spin_unlock(rht_bucket_lock(tbl, hash)); | |
482 | ||
3cf92222 HX |
483 | if (err == 0) |
484 | return NULL; | |
485 | else if (err == -EAGAIN) | |
486 | return tbl; | |
487 | else | |
488 | return ERR_PTR(err); | |
02fd97c3 HX |
489 | } |
490 | EXPORT_SYMBOL_GPL(rhashtable_insert_slow); | |
491 | ||
f2dba9c6 HX |
492 | /** |
493 | * rhashtable_walk_init - Initialise an iterator | |
494 | * @ht: Table to walk over | |
495 | * @iter: Hash table Iterator | |
8f6fd83c | 496 | * @gfp: GFP flags for allocations |
f2dba9c6 HX |
497 | * |
498 | * This function prepares a hash table walk. | |
499 | * | |
500 | * Note that if you restart a walk after rhashtable_walk_stop you | |
501 | * may see the same object twice. Also, you may miss objects if | |
502 | * there are removals in between rhashtable_walk_stop and the next | |
503 | * call to rhashtable_walk_start. | |
504 | * | |
505 | * For a completely stable walk you should construct your own data | |
506 | * structure outside the hash table. | |
507 | * | |
508 | * This function may sleep so you must not call it from interrupt | |
509 | * context or with spin locks held. | |
510 | * | |
511 | * You must call rhashtable_walk_exit if this function returns | |
512 | * successfully. | |
513 | */ | |
8f6fd83c BC |
514 | int rhashtable_walk_init(struct rhashtable *ht, struct rhashtable_iter *iter, |
515 | gfp_t gfp) | |
f2dba9c6 HX |
516 | { |
517 | iter->ht = ht; | |
518 | iter->p = NULL; | |
519 | iter->slot = 0; | |
520 | iter->skip = 0; | |
521 | ||
8f6fd83c | 522 | iter->walker = kmalloc(sizeof(*iter->walker), gfp); |
f2dba9c6 HX |
523 | if (!iter->walker) |
524 | return -ENOMEM; | |
525 | ||
c6ff5268 | 526 | spin_lock(&ht->lock); |
179ccc0a HX |
527 | iter->walker->tbl = |
528 | rcu_dereference_protected(ht->tbl, lockdep_is_held(&ht->lock)); | |
eddee5ba | 529 | list_add(&iter->walker->list, &iter->walker->tbl->walkers); |
c6ff5268 | 530 | spin_unlock(&ht->lock); |
f2dba9c6 HX |
531 | |
532 | return 0; | |
533 | } | |
534 | EXPORT_SYMBOL_GPL(rhashtable_walk_init); | |
535 | ||
536 | /** | |
537 | * rhashtable_walk_exit - Free an iterator | |
538 | * @iter: Hash table Iterator | |
539 | * | |
540 | * This function frees resources allocated by rhashtable_walk_init. | |
541 | */ | |
542 | void rhashtable_walk_exit(struct rhashtable_iter *iter) | |
543 | { | |
c6ff5268 | 544 | spin_lock(&iter->ht->lock); |
eddee5ba HX |
545 | if (iter->walker->tbl) |
546 | list_del(&iter->walker->list); | |
c6ff5268 | 547 | spin_unlock(&iter->ht->lock); |
f2dba9c6 HX |
548 | kfree(iter->walker); |
549 | } | |
550 | EXPORT_SYMBOL_GPL(rhashtable_walk_exit); | |
551 | ||
552 | /** | |
553 | * rhashtable_walk_start - Start a hash table walk | |
554 | * @iter: Hash table iterator | |
555 | * | |
556 | * Start a hash table walk. Note that we take the RCU lock in all | |
557 | * cases including when we return an error. So you must always call | |
558 | * rhashtable_walk_stop to clean up. | |
559 | * | |
560 | * Returns zero if successful. | |
561 | * | |
562 | * Returns -EAGAIN if resize event occured. Note that the iterator | |
563 | * will rewind back to the beginning and you may use it immediately | |
564 | * by calling rhashtable_walk_next. | |
565 | */ | |
566 | int rhashtable_walk_start(struct rhashtable_iter *iter) | |
db4374f4 | 567 | __acquires(RCU) |
f2dba9c6 | 568 | { |
eddee5ba HX |
569 | struct rhashtable *ht = iter->ht; |
570 | ||
c6ff5268 | 571 | rcu_read_lock(); |
eddee5ba | 572 | |
c6ff5268 | 573 | spin_lock(&ht->lock); |
eddee5ba HX |
574 | if (iter->walker->tbl) |
575 | list_del(&iter->walker->list); | |
c6ff5268 | 576 | spin_unlock(&ht->lock); |
eddee5ba HX |
577 | |
578 | if (!iter->walker->tbl) { | |
579 | iter->walker->tbl = rht_dereference_rcu(ht->tbl, ht); | |
f2dba9c6 HX |
580 | return -EAGAIN; |
581 | } | |
582 | ||
583 | return 0; | |
584 | } | |
585 | EXPORT_SYMBOL_GPL(rhashtable_walk_start); | |
586 | ||
587 | /** | |
588 | * rhashtable_walk_next - Return the next object and advance the iterator | |
589 | * @iter: Hash table iterator | |
590 | * | |
591 | * Note that you must call rhashtable_walk_stop when you are finished | |
592 | * with the walk. | |
593 | * | |
594 | * Returns the next object or NULL when the end of the table is reached. | |
595 | * | |
596 | * Returns -EAGAIN if resize event occured. Note that the iterator | |
597 | * will rewind back to the beginning and you may continue to use it. | |
598 | */ | |
599 | void *rhashtable_walk_next(struct rhashtable_iter *iter) | |
600 | { | |
eddee5ba | 601 | struct bucket_table *tbl = iter->walker->tbl; |
f2dba9c6 HX |
602 | struct rhashtable *ht = iter->ht; |
603 | struct rhash_head *p = iter->p; | |
f2dba9c6 | 604 | |
f2dba9c6 HX |
605 | if (p) { |
606 | p = rht_dereference_bucket_rcu(p->next, tbl, iter->slot); | |
607 | goto next; | |
608 | } | |
609 | ||
610 | for (; iter->slot < tbl->size; iter->slot++) { | |
611 | int skip = iter->skip; | |
612 | ||
613 | rht_for_each_rcu(p, tbl, iter->slot) { | |
614 | if (!skip) | |
615 | break; | |
616 | skip--; | |
617 | } | |
618 | ||
619 | next: | |
620 | if (!rht_is_a_nulls(p)) { | |
621 | iter->skip++; | |
622 | iter->p = p; | |
c936a79f | 623 | return rht_obj(ht, p); |
f2dba9c6 HX |
624 | } |
625 | ||
626 | iter->skip = 0; | |
627 | } | |
628 | ||
142b942a PS |
629 | iter->p = NULL; |
630 | ||
d88252f9 HX |
631 | /* Ensure we see any new tables. */ |
632 | smp_rmb(); | |
633 | ||
c4db8848 HX |
634 | iter->walker->tbl = rht_dereference_rcu(tbl->future_tbl, ht); |
635 | if (iter->walker->tbl) { | |
f2dba9c6 HX |
636 | iter->slot = 0; |
637 | iter->skip = 0; | |
f2dba9c6 HX |
638 | return ERR_PTR(-EAGAIN); |
639 | } | |
640 | ||
c936a79f | 641 | return NULL; |
f2dba9c6 HX |
642 | } |
643 | EXPORT_SYMBOL_GPL(rhashtable_walk_next); | |
644 | ||
645 | /** | |
646 | * rhashtable_walk_stop - Finish a hash table walk | |
647 | * @iter: Hash table iterator | |
648 | * | |
649 | * Finish a hash table walk. | |
650 | */ | |
651 | void rhashtable_walk_stop(struct rhashtable_iter *iter) | |
db4374f4 | 652 | __releases(RCU) |
f2dba9c6 | 653 | { |
eddee5ba HX |
654 | struct rhashtable *ht; |
655 | struct bucket_table *tbl = iter->walker->tbl; | |
656 | ||
eddee5ba | 657 | if (!tbl) |
963ecbd4 | 658 | goto out; |
eddee5ba HX |
659 | |
660 | ht = iter->ht; | |
661 | ||
ba7c95ea | 662 | spin_lock(&ht->lock); |
c4db8848 | 663 | if (tbl->rehash < tbl->size) |
eddee5ba HX |
664 | list_add(&iter->walker->list, &tbl->walkers); |
665 | else | |
666 | iter->walker->tbl = NULL; | |
ba7c95ea | 667 | spin_unlock(&ht->lock); |
eddee5ba | 668 | |
f2dba9c6 | 669 | iter->p = NULL; |
963ecbd4 HX |
670 | |
671 | out: | |
672 | rcu_read_unlock(); | |
f2dba9c6 HX |
673 | } |
674 | EXPORT_SYMBOL_GPL(rhashtable_walk_stop); | |
675 | ||
488fb86e | 676 | static size_t rounded_hashtable_size(const struct rhashtable_params *params) |
7e1e7763 | 677 | { |
94000176 | 678 | return max(roundup_pow_of_two(params->nelem_hint * 4 / 3), |
e2e21c1c | 679 | (unsigned long)params->min_size); |
7e1e7763 TG |
680 | } |
681 | ||
31ccde2d HX |
682 | static u32 rhashtable_jhash2(const void *key, u32 length, u32 seed) |
683 | { | |
684 | return jhash2(key, length, seed); | |
685 | } | |
686 | ||
7e1e7763 TG |
687 | /** |
688 | * rhashtable_init - initialize a new hash table | |
689 | * @ht: hash table to be initialized | |
690 | * @params: configuration parameters | |
691 | * | |
692 | * Initializes a new hash table based on the provided configuration | |
693 | * parameters. A table can be configured either with a variable or | |
694 | * fixed length key: | |
695 | * | |
696 | * Configuration Example 1: Fixed length keys | |
697 | * struct test_obj { | |
698 | * int key; | |
699 | * void * my_member; | |
700 | * struct rhash_head node; | |
701 | * }; | |
702 | * | |
703 | * struct rhashtable_params params = { | |
704 | * .head_offset = offsetof(struct test_obj, node), | |
705 | * .key_offset = offsetof(struct test_obj, key), | |
706 | * .key_len = sizeof(int), | |
87545899 | 707 | * .hashfn = jhash, |
f89bd6f8 | 708 | * .nulls_base = (1U << RHT_BASE_SHIFT), |
7e1e7763 TG |
709 | * }; |
710 | * | |
711 | * Configuration Example 2: Variable length keys | |
712 | * struct test_obj { | |
713 | * [...] | |
714 | * struct rhash_head node; | |
715 | * }; | |
716 | * | |
49f7b33e | 717 | * u32 my_hash_fn(const void *data, u32 len, u32 seed) |
7e1e7763 TG |
718 | * { |
719 | * struct test_obj *obj = data; | |
720 | * | |
721 | * return [... hash ...]; | |
722 | * } | |
723 | * | |
724 | * struct rhashtable_params params = { | |
725 | * .head_offset = offsetof(struct test_obj, node), | |
87545899 | 726 | * .hashfn = jhash, |
7e1e7763 | 727 | * .obj_hashfn = my_hash_fn, |
7e1e7763 TG |
728 | * }; |
729 | */ | |
488fb86e HX |
730 | int rhashtable_init(struct rhashtable *ht, |
731 | const struct rhashtable_params *params) | |
7e1e7763 TG |
732 | { |
733 | struct bucket_table *tbl; | |
734 | size_t size; | |
735 | ||
736 | size = HASH_DEFAULT_SIZE; | |
737 | ||
31ccde2d | 738 | if ((!params->key_len && !params->obj_hashfn) || |
02fd97c3 | 739 | (params->obj_hashfn && !params->obj_cmpfn)) |
7e1e7763 TG |
740 | return -EINVAL; |
741 | ||
f89bd6f8 TG |
742 | if (params->nulls_base && params->nulls_base < (1U << RHT_BASE_SHIFT)) |
743 | return -EINVAL; | |
744 | ||
97defe1e TG |
745 | memset(ht, 0, sizeof(*ht)); |
746 | mutex_init(&ht->mutex); | |
ba7c95ea | 747 | spin_lock_init(&ht->lock); |
97defe1e TG |
748 | memcpy(&ht->p, params, sizeof(*params)); |
749 | ||
a998f712 TG |
750 | if (params->min_size) |
751 | ht->p.min_size = roundup_pow_of_two(params->min_size); | |
752 | ||
753 | if (params->max_size) | |
754 | ht->p.max_size = rounddown_pow_of_two(params->max_size); | |
755 | ||
07ee0722 HX |
756 | if (params->insecure_max_entries) |
757 | ht->p.insecure_max_entries = | |
758 | rounddown_pow_of_two(params->insecure_max_entries); | |
759 | else | |
760 | ht->p.insecure_max_entries = ht->p.max_size * 2; | |
761 | ||
488fb86e | 762 | ht->p.min_size = max(ht->p.min_size, HASH_MIN_SIZE); |
a998f712 | 763 | |
3a324606 HX |
764 | if (params->nelem_hint) |
765 | size = rounded_hashtable_size(&ht->p); | |
766 | ||
27ed44a5 HX |
767 | /* The maximum (not average) chain length grows with the |
768 | * size of the hash table, at a rate of (log N)/(log log N). | |
769 | * The value of 16 is selected so that even if the hash | |
770 | * table grew to 2^32 you would not expect the maximum | |
771 | * chain length to exceed it unless we are under attack | |
772 | * (or extremely unlucky). | |
773 | * | |
774 | * As this limit is only to detect attacks, we don't need | |
775 | * to set it to a lower value as you'd need the chain | |
776 | * length to vastly exceed 16 to have any real effect | |
777 | * on the system. | |
778 | */ | |
ccd57b1b HX |
779 | if (!params->insecure_elasticity) |
780 | ht->elasticity = 16; | |
781 | ||
97defe1e TG |
782 | if (params->locks_mul) |
783 | ht->p.locks_mul = roundup_pow_of_two(params->locks_mul); | |
784 | else | |
785 | ht->p.locks_mul = BUCKET_LOCKS_PER_CPU; | |
786 | ||
31ccde2d HX |
787 | ht->key_len = ht->p.key_len; |
788 | if (!params->hashfn) { | |
789 | ht->p.hashfn = jhash; | |
790 | ||
791 | if (!(ht->key_len & (sizeof(u32) - 1))) { | |
792 | ht->key_len /= sizeof(u32); | |
793 | ht->p.hashfn = rhashtable_jhash2; | |
794 | } | |
795 | } | |
796 | ||
b9ecfdaa | 797 | tbl = bucket_table_alloc(ht, size, GFP_KERNEL); |
7e1e7763 TG |
798 | if (tbl == NULL) |
799 | return -ENOMEM; | |
800 | ||
545a148e | 801 | atomic_set(&ht->nelems, 0); |
a5b6846f | 802 | |
7e1e7763 TG |
803 | RCU_INIT_POINTER(ht->tbl, tbl); |
804 | ||
4c4b52d9 | 805 | INIT_WORK(&ht->run_work, rht_deferred_worker); |
97defe1e | 806 | |
7e1e7763 TG |
807 | return 0; |
808 | } | |
809 | EXPORT_SYMBOL_GPL(rhashtable_init); | |
810 | ||
811 | /** | |
6b6f302c | 812 | * rhashtable_free_and_destroy - free elements and destroy hash table |
7e1e7763 | 813 | * @ht: the hash table to destroy |
6b6f302c TG |
814 | * @free_fn: callback to release resources of element |
815 | * @arg: pointer passed to free_fn | |
7e1e7763 | 816 | * |
6b6f302c TG |
817 | * Stops an eventual async resize. If defined, invokes free_fn for each |
818 | * element to releasal resources. Please note that RCU protected | |
819 | * readers may still be accessing the elements. Releasing of resources | |
820 | * must occur in a compatible manner. Then frees the bucket array. | |
821 | * | |
822 | * This function will eventually sleep to wait for an async resize | |
823 | * to complete. The caller is responsible that no further write operations | |
824 | * occurs in parallel. | |
7e1e7763 | 825 | */ |
6b6f302c TG |
826 | void rhashtable_free_and_destroy(struct rhashtable *ht, |
827 | void (*free_fn)(void *ptr, void *arg), | |
828 | void *arg) | |
7e1e7763 | 829 | { |
6b6f302c TG |
830 | const struct bucket_table *tbl; |
831 | unsigned int i; | |
97defe1e | 832 | |
4c4b52d9 | 833 | cancel_work_sync(&ht->run_work); |
97defe1e | 834 | |
57699a40 | 835 | mutex_lock(&ht->mutex); |
6b6f302c TG |
836 | tbl = rht_dereference(ht->tbl, ht); |
837 | if (free_fn) { | |
838 | for (i = 0; i < tbl->size; i++) { | |
839 | struct rhash_head *pos, *next; | |
840 | ||
841 | for (pos = rht_dereference(tbl->buckets[i], ht), | |
842 | next = !rht_is_a_nulls(pos) ? | |
843 | rht_dereference(pos->next, ht) : NULL; | |
844 | !rht_is_a_nulls(pos); | |
845 | pos = next, | |
846 | next = !rht_is_a_nulls(pos) ? | |
847 | rht_dereference(pos->next, ht) : NULL) | |
848 | free_fn(rht_obj(ht, pos), arg); | |
849 | } | |
850 | } | |
851 | ||
852 | bucket_table_free(tbl); | |
97defe1e | 853 | mutex_unlock(&ht->mutex); |
7e1e7763 | 854 | } |
6b6f302c TG |
855 | EXPORT_SYMBOL_GPL(rhashtable_free_and_destroy); |
856 | ||
857 | void rhashtable_destroy(struct rhashtable *ht) | |
858 | { | |
859 | return rhashtable_free_and_destroy(ht, NULL, NULL); | |
860 | } | |
7e1e7763 | 861 | EXPORT_SYMBOL_GPL(rhashtable_destroy); |