4 * Userspace RCU library - Lock-Free Resizable RCU Hash Table
6 * Copyright 2010-2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with this library; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
24 * Based on the following articles:
25 * - Ori Shalev and Nir Shavit. Split-ordered lists: Lock-free
26 * extensible hash tables. J. ACM 53, 3 (May 2006), 379-405.
27 * - Michael, M. M. High performance dynamic lock-free hash tables
28 * and list-based sets. In Proceedings of the fourteenth annual ACM
29 * symposium on Parallel algorithms and architectures, ACM Press,
32 * Some specificities of this Lock-Free Resizable RCU Hash Table
35 * - RCU read-side critical section allows readers to perform hash
36 * table lookups and use the returned objects safely by delaying
37 * memory reclaim of a grace period.
38 * - Add and remove operations are lock-free, and do not need to
39 * allocate memory. They need to be executed within RCU read-side
40 * critical section to ensure the objects they read are valid and to
41 * deal with the cmpxchg ABA problem.
42 * - add and add_unique operations are supported. add_unique checks if
43 * the node key already exists in the hash table. It ensures no key
45 * - The resize operation executes concurrently with add/remove/lookup.
46 * - Hash table nodes are contained within a split-ordered list. This
47 * list is ordered by incrementing reversed-bits-hash value.
48 * - An index of dummy nodes is kept. These dummy nodes are the hash
49 * table "buckets", and they are also chained together in the
50 * split-ordered list, which allows recursive expansion.
51 * - The resize operation for small tables only allows expanding the hash table.
52 * It is triggered automatically by detecting long chains in the add
54 * - The resize operation for larger tables (and available through an
55 * API) allows both expanding and shrinking the hash table.
56 * - Per-CPU Split-counters are used to keep track of the number of
57 * nodes within the hash table for automatic resize triggering.
58 * - Resize operation initiated by long chain detection is executed by a
59 * call_rcu thread, which keeps lock-freedom of add and remove.
60 * - Resize operations are protected by a mutex.
61 * - The removal operation is split in two parts: first, a "removed"
62 * flag is set in the next pointer within the node to remove. Then,
63 * a "garbage collection" is performed in the bucket containing the
64 * removed node (from the start of the bucket up to the removed node).
65 * All encountered nodes with "removed" flag set in their next
66 * pointers are removed from the linked-list. If the cmpxchg used for
67 * removal fails (due to concurrent garbage-collection or concurrent
68 * add), we retry from the beginning of the bucket. This ensures that
69 * the node with "removed" flag set is removed from the hash table
70 * (not visible to lookups anymore) before the RCU read-side critical
71 * section held across removal ends. Furthermore, this ensures that
72 * the node with "removed" flag set is removed from the linked-list
73 * before its memory is reclaimed. Only the thread which removal
74 * successfully set the "removed" flag (with a cmpxchg) into a node's
75 * next pointer is considered to have succeeded its removal (and thus
76 * owns the node to reclaim). Because we garbage-collect starting from
77 * an invariant node (the start-of-bucket dummy node) up to the
78 * "removed" node (or find a reverse-hash that is higher), we are sure
79 * that a successful traversal of the chain leads to a chain that is
80 * present in the linked-list (the start node is never removed) and
81 * that is does not contain the "removed" node anymore, even if
82 * concurrent delete/add operations are changing the structure of the
84 * - The add operation performs gargage collection of buckets if it
85 * encounters nodes with removed flag set in the bucket where it wants
86 * to add its new node. This ensures lock-freedom of add operation by
87 * helping the remover unlink nodes from the list rather than to wait
89 * - A RCU "order table" indexed by log2(hash index) is copied and
90 * expanded by the resize operation. This order table allows finding
91 * the "dummy node" tables.
92 * - There is one dummy node table per hash index order. The size of
93 * each dummy node table is half the number of hashes contained in
95 * - call_rcu is used to garbage-collect the old order table.
96 * - The per-order dummy node tables contain a compact version of the
97 * hash table nodes. These tables are invariant after they are
98 * populated into the hash table.
100 * A bit of ascii art explanation:
102 * Order index is the off-by-one compare to the actual power of 2 because
103 * we use index 0 to deal with the 0 special-case.
105 * This shows the nodes for a small table ordered by reversed bits:
117 * This shows the nodes in order of non-reversed bits, linked by
118 * reversed-bit order.
123 * 1 | 1 001 100 <- <-
125 * 2 | | 2 010 010 | |
126 * | | | 3 011 110 | <- |
128 * 3 -> | | | 4 100 001 | |
144 #include <urcu-call-rcu.h>
145 #include <urcu/arch.h>
146 #include <urcu/uatomic.h>
147 #include <urcu/jhash.h>
148 #include <urcu/compiler.h>
149 #include <urcu/rculfhash.h>
154 #define dbg_printf(fmt, args...) printf("[debug rculfhash] " fmt, ## args)
156 #define dbg_printf(fmt, args...)
160 * Per-CPU split-counters lazily update the global counter each 1024
161 * addition/removal. It automatically keeps track of resize required.
162 * We use the bucket length as indicator for need to expand for small
163 * tables and machines lacking per-cpu data suppport.
165 #define COUNT_COMMIT_ORDER 10
166 #define CHAIN_LEN_TARGET 1
167 #define CHAIN_LEN_RESIZE_THRESHOLD 3
170 * Define the minimum table size.
172 #define MIN_TABLE_SIZE 1
174 #if (CAA_BITS_PER_LONG == 32)
175 #define MAX_TABLE_ORDER 32
177 #define MAX_TABLE_ORDER 64
181 * Minimum number of dummy nodes to touch per thread to parallelize grow/shrink.
183 #define MIN_PARTITION_PER_THREAD_ORDER 12
184 #define MIN_PARTITION_PER_THREAD (1UL << MIN_PARTITION_PER_THREAD_ORDER)
187 #define min(a, b) ((a) < (b) ? (a) : (b))
191 #define max(a, b) ((a) > (b) ? (a) : (b))
195 * The removed flag needs to be updated atomically with the pointer.
196 * It indicates that no node must attach to the node scheduled for
197 * removal, and that node garbage collection must be performed.
198 * The dummy flag does not require to be updated atomically with the
199 * pointer, but it is added as a pointer low bit flag to save space.
201 #define REMOVED_FLAG (1UL << 0)
202 #define DUMMY_FLAG (1UL << 1)
203 #define FLAGS_MASK ((1UL << 2) - 1)
205 /* Value of the end pointer. Should not interact with flags. */
206 #define END_VALUE NULL
208 struct ht_items_count
{
209 unsigned long add
, del
;
210 } __attribute__((aligned(CAA_CACHE_LINE_SIZE
)));
213 struct rcu_head head
;
214 struct _cds_lfht_node nodes
[0];
218 unsigned long size
; /* always a power of 2, shared (RCU) */
219 unsigned long resize_target
;
220 int resize_initiated
;
221 struct rcu_level
*tbl
[MAX_TABLE_ORDER
];
226 cds_lfht_hash_fct hash_fct
;
227 cds_lfht_compare_fct compare_fct
;
228 unsigned long hash_seed
;
231 * We need to put the work threads offline (QSBR) when taking this
232 * mutex, because we use synchronize_rcu within this mutex critical
233 * section, which waits on read-side critical sections, and could
234 * therefore cause grace-period deadlock if we hold off RCU G.P.
237 pthread_mutex_t resize_mutex
; /* resize mutex: add/del mutex */
238 unsigned int in_progress_resize
, in_progress_destroy
;
239 void (*cds_lfht_call_rcu
)(struct rcu_head
*head
,
240 void (*func
)(struct rcu_head
*head
));
241 void (*cds_lfht_synchronize_rcu
)(void);
242 void (*cds_lfht_rcu_read_lock
)(void);
243 void (*cds_lfht_rcu_read_unlock
)(void);
244 void (*cds_lfht_rcu_thread_offline
)(void);
245 void (*cds_lfht_rcu_thread_online
)(void);
246 void (*cds_lfht_rcu_register_thread
)(void);
247 void (*cds_lfht_rcu_unregister_thread
)(void);
248 pthread_attr_t
*resize_attr
; /* Resize threads attributes */
249 long count
; /* global approximate item count */
250 struct ht_items_count
*percpu_count
; /* per-cpu item count */
253 struct rcu_resize_work
{
254 struct rcu_head head
;
258 struct partition_resize_work
{
259 struct rcu_head head
;
261 unsigned long i
, start
, len
;
262 void (*fct
)(struct cds_lfht
*ht
, unsigned long i
,
263 unsigned long start
, unsigned long len
);
273 struct cds_lfht_node
*_cds_lfht_add(struct cds_lfht
*ht
,
275 struct cds_lfht_node
*node
,
276 enum add_mode mode
, int dummy
);
279 * Algorithm to reverse bits in a word by lookup table, extended to
282 * http://graphics.stanford.edu/~seander/bithacks.html#BitReverseTable
283 * Originally from Public Domain.
286 static const uint8_t BitReverseTable256
[256] =
288 #define R2(n) (n), (n) + 2*64, (n) + 1*64, (n) + 3*64
289 #define R4(n) R2(n), R2((n) + 2*16), R2((n) + 1*16), R2((n) + 3*16)
290 #define R6(n) R4(n), R4((n) + 2*4 ), R4((n) + 1*4 ), R4((n) + 3*4 )
291 R6(0), R6(2), R6(1), R6(3)
298 uint8_t bit_reverse_u8(uint8_t v
)
300 return BitReverseTable256
[v
];
303 static __attribute__((unused
))
304 uint32_t bit_reverse_u32(uint32_t v
)
306 return ((uint32_t) bit_reverse_u8(v
) << 24) |
307 ((uint32_t) bit_reverse_u8(v
>> 8) << 16) |
308 ((uint32_t) bit_reverse_u8(v
>> 16) << 8) |
309 ((uint32_t) bit_reverse_u8(v
>> 24));
312 static __attribute__((unused
))
313 uint64_t bit_reverse_u64(uint64_t v
)
315 return ((uint64_t) bit_reverse_u8(v
) << 56) |
316 ((uint64_t) bit_reverse_u8(v
>> 8) << 48) |
317 ((uint64_t) bit_reverse_u8(v
>> 16) << 40) |
318 ((uint64_t) bit_reverse_u8(v
>> 24) << 32) |
319 ((uint64_t) bit_reverse_u8(v
>> 32) << 24) |
320 ((uint64_t) bit_reverse_u8(v
>> 40) << 16) |
321 ((uint64_t) bit_reverse_u8(v
>> 48) << 8) |
322 ((uint64_t) bit_reverse_u8(v
>> 56));
326 unsigned long bit_reverse_ulong(unsigned long v
)
328 #if (CAA_BITS_PER_LONG == 32)
329 return bit_reverse_u32(v
);
331 return bit_reverse_u64(v
);
336 * fls: returns the position of the most significant bit.
337 * Returns 0 if no bit is set, else returns the position of the most
338 * significant bit (from 1 to 32 on 32-bit, from 1 to 64 on 64-bit).
340 #if defined(__i386) || defined(__x86_64)
342 unsigned int fls_u32(uint32_t x
)
350 : "=r" (r
) : "rm" (x
));
356 #if defined(__x86_64)
358 unsigned int fls_u64(uint64_t x
)
366 : "=r" (r
) : "rm" (x
));
373 static __attribute__((unused
))
374 unsigned int fls_u64(uint64_t x
)
381 if (!(x
& 0xFFFFFFFF00000000ULL
)) {
385 if (!(x
& 0xFFFF000000000000ULL
)) {
389 if (!(x
& 0xFF00000000000000ULL
)) {
393 if (!(x
& 0xF000000000000000ULL
)) {
397 if (!(x
& 0xC000000000000000ULL
)) {
401 if (!(x
& 0x8000000000000000ULL
)) {
410 static __attribute__((unused
))
411 unsigned int fls_u32(uint32_t x
)
417 if (!(x
& 0xFFFF0000U
)) {
421 if (!(x
& 0xFF000000U
)) {
425 if (!(x
& 0xF0000000U
)) {
429 if (!(x
& 0xC0000000U
)) {
433 if (!(x
& 0x80000000U
)) {
441 unsigned int fls_ulong(unsigned long x
)
443 #if (CAA_BITS_PER_lONG == 32)
450 int get_count_order_u32(uint32_t x
)
454 order
= fls_u32(x
) - 1;
460 int get_count_order_ulong(unsigned long x
)
464 order
= fls_ulong(x
) - 1;
471 #define poison_free(ptr) \
473 memset(ptr, 0x42, sizeof(*(ptr))); \
477 #define poison_free(ptr) free(ptr)
481 void cds_lfht_resize_lazy(struct cds_lfht
*ht
, unsigned long size
, int growth
);
484 * If the sched_getcpu() and sysconf(_SC_NPROCESSORS_CONF) calls are
485 * available, then we support hash table item accounting.
486 * In the unfortunate event the number of CPUs reported would be
487 * inaccurate, we use modulo arithmetic on the number of CPUs we got.
489 #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF)
492 void cds_lfht_resize_lazy_count(struct cds_lfht
*ht
, unsigned long size
,
493 unsigned long count
);
495 static long nr_cpus_mask
= -1;
498 struct ht_items_count
*alloc_per_cpu_items_count(void)
500 struct ht_items_count
*count
;
502 switch (nr_cpus_mask
) {
509 maxcpus
= sysconf(_SC_NPROCESSORS_CONF
);
515 * round up number of CPUs to next power of two, so we
516 * can use & for modulo.
518 maxcpus
= 1UL << get_count_order_ulong(maxcpus
);
519 nr_cpus_mask
= maxcpus
- 1;
523 return calloc(nr_cpus_mask
+ 1, sizeof(*count
));
528 void free_per_cpu_items_count(struct ht_items_count
*count
)
538 assert(nr_cpus_mask
>= 0);
539 cpu
= sched_getcpu();
540 if (unlikely(cpu
< 0))
543 return cpu
& nr_cpus_mask
;
547 void ht_count_add(struct cds_lfht
*ht
, unsigned long size
)
549 unsigned long percpu_count
;
552 if (unlikely(!ht
->percpu_count
))
555 if (unlikely(cpu
< 0))
557 percpu_count
= uatomic_add_return(&ht
->percpu_count
[cpu
].add
, 1);
558 if (unlikely(!(percpu_count
& ((1UL << COUNT_COMMIT_ORDER
) - 1)))) {
561 dbg_printf("add percpu %lu\n", percpu_count
);
562 count
= uatomic_add_return(&ht
->count
,
563 1UL << COUNT_COMMIT_ORDER
);
565 if (!(count
& (count
- 1))) {
566 if ((count
>> CHAIN_LEN_RESIZE_THRESHOLD
) < size
)
568 dbg_printf("add set global %ld\n", count
);
569 cds_lfht_resize_lazy_count(ht
, size
,
570 count
>> (CHAIN_LEN_TARGET
- 1));
576 void ht_count_del(struct cds_lfht
*ht
, unsigned long size
)
578 unsigned long percpu_count
;
581 if (unlikely(!ht
->percpu_count
))
584 if (unlikely(cpu
< 0))
586 percpu_count
= uatomic_add_return(&ht
->percpu_count
[cpu
].del
, 1);
587 if (unlikely(!(percpu_count
& ((1UL << COUNT_COMMIT_ORDER
) - 1)))) {
590 dbg_printf("del percpu %lu\n", percpu_count
);
591 count
= uatomic_add_return(&ht
->count
,
592 -(1UL << COUNT_COMMIT_ORDER
));
594 if (!(count
& (count
- 1))) {
595 if ((count
>> CHAIN_LEN_RESIZE_THRESHOLD
) >= size
)
597 dbg_printf("del set global %ld\n", count
);
599 * Don't shrink table if the number of nodes is below a
602 if (count
< (1UL << COUNT_COMMIT_ORDER
) * (nr_cpus_mask
+ 1))
604 cds_lfht_resize_lazy_count(ht
, size
,
605 count
>> (CHAIN_LEN_TARGET
- 1));
610 #else /* #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF) */
612 static const long nr_cpus_mask
= -1;
615 struct ht_items_count
*alloc_per_cpu_items_count(void)
621 void free_per_cpu_items_count(struct ht_items_count
*count
)
626 void ht_count_add(struct cds_lfht
*ht
, unsigned long size
)
631 void ht_count_del(struct cds_lfht
*ht
, unsigned long size
)
635 #endif /* #else #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF) */
639 void check_resize(struct cds_lfht
*ht
, unsigned long size
, uint32_t chain_len
)
643 if (!(ht
->flags
& CDS_LFHT_AUTO_RESIZE
))
645 count
= uatomic_read(&ht
->count
);
647 * Use bucket-local length for small table expand and for
648 * environments lacking per-cpu data support.
650 if (count
>= (1UL << COUNT_COMMIT_ORDER
))
653 dbg_printf("WARNING: large chain length: %u.\n",
655 if (chain_len
>= CHAIN_LEN_RESIZE_THRESHOLD
)
656 cds_lfht_resize_lazy(ht
, size
,
657 get_count_order_u32(chain_len
- (CHAIN_LEN_TARGET
- 1)));
661 struct cds_lfht_node
*clear_flag(struct cds_lfht_node
*node
)
663 return (struct cds_lfht_node
*) (((unsigned long) node
) & ~FLAGS_MASK
);
667 int is_removed(struct cds_lfht_node
*node
)
669 return ((unsigned long) node
) & REMOVED_FLAG
;
673 struct cds_lfht_node
*flag_removed(struct cds_lfht_node
*node
)
675 return (struct cds_lfht_node
*) (((unsigned long) node
) | REMOVED_FLAG
);
679 int is_dummy(struct cds_lfht_node
*node
)
681 return ((unsigned long) node
) & DUMMY_FLAG
;
685 struct cds_lfht_node
*flag_dummy(struct cds_lfht_node
*node
)
687 return (struct cds_lfht_node
*) (((unsigned long) node
) | DUMMY_FLAG
);
691 struct cds_lfht_node
*get_end(void)
693 return (struct cds_lfht_node
*) END_VALUE
;
697 int is_end(struct cds_lfht_node
*node
)
699 return clear_flag(node
) == (struct cds_lfht_node
*) END_VALUE
;
703 unsigned long _uatomic_max(unsigned long *ptr
, unsigned long v
)
705 unsigned long old1
, old2
;
707 old1
= uatomic_read(ptr
);
712 } while ((old1
= uatomic_cmpxchg(ptr
, old2
, v
)) != old2
);
717 void cds_lfht_free_level(struct rcu_head
*head
)
719 struct rcu_level
*l
=
720 caa_container_of(head
, struct rcu_level
, head
);
725 * Remove all logically deleted nodes from a bucket up to a certain node key.
728 void _cds_lfht_gc_bucket(struct cds_lfht_node
*dummy
, struct cds_lfht_node
*node
)
730 struct cds_lfht_node
*iter_prev
, *iter
, *next
, *new_next
;
732 assert(!is_dummy(dummy
));
733 assert(!is_removed(dummy
));
734 assert(!is_dummy(node
));
735 assert(!is_removed(node
));
738 /* We can always skip the dummy node initially */
739 iter
= rcu_dereference(iter_prev
->p
.next
);
740 assert(iter_prev
->p
.reverse_hash
<= node
->p
.reverse_hash
);
742 * We should never be called with dummy (start of chain)
743 * and logically removed node (end of path compression
744 * marker) being the actual same node. This would be a
745 * bug in the algorithm implementation.
747 assert(dummy
!= node
);
749 if (unlikely(is_end(iter
)))
751 if (likely(clear_flag(iter
)->p
.reverse_hash
> node
->p
.reverse_hash
))
753 next
= rcu_dereference(clear_flag(iter
)->p
.next
);
754 if (likely(is_removed(next
)))
756 iter_prev
= clear_flag(iter
);
759 assert(!is_removed(iter
));
761 new_next
= flag_dummy(clear_flag(next
));
763 new_next
= clear_flag(next
);
764 if (is_removed(iter
))
765 new_next
= flag_removed(new_next
);
766 (void) uatomic_cmpxchg(&iter_prev
->p
.next
, iter
, new_next
);
772 struct cds_lfht_node
*_cds_lfht_add(struct cds_lfht
*ht
,
774 struct cds_lfht_node
*node
,
775 enum add_mode mode
, int dummy
)
777 struct cds_lfht_node
*iter_prev
, *iter
, *next
, *new_node
, *new_next
,
778 *dummy_node
, *return_node
;
779 struct _cds_lfht_node
*lookup
;
780 unsigned long hash
, index
, order
;
782 assert(!is_dummy(node
));
783 assert(!is_removed(node
));
786 node
->p
.next
= flag_dummy(get_end());
787 return node
; /* Initial first add (head) */
789 hash
= bit_reverse_ulong(node
->p
.reverse_hash
);
791 uint32_t chain_len
= 0;
794 * iter_prev points to the non-removed node prior to the
797 index
= hash
& (size
- 1);
798 order
= get_count_order_ulong(index
+ 1);
799 lookup
= &ht
->t
.tbl
[order
]->nodes
[index
& ((!order
? 0 : (1UL << (order
- 1))) - 1)];
800 iter_prev
= (struct cds_lfht_node
*) lookup
;
801 /* We can always skip the dummy node initially */
802 iter
= rcu_dereference(iter_prev
->p
.next
);
803 assert(iter_prev
->p
.reverse_hash
<= node
->p
.reverse_hash
);
805 if (unlikely(is_end(iter
)))
807 if (likely(clear_flag(iter
)->p
.reverse_hash
> node
->p
.reverse_hash
))
809 next
= rcu_dereference(clear_flag(iter
)->p
.next
);
810 if (unlikely(is_removed(next
)))
812 if ((mode
== ADD_UNIQUE
|| mode
== ADD_REPLACE
)
814 && !ht
->compare_fct(node
->key
, node
->key_len
,
815 clear_flag(iter
)->key
,
816 clear_flag(iter
)->key_len
)) {
817 if (mode
== ADD_UNIQUE
)
818 return clear_flag(iter
);
819 else /* mode == ADD_REPLACE */
822 /* Only account for identical reverse hash once */
823 if (iter_prev
->p
.reverse_hash
!= clear_flag(iter
)->p
.reverse_hash
825 check_resize(ht
, size
, ++chain_len
);
826 iter_prev
= clear_flag(iter
);
831 assert(node
!= clear_flag(iter
));
832 assert(!is_removed(iter_prev
));
833 assert(!is_removed(iter
));
834 assert(iter_prev
!= node
);
836 node
->p
.next
= clear_flag(iter
);
838 node
->p
.next
= flag_dummy(clear_flag(iter
));
840 new_node
= flag_dummy(node
);
843 if (uatomic_cmpxchg(&iter_prev
->p
.next
, iter
,
845 continue; /* retry */
847 if (mode
== ADD_REPLACE
)
849 else /* ADD_DEFAULT and ADD_UNIQUE */
855 /* Insert after node to be replaced */
856 iter_prev
= clear_flag(iter
);
858 assert(node
!= clear_flag(iter
));
859 assert(!is_removed(iter_prev
));
860 assert(!is_removed(iter
));
861 assert(iter_prev
!= node
);
863 node
->p
.next
= clear_flag(iter
);
865 new_node
= flag_dummy(node
);
869 * Here is the whole trick for lock-free replace: we add
870 * the replacement node _after_ the node we want to
871 * replace by atomically setting its next pointer at the
872 * same time we set its removal flag. Given that
873 * the lookups/get next use an iterator aware of the
874 * next pointer, they will either skip the old node due
875 * to the removal flag and see the new node, or use
876 * the old node, but will not see the new one.
878 new_node
= flag_removed(new_node
);
879 if (uatomic_cmpxchg(&iter_prev
->p
.next
,
880 iter
, new_node
) != iter
) {
881 continue; /* retry */
883 return_node
= iter_prev
;
888 assert(!is_removed(iter
));
890 new_next
= flag_dummy(clear_flag(next
));
892 new_next
= clear_flag(next
);
893 (void) uatomic_cmpxchg(&iter_prev
->p
.next
, iter
, new_next
);
897 /* Garbage collect logically removed nodes in the bucket */
898 index
= hash
& (size
- 1);
899 order
= get_count_order_ulong(index
+ 1);
900 lookup
= &ht
->t
.tbl
[order
]->nodes
[index
& (!order
? 0 : ((1UL << (order
- 1)) - 1))];
901 dummy_node
= (struct cds_lfht_node
*) lookup
;
902 _cds_lfht_gc_bucket(dummy_node
, node
);
907 int _cds_lfht_del(struct cds_lfht
*ht
, unsigned long size
,
908 struct cds_lfht_node
*node
,
911 struct cds_lfht_node
*dummy
, *next
, *old
;
912 struct _cds_lfht_node
*lookup
;
914 unsigned long hash
, index
, order
;
916 /* logically delete the node */
917 assert(!is_dummy(node
));
918 assert(!is_removed(node
));
919 old
= rcu_dereference(node
->p
.next
);
921 struct cds_lfht_node
*new_next
;
924 if (unlikely(is_removed(next
)))
927 assert(is_dummy(next
));
929 assert(!is_dummy(next
));
930 new_next
= flag_removed(next
);
931 old
= uatomic_cmpxchg(&node
->p
.next
, next
, new_next
);
932 } while (old
!= next
);
934 /* We performed the (logical) deletion. */
938 * Ensure that the node is not visible to readers anymore: lookup for
939 * the node, and remove it (along with any other logically removed node)
942 hash
= bit_reverse_ulong(node
->p
.reverse_hash
);
944 index
= hash
& (size
- 1);
945 order
= get_count_order_ulong(index
+ 1);
946 lookup
= &ht
->t
.tbl
[order
]->nodes
[index
& (!order
? 0 : ((1UL << (order
- 1)) - 1))];
947 dummy
= (struct cds_lfht_node
*) lookup
;
948 _cds_lfht_gc_bucket(dummy
, node
);
951 * Only the flagging action indicated that we (and no other)
952 * removed the node from the hash.
955 assert(is_removed(rcu_dereference(node
->p
.next
)));
962 void *partition_resize_thread(void *arg
)
964 struct partition_resize_work
*work
= arg
;
966 work
->ht
->cds_lfht_rcu_register_thread();
967 work
->fct(work
->ht
, work
->i
, work
->start
, work
->len
);
968 work
->ht
->cds_lfht_rcu_unregister_thread();
973 void partition_resize_helper(struct cds_lfht
*ht
, unsigned long i
,
975 void (*fct
)(struct cds_lfht
*ht
, unsigned long i
,
976 unsigned long start
, unsigned long len
))
978 unsigned long partition_len
;
979 struct partition_resize_work
*work
;
981 unsigned long nr_threads
;
982 pthread_t
*thread_id
;
985 * Note: nr_cpus_mask + 1 is always power of 2.
986 * We spawn just the number of threads we need to satisfy the minimum
987 * partition size, up to the number of CPUs in the system.
989 nr_threads
= min(nr_cpus_mask
+ 1,
990 len
>> MIN_PARTITION_PER_THREAD_ORDER
);
991 partition_len
= len
>> get_count_order_ulong(nr_threads
);
992 work
= calloc(nr_threads
, sizeof(*work
));
993 thread_id
= calloc(nr_threads
, sizeof(*thread_id
));
995 for (thread
= 0; thread
< nr_threads
; thread
++) {
996 work
[thread
].ht
= ht
;
998 work
[thread
].len
= partition_len
;
999 work
[thread
].start
= thread
* partition_len
;
1000 work
[thread
].fct
= fct
;
1001 ret
= pthread_create(&thread_id
[thread
], ht
->resize_attr
,
1002 partition_resize_thread
, &work
[thread
]);
1005 for (thread
= 0; thread
< nr_threads
; thread
++) {
1006 ret
= pthread_join(thread_id
[thread
], NULL
);
1014 * Holding RCU read lock to protect _cds_lfht_add against memory
1015 * reclaim that could be performed by other call_rcu worker threads (ABA
1018 * When we reach a certain length, we can split this population phase over
1019 * many worker threads, based on the number of CPUs available in the system.
1020 * This should therefore take care of not having the expand lagging behind too
1021 * many concurrent insertion threads by using the scheduler's ability to
1022 * schedule dummy node population fairly with insertions.
1025 void init_table_populate_partition(struct cds_lfht
*ht
, unsigned long i
,
1026 unsigned long start
, unsigned long len
)
1030 ht
->cds_lfht_rcu_read_lock();
1031 for (j
= start
; j
< start
+ len
; j
++) {
1032 struct cds_lfht_node
*new_node
=
1033 (struct cds_lfht_node
*) &ht
->t
.tbl
[i
]->nodes
[j
];
1035 dbg_printf("init populate: i %lu j %lu hash %lu\n",
1036 i
, j
, !i
? 0 : (1UL << (i
- 1)) + j
);
1037 new_node
->p
.reverse_hash
=
1038 bit_reverse_ulong(!i
? 0 : (1UL << (i
- 1)) + j
);
1039 (void) _cds_lfht_add(ht
, !i
? 0 : (1UL << (i
- 1)),
1040 new_node
, ADD_DEFAULT
, 1);
1041 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1044 ht
->cds_lfht_rcu_read_unlock();
1048 void init_table_populate(struct cds_lfht
*ht
, unsigned long i
,
1051 assert(nr_cpus_mask
!= -1);
1052 if (nr_cpus_mask
< 0 || len
< 2 * MIN_PARTITION_PER_THREAD
) {
1053 ht
->cds_lfht_rcu_thread_online();
1054 init_table_populate_partition(ht
, i
, 0, len
);
1055 ht
->cds_lfht_rcu_thread_offline();
1058 partition_resize_helper(ht
, i
, len
, init_table_populate_partition
);
1062 void init_table(struct cds_lfht
*ht
,
1063 unsigned long first_order
, unsigned long len_order
)
1065 unsigned long i
, end_order
;
1067 dbg_printf("init table: first_order %lu end_order %lu\n",
1068 first_order
, first_order
+ len_order
);
1069 end_order
= first_order
+ len_order
;
1070 for (i
= first_order
; i
< end_order
; i
++) {
1073 len
= !i
? 1 : 1UL << (i
- 1);
1074 dbg_printf("init order %lu len: %lu\n", i
, len
);
1076 /* Stop expand if the resize target changes under us */
1077 if (CMM_LOAD_SHARED(ht
->t
.resize_target
) < (!i
? 1 : (1UL << i
)))
1080 ht
->t
.tbl
[i
] = calloc(1, sizeof(struct rcu_level
)
1081 + (len
* sizeof(struct _cds_lfht_node
)));
1082 assert(ht
->t
.tbl
[i
]);
1085 * Set all dummy nodes reverse hash values for a level and
1086 * link all dummy nodes into the table.
1088 init_table_populate(ht
, i
, len
);
1091 * Update table size.
1093 cmm_smp_wmb(); /* populate data before RCU size */
1094 CMM_STORE_SHARED(ht
->t
.size
, !i
? 1 : (1UL << i
));
1096 dbg_printf("init new size: %lu\n", !i
? 1 : (1UL << i
));
1097 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1103 * Holding RCU read lock to protect _cds_lfht_remove against memory
1104 * reclaim that could be performed by other call_rcu worker threads (ABA
1106 * For a single level, we logically remove and garbage collect each node.
1108 * As a design choice, we perform logical removal and garbage collection on a
1109 * node-per-node basis to simplify this algorithm. We also assume keeping good
1110 * cache locality of the operation would overweight possible performance gain
1111 * that could be achieved by batching garbage collection for multiple levels.
1112 * However, this would have to be justified by benchmarks.
1114 * Concurrent removal and add operations are helping us perform garbage
1115 * collection of logically removed nodes. We guarantee that all logically
1116 * removed nodes have been garbage-collected (unlinked) before call_rcu is
1117 * invoked to free a hole level of dummy nodes (after a grace period).
1119 * Logical removal and garbage collection can therefore be done in batch or on a
1120 * node-per-node basis, as long as the guarantee above holds.
1122 * When we reach a certain length, we can split this removal over many worker
1123 * threads, based on the number of CPUs available in the system. This should
1124 * take care of not letting resize process lag behind too many concurrent
1125 * updater threads actively inserting into the hash table.
1128 void remove_table_partition(struct cds_lfht
*ht
, unsigned long i
,
1129 unsigned long start
, unsigned long len
)
1133 ht
->cds_lfht_rcu_read_lock();
1134 for (j
= start
; j
< start
+ len
; j
++) {
1135 struct cds_lfht_node
*fini_node
=
1136 (struct cds_lfht_node
*) &ht
->t
.tbl
[i
]->nodes
[j
];
1138 dbg_printf("remove entry: i %lu j %lu hash %lu\n",
1139 i
, j
, !i
? 0 : (1UL << (i
- 1)) + j
);
1140 fini_node
->p
.reverse_hash
=
1141 bit_reverse_ulong(!i
? 0 : (1UL << (i
- 1)) + j
);
1142 (void) _cds_lfht_del(ht
, !i
? 0 : (1UL << (i
- 1)),
1144 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1147 ht
->cds_lfht_rcu_read_unlock();
1151 void remove_table(struct cds_lfht
*ht
, unsigned long i
, unsigned long len
)
1154 assert(nr_cpus_mask
!= -1);
1155 if (nr_cpus_mask
< 0 || len
< 2 * MIN_PARTITION_PER_THREAD
) {
1156 ht
->cds_lfht_rcu_thread_online();
1157 remove_table_partition(ht
, i
, 0, len
);
1158 ht
->cds_lfht_rcu_thread_offline();
1161 partition_resize_helper(ht
, i
, len
, remove_table_partition
);
1165 void fini_table(struct cds_lfht
*ht
,
1166 unsigned long first_order
, unsigned long len_order
)
1170 dbg_printf("fini table: first_order %lu end_order %lu\n",
1171 first_order
, first_order
+ len_order
);
1172 end_order
= first_order
+ len_order
;
1173 assert(first_order
> 0);
1174 for (i
= end_order
- 1; i
>= first_order
; i
--) {
1177 len
= !i
? 1 : 1UL << (i
- 1);
1178 dbg_printf("fini order %lu len: %lu\n", i
, len
);
1180 /* Stop shrink if the resize target changes under us */
1181 if (CMM_LOAD_SHARED(ht
->t
.resize_target
) > (1UL << (i
- 1)))
1184 cmm_smp_wmb(); /* populate data before RCU size */
1185 CMM_STORE_SHARED(ht
->t
.size
, 1UL << (i
- 1));
1188 * We need to wait for all add operations to reach Q.S. (and
1189 * thus use the new table for lookups) before we can start
1190 * releasing the old dummy nodes. Otherwise their lookup will
1191 * return a logically removed node as insert position.
1193 ht
->cds_lfht_synchronize_rcu();
1196 * Set "removed" flag in dummy nodes about to be removed.
1197 * Unlink all now-logically-removed dummy node pointers.
1198 * Concurrent add/remove operation are helping us doing
1201 remove_table(ht
, i
, len
);
1203 ht
->cds_lfht_call_rcu(&ht
->t
.tbl
[i
]->head
, cds_lfht_free_level
);
1205 dbg_printf("fini new size: %lu\n", 1UL << i
);
1206 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1211 struct cds_lfht
*_cds_lfht_new(cds_lfht_hash_fct hash_fct
,
1212 cds_lfht_compare_fct compare_fct
,
1213 unsigned long hash_seed
,
1214 unsigned long init_size
,
1216 void (*cds_lfht_call_rcu
)(struct rcu_head
*head
,
1217 void (*func
)(struct rcu_head
*head
)),
1218 void (*cds_lfht_synchronize_rcu
)(void),
1219 void (*cds_lfht_rcu_read_lock
)(void),
1220 void (*cds_lfht_rcu_read_unlock
)(void),
1221 void (*cds_lfht_rcu_thread_offline
)(void),
1222 void (*cds_lfht_rcu_thread_online
)(void),
1223 void (*cds_lfht_rcu_register_thread
)(void),
1224 void (*cds_lfht_rcu_unregister_thread
)(void),
1225 pthread_attr_t
*attr
)
1227 struct cds_lfht
*ht
;
1228 unsigned long order
;
1230 /* init_size must be power of two */
1231 if (init_size
&& (init_size
& (init_size
- 1)))
1233 ht
= calloc(1, sizeof(struct cds_lfht
));
1235 ht
->hash_fct
= hash_fct
;
1236 ht
->compare_fct
= compare_fct
;
1237 ht
->hash_seed
= hash_seed
;
1238 ht
->cds_lfht_call_rcu
= cds_lfht_call_rcu
;
1239 ht
->cds_lfht_synchronize_rcu
= cds_lfht_synchronize_rcu
;
1240 ht
->cds_lfht_rcu_read_lock
= cds_lfht_rcu_read_lock
;
1241 ht
->cds_lfht_rcu_read_unlock
= cds_lfht_rcu_read_unlock
;
1242 ht
->cds_lfht_rcu_thread_offline
= cds_lfht_rcu_thread_offline
;
1243 ht
->cds_lfht_rcu_thread_online
= cds_lfht_rcu_thread_online
;
1244 ht
->cds_lfht_rcu_register_thread
= cds_lfht_rcu_register_thread
;
1245 ht
->cds_lfht_rcu_unregister_thread
= cds_lfht_rcu_unregister_thread
;
1246 ht
->resize_attr
= attr
;
1247 ht
->percpu_count
= alloc_per_cpu_items_count();
1248 /* this mutex should not nest in read-side C.S. */
1249 pthread_mutex_init(&ht
->resize_mutex
, NULL
);
1250 order
= get_count_order_ulong(max(init_size
, MIN_TABLE_SIZE
)) + 1;
1252 ht
->cds_lfht_rcu_thread_offline();
1253 pthread_mutex_lock(&ht
->resize_mutex
);
1254 ht
->t
.resize_target
= 1UL << (order
- 1);
1255 init_table(ht
, 0, order
);
1256 pthread_mutex_unlock(&ht
->resize_mutex
);
1257 ht
->cds_lfht_rcu_thread_online();
1261 void cds_lfht_lookup(struct cds_lfht
*ht
, void *key
, size_t key_len
,
1262 struct cds_lfht_iter
*iter
)
1264 struct cds_lfht_node
*node
, *next
, *dummy_node
;
1265 struct _cds_lfht_node
*lookup
;
1266 unsigned long hash
, reverse_hash
, index
, order
, size
;
1268 hash
= ht
->hash_fct(key
, key_len
, ht
->hash_seed
);
1269 reverse_hash
= bit_reverse_ulong(hash
);
1271 size
= rcu_dereference(ht
->t
.size
);
1272 index
= hash
& (size
- 1);
1273 order
= get_count_order_ulong(index
+ 1);
1274 lookup
= &ht
->t
.tbl
[order
]->nodes
[index
& (!order
? 0 : ((1UL << (order
- 1))) - 1)];
1275 dbg_printf("lookup hash %lu index %lu order %lu aridx %lu\n",
1276 hash
, index
, order
, index
& (!order
? 0 : ((1UL << (order
- 1)) - 1)));
1277 dummy_node
= (struct cds_lfht_node
*) lookup
;
1278 /* We can always skip the dummy node initially */
1279 node
= rcu_dereference(dummy_node
->p
.next
);
1280 node
= clear_flag(node
);
1282 if (unlikely(is_end(node
))) {
1286 if (unlikely(node
->p
.reverse_hash
> reverse_hash
)) {
1290 next
= rcu_dereference(node
->p
.next
);
1291 if (likely(!is_removed(next
))
1293 && likely(!ht
->compare_fct(node
->key
, node
->key_len
, key
, key_len
))) {
1296 node
= clear_flag(next
);
1298 assert(!node
|| !is_dummy(rcu_dereference(node
->p
.next
)));
1303 void cds_lfht_next(struct cds_lfht
*ht
, struct cds_lfht_iter
*iter
)
1305 struct cds_lfht_node
*node
, *next
;
1306 unsigned long reverse_hash
;
1311 reverse_hash
= node
->p
.reverse_hash
;
1313 key_len
= node
->key_len
;
1315 node
= clear_flag(next
);
1318 if (unlikely(is_end(node
))) {
1322 if (unlikely(node
->p
.reverse_hash
> reverse_hash
)) {
1326 next
= rcu_dereference(node
->p
.next
);
1327 if (likely(!is_removed(next
))
1329 && likely(!ht
->compare_fct(node
->key
, node
->key_len
, key
, key_len
))) {
1332 node
= clear_flag(next
);
1334 assert(!node
|| !is_dummy(rcu_dereference(node
->p
.next
)));
1339 void cds_lfht_add(struct cds_lfht
*ht
, struct cds_lfht_node
*node
)
1341 unsigned long hash
, size
;
1343 hash
= ht
->hash_fct(node
->key
, node
->key_len
, ht
->hash_seed
);
1344 node
->p
.reverse_hash
= bit_reverse_ulong((unsigned long) hash
);
1346 size
= rcu_dereference(ht
->t
.size
);
1347 (void) _cds_lfht_add(ht
, size
, node
, ADD_DEFAULT
, 0);
1348 ht_count_add(ht
, size
);
1351 struct cds_lfht_node
*cds_lfht_add_unique(struct cds_lfht
*ht
,
1352 struct cds_lfht_node
*node
)
1354 unsigned long hash
, size
;
1355 struct cds_lfht_node
*ret
;
1357 hash
= ht
->hash_fct(node
->key
, node
->key_len
, ht
->hash_seed
);
1358 node
->p
.reverse_hash
= bit_reverse_ulong((unsigned long) hash
);
1360 size
= rcu_dereference(ht
->t
.size
);
1361 ret
= _cds_lfht_add(ht
, size
, node
, ADD_UNIQUE
, 0);
1363 ht_count_add(ht
, size
);
1367 struct cds_lfht_node
*cds_lfht_replace(struct cds_lfht
*ht
,
1368 struct cds_lfht_node
*node
)
1370 unsigned long hash
, size
;
1371 struct cds_lfht_node
*ret
;
1373 hash
= ht
->hash_fct(node
->key
, node
->key_len
, ht
->hash_seed
);
1374 node
->p
.reverse_hash
= bit_reverse_ulong((unsigned long) hash
);
1376 size
= rcu_dereference(ht
->t
.size
);
1377 ret
= _cds_lfht_add(ht
, size
, node
, ADD_REPLACE
, 0);
1379 ht_count_add(ht
, size
);
1383 int cds_lfht_del(struct cds_lfht
*ht
, struct cds_lfht_node
*node
)
1388 size
= rcu_dereference(ht
->t
.size
);
1389 ret
= _cds_lfht_del(ht
, size
, node
, 0);
1391 ht_count_del(ht
, size
);
1396 int cds_lfht_delete_dummy(struct cds_lfht
*ht
)
1398 struct cds_lfht_node
*node
;
1399 struct _cds_lfht_node
*lookup
;
1400 unsigned long order
, i
, size
;
1402 /* Check that the table is empty */
1403 lookup
= &ht
->t
.tbl
[0]->nodes
[0];
1404 node
= (struct cds_lfht_node
*) lookup
;
1406 node
= clear_flag(node
)->p
.next
;
1407 if (!is_dummy(node
))
1409 assert(!is_removed(node
));
1410 } while (!is_end(node
));
1412 * size accessed without rcu_dereference because hash table is
1416 /* Internal sanity check: all nodes left should be dummy */
1417 for (order
= 0; order
< get_count_order_ulong(size
) + 1; order
++) {
1420 len
= !order
? 1 : 1UL << (order
- 1);
1421 for (i
= 0; i
< len
; i
++) {
1422 dbg_printf("delete order %lu i %lu hash %lu\n",
1424 bit_reverse_ulong(ht
->t
.tbl
[order
]->nodes
[i
].reverse_hash
));
1425 assert(is_dummy(ht
->t
.tbl
[order
]->nodes
[i
].next
));
1427 poison_free(ht
->t
.tbl
[order
]);
1433 * Should only be called when no more concurrent readers nor writers can
1434 * possibly access the table.
1436 int cds_lfht_destroy(struct cds_lfht
*ht
, pthread_attr_t
**attr
)
1440 /* Wait for in-flight resize operations to complete */
1441 CMM_STORE_SHARED(ht
->in_progress_destroy
, 1);
1442 while (uatomic_read(&ht
->in_progress_resize
))
1443 poll(NULL
, 0, 100); /* wait for 100ms */
1444 ret
= cds_lfht_delete_dummy(ht
);
1447 free_per_cpu_items_count(ht
->percpu_count
);
1449 *attr
= ht
->resize_attr
;
1454 void cds_lfht_count_nodes(struct cds_lfht
*ht
,
1455 unsigned long *approx_before
,
1456 unsigned long *count
,
1457 unsigned long *removed
,
1458 unsigned long *approx_after
)
1460 struct cds_lfht_node
*node
, *next
;
1461 struct _cds_lfht_node
*lookup
;
1462 unsigned long nr_dummy
= 0;
1465 if (nr_cpus_mask
>= 0) {
1468 for (i
= 0; i
< nr_cpus_mask
+ 1; i
++) {
1469 *approx_before
+= uatomic_read(&ht
->percpu_count
[i
].add
);
1470 *approx_before
-= uatomic_read(&ht
->percpu_count
[i
].del
);
1477 /* Count non-dummy nodes in the table */
1478 lookup
= &ht
->t
.tbl
[0]->nodes
[0];
1479 node
= (struct cds_lfht_node
*) lookup
;
1481 next
= rcu_dereference(node
->p
.next
);
1482 if (is_removed(next
)) {
1483 if (!is_dummy(next
))
1487 } else if (!is_dummy(next
))
1491 node
= clear_flag(next
);
1492 } while (!is_end(node
));
1493 dbg_printf("number of dummy nodes: %lu\n", nr_dummy
);
1495 if (nr_cpus_mask
>= 0) {
1498 for (i
= 0; i
< nr_cpus_mask
+ 1; i
++) {
1499 *approx_after
+= uatomic_read(&ht
->percpu_count
[i
].add
);
1500 *approx_after
-= uatomic_read(&ht
->percpu_count
[i
].del
);
1505 /* called with resize mutex held */
1507 void _do_cds_lfht_grow(struct cds_lfht
*ht
,
1508 unsigned long old_size
, unsigned long new_size
)
1510 unsigned long old_order
, new_order
;
1512 old_order
= get_count_order_ulong(old_size
) + 1;
1513 new_order
= get_count_order_ulong(new_size
) + 1;
1514 printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n",
1515 old_size
, old_order
, new_size
, new_order
);
1516 assert(new_size
> old_size
);
1517 init_table(ht
, old_order
, new_order
- old_order
);
1520 /* called with resize mutex held */
1522 void _do_cds_lfht_shrink(struct cds_lfht
*ht
,
1523 unsigned long old_size
, unsigned long new_size
)
1525 unsigned long old_order
, new_order
;
1527 new_size
= max(new_size
, MIN_TABLE_SIZE
);
1528 old_order
= get_count_order_ulong(old_size
) + 1;
1529 new_order
= get_count_order_ulong(new_size
) + 1;
1530 printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n",
1531 old_size
, old_order
, new_size
, new_order
);
1532 assert(new_size
< old_size
);
1534 /* Remove and unlink all dummy nodes to remove. */
1535 fini_table(ht
, new_order
, old_order
- new_order
);
1539 /* called with resize mutex held */
1541 void _do_cds_lfht_resize(struct cds_lfht
*ht
)
1543 unsigned long new_size
, old_size
;
1546 * Resize table, re-do if the target size has changed under us.
1549 ht
->t
.resize_initiated
= 1;
1550 old_size
= ht
->t
.size
;
1551 new_size
= CMM_LOAD_SHARED(ht
->t
.resize_target
);
1552 if (old_size
< new_size
)
1553 _do_cds_lfht_grow(ht
, old_size
, new_size
);
1554 else if (old_size
> new_size
)
1555 _do_cds_lfht_shrink(ht
, old_size
, new_size
);
1556 ht
->t
.resize_initiated
= 0;
1557 /* write resize_initiated before read resize_target */
1559 } while (ht
->t
.size
!= CMM_LOAD_SHARED(ht
->t
.resize_target
));
1563 unsigned long resize_target_update(struct cds_lfht
*ht
, unsigned long size
,
1566 return _uatomic_max(&ht
->t
.resize_target
,
1567 size
<< growth_order
);
1571 void resize_target_update_count(struct cds_lfht
*ht
,
1572 unsigned long count
)
1574 count
= max(count
, MIN_TABLE_SIZE
);
1575 uatomic_set(&ht
->t
.resize_target
, count
);
1578 void cds_lfht_resize(struct cds_lfht
*ht
, unsigned long new_size
)
1580 resize_target_update_count(ht
, new_size
);
1581 CMM_STORE_SHARED(ht
->t
.resize_initiated
, 1);
1582 ht
->cds_lfht_rcu_thread_offline();
1583 pthread_mutex_lock(&ht
->resize_mutex
);
1584 _do_cds_lfht_resize(ht
);
1585 pthread_mutex_unlock(&ht
->resize_mutex
);
1586 ht
->cds_lfht_rcu_thread_online();
1590 void do_resize_cb(struct rcu_head
*head
)
1592 struct rcu_resize_work
*work
=
1593 caa_container_of(head
, struct rcu_resize_work
, head
);
1594 struct cds_lfht
*ht
= work
->ht
;
1596 ht
->cds_lfht_rcu_thread_offline();
1597 pthread_mutex_lock(&ht
->resize_mutex
);
1598 _do_cds_lfht_resize(ht
);
1599 pthread_mutex_unlock(&ht
->resize_mutex
);
1600 ht
->cds_lfht_rcu_thread_online();
1602 cmm_smp_mb(); /* finish resize before decrement */
1603 uatomic_dec(&ht
->in_progress_resize
);
1607 void cds_lfht_resize_lazy(struct cds_lfht
*ht
, unsigned long size
, int growth
)
1609 struct rcu_resize_work
*work
;
1610 unsigned long target_size
;
1612 target_size
= resize_target_update(ht
, size
, growth
);
1613 /* Store resize_target before read resize_initiated */
1615 if (!CMM_LOAD_SHARED(ht
->t
.resize_initiated
) && size
< target_size
) {
1616 uatomic_inc(&ht
->in_progress_resize
);
1617 cmm_smp_mb(); /* increment resize count before calling it */
1618 work
= malloc(sizeof(*work
));
1620 ht
->cds_lfht_call_rcu(&work
->head
, do_resize_cb
);
1621 CMM_STORE_SHARED(ht
->t
.resize_initiated
, 1);
1625 #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF)
1628 void cds_lfht_resize_lazy_count(struct cds_lfht
*ht
, unsigned long size
,
1629 unsigned long count
)
1631 struct rcu_resize_work
*work
;
1633 if (!(ht
->flags
& CDS_LFHT_AUTO_RESIZE
))
1635 resize_target_update_count(ht
, count
);
1636 /* Store resize_target before read resize_initiated */
1638 if (!CMM_LOAD_SHARED(ht
->t
.resize_initiated
)) {
1639 uatomic_inc(&ht
->in_progress_resize
);
1640 cmm_smp_mb(); /* increment resize count before calling it */
1641 work
= malloc(sizeof(*work
));
1643 ht
->cds_lfht_call_rcu(&work
->head
, do_resize_cb
);
1644 CMM_STORE_SHARED(ht
->t
.resize_initiated
, 1);