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/compiler.h>
148 #include <urcu/rculfhash.h>
153 #define dbg_printf(fmt, args...) printf("[debug rculfhash] " fmt, ## args)
155 #define dbg_printf(fmt, args...)
159 * Per-CPU split-counters lazily update the global counter each 1024
160 * addition/removal. It automatically keeps track of resize required.
161 * We use the bucket length as indicator for need to expand for small
162 * tables and machines lacking per-cpu data suppport.
164 #define COUNT_COMMIT_ORDER 10
165 #define CHAIN_LEN_TARGET 1
166 #define CHAIN_LEN_RESIZE_THRESHOLD 3
169 * Define the minimum table size.
171 #define MIN_TABLE_SIZE 1
173 #if (CAA_BITS_PER_LONG == 32)
174 #define MAX_TABLE_ORDER 32
176 #define MAX_TABLE_ORDER 64
180 * Minimum number of dummy nodes to touch per thread to parallelize grow/shrink.
182 #define MIN_PARTITION_PER_THREAD_ORDER 12
183 #define MIN_PARTITION_PER_THREAD (1UL << MIN_PARTITION_PER_THREAD_ORDER)
186 #define min(a, b) ((a) < (b) ? (a) : (b))
190 #define max(a, b) ((a) > (b) ? (a) : (b))
194 * The removed flag needs to be updated atomically with the pointer.
195 * It indicates that no node must attach to the node scheduled for
196 * removal, and that node garbage collection must be performed.
197 * The dummy flag does not require to be updated atomically with the
198 * pointer, but it is added as a pointer low bit flag to save space.
200 #define REMOVED_FLAG (1UL << 0)
201 #define DUMMY_FLAG (1UL << 1)
202 #define FLAGS_MASK ((1UL << 2) - 1)
204 /* Value of the end pointer. Should not interact with flags. */
205 #define END_VALUE NULL
207 struct ht_items_count
{
208 unsigned long add
, del
;
209 } __attribute__((aligned(CAA_CACHE_LINE_SIZE
)));
212 /* Note: manually update allocation length when adding a field */
213 struct _cds_lfht_node nodes
[0];
217 unsigned long size
; /* always a power of 2, shared (RCU) */
218 unsigned long resize_target
;
219 int resize_initiated
;
220 struct rcu_level
*tbl
[MAX_TABLE_ORDER
];
225 cds_lfht_hash_fct hash_fct
;
226 cds_lfht_compare_fct compare_fct
;
227 unsigned long hash_seed
;
230 * We need to put the work threads offline (QSBR) when taking this
231 * mutex, because we use synchronize_rcu within this mutex critical
232 * section, which waits on read-side critical sections, and could
233 * therefore cause grace-period deadlock if we hold off RCU G.P.
236 pthread_mutex_t resize_mutex
; /* resize mutex: add/del mutex */
237 unsigned int in_progress_resize
, in_progress_destroy
;
238 void (*cds_lfht_call_rcu
)(struct rcu_head
*head
,
239 void (*func
)(struct rcu_head
*head
));
240 void (*cds_lfht_synchronize_rcu
)(void);
241 void (*cds_lfht_rcu_read_lock
)(void);
242 void (*cds_lfht_rcu_read_unlock
)(void);
243 void (*cds_lfht_rcu_thread_offline
)(void);
244 void (*cds_lfht_rcu_thread_online
)(void);
245 void (*cds_lfht_rcu_register_thread
)(void);
246 void (*cds_lfht_rcu_unregister_thread
)(void);
247 pthread_attr_t
*resize_attr
; /* Resize threads attributes */
248 long count
; /* global approximate item count */
249 struct ht_items_count
*percpu_count
; /* per-cpu item count */
252 struct rcu_resize_work
{
253 struct rcu_head head
;
257 struct partition_resize_work
{
260 unsigned long i
, start
, len
;
261 void (*fct
)(struct cds_lfht
*ht
, unsigned long i
,
262 unsigned long start
, unsigned long len
);
272 struct cds_lfht_node
*_cds_lfht_add(struct cds_lfht
*ht
,
274 struct cds_lfht_node
*node
,
275 enum add_mode mode
, int dummy
);
278 * Algorithm to reverse bits in a word by lookup table, extended to
281 * http://graphics.stanford.edu/~seander/bithacks.html#BitReverseTable
282 * Originally from Public Domain.
285 static const uint8_t BitReverseTable256
[256] =
287 #define R2(n) (n), (n) + 2*64, (n) + 1*64, (n) + 3*64
288 #define R4(n) R2(n), R2((n) + 2*16), R2((n) + 1*16), R2((n) + 3*16)
289 #define R6(n) R4(n), R4((n) + 2*4 ), R4((n) + 1*4 ), R4((n) + 3*4 )
290 R6(0), R6(2), R6(1), R6(3)
297 uint8_t bit_reverse_u8(uint8_t v
)
299 return BitReverseTable256
[v
];
302 static __attribute__((unused
))
303 uint32_t bit_reverse_u32(uint32_t v
)
305 return ((uint32_t) bit_reverse_u8(v
) << 24) |
306 ((uint32_t) bit_reverse_u8(v
>> 8) << 16) |
307 ((uint32_t) bit_reverse_u8(v
>> 16) << 8) |
308 ((uint32_t) bit_reverse_u8(v
>> 24));
311 static __attribute__((unused
))
312 uint64_t bit_reverse_u64(uint64_t v
)
314 return ((uint64_t) bit_reverse_u8(v
) << 56) |
315 ((uint64_t) bit_reverse_u8(v
>> 8) << 48) |
316 ((uint64_t) bit_reverse_u8(v
>> 16) << 40) |
317 ((uint64_t) bit_reverse_u8(v
>> 24) << 32) |
318 ((uint64_t) bit_reverse_u8(v
>> 32) << 24) |
319 ((uint64_t) bit_reverse_u8(v
>> 40) << 16) |
320 ((uint64_t) bit_reverse_u8(v
>> 48) << 8) |
321 ((uint64_t) bit_reverse_u8(v
>> 56));
325 unsigned long bit_reverse_ulong(unsigned long v
)
327 #if (CAA_BITS_PER_LONG == 32)
328 return bit_reverse_u32(v
);
330 return bit_reverse_u64(v
);
335 * fls: returns the position of the most significant bit.
336 * Returns 0 if no bit is set, else returns the position of the most
337 * significant bit (from 1 to 32 on 32-bit, from 1 to 64 on 64-bit).
339 #if defined(__i386) || defined(__x86_64)
341 unsigned int fls_u32(uint32_t x
)
349 : "=r" (r
) : "rm" (x
));
355 #if defined(__x86_64)
357 unsigned int fls_u64(uint64_t x
)
365 : "=r" (r
) : "rm" (x
));
372 static __attribute__((unused
))
373 unsigned int fls_u64(uint64_t x
)
380 if (!(x
& 0xFFFFFFFF00000000ULL
)) {
384 if (!(x
& 0xFFFF000000000000ULL
)) {
388 if (!(x
& 0xFF00000000000000ULL
)) {
392 if (!(x
& 0xF000000000000000ULL
)) {
396 if (!(x
& 0xC000000000000000ULL
)) {
400 if (!(x
& 0x8000000000000000ULL
)) {
409 static __attribute__((unused
))
410 unsigned int fls_u32(uint32_t x
)
416 if (!(x
& 0xFFFF0000U
)) {
420 if (!(x
& 0xFF000000U
)) {
424 if (!(x
& 0xF0000000U
)) {
428 if (!(x
& 0xC0000000U
)) {
432 if (!(x
& 0x80000000U
)) {
440 unsigned int fls_ulong(unsigned long x
)
442 #if (CAA_BITS_PER_lONG == 32)
450 * Return the minimum order for which x <= (1UL << order).
451 * Return -1 if x is 0.
453 int get_count_order_u32(uint32_t x
)
458 return fls_u32(x
- 1);
462 * Return the minimum order for which x <= (1UL << order).
463 * Return -1 if x is 0.
465 int get_count_order_ulong(unsigned long x
)
470 return fls_ulong(x
- 1);
474 #define poison_free(ptr) \
476 memset(ptr, 0x42, sizeof(*(ptr))); \
480 #define poison_free(ptr) free(ptr)
484 void cds_lfht_resize_lazy(struct cds_lfht
*ht
, unsigned long size
, int growth
);
487 * If the sched_getcpu() and sysconf(_SC_NPROCESSORS_CONF) calls are
488 * available, then we support hash table item accounting.
489 * In the unfortunate event the number of CPUs reported would be
490 * inaccurate, we use modulo arithmetic on the number of CPUs we got.
492 #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF)
495 void cds_lfht_resize_lazy_count(struct cds_lfht
*ht
, unsigned long size
,
496 unsigned long count
);
498 static long nr_cpus_mask
= -1;
501 struct ht_items_count
*alloc_per_cpu_items_count(void)
503 struct ht_items_count
*count
;
505 switch (nr_cpus_mask
) {
512 maxcpus
= sysconf(_SC_NPROCESSORS_CONF
);
518 * round up number of CPUs to next power of two, so we
519 * can use & for modulo.
521 maxcpus
= 1UL << get_count_order_ulong(maxcpus
);
522 nr_cpus_mask
= maxcpus
- 1;
526 return calloc(nr_cpus_mask
+ 1, sizeof(*count
));
531 void free_per_cpu_items_count(struct ht_items_count
*count
)
541 assert(nr_cpus_mask
>= 0);
542 cpu
= sched_getcpu();
543 if (unlikely(cpu
< 0))
546 return cpu
& nr_cpus_mask
;
550 void ht_count_add(struct cds_lfht
*ht
, unsigned long size
)
552 unsigned long percpu_count
;
555 if (unlikely(!ht
->percpu_count
))
558 if (unlikely(cpu
< 0))
560 percpu_count
= uatomic_add_return(&ht
->percpu_count
[cpu
].add
, 1);
561 if (unlikely(!(percpu_count
& ((1UL << COUNT_COMMIT_ORDER
) - 1)))) {
564 dbg_printf("add percpu %lu\n", percpu_count
);
565 count
= uatomic_add_return(&ht
->count
,
566 1UL << COUNT_COMMIT_ORDER
);
568 if (!(count
& (count
- 1))) {
569 if ((count
>> CHAIN_LEN_RESIZE_THRESHOLD
) < size
)
571 dbg_printf("add set global %ld\n", count
);
572 cds_lfht_resize_lazy_count(ht
, size
,
573 count
>> (CHAIN_LEN_TARGET
- 1));
579 void ht_count_del(struct cds_lfht
*ht
, unsigned long size
)
581 unsigned long percpu_count
;
584 if (unlikely(!ht
->percpu_count
))
587 if (unlikely(cpu
< 0))
589 percpu_count
= uatomic_add_return(&ht
->percpu_count
[cpu
].del
, 1);
590 if (unlikely(!(percpu_count
& ((1UL << COUNT_COMMIT_ORDER
) - 1)))) {
593 dbg_printf("del percpu %lu\n", percpu_count
);
594 count
= uatomic_add_return(&ht
->count
,
595 -(1UL << COUNT_COMMIT_ORDER
));
597 if (!(count
& (count
- 1))) {
598 if ((count
>> CHAIN_LEN_RESIZE_THRESHOLD
) >= size
)
600 dbg_printf("del set global %ld\n", count
);
602 * Don't shrink table if the number of nodes is below a
605 if (count
< (1UL << COUNT_COMMIT_ORDER
) * (nr_cpus_mask
+ 1))
607 cds_lfht_resize_lazy_count(ht
, size
,
608 count
>> (CHAIN_LEN_TARGET
- 1));
613 #else /* #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF) */
615 static const long nr_cpus_mask
= -2;
618 struct ht_items_count
*alloc_per_cpu_items_count(void)
624 void free_per_cpu_items_count(struct ht_items_count
*count
)
629 void ht_count_add(struct cds_lfht
*ht
, unsigned long size
)
634 void ht_count_del(struct cds_lfht
*ht
, unsigned long size
)
638 #endif /* #else #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF) */
642 void check_resize(struct cds_lfht
*ht
, unsigned long size
, uint32_t chain_len
)
646 if (!(ht
->flags
& CDS_LFHT_AUTO_RESIZE
))
648 count
= uatomic_read(&ht
->count
);
650 * Use bucket-local length for small table expand and for
651 * environments lacking per-cpu data support.
653 if (count
>= (1UL << COUNT_COMMIT_ORDER
))
656 dbg_printf("WARNING: large chain length: %u.\n",
658 if (chain_len
>= CHAIN_LEN_RESIZE_THRESHOLD
)
659 cds_lfht_resize_lazy(ht
, size
,
660 get_count_order_u32(chain_len
- (CHAIN_LEN_TARGET
- 1)));
664 struct cds_lfht_node
*clear_flag(struct cds_lfht_node
*node
)
666 return (struct cds_lfht_node
*) (((unsigned long) node
) & ~FLAGS_MASK
);
670 int is_removed(struct cds_lfht_node
*node
)
672 return ((unsigned long) node
) & REMOVED_FLAG
;
676 struct cds_lfht_node
*flag_removed(struct cds_lfht_node
*node
)
678 return (struct cds_lfht_node
*) (((unsigned long) node
) | REMOVED_FLAG
);
682 int is_dummy(struct cds_lfht_node
*node
)
684 return ((unsigned long) node
) & DUMMY_FLAG
;
688 struct cds_lfht_node
*flag_dummy(struct cds_lfht_node
*node
)
690 return (struct cds_lfht_node
*) (((unsigned long) node
) | DUMMY_FLAG
);
694 struct cds_lfht_node
*get_end(void)
696 return (struct cds_lfht_node
*) END_VALUE
;
700 int is_end(struct cds_lfht_node
*node
)
702 return clear_flag(node
) == (struct cds_lfht_node
*) END_VALUE
;
706 unsigned long _uatomic_max(unsigned long *ptr
, unsigned long v
)
708 unsigned long old1
, old2
;
710 old1
= uatomic_read(ptr
);
715 } while ((old1
= uatomic_cmpxchg(ptr
, old2
, v
)) != old2
);
720 struct _cds_lfht_node
*lookup_bucket(struct cds_lfht
*ht
, unsigned long size
,
723 unsigned long index
, order
;
726 index
= hash
& (size
- 1);
728 * equivalent to get_count_order_ulong(index + 1), but optimizes
729 * away the non-existing 0 special-case for
730 * get_count_order_ulong.
732 order
= fls_ulong(index
);
734 dbg_printf("lookup hash %lu index %lu order %lu aridx %lu\n",
735 hash
, index
, order
, index
& (!order
? 0 : ((1UL << (order
- 1)) - 1)));
737 return &ht
->t
.tbl
[order
]->nodes
[index
& (!order
? 0 : ((1UL << (order
- 1)) - 1))];
741 * Remove all logically deleted nodes from a bucket up to a certain node key.
744 void _cds_lfht_gc_bucket(struct cds_lfht_node
*dummy
, struct cds_lfht_node
*node
)
746 struct cds_lfht_node
*iter_prev
, *iter
, *next
, *new_next
;
748 assert(!is_dummy(dummy
));
749 assert(!is_removed(dummy
));
750 assert(!is_dummy(node
));
751 assert(!is_removed(node
));
754 /* We can always skip the dummy node initially */
755 iter
= rcu_dereference(iter_prev
->p
.next
);
756 assert(iter_prev
->p
.reverse_hash
<= node
->p
.reverse_hash
);
758 * We should never be called with dummy (start of chain)
759 * and logically removed node (end of path compression
760 * marker) being the actual same node. This would be a
761 * bug in the algorithm implementation.
763 assert(dummy
!= node
);
765 if (unlikely(is_end(iter
)))
767 if (likely(clear_flag(iter
)->p
.reverse_hash
> node
->p
.reverse_hash
))
769 next
= rcu_dereference(clear_flag(iter
)->p
.next
);
770 if (likely(is_removed(next
)))
772 iter_prev
= clear_flag(iter
);
775 assert(!is_removed(iter
));
777 new_next
= flag_dummy(clear_flag(next
));
779 new_next
= clear_flag(next
);
780 if (is_removed(iter
))
781 new_next
= flag_removed(new_next
);
782 (void) uatomic_cmpxchg(&iter_prev
->p
.next
, iter
, new_next
);
788 int _cds_lfht_replace(struct cds_lfht
*ht
, unsigned long size
,
789 struct cds_lfht_node
*old_node
,
790 struct cds_lfht_node
*ret_next
,
791 struct cds_lfht_node
*new_node
)
793 struct cds_lfht_node
*dummy
, *old_next
;
794 struct _cds_lfht_node
*lookup
;
797 if (!old_node
) /* Return -ENOENT if asked to replace NULL node */
800 assert(!is_removed(old_node
));
801 assert(!is_dummy(old_node
));
802 assert(!is_removed(new_node
));
803 assert(!is_dummy(new_node
));
804 assert(new_node
!= old_node
);
806 /* Insert after node to be replaced */
808 if (is_removed(old_next
)) {
810 * Too late, the old node has been removed under us
811 * between lookup and replace. Fail.
815 assert(!is_dummy(old_next
));
816 assert(new_node
!= clear_flag(old_next
));
817 new_node
->p
.next
= clear_flag(old_next
);
819 * Here is the whole trick for lock-free replace: we add
820 * the replacement node _after_ the node we want to
821 * replace by atomically setting its next pointer at the
822 * same time we set its removal flag. Given that
823 * the lookups/get next use an iterator aware of the
824 * next pointer, they will either skip the old node due
825 * to the removal flag and see the new node, or use
826 * the old node, but will not see the new one.
828 ret_next
= uatomic_cmpxchg(&old_node
->p
.next
,
829 old_next
, flag_removed(new_node
));
830 } while (ret_next
!= old_next
);
832 /* We performed the replacement. */
836 * Ensure that the old node is not visible to readers anymore:
837 * lookup for the node, and remove it (along with any other
838 * logically removed node) if found.
840 lookup
= lookup_bucket(ht
, size
, bit_reverse_ulong(old_node
->p
.reverse_hash
));
841 dummy
= (struct cds_lfht_node
*) lookup
;
842 _cds_lfht_gc_bucket(dummy
, new_node
);
845 * Only the flagging action indicated that we (and no other)
846 * replaced the node from the hash table.
849 assert(is_removed(rcu_dereference(old_node
->p
.next
)));
857 struct cds_lfht_node
*_cds_lfht_add(struct cds_lfht
*ht
,
859 struct cds_lfht_node
*node
,
860 enum add_mode mode
, int dummy
)
862 struct cds_lfht_node
*iter_prev
, *iter
, *next
, *new_node
, *new_next
,
864 struct _cds_lfht_node
*lookup
;
866 assert(!is_dummy(node
));
867 assert(!is_removed(node
));
870 node
->p
.next
= flag_dummy(get_end());
871 return node
; /* Initial first add (head) */
873 lookup
= lookup_bucket(ht
, size
, bit_reverse_ulong(node
->p
.reverse_hash
));
875 uint32_t chain_len
= 0;
878 * iter_prev points to the non-removed node prior to the
881 iter_prev
= (struct cds_lfht_node
*) lookup
;
882 /* We can always skip the dummy node initially */
883 iter
= rcu_dereference(iter_prev
->p
.next
);
884 assert(iter_prev
->p
.reverse_hash
<= node
->p
.reverse_hash
);
886 if (unlikely(is_end(iter
)))
888 if (likely(clear_flag(iter
)->p
.reverse_hash
> node
->p
.reverse_hash
))
890 /* dummy node is the first node of the identical-hash-value chain */
891 if (dummy
&& clear_flag(iter
)->p
.reverse_hash
== node
->p
.reverse_hash
)
893 next
= rcu_dereference(clear_flag(iter
)->p
.next
);
894 if (unlikely(is_removed(next
)))
896 if ((mode
== ADD_UNIQUE
|| mode
== ADD_REPLACE
)
898 && clear_flag(iter
)->p
.reverse_hash
== node
->p
.reverse_hash
899 && !ht
->compare_fct(node
->key
, node
->key_len
,
900 clear_flag(iter
)->key
,
901 clear_flag(iter
)->key_len
)) {
902 if (mode
== ADD_UNIQUE
)
903 return clear_flag(iter
);
904 else /* mode == ADD_REPLACE */
907 /* Only account for identical reverse hash once */
908 if (iter_prev
->p
.reverse_hash
!= clear_flag(iter
)->p
.reverse_hash
910 check_resize(ht
, size
, ++chain_len
);
911 iter_prev
= clear_flag(iter
);
916 assert(node
!= clear_flag(iter
));
917 assert(!is_removed(iter_prev
));
918 assert(!is_removed(iter
));
919 assert(iter_prev
!= node
);
921 node
->p
.next
= clear_flag(iter
);
923 node
->p
.next
= flag_dummy(clear_flag(iter
));
925 new_node
= flag_dummy(node
);
928 if (uatomic_cmpxchg(&iter_prev
->p
.next
, iter
,
930 continue; /* retry */
932 if (mode
== ADD_REPLACE
)
934 else /* ADD_DEFAULT and ADD_UNIQUE */
941 if (!_cds_lfht_replace(ht
, size
, clear_flag(iter
), next
,
943 return_node
= clear_flag(iter
);
944 goto end
; /* gc already done */
946 continue; /* retry */
950 assert(!is_removed(iter
));
952 new_next
= flag_dummy(clear_flag(next
));
954 new_next
= clear_flag(next
);
955 (void) uatomic_cmpxchg(&iter_prev
->p
.next
, iter
, new_next
);
963 int _cds_lfht_del(struct cds_lfht
*ht
, unsigned long size
,
964 struct cds_lfht_node
*node
,
967 struct cds_lfht_node
*dummy
, *next
, *old
;
968 struct _cds_lfht_node
*lookup
;
971 if (!node
) /* Return -ENOENT if asked to delete NULL node */
974 /* logically delete the node */
975 assert(!is_dummy(node
));
976 assert(!is_removed(node
));
977 old
= rcu_dereference(node
->p
.next
);
979 struct cds_lfht_node
*new_next
;
982 if (unlikely(is_removed(next
)))
985 assert(is_dummy(next
));
987 assert(!is_dummy(next
));
988 new_next
= flag_removed(next
);
989 old
= uatomic_cmpxchg(&node
->p
.next
, next
, new_next
);
990 } while (old
!= next
);
992 /* We performed the (logical) deletion. */
996 * Ensure that the node is not visible to readers anymore: lookup for
997 * the node, and remove it (along with any other logically removed node)
1000 lookup
= lookup_bucket(ht
, size
, bit_reverse_ulong(node
->p
.reverse_hash
));
1001 dummy
= (struct cds_lfht_node
*) lookup
;
1002 _cds_lfht_gc_bucket(dummy
, node
);
1005 * Only the flagging action indicated that we (and no other)
1006 * removed the node from the hash.
1009 assert(is_removed(rcu_dereference(node
->p
.next
)));
1017 void *partition_resize_thread(void *arg
)
1019 struct partition_resize_work
*work
= arg
;
1021 work
->ht
->cds_lfht_rcu_register_thread();
1022 work
->fct(work
->ht
, work
->i
, work
->start
, work
->len
);
1023 work
->ht
->cds_lfht_rcu_unregister_thread();
1028 void partition_resize_helper(struct cds_lfht
*ht
, unsigned long i
,
1030 void (*fct
)(struct cds_lfht
*ht
, unsigned long i
,
1031 unsigned long start
, unsigned long len
))
1033 unsigned long partition_len
;
1034 struct partition_resize_work
*work
;
1036 unsigned long nr_threads
;
1039 * Note: nr_cpus_mask + 1 is always power of 2.
1040 * We spawn just the number of threads we need to satisfy the minimum
1041 * partition size, up to the number of CPUs in the system.
1043 if (nr_cpus_mask
> 0) {
1044 nr_threads
= min(nr_cpus_mask
+ 1,
1045 len
>> MIN_PARTITION_PER_THREAD_ORDER
);
1049 partition_len
= len
>> get_count_order_ulong(nr_threads
);
1050 work
= calloc(nr_threads
, sizeof(*work
));
1052 for (thread
= 0; thread
< nr_threads
; thread
++) {
1053 work
[thread
].ht
= ht
;
1055 work
[thread
].len
= partition_len
;
1056 work
[thread
].start
= thread
* partition_len
;
1057 work
[thread
].fct
= fct
;
1058 ret
= pthread_create(&(work
[thread
].thread_id
), ht
->resize_attr
,
1059 partition_resize_thread
, &work
[thread
]);
1062 for (thread
= 0; thread
< nr_threads
; thread
++) {
1063 ret
= pthread_join(work
[thread
].thread_id
, NULL
);
1070 * Holding RCU read lock to protect _cds_lfht_add against memory
1071 * reclaim that could be performed by other call_rcu worker threads (ABA
1074 * When we reach a certain length, we can split this population phase over
1075 * many worker threads, based on the number of CPUs available in the system.
1076 * This should therefore take care of not having the expand lagging behind too
1077 * many concurrent insertion threads by using the scheduler's ability to
1078 * schedule dummy node population fairly with insertions.
1081 void init_table_populate_partition(struct cds_lfht
*ht
, unsigned long i
,
1082 unsigned long start
, unsigned long len
)
1086 ht
->cds_lfht_rcu_read_lock();
1087 for (j
= start
; j
< start
+ len
; j
++) {
1088 struct cds_lfht_node
*new_node
=
1089 (struct cds_lfht_node
*) &ht
->t
.tbl
[i
]->nodes
[j
];
1091 dbg_printf("init populate: i %lu j %lu hash %lu\n",
1092 i
, j
, !i
? 0 : (1UL << (i
- 1)) + j
);
1093 new_node
->p
.reverse_hash
=
1094 bit_reverse_ulong(!i
? 0 : (1UL << (i
- 1)) + j
);
1095 (void) _cds_lfht_add(ht
, !i
? 0 : (1UL << (i
- 1)),
1096 new_node
, ADD_DEFAULT
, 1);
1098 ht
->cds_lfht_rcu_read_unlock();
1102 void init_table_populate(struct cds_lfht
*ht
, unsigned long i
,
1105 assert(nr_cpus_mask
!= -1);
1106 if (nr_cpus_mask
< 0 || len
< 2 * MIN_PARTITION_PER_THREAD
) {
1107 ht
->cds_lfht_rcu_thread_online();
1108 init_table_populate_partition(ht
, i
, 0, len
);
1109 ht
->cds_lfht_rcu_thread_offline();
1112 partition_resize_helper(ht
, i
, len
, init_table_populate_partition
);
1116 void init_table(struct cds_lfht
*ht
,
1117 unsigned long first_order
, unsigned long len_order
)
1119 unsigned long i
, end_order
;
1121 dbg_printf("init table: first_order %lu end_order %lu\n",
1122 first_order
, first_order
+ len_order
);
1123 end_order
= first_order
+ len_order
;
1124 for (i
= first_order
; i
< end_order
; i
++) {
1127 len
= !i
? 1 : 1UL << (i
- 1);
1128 dbg_printf("init order %lu len: %lu\n", i
, len
);
1130 /* Stop expand if the resize target changes under us */
1131 if (CMM_LOAD_SHARED(ht
->t
.resize_target
) < (!i
? 1 : (1UL << i
)))
1134 ht
->t
.tbl
[i
] = calloc(1, len
* sizeof(struct _cds_lfht_node
));
1135 assert(ht
->t
.tbl
[i
]);
1138 * Set all dummy nodes reverse hash values for a level and
1139 * link all dummy nodes into the table.
1141 init_table_populate(ht
, i
, len
);
1144 * Update table size.
1146 cmm_smp_wmb(); /* populate data before RCU size */
1147 CMM_STORE_SHARED(ht
->t
.size
, !i
? 1 : (1UL << i
));
1149 dbg_printf("init new size: %lu\n", !i
? 1 : (1UL << i
));
1150 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1156 * Holding RCU read lock to protect _cds_lfht_remove against memory
1157 * reclaim that could be performed by other call_rcu worker threads (ABA
1159 * For a single level, we logically remove and garbage collect each node.
1161 * As a design choice, we perform logical removal and garbage collection on a
1162 * node-per-node basis to simplify this algorithm. We also assume keeping good
1163 * cache locality of the operation would overweight possible performance gain
1164 * that could be achieved by batching garbage collection for multiple levels.
1165 * However, this would have to be justified by benchmarks.
1167 * Concurrent removal and add operations are helping us perform garbage
1168 * collection of logically removed nodes. We guarantee that all logically
1169 * removed nodes have been garbage-collected (unlinked) before call_rcu is
1170 * invoked to free a hole level of dummy nodes (after a grace period).
1172 * Logical removal and garbage collection can therefore be done in batch or on a
1173 * node-per-node basis, as long as the guarantee above holds.
1175 * When we reach a certain length, we can split this removal over many worker
1176 * threads, based on the number of CPUs available in the system. This should
1177 * take care of not letting resize process lag behind too many concurrent
1178 * updater threads actively inserting into the hash table.
1181 void remove_table_partition(struct cds_lfht
*ht
, unsigned long i
,
1182 unsigned long start
, unsigned long len
)
1186 ht
->cds_lfht_rcu_read_lock();
1187 for (j
= start
; j
< start
+ len
; j
++) {
1188 struct cds_lfht_node
*fini_node
=
1189 (struct cds_lfht_node
*) &ht
->t
.tbl
[i
]->nodes
[j
];
1191 dbg_printf("remove entry: i %lu j %lu hash %lu\n",
1192 i
, j
, !i
? 0 : (1UL << (i
- 1)) + j
);
1193 fini_node
->p
.reverse_hash
=
1194 bit_reverse_ulong(!i
? 0 : (1UL << (i
- 1)) + j
);
1195 (void) _cds_lfht_del(ht
, !i
? 0 : (1UL << (i
- 1)),
1198 ht
->cds_lfht_rcu_read_unlock();
1202 void remove_table(struct cds_lfht
*ht
, unsigned long i
, unsigned long len
)
1205 assert(nr_cpus_mask
!= -1);
1206 if (nr_cpus_mask
< 0 || len
< 2 * MIN_PARTITION_PER_THREAD
) {
1207 ht
->cds_lfht_rcu_thread_online();
1208 remove_table_partition(ht
, i
, 0, len
);
1209 ht
->cds_lfht_rcu_thread_offline();
1212 partition_resize_helper(ht
, i
, len
, remove_table_partition
);
1216 void fini_table(struct cds_lfht
*ht
,
1217 unsigned long first_order
, unsigned long len_order
)
1220 void *free_by_rcu
= NULL
;
1222 dbg_printf("fini table: first_order %lu end_order %lu\n",
1223 first_order
, first_order
+ len_order
);
1224 end_order
= first_order
+ len_order
;
1225 assert(first_order
> 0);
1226 for (i
= end_order
- 1; i
>= first_order
; i
--) {
1229 len
= !i
? 1 : 1UL << (i
- 1);
1230 dbg_printf("fini order %lu len: %lu\n", i
, len
);
1232 /* Stop shrink if the resize target changes under us */
1233 if (CMM_LOAD_SHARED(ht
->t
.resize_target
) > (1UL << (i
- 1)))
1236 cmm_smp_wmb(); /* populate data before RCU size */
1237 CMM_STORE_SHARED(ht
->t
.size
, 1UL << (i
- 1));
1240 * We need to wait for all add operations to reach Q.S. (and
1241 * thus use the new table for lookups) before we can start
1242 * releasing the old dummy nodes. Otherwise their lookup will
1243 * return a logically removed node as insert position.
1245 ht
->cds_lfht_synchronize_rcu();
1250 * Set "removed" flag in dummy nodes about to be removed.
1251 * Unlink all now-logically-removed dummy node pointers.
1252 * Concurrent add/remove operation are helping us doing
1255 remove_table(ht
, i
, len
);
1257 free_by_rcu
= ht
->t
.tbl
[i
];
1259 dbg_printf("fini new size: %lu\n", 1UL << i
);
1260 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1265 ht
->cds_lfht_synchronize_rcu();
1270 struct cds_lfht
*_cds_lfht_new(cds_lfht_hash_fct hash_fct
,
1271 cds_lfht_compare_fct compare_fct
,
1272 unsigned long hash_seed
,
1273 unsigned long init_size
,
1275 void (*cds_lfht_call_rcu
)(struct rcu_head
*head
,
1276 void (*func
)(struct rcu_head
*head
)),
1277 void (*cds_lfht_synchronize_rcu
)(void),
1278 void (*cds_lfht_rcu_read_lock
)(void),
1279 void (*cds_lfht_rcu_read_unlock
)(void),
1280 void (*cds_lfht_rcu_thread_offline
)(void),
1281 void (*cds_lfht_rcu_thread_online
)(void),
1282 void (*cds_lfht_rcu_register_thread
)(void),
1283 void (*cds_lfht_rcu_unregister_thread
)(void),
1284 pthread_attr_t
*attr
)
1286 struct cds_lfht
*ht
;
1287 unsigned long order
;
1289 /* init_size must be power of two */
1290 if (init_size
&& (init_size
& (init_size
- 1)))
1292 ht
= calloc(1, sizeof(struct cds_lfht
));
1294 ht
->hash_fct
= hash_fct
;
1295 ht
->compare_fct
= compare_fct
;
1296 ht
->hash_seed
= hash_seed
;
1297 ht
->cds_lfht_call_rcu
= cds_lfht_call_rcu
;
1298 ht
->cds_lfht_synchronize_rcu
= cds_lfht_synchronize_rcu
;
1299 ht
->cds_lfht_rcu_read_lock
= cds_lfht_rcu_read_lock
;
1300 ht
->cds_lfht_rcu_read_unlock
= cds_lfht_rcu_read_unlock
;
1301 ht
->cds_lfht_rcu_thread_offline
= cds_lfht_rcu_thread_offline
;
1302 ht
->cds_lfht_rcu_thread_online
= cds_lfht_rcu_thread_online
;
1303 ht
->cds_lfht_rcu_register_thread
= cds_lfht_rcu_register_thread
;
1304 ht
->cds_lfht_rcu_unregister_thread
= cds_lfht_rcu_unregister_thread
;
1305 ht
->resize_attr
= attr
;
1306 ht
->percpu_count
= alloc_per_cpu_items_count();
1307 /* this mutex should not nest in read-side C.S. */
1308 pthread_mutex_init(&ht
->resize_mutex
, NULL
);
1309 order
= get_count_order_ulong(max(init_size
, MIN_TABLE_SIZE
)) + 1;
1311 ht
->cds_lfht_rcu_thread_offline();
1312 pthread_mutex_lock(&ht
->resize_mutex
);
1313 ht
->t
.resize_target
= 1UL << (order
- 1);
1314 init_table(ht
, 0, order
);
1315 pthread_mutex_unlock(&ht
->resize_mutex
);
1316 ht
->cds_lfht_rcu_thread_online();
1320 void cds_lfht_lookup(struct cds_lfht
*ht
, void *key
, size_t key_len
,
1321 struct cds_lfht_iter
*iter
)
1323 struct cds_lfht_node
*node
, *next
, *dummy_node
;
1324 struct _cds_lfht_node
*lookup
;
1325 unsigned long hash
, reverse_hash
, size
;
1327 hash
= ht
->hash_fct(key
, key_len
, ht
->hash_seed
);
1328 reverse_hash
= bit_reverse_ulong(hash
);
1330 size
= rcu_dereference(ht
->t
.size
);
1331 lookup
= lookup_bucket(ht
, size
, hash
);
1332 dummy_node
= (struct cds_lfht_node
*) lookup
;
1333 /* We can always skip the dummy node initially */
1334 node
= rcu_dereference(dummy_node
->p
.next
);
1335 node
= clear_flag(node
);
1337 if (unlikely(is_end(node
))) {
1341 if (unlikely(node
->p
.reverse_hash
> reverse_hash
)) {
1345 next
= rcu_dereference(node
->p
.next
);
1346 if (likely(!is_removed(next
))
1348 && clear_flag(node
)->p
.reverse_hash
== reverse_hash
1349 && likely(!ht
->compare_fct(node
->key
, node
->key_len
, key
, key_len
))) {
1352 node
= clear_flag(next
);
1354 assert(!node
|| !is_dummy(rcu_dereference(node
->p
.next
)));
1359 void cds_lfht_next_duplicate(struct cds_lfht
*ht
, struct cds_lfht_iter
*iter
)
1361 struct cds_lfht_node
*node
, *next
;
1362 unsigned long reverse_hash
;
1367 reverse_hash
= node
->p
.reverse_hash
;
1369 key_len
= node
->key_len
;
1371 node
= clear_flag(next
);
1374 if (unlikely(is_end(node
))) {
1378 if (unlikely(node
->p
.reverse_hash
> reverse_hash
)) {
1382 next
= rcu_dereference(node
->p
.next
);
1383 if (likely(!is_removed(next
))
1385 && likely(!ht
->compare_fct(node
->key
, node
->key_len
, key
, key_len
))) {
1388 node
= clear_flag(next
);
1390 assert(!node
|| !is_dummy(rcu_dereference(node
->p
.next
)));
1395 void cds_lfht_next(struct cds_lfht
*ht
, struct cds_lfht_iter
*iter
)
1397 struct cds_lfht_node
*node
, *next
;
1399 node
= clear_flag(iter
->next
);
1401 if (unlikely(is_end(node
))) {
1405 next
= rcu_dereference(node
->p
.next
);
1406 if (likely(!is_removed(next
))
1407 && !is_dummy(next
)) {
1410 node
= clear_flag(next
);
1412 assert(!node
|| !is_dummy(rcu_dereference(node
->p
.next
)));
1417 void cds_lfht_first(struct cds_lfht
*ht
, struct cds_lfht_iter
*iter
)
1419 struct _cds_lfht_node
*lookup
;
1422 * Get next after first dummy node. The first dummy node is the
1423 * first node of the linked list.
1425 lookup
= &ht
->t
.tbl
[0]->nodes
[0];
1426 iter
->next
= lookup
->next
;
1427 cds_lfht_next(ht
, iter
);
1430 void cds_lfht_add(struct cds_lfht
*ht
, struct cds_lfht_node
*node
)
1432 unsigned long hash
, size
;
1434 hash
= ht
->hash_fct(node
->key
, node
->key_len
, ht
->hash_seed
);
1435 node
->p
.reverse_hash
= bit_reverse_ulong((unsigned long) hash
);
1437 size
= rcu_dereference(ht
->t
.size
);
1438 (void) _cds_lfht_add(ht
, size
, node
, ADD_DEFAULT
, 0);
1439 ht_count_add(ht
, size
);
1442 struct cds_lfht_node
*cds_lfht_add_unique(struct cds_lfht
*ht
,
1443 struct cds_lfht_node
*node
)
1445 unsigned long hash
, size
;
1446 struct cds_lfht_node
*ret
;
1448 hash
= ht
->hash_fct(node
->key
, node
->key_len
, ht
->hash_seed
);
1449 node
->p
.reverse_hash
= bit_reverse_ulong((unsigned long) hash
);
1451 size
= rcu_dereference(ht
->t
.size
);
1452 ret
= _cds_lfht_add(ht
, size
, node
, ADD_UNIQUE
, 0);
1454 ht_count_add(ht
, size
);
1458 struct cds_lfht_node
*cds_lfht_add_replace(struct cds_lfht
*ht
,
1459 struct cds_lfht_node
*node
)
1461 unsigned long hash
, size
;
1462 struct cds_lfht_node
*ret
;
1464 hash
= ht
->hash_fct(node
->key
, node
->key_len
, ht
->hash_seed
);
1465 node
->p
.reverse_hash
= bit_reverse_ulong((unsigned long) hash
);
1467 size
= rcu_dereference(ht
->t
.size
);
1468 ret
= _cds_lfht_add(ht
, size
, node
, ADD_REPLACE
, 0);
1470 ht_count_add(ht
, size
);
1474 int cds_lfht_replace(struct cds_lfht
*ht
, struct cds_lfht_iter
*old_iter
,
1475 struct cds_lfht_node
*new_node
)
1479 size
= rcu_dereference(ht
->t
.size
);
1480 return _cds_lfht_replace(ht
, size
, old_iter
->node
, old_iter
->next
,
1484 int cds_lfht_del(struct cds_lfht
*ht
, struct cds_lfht_iter
*iter
)
1489 size
= rcu_dereference(ht
->t
.size
);
1490 ret
= _cds_lfht_del(ht
, size
, iter
->node
, 0);
1492 ht_count_del(ht
, size
);
1497 int cds_lfht_delete_dummy(struct cds_lfht
*ht
)
1499 struct cds_lfht_node
*node
;
1500 struct _cds_lfht_node
*lookup
;
1501 unsigned long order
, i
, size
;
1503 /* Check that the table is empty */
1504 lookup
= &ht
->t
.tbl
[0]->nodes
[0];
1505 node
= (struct cds_lfht_node
*) lookup
;
1507 node
= clear_flag(node
)->p
.next
;
1508 if (!is_dummy(node
))
1510 assert(!is_removed(node
));
1511 } while (!is_end(node
));
1513 * size accessed without rcu_dereference because hash table is
1517 /* Internal sanity check: all nodes left should be dummy */
1518 for (order
= 0; order
< get_count_order_ulong(size
) + 1; order
++) {
1521 len
= !order
? 1 : 1UL << (order
- 1);
1522 for (i
= 0; i
< len
; i
++) {
1523 dbg_printf("delete order %lu i %lu hash %lu\n",
1525 bit_reverse_ulong(ht
->t
.tbl
[order
]->nodes
[i
].reverse_hash
));
1526 assert(is_dummy(ht
->t
.tbl
[order
]->nodes
[i
].next
));
1528 poison_free(ht
->t
.tbl
[order
]);
1534 * Should only be called when no more concurrent readers nor writers can
1535 * possibly access the table.
1537 int cds_lfht_destroy(struct cds_lfht
*ht
, pthread_attr_t
**attr
)
1541 /* Wait for in-flight resize operations to complete */
1542 _CMM_STORE_SHARED(ht
->in_progress_destroy
, 1);
1543 cmm_smp_mb(); /* Store destroy before load resize */
1544 while (uatomic_read(&ht
->in_progress_resize
))
1545 poll(NULL
, 0, 100); /* wait for 100ms */
1546 ret
= cds_lfht_delete_dummy(ht
);
1549 free_per_cpu_items_count(ht
->percpu_count
);
1551 *attr
= ht
->resize_attr
;
1556 void cds_lfht_count_nodes(struct cds_lfht
*ht
,
1557 long *approx_before
,
1558 unsigned long *count
,
1559 unsigned long *removed
,
1562 struct cds_lfht_node
*node
, *next
;
1563 struct _cds_lfht_node
*lookup
;
1564 unsigned long nr_dummy
= 0;
1567 if (nr_cpus_mask
>= 0) {
1570 for (i
= 0; i
< nr_cpus_mask
+ 1; i
++) {
1571 *approx_before
+= uatomic_read(&ht
->percpu_count
[i
].add
);
1572 *approx_before
-= uatomic_read(&ht
->percpu_count
[i
].del
);
1579 /* Count non-dummy nodes in the table */
1580 lookup
= &ht
->t
.tbl
[0]->nodes
[0];
1581 node
= (struct cds_lfht_node
*) lookup
;
1583 next
= rcu_dereference(node
->p
.next
);
1584 if (is_removed(next
)) {
1585 if (!is_dummy(next
))
1589 } else if (!is_dummy(next
))
1593 node
= clear_flag(next
);
1594 } while (!is_end(node
));
1595 dbg_printf("number of dummy nodes: %lu\n", nr_dummy
);
1597 if (nr_cpus_mask
>= 0) {
1600 for (i
= 0; i
< nr_cpus_mask
+ 1; i
++) {
1601 *approx_after
+= uatomic_read(&ht
->percpu_count
[i
].add
);
1602 *approx_after
-= uatomic_read(&ht
->percpu_count
[i
].del
);
1607 /* called with resize mutex held */
1609 void _do_cds_lfht_grow(struct cds_lfht
*ht
,
1610 unsigned long old_size
, unsigned long new_size
)
1612 unsigned long old_order
, new_order
;
1614 old_order
= get_count_order_ulong(old_size
) + 1;
1615 new_order
= get_count_order_ulong(new_size
) + 1;
1616 dbg_printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n",
1617 old_size
, old_order
, new_size
, new_order
);
1618 assert(new_size
> old_size
);
1619 init_table(ht
, old_order
, new_order
- old_order
);
1622 /* called with resize mutex held */
1624 void _do_cds_lfht_shrink(struct cds_lfht
*ht
,
1625 unsigned long old_size
, unsigned long new_size
)
1627 unsigned long old_order
, new_order
;
1629 new_size
= max(new_size
, MIN_TABLE_SIZE
);
1630 old_order
= get_count_order_ulong(old_size
) + 1;
1631 new_order
= get_count_order_ulong(new_size
) + 1;
1632 dbg_printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n",
1633 old_size
, old_order
, new_size
, new_order
);
1634 assert(new_size
< old_size
);
1636 /* Remove and unlink all dummy nodes to remove. */
1637 fini_table(ht
, new_order
, old_order
- new_order
);
1641 /* called with resize mutex held */
1643 void _do_cds_lfht_resize(struct cds_lfht
*ht
)
1645 unsigned long new_size
, old_size
;
1648 * Resize table, re-do if the target size has changed under us.
1651 assert(uatomic_read(&ht
->in_progress_resize
));
1652 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
))
1654 ht
->t
.resize_initiated
= 1;
1655 old_size
= ht
->t
.size
;
1656 new_size
= CMM_LOAD_SHARED(ht
->t
.resize_target
);
1657 if (old_size
< new_size
)
1658 _do_cds_lfht_grow(ht
, old_size
, new_size
);
1659 else if (old_size
> new_size
)
1660 _do_cds_lfht_shrink(ht
, old_size
, new_size
);
1661 ht
->t
.resize_initiated
= 0;
1662 /* write resize_initiated before read resize_target */
1664 } while (ht
->t
.size
!= CMM_LOAD_SHARED(ht
->t
.resize_target
));
1668 unsigned long resize_target_update(struct cds_lfht
*ht
, unsigned long size
,
1671 return _uatomic_max(&ht
->t
.resize_target
,
1672 size
<< growth_order
);
1676 void resize_target_update_count(struct cds_lfht
*ht
,
1677 unsigned long count
)
1679 count
= max(count
, MIN_TABLE_SIZE
);
1680 uatomic_set(&ht
->t
.resize_target
, count
);
1683 void cds_lfht_resize(struct cds_lfht
*ht
, unsigned long new_size
)
1685 resize_target_update_count(ht
, new_size
);
1686 CMM_STORE_SHARED(ht
->t
.resize_initiated
, 1);
1687 ht
->cds_lfht_rcu_thread_offline();
1688 pthread_mutex_lock(&ht
->resize_mutex
);
1689 _do_cds_lfht_resize(ht
);
1690 pthread_mutex_unlock(&ht
->resize_mutex
);
1691 ht
->cds_lfht_rcu_thread_online();
1695 void do_resize_cb(struct rcu_head
*head
)
1697 struct rcu_resize_work
*work
=
1698 caa_container_of(head
, struct rcu_resize_work
, head
);
1699 struct cds_lfht
*ht
= work
->ht
;
1701 ht
->cds_lfht_rcu_thread_offline();
1702 pthread_mutex_lock(&ht
->resize_mutex
);
1703 _do_cds_lfht_resize(ht
);
1704 pthread_mutex_unlock(&ht
->resize_mutex
);
1705 ht
->cds_lfht_rcu_thread_online();
1707 cmm_smp_mb(); /* finish resize before decrement */
1708 uatomic_dec(&ht
->in_progress_resize
);
1712 void cds_lfht_resize_lazy(struct cds_lfht
*ht
, unsigned long size
, int growth
)
1714 struct rcu_resize_work
*work
;
1715 unsigned long target_size
;
1717 target_size
= resize_target_update(ht
, size
, growth
);
1718 /* Store resize_target before read resize_initiated */
1720 if (!CMM_LOAD_SHARED(ht
->t
.resize_initiated
) && size
< target_size
) {
1721 uatomic_inc(&ht
->in_progress_resize
);
1722 cmm_smp_mb(); /* increment resize count before load destroy */
1723 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
)) {
1724 uatomic_dec(&ht
->in_progress_resize
);
1727 work
= malloc(sizeof(*work
));
1729 ht
->cds_lfht_call_rcu(&work
->head
, do_resize_cb
);
1730 CMM_STORE_SHARED(ht
->t
.resize_initiated
, 1);
1734 #if defined(HAVE_SCHED_GETCPU) && defined(HAVE_SYSCONF)
1737 void cds_lfht_resize_lazy_count(struct cds_lfht
*ht
, unsigned long size
,
1738 unsigned long count
)
1740 struct rcu_resize_work
*work
;
1742 if (!(ht
->flags
& CDS_LFHT_AUTO_RESIZE
))
1744 resize_target_update_count(ht
, count
);
1745 /* Store resize_target before read resize_initiated */
1747 if (!CMM_LOAD_SHARED(ht
->t
.resize_initiated
)) {
1748 uatomic_inc(&ht
->in_progress_resize
);
1749 cmm_smp_mb(); /* increment resize count before load destroy */
1750 if (CMM_LOAD_SHARED(ht
->in_progress_destroy
)) {
1751 uatomic_dec(&ht
->in_progress_resize
);
1754 work
= malloc(sizeof(*work
));
1756 ht
->cds_lfht_call_rcu(&work
->head
, do_resize_cb
);
1757 CMM_STORE_SHARED(ht
->t
.resize_initiated
, 1);