| 1 | /* |
| 2 | * rculfhash.c |
| 3 | * |
| 4 | * Userspace RCU library - Lock-Free Resizable RCU Hash Table |
| 5 | * |
| 6 | * Copyright 2010-2011 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com> |
| 7 | * |
| 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. |
| 12 | * |
| 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. |
| 17 | * |
| 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 |
| 21 | */ |
| 22 | |
| 23 | /* |
| 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, |
| 30 | * (2002), 73-82. |
| 31 | * |
| 32 | * Some specificities of this Lock-Free Resizable RCU Hash Table |
| 33 | * implementation: |
| 34 | * |
| 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 |
| 44 | * duplicata exists. |
| 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 |
| 53 | * operation. |
| 54 | * - The resize operation for larger tables (and available through an |
| 55 | * API) allows both expanding and shrinking the hash table. |
| 56 | * - 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 |
| 83 | * list concurrently. |
| 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 |
| 88 | * for it do to so. |
| 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 |
| 94 | * this order (except for order 0). |
| 95 | * - synchronzie_rcu is used to garbage-collect the old dummy node 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. |
| 99 | * |
| 100 | * Dummy node tables: |
| 101 | * |
| 102 | * hash table hash table the last all dummy node tables |
| 103 | * order size dummy node 0 1 2 3 4 5 6(index) |
| 104 | * table size |
| 105 | * 0 1 1 1 |
| 106 | * 1 2 1 1 1 |
| 107 | * 2 4 2 1 1 2 |
| 108 | * 3 8 4 1 1 2 4 |
| 109 | * 4 16 8 1 1 2 4 8 |
| 110 | * 5 32 16 1 1 2 4 8 16 |
| 111 | * 6 64 32 1 1 2 4 8 16 32 |
| 112 | * |
| 113 | * When growing/shrinking, we only focus on the last dummy node table |
| 114 | * which size is (!order ? 1 : (1 << (order -1))). |
| 115 | * |
| 116 | * Example for growing/shrinking: |
| 117 | * grow hash table from order 5 to 6: init the index=6 dummy node table |
| 118 | * shrink hash table from order 6 to 5: fini the index=6 dummy node table |
| 119 | * |
| 120 | * A bit of ascii art explanation: |
| 121 | * |
| 122 | * Order index is the off-by-one compare to the actual power of 2 because |
| 123 | * we use index 0 to deal with the 0 special-case. |
| 124 | * |
| 125 | * This shows the nodes for a small table ordered by reversed bits: |
| 126 | * |
| 127 | * bits reverse |
| 128 | * 0 000 000 |
| 129 | * 4 100 001 |
| 130 | * 2 010 010 |
| 131 | * 6 110 011 |
| 132 | * 1 001 100 |
| 133 | * 5 101 101 |
| 134 | * 3 011 110 |
| 135 | * 7 111 111 |
| 136 | * |
| 137 | * This shows the nodes in order of non-reversed bits, linked by |
| 138 | * reversed-bit order. |
| 139 | * |
| 140 | * order bits reverse |
| 141 | * 0 0 000 000 |
| 142 | * 1 | 1 001 100 <- |
| 143 | * 2 | | 2 010 010 <- | |
| 144 | * | | | 3 011 110 | <- | |
| 145 | * 3 -> | | | 4 100 001 | | |
| 146 | * -> | | 5 101 101 | |
| 147 | * -> | 6 110 011 |
| 148 | * -> 7 111 111 |
| 149 | */ |
| 150 | |
| 151 | #define _LGPL_SOURCE |
| 152 | #include <stdlib.h> |
| 153 | #include <errno.h> |
| 154 | #include <assert.h> |
| 155 | #include <stdio.h> |
| 156 | #include <stdint.h> |
| 157 | #include <string.h> |
| 158 | |
| 159 | #include "config.h" |
| 160 | #include <urcu.h> |
| 161 | #include <urcu-call-rcu.h> |
| 162 | #include <urcu/arch.h> |
| 163 | #include <urcu/uatomic.h> |
| 164 | #include <urcu/compiler.h> |
| 165 | #include <urcu/rculfhash.h> |
| 166 | #include <stdio.h> |
| 167 | #include <pthread.h> |
| 168 | |
| 169 | #ifdef DEBUG |
| 170 | #define dbg_printf(fmt, args...) printf("[debug rculfhash] " fmt, ## args) |
| 171 | #else |
| 172 | #define dbg_printf(fmt, args...) |
| 173 | #endif |
| 174 | |
| 175 | /* |
| 176 | * Split-counters lazily update the global counter each 1024 |
| 177 | * addition/removal. It automatically keeps track of resize required. |
| 178 | * We use the bucket length as indicator for need to expand for small |
| 179 | * tables and machines lacking per-cpu data suppport. |
| 180 | */ |
| 181 | #define COUNT_COMMIT_ORDER 10 |
| 182 | #define DEFAULT_SPLIT_COUNT_MASK 0xFUL |
| 183 | #define CHAIN_LEN_TARGET 1 |
| 184 | #define CHAIN_LEN_RESIZE_THRESHOLD 3 |
| 185 | |
| 186 | /* |
| 187 | * Define the minimum table size. |
| 188 | */ |
| 189 | #define MIN_TABLE_SIZE 1 |
| 190 | |
| 191 | #if (CAA_BITS_PER_LONG == 32) |
| 192 | #define MAX_TABLE_ORDER 32 |
| 193 | #else |
| 194 | #define MAX_TABLE_ORDER 64 |
| 195 | #endif |
| 196 | |
| 197 | /* |
| 198 | * Minimum number of dummy nodes to touch per thread to parallelize grow/shrink. |
| 199 | */ |
| 200 | #define MIN_PARTITION_PER_THREAD_ORDER 12 |
| 201 | #define MIN_PARTITION_PER_THREAD (1UL << MIN_PARTITION_PER_THREAD_ORDER) |
| 202 | |
| 203 | #ifndef min |
| 204 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
| 205 | #endif |
| 206 | |
| 207 | #ifndef max |
| 208 | #define max(a, b) ((a) > (b) ? (a) : (b)) |
| 209 | #endif |
| 210 | |
| 211 | /* |
| 212 | * The removed flag needs to be updated atomically with the pointer. |
| 213 | * It indicates that no node must attach to the node scheduled for |
| 214 | * removal, and that node garbage collection must be performed. |
| 215 | * The dummy flag does not require to be updated atomically with the |
| 216 | * pointer, but it is added as a pointer low bit flag to save space. |
| 217 | */ |
| 218 | #define REMOVED_FLAG (1UL << 0) |
| 219 | #define DUMMY_FLAG (1UL << 1) |
| 220 | #define FLAGS_MASK ((1UL << 2) - 1) |
| 221 | |
| 222 | /* Value of the end pointer. Should not interact with flags. */ |
| 223 | #define END_VALUE NULL |
| 224 | |
| 225 | /* |
| 226 | * ht_items_count: Split-counters counting the number of node addition |
| 227 | * and removal in the table. Only used if the CDS_LFHT_ACCOUNTING flag |
| 228 | * is set at hash table creation. |
| 229 | * |
| 230 | * These are free-running counters, never reset to zero. They count the |
| 231 | * number of add/remove, and trigger every (1 << COUNT_COMMIT_ORDER) |
| 232 | * operations to update the global counter. We choose a power-of-2 value |
| 233 | * for the trigger to deal with 32 or 64-bit overflow of the counter. |
| 234 | */ |
| 235 | struct ht_items_count { |
| 236 | unsigned long add, del; |
| 237 | } __attribute__((aligned(CAA_CACHE_LINE_SIZE))); |
| 238 | |
| 239 | /* |
| 240 | * rcu_level: Contains the per order-index-level dummy node table. The |
| 241 | * size of each dummy node table is half the number of hashes contained |
| 242 | * in this order (except for order 0). The minimum allocation size |
| 243 | * parameter allows combining the dummy node arrays of the lowermost |
| 244 | * levels to improve cache locality for small index orders. |
| 245 | */ |
| 246 | struct rcu_level { |
| 247 | /* Note: manually update allocation length when adding a field */ |
| 248 | struct _cds_lfht_node nodes[0]; |
| 249 | }; |
| 250 | |
| 251 | /* |
| 252 | * rcu_table: Contains the size and desired new size if a resize |
| 253 | * operation is in progress, as well as the statically-sized array of |
| 254 | * rcu_level pointers. |
| 255 | */ |
| 256 | struct rcu_table { |
| 257 | unsigned long size; /* always a power of 2, shared (RCU) */ |
| 258 | unsigned long resize_target; |
| 259 | int resize_initiated; |
| 260 | struct rcu_level *tbl[MAX_TABLE_ORDER]; |
| 261 | }; |
| 262 | |
| 263 | /* |
| 264 | * cds_lfht: Top-level data structure representing a lock-free hash |
| 265 | * table. Defined in the implementation file to make it be an opaque |
| 266 | * cookie to users. |
| 267 | */ |
| 268 | struct cds_lfht { |
| 269 | struct rcu_table t; |
| 270 | cds_lfht_hash_fct hash_fct; |
| 271 | cds_lfht_compare_fct compare_fct; |
| 272 | unsigned long min_alloc_order; |
| 273 | unsigned long min_alloc_size; |
| 274 | unsigned long hash_seed; |
| 275 | int flags; |
| 276 | /* |
| 277 | * We need to put the work threads offline (QSBR) when taking this |
| 278 | * mutex, because we use synchronize_rcu within this mutex critical |
| 279 | * section, which waits on read-side critical sections, and could |
| 280 | * therefore cause grace-period deadlock if we hold off RCU G.P. |
| 281 | * completion. |
| 282 | */ |
| 283 | pthread_mutex_t resize_mutex; /* resize mutex: add/del mutex */ |
| 284 | unsigned int in_progress_resize, in_progress_destroy; |
| 285 | void (*cds_lfht_call_rcu)(struct rcu_head *head, |
| 286 | void (*func)(struct rcu_head *head)); |
| 287 | void (*cds_lfht_synchronize_rcu)(void); |
| 288 | void (*cds_lfht_rcu_read_lock)(void); |
| 289 | void (*cds_lfht_rcu_read_unlock)(void); |
| 290 | void (*cds_lfht_rcu_thread_offline)(void); |
| 291 | void (*cds_lfht_rcu_thread_online)(void); |
| 292 | void (*cds_lfht_rcu_register_thread)(void); |
| 293 | void (*cds_lfht_rcu_unregister_thread)(void); |
| 294 | pthread_attr_t *resize_attr; /* Resize threads attributes */ |
| 295 | long count; /* global approximate item count */ |
| 296 | struct ht_items_count *split_count; /* split item count */ |
| 297 | }; |
| 298 | |
| 299 | /* |
| 300 | * rcu_resize_work: Contains arguments passed to RCU worker thread |
| 301 | * responsible for performing lazy resize. |
| 302 | */ |
| 303 | struct rcu_resize_work { |
| 304 | struct rcu_head head; |
| 305 | struct cds_lfht *ht; |
| 306 | }; |
| 307 | |
| 308 | /* |
| 309 | * partition_resize_work: Contains arguments passed to worker threads |
| 310 | * executing the hash table resize on partitions of the hash table |
| 311 | * assigned to each processor's worker thread. |
| 312 | */ |
| 313 | struct partition_resize_work { |
| 314 | pthread_t thread_id; |
| 315 | struct cds_lfht *ht; |
| 316 | unsigned long i, start, len; |
| 317 | void (*fct)(struct cds_lfht *ht, unsigned long i, |
| 318 | unsigned long start, unsigned long len); |
| 319 | }; |
| 320 | |
| 321 | static |
| 322 | void _cds_lfht_add(struct cds_lfht *ht, |
| 323 | unsigned long size, |
| 324 | struct cds_lfht_node *node, |
| 325 | struct cds_lfht_iter *unique_ret, |
| 326 | int dummy); |
| 327 | |
| 328 | /* |
| 329 | * Algorithm to reverse bits in a word by lookup table, extended to |
| 330 | * 64-bit words. |
| 331 | * Source: |
| 332 | * http://graphics.stanford.edu/~seander/bithacks.html#BitReverseTable |
| 333 | * Originally from Public Domain. |
| 334 | */ |
| 335 | |
| 336 | static const uint8_t BitReverseTable256[256] = |
| 337 | { |
| 338 | #define R2(n) (n), (n) + 2*64, (n) + 1*64, (n) + 3*64 |
| 339 | #define R4(n) R2(n), R2((n) + 2*16), R2((n) + 1*16), R2((n) + 3*16) |
| 340 | #define R6(n) R4(n), R4((n) + 2*4 ), R4((n) + 1*4 ), R4((n) + 3*4 ) |
| 341 | R6(0), R6(2), R6(1), R6(3) |
| 342 | }; |
| 343 | #undef R2 |
| 344 | #undef R4 |
| 345 | #undef R6 |
| 346 | |
| 347 | static |
| 348 | uint8_t bit_reverse_u8(uint8_t v) |
| 349 | { |
| 350 | return BitReverseTable256[v]; |
| 351 | } |
| 352 | |
| 353 | static __attribute__((unused)) |
| 354 | uint32_t bit_reverse_u32(uint32_t v) |
| 355 | { |
| 356 | return ((uint32_t) bit_reverse_u8(v) << 24) | |
| 357 | ((uint32_t) bit_reverse_u8(v >> 8) << 16) | |
| 358 | ((uint32_t) bit_reverse_u8(v >> 16) << 8) | |
| 359 | ((uint32_t) bit_reverse_u8(v >> 24)); |
| 360 | } |
| 361 | |
| 362 | static __attribute__((unused)) |
| 363 | uint64_t bit_reverse_u64(uint64_t v) |
| 364 | { |
| 365 | return ((uint64_t) bit_reverse_u8(v) << 56) | |
| 366 | ((uint64_t) bit_reverse_u8(v >> 8) << 48) | |
| 367 | ((uint64_t) bit_reverse_u8(v >> 16) << 40) | |
| 368 | ((uint64_t) bit_reverse_u8(v >> 24) << 32) | |
| 369 | ((uint64_t) bit_reverse_u8(v >> 32) << 24) | |
| 370 | ((uint64_t) bit_reverse_u8(v >> 40) << 16) | |
| 371 | ((uint64_t) bit_reverse_u8(v >> 48) << 8) | |
| 372 | ((uint64_t) bit_reverse_u8(v >> 56)); |
| 373 | } |
| 374 | |
| 375 | static |
| 376 | unsigned long bit_reverse_ulong(unsigned long v) |
| 377 | { |
| 378 | #if (CAA_BITS_PER_LONG == 32) |
| 379 | return bit_reverse_u32(v); |
| 380 | #else |
| 381 | return bit_reverse_u64(v); |
| 382 | #endif |
| 383 | } |
| 384 | |
| 385 | /* |
| 386 | * fls: returns the position of the most significant bit. |
| 387 | * Returns 0 if no bit is set, else returns the position of the most |
| 388 | * significant bit (from 1 to 32 on 32-bit, from 1 to 64 on 64-bit). |
| 389 | */ |
| 390 | #if defined(__i386) || defined(__x86_64) |
| 391 | static inline |
| 392 | unsigned int fls_u32(uint32_t x) |
| 393 | { |
| 394 | int r; |
| 395 | |
| 396 | asm("bsrl %1,%0\n\t" |
| 397 | "jnz 1f\n\t" |
| 398 | "movl $-1,%0\n\t" |
| 399 | "1:\n\t" |
| 400 | : "=r" (r) : "rm" (x)); |
| 401 | return r + 1; |
| 402 | } |
| 403 | #define HAS_FLS_U32 |
| 404 | #endif |
| 405 | |
| 406 | #if defined(__x86_64) |
| 407 | static inline |
| 408 | unsigned int fls_u64(uint64_t x) |
| 409 | { |
| 410 | long r; |
| 411 | |
| 412 | asm("bsrq %1,%0\n\t" |
| 413 | "jnz 1f\n\t" |
| 414 | "movq $-1,%0\n\t" |
| 415 | "1:\n\t" |
| 416 | : "=r" (r) : "rm" (x)); |
| 417 | return r + 1; |
| 418 | } |
| 419 | #define HAS_FLS_U64 |
| 420 | #endif |
| 421 | |
| 422 | #ifndef HAS_FLS_U64 |
| 423 | static __attribute__((unused)) |
| 424 | unsigned int fls_u64(uint64_t x) |
| 425 | { |
| 426 | unsigned int r = 64; |
| 427 | |
| 428 | if (!x) |
| 429 | return 0; |
| 430 | |
| 431 | if (!(x & 0xFFFFFFFF00000000ULL)) { |
| 432 | x <<= 32; |
| 433 | r -= 32; |
| 434 | } |
| 435 | if (!(x & 0xFFFF000000000000ULL)) { |
| 436 | x <<= 16; |
| 437 | r -= 16; |
| 438 | } |
| 439 | if (!(x & 0xFF00000000000000ULL)) { |
| 440 | x <<= 8; |
| 441 | r -= 8; |
| 442 | } |
| 443 | if (!(x & 0xF000000000000000ULL)) { |
| 444 | x <<= 4; |
| 445 | r -= 4; |
| 446 | } |
| 447 | if (!(x & 0xC000000000000000ULL)) { |
| 448 | x <<= 2; |
| 449 | r -= 2; |
| 450 | } |
| 451 | if (!(x & 0x8000000000000000ULL)) { |
| 452 | x <<= 1; |
| 453 | r -= 1; |
| 454 | } |
| 455 | return r; |
| 456 | } |
| 457 | #endif |
| 458 | |
| 459 | #ifndef HAS_FLS_U32 |
| 460 | static __attribute__((unused)) |
| 461 | unsigned int fls_u32(uint32_t x) |
| 462 | { |
| 463 | unsigned int r = 32; |
| 464 | |
| 465 | if (!x) |
| 466 | return 0; |
| 467 | if (!(x & 0xFFFF0000U)) { |
| 468 | x <<= 16; |
| 469 | r -= 16; |
| 470 | } |
| 471 | if (!(x & 0xFF000000U)) { |
| 472 | x <<= 8; |
| 473 | r -= 8; |
| 474 | } |
| 475 | if (!(x & 0xF0000000U)) { |
| 476 | x <<= 4; |
| 477 | r -= 4; |
| 478 | } |
| 479 | if (!(x & 0xC0000000U)) { |
| 480 | x <<= 2; |
| 481 | r -= 2; |
| 482 | } |
| 483 | if (!(x & 0x80000000U)) { |
| 484 | x <<= 1; |
| 485 | r -= 1; |
| 486 | } |
| 487 | return r; |
| 488 | } |
| 489 | #endif |
| 490 | |
| 491 | unsigned int fls_ulong(unsigned long x) |
| 492 | { |
| 493 | #if (CAA_BITS_PER_LONG == 32) |
| 494 | return fls_u32(x); |
| 495 | #else |
| 496 | return fls_u64(x); |
| 497 | #endif |
| 498 | } |
| 499 | |
| 500 | /* |
| 501 | * Return the minimum order for which x <= (1UL << order). |
| 502 | * Return -1 if x is 0. |
| 503 | */ |
| 504 | int get_count_order_u32(uint32_t x) |
| 505 | { |
| 506 | if (!x) |
| 507 | return -1; |
| 508 | |
| 509 | return fls_u32(x - 1); |
| 510 | } |
| 511 | |
| 512 | /* |
| 513 | * Return the minimum order for which x <= (1UL << order). |
| 514 | * Return -1 if x is 0. |
| 515 | */ |
| 516 | int get_count_order_ulong(unsigned long x) |
| 517 | { |
| 518 | if (!x) |
| 519 | return -1; |
| 520 | |
| 521 | return fls_ulong(x - 1); |
| 522 | } |
| 523 | |
| 524 | #ifdef POISON_FREE |
| 525 | #define poison_free(ptr) \ |
| 526 | do { \ |
| 527 | if (ptr) { \ |
| 528 | memset(ptr, 0x42, sizeof(*(ptr))); \ |
| 529 | free(ptr); \ |
| 530 | } \ |
| 531 | } while (0) |
| 532 | #else |
| 533 | #define poison_free(ptr) free(ptr) |
| 534 | #endif |
| 535 | |
| 536 | static |
| 537 | void cds_lfht_resize_lazy_grow(struct cds_lfht *ht, unsigned long size, int growth); |
| 538 | |
| 539 | static |
| 540 | void cds_lfht_resize_lazy_count(struct cds_lfht *ht, unsigned long size, |
| 541 | unsigned long count); |
| 542 | |
| 543 | static long nr_cpus_mask = -1; |
| 544 | static long split_count_mask = -1; |
| 545 | |
| 546 | #if defined(HAVE_SYSCONF) |
| 547 | static void ht_init_nr_cpus_mask(void) |
| 548 | { |
| 549 | long maxcpus; |
| 550 | |
| 551 | maxcpus = sysconf(_SC_NPROCESSORS_CONF); |
| 552 | if (maxcpus <= 0) { |
| 553 | nr_cpus_mask = -2; |
| 554 | return; |
| 555 | } |
| 556 | /* |
| 557 | * round up number of CPUs to next power of two, so we |
| 558 | * can use & for modulo. |
| 559 | */ |
| 560 | maxcpus = 1UL << get_count_order_ulong(maxcpus); |
| 561 | nr_cpus_mask = maxcpus - 1; |
| 562 | } |
| 563 | #else /* #if defined(HAVE_SYSCONF) */ |
| 564 | static void ht_init_nr_cpus_mask(void) |
| 565 | { |
| 566 | nr_cpus_mask = -2; |
| 567 | } |
| 568 | #endif /* #else #if defined(HAVE_SYSCONF) */ |
| 569 | |
| 570 | static |
| 571 | void alloc_split_items_count(struct cds_lfht *ht) |
| 572 | { |
| 573 | struct ht_items_count *count; |
| 574 | |
| 575 | if (nr_cpus_mask == -1) { |
| 576 | ht_init_nr_cpus_mask(); |
| 577 | if (nr_cpus_mask < 0) |
| 578 | split_count_mask = DEFAULT_SPLIT_COUNT_MASK; |
| 579 | else |
| 580 | split_count_mask = nr_cpus_mask; |
| 581 | } |
| 582 | |
| 583 | assert(split_count_mask >= 0); |
| 584 | |
| 585 | if (ht->flags & CDS_LFHT_ACCOUNTING) { |
| 586 | ht->split_count = calloc(split_count_mask + 1, sizeof(*count)); |
| 587 | assert(ht->split_count); |
| 588 | } else { |
| 589 | ht->split_count = NULL; |
| 590 | } |
| 591 | } |
| 592 | |
| 593 | static |
| 594 | void free_split_items_count(struct cds_lfht *ht) |
| 595 | { |
| 596 | poison_free(ht->split_count); |
| 597 | } |
| 598 | |
| 599 | #if defined(HAVE_SCHED_GETCPU) |
| 600 | static |
| 601 | int ht_get_split_count_index(unsigned long hash) |
| 602 | { |
| 603 | int cpu; |
| 604 | |
| 605 | assert(split_count_mask >= 0); |
| 606 | cpu = sched_getcpu(); |
| 607 | if (caa_unlikely(cpu < 0)) |
| 608 | return hash & split_count_mask; |
| 609 | else |
| 610 | return cpu & split_count_mask; |
| 611 | } |
| 612 | #else /* #if defined(HAVE_SCHED_GETCPU) */ |
| 613 | static |
| 614 | int ht_get_split_count_index(unsigned long hash) |
| 615 | { |
| 616 | return hash & split_count_mask; |
| 617 | } |
| 618 | #endif /* #else #if defined(HAVE_SCHED_GETCPU) */ |
| 619 | |
| 620 | static |
| 621 | void ht_count_add(struct cds_lfht *ht, unsigned long size, unsigned long hash) |
| 622 | { |
| 623 | unsigned long split_count; |
| 624 | int index; |
| 625 | |
| 626 | if (caa_unlikely(!ht->split_count)) |
| 627 | return; |
| 628 | index = ht_get_split_count_index(hash); |
| 629 | split_count = uatomic_add_return(&ht->split_count[index].add, 1); |
| 630 | if (caa_unlikely(!(split_count & ((1UL << COUNT_COMMIT_ORDER) - 1)))) { |
| 631 | long count; |
| 632 | |
| 633 | dbg_printf("add split count %lu\n", split_count); |
| 634 | count = uatomic_add_return(&ht->count, |
| 635 | 1UL << COUNT_COMMIT_ORDER); |
| 636 | /* If power of 2 */ |
| 637 | if (!(count & (count - 1))) { |
| 638 | if ((count >> CHAIN_LEN_RESIZE_THRESHOLD) < size) |
| 639 | return; |
| 640 | dbg_printf("add set global %ld\n", count); |
| 641 | cds_lfht_resize_lazy_count(ht, size, |
| 642 | count >> (CHAIN_LEN_TARGET - 1)); |
| 643 | } |
| 644 | } |
| 645 | } |
| 646 | |
| 647 | static |
| 648 | void ht_count_del(struct cds_lfht *ht, unsigned long size, unsigned long hash) |
| 649 | { |
| 650 | unsigned long split_count; |
| 651 | int index; |
| 652 | |
| 653 | if (caa_unlikely(!ht->split_count)) |
| 654 | return; |
| 655 | index = ht_get_split_count_index(hash); |
| 656 | split_count = uatomic_add_return(&ht->split_count[index].del, 1); |
| 657 | if (caa_unlikely(!(split_count & ((1UL << COUNT_COMMIT_ORDER) - 1)))) { |
| 658 | long count; |
| 659 | |
| 660 | dbg_printf("del split count %lu\n", split_count); |
| 661 | count = uatomic_add_return(&ht->count, |
| 662 | -(1UL << COUNT_COMMIT_ORDER)); |
| 663 | /* If power of 2 */ |
| 664 | if (!(count & (count - 1))) { |
| 665 | if ((count >> CHAIN_LEN_RESIZE_THRESHOLD) >= size) |
| 666 | return; |
| 667 | dbg_printf("del set global %ld\n", count); |
| 668 | /* |
| 669 | * Don't shrink table if the number of nodes is below a |
| 670 | * certain threshold. |
| 671 | */ |
| 672 | if (count < (1UL << COUNT_COMMIT_ORDER) * (split_count_mask + 1)) |
| 673 | return; |
| 674 | cds_lfht_resize_lazy_count(ht, size, |
| 675 | count >> (CHAIN_LEN_TARGET - 1)); |
| 676 | } |
| 677 | } |
| 678 | } |
| 679 | |
| 680 | static |
| 681 | void check_resize(struct cds_lfht *ht, unsigned long size, uint32_t chain_len) |
| 682 | { |
| 683 | unsigned long count; |
| 684 | |
| 685 | if (!(ht->flags & CDS_LFHT_AUTO_RESIZE)) |
| 686 | return; |
| 687 | count = uatomic_read(&ht->count); |
| 688 | /* |
| 689 | * Use bucket-local length for small table expand and for |
| 690 | * environments lacking per-cpu data support. |
| 691 | */ |
| 692 | if (count >= (1UL << COUNT_COMMIT_ORDER)) |
| 693 | return; |
| 694 | if (chain_len > 100) |
| 695 | dbg_printf("WARNING: large chain length: %u.\n", |
| 696 | chain_len); |
| 697 | if (chain_len >= CHAIN_LEN_RESIZE_THRESHOLD) |
| 698 | cds_lfht_resize_lazy_grow(ht, size, |
| 699 | get_count_order_u32(chain_len - (CHAIN_LEN_TARGET - 1))); |
| 700 | } |
| 701 | |
| 702 | static |
| 703 | struct cds_lfht_node *clear_flag(struct cds_lfht_node *node) |
| 704 | { |
| 705 | return (struct cds_lfht_node *) (((unsigned long) node) & ~FLAGS_MASK); |
| 706 | } |
| 707 | |
| 708 | static |
| 709 | int is_removed(struct cds_lfht_node *node) |
| 710 | { |
| 711 | return ((unsigned long) node) & REMOVED_FLAG; |
| 712 | } |
| 713 | |
| 714 | static |
| 715 | struct cds_lfht_node *flag_removed(struct cds_lfht_node *node) |
| 716 | { |
| 717 | return (struct cds_lfht_node *) (((unsigned long) node) | REMOVED_FLAG); |
| 718 | } |
| 719 | |
| 720 | static |
| 721 | int is_dummy(struct cds_lfht_node *node) |
| 722 | { |
| 723 | return ((unsigned long) node) & DUMMY_FLAG; |
| 724 | } |
| 725 | |
| 726 | static |
| 727 | struct cds_lfht_node *flag_dummy(struct cds_lfht_node *node) |
| 728 | { |
| 729 | return (struct cds_lfht_node *) (((unsigned long) node) | DUMMY_FLAG); |
| 730 | } |
| 731 | |
| 732 | static |
| 733 | struct cds_lfht_node *get_end(void) |
| 734 | { |
| 735 | return (struct cds_lfht_node *) END_VALUE; |
| 736 | } |
| 737 | |
| 738 | static |
| 739 | int is_end(struct cds_lfht_node *node) |
| 740 | { |
| 741 | return clear_flag(node) == (struct cds_lfht_node *) END_VALUE; |
| 742 | } |
| 743 | |
| 744 | static |
| 745 | unsigned long _uatomic_xchg_monotonic_increase(unsigned long *ptr, |
| 746 | unsigned long v) |
| 747 | { |
| 748 | unsigned long old1, old2; |
| 749 | |
| 750 | old1 = uatomic_read(ptr); |
| 751 | do { |
| 752 | old2 = old1; |
| 753 | if (old2 >= v) |
| 754 | return old2; |
| 755 | } while ((old1 = uatomic_cmpxchg(ptr, old2, v)) != old2); |
| 756 | return old2; |
| 757 | } |
| 758 | |
| 759 | static |
| 760 | struct _cds_lfht_node *lookup_bucket(struct cds_lfht *ht, unsigned long size, |
| 761 | unsigned long hash) |
| 762 | { |
| 763 | unsigned long index, order; |
| 764 | |
| 765 | assert(size > 0); |
| 766 | index = hash & (size - 1); |
| 767 | |
| 768 | if (index < ht->min_alloc_size) { |
| 769 | dbg_printf("lookup hash %lu index %lu order 0 aridx 0\n", |
| 770 | hash, index); |
| 771 | return &ht->t.tbl[0]->nodes[index]; |
| 772 | } |
| 773 | /* |
| 774 | * equivalent to get_count_order_ulong(index + 1), but optimizes |
| 775 | * away the non-existing 0 special-case for |
| 776 | * get_count_order_ulong. |
| 777 | */ |
| 778 | order = fls_ulong(index); |
| 779 | dbg_printf("lookup hash %lu index %lu order %lu aridx %lu\n", |
| 780 | hash, index, order, index & ((1UL << (order - 1)) - 1)); |
| 781 | return &ht->t.tbl[order]->nodes[index & ((1UL << (order - 1)) - 1)]; |
| 782 | } |
| 783 | |
| 784 | /* |
| 785 | * Remove all logically deleted nodes from a bucket up to a certain node key. |
| 786 | */ |
| 787 | static |
| 788 | void _cds_lfht_gc_bucket(struct cds_lfht_node *dummy, struct cds_lfht_node *node) |
| 789 | { |
| 790 | struct cds_lfht_node *iter_prev, *iter, *next, *new_next; |
| 791 | |
| 792 | assert(!is_dummy(dummy)); |
| 793 | assert(!is_removed(dummy)); |
| 794 | assert(!is_dummy(node)); |
| 795 | assert(!is_removed(node)); |
| 796 | for (;;) { |
| 797 | iter_prev = dummy; |
| 798 | /* We can always skip the dummy node initially */ |
| 799 | iter = rcu_dereference(iter_prev->p.next); |
| 800 | assert(!is_removed(iter)); |
| 801 | assert(iter_prev->p.reverse_hash <= node->p.reverse_hash); |
| 802 | /* |
| 803 | * We should never be called with dummy (start of chain) |
| 804 | * and logically removed node (end of path compression |
| 805 | * marker) being the actual same node. This would be a |
| 806 | * bug in the algorithm implementation. |
| 807 | */ |
| 808 | assert(dummy != node); |
| 809 | for (;;) { |
| 810 | if (caa_unlikely(is_end(iter))) |
| 811 | return; |
| 812 | if (caa_likely(clear_flag(iter)->p.reverse_hash > node->p.reverse_hash)) |
| 813 | return; |
| 814 | next = rcu_dereference(clear_flag(iter)->p.next); |
| 815 | if (caa_likely(is_removed(next))) |
| 816 | break; |
| 817 | iter_prev = clear_flag(iter); |
| 818 | iter = next; |
| 819 | } |
| 820 | assert(!is_removed(iter)); |
| 821 | if (is_dummy(iter)) |
| 822 | new_next = flag_dummy(clear_flag(next)); |
| 823 | else |
| 824 | new_next = clear_flag(next); |
| 825 | (void) uatomic_cmpxchg(&iter_prev->p.next, iter, new_next); |
| 826 | } |
| 827 | return; |
| 828 | } |
| 829 | |
| 830 | static |
| 831 | int _cds_lfht_replace(struct cds_lfht *ht, unsigned long size, |
| 832 | struct cds_lfht_node *old_node, |
| 833 | struct cds_lfht_node *old_next, |
| 834 | struct cds_lfht_node *new_node) |
| 835 | { |
| 836 | struct cds_lfht_node *dummy, *ret_next; |
| 837 | struct _cds_lfht_node *lookup; |
| 838 | |
| 839 | if (!old_node) /* Return -ENOENT if asked to replace NULL node */ |
| 840 | return -ENOENT; |
| 841 | |
| 842 | assert(!is_removed(old_node)); |
| 843 | assert(!is_dummy(old_node)); |
| 844 | assert(!is_removed(new_node)); |
| 845 | assert(!is_dummy(new_node)); |
| 846 | assert(new_node != old_node); |
| 847 | for (;;) { |
| 848 | /* Insert after node to be replaced */ |
| 849 | if (is_removed(old_next)) { |
| 850 | /* |
| 851 | * Too late, the old node has been removed under us |
| 852 | * between lookup and replace. Fail. |
| 853 | */ |
| 854 | return -ENOENT; |
| 855 | } |
| 856 | assert(!is_dummy(old_next)); |
| 857 | assert(new_node != clear_flag(old_next)); |
| 858 | new_node->p.next = clear_flag(old_next); |
| 859 | /* |
| 860 | * Here is the whole trick for lock-free replace: we add |
| 861 | * the replacement node _after_ the node we want to |
| 862 | * replace by atomically setting its next pointer at the |
| 863 | * same time we set its removal flag. Given that |
| 864 | * the lookups/get next use an iterator aware of the |
| 865 | * next pointer, they will either skip the old node due |
| 866 | * to the removal flag and see the new node, or use |
| 867 | * the old node, but will not see the new one. |
| 868 | */ |
| 869 | ret_next = uatomic_cmpxchg(&old_node->p.next, |
| 870 | old_next, flag_removed(new_node)); |
| 871 | if (ret_next == old_next) |
| 872 | break; /* We performed the replacement. */ |
| 873 | old_next = ret_next; |
| 874 | } |
| 875 | |
| 876 | /* |
| 877 | * Ensure that the old node is not visible to readers anymore: |
| 878 | * lookup for the node, and remove it (along with any other |
| 879 | * logically removed node) if found. |
| 880 | */ |
| 881 | lookup = lookup_bucket(ht, size, bit_reverse_ulong(old_node->p.reverse_hash)); |
| 882 | dummy = (struct cds_lfht_node *) lookup; |
| 883 | _cds_lfht_gc_bucket(dummy, new_node); |
| 884 | |
| 885 | assert(is_removed(rcu_dereference(old_node->p.next))); |
| 886 | return 0; |
| 887 | } |
| 888 | |
| 889 | /* |
| 890 | * A non-NULL unique_ret pointer uses the "add unique" (or uniquify) add |
| 891 | * mode. A NULL unique_ret allows creation of duplicate keys. |
| 892 | */ |
| 893 | static |
| 894 | void _cds_lfht_add(struct cds_lfht *ht, |
| 895 | unsigned long size, |
| 896 | struct cds_lfht_node *node, |
| 897 | struct cds_lfht_iter *unique_ret, |
| 898 | int dummy) |
| 899 | { |
| 900 | struct cds_lfht_node *iter_prev, *iter, *next, *new_node, *new_next, |
| 901 | *return_node; |
| 902 | struct _cds_lfht_node *lookup; |
| 903 | |
| 904 | assert(!is_dummy(node)); |
| 905 | assert(!is_removed(node)); |
| 906 | lookup = lookup_bucket(ht, size, bit_reverse_ulong(node->p.reverse_hash)); |
| 907 | for (;;) { |
| 908 | uint32_t chain_len = 0; |
| 909 | |
| 910 | /* |
| 911 | * iter_prev points to the non-removed node prior to the |
| 912 | * insert location. |
| 913 | */ |
| 914 | iter_prev = (struct cds_lfht_node *) lookup; |
| 915 | /* We can always skip the dummy node initially */ |
| 916 | iter = rcu_dereference(iter_prev->p.next); |
| 917 | assert(iter_prev->p.reverse_hash <= node->p.reverse_hash); |
| 918 | for (;;) { |
| 919 | if (caa_unlikely(is_end(iter))) |
| 920 | goto insert; |
| 921 | if (caa_likely(clear_flag(iter)->p.reverse_hash > node->p.reverse_hash)) |
| 922 | goto insert; |
| 923 | |
| 924 | /* dummy node is the first node of the identical-hash-value chain */ |
| 925 | if (dummy && clear_flag(iter)->p.reverse_hash == node->p.reverse_hash) |
| 926 | goto insert; |
| 927 | |
| 928 | next = rcu_dereference(clear_flag(iter)->p.next); |
| 929 | if (caa_unlikely(is_removed(next))) |
| 930 | goto gc_node; |
| 931 | |
| 932 | /* uniquely add */ |
| 933 | if (unique_ret |
| 934 | && !is_dummy(next) |
| 935 | && clear_flag(iter)->p.reverse_hash == node->p.reverse_hash) { |
| 936 | struct cds_lfht_iter d_iter = { .node = node, .next = iter, }; |
| 937 | |
| 938 | /* |
| 939 | * uniquely adding inserts the node as the first |
| 940 | * node of the identical-hash-value node chain. |
| 941 | * |
| 942 | * This semantic ensures no duplicated keys |
| 943 | * should ever be observable in the table |
| 944 | * (including observe one node by one node |
| 945 | * by forward iterations) |
| 946 | */ |
| 947 | cds_lfht_next_duplicate(ht, &d_iter); |
| 948 | if (!d_iter.node) |
| 949 | goto insert; |
| 950 | |
| 951 | *unique_ret = d_iter; |
| 952 | return; |
| 953 | } |
| 954 | |
| 955 | /* Only account for identical reverse hash once */ |
| 956 | if (iter_prev->p.reverse_hash != clear_flag(iter)->p.reverse_hash |
| 957 | && !is_dummy(next)) |
| 958 | check_resize(ht, size, ++chain_len); |
| 959 | iter_prev = clear_flag(iter); |
| 960 | iter = next; |
| 961 | } |
| 962 | |
| 963 | insert: |
| 964 | assert(node != clear_flag(iter)); |
| 965 | assert(!is_removed(iter_prev)); |
| 966 | assert(!is_removed(iter)); |
| 967 | assert(iter_prev != node); |
| 968 | if (!dummy) |
| 969 | node->p.next = clear_flag(iter); |
| 970 | else |
| 971 | node->p.next = flag_dummy(clear_flag(iter)); |
| 972 | if (is_dummy(iter)) |
| 973 | new_node = flag_dummy(node); |
| 974 | else |
| 975 | new_node = node; |
| 976 | if (uatomic_cmpxchg(&iter_prev->p.next, iter, |
| 977 | new_node) != iter) { |
| 978 | continue; /* retry */ |
| 979 | } else { |
| 980 | return_node = node; |
| 981 | goto end; |
| 982 | } |
| 983 | |
| 984 | gc_node: |
| 985 | assert(!is_removed(iter)); |
| 986 | if (is_dummy(iter)) |
| 987 | new_next = flag_dummy(clear_flag(next)); |
| 988 | else |
| 989 | new_next = clear_flag(next); |
| 990 | (void) uatomic_cmpxchg(&iter_prev->p.next, iter, new_next); |
| 991 | /* retry */ |
| 992 | } |
| 993 | end: |
| 994 | if (unique_ret) { |
| 995 | unique_ret->node = return_node; |
| 996 | /* unique_ret->next left unset, never used. */ |
| 997 | } |
| 998 | } |
| 999 | |
| 1000 | static |
| 1001 | int _cds_lfht_del(struct cds_lfht *ht, unsigned long size, |
| 1002 | struct cds_lfht_node *node, |
| 1003 | int dummy_removal) |
| 1004 | { |
| 1005 | struct cds_lfht_node *dummy, *next, *old; |
| 1006 | struct _cds_lfht_node *lookup; |
| 1007 | |
| 1008 | if (!node) /* Return -ENOENT if asked to delete NULL node */ |
| 1009 | return -ENOENT; |
| 1010 | |
| 1011 | /* logically delete the node */ |
| 1012 | assert(!is_dummy(node)); |
| 1013 | assert(!is_removed(node)); |
| 1014 | old = rcu_dereference(node->p.next); |
| 1015 | do { |
| 1016 | struct cds_lfht_node *new_next; |
| 1017 | |
| 1018 | next = old; |
| 1019 | if (caa_unlikely(is_removed(next))) |
| 1020 | return -ENOENT; |
| 1021 | if (dummy_removal) |
| 1022 | assert(is_dummy(next)); |
| 1023 | else |
| 1024 | assert(!is_dummy(next)); |
| 1025 | new_next = flag_removed(next); |
| 1026 | old = uatomic_cmpxchg(&node->p.next, next, new_next); |
| 1027 | } while (old != next); |
| 1028 | /* We performed the (logical) deletion. */ |
| 1029 | |
| 1030 | /* |
| 1031 | * Ensure that the node is not visible to readers anymore: lookup for |
| 1032 | * the node, and remove it (along with any other logically removed node) |
| 1033 | * if found. |
| 1034 | */ |
| 1035 | lookup = lookup_bucket(ht, size, bit_reverse_ulong(node->p.reverse_hash)); |
| 1036 | dummy = (struct cds_lfht_node *) lookup; |
| 1037 | _cds_lfht_gc_bucket(dummy, node); |
| 1038 | |
| 1039 | assert(is_removed(rcu_dereference(node->p.next))); |
| 1040 | return 0; |
| 1041 | } |
| 1042 | |
| 1043 | static |
| 1044 | void *partition_resize_thread(void *arg) |
| 1045 | { |
| 1046 | struct partition_resize_work *work = arg; |
| 1047 | |
| 1048 | work->ht->cds_lfht_rcu_register_thread(); |
| 1049 | work->fct(work->ht, work->i, work->start, work->len); |
| 1050 | work->ht->cds_lfht_rcu_unregister_thread(); |
| 1051 | return NULL; |
| 1052 | } |
| 1053 | |
| 1054 | static |
| 1055 | void partition_resize_helper(struct cds_lfht *ht, unsigned long i, |
| 1056 | unsigned long len, |
| 1057 | void (*fct)(struct cds_lfht *ht, unsigned long i, |
| 1058 | unsigned long start, unsigned long len)) |
| 1059 | { |
| 1060 | unsigned long partition_len; |
| 1061 | struct partition_resize_work *work; |
| 1062 | int thread, ret; |
| 1063 | unsigned long nr_threads; |
| 1064 | |
| 1065 | /* |
| 1066 | * Note: nr_cpus_mask + 1 is always power of 2. |
| 1067 | * We spawn just the number of threads we need to satisfy the minimum |
| 1068 | * partition size, up to the number of CPUs in the system. |
| 1069 | */ |
| 1070 | if (nr_cpus_mask > 0) { |
| 1071 | nr_threads = min(nr_cpus_mask + 1, |
| 1072 | len >> MIN_PARTITION_PER_THREAD_ORDER); |
| 1073 | } else { |
| 1074 | nr_threads = 1; |
| 1075 | } |
| 1076 | partition_len = len >> get_count_order_ulong(nr_threads); |
| 1077 | work = calloc(nr_threads, sizeof(*work)); |
| 1078 | assert(work); |
| 1079 | for (thread = 0; thread < nr_threads; thread++) { |
| 1080 | work[thread].ht = ht; |
| 1081 | work[thread].i = i; |
| 1082 | work[thread].len = partition_len; |
| 1083 | work[thread].start = thread * partition_len; |
| 1084 | work[thread].fct = fct; |
| 1085 | ret = pthread_create(&(work[thread].thread_id), ht->resize_attr, |
| 1086 | partition_resize_thread, &work[thread]); |
| 1087 | assert(!ret); |
| 1088 | } |
| 1089 | for (thread = 0; thread < nr_threads; thread++) { |
| 1090 | ret = pthread_join(work[thread].thread_id, NULL); |
| 1091 | assert(!ret); |
| 1092 | } |
| 1093 | free(work); |
| 1094 | } |
| 1095 | |
| 1096 | /* |
| 1097 | * Holding RCU read lock to protect _cds_lfht_add against memory |
| 1098 | * reclaim that could be performed by other call_rcu worker threads (ABA |
| 1099 | * problem). |
| 1100 | * |
| 1101 | * When we reach a certain length, we can split this population phase over |
| 1102 | * many worker threads, based on the number of CPUs available in the system. |
| 1103 | * This should therefore take care of not having the expand lagging behind too |
| 1104 | * many concurrent insertion threads by using the scheduler's ability to |
| 1105 | * schedule dummy node population fairly with insertions. |
| 1106 | */ |
| 1107 | static |
| 1108 | void init_table_populate_partition(struct cds_lfht *ht, unsigned long i, |
| 1109 | unsigned long start, unsigned long len) |
| 1110 | { |
| 1111 | unsigned long j; |
| 1112 | |
| 1113 | assert(i > ht->min_alloc_order); |
| 1114 | ht->cds_lfht_rcu_read_lock(); |
| 1115 | for (j = start; j < start + len; j++) { |
| 1116 | struct cds_lfht_node *new_node = |
| 1117 | (struct cds_lfht_node *) &ht->t.tbl[i]->nodes[j]; |
| 1118 | |
| 1119 | dbg_printf("init populate: i %lu j %lu hash %lu\n", |
| 1120 | i, j, (1UL << (i - 1)) + j); |
| 1121 | new_node->p.reverse_hash = |
| 1122 | bit_reverse_ulong((1UL << (i - 1)) + j); |
| 1123 | _cds_lfht_add(ht, 1UL << (i - 1), |
| 1124 | new_node, NULL, 1); |
| 1125 | } |
| 1126 | ht->cds_lfht_rcu_read_unlock(); |
| 1127 | } |
| 1128 | |
| 1129 | static |
| 1130 | void init_table_populate(struct cds_lfht *ht, unsigned long i, |
| 1131 | unsigned long len) |
| 1132 | { |
| 1133 | assert(nr_cpus_mask != -1); |
| 1134 | if (nr_cpus_mask < 0 || len < 2 * MIN_PARTITION_PER_THREAD) { |
| 1135 | ht->cds_lfht_rcu_thread_online(); |
| 1136 | init_table_populate_partition(ht, i, 0, len); |
| 1137 | ht->cds_lfht_rcu_thread_offline(); |
| 1138 | return; |
| 1139 | } |
| 1140 | partition_resize_helper(ht, i, len, init_table_populate_partition); |
| 1141 | } |
| 1142 | |
| 1143 | static |
| 1144 | void init_table(struct cds_lfht *ht, |
| 1145 | unsigned long first_order, unsigned long last_order) |
| 1146 | { |
| 1147 | unsigned long i; |
| 1148 | |
| 1149 | dbg_printf("init table: first_order %lu last_order %lu\n", |
| 1150 | first_order, last_order); |
| 1151 | assert(first_order > ht->min_alloc_order); |
| 1152 | for (i = first_order; i <= last_order; i++) { |
| 1153 | unsigned long len; |
| 1154 | |
| 1155 | len = 1UL << (i - 1); |
| 1156 | dbg_printf("init order %lu len: %lu\n", i, len); |
| 1157 | |
| 1158 | /* Stop expand if the resize target changes under us */ |
| 1159 | if (CMM_LOAD_SHARED(ht->t.resize_target) < (1UL << i)) |
| 1160 | break; |
| 1161 | |
| 1162 | ht->t.tbl[i] = calloc(1, len * sizeof(struct _cds_lfht_node)); |
| 1163 | assert(ht->t.tbl[i]); |
| 1164 | |
| 1165 | /* |
| 1166 | * Set all dummy nodes reverse hash values for a level and |
| 1167 | * link all dummy nodes into the table. |
| 1168 | */ |
| 1169 | init_table_populate(ht, i, len); |
| 1170 | |
| 1171 | /* |
| 1172 | * Update table size. |
| 1173 | */ |
| 1174 | cmm_smp_wmb(); /* populate data before RCU size */ |
| 1175 | CMM_STORE_SHARED(ht->t.size, 1UL << i); |
| 1176 | |
| 1177 | dbg_printf("init new size: %lu\n", 1UL << i); |
| 1178 | if (CMM_LOAD_SHARED(ht->in_progress_destroy)) |
| 1179 | break; |
| 1180 | } |
| 1181 | } |
| 1182 | |
| 1183 | /* |
| 1184 | * Holding RCU read lock to protect _cds_lfht_remove against memory |
| 1185 | * reclaim that could be performed by other call_rcu worker threads (ABA |
| 1186 | * problem). |
| 1187 | * For a single level, we logically remove and garbage collect each node. |
| 1188 | * |
| 1189 | * As a design choice, we perform logical removal and garbage collection on a |
| 1190 | * node-per-node basis to simplify this algorithm. We also assume keeping good |
| 1191 | * cache locality of the operation would overweight possible performance gain |
| 1192 | * that could be achieved by batching garbage collection for multiple levels. |
| 1193 | * However, this would have to be justified by benchmarks. |
| 1194 | * |
| 1195 | * Concurrent removal and add operations are helping us perform garbage |
| 1196 | * collection of logically removed nodes. We guarantee that all logically |
| 1197 | * removed nodes have been garbage-collected (unlinked) before call_rcu is |
| 1198 | * invoked to free a hole level of dummy nodes (after a grace period). |
| 1199 | * |
| 1200 | * Logical removal and garbage collection can therefore be done in batch or on a |
| 1201 | * node-per-node basis, as long as the guarantee above holds. |
| 1202 | * |
| 1203 | * When we reach a certain length, we can split this removal over many worker |
| 1204 | * threads, based on the number of CPUs available in the system. This should |
| 1205 | * take care of not letting resize process lag behind too many concurrent |
| 1206 | * updater threads actively inserting into the hash table. |
| 1207 | */ |
| 1208 | static |
| 1209 | void remove_table_partition(struct cds_lfht *ht, unsigned long i, |
| 1210 | unsigned long start, unsigned long len) |
| 1211 | { |
| 1212 | unsigned long j; |
| 1213 | |
| 1214 | assert(i > ht->min_alloc_order); |
| 1215 | ht->cds_lfht_rcu_read_lock(); |
| 1216 | for (j = start; j < start + len; j++) { |
| 1217 | struct cds_lfht_node *fini_node = |
| 1218 | (struct cds_lfht_node *) &ht->t.tbl[i]->nodes[j]; |
| 1219 | |
| 1220 | dbg_printf("remove entry: i %lu j %lu hash %lu\n", |
| 1221 | i, j, (1UL << (i - 1)) + j); |
| 1222 | fini_node->p.reverse_hash = |
| 1223 | bit_reverse_ulong((1UL << (i - 1)) + j); |
| 1224 | (void) _cds_lfht_del(ht, 1UL << (i - 1), fini_node, 1); |
| 1225 | } |
| 1226 | ht->cds_lfht_rcu_read_unlock(); |
| 1227 | } |
| 1228 | |
| 1229 | static |
| 1230 | void remove_table(struct cds_lfht *ht, unsigned long i, unsigned long len) |
| 1231 | { |
| 1232 | |
| 1233 | assert(nr_cpus_mask != -1); |
| 1234 | if (nr_cpus_mask < 0 || len < 2 * MIN_PARTITION_PER_THREAD) { |
| 1235 | ht->cds_lfht_rcu_thread_online(); |
| 1236 | remove_table_partition(ht, i, 0, len); |
| 1237 | ht->cds_lfht_rcu_thread_offline(); |
| 1238 | return; |
| 1239 | } |
| 1240 | partition_resize_helper(ht, i, len, remove_table_partition); |
| 1241 | } |
| 1242 | |
| 1243 | static |
| 1244 | void fini_table(struct cds_lfht *ht, |
| 1245 | unsigned long first_order, unsigned long last_order) |
| 1246 | { |
| 1247 | long i; |
| 1248 | void *free_by_rcu = NULL; |
| 1249 | |
| 1250 | dbg_printf("fini table: first_order %lu last_order %lu\n", |
| 1251 | first_order, last_order); |
| 1252 | assert(first_order > ht->min_alloc_order); |
| 1253 | for (i = last_order; i >= first_order; i--) { |
| 1254 | unsigned long len; |
| 1255 | |
| 1256 | len = 1UL << (i - 1); |
| 1257 | dbg_printf("fini order %lu len: %lu\n", i, len); |
| 1258 | |
| 1259 | /* Stop shrink if the resize target changes under us */ |
| 1260 | if (CMM_LOAD_SHARED(ht->t.resize_target) > (1UL << (i - 1))) |
| 1261 | break; |
| 1262 | |
| 1263 | cmm_smp_wmb(); /* populate data before RCU size */ |
| 1264 | CMM_STORE_SHARED(ht->t.size, 1UL << (i - 1)); |
| 1265 | |
| 1266 | /* |
| 1267 | * We need to wait for all add operations to reach Q.S. (and |
| 1268 | * thus use the new table for lookups) before we can start |
| 1269 | * releasing the old dummy nodes. Otherwise their lookup will |
| 1270 | * return a logically removed node as insert position. |
| 1271 | */ |
| 1272 | ht->cds_lfht_synchronize_rcu(); |
| 1273 | if (free_by_rcu) |
| 1274 | free(free_by_rcu); |
| 1275 | |
| 1276 | /* |
| 1277 | * Set "removed" flag in dummy nodes about to be removed. |
| 1278 | * Unlink all now-logically-removed dummy node pointers. |
| 1279 | * Concurrent add/remove operation are helping us doing |
| 1280 | * the gc. |
| 1281 | */ |
| 1282 | remove_table(ht, i, len); |
| 1283 | |
| 1284 | free_by_rcu = ht->t.tbl[i]; |
| 1285 | |
| 1286 | dbg_printf("fini new size: %lu\n", 1UL << i); |
| 1287 | if (CMM_LOAD_SHARED(ht->in_progress_destroy)) |
| 1288 | break; |
| 1289 | } |
| 1290 | |
| 1291 | if (free_by_rcu) { |
| 1292 | ht->cds_lfht_synchronize_rcu(); |
| 1293 | free(free_by_rcu); |
| 1294 | } |
| 1295 | } |
| 1296 | |
| 1297 | static |
| 1298 | void cds_lfht_create_dummy(struct cds_lfht *ht, unsigned long size) |
| 1299 | { |
| 1300 | struct _cds_lfht_node *prev, *node; |
| 1301 | unsigned long order, len, i, j; |
| 1302 | |
| 1303 | ht->t.tbl[0] = calloc(1, ht->min_alloc_size * sizeof(struct _cds_lfht_node)); |
| 1304 | assert(ht->t.tbl[0]); |
| 1305 | |
| 1306 | dbg_printf("create dummy: order %lu index %lu hash %lu\n", 0, 0, 0); |
| 1307 | ht->t.tbl[0]->nodes[0].next = flag_dummy(get_end()); |
| 1308 | ht->t.tbl[0]->nodes[0].reverse_hash = 0; |
| 1309 | |
| 1310 | for (order = 1; order < get_count_order_ulong(size) + 1; order++) { |
| 1311 | len = 1UL << (order - 1); |
| 1312 | if (order <= ht->min_alloc_order) { |
| 1313 | ht->t.tbl[order] = (struct rcu_level *) (ht->t.tbl[0]->nodes + len); |
| 1314 | } else { |
| 1315 | ht->t.tbl[order] = calloc(1, len * sizeof(struct _cds_lfht_node)); |
| 1316 | assert(ht->t.tbl[order]); |
| 1317 | } |
| 1318 | |
| 1319 | i = 0; |
| 1320 | prev = ht->t.tbl[i]->nodes; |
| 1321 | for (j = 0; j < len; j++) { |
| 1322 | if (j & (j - 1)) { /* Between power of 2 */ |
| 1323 | prev++; |
| 1324 | } else if (j) { /* At each power of 2 */ |
| 1325 | i++; |
| 1326 | prev = ht->t.tbl[i]->nodes; |
| 1327 | } |
| 1328 | |
| 1329 | node = &ht->t.tbl[order]->nodes[j]; |
| 1330 | dbg_printf("create dummy: order %lu index %lu hash %lu\n", |
| 1331 | order, j, j + len); |
| 1332 | node->next = prev->next; |
| 1333 | assert(is_dummy(node->next)); |
| 1334 | node->reverse_hash = bit_reverse_ulong(j + len); |
| 1335 | prev->next = flag_dummy((struct cds_lfht_node *)node); |
| 1336 | } |
| 1337 | } |
| 1338 | } |
| 1339 | |
| 1340 | struct cds_lfht *_cds_lfht_new(cds_lfht_hash_fct hash_fct, |
| 1341 | cds_lfht_compare_fct compare_fct, |
| 1342 | unsigned long hash_seed, |
| 1343 | unsigned long init_size, |
| 1344 | unsigned long min_alloc_size, |
| 1345 | int flags, |
| 1346 | void (*cds_lfht_call_rcu)(struct rcu_head *head, |
| 1347 | void (*func)(struct rcu_head *head)), |
| 1348 | void (*cds_lfht_synchronize_rcu)(void), |
| 1349 | void (*cds_lfht_rcu_read_lock)(void), |
| 1350 | void (*cds_lfht_rcu_read_unlock)(void), |
| 1351 | void (*cds_lfht_rcu_thread_offline)(void), |
| 1352 | void (*cds_lfht_rcu_thread_online)(void), |
| 1353 | void (*cds_lfht_rcu_register_thread)(void), |
| 1354 | void (*cds_lfht_rcu_unregister_thread)(void), |
| 1355 | pthread_attr_t *attr) |
| 1356 | { |
| 1357 | struct cds_lfht *ht; |
| 1358 | unsigned long order; |
| 1359 | |
| 1360 | /* min_alloc_size must be power of two */ |
| 1361 | if (!min_alloc_size || (min_alloc_size & (min_alloc_size - 1))) |
| 1362 | return NULL; |
| 1363 | /* init_size must be power of two */ |
| 1364 | if (!init_size || (init_size & (init_size - 1))) |
| 1365 | return NULL; |
| 1366 | min_alloc_size = max(min_alloc_size, MIN_TABLE_SIZE); |
| 1367 | init_size = max(init_size, min_alloc_size); |
| 1368 | ht = calloc(1, sizeof(struct cds_lfht)); |
| 1369 | assert(ht); |
| 1370 | ht->flags = flags; |
| 1371 | ht->hash_fct = hash_fct; |
| 1372 | ht->compare_fct = compare_fct; |
| 1373 | ht->hash_seed = hash_seed; |
| 1374 | ht->cds_lfht_call_rcu = cds_lfht_call_rcu; |
| 1375 | ht->cds_lfht_synchronize_rcu = cds_lfht_synchronize_rcu; |
| 1376 | ht->cds_lfht_rcu_read_lock = cds_lfht_rcu_read_lock; |
| 1377 | ht->cds_lfht_rcu_read_unlock = cds_lfht_rcu_read_unlock; |
| 1378 | ht->cds_lfht_rcu_thread_offline = cds_lfht_rcu_thread_offline; |
| 1379 | ht->cds_lfht_rcu_thread_online = cds_lfht_rcu_thread_online; |
| 1380 | ht->cds_lfht_rcu_register_thread = cds_lfht_rcu_register_thread; |
| 1381 | ht->cds_lfht_rcu_unregister_thread = cds_lfht_rcu_unregister_thread; |
| 1382 | ht->resize_attr = attr; |
| 1383 | alloc_split_items_count(ht); |
| 1384 | /* this mutex should not nest in read-side C.S. */ |
| 1385 | pthread_mutex_init(&ht->resize_mutex, NULL); |
| 1386 | order = get_count_order_ulong(init_size); |
| 1387 | ht->t.resize_target = 1UL << order; |
| 1388 | ht->min_alloc_size = min_alloc_size; |
| 1389 | ht->min_alloc_order = get_count_order_ulong(min_alloc_size); |
| 1390 | cds_lfht_create_dummy(ht, 1UL << order); |
| 1391 | ht->t.size = 1UL << order; |
| 1392 | return ht; |
| 1393 | } |
| 1394 | |
| 1395 | void cds_lfht_lookup(struct cds_lfht *ht, void *key, size_t key_len, |
| 1396 | struct cds_lfht_iter *iter) |
| 1397 | { |
| 1398 | struct cds_lfht_node *node, *next, *dummy_node; |
| 1399 | struct _cds_lfht_node *lookup; |
| 1400 | unsigned long hash, reverse_hash, size; |
| 1401 | |
| 1402 | hash = ht->hash_fct(key, key_len, ht->hash_seed); |
| 1403 | reverse_hash = bit_reverse_ulong(hash); |
| 1404 | |
| 1405 | size = rcu_dereference(ht->t.size); |
| 1406 | lookup = lookup_bucket(ht, size, hash); |
| 1407 | dummy_node = (struct cds_lfht_node *) lookup; |
| 1408 | /* We can always skip the dummy node initially */ |
| 1409 | node = rcu_dereference(dummy_node->p.next); |
| 1410 | node = clear_flag(node); |
| 1411 | for (;;) { |
| 1412 | if (caa_unlikely(is_end(node))) { |
| 1413 | node = next = NULL; |
| 1414 | break; |
| 1415 | } |
| 1416 | if (caa_unlikely(node->p.reverse_hash > reverse_hash)) { |
| 1417 | node = next = NULL; |
| 1418 | break; |
| 1419 | } |
| 1420 | next = rcu_dereference(node->p.next); |
| 1421 | assert(node == clear_flag(node)); |
| 1422 | if (caa_likely(!is_removed(next)) |
| 1423 | && !is_dummy(next) |
| 1424 | && node->p.reverse_hash == reverse_hash |
| 1425 | && caa_likely(!ht->compare_fct(node->key, node->key_len, key, key_len))) { |
| 1426 | break; |
| 1427 | } |
| 1428 | node = clear_flag(next); |
| 1429 | } |
| 1430 | assert(!node || !is_dummy(rcu_dereference(node->p.next))); |
| 1431 | iter->node = node; |
| 1432 | iter->next = next; |
| 1433 | } |
| 1434 | |
| 1435 | void cds_lfht_next_duplicate(struct cds_lfht *ht, struct cds_lfht_iter *iter) |
| 1436 | { |
| 1437 | struct cds_lfht_node *node, *next; |
| 1438 | unsigned long reverse_hash; |
| 1439 | void *key; |
| 1440 | size_t key_len; |
| 1441 | |
| 1442 | node = iter->node; |
| 1443 | reverse_hash = node->p.reverse_hash; |
| 1444 | key = node->key; |
| 1445 | key_len = node->key_len; |
| 1446 | next = iter->next; |
| 1447 | node = clear_flag(next); |
| 1448 | |
| 1449 | for (;;) { |
| 1450 | if (caa_unlikely(is_end(node))) { |
| 1451 | node = next = NULL; |
| 1452 | break; |
| 1453 | } |
| 1454 | if (caa_unlikely(node->p.reverse_hash > reverse_hash)) { |
| 1455 | node = next = NULL; |
| 1456 | break; |
| 1457 | } |
| 1458 | next = rcu_dereference(node->p.next); |
| 1459 | if (caa_likely(!is_removed(next)) |
| 1460 | && !is_dummy(next) |
| 1461 | && caa_likely(!ht->compare_fct(node->key, node->key_len, key, key_len))) { |
| 1462 | break; |
| 1463 | } |
| 1464 | node = clear_flag(next); |
| 1465 | } |
| 1466 | assert(!node || !is_dummy(rcu_dereference(node->p.next))); |
| 1467 | iter->node = node; |
| 1468 | iter->next = next; |
| 1469 | } |
| 1470 | |
| 1471 | void cds_lfht_next(struct cds_lfht *ht, struct cds_lfht_iter *iter) |
| 1472 | { |
| 1473 | struct cds_lfht_node *node, *next; |
| 1474 | |
| 1475 | node = clear_flag(iter->next); |
| 1476 | for (;;) { |
| 1477 | if (caa_unlikely(is_end(node))) { |
| 1478 | node = next = NULL; |
| 1479 | break; |
| 1480 | } |
| 1481 | next = rcu_dereference(node->p.next); |
| 1482 | if (caa_likely(!is_removed(next)) |
| 1483 | && !is_dummy(next)) { |
| 1484 | break; |
| 1485 | } |
| 1486 | node = clear_flag(next); |
| 1487 | } |
| 1488 | assert(!node || !is_dummy(rcu_dereference(node->p.next))); |
| 1489 | iter->node = node; |
| 1490 | iter->next = next; |
| 1491 | } |
| 1492 | |
| 1493 | void cds_lfht_first(struct cds_lfht *ht, struct cds_lfht_iter *iter) |
| 1494 | { |
| 1495 | struct _cds_lfht_node *lookup; |
| 1496 | |
| 1497 | /* |
| 1498 | * Get next after first dummy node. The first dummy node is the |
| 1499 | * first node of the linked list. |
| 1500 | */ |
| 1501 | lookup = &ht->t.tbl[0]->nodes[0]; |
| 1502 | iter->next = lookup->next; |
| 1503 | cds_lfht_next(ht, iter); |
| 1504 | } |
| 1505 | |
| 1506 | void cds_lfht_add(struct cds_lfht *ht, struct cds_lfht_node *node) |
| 1507 | { |
| 1508 | unsigned long hash, size; |
| 1509 | |
| 1510 | hash = ht->hash_fct(node->key, node->key_len, ht->hash_seed); |
| 1511 | node->p.reverse_hash = bit_reverse_ulong((unsigned long) hash); |
| 1512 | |
| 1513 | size = rcu_dereference(ht->t.size); |
| 1514 | _cds_lfht_add(ht, size, node, NULL, 0); |
| 1515 | ht_count_add(ht, size, hash); |
| 1516 | } |
| 1517 | |
| 1518 | struct cds_lfht_node *cds_lfht_add_unique(struct cds_lfht *ht, |
| 1519 | struct cds_lfht_node *node) |
| 1520 | { |
| 1521 | unsigned long hash, size; |
| 1522 | struct cds_lfht_iter iter; |
| 1523 | |
| 1524 | hash = ht->hash_fct(node->key, node->key_len, ht->hash_seed); |
| 1525 | node->p.reverse_hash = bit_reverse_ulong((unsigned long) hash); |
| 1526 | |
| 1527 | size = rcu_dereference(ht->t.size); |
| 1528 | _cds_lfht_add(ht, size, node, &iter, 0); |
| 1529 | if (iter.node == node) |
| 1530 | ht_count_add(ht, size, hash); |
| 1531 | return iter.node; |
| 1532 | } |
| 1533 | |
| 1534 | struct cds_lfht_node *cds_lfht_add_replace(struct cds_lfht *ht, |
| 1535 | struct cds_lfht_node *node) |
| 1536 | { |
| 1537 | unsigned long hash, size; |
| 1538 | struct cds_lfht_iter iter; |
| 1539 | |
| 1540 | hash = ht->hash_fct(node->key, node->key_len, ht->hash_seed); |
| 1541 | node->p.reverse_hash = bit_reverse_ulong((unsigned long) hash); |
| 1542 | |
| 1543 | size = rcu_dereference(ht->t.size); |
| 1544 | for (;;) { |
| 1545 | _cds_lfht_add(ht, size, node, &iter, 0); |
| 1546 | if (iter.node == node) { |
| 1547 | ht_count_add(ht, size, hash); |
| 1548 | return NULL; |
| 1549 | } |
| 1550 | |
| 1551 | if (!_cds_lfht_replace(ht, size, iter.node, iter.next, node)) |
| 1552 | return iter.node; |
| 1553 | } |
| 1554 | } |
| 1555 | |
| 1556 | int cds_lfht_replace(struct cds_lfht *ht, struct cds_lfht_iter *old_iter, |
| 1557 | struct cds_lfht_node *new_node) |
| 1558 | { |
| 1559 | unsigned long size; |
| 1560 | |
| 1561 | size = rcu_dereference(ht->t.size); |
| 1562 | return _cds_lfht_replace(ht, size, old_iter->node, old_iter->next, |
| 1563 | new_node); |
| 1564 | } |
| 1565 | |
| 1566 | int cds_lfht_del(struct cds_lfht *ht, struct cds_lfht_iter *iter) |
| 1567 | { |
| 1568 | unsigned long size, hash; |
| 1569 | int ret; |
| 1570 | |
| 1571 | size = rcu_dereference(ht->t.size); |
| 1572 | ret = _cds_lfht_del(ht, size, iter->node, 0); |
| 1573 | if (!ret) { |
| 1574 | hash = bit_reverse_ulong(iter->node->p.reverse_hash); |
| 1575 | ht_count_del(ht, size, hash); |
| 1576 | } |
| 1577 | return ret; |
| 1578 | } |
| 1579 | |
| 1580 | static |
| 1581 | int cds_lfht_delete_dummy(struct cds_lfht *ht) |
| 1582 | { |
| 1583 | struct cds_lfht_node *node; |
| 1584 | struct _cds_lfht_node *lookup; |
| 1585 | unsigned long order, i, size; |
| 1586 | |
| 1587 | /* Check that the table is empty */ |
| 1588 | lookup = &ht->t.tbl[0]->nodes[0]; |
| 1589 | node = (struct cds_lfht_node *) lookup; |
| 1590 | do { |
| 1591 | node = clear_flag(node)->p.next; |
| 1592 | if (!is_dummy(node)) |
| 1593 | return -EPERM; |
| 1594 | assert(!is_removed(node)); |
| 1595 | } while (!is_end(node)); |
| 1596 | /* |
| 1597 | * size accessed without rcu_dereference because hash table is |
| 1598 | * being destroyed. |
| 1599 | */ |
| 1600 | size = ht->t.size; |
| 1601 | /* Internal sanity check: all nodes left should be dummy */ |
| 1602 | for (order = 0; order < get_count_order_ulong(size) + 1; order++) { |
| 1603 | unsigned long len; |
| 1604 | |
| 1605 | len = !order ? 1 : 1UL << (order - 1); |
| 1606 | for (i = 0; i < len; i++) { |
| 1607 | dbg_printf("delete order %lu i %lu hash %lu\n", |
| 1608 | order, i, |
| 1609 | bit_reverse_ulong(ht->t.tbl[order]->nodes[i].reverse_hash)); |
| 1610 | assert(is_dummy(ht->t.tbl[order]->nodes[i].next)); |
| 1611 | } |
| 1612 | |
| 1613 | if (order == ht->min_alloc_order) |
| 1614 | poison_free(ht->t.tbl[0]); |
| 1615 | else if (order > ht->min_alloc_order) |
| 1616 | poison_free(ht->t.tbl[order]); |
| 1617 | /* Nothing to delete for order < ht->min_alloc_order */ |
| 1618 | } |
| 1619 | return 0; |
| 1620 | } |
| 1621 | |
| 1622 | /* |
| 1623 | * Should only be called when no more concurrent readers nor writers can |
| 1624 | * possibly access the table. |
| 1625 | */ |
| 1626 | int cds_lfht_destroy(struct cds_lfht *ht, pthread_attr_t **attr) |
| 1627 | { |
| 1628 | int ret; |
| 1629 | |
| 1630 | /* Wait for in-flight resize operations to complete */ |
| 1631 | _CMM_STORE_SHARED(ht->in_progress_destroy, 1); |
| 1632 | cmm_smp_mb(); /* Store destroy before load resize */ |
| 1633 | while (uatomic_read(&ht->in_progress_resize)) |
| 1634 | poll(NULL, 0, 100); /* wait for 100ms */ |
| 1635 | ret = cds_lfht_delete_dummy(ht); |
| 1636 | if (ret) |
| 1637 | return ret; |
| 1638 | free_split_items_count(ht); |
| 1639 | if (attr) |
| 1640 | *attr = ht->resize_attr; |
| 1641 | poison_free(ht); |
| 1642 | return ret; |
| 1643 | } |
| 1644 | |
| 1645 | void cds_lfht_count_nodes(struct cds_lfht *ht, |
| 1646 | long *approx_before, |
| 1647 | unsigned long *count, |
| 1648 | unsigned long *removed, |
| 1649 | long *approx_after) |
| 1650 | { |
| 1651 | struct cds_lfht_node *node, *next; |
| 1652 | struct _cds_lfht_node *lookup; |
| 1653 | unsigned long nr_dummy = 0; |
| 1654 | |
| 1655 | *approx_before = 0; |
| 1656 | if (ht->split_count) { |
| 1657 | int i; |
| 1658 | |
| 1659 | for (i = 0; i < split_count_mask + 1; i++) { |
| 1660 | *approx_before += uatomic_read(&ht->split_count[i].add); |
| 1661 | *approx_before -= uatomic_read(&ht->split_count[i].del); |
| 1662 | } |
| 1663 | } |
| 1664 | |
| 1665 | *count = 0; |
| 1666 | *removed = 0; |
| 1667 | |
| 1668 | /* Count non-dummy nodes in the table */ |
| 1669 | lookup = &ht->t.tbl[0]->nodes[0]; |
| 1670 | node = (struct cds_lfht_node *) lookup; |
| 1671 | do { |
| 1672 | next = rcu_dereference(node->p.next); |
| 1673 | if (is_removed(next)) { |
| 1674 | if (!is_dummy(next)) |
| 1675 | (*removed)++; |
| 1676 | else |
| 1677 | (nr_dummy)++; |
| 1678 | } else if (!is_dummy(next)) |
| 1679 | (*count)++; |
| 1680 | else |
| 1681 | (nr_dummy)++; |
| 1682 | node = clear_flag(next); |
| 1683 | } while (!is_end(node)); |
| 1684 | dbg_printf("number of dummy nodes: %lu\n", nr_dummy); |
| 1685 | *approx_after = 0; |
| 1686 | if (ht->split_count) { |
| 1687 | int i; |
| 1688 | |
| 1689 | for (i = 0; i < split_count_mask + 1; i++) { |
| 1690 | *approx_after += uatomic_read(&ht->split_count[i].add); |
| 1691 | *approx_after -= uatomic_read(&ht->split_count[i].del); |
| 1692 | } |
| 1693 | } |
| 1694 | } |
| 1695 | |
| 1696 | /* called with resize mutex held */ |
| 1697 | static |
| 1698 | void _do_cds_lfht_grow(struct cds_lfht *ht, |
| 1699 | unsigned long old_size, unsigned long new_size) |
| 1700 | { |
| 1701 | unsigned long old_order, new_order; |
| 1702 | |
| 1703 | old_order = get_count_order_ulong(old_size); |
| 1704 | new_order = get_count_order_ulong(new_size); |
| 1705 | dbg_printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n", |
| 1706 | old_size, old_order, new_size, new_order); |
| 1707 | assert(new_size > old_size); |
| 1708 | init_table(ht, old_order + 1, new_order); |
| 1709 | } |
| 1710 | |
| 1711 | /* called with resize mutex held */ |
| 1712 | static |
| 1713 | void _do_cds_lfht_shrink(struct cds_lfht *ht, |
| 1714 | unsigned long old_size, unsigned long new_size) |
| 1715 | { |
| 1716 | unsigned long old_order, new_order; |
| 1717 | |
| 1718 | new_size = max(new_size, ht->min_alloc_size); |
| 1719 | old_order = get_count_order_ulong(old_size); |
| 1720 | new_order = get_count_order_ulong(new_size); |
| 1721 | dbg_printf("resize from %lu (order %lu) to %lu (order %lu) buckets\n", |
| 1722 | old_size, old_order, new_size, new_order); |
| 1723 | assert(new_size < old_size); |
| 1724 | |
| 1725 | /* Remove and unlink all dummy nodes to remove. */ |
| 1726 | fini_table(ht, new_order + 1, old_order); |
| 1727 | } |
| 1728 | |
| 1729 | |
| 1730 | /* called with resize mutex held */ |
| 1731 | static |
| 1732 | void _do_cds_lfht_resize(struct cds_lfht *ht) |
| 1733 | { |
| 1734 | unsigned long new_size, old_size; |
| 1735 | |
| 1736 | /* |
| 1737 | * Resize table, re-do if the target size has changed under us. |
| 1738 | */ |
| 1739 | do { |
| 1740 | assert(uatomic_read(&ht->in_progress_resize)); |
| 1741 | if (CMM_LOAD_SHARED(ht->in_progress_destroy)) |
| 1742 | break; |
| 1743 | ht->t.resize_initiated = 1; |
| 1744 | old_size = ht->t.size; |
| 1745 | new_size = CMM_LOAD_SHARED(ht->t.resize_target); |
| 1746 | if (old_size < new_size) |
| 1747 | _do_cds_lfht_grow(ht, old_size, new_size); |
| 1748 | else if (old_size > new_size) |
| 1749 | _do_cds_lfht_shrink(ht, old_size, new_size); |
| 1750 | ht->t.resize_initiated = 0; |
| 1751 | /* write resize_initiated before read resize_target */ |
| 1752 | cmm_smp_mb(); |
| 1753 | } while (ht->t.size != CMM_LOAD_SHARED(ht->t.resize_target)); |
| 1754 | } |
| 1755 | |
| 1756 | static |
| 1757 | unsigned long resize_target_grow(struct cds_lfht *ht, unsigned long new_size) |
| 1758 | { |
| 1759 | return _uatomic_xchg_monotonic_increase(&ht->t.resize_target, new_size); |
| 1760 | } |
| 1761 | |
| 1762 | static |
| 1763 | void resize_target_update_count(struct cds_lfht *ht, |
| 1764 | unsigned long count) |
| 1765 | { |
| 1766 | count = max(count, ht->min_alloc_size); |
| 1767 | uatomic_set(&ht->t.resize_target, count); |
| 1768 | } |
| 1769 | |
| 1770 | void cds_lfht_resize(struct cds_lfht *ht, unsigned long new_size) |
| 1771 | { |
| 1772 | resize_target_update_count(ht, new_size); |
| 1773 | CMM_STORE_SHARED(ht->t.resize_initiated, 1); |
| 1774 | ht->cds_lfht_rcu_thread_offline(); |
| 1775 | pthread_mutex_lock(&ht->resize_mutex); |
| 1776 | _do_cds_lfht_resize(ht); |
| 1777 | pthread_mutex_unlock(&ht->resize_mutex); |
| 1778 | ht->cds_lfht_rcu_thread_online(); |
| 1779 | } |
| 1780 | |
| 1781 | static |
| 1782 | void do_resize_cb(struct rcu_head *head) |
| 1783 | { |
| 1784 | struct rcu_resize_work *work = |
| 1785 | caa_container_of(head, struct rcu_resize_work, head); |
| 1786 | struct cds_lfht *ht = work->ht; |
| 1787 | |
| 1788 | ht->cds_lfht_rcu_thread_offline(); |
| 1789 | pthread_mutex_lock(&ht->resize_mutex); |
| 1790 | _do_cds_lfht_resize(ht); |
| 1791 | pthread_mutex_unlock(&ht->resize_mutex); |
| 1792 | ht->cds_lfht_rcu_thread_online(); |
| 1793 | poison_free(work); |
| 1794 | cmm_smp_mb(); /* finish resize before decrement */ |
| 1795 | uatomic_dec(&ht->in_progress_resize); |
| 1796 | } |
| 1797 | |
| 1798 | static |
| 1799 | void __cds_lfht_resize_lazy_launch(struct cds_lfht *ht) |
| 1800 | { |
| 1801 | struct rcu_resize_work *work; |
| 1802 | |
| 1803 | /* Store resize_target before read resize_initiated */ |
| 1804 | cmm_smp_mb(); |
| 1805 | if (!CMM_LOAD_SHARED(ht->t.resize_initiated)) { |
| 1806 | uatomic_inc(&ht->in_progress_resize); |
| 1807 | cmm_smp_mb(); /* increment resize count before load destroy */ |
| 1808 | if (CMM_LOAD_SHARED(ht->in_progress_destroy)) { |
| 1809 | uatomic_dec(&ht->in_progress_resize); |
| 1810 | return; |
| 1811 | } |
| 1812 | work = malloc(sizeof(*work)); |
| 1813 | work->ht = ht; |
| 1814 | ht->cds_lfht_call_rcu(&work->head, do_resize_cb); |
| 1815 | CMM_STORE_SHARED(ht->t.resize_initiated, 1); |
| 1816 | } |
| 1817 | } |
| 1818 | |
| 1819 | static |
| 1820 | void cds_lfht_resize_lazy_grow(struct cds_lfht *ht, unsigned long size, int growth) |
| 1821 | { |
| 1822 | unsigned long target_size = size << growth; |
| 1823 | |
| 1824 | if (resize_target_grow(ht, target_size) >= target_size) |
| 1825 | return; |
| 1826 | |
| 1827 | __cds_lfht_resize_lazy_launch(ht); |
| 1828 | } |
| 1829 | |
| 1830 | /* |
| 1831 | * We favor grow operations over shrink. A shrink operation never occurs |
| 1832 | * if a grow operation is queued for lazy execution. A grow operation |
| 1833 | * cancels any pending shrink lazy execution. |
| 1834 | */ |
| 1835 | static |
| 1836 | void cds_lfht_resize_lazy_count(struct cds_lfht *ht, unsigned long size, |
| 1837 | unsigned long count) |
| 1838 | { |
| 1839 | if (!(ht->flags & CDS_LFHT_AUTO_RESIZE)) |
| 1840 | return; |
| 1841 | count = max(count, ht->min_alloc_size); |
| 1842 | if (count == size) |
| 1843 | return; /* Already the right size, no resize needed */ |
| 1844 | if (count > size) { /* lazy grow */ |
| 1845 | if (resize_target_grow(ht, count) >= count) |
| 1846 | return; |
| 1847 | } else { /* lazy shrink */ |
| 1848 | for (;;) { |
| 1849 | unsigned long s; |
| 1850 | |
| 1851 | s = uatomic_cmpxchg(&ht->t.resize_target, size, count); |
| 1852 | if (s == size) |
| 1853 | break; /* no resize needed */ |
| 1854 | if (s > size) |
| 1855 | return; /* growing is/(was just) in progress */ |
| 1856 | if (s <= count) |
| 1857 | return; /* some other thread do shrink */ |
| 1858 | size = s; |
| 1859 | } |
| 1860 | } |
| 1861 | __cds_lfht_resize_lazy_launch(ht); |
| 1862 | } |