4 * Userspace RCU library - Lock-Free Resizable RCU Hash Table
6 * Copyright 2010-2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
7 * Copyright 2011 - Lai Jiangshan <laijs@cn.fujitsu.com>
9 * This library is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public
11 * License as published by the Free Software Foundation; either
12 * version 2.1 of the License, or (at your option) any later version.
14 * This library is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with this library; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 * Based on the following articles:
26 * - Ori Shalev and Nir Shavit. Split-ordered lists: Lock-free
27 * extensible hash tables. J. ACM 53, 3 (May 2006), 379-405.
28 * - Michael, M. M. High performance dynamic lock-free hash tables
29 * and list-based sets. In Proceedings of the fourteenth annual ACM
30 * symposium on Parallel algorithms and architectures, ACM Press,
33 * Some specificities of this Lock-Free Resizable RCU Hash Table
36 * - RCU read-side critical section allows readers to perform hash
37 * table lookups, as well as traversals, and use the returned objects
38 * safely by allowing memory reclaim to take place only after a grace
40 * - Add and remove operations are lock-free, and do not need to
41 * allocate memory. They need to be executed within RCU read-side
42 * critical section to ensure the objects they read are valid and to
43 * deal with the cmpxchg ABA problem.
44 * - add and add_unique operations are supported. add_unique checks if
45 * the node key already exists in the hash table. It ensures not to
46 * populate a duplicate key if the node key already exists in the hash
48 * - The resize operation executes concurrently with
49 * add/add_unique/add_replace/remove/lookup/traversal.
50 * - Hash table nodes are contained within a split-ordered list. This
51 * list is ordered by incrementing reversed-bits-hash value.
52 * - An index of bucket nodes is kept. These bucket nodes are the hash
53 * table "buckets". These buckets are internal nodes that allow to
54 * perform a fast hash lookup, similarly to a skip list. These
55 * buckets are chained together in the split-ordered list, which
56 * allows recursive expansion by inserting new buckets between the
57 * existing buckets. The split-ordered list allows adding new buckets
58 * between existing buckets as the table needs to grow.
59 * - The resize operation for small tables only allows expanding the
60 * hash table. It is triggered automatically by detecting long chains
61 * in the add operation.
62 * - The resize operation for larger tables (and available through an
63 * API) allows both expanding and shrinking the hash table.
64 * - Split-counters are used to keep track of the number of
65 * nodes within the hash table for automatic resize triggering.
66 * - Resize operation initiated by long chain detection is executed by a
67 * worker thread, which keeps lock-freedom of add and remove.
68 * - Resize operations are protected by a mutex.
69 * - The removal operation is split in two parts: first, a "removed"
70 * flag is set in the next pointer within the node to remove. Then,
71 * a "garbage collection" is performed in the bucket containing the
72 * removed node (from the start of the bucket up to the removed node).
73 * All encountered nodes with "removed" flag set in their next
74 * pointers are removed from the linked-list. If the cmpxchg used for
75 * removal fails (due to concurrent garbage-collection or concurrent
76 * add), we retry from the beginning of the bucket. This ensures that
77 * the node with "removed" flag set is removed from the hash table
78 * (not visible to lookups anymore) before the RCU read-side critical
79 * section held across removal ends. Furthermore, this ensures that
80 * the node with "removed" flag set is removed from the linked-list
81 * before its memory is reclaimed. After setting the "removal" flag,
82 * only the thread which removal is the first to set the "removal
83 * owner" flag (with an xchg) into a node's next pointer is considered
84 * to have succeeded its removal (and thus owns the node to reclaim).
85 * Because we garbage-collect starting from an invariant node (the
86 * start-of-bucket bucket node) up to the "removed" node (or find a
87 * reverse-hash that is higher), we are sure that a successful
88 * traversal of the chain leads to a chain that is present in the
89 * linked-list (the start node is never removed) and that it does not
90 * contain the "removed" node anymore, even if concurrent delete/add
91 * operations are changing the structure of the list concurrently.
92 * - The add operations perform garbage collection of buckets if they
93 * encounter nodes with removed flag set in the bucket where they want
94 * to add their new node. This ensures lock-freedom of add operation by
95 * helping the remover unlink nodes from the list rather than to wait
97 * - There are three memory backends for the hash table buckets: the
98 * "order table", the "chunks", and the "mmap".
99 * - These bucket containers contain a compact version of the hash table
101 * - The RCU "order table":
102 * - has a first level table indexed by log2(hash index) which is
103 * copied and expanded by the resize operation. This order table
104 * allows finding the "bucket node" tables.
105 * - There is one bucket node table per hash index order. The size of
106 * each bucket node table is half the number of hashes contained in
107 * this order (except for order 0).
108 * - The RCU "chunks" is best suited for close interaction with a page
109 * allocator. It uses a linear array as index to "chunks" containing
110 * each the same number of buckets.
111 * - The RCU "mmap" memory backend uses a single memory map to hold
113 * - synchronize_rcu is used to garbage-collect the old bucket node table.
115 * Ordering Guarantees:
117 * To discuss these guarantees, we first define "read" operation as any
118 * of the the basic cds_lfht_lookup, cds_lfht_next_duplicate,
119 * cds_lfht_first, cds_lfht_next operation, as well as
120 * cds_lfht_add_unique (failure).
122 * We define "read traversal" operation as any of the following
123 * group of operations
124 * - cds_lfht_lookup followed by iteration with cds_lfht_next_duplicate
125 * (and/or cds_lfht_next, although less common).
126 * - cds_lfht_add_unique (failure) followed by iteration with
127 * cds_lfht_next_duplicate (and/or cds_lfht_next, although less
129 * - cds_lfht_first followed iteration with cds_lfht_next (and/or
130 * cds_lfht_next_duplicate, although less common).
132 * We define "write" operations as any of cds_lfht_add, cds_lfht_replace,
133 * cds_lfht_add_unique (success), cds_lfht_add_replace, cds_lfht_del.
135 * When cds_lfht_add_unique succeeds (returns the node passed as
136 * parameter), it acts as a "write" operation. When cds_lfht_add_unique
137 * fails (returns a node different from the one passed as parameter), it
138 * acts as a "read" operation. A cds_lfht_add_unique failure is a
139 * cds_lfht_lookup "read" operation, therefore, any ordering guarantee
140 * referring to "lookup" imply any of "lookup" or cds_lfht_add_unique
143 * We define "prior" and "later" node as nodes observable by reads and
144 * read traversals respectively before and after a write or sequence of
147 * Hash-table operations are often cascaded, for example, the pointer
148 * returned by a cds_lfht_lookup() might be passed to a cds_lfht_next(),
149 * whose return value might in turn be passed to another hash-table
150 * operation. This entire cascaded series of operations must be enclosed
151 * by a pair of matching rcu_read_lock() and rcu_read_unlock()
154 * The following ordering guarantees are offered by this hash table:
156 * A.1) "read" after "write": if there is ordering between a write and a
157 * later read, then the read is guaranteed to see the write or some
159 * A.2) "read traversal" after "write": given that there is dependency
160 * ordering between reads in a "read traversal", if there is
161 * ordering between a write and the first read of the traversal,
162 * then the "read traversal" is guaranteed to see the write or
164 * B.1) "write" after "read": if there is ordering between a read and a
165 * later write, then the read will never see the write.
166 * B.2) "write" after "read traversal": given that there is dependency
167 * ordering between reads in a "read traversal", if there is
168 * ordering between the last read of the traversal and a later
169 * write, then the "read traversal" will never see the write.
170 * C) "write" while "read traversal": if a write occurs during a "read
171 * traversal", the traversal may, or may not, see the write.
172 * D.1) "write" after "write": if there is ordering between a write and
173 * a later write, then the later write is guaranteed to see the
174 * effects of the first write.
175 * D.2) Concurrent "write" pairs: The system will assign an arbitrary
176 * order to any pair of concurrent conflicting writes.
177 * Non-conflicting writes (for example, to different keys) are
179 * E) If a grace period separates a "del" or "replace" operation
180 * and a subsequent operation, then that subsequent operation is
181 * guaranteed not to see the removed item.
182 * F) Uniqueness guarantee: given a hash table that does not contain
183 * duplicate items for a given key, there will only be one item in
184 * the hash table after an arbitrary sequence of add_unique and/or
185 * add_replace operations. Note, however, that a pair of
186 * concurrent read operations might well access two different items
188 * G.1) If a pair of lookups for a given key are ordered (e.g. by a
189 * memory barrier), then the second lookup will return the same
190 * node as the previous lookup, or some later node.
191 * G.2) A "read traversal" that starts after the end of a prior "read
192 * traversal" (ordered by memory barriers) is guaranteed to see the
193 * same nodes as the previous traversal, or some later nodes.
194 * G.3) Concurrent "read" pairs: concurrent reads are unordered. For
195 * example, if a pair of reads to the same key run concurrently
196 * with an insertion of that same key, the reads remain unordered
197 * regardless of their return values. In other words, you cannot
198 * rely on the values returned by the reads to deduce ordering.
200 * Progress guarantees:
202 * * Reads are wait-free. These operations always move forward in the
203 * hash table linked list, and this list has no loop.
204 * * Writes are lock-free. Any retry loop performed by a write operation
205 * is triggered by progress made within another update operation.
207 * Bucket node tables:
209 * hash table hash table the last all bucket node tables
210 * order size bucket node 0 1 2 3 4 5 6(index)
217 * 5 32 16 1 1 2 4 8 16
218 * 6 64 32 1 1 2 4 8 16 32
220 * When growing/shrinking, we only focus on the last bucket node table
221 * which size is (!order ? 1 : (1 << (order -1))).
223 * Example for growing/shrinking:
224 * grow hash table from order 5 to 6: init the index=6 bucket node table
225 * shrink hash table from order 6 to 5: fini the index=6 bucket node table
227 * A bit of ascii art explanation:
229 * The order index is the off-by-one compared to the actual power of 2
230 * because we use index 0 to deal with the 0 special-case.
232 * This shows the nodes for a small table ordered by reversed bits:
244 * This shows the nodes in order of non-reversed bits, linked by
245 * reversed-bit order.
250 * 2 | | 2 010 010 <- |
251 * | | | 3 011 110 | <- |
252 * 3 -> | | | 4 100 001 | |
268 #include "compat-getcpu.h"
269 #include <urcu/pointer.h>
270 #include <urcu/call-rcu.h>
271 #include <urcu/flavor.h>
272 #include <urcu/arch.h>
273 #include <urcu/uatomic.h>
274 #include <urcu/compiler.h>
275 #include <urcu/rculfhash.h>
276 #include <urcu/static/urcu-signal-nr.h>
280 #include "rculfhash-internal.h"
281 #include "workqueue.h"
282 #include "urcu-die.h"
283 #include "urcu-utils.h"
284 #include "compat-smp.h"
287 * Split-counters lazily update the global counter each 1024
288 * addition/removal. It automatically keeps track of resize required.
289 * We use the bucket length as indicator for need to expand for small
290 * tables and machines lacking per-cpu data support.
292 #define COUNT_COMMIT_ORDER 10
293 #define DEFAULT_SPLIT_COUNT_MASK 0xFUL
294 #define CHAIN_LEN_TARGET 1
295 #define CHAIN_LEN_RESIZE_THRESHOLD 3
298 * Define the minimum table size.
300 #define MIN_TABLE_ORDER 0
301 #define MIN_TABLE_SIZE (1UL << MIN_TABLE_ORDER)
304 * Minimum number of bucket nodes to touch per thread to parallelize grow/shrink.
306 #define MIN_PARTITION_PER_THREAD_ORDER 12
307 #define MIN_PARTITION_PER_THREAD (1UL << MIN_PARTITION_PER_THREAD_ORDER)
310 * The removed flag needs to be updated atomically with the pointer.
311 * It indicates that no node must attach to the node scheduled for
312 * removal, and that node garbage collection must be performed.
313 * The bucket flag does not require to be updated atomically with the
314 * pointer, but it is added as a pointer low bit flag to save space.
315 * The "removal owner" flag is used to detect which of the "del"
316 * operation that has set the "removed flag" gets to return the removed
317 * node to its caller. Note that the replace operation does not need to
318 * iteract with the "removal owner" flag, because it validates that
319 * the "removed" flag is not set before performing its cmpxchg.
321 #define REMOVED_FLAG (1UL << 0)
322 #define BUCKET_FLAG (1UL << 1)
323 #define REMOVAL_OWNER_FLAG (1UL << 2)
324 #define FLAGS_MASK ((1UL << 3) - 1)
326 /* Value of the end pointer. Should not interact with flags. */
327 #define END_VALUE NULL
330 * ht_items_count: Split-counters counting the number of node addition
331 * and removal in the table. Only used if the CDS_LFHT_ACCOUNTING flag
332 * is set at hash table creation.
334 * These are free-running counters, never reset to zero. They count the
335 * number of add/remove, and trigger every (1 << COUNT_COMMIT_ORDER)
336 * operations to update the global counter. We choose a power-of-2 value
337 * for the trigger to deal with 32 or 64-bit overflow of the counter.
339 struct ht_items_count
{
340 unsigned long add
, del
;
341 } __attribute__((aligned(CAA_CACHE_LINE_SIZE
)));
344 * resize_work: Contains arguments passed to worker thread
345 * responsible for performing lazy resize.
348 struct urcu_work work
;
353 * partition_resize_work: Contains arguments passed to worker threads
354 * executing the hash table resize on partitions of the hash table
355 * assigned to each processor's worker thread.
357 struct partition_resize_work
{
360 unsigned long i
, start
, len
;
361 void (*fct
)(struct cds_lfht
*ht
, unsigned long i
,
362 unsigned long start
, unsigned long len
);
365 static struct urcu_workqueue
*cds_lfht_workqueue
;
366 static unsigned long cds_lfht_workqueue_user_count
;
369 * Mutex ensuring mutual exclusion between workqueue initialization and
370 * fork handlers. cds_lfht_fork_mutex nests inside call_rcu_mutex.
372 static pthread_mutex_t cds_lfht_fork_mutex
= PTHREAD_MUTEX_INITIALIZER
;
374 static struct urcu_atfork cds_lfht_atfork
;
377 * atfork handler nesting counters. Handle being registered to many urcu
378 * flavors, thus being possibly invoked more than once in the
379 * pthread_atfork list of callbacks.
381 static int cds_lfht_workqueue_atfork_nesting
;
383 static void cds_lfht_init_worker(const struct rcu_flavor_struct
*flavor
);
384 static void cds_lfht_fini_worker(const struct rcu_flavor_struct
*flavor
);
386 #ifdef CONFIG_CDS_LFHT_ITER_DEBUG
389 void cds_lfht_iter_debug_set_ht(struct cds_lfht
*ht
, struct cds_lfht_iter
*iter
)
394 #define cds_lfht_iter_debug_assert(...) assert(__VA_ARGS__)
399 void cds_lfht_iter_debug_set_ht(struct cds_lfht
*ht
__attribute__((unused
)),
400 struct cds_lfht_iter
*iter
__attribute__((unused
)))
404 #define cds_lfht_iter_debug_assert(...)
409 * Algorithm to reverse bits in a word by lookup table, extended to
412 * http://graphics.stanford.edu/~seander/bithacks.html#BitReverseTable
413 * Originally from Public Domain.
416 static const uint8_t BitReverseTable256
[256] =
418 #define R2(n) (n), (n) + 2*64, (n) + 1*64, (n) + 3*64
419 #define R4(n) R2(n), R2((n) + 2*16), R2((n) + 1*16), R2((n) + 3*16)
420 #define R6(n) R4(n), R4((n) + 2*4 ), R4((n) + 1*4 ), R4((n) + 3*4 )
421 R6(0), R6(2), R6(1), R6(3)
428 uint8_t bit_reverse_u8(uint8_t v
)
430 return BitReverseTable256
[v
];
433 #if (CAA_BITS_PER_LONG == 32)
435 uint32_t bit_reverse_u32(uint32_t v
)
437 return ((uint32_t) bit_reverse_u8(v
) << 24) |
438 ((uint32_t) bit_reverse_u8(v
>> 8) << 16) |
439 ((uint32_t) bit_reverse_u8(v
>> 16) << 8) |
440 ((uint32_t) bit_reverse_u8(v
>> 24));
444 uint64_t bit_reverse_u64(uint64_t v
)
446 return ((uint64_t) bit_reverse_u8(v
) << 56) |
447 ((uint64_t) bit_reverse_u8(v
>> 8) << 48) |
448 ((uint64_t) bit_reverse_u8(v
>> 16) << 40) |
449 ((uint64_t) bit_reverse_u8(v
>> 24) << 32) |
450 ((uint64_t) bit_reverse_u8(v
>> 32) << 24) |
451 ((uint64_t) bit_reverse_u8(v
>> 40) << 16) |
452 ((uint64_t) bit_reverse_u8(v
>> 48) << 8) |
453 ((uint64_t) bit_reverse_u8(v
>> 56));
458 unsigned long bit_reverse_ulong(unsigned long v
)
460 #if (CAA_BITS_PER_LONG == 32)
461 return bit_reverse_u32(v
);
463 return bit_reverse_u64(v
);
468 * fls: returns the position of the most significant bit.
469 * Returns 0 if no bit is set, else returns the position of the most
470 * significant bit (from 1 to 32 on 32-bit, from 1 to 64 on 64-bit).
472 #if defined(__i386) || defined(__x86_64)
474 unsigned int fls_u32(uint32_t x
)
478 __asm__ ("bsrl %1,%0\n\t"
482 : "=r" (r
) : "rm" (x
));
488 #if defined(__x86_64)
490 unsigned int fls_u64(uint64_t x
)
494 __asm__ ("bsrq %1,%0\n\t"
498 : "=r" (r
) : "rm" (x
));
505 static __attribute__((unused
))
506 unsigned int fls_u64(uint64_t x
)
513 if (!(x
& 0xFFFFFFFF00000000ULL
)) {
517 if (!(x
& 0xFFFF000000000000ULL
)) {
521 if (!(x
& 0xFF00000000000000ULL
)) {
525 if (!(x
& 0xF000000000000000ULL
)) {
529 if (!(x
& 0xC000000000000000ULL
)) {
533 if (!(x
& 0x8000000000000000ULL
)) {
542 static __attribute__((unused
))
543 unsigned int fls_u32(uint32_t x
)
549 if (!(x
& 0xFFFF0000U
)) {
553 if (!(x
& 0xFF000000U
)) {
557 if (!(x
& 0xF0000000U
)) {
561 if (!(x
& 0xC0000000U
)) {
565 if (!(x
& 0x80000000U
)) {
573 unsigned int cds_lfht_fls_ulong(unsigned long x
)
575 #if (CAA_BITS_PER_LONG == 32)
583 * Return the minimum order for which x <= (1UL << order).
584 * Return -1 if x is 0.
587 int cds_lfht_get_count_order_u32(uint32_t x
)
592 return fls_u32(x
- 1);
596 * Return the minimum order for which x <= (1UL << order).
597 * Return -1 if x is 0.
599 int cds_lfht_get_count_order_ulong(unsigned long x
)
604 return cds_lfht_fls_ulong(x
- 1);
608 void cds_lfht_resize_lazy_grow(struct cds_lfht
*ht
, unsigned long size
, int growth
);
611 void cds_lfht_resize_lazy_count(struct cds_lfht
*ht
, unsigned long size
,
612 unsigned long count
);
614 static void mutex_lock(pthread_mutex_t
*mutex
)
618 #ifndef DISTRUST_SIGNALS_EXTREME
619 ret
= pthread_mutex_lock(mutex
);
622 #else /* #ifndef DISTRUST_SIGNALS_EXTREME */
623 while ((ret
= pthread_mutex_trylock(mutex
)) != 0) {
624 if (ret
!= EBUSY
&& ret
!= EINTR
)
626 if (CMM_LOAD_SHARED(URCU_TLS(rcu_reader
).need_mb
)) {
628 _CMM_STORE_SHARED(URCU_TLS(rcu_reader
).need_mb
, 0);
631 (void) poll(NULL
, 0, 10);
633 #endif /* #else #ifndef DISTRUST_SIGNALS_EXTREME */
636 static void mutex_unlock(pthread_mutex_t
*mutex
)
640 ret
= pthread_mutex_unlock(mutex
);
645 static long nr_cpus_mask
= -1;
646 static long split_count_mask
= -1;
647 static int split_count_order
= -1;
649 static void ht_init_nr_cpus_mask(void)
653 maxcpus
= get_possible_cpus_array_len();
659 * round up number of CPUs to next power of two, so we
660 * can use & for modulo.
662 maxcpus
= 1UL << cds_lfht_get_count_order_ulong(maxcpus
);
663 nr_cpus_mask
= maxcpus
- 1;
667 void alloc_split_items_count(struct cds_lfht
*ht
)
669 if (nr_cpus_mask
== -1) {
670 ht_init_nr_cpus_mask();
671 if (nr_cpus_mask
< 0)
672 split_count_mask
= DEFAULT_SPLIT_COUNT_MASK
;
674 split_count_mask
= nr_cpus_mask
;
676 cds_lfht_get_count_order_ulong(split_count_mask
+ 1);
679 assert(split_count_mask
>= 0);
681 if (ht
->flags
& CDS_LFHT_ACCOUNTING
) {
682 ht
->split_count
= calloc(split_count_mask
+ 1,
683 sizeof(struct ht_items_count
));
684 assert(ht
->split_count
);
686 ht
->split_count
= NULL
;
691 void free_split_items_count(struct cds_lfht
*ht
)
693 poison_free(ht
->split_count
);
697 int ht_get_split_count_index(unsigned long hash
)
701 assert(split_count_mask
>= 0);
702 cpu
= urcu_sched_getcpu();
703 if (caa_unlikely(cpu
< 0))
704 return hash
& split_count_mask
;
706 return cpu
& split_count_mask
;
710 void ht_count_add(struct cds_lfht
*ht
, unsigned long size
, unsigned long hash
)
712 unsigned long split_count
, count
;
715 if (caa_unlikely(!ht
->split_count
))
717 index
= ht_get_split_count_index(hash
);
718 split_count
= uatomic_add_return(&ht
->split_count
[index
].add
, 1);
719 if (caa_likely(split_count
& ((1UL << COUNT_COMMIT_ORDER
) - 1)))
721 /* Only if number of add multiple of 1UL << COUNT_COMMIT_ORDER */
723 dbg_printf("add split count %lu\n", split_count
);
724 count
= uatomic_add_return(&ht
->count
,
725 1UL << COUNT_COMMIT_ORDER
);
726 if (caa_likely(count
& (count
- 1)))
728 /* Only if global count is power of 2 */
730 if ((count
>> CHAIN_LEN_RESIZE_THRESHOLD
) < size
)
732 dbg_printf("add set global %lu\n", count
);
733 cds_lfht_resize_lazy_count(ht
, size
,
734 count
>> (CHAIN_LEN_TARGET
- 1));
738 void ht_count_del(struct cds_lfht
*ht
, unsigned long size
, unsigned long hash
)
740 unsigned long split_count
, count
;
743 if (caa_unlikely(!ht
->split_count
))
745 index
= ht_get_split_count_index(hash
);
746 split_count
= uatomic_add_return(&ht
->split_count
[index
].del
, 1);
747 if (caa_likely(split_count
& ((1UL << COUNT_COMMIT_ORDER
) - 1)))
749 /* Only if number of deletes multiple of 1UL << COUNT_COMMIT_ORDER */
751 dbg_printf("del split count %lu\n", split_count
);
752 count
= uatomic_add_return(&ht
->count
,
753 -(1UL << COUNT_COMMIT_ORDER
));
754 if (caa_likely(count
& (count
- 1)))
756 /* Only if global count is power of 2 */
758 if ((count
>> CHAIN_LEN_RESIZE_THRESHOLD
) >= size
)
760 dbg_printf("del set global %lu\n", count
);
762 * Don't shrink table if the number of nodes is below a
765 if (count
< (1UL << COUNT_COMMIT_ORDER
) * (split_count_mask
+ 1))
767 cds_lfht_resize_lazy_count(ht
, size
,
768 count
>> (CHAIN_LEN_TARGET
- 1));
772 void check_resize(struct cds_lfht
*ht
, unsigned long size
, uint32_t chain_len
)
776 if (!(ht
->flags
& CDS_LFHT_AUTO_RESIZE
))
778 count
= uatomic_read(&ht
->count
);
780 * Use bucket-local length for small table expand and for
781 * environments lacking per-cpu data support.
783 if (count
>= (1UL << (COUNT_COMMIT_ORDER
+ split_count_order
)))
786 dbg_printf("WARNING: large chain length: %u.\n",
788 if (chain_len
>= CHAIN_LEN_RESIZE_THRESHOLD
) {
792 * Ideal growth calculated based on chain length.
794 growth
= cds_lfht_get_count_order_u32(chain_len
795 - (CHAIN_LEN_TARGET
- 1));
796 if ((ht
->flags
& CDS_LFHT_ACCOUNTING
)
798 >= (1UL << (COUNT_COMMIT_ORDER
799 + split_count_order
))) {
801 * If ideal growth expands the hash table size
802 * beyond the "small hash table" sizes, use the
803 * maximum small hash table size to attempt
804 * expanding the hash table. This only applies
805 * when node accounting is available, otherwise
806 * the chain length is used to expand the hash
807 * table in every case.
809 growth
= COUNT_COMMIT_ORDER
+ split_count_order
810 - cds_lfht_get_count_order_ulong(size
);
814 cds_lfht_resize_lazy_grow(ht
, size
, growth
);
819 struct cds_lfht_node
*clear_flag(struct cds_lfht_node
*node
)
821 return (struct cds_lfht_node
*) (((unsigned long) node
) & ~FLAGS_MASK
);
825 int is_removed(const struct cds_lfht_node
*node
)
827 return ((unsigned long) node
) & REMOVED_FLAG
;
831 int is_bucket(struct cds_lfht_node
*node
)
833 return ((unsigned long) node
) & BUCKET_FLAG
;
837 struct cds_lfht_node
*flag_bucket(struct cds_lfht_node
*node
)
839 return (struct cds_lfht_node
*) (((unsigned long) node
) | BUCKET_FLAG
);
843 int is_removal_owner(struct cds_lfht_node
*node
)
845 return ((unsigned long) node
) & REMOVAL_OWNER_FLAG
;
849 struct cds_lfht_node
*flag_removal_owner(struct cds_lfht_node
*node
)
851 return (struct cds_lfht_node
*) (((unsigned long) node
) | REMOVAL_OWNER_FLAG
);
855 struct cds_lfht_node
*flag_removed_or_removal_owner(struct cds_lfht_node
*node
)
857 return (struct cds_lfht_node
*) (((unsigned long) node
) | REMOVED_FLAG
| REMOVAL_OWNER_FLAG
);
861 struct cds_lfht_node
*get_end(void)
863 return (struct cds_lfht_node
*) END_VALUE
;
867 int is_end(struct cds_lfht_node
*node
)
869 return clear_flag(node
) == (struct cds_lfht_node
*) END_VALUE
;
873 unsigned long _uatomic_xchg_monotonic_increase(unsigned long *ptr
,
876 unsigned long old1
, old2
;
878 old1
= uatomic_read(ptr
);
883 } while ((old1
= uatomic_cmpxchg(ptr
, old2
, v
)) != old2
);
888 void cds_lfht_alloc_bucket_table(struct cds_lfht
*ht
, unsigned long order
)
890 return ht
->mm
->alloc_bucket_table(ht
, order
);
894 * cds_lfht_free_bucket_table() should be called with decreasing order.
895 * When cds_lfht_free_bucket_table(0) is called, it means the whole
899 void cds_lfht_free_bucket_table(struct cds_lfht
*ht
, unsigned long order
)
901 return ht
->mm
->free_bucket_table(ht
, order
);
905 struct cds_lfht_node
*bucket_at(struct cds_lfht
*ht
, unsigned long index
)
907 return ht
->bucket_at(ht
, index
);
911 struct cds_lfht_node
*lookup_bucket(struct cds_lfht
*ht
, unsigned long size
,
915 return bucket_at(ht
, hash
& (size
- 1));
919 * Remove all logically deleted nodes from a bucket up to a certain node key.
922 void _cds_lfht_gc_bucket(struct cds_lfht_node
*bucket
, struct cds_lfht_node
*node
)
924 struct cds_lfht_node
*iter_prev
, *iter
, *next
, *new_next
;
926 assert(!is_bucket(bucket
));
927 assert(!is_removed(bucket
));
928 assert(!is_removal_owner(bucket
));
929 assert(!is_bucket(node
));
930 assert(!is_removed(node
));
931 assert(!is_removal_owner(node
));
934 /* We can always skip the bucket node initially */
935 iter
= rcu_dereference(iter_prev
->next
);
936 assert(!is_removed(iter
));
937 assert(!is_removal_owner(iter
));
938 assert(iter_prev
->reverse_hash
<= node
->reverse_hash
);
940 * We should never be called with bucket (start of chain)
941 * and logically removed node (end of path compression
942 * marker) being the actual same node. This would be a
943 * bug in the algorithm implementation.
945 assert(bucket
!= node
);
947 if (caa_unlikely(is_end(iter
)))
949 if (caa_likely(clear_flag(iter
)->reverse_hash
> node
->reverse_hash
))
951 next
= rcu_dereference(clear_flag(iter
)->next
);
952 if (caa_likely(is_removed(next
)))
954 iter_prev
= clear_flag(iter
);
957 assert(!is_removed(iter
));
958 assert(!is_removal_owner(iter
));
960 new_next
= flag_bucket(clear_flag(next
));
962 new_next
= clear_flag(next
);
963 (void) uatomic_cmpxchg(&iter_prev
->next
, iter
, new_next
);
968 int _cds_lfht_replace(struct cds_lfht
*ht
, unsigned long size
,
969 struct cds_lfht_node
*old_node
,
970 struct cds_lfht_node
*old_next
,
971 struct cds_lfht_node
*new_node
)
973 struct cds_lfht_node
*bucket
, *ret_next
;
975 if (!old_node
) /* Return -ENOENT if asked to replace NULL node */
978 assert(!is_removed(old_node
));
979 assert(!is_removal_owner(old_node
));
980 assert(!is_bucket(old_node
));
981 assert(!is_removed(new_node
));
982 assert(!is_removal_owner(new_node
));
983 assert(!is_bucket(new_node
));
984 assert(new_node
!= old_node
);
986 /* Insert after node to be replaced */
987 if (is_removed(old_next
)) {
989 * Too late, the old node has been removed under us
990 * between lookup and replace. Fail.
994 assert(old_next
== clear_flag(old_next
));
995 assert(new_node
!= old_next
);
997 * REMOVAL_OWNER flag is _NEVER_ set before the REMOVED
998 * flag. It is either set atomically at the same time
999 * (replace) or after (del).
1001 assert(!is_removal_owner(old_next
));
1002 new_node
->next
= old_next
;
1004 * Here is the whole trick for lock-free replace: we add
1005 * the replacement node _after_ the node we want to
1006 * replace by atomically setting its next pointer at the
1007 * same time we set its removal flag. Given that
1008 * the lookups/get next use an iterator aware of the
1009 * next pointer, they will either skip the old node due
1010 * to the removal flag and see the new node, or use
1011 * the old node, but will not see the new one.
1012 * This is a replacement of a node with another node
1013 * that has the same value: we are therefore not
1014 * removing a value from the hash table. We set both the
1015 * REMOVED and REMOVAL_OWNER flags atomically so we own
1016 * the node after successful cmpxchg.
1018 ret_next
= uatomic_cmpxchg(&old_node
->next
,
1019 old_next
, flag_removed_or_removal_owner(new_node
));
1020 if (ret_next
== old_next
)
1021 break; /* We performed the replacement. */
1022 old_next
= ret_next
;
1026 * Ensure that the old node is not visible to readers anymore:
1027 * lookup for the node, and remove it (along with any other
1028 * logically removed node) if found.
1030 bucket
= lookup_bucket(ht
, size
, bit_reverse_ulong(old_node
->reverse_hash
));
1031 _cds_lfht_gc_bucket(bucket
, new_node
);
1033 assert(is_removed(CMM_LOAD_SHARED(old_node
->next
)));
1038 * A non-NULL unique_ret pointer uses the "add unique" (or uniquify) add
1039 * mode. A NULL unique_ret allows creation of duplicate keys.
1042 void _cds_lfht_add(struct cds_lfht
*ht
,
1044 cds_lfht_match_fct match
,
1047 struct cds_lfht_node
*node
,
1048 struct cds_lfht_iter
*unique_ret
,
1051 struct cds_lfht_node
*iter_prev
, *iter
, *next
, *new_node
, *new_next
,
1053 struct cds_lfht_node
*bucket
;
1055 assert(!is_bucket(node
));
1056 assert(!is_removed(node
));
1057 assert(!is_removal_owner(node
));
1058 bucket
= lookup_bucket(ht
, size
, hash
);
1060 uint32_t chain_len
= 0;
1063 * iter_prev points to the non-removed node prior to the
1067 /* We can always skip the bucket node initially */
1068 iter
= rcu_dereference(iter_prev
->next
);
1069 assert(iter_prev
->reverse_hash
<= node
->reverse_hash
);
1071 if (caa_unlikely(is_end(iter
)))
1073 if (caa_likely(clear_flag(iter
)->reverse_hash
> node
->reverse_hash
))
1076 /* bucket node is the first node of the identical-hash-value chain */
1077 if (bucket_flag
&& clear_flag(iter
)->reverse_hash
== node
->reverse_hash
)
1080 next
= rcu_dereference(clear_flag(iter
)->next
);
1081 if (caa_unlikely(is_removed(next
)))
1087 && clear_flag(iter
)->reverse_hash
== node
->reverse_hash
) {
1088 struct cds_lfht_iter d_iter
= {
1091 #ifdef CONFIG_CDS_LFHT_ITER_DEBUG
1097 * uniquely adding inserts the node as the first
1098 * node of the identical-hash-value node chain.
1100 * This semantic ensures no duplicated keys
1101 * should ever be observable in the table
1102 * (including traversing the table node by
1103 * node by forward iterations)
1105 cds_lfht_next_duplicate(ht
, match
, key
, &d_iter
);
1109 *unique_ret
= d_iter
;
1113 /* Only account for identical reverse hash once */
1114 if (iter_prev
->reverse_hash
!= clear_flag(iter
)->reverse_hash
1115 && !is_bucket(next
))
1116 check_resize(ht
, size
, ++chain_len
);
1117 iter_prev
= clear_flag(iter
);
1122 assert(node
!= clear_flag(iter
));
1123 assert(!is_removed(iter_prev
));
1124 assert(!is_removal_owner(iter_prev
));
1125 assert(!is_removed(iter
));
1126 assert(!is_removal_owner(iter
));
1127 assert(iter_prev
!= node
);
1129 node
->next
= clear_flag(iter
);
1131 node
->next
= flag_bucket(clear_flag(iter
));
1132 if (is_bucket(iter
))
1133 new_node
= flag_bucket(node
);
1136 if (uatomic_cmpxchg(&iter_prev
->next
, iter
,
1137 new_node
) != iter
) {
1138 continue; /* retry */
1145 assert(!is_removed(iter
));
1146 assert(!is_removal_owner(iter
));
1147 if (is_bucket(iter
))
1148 new_next
= flag_bucket(clear_flag(next
));
1150 new_next
= clear_flag(next
);
1151 (void) uatomic_cmpxchg(&iter_prev
->next
, iter
, new_next
);
1156 unique_ret
->node
= return_node
;
1157 /* unique_ret->next left unset, never used. */
1162 int _cds_lfht_del(struct cds_lfht
*ht
, unsigned long size
,
1163 struct cds_lfht_node
*node
)
1165 struct cds_lfht_node
*bucket
, *next
;
1167 if (!node
) /* Return -ENOENT if asked to delete NULL node */
1170 /* logically delete the node */
1171 assert(!is_bucket(node
));
1172 assert(!is_removed(node
));
1173 assert(!is_removal_owner(node
));
1176 * We are first checking if the node had previously been
1177 * logically removed (this check is not atomic with setting the
1178 * logical removal flag). Return -ENOENT if the node had
1179 * previously been removed.
1181 next
= CMM_LOAD_SHARED(node
->next
); /* next is not dereferenced */
1182 if (caa_unlikely(is_removed(next
)))
1184 assert(!is_bucket(next
));
1186 * The del operation semantic guarantees a full memory barrier
1187 * before the uatomic_or atomic commit of the deletion flag.
1189 cmm_smp_mb__before_uatomic_or();
1191 * We set the REMOVED_FLAG unconditionally. Note that there may
1192 * be more than one concurrent thread setting this flag.
1193 * Knowing which wins the race will be known after the garbage
1194 * collection phase, stay tuned!
1196 uatomic_or(&node
->next
, REMOVED_FLAG
);
1197 /* We performed the (logical) deletion. */
1200 * Ensure that the node is not visible to readers anymore: lookup for
1201 * the node, and remove it (along with any other logically removed node)
1204 bucket
= lookup_bucket(ht
, size
, bit_reverse_ulong(node
->reverse_hash
));
1205 _cds_lfht_gc_bucket(bucket
, node
);
1207 assert(is_removed(CMM_LOAD_SHARED(node
->next
)));
1209 * Last phase: atomically exchange node->next with a version
1210 * having "REMOVAL_OWNER_FLAG" set. If the returned node->next
1211 * pointer did _not_ have "REMOVAL_OWNER_FLAG" set, we now own
1212 * the node and win the removal race.
1213 * It is interesting to note that all "add" paths are forbidden
1214 * to change the next pointer starting from the point where the
1215 * REMOVED_FLAG is set, so here using a read, followed by a
1216 * xchg() suffice to guarantee that the xchg() will ever only
1217 * set the "REMOVAL_OWNER_FLAG" (or change nothing if the flag
1220 if (!is_removal_owner(uatomic_xchg(&node
->next
,
1221 flag_removal_owner(node
->next
))))
1228 void *partition_resize_thread(void *arg
)
1230 struct partition_resize_work
*work
= arg
;
1232 work
->ht
->flavor
->register_thread();
1233 work
->fct(work
->ht
, work
->i
, work
->start
, work
->len
);
1234 work
->ht
->flavor
->unregister_thread();
1239 void partition_resize_helper(struct cds_lfht
*ht
, unsigned long i
,
1241 void (*fct
)(struct cds_lfht
*ht
, unsigned long i
,
1242 unsigned long start
, unsigned long len
))
1244 unsigned long partition_len
, start
= 0;
1245 struct partition_resize_work
*work
;
1247 unsigned long thread
, nr_threads
;
1249 assert(nr_cpus_mask
!= -1);
1250 if (nr_cpus_mask
< 0 || len
< 2 * MIN_PARTITION_PER_THREAD
)
1254 * Note: nr_cpus_mask + 1 is always power of 2.
1255 * We spawn just the number of threads we need to satisfy the minimum
1256 * partition size, up to the number of CPUs in the system.
1258 if (nr_cpus_mask
> 0) {
1259 nr_threads
= min_t(unsigned long, nr_cpus_mask
+ 1,
1260 len
>> MIN_PARTITION_PER_THREAD_ORDER
);
1264 partition_len
= len
>> cds_lfht_get_count_order_ulong(nr_threads
);
1265 work
= calloc(nr_threads
, sizeof(*work
));
1267 dbg_printf("error allocating for resize, single-threading\n");
1270 for (thread
= 0; thread
< nr_threads
; thread
++) {
1271 work
[thread
].ht
= ht
;
1273 work
[thread
].len
= partition_len
;
1274 work
[thread
].start
= thread
* partition_len
;
1275 work
[thread
].fct
= fct
;
1276 ret
= pthread_create(&(work
[thread
].thread_id
), ht
->resize_attr
,
1277 partition_resize_thread
, &work
[thread
]);
1278 if (ret
== EAGAIN
) {
1280 * Out of resources: wait and join the threads
1281 * we've created, then handle leftovers.
1283 dbg_printf("error spawning for resize, single-threading\n");
1284 start
= work
[thread
].start
;
1286 nr_threads
= thread
;
1291 for (thread
= 0; thread
< nr_threads
; thread
++) {
1292 ret
= pthread_join(work
[thread
].thread_id
, NULL
);
1298 * A pthread_create failure above will either lead in us having
1299 * no threads to join or starting at a non-zero offset,
1300 * fallback to single thread processing of leftovers.
1302 if (start
== 0 && nr_threads
> 0)
1305 fct(ht
, i
, start
, len
);
1309 * Holding RCU read lock to protect _cds_lfht_add against memory
1310 * reclaim that could be performed by other worker threads (ABA
1313 * When we reach a certain length, we can split this population phase over
1314 * many worker threads, based on the number of CPUs available in the system.
1315 * This should therefore take care of not having the expand lagging behind too
1316 * many concurrent insertion threads by using the scheduler's ability to
1317 * schedule bucket node population fairly with insertions.
1320 void init_table_populate_partition(struct cds_lfht
*ht
, unsigned long i
,
1321 unsigned long start
, unsigned long len
)
1323 unsigned long j
, size
= 1UL << (i
- 1);
1325 assert(i
> MIN_TABLE_ORDER
);
1326 ht
->flavor
->read_lock();
1327 for (j
= size
+ start
; j
< size
+ start
+ len
; j
++) {
1328 struct cds_lfht_node
*new_node
= bucket_at(ht
, j
);
1330 assert(j
>= size
&& j
< (size
<< 1));
1331 dbg_printf("init populate: order %lu index %lu hash %lu\n",
1333 new_node
->reverse_hash
= bit_reverse_ulong(j
);
1334 _cds_lfht_add(ht
, j
, NULL
, NULL
, size
, new_node
, NULL
, 1);
1336 ht
->flavor
->read_unlock();
1340 void init_table_populate(struct cds_lfht
*ht
, unsigned long i
,
1343 partition_resize_helper(ht
, i
, len
, init_table_populate_partition
);
1347 void init_table(struct cds_lfht
*ht
,
1348 unsigned long first_order
, unsigned long last_order
)
1352 dbg_printf("init table: first_order %lu last_order %lu\n",
1353 first_order
, last_order
);
1354 assert(first_order
> MIN_TABLE_ORDER
);
1355 for (i
= first_order
; i
<= last_order
; i
++) {
1358 len
= 1UL << (i
- 1);
1359 dbg_printf("init order %lu len: %lu\n", i
, len
);
1361 /* Stop expand if the resize target changes under us */
1362 if (CMM_LOAD_SHARED(ht
->resize_target
) < (1UL << i
))
1365 cds_lfht_alloc_bucket_table(ht
, i
);
1368 * Set all bucket nodes reverse hash values for a level and
1369 * link all bucket nodes into the table.
1371 init_table_populate(ht
, i
, len
);
1374 * Update table size.
1376 cmm_smp_wmb(); /* populate data before RCU size */
1377 CMM_STORE_SHARED(ht
->size
, 1UL << i
);
1379 dbg_printf("init new size: %lu\n", 1UL << i
);
1380 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1386 * Holding RCU read lock to protect _cds_lfht_remove against memory
1387 * reclaim that could be performed by other worker threads (ABA
1389 * For a single level, we logically remove and garbage collect each node.
1391 * As a design choice, we perform logical removal and garbage collection on a
1392 * node-per-node basis to simplify this algorithm. We also assume keeping good
1393 * cache locality of the operation would overweight possible performance gain
1394 * that could be achieved by batching garbage collection for multiple levels.
1395 * However, this would have to be justified by benchmarks.
1397 * Concurrent removal and add operations are helping us perform garbage
1398 * collection of logically removed nodes. We guarantee that all logically
1399 * removed nodes have been garbage-collected (unlinked) before work
1400 * enqueue is invoked to free a hole level of bucket nodes (after a
1403 * Logical removal and garbage collection can therefore be done in batch
1404 * or on a node-per-node basis, as long as the guarantee above holds.
1406 * When we reach a certain length, we can split this removal over many worker
1407 * threads, based on the number of CPUs available in the system. This should
1408 * take care of not letting resize process lag behind too many concurrent
1409 * updater threads actively inserting into the hash table.
1412 void remove_table_partition(struct cds_lfht
*ht
, unsigned long i
,
1413 unsigned long start
, unsigned long len
)
1415 unsigned long j
, size
= 1UL << (i
- 1);
1417 assert(i
> MIN_TABLE_ORDER
);
1418 ht
->flavor
->read_lock();
1419 for (j
= size
+ start
; j
< size
+ start
+ len
; j
++) {
1420 struct cds_lfht_node
*fini_bucket
= bucket_at(ht
, j
);
1421 struct cds_lfht_node
*parent_bucket
= bucket_at(ht
, j
- size
);
1423 assert(j
>= size
&& j
< (size
<< 1));
1424 dbg_printf("remove entry: order %lu index %lu hash %lu\n",
1426 /* Set the REMOVED_FLAG to freeze the ->next for gc */
1427 uatomic_or(&fini_bucket
->next
, REMOVED_FLAG
);
1428 _cds_lfht_gc_bucket(parent_bucket
, fini_bucket
);
1430 ht
->flavor
->read_unlock();
1434 void remove_table(struct cds_lfht
*ht
, unsigned long i
, unsigned long len
)
1436 partition_resize_helper(ht
, i
, len
, remove_table_partition
);
1440 * fini_table() is never called for first_order == 0, which is why
1441 * free_by_rcu_order == 0 can be used as criterion to know if free must
1445 void fini_table(struct cds_lfht
*ht
,
1446 unsigned long first_order
, unsigned long last_order
)
1448 unsigned long free_by_rcu_order
= 0, i
;
1450 dbg_printf("fini table: first_order %lu last_order %lu\n",
1451 first_order
, last_order
);
1452 assert(first_order
> MIN_TABLE_ORDER
);
1453 for (i
= last_order
; i
>= first_order
; i
--) {
1456 len
= 1UL << (i
- 1);
1457 dbg_printf("fini order %ld len: %lu\n", i
, len
);
1459 /* Stop shrink if the resize target changes under us */
1460 if (CMM_LOAD_SHARED(ht
->resize_target
) > (1UL << (i
- 1)))
1463 cmm_smp_wmb(); /* populate data before RCU size */
1464 CMM_STORE_SHARED(ht
->size
, 1UL << (i
- 1));
1467 * We need to wait for all add operations to reach Q.S. (and
1468 * thus use the new table for lookups) before we can start
1469 * releasing the old bucket nodes. Otherwise their lookup will
1470 * return a logically removed node as insert position.
1472 ht
->flavor
->update_synchronize_rcu();
1473 if (free_by_rcu_order
)
1474 cds_lfht_free_bucket_table(ht
, free_by_rcu_order
);
1477 * Set "removed" flag in bucket nodes about to be removed.
1478 * Unlink all now-logically-removed bucket node pointers.
1479 * Concurrent add/remove operation are helping us doing
1482 remove_table(ht
, i
, len
);
1484 free_by_rcu_order
= i
;
1486 dbg_printf("fini new size: %lu\n", 1UL << i
);
1487 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1491 if (free_by_rcu_order
) {
1492 ht
->flavor
->update_synchronize_rcu();
1493 cds_lfht_free_bucket_table(ht
, free_by_rcu_order
);
1498 * Never called with size < 1.
1501 void cds_lfht_create_bucket(struct cds_lfht
*ht
, unsigned long size
)
1503 struct cds_lfht_node
*prev
, *node
;
1504 unsigned long order
, len
, i
;
1507 cds_lfht_alloc_bucket_table(ht
, 0);
1509 dbg_printf("create bucket: order 0 index 0 hash 0\n");
1510 node
= bucket_at(ht
, 0);
1511 node
->next
= flag_bucket(get_end());
1512 node
->reverse_hash
= 0;
1514 bucket_order
= cds_lfht_get_count_order_ulong(size
);
1515 assert(bucket_order
>= 0);
1517 for (order
= 1; order
< (unsigned long) bucket_order
+ 1; order
++) {
1518 len
= 1UL << (order
- 1);
1519 cds_lfht_alloc_bucket_table(ht
, order
);
1521 for (i
= 0; i
< len
; i
++) {
1523 * Now, we are trying to init the node with the
1524 * hash=(len+i) (which is also a bucket with the
1525 * index=(len+i)) and insert it into the hash table,
1526 * so this node has to be inserted after the bucket
1527 * with the index=(len+i)&(len-1)=i. And because there
1528 * is no other non-bucket node nor bucket node with
1529 * larger index/hash inserted, so the bucket node
1530 * being inserted should be inserted directly linked
1531 * after the bucket node with index=i.
1533 prev
= bucket_at(ht
, i
);
1534 node
= bucket_at(ht
, len
+ i
);
1536 dbg_printf("create bucket: order %lu index %lu hash %lu\n",
1537 order
, len
+ i
, len
+ i
);
1538 node
->reverse_hash
= bit_reverse_ulong(len
+ i
);
1540 /* insert after prev */
1541 assert(is_bucket(prev
->next
));
1542 node
->next
= prev
->next
;
1543 prev
->next
= flag_bucket(node
);
1548 #if (CAA_BITS_PER_LONG > 32)
1550 * For 64-bit architectures, with max number of buckets small enough not to
1551 * use the entire 64-bit memory mapping space (and allowing a fair number of
1552 * hash table instances), use the mmap allocator, which is faster. Otherwise,
1553 * fallback to the order allocator.
1556 const struct cds_lfht_mm_type
*get_mm_type(unsigned long max_nr_buckets
)
1558 if (max_nr_buckets
&& max_nr_buckets
<= (1ULL << 32))
1559 return &cds_lfht_mm_mmap
;
1561 return &cds_lfht_mm_order
;
1565 * For 32-bit architectures, use the order allocator.
1568 const struct cds_lfht_mm_type
*get_mm_type(
1569 unsigned long max_nr_buckets
__attribute__((unused
)))
1571 return &cds_lfht_mm_order
;
1575 struct cds_lfht
*_cds_lfht_new(unsigned long init_size
,
1576 unsigned long min_nr_alloc_buckets
,
1577 unsigned long max_nr_buckets
,
1579 const struct cds_lfht_mm_type
*mm
,
1580 const struct rcu_flavor_struct
*flavor
,
1581 pthread_attr_t
*attr
)
1583 struct cds_lfht
*ht
;
1584 unsigned long order
;
1586 /* min_nr_alloc_buckets must be power of two */
1587 if (!min_nr_alloc_buckets
|| (min_nr_alloc_buckets
& (min_nr_alloc_buckets
- 1)))
1590 /* init_size must be power of two */
1591 if (!init_size
|| (init_size
& (init_size
- 1)))
1595 * Memory management plugin default.
1598 mm
= get_mm_type(max_nr_buckets
);
1600 /* max_nr_buckets == 0 for order based mm means infinite */
1601 if (mm
== &cds_lfht_mm_order
&& !max_nr_buckets
)
1602 max_nr_buckets
= 1UL << (MAX_TABLE_ORDER
- 1);
1604 /* max_nr_buckets must be power of two */
1605 if (!max_nr_buckets
|| (max_nr_buckets
& (max_nr_buckets
- 1)))
1608 if (flags
& CDS_LFHT_AUTO_RESIZE
)
1609 cds_lfht_init_worker(flavor
);
1611 min_nr_alloc_buckets
= max(min_nr_alloc_buckets
, MIN_TABLE_SIZE
);
1612 init_size
= max(init_size
, MIN_TABLE_SIZE
);
1613 max_nr_buckets
= max(max_nr_buckets
, min_nr_alloc_buckets
);
1614 init_size
= min(init_size
, max_nr_buckets
);
1616 ht
= mm
->alloc_cds_lfht(min_nr_alloc_buckets
, max_nr_buckets
);
1618 assert(ht
->mm
== mm
);
1619 assert(ht
->bucket_at
== mm
->bucket_at
);
1622 ht
->flavor
= flavor
;
1623 ht
->resize_attr
= attr
;
1624 alloc_split_items_count(ht
);
1625 /* this mutex should not nest in read-side C.S. */
1626 pthread_mutex_init(&ht
->resize_mutex
, NULL
);
1627 order
= cds_lfht_get_count_order_ulong(init_size
);
1628 ht
->resize_target
= 1UL << order
;
1629 cds_lfht_create_bucket(ht
, 1UL << order
);
1630 ht
->size
= 1UL << order
;
1634 void cds_lfht_lookup(struct cds_lfht
*ht
, unsigned long hash
,
1635 cds_lfht_match_fct match
, const void *key
,
1636 struct cds_lfht_iter
*iter
)
1638 struct cds_lfht_node
*node
, *next
, *bucket
;
1639 unsigned long reverse_hash
, size
;
1641 cds_lfht_iter_debug_set_ht(ht
, iter
);
1643 reverse_hash
= bit_reverse_ulong(hash
);
1645 size
= rcu_dereference(ht
->size
);
1646 bucket
= lookup_bucket(ht
, size
, hash
);
1647 /* We can always skip the bucket node initially */
1648 node
= rcu_dereference(bucket
->next
);
1649 node
= clear_flag(node
);
1651 if (caa_unlikely(is_end(node
))) {
1655 if (caa_unlikely(node
->reverse_hash
> reverse_hash
)) {
1659 next
= rcu_dereference(node
->next
);
1660 assert(node
== clear_flag(node
));
1661 if (caa_likely(!is_removed(next
))
1663 && node
->reverse_hash
== reverse_hash
1664 && caa_likely(match(node
, key
))) {
1667 node
= clear_flag(next
);
1669 assert(!node
|| !is_bucket(CMM_LOAD_SHARED(node
->next
)));
1674 void cds_lfht_next_duplicate(struct cds_lfht
*ht
__attribute__((unused
)),
1675 cds_lfht_match_fct match
,
1676 const void *key
, struct cds_lfht_iter
*iter
)
1678 struct cds_lfht_node
*node
, *next
;
1679 unsigned long reverse_hash
;
1681 cds_lfht_iter_debug_assert(ht
== iter
->lfht
);
1683 reverse_hash
= node
->reverse_hash
;
1685 node
= clear_flag(next
);
1688 if (caa_unlikely(is_end(node
))) {
1692 if (caa_unlikely(node
->reverse_hash
> reverse_hash
)) {
1696 next
= rcu_dereference(node
->next
);
1697 if (caa_likely(!is_removed(next
))
1699 && caa_likely(match(node
, key
))) {
1702 node
= clear_flag(next
);
1704 assert(!node
|| !is_bucket(CMM_LOAD_SHARED(node
->next
)));
1709 void cds_lfht_next(struct cds_lfht
*ht
__attribute__((unused
)),
1710 struct cds_lfht_iter
*iter
)
1712 struct cds_lfht_node
*node
, *next
;
1714 cds_lfht_iter_debug_assert(ht
== iter
->lfht
);
1715 node
= clear_flag(iter
->next
);
1717 if (caa_unlikely(is_end(node
))) {
1721 next
= rcu_dereference(node
->next
);
1722 if (caa_likely(!is_removed(next
))
1723 && !is_bucket(next
)) {
1726 node
= clear_flag(next
);
1728 assert(!node
|| !is_bucket(CMM_LOAD_SHARED(node
->next
)));
1733 void cds_lfht_first(struct cds_lfht
*ht
, struct cds_lfht_iter
*iter
)
1735 cds_lfht_iter_debug_set_ht(ht
, iter
);
1737 * Get next after first bucket node. The first bucket node is the
1738 * first node of the linked list.
1740 iter
->next
= bucket_at(ht
, 0)->next
;
1741 cds_lfht_next(ht
, iter
);
1744 void cds_lfht_add(struct cds_lfht
*ht
, unsigned long hash
,
1745 struct cds_lfht_node
*node
)
1749 node
->reverse_hash
= bit_reverse_ulong(hash
);
1750 size
= rcu_dereference(ht
->size
);
1751 _cds_lfht_add(ht
, hash
, NULL
, NULL
, size
, node
, NULL
, 0);
1752 ht_count_add(ht
, size
, hash
);
1755 struct cds_lfht_node
*cds_lfht_add_unique(struct cds_lfht
*ht
,
1757 cds_lfht_match_fct match
,
1759 struct cds_lfht_node
*node
)
1762 struct cds_lfht_iter iter
;
1764 node
->reverse_hash
= bit_reverse_ulong(hash
);
1765 size
= rcu_dereference(ht
->size
);
1766 _cds_lfht_add(ht
, hash
, match
, key
, size
, node
, &iter
, 0);
1767 if (iter
.node
== node
)
1768 ht_count_add(ht
, size
, hash
);
1772 struct cds_lfht_node
*cds_lfht_add_replace(struct cds_lfht
*ht
,
1774 cds_lfht_match_fct match
,
1776 struct cds_lfht_node
*node
)
1779 struct cds_lfht_iter iter
;
1781 node
->reverse_hash
= bit_reverse_ulong(hash
);
1782 size
= rcu_dereference(ht
->size
);
1784 _cds_lfht_add(ht
, hash
, match
, key
, size
, node
, &iter
, 0);
1785 if (iter
.node
== node
) {
1786 ht_count_add(ht
, size
, hash
);
1790 if (!_cds_lfht_replace(ht
, size
, iter
.node
, iter
.next
, node
))
1795 int cds_lfht_replace(struct cds_lfht
*ht
,
1796 struct cds_lfht_iter
*old_iter
,
1798 cds_lfht_match_fct match
,
1800 struct cds_lfht_node
*new_node
)
1804 new_node
->reverse_hash
= bit_reverse_ulong(hash
);
1805 if (!old_iter
->node
)
1807 if (caa_unlikely(old_iter
->node
->reverse_hash
!= new_node
->reverse_hash
))
1809 if (caa_unlikely(!match(old_iter
->node
, key
)))
1811 size
= rcu_dereference(ht
->size
);
1812 return _cds_lfht_replace(ht
, size
, old_iter
->node
, old_iter
->next
,
1816 int cds_lfht_del(struct cds_lfht
*ht
, struct cds_lfht_node
*node
)
1821 size
= rcu_dereference(ht
->size
);
1822 ret
= _cds_lfht_del(ht
, size
, node
);
1826 hash
= bit_reverse_ulong(node
->reverse_hash
);
1827 ht_count_del(ht
, size
, hash
);
1832 int cds_lfht_is_node_deleted(const struct cds_lfht_node
*node
)
1834 return is_removed(CMM_LOAD_SHARED(node
->next
));
1838 int cds_lfht_delete_bucket(struct cds_lfht
*ht
)
1840 struct cds_lfht_node
*node
;
1841 unsigned long order
, i
, size
;
1843 /* Check that the table is empty */
1844 node
= bucket_at(ht
, 0);
1846 node
= clear_flag(node
)->next
;
1847 if (!is_bucket(node
))
1849 assert(!is_removed(node
));
1850 assert(!is_removal_owner(node
));
1851 } while (!is_end(node
));
1853 * size accessed without rcu_dereference because hash table is
1857 /* Internal sanity check: all nodes left should be buckets */
1858 for (i
= 0; i
< size
; i
++) {
1859 node
= bucket_at(ht
, i
);
1860 dbg_printf("delete bucket: index %lu expected hash %lu hash %lu\n",
1861 i
, i
, bit_reverse_ulong(node
->reverse_hash
));
1862 assert(is_bucket(node
->next
));
1865 for (order
= cds_lfht_get_count_order_ulong(size
); (long)order
>= 0; order
--)
1866 cds_lfht_free_bucket_table(ht
, order
);
1872 * Should only be called when no more concurrent readers nor writers can
1873 * possibly access the table.
1875 int cds_lfht_destroy(struct cds_lfht
*ht
, pthread_attr_t
**attr
)
1879 if (ht
->flags
& CDS_LFHT_AUTO_RESIZE
) {
1880 /* Cancel ongoing resize operations. */
1881 _CMM_STORE_SHARED(ht
->in_progress_destroy
, 1);
1882 /* Wait for in-flight resize operations to complete */
1883 urcu_workqueue_flush_queued_work(cds_lfht_workqueue
);
1885 ret
= cds_lfht_delete_bucket(ht
);
1888 free_split_items_count(ht
);
1890 *attr
= ht
->resize_attr
;
1891 ret
= pthread_mutex_destroy(&ht
->resize_mutex
);
1894 if (ht
->flags
& CDS_LFHT_AUTO_RESIZE
)
1895 cds_lfht_fini_worker(ht
->flavor
);
1900 void cds_lfht_count_nodes(struct cds_lfht
*ht
,
1901 long *approx_before
,
1902 unsigned long *count
,
1905 struct cds_lfht_node
*node
, *next
;
1906 unsigned long nr_bucket
= 0, nr_removed
= 0;
1909 if (ht
->split_count
) {
1912 for (i
= 0; i
< split_count_mask
+ 1; i
++) {
1913 *approx_before
+= uatomic_read(&ht
->split_count
[i
].add
);
1914 *approx_before
-= uatomic_read(&ht
->split_count
[i
].del
);
1920 /* Count non-bucket nodes in the table */
1921 node
= bucket_at(ht
, 0);
1923 next
= rcu_dereference(node
->next
);
1924 if (is_removed(next
)) {
1925 if (!is_bucket(next
))
1929 } else if (!is_bucket(next
))
1933 node
= clear_flag(next
);
1934 } while (!is_end(node
));
1935 dbg_printf("number of logically removed nodes: %lu\n", nr_removed
);
1936 dbg_printf("number of bucket nodes: %lu\n", nr_bucket
);
1938 if (ht
->split_count
) {
1941 for (i
= 0; i
< split_count_mask
+ 1; i
++) {
1942 *approx_after
+= uatomic_read(&ht
->split_count
[i
].add
);
1943 *approx_after
-= uatomic_read(&ht
->split_count
[i
].del
);
1948 /* called with resize mutex held */
1950 void _do_cds_lfht_grow(struct cds_lfht
*ht
,
1951 unsigned long old_size
, unsigned long new_size
)
1953 unsigned long old_order
, new_order
;
1955 old_order
= cds_lfht_get_count_order_ulong(old_size
);
1956 new_order
= cds_lfht_get_count_order_ulong(new_size
);
1957 dbg_printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n",
1958 old_size
, old_order
, new_size
, new_order
);
1959 assert(new_size
> old_size
);
1960 init_table(ht
, old_order
+ 1, new_order
);
1963 /* called with resize mutex held */
1965 void _do_cds_lfht_shrink(struct cds_lfht
*ht
,
1966 unsigned long old_size
, unsigned long new_size
)
1968 unsigned long old_order
, new_order
;
1970 new_size
= max(new_size
, MIN_TABLE_SIZE
);
1971 old_order
= cds_lfht_get_count_order_ulong(old_size
);
1972 new_order
= cds_lfht_get_count_order_ulong(new_size
);
1973 dbg_printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n",
1974 old_size
, old_order
, new_size
, new_order
);
1975 assert(new_size
< old_size
);
1977 /* Remove and unlink all bucket nodes to remove. */
1978 fini_table(ht
, new_order
+ 1, old_order
);
1982 /* called with resize mutex held */
1984 void _do_cds_lfht_resize(struct cds_lfht
*ht
)
1986 unsigned long new_size
, old_size
;
1989 * Resize table, re-do if the target size has changed under us.
1992 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1994 ht
->resize_initiated
= 1;
1995 old_size
= ht
->size
;
1996 new_size
= CMM_LOAD_SHARED(ht
->resize_target
);
1997 if (old_size
< new_size
)
1998 _do_cds_lfht_grow(ht
, old_size
, new_size
);
1999 else if (old_size
> new_size
)
2000 _do_cds_lfht_shrink(ht
, old_size
, new_size
);
2001 ht
->resize_initiated
= 0;
2002 /* write resize_initiated before read resize_target */
2004 } while (ht
->size
!= CMM_LOAD_SHARED(ht
->resize_target
));
2008 unsigned long resize_target_grow(struct cds_lfht
*ht
, unsigned long new_size
)
2010 return _uatomic_xchg_monotonic_increase(&ht
->resize_target
, new_size
);
2014 void resize_target_update_count(struct cds_lfht
*ht
,
2015 unsigned long count
)
2017 count
= max(count
, MIN_TABLE_SIZE
);
2018 count
= min(count
, ht
->max_nr_buckets
);
2019 uatomic_set(&ht
->resize_target
, count
);
2022 void cds_lfht_resize(struct cds_lfht
*ht
, unsigned long new_size
)
2024 resize_target_update_count(ht
, new_size
);
2025 CMM_STORE_SHARED(ht
->resize_initiated
, 1);
2026 mutex_lock(&ht
->resize_mutex
);
2027 _do_cds_lfht_resize(ht
);
2028 mutex_unlock(&ht
->resize_mutex
);
2032 void do_resize_cb(struct urcu_work
*work
)
2034 struct resize_work
*resize_work
=
2035 caa_container_of(work
, struct resize_work
, work
);
2036 struct cds_lfht
*ht
= resize_work
->ht
;
2038 ht
->flavor
->register_thread();
2039 mutex_lock(&ht
->resize_mutex
);
2040 _do_cds_lfht_resize(ht
);
2041 mutex_unlock(&ht
->resize_mutex
);
2042 ht
->flavor
->unregister_thread();
2047 void __cds_lfht_resize_lazy_launch(struct cds_lfht
*ht
)
2049 struct resize_work
*work
;
2051 /* Store resize_target before read resize_initiated */
2053 if (!CMM_LOAD_SHARED(ht
->resize_initiated
)) {
2054 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
)) {
2057 work
= malloc(sizeof(*work
));
2059 dbg_printf("error allocating resize work, bailing out\n");
2063 urcu_workqueue_queue_work(cds_lfht_workqueue
,
2064 &work
->work
, do_resize_cb
);
2065 CMM_STORE_SHARED(ht
->resize_initiated
, 1);
2070 void cds_lfht_resize_lazy_grow(struct cds_lfht
*ht
, unsigned long size
, int growth
)
2072 unsigned long target_size
= size
<< growth
;
2074 target_size
= min(target_size
, ht
->max_nr_buckets
);
2075 if (resize_target_grow(ht
, target_size
) >= target_size
)
2078 __cds_lfht_resize_lazy_launch(ht
);
2082 * We favor grow operations over shrink. A shrink operation never occurs
2083 * if a grow operation is queued for lazy execution. A grow operation
2084 * cancels any pending shrink lazy execution.
2087 void cds_lfht_resize_lazy_count(struct cds_lfht
*ht
, unsigned long size
,
2088 unsigned long count
)
2090 if (!(ht
->flags
& CDS_LFHT_AUTO_RESIZE
))
2092 count
= max(count
, MIN_TABLE_SIZE
);
2093 count
= min(count
, ht
->max_nr_buckets
);
2095 return; /* Already the right size, no resize needed */
2096 if (count
> size
) { /* lazy grow */
2097 if (resize_target_grow(ht
, count
) >= count
)
2099 } else { /* lazy shrink */
2103 s
= uatomic_cmpxchg(&ht
->resize_target
, size
, count
);
2105 break; /* no resize needed */
2107 return; /* growing is/(was just) in progress */
2109 return; /* some other thread do shrink */
2113 __cds_lfht_resize_lazy_launch(ht
);
2116 static void cds_lfht_before_fork(void *priv
__attribute__((unused
)))
2118 if (cds_lfht_workqueue_atfork_nesting
++)
2120 mutex_lock(&cds_lfht_fork_mutex
);
2121 if (!cds_lfht_workqueue
)
2123 urcu_workqueue_pause_worker(cds_lfht_workqueue
);
2126 static void cds_lfht_after_fork_parent(void *priv
__attribute__((unused
)))
2128 if (--cds_lfht_workqueue_atfork_nesting
)
2130 if (!cds_lfht_workqueue
)
2132 urcu_workqueue_resume_worker(cds_lfht_workqueue
);
2134 mutex_unlock(&cds_lfht_fork_mutex
);
2137 static void cds_lfht_after_fork_child(void *priv
__attribute__((unused
)))
2139 if (--cds_lfht_workqueue_atfork_nesting
)
2141 if (!cds_lfht_workqueue
)
2143 urcu_workqueue_create_worker(cds_lfht_workqueue
);
2145 mutex_unlock(&cds_lfht_fork_mutex
);
2148 static struct urcu_atfork cds_lfht_atfork
= {
2149 .before_fork
= cds_lfht_before_fork
,
2150 .after_fork_parent
= cds_lfht_after_fork_parent
,
2151 .after_fork_child
= cds_lfht_after_fork_child
,
2155 * Block all signals for the workqueue worker thread to ensure we don't
2156 * disturb the application. The SIGRCU signal needs to be unblocked for
2157 * the urcu-signal flavor.
2159 static void cds_lfht_worker_init(
2160 struct urcu_workqueue
*workqueue
__attribute__((unused
)),
2161 void *priv
__attribute__((unused
)))
2166 ret
= sigfillset(&mask
);
2169 ret
= sigdelset(&mask
, SIGRCU
);
2172 ret
= pthread_sigmask(SIG_SETMASK
, &mask
, NULL
);
2177 static void cds_lfht_init_worker(const struct rcu_flavor_struct
*flavor
)
2179 flavor
->register_rculfhash_atfork(&cds_lfht_atfork
);
2181 mutex_lock(&cds_lfht_fork_mutex
);
2182 if (cds_lfht_workqueue_user_count
++)
2184 cds_lfht_workqueue
= urcu_workqueue_create(0, -1, NULL
,
2185 NULL
, cds_lfht_worker_init
, NULL
, NULL
, NULL
, NULL
, NULL
);
2187 mutex_unlock(&cds_lfht_fork_mutex
);
2190 static void cds_lfht_fini_worker(const struct rcu_flavor_struct
*flavor
)
2192 mutex_lock(&cds_lfht_fork_mutex
);
2193 if (--cds_lfht_workqueue_user_count
)
2195 urcu_workqueue_destroy(cds_lfht_workqueue
);
2196 cds_lfht_workqueue
= NULL
;
2198 mutex_unlock(&cds_lfht_fork_mutex
);
2200 flavor
->unregister_rculfhash_atfork(&cds_lfht_atfork
);