]>
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> |
b2d09103 | 22 | #include <linux/rculist.h> |
7e1e7763 TG |
23 | #include <linux/slab.h> |
24 | #include <linux/vmalloc.h> | |
25 | #include <linux/mm.h> | |
87545899 | 26 | #include <linux/jhash.h> |
7e1e7763 TG |
27 | #include <linux/random.h> |
28 | #include <linux/rhashtable.h> | |
61d7b097 | 29 | #include <linux/err.h> |
6d795413 | 30 | #include <linux/export.h> |
0eb71a9d | 31 | #include <linux/rhashtable.h> |
7e1e7763 TG |
32 | |
33 | #define HASH_DEFAULT_SIZE 64UL | |
c2e213cf | 34 | #define HASH_MIN_SIZE 4U |
4cf0b354 | 35 | #define BUCKET_LOCKS_PER_CPU 32UL |
97defe1e | 36 | |
da20420f HX |
37 | union nested_table { |
38 | union nested_table __rcu *table; | |
39 | struct rhash_head __rcu *bucket; | |
40 | }; | |
41 | ||
988dfbd7 | 42 | static u32 head_hashfn(struct rhashtable *ht, |
8d24c0b4 TG |
43 | const struct bucket_table *tbl, |
44 | const struct rhash_head *he) | |
7e1e7763 | 45 | { |
02fd97c3 | 46 | return rht_head_hashfn(ht, tbl, he, ht->p); |
7e1e7763 TG |
47 | } |
48 | ||
a03eaec0 | 49 | #ifdef CONFIG_PROVE_LOCKING |
a03eaec0 | 50 | #define ASSERT_RHT_MUTEX(HT) BUG_ON(!lockdep_rht_mutex_is_held(HT)) |
a03eaec0 TG |
51 | |
52 | int lockdep_rht_mutex_is_held(struct rhashtable *ht) | |
53 | { | |
54 | return (debug_locks) ? lockdep_is_held(&ht->mutex) : 1; | |
55 | } | |
56 | EXPORT_SYMBOL_GPL(lockdep_rht_mutex_is_held); | |
57 | ||
58 | int lockdep_rht_bucket_is_held(const struct bucket_table *tbl, u32 hash) | |
59 | { | |
02fd97c3 | 60 | spinlock_t *lock = rht_bucket_lock(tbl, hash); |
a03eaec0 TG |
61 | |
62 | return (debug_locks) ? lockdep_is_held(lock) : 1; | |
63 | } | |
64 | EXPORT_SYMBOL_GPL(lockdep_rht_bucket_is_held); | |
65 | #else | |
66 | #define ASSERT_RHT_MUTEX(HT) | |
a03eaec0 TG |
67 | #endif |
68 | ||
da20420f HX |
69 | static void nested_table_free(union nested_table *ntbl, unsigned int size) |
70 | { | |
71 | const unsigned int shift = PAGE_SHIFT - ilog2(sizeof(void *)); | |
72 | const unsigned int len = 1 << shift; | |
73 | unsigned int i; | |
74 | ||
75 | ntbl = rcu_dereference_raw(ntbl->table); | |
76 | if (!ntbl) | |
77 | return; | |
78 | ||
79 | if (size > len) { | |
80 | size >>= shift; | |
81 | for (i = 0; i < len; i++) | |
82 | nested_table_free(ntbl + i, size); | |
83 | } | |
84 | ||
85 | kfree(ntbl); | |
86 | } | |
87 | ||
88 | static void nested_bucket_table_free(const struct bucket_table *tbl) | |
89 | { | |
90 | unsigned int size = tbl->size >> tbl->nest; | |
91 | unsigned int len = 1 << tbl->nest; | |
92 | union nested_table *ntbl; | |
93 | unsigned int i; | |
94 | ||
95 | ntbl = (union nested_table *)rcu_dereference_raw(tbl->buckets[0]); | |
96 | ||
97 | for (i = 0; i < len; i++) | |
98 | nested_table_free(ntbl + i, size); | |
99 | ||
100 | kfree(ntbl); | |
101 | } | |
102 | ||
97defe1e TG |
103 | static void bucket_table_free(const struct bucket_table *tbl) |
104 | { | |
da20420f HX |
105 | if (tbl->nest) |
106 | nested_bucket_table_free(tbl); | |
107 | ||
64e0cd0d | 108 | free_bucket_spinlocks(tbl->locks); |
97defe1e TG |
109 | kvfree(tbl); |
110 | } | |
111 | ||
9d901bc0 HX |
112 | static void bucket_table_free_rcu(struct rcu_head *head) |
113 | { | |
114 | bucket_table_free(container_of(head, struct bucket_table, rcu)); | |
115 | } | |
116 | ||
da20420f HX |
117 | static union nested_table *nested_table_alloc(struct rhashtable *ht, |
118 | union nested_table __rcu **prev, | |
5af68ef7 | 119 | bool leaf) |
da20420f HX |
120 | { |
121 | union nested_table *ntbl; | |
122 | int i; | |
123 | ||
124 | ntbl = rcu_dereference(*prev); | |
125 | if (ntbl) | |
126 | return ntbl; | |
127 | ||
128 | ntbl = kzalloc(PAGE_SIZE, GFP_ATOMIC); | |
129 | ||
5af68ef7 N |
130 | if (ntbl && leaf) { |
131 | for (i = 0; i < PAGE_SIZE / sizeof(ntbl[0]); i++) | |
9b4f64a2 | 132 | INIT_RHT_NULLS_HEAD(ntbl[i].bucket); |
da20420f HX |
133 | } |
134 | ||
135 | rcu_assign_pointer(*prev, ntbl); | |
136 | ||
137 | return ntbl; | |
138 | } | |
139 | ||
140 | static struct bucket_table *nested_bucket_table_alloc(struct rhashtable *ht, | |
141 | size_t nbuckets, | |
142 | gfp_t gfp) | |
143 | { | |
144 | const unsigned int shift = PAGE_SHIFT - ilog2(sizeof(void *)); | |
145 | struct bucket_table *tbl; | |
146 | size_t size; | |
147 | ||
148 | if (nbuckets < (1 << (shift + 1))) | |
149 | return NULL; | |
150 | ||
151 | size = sizeof(*tbl) + sizeof(tbl->buckets[0]); | |
152 | ||
153 | tbl = kzalloc(size, gfp); | |
154 | if (!tbl) | |
155 | return NULL; | |
156 | ||
157 | if (!nested_table_alloc(ht, (union nested_table __rcu **)tbl->buckets, | |
5af68ef7 | 158 | false)) { |
da20420f HX |
159 | kfree(tbl); |
160 | return NULL; | |
161 | } | |
162 | ||
163 | tbl->nest = (ilog2(nbuckets) - 1) % shift + 1; | |
164 | ||
165 | return tbl; | |
166 | } | |
167 | ||
97defe1e | 168 | static struct bucket_table *bucket_table_alloc(struct rhashtable *ht, |
b9ecfdaa HX |
169 | size_t nbuckets, |
170 | gfp_t gfp) | |
7e1e7763 | 171 | { |
eb6d1abf | 172 | struct bucket_table *tbl = NULL; |
64e0cd0d | 173 | size_t size, max_locks; |
f89bd6f8 | 174 | int i; |
7e1e7763 TG |
175 | |
176 | size = sizeof(*tbl) + nbuckets * sizeof(tbl->buckets[0]); | |
12e8fd6f | 177 | if (gfp != GFP_KERNEL) |
b9ecfdaa | 178 | tbl = kzalloc(size, gfp | __GFP_NOWARN | __GFP_NORETRY); |
12e8fd6f MH |
179 | else |
180 | tbl = kvzalloc(size, gfp); | |
da20420f HX |
181 | |
182 | size = nbuckets; | |
183 | ||
184 | if (tbl == NULL && gfp != GFP_KERNEL) { | |
185 | tbl = nested_bucket_table_alloc(ht, nbuckets, gfp); | |
186 | nbuckets = 0; | |
187 | } | |
7e1e7763 TG |
188 | if (tbl == NULL) |
189 | return NULL; | |
190 | ||
da20420f | 191 | tbl->size = size; |
7e1e7763 | 192 | |
64e0cd0d TH |
193 | max_locks = size >> 1; |
194 | if (tbl->nest) | |
195 | max_locks = min_t(size_t, max_locks, 1U << tbl->nest); | |
196 | ||
197 | if (alloc_bucket_spinlocks(&tbl->locks, &tbl->locks_mask, max_locks, | |
198 | ht->p.locks_mul, gfp) < 0) { | |
97defe1e TG |
199 | bucket_table_free(tbl); |
200 | return NULL; | |
201 | } | |
7e1e7763 | 202 | |
eddee5ba HX |
203 | INIT_LIST_HEAD(&tbl->walkers); |
204 | ||
d48ad080 | 205 | tbl->hash_rnd = get_random_u32(); |
5269b53d | 206 | |
f89bd6f8 | 207 | for (i = 0; i < nbuckets; i++) |
9b4f64a2 | 208 | INIT_RHT_NULLS_HEAD(tbl->buckets[i]); |
f89bd6f8 | 209 | |
97defe1e | 210 | return tbl; |
7e1e7763 TG |
211 | } |
212 | ||
b824478b HX |
213 | static struct bucket_table *rhashtable_last_table(struct rhashtable *ht, |
214 | struct bucket_table *tbl) | |
215 | { | |
216 | struct bucket_table *new_tbl; | |
217 | ||
218 | do { | |
219 | new_tbl = tbl; | |
220 | tbl = rht_dereference_rcu(tbl->future_tbl, ht); | |
221 | } while (tbl); | |
222 | ||
223 | return new_tbl; | |
224 | } | |
225 | ||
299e5c32 | 226 | static int rhashtable_rehash_one(struct rhashtable *ht, unsigned int old_hash) |
a5ec68e3 | 227 | { |
aa34a6cb | 228 | struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); |
b824478b HX |
229 | struct bucket_table *new_tbl = rhashtable_last_table(ht, |
230 | rht_dereference_rcu(old_tbl->future_tbl, ht)); | |
da20420f HX |
231 | struct rhash_head __rcu **pprev = rht_bucket_var(old_tbl, old_hash); |
232 | int err = -EAGAIN; | |
aa34a6cb HX |
233 | struct rhash_head *head, *next, *entry; |
234 | spinlock_t *new_bucket_lock; | |
299e5c32 | 235 | unsigned int new_hash; |
aa34a6cb | 236 | |
da20420f HX |
237 | if (new_tbl->nest) |
238 | goto out; | |
239 | ||
240 | err = -ENOENT; | |
241 | ||
aa34a6cb HX |
242 | rht_for_each(entry, old_tbl, old_hash) { |
243 | err = 0; | |
244 | next = rht_dereference_bucket(entry->next, old_tbl, old_hash); | |
245 | ||
246 | if (rht_is_a_nulls(next)) | |
247 | break; | |
a5ec68e3 | 248 | |
aa34a6cb HX |
249 | pprev = &entry->next; |
250 | } | |
a5ec68e3 | 251 | |
aa34a6cb HX |
252 | if (err) |
253 | goto out; | |
97defe1e | 254 | |
aa34a6cb | 255 | new_hash = head_hashfn(ht, new_tbl, entry); |
7e1e7763 | 256 | |
02fd97c3 | 257 | new_bucket_lock = rht_bucket_lock(new_tbl, new_hash); |
7e1e7763 | 258 | |
8f2484bd | 259 | spin_lock_nested(new_bucket_lock, SINGLE_DEPTH_NESTING); |
aa34a6cb HX |
260 | head = rht_dereference_bucket(new_tbl->buckets[new_hash], |
261 | new_tbl, new_hash); | |
97defe1e | 262 | |
7def0f95 | 263 | RCU_INIT_POINTER(entry->next, head); |
a5ec68e3 | 264 | |
aa34a6cb HX |
265 | rcu_assign_pointer(new_tbl->buckets[new_hash], entry); |
266 | spin_unlock(new_bucket_lock); | |
97defe1e | 267 | |
aa34a6cb | 268 | rcu_assign_pointer(*pprev, next); |
7e1e7763 | 269 | |
aa34a6cb HX |
270 | out: |
271 | return err; | |
272 | } | |
97defe1e | 273 | |
da20420f | 274 | static int rhashtable_rehash_chain(struct rhashtable *ht, |
299e5c32 | 275 | unsigned int old_hash) |
aa34a6cb HX |
276 | { |
277 | struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); | |
278 | spinlock_t *old_bucket_lock; | |
da20420f | 279 | int err; |
aa34a6cb | 280 | |
02fd97c3 | 281 | old_bucket_lock = rht_bucket_lock(old_tbl, old_hash); |
a5ec68e3 | 282 | |
aa34a6cb | 283 | spin_lock_bh(old_bucket_lock); |
da20420f | 284 | while (!(err = rhashtable_rehash_one(ht, old_hash))) |
aa34a6cb | 285 | ; |
da20420f HX |
286 | |
287 | if (err == -ENOENT) { | |
288 | old_tbl->rehash++; | |
289 | err = 0; | |
290 | } | |
aa34a6cb | 291 | spin_unlock_bh(old_bucket_lock); |
da20420f HX |
292 | |
293 | return err; | |
97defe1e TG |
294 | } |
295 | ||
b824478b HX |
296 | static int rhashtable_rehash_attach(struct rhashtable *ht, |
297 | struct bucket_table *old_tbl, | |
298 | struct bucket_table *new_tbl) | |
97defe1e | 299 | { |
aa34a6cb HX |
300 | /* Make insertions go into the new, empty table right away. Deletions |
301 | * and lookups will be attempted in both tables until we synchronize. | |
0ad66449 N |
302 | * As cmpxchg() provides strong barriers, we do not need |
303 | * rcu_assign_pointer(). | |
aa34a6cb | 304 | */ |
aa34a6cb | 305 | |
0ad66449 N |
306 | if (cmpxchg(&old_tbl->future_tbl, NULL, new_tbl) != NULL) |
307 | return -EEXIST; | |
b824478b HX |
308 | |
309 | return 0; | |
310 | } | |
311 | ||
312 | static int rhashtable_rehash_table(struct rhashtable *ht) | |
313 | { | |
314 | struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); | |
315 | struct bucket_table *new_tbl; | |
316 | struct rhashtable_walker *walker; | |
299e5c32 | 317 | unsigned int old_hash; |
da20420f | 318 | int err; |
b824478b HX |
319 | |
320 | new_tbl = rht_dereference(old_tbl->future_tbl, ht); | |
321 | if (!new_tbl) | |
322 | return 0; | |
323 | ||
da20420f HX |
324 | for (old_hash = 0; old_hash < old_tbl->size; old_hash++) { |
325 | err = rhashtable_rehash_chain(ht, old_hash); | |
326 | if (err) | |
327 | return err; | |
ae6da1f5 | 328 | cond_resched(); |
da20420f | 329 | } |
aa34a6cb HX |
330 | |
331 | /* Publish the new table pointer. */ | |
332 | rcu_assign_pointer(ht->tbl, new_tbl); | |
333 | ||
ba7c95ea | 334 | spin_lock(&ht->lock); |
eddee5ba HX |
335 | list_for_each_entry(walker, &old_tbl->walkers, list) |
336 | walker->tbl = NULL; | |
ba7c95ea | 337 | spin_unlock(&ht->lock); |
eddee5ba | 338 | |
aa34a6cb HX |
339 | /* Wait for readers. All new readers will see the new |
340 | * table, and thus no references to the old table will | |
341 | * remain. | |
342 | */ | |
9d901bc0 | 343 | call_rcu(&old_tbl->rcu, bucket_table_free_rcu); |
b824478b HX |
344 | |
345 | return rht_dereference(new_tbl->future_tbl, ht) ? -EAGAIN : 0; | |
7e1e7763 TG |
346 | } |
347 | ||
da20420f HX |
348 | static int rhashtable_rehash_alloc(struct rhashtable *ht, |
349 | struct bucket_table *old_tbl, | |
350 | unsigned int size) | |
7e1e7763 | 351 | { |
da20420f | 352 | struct bucket_table *new_tbl; |
b824478b | 353 | int err; |
7e1e7763 TG |
354 | |
355 | ASSERT_RHT_MUTEX(ht); | |
356 | ||
da20420f | 357 | new_tbl = bucket_table_alloc(ht, size, GFP_KERNEL); |
7e1e7763 TG |
358 | if (new_tbl == NULL) |
359 | return -ENOMEM; | |
360 | ||
b824478b HX |
361 | err = rhashtable_rehash_attach(ht, old_tbl, new_tbl); |
362 | if (err) | |
363 | bucket_table_free(new_tbl); | |
364 | ||
365 | return err; | |
7e1e7763 | 366 | } |
7e1e7763 TG |
367 | |
368 | /** | |
369 | * rhashtable_shrink - Shrink hash table while allowing concurrent lookups | |
370 | * @ht: the hash table to shrink | |
7e1e7763 | 371 | * |
18093d1c HX |
372 | * This function shrinks the hash table to fit, i.e., the smallest |
373 | * size would not cause it to expand right away automatically. | |
7e1e7763 | 374 | * |
97defe1e TG |
375 | * The caller must ensure that no concurrent resizing occurs by holding |
376 | * ht->mutex. | |
377 | * | |
7e1e7763 TG |
378 | * The caller must ensure that no concurrent table mutations take place. |
379 | * It is however valid to have concurrent lookups if they are RCU protected. | |
97defe1e TG |
380 | * |
381 | * It is valid to have concurrent insertions and deletions protected by per | |
382 | * bucket locks or concurrent RCU protected lookups and traversals. | |
7e1e7763 | 383 | */ |
b824478b | 384 | static int rhashtable_shrink(struct rhashtable *ht) |
7e1e7763 | 385 | { |
da20420f | 386 | struct bucket_table *old_tbl = rht_dereference(ht->tbl, ht); |
12311959 VN |
387 | unsigned int nelems = atomic_read(&ht->nelems); |
388 | unsigned int size = 0; | |
7e1e7763 | 389 | |
12311959 VN |
390 | if (nelems) |
391 | size = roundup_pow_of_two(nelems * 3 / 2); | |
18093d1c HX |
392 | if (size < ht->p.min_size) |
393 | size = ht->p.min_size; | |
394 | ||
395 | if (old_tbl->size <= size) | |
396 | return 0; | |
397 | ||
b824478b HX |
398 | if (rht_dereference(old_tbl->future_tbl, ht)) |
399 | return -EEXIST; | |
400 | ||
da20420f | 401 | return rhashtable_rehash_alloc(ht, old_tbl, size); |
7e1e7763 | 402 | } |
7e1e7763 | 403 | |
97defe1e TG |
404 | static void rht_deferred_worker(struct work_struct *work) |
405 | { | |
406 | struct rhashtable *ht; | |
407 | struct bucket_table *tbl; | |
b824478b | 408 | int err = 0; |
97defe1e | 409 | |
57699a40 | 410 | ht = container_of(work, struct rhashtable, run_work); |
97defe1e | 411 | mutex_lock(&ht->mutex); |
28134a53 | 412 | |
97defe1e | 413 | tbl = rht_dereference(ht->tbl, ht); |
b824478b | 414 | tbl = rhashtable_last_table(ht, tbl); |
97defe1e | 415 | |
a5b6846f | 416 | if (rht_grow_above_75(ht, tbl)) |
da20420f | 417 | err = rhashtable_rehash_alloc(ht, tbl, tbl->size * 2); |
b5e2c150 | 418 | else if (ht->p.automatic_shrinking && rht_shrink_below_30(ht, tbl)) |
da20420f HX |
419 | err = rhashtable_shrink(ht); |
420 | else if (tbl->nest) | |
421 | err = rhashtable_rehash_alloc(ht, tbl, tbl->size); | |
b824478b | 422 | |
da20420f HX |
423 | if (!err) |
424 | err = rhashtable_rehash_table(ht); | |
b824478b | 425 | |
97defe1e | 426 | mutex_unlock(&ht->mutex); |
b824478b HX |
427 | |
428 | if (err) | |
429 | schedule_work(&ht->run_work); | |
97defe1e TG |
430 | } |
431 | ||
ca26893f HX |
432 | static int rhashtable_insert_rehash(struct rhashtable *ht, |
433 | struct bucket_table *tbl) | |
ccd57b1b HX |
434 | { |
435 | struct bucket_table *old_tbl; | |
436 | struct bucket_table *new_tbl; | |
ccd57b1b HX |
437 | unsigned int size; |
438 | int err; | |
439 | ||
440 | old_tbl = rht_dereference_rcu(ht->tbl, ht); | |
ccd57b1b HX |
441 | |
442 | size = tbl->size; | |
443 | ||
3cf92222 HX |
444 | err = -EBUSY; |
445 | ||
ccd57b1b HX |
446 | if (rht_grow_above_75(ht, tbl)) |
447 | size *= 2; | |
a87b9ebf TG |
448 | /* Do not schedule more than one rehash */ |
449 | else if (old_tbl != tbl) | |
3cf92222 HX |
450 | goto fail; |
451 | ||
452 | err = -ENOMEM; | |
ccd57b1b HX |
453 | |
454 | new_tbl = bucket_table_alloc(ht, size, GFP_ATOMIC); | |
3cf92222 HX |
455 | if (new_tbl == NULL) |
456 | goto fail; | |
ccd57b1b HX |
457 | |
458 | err = rhashtable_rehash_attach(ht, tbl, new_tbl); | |
459 | if (err) { | |
460 | bucket_table_free(new_tbl); | |
461 | if (err == -EEXIST) | |
462 | err = 0; | |
463 | } else | |
464 | schedule_work(&ht->run_work); | |
465 | ||
466 | return err; | |
3cf92222 HX |
467 | |
468 | fail: | |
469 | /* Do not fail the insert if someone else did a rehash. */ | |
470 | if (likely(rcu_dereference_raw(tbl->future_tbl))) | |
471 | return 0; | |
472 | ||
473 | /* Schedule async rehash to retry allocation in process context. */ | |
474 | if (err == -ENOMEM) | |
475 | schedule_work(&ht->run_work); | |
476 | ||
477 | return err; | |
ccd57b1b | 478 | } |
ccd57b1b | 479 | |
ca26893f HX |
480 | static void *rhashtable_lookup_one(struct rhashtable *ht, |
481 | struct bucket_table *tbl, unsigned int hash, | |
482 | const void *key, struct rhash_head *obj) | |
02fd97c3 | 483 | { |
ca26893f HX |
484 | struct rhashtable_compare_arg arg = { |
485 | .ht = ht, | |
486 | .key = key, | |
487 | }; | |
488 | struct rhash_head __rcu **pprev; | |
02fd97c3 | 489 | struct rhash_head *head; |
ca26893f | 490 | int elasticity; |
02fd97c3 | 491 | |
5f8ddeab | 492 | elasticity = RHT_ELASTICITY; |
da20420f HX |
493 | pprev = rht_bucket_var(tbl, hash); |
494 | rht_for_each_continue(head, *pprev, tbl, hash) { | |
ca26893f HX |
495 | struct rhlist_head *list; |
496 | struct rhlist_head *plist; | |
497 | ||
498 | elasticity--; | |
499 | if (!key || | |
500 | (ht->p.obj_cmpfn ? | |
501 | ht->p.obj_cmpfn(&arg, rht_obj(ht, head)) : | |
d3dcf8eb PB |
502 | rhashtable_compare(&arg, rht_obj(ht, head)))) { |
503 | pprev = &head->next; | |
ca26893f | 504 | continue; |
d3dcf8eb | 505 | } |
ca26893f HX |
506 | |
507 | if (!ht->rhlist) | |
508 | return rht_obj(ht, head); | |
509 | ||
510 | list = container_of(obj, struct rhlist_head, rhead); | |
511 | plist = container_of(head, struct rhlist_head, rhead); | |
512 | ||
513 | RCU_INIT_POINTER(list->next, plist); | |
514 | head = rht_dereference_bucket(head->next, tbl, hash); | |
515 | RCU_INIT_POINTER(list->rhead.next, head); | |
516 | rcu_assign_pointer(*pprev, obj); | |
517 | ||
518 | return NULL; | |
5ca8cc5b | 519 | } |
02fd97c3 | 520 | |
ca26893f HX |
521 | if (elasticity <= 0) |
522 | return ERR_PTR(-EAGAIN); | |
523 | ||
524 | return ERR_PTR(-ENOENT); | |
525 | } | |
526 | ||
527 | static struct bucket_table *rhashtable_insert_one(struct rhashtable *ht, | |
528 | struct bucket_table *tbl, | |
529 | unsigned int hash, | |
530 | struct rhash_head *obj, | |
531 | void *data) | |
532 | { | |
da20420f | 533 | struct rhash_head __rcu **pprev; |
ca26893f HX |
534 | struct bucket_table *new_tbl; |
535 | struct rhash_head *head; | |
536 | ||
537 | if (!IS_ERR_OR_NULL(data)) | |
538 | return ERR_PTR(-EEXIST); | |
07ee0722 | 539 | |
ca26893f HX |
540 | if (PTR_ERR(data) != -EAGAIN && PTR_ERR(data) != -ENOENT) |
541 | return ERR_CAST(data); | |
ccd57b1b | 542 | |
ca26893f HX |
543 | new_tbl = rcu_dereference(tbl->future_tbl); |
544 | if (new_tbl) | |
545 | return new_tbl; | |
546 | ||
547 | if (PTR_ERR(data) != -ENOENT) | |
548 | return ERR_CAST(data); | |
549 | ||
550 | if (unlikely(rht_grow_above_max(ht, tbl))) | |
551 | return ERR_PTR(-E2BIG); | |
552 | ||
553 | if (unlikely(rht_grow_above_100(ht, tbl))) | |
554 | return ERR_PTR(-EAGAIN); | |
02fd97c3 | 555 | |
da20420f HX |
556 | pprev = rht_bucket_insert(ht, tbl, hash); |
557 | if (!pprev) | |
558 | return ERR_PTR(-ENOMEM); | |
559 | ||
560 | head = rht_dereference_bucket(*pprev, tbl, hash); | |
02fd97c3 HX |
561 | |
562 | RCU_INIT_POINTER(obj->next, head); | |
ca26893f HX |
563 | if (ht->rhlist) { |
564 | struct rhlist_head *list; | |
565 | ||
566 | list = container_of(obj, struct rhlist_head, rhead); | |
567 | RCU_INIT_POINTER(list->next, NULL); | |
568 | } | |
02fd97c3 | 569 | |
da20420f | 570 | rcu_assign_pointer(*pprev, obj); |
02fd97c3 HX |
571 | |
572 | atomic_inc(&ht->nelems); | |
ca26893f HX |
573 | if (rht_grow_above_75(ht, tbl)) |
574 | schedule_work(&ht->run_work); | |
02fd97c3 | 575 | |
ca26893f HX |
576 | return NULL; |
577 | } | |
02fd97c3 | 578 | |
ca26893f HX |
579 | static void *rhashtable_try_insert(struct rhashtable *ht, const void *key, |
580 | struct rhash_head *obj) | |
581 | { | |
582 | struct bucket_table *new_tbl; | |
583 | struct bucket_table *tbl; | |
584 | unsigned int hash; | |
585 | spinlock_t *lock; | |
586 | void *data; | |
587 | ||
588 | tbl = rcu_dereference(ht->tbl); | |
589 | ||
590 | /* All insertions must grab the oldest table containing | |
591 | * the hashed bucket that is yet to be rehashed. | |
592 | */ | |
593 | for (;;) { | |
594 | hash = rht_head_hashfn(ht, tbl, obj, ht->p); | |
595 | lock = rht_bucket_lock(tbl, hash); | |
596 | spin_lock_bh(lock); | |
597 | ||
598 | if (tbl->rehash <= hash) | |
599 | break; | |
600 | ||
601 | spin_unlock_bh(lock); | |
602 | tbl = rcu_dereference(tbl->future_tbl); | |
603 | } | |
604 | ||
605 | data = rhashtable_lookup_one(ht, tbl, hash, key, obj); | |
606 | new_tbl = rhashtable_insert_one(ht, tbl, hash, obj, data); | |
607 | if (PTR_ERR(new_tbl) != -EEXIST) | |
608 | data = ERR_CAST(new_tbl); | |
609 | ||
610 | while (!IS_ERR_OR_NULL(new_tbl)) { | |
611 | tbl = new_tbl; | |
612 | hash = rht_head_hashfn(ht, tbl, obj, ht->p); | |
613 | spin_lock_nested(rht_bucket_lock(tbl, hash), | |
614 | SINGLE_DEPTH_NESTING); | |
615 | ||
616 | data = rhashtable_lookup_one(ht, tbl, hash, key, obj); | |
617 | new_tbl = rhashtable_insert_one(ht, tbl, hash, obj, data); | |
618 | if (PTR_ERR(new_tbl) != -EEXIST) | |
619 | data = ERR_CAST(new_tbl); | |
620 | ||
621 | spin_unlock(rht_bucket_lock(tbl, hash)); | |
622 | } | |
623 | ||
624 | spin_unlock_bh(lock); | |
625 | ||
626 | if (PTR_ERR(data) == -EAGAIN) | |
627 | data = ERR_PTR(rhashtable_insert_rehash(ht, tbl) ?: | |
628 | -EAGAIN); | |
629 | ||
630 | return data; | |
631 | } | |
632 | ||
633 | void *rhashtable_insert_slow(struct rhashtable *ht, const void *key, | |
634 | struct rhash_head *obj) | |
635 | { | |
636 | void *data; | |
637 | ||
638 | do { | |
639 | rcu_read_lock(); | |
640 | data = rhashtable_try_insert(ht, key, obj); | |
641 | rcu_read_unlock(); | |
642 | } while (PTR_ERR(data) == -EAGAIN); | |
643 | ||
644 | return data; | |
02fd97c3 HX |
645 | } |
646 | EXPORT_SYMBOL_GPL(rhashtable_insert_slow); | |
647 | ||
f2dba9c6 | 648 | /** |
246779dd | 649 | * rhashtable_walk_enter - Initialise an iterator |
f2dba9c6 HX |
650 | * @ht: Table to walk over |
651 | * @iter: Hash table Iterator | |
652 | * | |
653 | * This function prepares a hash table walk. | |
654 | * | |
655 | * Note that if you restart a walk after rhashtable_walk_stop you | |
656 | * may see the same object twice. Also, you may miss objects if | |
657 | * there are removals in between rhashtable_walk_stop and the next | |
658 | * call to rhashtable_walk_start. | |
659 | * | |
660 | * For a completely stable walk you should construct your own data | |
661 | * structure outside the hash table. | |
662 | * | |
82266e98 N |
663 | * This function may be called from any process context, including |
664 | * non-preemptable context, but cannot be called from softirq or | |
665 | * hardirq context. | |
f2dba9c6 | 666 | * |
246779dd | 667 | * You must call rhashtable_walk_exit after this function returns. |
f2dba9c6 | 668 | */ |
246779dd | 669 | void rhashtable_walk_enter(struct rhashtable *ht, struct rhashtable_iter *iter) |
f2dba9c6 HX |
670 | { |
671 | iter->ht = ht; | |
672 | iter->p = NULL; | |
673 | iter->slot = 0; | |
674 | iter->skip = 0; | |
2db54b47 | 675 | iter->end_of_table = 0; |
f2dba9c6 | 676 | |
c6ff5268 | 677 | spin_lock(&ht->lock); |
246779dd | 678 | iter->walker.tbl = |
179ccc0a | 679 | rcu_dereference_protected(ht->tbl, lockdep_is_held(&ht->lock)); |
246779dd | 680 | list_add(&iter->walker.list, &iter->walker.tbl->walkers); |
c6ff5268 | 681 | spin_unlock(&ht->lock); |
f2dba9c6 | 682 | } |
246779dd | 683 | EXPORT_SYMBOL_GPL(rhashtable_walk_enter); |
f2dba9c6 HX |
684 | |
685 | /** | |
686 | * rhashtable_walk_exit - Free an iterator | |
687 | * @iter: Hash table Iterator | |
688 | * | |
689 | * This function frees resources allocated by rhashtable_walk_init. | |
690 | */ | |
691 | void rhashtable_walk_exit(struct rhashtable_iter *iter) | |
692 | { | |
c6ff5268 | 693 | spin_lock(&iter->ht->lock); |
246779dd HX |
694 | if (iter->walker.tbl) |
695 | list_del(&iter->walker.list); | |
c6ff5268 | 696 | spin_unlock(&iter->ht->lock); |
f2dba9c6 HX |
697 | } |
698 | EXPORT_SYMBOL_GPL(rhashtable_walk_exit); | |
699 | ||
700 | /** | |
97a6ec4a | 701 | * rhashtable_walk_start_check - Start a hash table walk |
f2dba9c6 HX |
702 | * @iter: Hash table iterator |
703 | * | |
0647169c AG |
704 | * Start a hash table walk at the current iterator position. Note that we take |
705 | * the RCU lock in all cases including when we return an error. So you must | |
706 | * always call rhashtable_walk_stop to clean up. | |
f2dba9c6 HX |
707 | * |
708 | * Returns zero if successful. | |
709 | * | |
710 | * Returns -EAGAIN if resize event occured. Note that the iterator | |
711 | * will rewind back to the beginning and you may use it immediately | |
712 | * by calling rhashtable_walk_next. | |
97a6ec4a TH |
713 | * |
714 | * rhashtable_walk_start is defined as an inline variant that returns | |
715 | * void. This is preferred in cases where the caller would ignore | |
716 | * resize events and always continue. | |
f2dba9c6 | 717 | */ |
97a6ec4a | 718 | int rhashtable_walk_start_check(struct rhashtable_iter *iter) |
db4374f4 | 719 | __acquires(RCU) |
f2dba9c6 | 720 | { |
eddee5ba | 721 | struct rhashtable *ht = iter->ht; |
5d240a89 | 722 | bool rhlist = ht->rhlist; |
eddee5ba | 723 | |
c6ff5268 | 724 | rcu_read_lock(); |
eddee5ba | 725 | |
c6ff5268 | 726 | spin_lock(&ht->lock); |
246779dd HX |
727 | if (iter->walker.tbl) |
728 | list_del(&iter->walker.list); | |
c6ff5268 | 729 | spin_unlock(&ht->lock); |
eddee5ba | 730 | |
5d240a89 N |
731 | if (iter->end_of_table) |
732 | return 0; | |
733 | if (!iter->walker.tbl) { | |
246779dd | 734 | iter->walker.tbl = rht_dereference_rcu(ht->tbl, ht); |
b41cc04b N |
735 | iter->slot = 0; |
736 | iter->skip = 0; | |
f2dba9c6 HX |
737 | return -EAGAIN; |
738 | } | |
739 | ||
5d240a89 N |
740 | if (iter->p && !rhlist) { |
741 | /* | |
742 | * We need to validate that 'p' is still in the table, and | |
743 | * if so, update 'skip' | |
744 | */ | |
745 | struct rhash_head *p; | |
746 | int skip = 0; | |
747 | rht_for_each_rcu(p, iter->walker.tbl, iter->slot) { | |
748 | skip++; | |
749 | if (p == iter->p) { | |
750 | iter->skip = skip; | |
751 | goto found; | |
752 | } | |
753 | } | |
754 | iter->p = NULL; | |
755 | } else if (iter->p && rhlist) { | |
756 | /* Need to validate that 'list' is still in the table, and | |
757 | * if so, update 'skip' and 'p'. | |
758 | */ | |
759 | struct rhash_head *p; | |
760 | struct rhlist_head *list; | |
761 | int skip = 0; | |
762 | rht_for_each_rcu(p, iter->walker.tbl, iter->slot) { | |
763 | for (list = container_of(p, struct rhlist_head, rhead); | |
764 | list; | |
765 | list = rcu_dereference(list->next)) { | |
766 | skip++; | |
767 | if (list == iter->list) { | |
768 | iter->p = p; | |
769 | skip = skip; | |
770 | goto found; | |
771 | } | |
772 | } | |
773 | } | |
774 | iter->p = NULL; | |
775 | } | |
776 | found: | |
f2dba9c6 HX |
777 | return 0; |
778 | } | |
97a6ec4a | 779 | EXPORT_SYMBOL_GPL(rhashtable_walk_start_check); |
f2dba9c6 HX |
780 | |
781 | /** | |
2db54b47 TH |
782 | * __rhashtable_walk_find_next - Find the next element in a table (or the first |
783 | * one in case of a new walk). | |
784 | * | |
f2dba9c6 HX |
785 | * @iter: Hash table iterator |
786 | * | |
2db54b47 | 787 | * Returns the found object or NULL when the end of the table is reached. |
f2dba9c6 | 788 | * |
2db54b47 | 789 | * Returns -EAGAIN if resize event occurred. |
f2dba9c6 | 790 | */ |
2db54b47 | 791 | static void *__rhashtable_walk_find_next(struct rhashtable_iter *iter) |
f2dba9c6 | 792 | { |
246779dd | 793 | struct bucket_table *tbl = iter->walker.tbl; |
ca26893f | 794 | struct rhlist_head *list = iter->list; |
f2dba9c6 HX |
795 | struct rhashtable *ht = iter->ht; |
796 | struct rhash_head *p = iter->p; | |
ca26893f | 797 | bool rhlist = ht->rhlist; |
f2dba9c6 | 798 | |
2db54b47 TH |
799 | if (!tbl) |
800 | return NULL; | |
f2dba9c6 HX |
801 | |
802 | for (; iter->slot < tbl->size; iter->slot++) { | |
803 | int skip = iter->skip; | |
804 | ||
805 | rht_for_each_rcu(p, tbl, iter->slot) { | |
ca26893f HX |
806 | if (rhlist) { |
807 | list = container_of(p, struct rhlist_head, | |
808 | rhead); | |
809 | do { | |
810 | if (!skip) | |
811 | goto next; | |
812 | skip--; | |
813 | list = rcu_dereference(list->next); | |
814 | } while (list); | |
815 | ||
816 | continue; | |
817 | } | |
f2dba9c6 HX |
818 | if (!skip) |
819 | break; | |
820 | skip--; | |
821 | } | |
822 | ||
823 | next: | |
824 | if (!rht_is_a_nulls(p)) { | |
825 | iter->skip++; | |
826 | iter->p = p; | |
ca26893f HX |
827 | iter->list = list; |
828 | return rht_obj(ht, rhlist ? &list->rhead : p); | |
f2dba9c6 HX |
829 | } |
830 | ||
831 | iter->skip = 0; | |
832 | } | |
833 | ||
142b942a PS |
834 | iter->p = NULL; |
835 | ||
d88252f9 HX |
836 | /* Ensure we see any new tables. */ |
837 | smp_rmb(); | |
838 | ||
246779dd HX |
839 | iter->walker.tbl = rht_dereference_rcu(tbl->future_tbl, ht); |
840 | if (iter->walker.tbl) { | |
f2dba9c6 HX |
841 | iter->slot = 0; |
842 | iter->skip = 0; | |
f2dba9c6 | 843 | return ERR_PTR(-EAGAIN); |
2db54b47 TH |
844 | } else { |
845 | iter->end_of_table = true; | |
f2dba9c6 HX |
846 | } |
847 | ||
c936a79f | 848 | return NULL; |
f2dba9c6 | 849 | } |
2db54b47 TH |
850 | |
851 | /** | |
852 | * rhashtable_walk_next - Return the next object and advance the iterator | |
853 | * @iter: Hash table iterator | |
854 | * | |
855 | * Note that you must call rhashtable_walk_stop when you are finished | |
856 | * with the walk. | |
857 | * | |
858 | * Returns the next object or NULL when the end of the table is reached. | |
859 | * | |
860 | * Returns -EAGAIN if resize event occurred. Note that the iterator | |
861 | * will rewind back to the beginning and you may continue to use it. | |
862 | */ | |
863 | void *rhashtable_walk_next(struct rhashtable_iter *iter) | |
864 | { | |
865 | struct rhlist_head *list = iter->list; | |
866 | struct rhashtable *ht = iter->ht; | |
867 | struct rhash_head *p = iter->p; | |
868 | bool rhlist = ht->rhlist; | |
869 | ||
870 | if (p) { | |
871 | if (!rhlist || !(list = rcu_dereference(list->next))) { | |
872 | p = rcu_dereference(p->next); | |
873 | list = container_of(p, struct rhlist_head, rhead); | |
874 | } | |
875 | if (!rht_is_a_nulls(p)) { | |
876 | iter->skip++; | |
877 | iter->p = p; | |
878 | iter->list = list; | |
879 | return rht_obj(ht, rhlist ? &list->rhead : p); | |
880 | } | |
881 | ||
882 | /* At the end of this slot, switch to next one and then find | |
883 | * next entry from that point. | |
884 | */ | |
885 | iter->skip = 0; | |
886 | iter->slot++; | |
887 | } | |
888 | ||
889 | return __rhashtable_walk_find_next(iter); | |
890 | } | |
f2dba9c6 HX |
891 | EXPORT_SYMBOL_GPL(rhashtable_walk_next); |
892 | ||
2db54b47 TH |
893 | /** |
894 | * rhashtable_walk_peek - Return the next object but don't advance the iterator | |
895 | * @iter: Hash table iterator | |
896 | * | |
897 | * Returns the next object or NULL when the end of the table is reached. | |
898 | * | |
899 | * Returns -EAGAIN if resize event occurred. Note that the iterator | |
900 | * will rewind back to the beginning and you may continue to use it. | |
901 | */ | |
902 | void *rhashtable_walk_peek(struct rhashtable_iter *iter) | |
903 | { | |
904 | struct rhlist_head *list = iter->list; | |
905 | struct rhashtable *ht = iter->ht; | |
906 | struct rhash_head *p = iter->p; | |
907 | ||
908 | if (p) | |
909 | return rht_obj(ht, ht->rhlist ? &list->rhead : p); | |
910 | ||
911 | /* No object found in current iter, find next one in the table. */ | |
912 | ||
913 | if (iter->skip) { | |
914 | /* A nonzero skip value points to the next entry in the table | |
915 | * beyond that last one that was found. Decrement skip so | |
916 | * we find the current value. __rhashtable_walk_find_next | |
917 | * will restore the original value of skip assuming that | |
918 | * the table hasn't changed. | |
919 | */ | |
920 | iter->skip--; | |
921 | } | |
922 | ||
923 | return __rhashtable_walk_find_next(iter); | |
924 | } | |
925 | EXPORT_SYMBOL_GPL(rhashtable_walk_peek); | |
926 | ||
f2dba9c6 HX |
927 | /** |
928 | * rhashtable_walk_stop - Finish a hash table walk | |
929 | * @iter: Hash table iterator | |
930 | * | |
0647169c AG |
931 | * Finish a hash table walk. Does not reset the iterator to the start of the |
932 | * hash table. | |
f2dba9c6 HX |
933 | */ |
934 | void rhashtable_walk_stop(struct rhashtable_iter *iter) | |
db4374f4 | 935 | __releases(RCU) |
f2dba9c6 | 936 | { |
eddee5ba | 937 | struct rhashtable *ht; |
246779dd | 938 | struct bucket_table *tbl = iter->walker.tbl; |
eddee5ba | 939 | |
eddee5ba | 940 | if (!tbl) |
963ecbd4 | 941 | goto out; |
eddee5ba HX |
942 | |
943 | ht = iter->ht; | |
944 | ||
ba7c95ea | 945 | spin_lock(&ht->lock); |
c4db8848 | 946 | if (tbl->rehash < tbl->size) |
246779dd | 947 | list_add(&iter->walker.list, &tbl->walkers); |
eddee5ba | 948 | else |
246779dd | 949 | iter->walker.tbl = NULL; |
ba7c95ea | 950 | spin_unlock(&ht->lock); |
eddee5ba | 951 | |
963ecbd4 HX |
952 | out: |
953 | rcu_read_unlock(); | |
f2dba9c6 HX |
954 | } |
955 | EXPORT_SYMBOL_GPL(rhashtable_walk_stop); | |
956 | ||
488fb86e | 957 | static size_t rounded_hashtable_size(const struct rhashtable_params *params) |
7e1e7763 | 958 | { |
94000176 | 959 | return max(roundup_pow_of_two(params->nelem_hint * 4 / 3), |
e2e21c1c | 960 | (unsigned long)params->min_size); |
7e1e7763 TG |
961 | } |
962 | ||
31ccde2d HX |
963 | static u32 rhashtable_jhash2(const void *key, u32 length, u32 seed) |
964 | { | |
965 | return jhash2(key, length, seed); | |
966 | } | |
967 | ||
7e1e7763 TG |
968 | /** |
969 | * rhashtable_init - initialize a new hash table | |
970 | * @ht: hash table to be initialized | |
971 | * @params: configuration parameters | |
972 | * | |
973 | * Initializes a new hash table based on the provided configuration | |
974 | * parameters. A table can be configured either with a variable or | |
975 | * fixed length key: | |
976 | * | |
977 | * Configuration Example 1: Fixed length keys | |
978 | * struct test_obj { | |
979 | * int key; | |
980 | * void * my_member; | |
981 | * struct rhash_head node; | |
982 | * }; | |
983 | * | |
984 | * struct rhashtable_params params = { | |
985 | * .head_offset = offsetof(struct test_obj, node), | |
986 | * .key_offset = offsetof(struct test_obj, key), | |
987 | * .key_len = sizeof(int), | |
87545899 | 988 | * .hashfn = jhash, |
7e1e7763 TG |
989 | * }; |
990 | * | |
991 | * Configuration Example 2: Variable length keys | |
992 | * struct test_obj { | |
993 | * [...] | |
994 | * struct rhash_head node; | |
995 | * }; | |
996 | * | |
49f7b33e | 997 | * u32 my_hash_fn(const void *data, u32 len, u32 seed) |
7e1e7763 TG |
998 | * { |
999 | * struct test_obj *obj = data; | |
1000 | * | |
1001 | * return [... hash ...]; | |
1002 | * } | |
1003 | * | |
1004 | * struct rhashtable_params params = { | |
1005 | * .head_offset = offsetof(struct test_obj, node), | |
87545899 | 1006 | * .hashfn = jhash, |
7e1e7763 | 1007 | * .obj_hashfn = my_hash_fn, |
7e1e7763 TG |
1008 | * }; |
1009 | */ | |
488fb86e HX |
1010 | int rhashtable_init(struct rhashtable *ht, |
1011 | const struct rhashtable_params *params) | |
7e1e7763 TG |
1012 | { |
1013 | struct bucket_table *tbl; | |
1014 | size_t size; | |
1015 | ||
1016 | size = HASH_DEFAULT_SIZE; | |
1017 | ||
31ccde2d | 1018 | if ((!params->key_len && !params->obj_hashfn) || |
02fd97c3 | 1019 | (params->obj_hashfn && !params->obj_cmpfn)) |
7e1e7763 TG |
1020 | return -EINVAL; |
1021 | ||
97defe1e TG |
1022 | memset(ht, 0, sizeof(*ht)); |
1023 | mutex_init(&ht->mutex); | |
ba7c95ea | 1024 | spin_lock_init(&ht->lock); |
97defe1e TG |
1025 | memcpy(&ht->p, params, sizeof(*params)); |
1026 | ||
a998f712 TG |
1027 | if (params->min_size) |
1028 | ht->p.min_size = roundup_pow_of_two(params->min_size); | |
1029 | ||
6d684e54 HX |
1030 | /* Cap total entries at 2^31 to avoid nelems overflow. */ |
1031 | ht->max_elems = 1u << 31; | |
2d2ab658 HX |
1032 | |
1033 | if (params->max_size) { | |
1034 | ht->p.max_size = rounddown_pow_of_two(params->max_size); | |
1035 | if (ht->p.max_size < ht->max_elems / 2) | |
1036 | ht->max_elems = ht->p.max_size * 2; | |
1037 | } | |
6d684e54 | 1038 | |
48e75b43 | 1039 | ht->p.min_size = max_t(u16, ht->p.min_size, HASH_MIN_SIZE); |
a998f712 | 1040 | |
3a324606 HX |
1041 | if (params->nelem_hint) |
1042 | size = rounded_hashtable_size(&ht->p); | |
1043 | ||
97defe1e TG |
1044 | if (params->locks_mul) |
1045 | ht->p.locks_mul = roundup_pow_of_two(params->locks_mul); | |
1046 | else | |
1047 | ht->p.locks_mul = BUCKET_LOCKS_PER_CPU; | |
1048 | ||
31ccde2d HX |
1049 | ht->key_len = ht->p.key_len; |
1050 | if (!params->hashfn) { | |
1051 | ht->p.hashfn = jhash; | |
1052 | ||
1053 | if (!(ht->key_len & (sizeof(u32) - 1))) { | |
1054 | ht->key_len /= sizeof(u32); | |
1055 | ht->p.hashfn = rhashtable_jhash2; | |
1056 | } | |
1057 | } | |
1058 | ||
b9ecfdaa | 1059 | tbl = bucket_table_alloc(ht, size, GFP_KERNEL); |
7e1e7763 TG |
1060 | if (tbl == NULL) |
1061 | return -ENOMEM; | |
1062 | ||
545a148e | 1063 | atomic_set(&ht->nelems, 0); |
a5b6846f | 1064 | |
7e1e7763 TG |
1065 | RCU_INIT_POINTER(ht->tbl, tbl); |
1066 | ||
4c4b52d9 | 1067 | INIT_WORK(&ht->run_work, rht_deferred_worker); |
97defe1e | 1068 | |
7e1e7763 TG |
1069 | return 0; |
1070 | } | |
1071 | EXPORT_SYMBOL_GPL(rhashtable_init); | |
1072 | ||
ca26893f HX |
1073 | /** |
1074 | * rhltable_init - initialize a new hash list table | |
1075 | * @hlt: hash list table to be initialized | |
1076 | * @params: configuration parameters | |
1077 | * | |
1078 | * Initializes a new hash list table. | |
1079 | * | |
1080 | * See documentation for rhashtable_init. | |
1081 | */ | |
1082 | int rhltable_init(struct rhltable *hlt, const struct rhashtable_params *params) | |
1083 | { | |
1084 | int err; | |
1085 | ||
ca26893f HX |
1086 | err = rhashtable_init(&hlt->ht, params); |
1087 | hlt->ht.rhlist = true; | |
1088 | return err; | |
1089 | } | |
1090 | EXPORT_SYMBOL_GPL(rhltable_init); | |
1091 | ||
1092 | static void rhashtable_free_one(struct rhashtable *ht, struct rhash_head *obj, | |
1093 | void (*free_fn)(void *ptr, void *arg), | |
1094 | void *arg) | |
1095 | { | |
1096 | struct rhlist_head *list; | |
1097 | ||
1098 | if (!ht->rhlist) { | |
1099 | free_fn(rht_obj(ht, obj), arg); | |
1100 | return; | |
1101 | } | |
1102 | ||
1103 | list = container_of(obj, struct rhlist_head, rhead); | |
1104 | do { | |
1105 | obj = &list->rhead; | |
1106 | list = rht_dereference(list->next, ht); | |
1107 | free_fn(rht_obj(ht, obj), arg); | |
1108 | } while (list); | |
1109 | } | |
1110 | ||
7e1e7763 | 1111 | /** |
6b6f302c | 1112 | * rhashtable_free_and_destroy - free elements and destroy hash table |
7e1e7763 | 1113 | * @ht: the hash table to destroy |
6b6f302c TG |
1114 | * @free_fn: callback to release resources of element |
1115 | * @arg: pointer passed to free_fn | |
7e1e7763 | 1116 | * |
6b6f302c TG |
1117 | * Stops an eventual async resize. If defined, invokes free_fn for each |
1118 | * element to releasal resources. Please note that RCU protected | |
1119 | * readers may still be accessing the elements. Releasing of resources | |
1120 | * must occur in a compatible manner. Then frees the bucket array. | |
1121 | * | |
1122 | * This function will eventually sleep to wait for an async resize | |
1123 | * to complete. The caller is responsible that no further write operations | |
1124 | * occurs in parallel. | |
7e1e7763 | 1125 | */ |
6b6f302c TG |
1126 | void rhashtable_free_and_destroy(struct rhashtable *ht, |
1127 | void (*free_fn)(void *ptr, void *arg), | |
1128 | void *arg) | |
7e1e7763 | 1129 | { |
da20420f | 1130 | struct bucket_table *tbl; |
6b6f302c | 1131 | unsigned int i; |
97defe1e | 1132 | |
4c4b52d9 | 1133 | cancel_work_sync(&ht->run_work); |
97defe1e | 1134 | |
57699a40 | 1135 | mutex_lock(&ht->mutex); |
6b6f302c TG |
1136 | tbl = rht_dereference(ht->tbl, ht); |
1137 | if (free_fn) { | |
1138 | for (i = 0; i < tbl->size; i++) { | |
1139 | struct rhash_head *pos, *next; | |
1140 | ||
ae6da1f5 | 1141 | cond_resched(); |
da20420f | 1142 | for (pos = rht_dereference(*rht_bucket(tbl, i), ht), |
6b6f302c TG |
1143 | next = !rht_is_a_nulls(pos) ? |
1144 | rht_dereference(pos->next, ht) : NULL; | |
1145 | !rht_is_a_nulls(pos); | |
1146 | pos = next, | |
1147 | next = !rht_is_a_nulls(pos) ? | |
1148 | rht_dereference(pos->next, ht) : NULL) | |
ca26893f | 1149 | rhashtable_free_one(ht, pos, free_fn, arg); |
6b6f302c TG |
1150 | } |
1151 | } | |
1152 | ||
1153 | bucket_table_free(tbl); | |
97defe1e | 1154 | mutex_unlock(&ht->mutex); |
7e1e7763 | 1155 | } |
6b6f302c TG |
1156 | EXPORT_SYMBOL_GPL(rhashtable_free_and_destroy); |
1157 | ||
1158 | void rhashtable_destroy(struct rhashtable *ht) | |
1159 | { | |
1160 | return rhashtable_free_and_destroy(ht, NULL, NULL); | |
1161 | } | |
7e1e7763 | 1162 | EXPORT_SYMBOL_GPL(rhashtable_destroy); |
da20420f HX |
1163 | |
1164 | struct rhash_head __rcu **rht_bucket_nested(const struct bucket_table *tbl, | |
1165 | unsigned int hash) | |
1166 | { | |
1167 | const unsigned int shift = PAGE_SHIFT - ilog2(sizeof(void *)); | |
1168 | static struct rhash_head __rcu *rhnull = | |
1169 | (struct rhash_head __rcu *)NULLS_MARKER(0); | |
1170 | unsigned int index = hash & ((1 << tbl->nest) - 1); | |
1171 | unsigned int size = tbl->size >> tbl->nest; | |
1172 | unsigned int subhash = hash; | |
1173 | union nested_table *ntbl; | |
1174 | ||
1175 | ntbl = (union nested_table *)rcu_dereference_raw(tbl->buckets[0]); | |
c4d2603d | 1176 | ntbl = rht_dereference_bucket_rcu(ntbl[index].table, tbl, hash); |
da20420f HX |
1177 | subhash >>= tbl->nest; |
1178 | ||
1179 | while (ntbl && size > (1 << shift)) { | |
1180 | index = subhash & ((1 << shift) - 1); | |
c4d2603d HX |
1181 | ntbl = rht_dereference_bucket_rcu(ntbl[index].table, |
1182 | tbl, hash); | |
da20420f HX |
1183 | size >>= shift; |
1184 | subhash >>= shift; | |
1185 | } | |
1186 | ||
1187 | if (!ntbl) | |
1188 | return &rhnull; | |
1189 | ||
1190 | return &ntbl[subhash].bucket; | |
1191 | ||
1192 | } | |
1193 | EXPORT_SYMBOL_GPL(rht_bucket_nested); | |
1194 | ||
1195 | struct rhash_head __rcu **rht_bucket_nested_insert(struct rhashtable *ht, | |
1196 | struct bucket_table *tbl, | |
1197 | unsigned int hash) | |
1198 | { | |
1199 | const unsigned int shift = PAGE_SHIFT - ilog2(sizeof(void *)); | |
1200 | unsigned int index = hash & ((1 << tbl->nest) - 1); | |
1201 | unsigned int size = tbl->size >> tbl->nest; | |
1202 | union nested_table *ntbl; | |
da20420f HX |
1203 | |
1204 | ntbl = (union nested_table *)rcu_dereference_raw(tbl->buckets[0]); | |
1205 | hash >>= tbl->nest; | |
da20420f | 1206 | ntbl = nested_table_alloc(ht, &ntbl[index].table, |
5af68ef7 | 1207 | size <= (1 << shift)); |
da20420f HX |
1208 | |
1209 | while (ntbl && size > (1 << shift)) { | |
1210 | index = hash & ((1 << shift) - 1); | |
1211 | size >>= shift; | |
1212 | hash >>= shift; | |
da20420f | 1213 | ntbl = nested_table_alloc(ht, &ntbl[index].table, |
5af68ef7 | 1214 | size <= (1 << shift)); |
da20420f HX |
1215 | } |
1216 | ||
1217 | if (!ntbl) | |
1218 | return NULL; | |
1219 | ||
1220 | return &ntbl[hash].bucket; | |
1221 | ||
1222 | } | |
1223 | EXPORT_SYMBOL_GPL(rht_bucket_nested_insert); |