tests/test_urcu_hash.c

   1 /*
   2  * test_urcu_hash.c
   3  *
   4  * Userspace RCU library - test program
   5  *
   6  * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
   7  *
   8  * This program is free software; you can redistribute it and/or modify
   9  * it under the terms of the GNU General Public License as published by
  10  * the Free Software Foundation; either version 2 of the License, or
  11  * (at your option) any later version.
  12  *
  13  * This program 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
  16  * GNU General Public License for more details.
  17  *
  18  * You should have received a copy of the GNU General Public License along
  19  * with this program; if not, write to the Free Software Foundation, Inc.,
  20  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  21  */
  22
  23 #define _GNU_SOURCE
  24 #include <stdio.h>
  25 #include <pthread.h>
  26 #include <stdlib.h>
  27 #include <string.h>
  28 #include <sys/types.h>
  29 #include <sys/wait.h>
  30 #include <unistd.h>
  31 #include <stdio.h>
  32 #include <assert.h>
  33 #include <sched.h>
  34 #include <errno.h>
  35
  36 #ifdef __linux__
  37 #include <syscall.h>
  38 #endif
  39
  40 #define DEFAULT_HASH_SIZE       32
  41 #define DEFAULT_MIN_ALLOC_SIZE  1
  42 #define DEFAULT_RAND_POOL       1000000
  43
  44 #define TEST_HASH_SEED  0x42UL
  45
  46 /* Make this big enough to include the POWER5+ L3 cacheline size of 256B */
  47 #define CACHE_LINE_SIZE 4096
  48
  49 /* hardcoded number of CPUs */
  50 #define NR_CPUS 16384
  51
  52 #ifdef POISON_FREE
  53 #define poison_free(ptr)                                \
  54         do {                                            \
  55                 memset(ptr, 0x42, sizeof(*(ptr)));      \
  56                 free(ptr);                              \
  57         } while (0)
  58 #else
  59 #define poison_free(ptr)        free(ptr)
  60 #endif
  61
  62
  63
  64 #if defined(_syscall0)
  65 _syscall0(pid_t, gettid)
  66 #elif defined(__NR_gettid)
  67 static inline pid_t gettid(void)
  68 {
  69         return syscall(__NR_gettid);
  70 }
  71 #else
  72 #warning "use pid as tid"
  73 static inline pid_t gettid(void)
  74 {
  75         return getpid();
  76 }
  77 #endif
  78
  79 #ifndef DYNAMIC_LINK_TEST
  80 #define _LGPL_SOURCE
  81 #else
  82 #define debug_yield_read()
  83 #endif
  84 #include <urcu-qsbr.h>
  85 #include <urcu/rculfhash.h>
  86 #include <urcu-call-rcu.h>
  87
  88 struct wr_count {
  89         unsigned long update_ops;
  90         unsigned long add;
  91         unsigned long add_exist;
  92         unsigned long remove;
  93 };
  94
  95 static unsigned int __thread rand_lookup;
  96 static unsigned long __thread nr_add;
  97 static unsigned long __thread nr_addexist;
  98 static unsigned long __thread nr_del;
  99 static unsigned long __thread nr_delnoent;
 100 static unsigned long __thread lookup_fail;
 101 static unsigned long __thread lookup_ok;
 102
 103 static struct cds_lfht *test_ht;
 104
 105 struct test_data {
 106         int a;
 107         int b;
 108 };
 109
 110 struct lfht_test_node {
 111         struct cds_lfht_node node;
 112         void *key;
 113         unsigned int key_len;
 114         /* cache-cold for iteration */
 115         struct rcu_head head;
 116 };
 117
 118 static inline struct lfht_test_node *
 119 to_test_node(struct cds_lfht_node *node)
 120 {
 121         return caa_container_of(node, struct lfht_test_node, node);
 122 }
 123
 124 static inline
 125 void lfht_test_node_init(struct lfht_test_node *node, void *key,
 126                         size_t key_len)
 127 {
 128         cds_lfht_node_init(&node->node);
 129         node->key = key;
 130         node->key_len = key_len;
 131 }
 132
 133 static inline struct lfht_test_node *
 134 cds_lfht_iter_get_test_node(struct cds_lfht_iter *iter)
 135 {
 136         return to_test_node(cds_lfht_iter_get_node(iter));
 137 }
 138
 139 static volatile int test_go, test_stop;
 140
 141 static unsigned long wdelay;
 142
 143 static unsigned long duration;
 144
 145 /* read-side C.S. duration, in loops */
 146 static unsigned long rduration;
 147
 148 static unsigned long init_hash_size = DEFAULT_HASH_SIZE;
 149 static unsigned long min_hash_alloc_size = DEFAULT_MIN_ALLOC_SIZE;
 150 static unsigned long max_hash_buckets_size = (1UL << 20);
 151 static unsigned long init_populate;
 152 static int opt_auto_resize;
 153 static int add_only, add_unique, add_replace;
 154 static const struct cds_lfht_mm_type *memory_backend;
 155
 156 static unsigned long init_pool_offset, lookup_pool_offset, write_pool_offset;
 157 static unsigned long init_pool_size = DEFAULT_RAND_POOL,
 158         lookup_pool_size = DEFAULT_RAND_POOL,
 159         write_pool_size = DEFAULT_RAND_POOL;
 160 static int validate_lookup;
 161
 162 static int count_pipe[2];
 163
 164 static inline void loop_sleep(unsigned long l)
 165 {
 166         while(l-- != 0)
 167                 caa_cpu_relax();
 168 }
 169
 170 static int verbose_mode;
 171
 172 #define printf_verbose(fmt, args...)            \
 173         do {                                    \
 174                 if (verbose_mode)               \
 175                         printf(fmt, ## args);   \
 176         } while (0)
 177
 178 static unsigned int cpu_affinities[NR_CPUS];
 179 static unsigned int next_aff = 0;
 180 static int use_affinity = 0;
 181
 182 pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
 183
 184 static void set_affinity(void)
 185 {
 186         cpu_set_t mask;
 187         int cpu;
 188         int ret;
 189
 190         if (!use_affinity)
 191                 return;
 192
 193         ret = pthread_mutex_lock(&affinity_mutex);
 194         if (ret) {
 195                 perror("Error in pthread mutex lock");
 196                 exit(-1);
 197         }
 198         cpu = cpu_affinities[next_aff++];
 199         ret = pthread_mutex_unlock(&affinity_mutex);
 200         if (ret) {
 201                 perror("Error in pthread mutex unlock");
 202                 exit(-1);
 203         }
 204         CPU_ZERO(&mask);
 205         CPU_SET(cpu, &mask);
 206         sched_setaffinity(0, sizeof(mask), &mask);
 207 }
 208
 209 static enum {
 210         AR_RANDOM = 0,
 211         AR_ADD = 1,
 212         AR_REMOVE = -1,
 213 } addremove;    /* 1: add, -1 remove, 0: random */
 214
 215 static
 216 void sigusr1_handler(int signo)
 217 {
 218         switch (addremove) {
 219         case AR_ADD:
 220                 printf("Add/Remove: random.\n");
 221                 addremove = AR_RANDOM;
 222                 break;
 223         case AR_RANDOM:
 224                 printf("Add/Remove: remove only.\n");
 225                 addremove = AR_REMOVE;
 226                 break;
 227         case AR_REMOVE:
 228                 printf("Add/Remove: add only.\n");
 229                 addremove = AR_ADD;
 230                 break;
 231         }
 232 }
 233
 234 static
 235 void sigusr2_handler(int signo)
 236 {
 237         char msg[1] = { 0x42 };
 238         ssize_t ret;
 239
 240         do {
 241                 ret = write(count_pipe[1], msg, 1);     /* wakeup thread */
 242         } while (ret == -1L && errno == EINTR);
 243 }
 244
 245 /*
 246  * returns 0 if test should end.
 247  */
 248 static int test_duration_write(void)
 249 {
 250         return !test_stop;
 251 }
 252
 253 static int test_duration_read(void)
 254 {
 255         return !test_stop;
 256 }
 257
 258 static unsigned long long __thread nr_writes;
 259 static unsigned long long __thread nr_reads;
 260
 261 static unsigned int nr_readers;
 262 static unsigned int nr_writers;
 263
 264 pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
 265
 266 void rcu_copy_mutex_lock(void)
 267 {
 268         int ret;
 269         ret = pthread_mutex_lock(&rcu_copy_mutex);
 270         if (ret) {
 271                 perror("Error in pthread mutex lock");
 272                 exit(-1);
 273         }
 274 }
 275
 276 void rcu_copy_mutex_unlock(void)
 277 {
 278         int ret;
 279
 280         ret = pthread_mutex_unlock(&rcu_copy_mutex);
 281         if (ret) {
 282                 perror("Error in pthread mutex unlock");
 283                 exit(-1);
 284         }
 285 }
 286
 287 /*
 288  * Hash function
 289  * Source: http://burtleburtle.net/bob/c/lookup3.c
 290  * Originally Public Domain
 291  */
 292
 293 #define rot(x, k) (((x) << (k)) | ((x) >> (32 - (k))))
 294
 295 #define mix(a, b, c) \
 296 do { \
 297         a -= c; a ^= rot(c,  4); c += b; \
 298         b -= a; b ^= rot(a,  6); a += c; \
 299         c -= b; c ^= rot(b,  8); b += a; \
 300         a -= c; a ^= rot(c, 16); c += b; \
 301         b -= a; b ^= rot(a, 19); a += c; \
 302         c -= b; c ^= rot(b,  4); b += a; \
 303 } while (0)
 304
 305 #define final(a, b, c) \
 306 { \
 307         c ^= b; c -= rot(b, 14); \
 308         a ^= c; a -= rot(c, 11); \
 309         b ^= a; b -= rot(a, 25); \
 310         c ^= b; c -= rot(b, 16); \
 311         a ^= c; a -= rot(c,  4);\
 312         b ^= a; b -= rot(a, 14); \
 313         c ^= b; c -= rot(b, 24); \
 314 }
 315
 316 static __attribute__((unused))
 317 uint32_t hash_u32(
 318         const uint32_t *k,      /* the key, an array of uint32_t values */
 319         size_t length,          /* the length of the key, in uint32_ts */
 320         uint32_t initval)       /* the previous hash, or an arbitrary value */
 321 {
 322         uint32_t a, b, c;
 323
 324         /* Set up the internal state */
 325         a = b = c = 0xdeadbeef + (((uint32_t) length) << 2) + initval;
 326
 327         /*----------------------------------------- handle most of the key */
 328         while (length > 3) {
 329                 a += k[0];
 330                 b += k[1];
 331                 c += k[2];
 332                 mix(a, b, c);
 333                 length -= 3;
 334                 k += 3;
 335         }
 336
 337         /*----------------------------------- handle the last 3 uint32_t's */
 338         switch (length) {       /* all the case statements fall through */
 339         case 3: c += k[2];
 340         case 2: b += k[1];
 341         case 1: a += k[0];
 342                 final(a, b, c);
 343         case 0:                 /* case 0: nothing left to add */
 344                 break;
 345         }
 346         /*---------------------------------------------- report the result */
 347         return c;
 348 }
 349
 350 static
 351 void hashword2(
 352         const uint32_t *k,      /* the key, an array of uint32_t values */
 353         size_t length,          /* the length of the key, in uint32_ts */
 354         uint32_t *pc,           /* IN: seed OUT: primary hash value */
 355         uint32_t *pb)           /* IN: more seed OUT: secondary hash value */
 356 {
 357         uint32_t a, b, c;
 358
 359         /* Set up the internal state */
 360         a = b = c = 0xdeadbeef + ((uint32_t) (length << 2)) + *pc;
 361         c += *pb;
 362
 363         /*----------------------------------------- handle most of the key */
 364         while (length > 3) {
 365                 a += k[0];
 366                 b += k[1];
 367                 c += k[2];
 368                 mix(a, b, c);
 369                 length -= 3;
 370                 k += 3;
 371         }
 372
 373         /*----------------------------------- handle the last 3 uint32_t's */
 374         switch (length) {       /* all the case statements fall through */
 375         case 3: c += k[2];
 376         case 2: b += k[1];
 377         case 1: a += k[0];
 378                 final(a, b, c);
 379         case 0:                 /* case 0: nothing left to add */
 380                 break;
 381         }
 382         /*---------------------------------------------- report the result */
 383         *pc = c;
 384         *pb = b;
 385 }
 386
 387 #if (CAA_BITS_PER_LONG == 32)
 388 static
 389 unsigned long test_hash(const void *_key, size_t length, unsigned long seed)
 390 {
 391         unsigned int key = (unsigned int) _key;
 392
 393         assert(length == sizeof(unsigned int));
 394         return hash_u32(&key, 1, seed);
 395 }
 396 #else
 397 static
 398 unsigned long test_hash(const void *_key, size_t length, unsigned long seed)
 399 {
 400         union {
 401                 uint64_t v64;
 402                 uint32_t v32[2];
 403         } v;
 404         union {
 405                 uint64_t v64;
 406                 uint32_t v32[2];
 407         } key;
 408
 409         assert(length == sizeof(unsigned long));
 410         v.v64 = (uint64_t) seed;
 411         key.v64 = (uint64_t) _key;
 412         hashword2(key.v32, 2, &v.v32[0], &v.v32[1]);
 413         return v.v64;
 414 }
 415 #endif
 416
 417 static
 418 unsigned long test_compare(const void *key1, size_t key1_len,
 419                            const void *key2, size_t key2_len)
 420 {
 421         if (caa_unlikely(key1_len != key2_len))
 422                 return -1;
 423         assert(key1_len == sizeof(unsigned long));
 424         if (key1 == key2)
 425                 return 0;
 426         else
 427                 return 1;
 428 }
 429
 430 static
 431 int test_match(struct cds_lfht_node *node, const void *key)
 432 {
 433         struct lfht_test_node *test_node = to_test_node(node);
 434
 435         return !test_compare(test_node->key, test_node->key_len,
 436                         key, sizeof(unsigned long));
 437 }
 438
 439 static inline
 440 void cds_lfht_test_lookup(struct cds_lfht *ht, void *key, size_t key_len,
 441                 struct cds_lfht_iter *iter)
 442 {
 443         assert(key_len == sizeof(unsigned long));
 444
 445         cds_lfht_lookup(ht, test_hash(key, key_len, TEST_HASH_SEED),
 446                         test_match, key, iter);
 447 }
 448
 449 void *thr_count(void *arg)
 450 {
 451         printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
 452                         "counter", pthread_self(), (unsigned long)gettid());
 453
 454         rcu_register_thread();
 455
 456         for (;;) {
 457                 unsigned long count, removed;
 458                 long approx_before, approx_after;
 459                 ssize_t len;
 460                 char buf[1];
 461
 462                 rcu_thread_offline();
 463                 len = read(count_pipe[0], buf, 1);
 464                 rcu_thread_online();
 465                 if (caa_unlikely(!test_duration_read()))
 466                         break;
 467                 if (len != 1)
 468                         continue;
 469                 /* Accounting */
 470                 printf("Counting nodes... ");
 471                 fflush(stdout);
 472                 rcu_read_lock();
 473                 cds_lfht_count_nodes(test_ht, &approx_before, &count, &removed,
 474                                 &approx_after);
 475                 rcu_read_unlock();
 476                 printf("done.\n");
 477                 printf("Approximation before node accounting: %ld nodes.\n",
 478                         approx_before);
 479                 printf("Accounting of nodes in the hash table: "
 480                         "%lu nodes + %lu logically removed.\n",
 481                         count, removed);
 482                 printf("Approximation after node accounting: %ld nodes.\n",
 483                         approx_after);
 484         }
 485         rcu_unregister_thread();
 486         return NULL;
 487 }
 488
 489 void *thr_reader(void *_count)
 490 {
 491         unsigned long long *count = _count;
 492         struct lfht_test_node *node;
 493         struct cds_lfht_iter iter;
 494
 495         printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
 496                         "reader", pthread_self(), (unsigned long)gettid());
 497
 498         set_affinity();
 499
 500         rcu_register_thread();
 501
 502         while (!test_go)
 503         {
 504         }
 505         cmm_smp_mb();
 506
 507         for (;;) {
 508                 rcu_read_lock();
 509                 cds_lfht_test_lookup(test_ht,
 510                         (void *)(((unsigned long) rand_r(&rand_lookup) % lookup_pool_size) + lookup_pool_offset),
 511                         sizeof(void *), &iter);
 512                 node = cds_lfht_iter_get_test_node(&iter);
 513                 if (node == NULL) {
 514                         if (validate_lookup) {
 515                                 printf("[ERROR] Lookup cannot find initial node.\n");
 516                                 exit(-1);
 517                         }
 518                         lookup_fail++;
 519                 } else {
 520                         lookup_ok++;
 521                 }
 522                 debug_yield_read();
 523                 if (caa_unlikely(rduration))
 524                         loop_sleep(rduration);
 525                 rcu_read_unlock();
 526                 nr_reads++;
 527                 if (caa_unlikely(!test_duration_read()))
 528                         break;
 529                 if (caa_unlikely((nr_reads & ((1 << 10) - 1)) == 0))
 530                         rcu_quiescent_state();
 531         }
 532
 533         rcu_unregister_thread();
 534
 535         *count = nr_reads;
 536         printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
 537                         "reader", pthread_self(), (unsigned long)gettid());
 538         printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
 539                         pthread_self(), lookup_fail, lookup_ok);
 540         return ((void*)1);
 541
 542 }
 543
 544 static
 545 void free_node_cb(struct rcu_head *head)
 546 {
 547         struct lfht_test_node *node =
 548                 caa_container_of(head, struct lfht_test_node, head);
 549         free(node);
 550 }
 551
 552 void *thr_writer(void *_count)
 553 {
 554         struct lfht_test_node *node;
 555         struct cds_lfht_node *ret_node;
 556         struct cds_lfht_iter iter;
 557         struct wr_count *count = _count;
 558         int ret;
 559
 560         printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
 561                         "writer", pthread_self(), (unsigned long)gettid());
 562
 563         set_affinity();
 564
 565         rcu_register_thread();
 566
 567         while (!test_go)
 568         {
 569         }
 570         cmm_smp_mb();
 571
 572         for (;;) {
 573                 if ((addremove == AR_ADD || add_only)
 574                                 || (addremove == AR_RANDOM && rand_r(&rand_lookup) & 1)) {
 575                         node = malloc(sizeof(struct lfht_test_node));
 576                         lfht_test_node_init(node,
 577                                 (void *)(((unsigned long) rand_r(&rand_lookup) % write_pool_size) + write_pool_offset),
 578                                 sizeof(void *));
 579                         rcu_read_lock();
 580                         if (add_unique) {
 581                                 ret_node = cds_lfht_add_unique(test_ht,
 582                                         test_hash(node->key, node->key_len, TEST_HASH_SEED),
 583                                         test_match, node->key, &node->node);
 584                         } else {
 585                                 if (add_replace)
 586                                         ret_node = cds_lfht_add_replace(test_ht,
 587                                                         test_hash(node->key, node->key_len, TEST_HASH_SEED),
 588                                                         test_match, node->key, &node->node);
 589                                 else
 590                                         cds_lfht_add(test_ht,
 591                                                 test_hash(node->key, node->key_len, TEST_HASH_SEED),
 592                                                 &node->node);
 593                         }
 594                         rcu_read_unlock();
 595                         if (add_unique && ret_node != &node->node) {
 596                                 free(node);
 597                                 nr_addexist++;
 598                         } else {
 599                                 if (add_replace && ret_node) {
 600                                         call_rcu(&to_test_node(ret_node)->head,
 601                                                         free_node_cb);
 602                                         nr_addexist++;
 603                                 } else {
 604                                         nr_add++;
 605                                 }
 606                         }
 607                 } else {
 608                         /* May delete */
 609                         rcu_read_lock();
 610                         cds_lfht_test_lookup(test_ht,
 611                                 (void *)(((unsigned long) rand_r(&rand_lookup) % write_pool_size) + write_pool_offset),
 612                                 sizeof(void *), &iter);
 613                         ret = cds_lfht_del(test_ht, &iter);
 614                         rcu_read_unlock();
 615                         if (ret == 0) {
 616                                 node = cds_lfht_iter_get_test_node(&iter);
 617                                 call_rcu(&node->head, free_node_cb);
 618                                 nr_del++;
 619                         } else
 620                                 nr_delnoent++;
 621                 }
 622 #if 0
 623                 //if (nr_writes % 100000 == 0) {
 624                 if (nr_writes % 1000 == 0) {
 625                         rcu_read_lock();
 626                         if (rand_r(&rand_lookup) & 1) {
 627                                 ht_resize(test_ht, 1);
 628                         } else {
 629                                 ht_resize(test_ht, -1);
 630                         }
 631                         rcu_read_unlock();
 632                 }
 633 #endif //0
 634                 nr_writes++;
 635                 if (caa_unlikely(!test_duration_write()))
 636                         break;
 637                 if (caa_unlikely(wdelay))
 638                         loop_sleep(wdelay);
 639                 if (caa_unlikely((nr_writes & ((1 << 10) - 1)) == 0))
 640                         rcu_quiescent_state();
 641         }
 642
 643         rcu_unregister_thread();
 644
 645         printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
 646                         "writer", pthread_self(), (unsigned long)gettid());
 647         printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
 648                         "nr_delnoent %lu\n", pthread_self(), nr_add,
 649                         nr_addexist, nr_del, nr_delnoent);
 650         count->update_ops = nr_writes;
 651         count->add = nr_add;
 652         count->add_exist = nr_addexist;
 653         count->remove = nr_del;
 654         return ((void*)2);
 655 }
 656
 657 static int populate_hash(void)
 658 {
 659         struct lfht_test_node *node;
 660         struct cds_lfht_node *ret_node;
 661
 662         if (!init_populate)
 663                 return 0;
 664
 665         if ((add_unique || add_replace) && init_populate * 10 > init_pool_size) {
 666                 printf("WARNING: required to populate %lu nodes (-k), but random "
 667 "pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
 668 "larger random pool (-p option). This may take a while...\n", init_populate, init_pool_size);
 669         }
 670
 671         while (nr_add < init_populate) {
 672                 node = malloc(sizeof(struct lfht_test_node));
 673                 lfht_test_node_init(node,
 674                         (void *)(((unsigned long) rand_r(&rand_lookup) % init_pool_size) + init_pool_offset),
 675                         sizeof(void *));
 676                 rcu_read_lock();
 677                 if (add_unique) {
 678                         ret_node = cds_lfht_add_unique(test_ht,
 679                                 test_hash(node->key, node->key_len, TEST_HASH_SEED),
 680                                 test_match, node->key, &node->node);
 681                 } else {
 682                         if (add_replace)
 683                                 ret_node = cds_lfht_add_replace(test_ht,
 684                                                 test_hash(node->key, node->key_len, TEST_HASH_SEED),
 685                                                 test_match, node->key, &node->node);
 686                         else
 687                                 cds_lfht_add(test_ht,
 688                                         test_hash(node->key, node->key_len, TEST_HASH_SEED),
 689                                         &node->node);
 690                 }
 691                 rcu_read_unlock();
 692                 if (add_unique && ret_node != &node->node) {
 693                         free(node);
 694                         nr_addexist++;
 695                 } else {
 696                         if (add_replace && ret_node) {
 697                                 call_rcu(&to_test_node(ret_node)->head, free_node_cb);
 698                                 nr_addexist++;
 699                         } else {
 700                                 nr_add++;
 701                         }
 702                 }
 703                 nr_writes++;
 704         }
 705         return 0;
 706 }
 707
 708 static
 709 void test_delete_all_nodes(struct cds_lfht *ht)
 710 {
 711         struct cds_lfht_iter iter;
 712         struct lfht_test_node *node;
 713         unsigned long count = 0;
 714
 715         cds_lfht_for_each_entry(ht, &iter, node, node) {
 716                 int ret;
 717
 718                 ret = cds_lfht_del(test_ht, &iter);
 719                 assert(!ret);
 720                 call_rcu(&node->head, free_node_cb);
 721                 count++;
 722         }
 723         printf("deleted %lu nodes.\n", count);
 724 }
 725
 726 void show_usage(int argc, char **argv)
 727 {
 728         printf("Usage : %s nr_readers nr_writers duration (s)\n", argv[0]);
 729 #ifdef DEBUG_YIELD
 730         printf("        [-r] [-w] (yield reader and/or writer)\n");
 731 #endif
 732         printf("        [-d delay] (writer period (us))\n");
 733         printf("        [-c duration] (reader C.S. duration (in loops))\n");
 734         printf("        [-v] (verbose output)\n");
 735         printf("        [-a cpu#] [-a cpu#]... (affinity)\n");
 736         printf("        [-h size] (initial number of buckets)\n");
 737         printf("        [-m size] (minimum number of allocated buckets)\n");
 738         printf("        [-n size] (maximum number of buckets)\n");
 739         printf("        [not -u nor -s] Add entries (supports redundant keys).\n");
 740         printf("        [-u] Uniquify add (no redundant keys).\n");
 741         printf("        [-s] Replace (swap) entries.\n");
 742         printf("        [-i] Add only (no removal).\n");
 743         printf("        [-k nr_nodes] Number of nodes to insert initially.\n");
 744         printf("        [-A] Automatically resize hash table.\n");
 745         printf("        [-B order|chunk|mmap] Specify the memory backend.\n");
 746         printf("        [-R offset] Lookup pool offset.\n");
 747         printf("        [-S offset] Write pool offset.\n");
 748         printf("        [-T offset] Init pool offset.\n");
 749         printf("        [-M size] Lookup pool size.\n");
 750         printf("        [-N size] Write pool size.\n");
 751         printf("        [-O size] Init pool size.\n");
 752         printf("        [-V] Validate lookups of init values (use with filled init pool, same lookup range, with different write range).\n");
 753         printf("\n\n");
 754 }
 755
 756 int main(int argc, char **argv)
 757 {
 758         int err;
 759         pthread_t *tid_reader, *tid_writer;
 760         pthread_t tid_count;
 761         void *tret;
 762         unsigned long long *count_reader;
 763         struct wr_count *count_writer;
 764         unsigned long long tot_reads = 0, tot_writes = 0,
 765                 tot_add = 0, tot_add_exist = 0, tot_remove = 0;
 766         unsigned long count, removed;
 767         long approx_before, approx_after;
 768         int i, a, ret;
 769         struct sigaction act;
 770         unsigned int remain;
 771
 772         if (argc < 4) {
 773                 show_usage(argc, argv);
 774                 return -1;
 775         }
 776
 777         err = sscanf(argv[1], "%u", &nr_readers);
 778         if (err != 1) {
 779                 show_usage(argc, argv);
 780                 return -1;
 781         }
 782
 783         err = sscanf(argv[2], "%u", &nr_writers);
 784         if (err != 1) {
 785                 show_usage(argc, argv);
 786                 return -1;
 787         }
 788
 789         err = sscanf(argv[3], "%lu", &duration);
 790         if (err != 1) {
 791                 show_usage(argc, argv);
 792                 return -1;
 793         }
 794
 795         for (i = 4; i < argc; i++) {
 796                 if (argv[i][0] != '-')
 797                         continue;
 798                 switch (argv[i][1]) {
 799 #ifdef DEBUG_YIELD
 800                 case 'r':
 801                         yield_active |= YIELD_READ;
 802                         break;
 803                 case 'w':
 804                         yield_active |= YIELD_WRITE;
 805                         break;
 806 #endif
 807                 case 'a':
 808                         if (argc < i + 2) {
 809                                 show_usage(argc, argv);
 810                                 return -1;
 811                         }
 812                         a = atoi(argv[++i]);
 813                         cpu_affinities[next_aff++] = a;
 814                         use_affinity = 1;
 815                         printf_verbose("Adding CPU %d affinity\n", a);
 816                         break;
 817                 case 'c':
 818                         if (argc < i + 2) {
 819                                 show_usage(argc, argv);
 820                                 return -1;
 821                         }
 822                         rduration = atol(argv[++i]);
 823                         break;
 824                 case 'd':
 825                         if (argc < i + 2) {
 826                                 show_usage(argc, argv);
 827                                 return -1;
 828                         }
 829                         wdelay = atol(argv[++i]);
 830                         break;
 831                 case 'v':
 832                         verbose_mode = 1;
 833                         break;
 834                 case 'h':
 835                         if (argc < i + 2) {
 836                                 show_usage(argc, argv);
 837                                 return -1;
 838                         }
 839                         init_hash_size = atol(argv[++i]);
 840                         break;
 841                 case 'm':
 842                         if (argc < i + 2) {
 843                                 show_usage(argc, argv);
 844                                 return -1;
 845                         }
 846                         min_hash_alloc_size = atol(argv[++i]);
 847                         break;
 848                 case 'n':
 849                         if (argc < i + 2) {
 850                                 show_usage(argc, argv);
 851                                 return -1;
 852                         }
 853                         max_hash_buckets_size = atol(argv[++i]);
 854                         break;
 855                 case 'u':
 856                         if (add_replace) {
 857                                 printf("Please specify at most one of -s or -u.\n");
 858                                 exit(-1);
 859                         }
 860                         add_unique = 1;
 861                         break;
 862                 case 's':
 863                         if (add_unique) {
 864                                 printf("Please specify at most one of -s or -u.\n");
 865                                 exit(-1);
 866                         }
 867                         add_replace = 1;
 868                         break;
 869                 case 'i':
 870                         add_only = 1;
 871                         break;
 872                 case 'k':
 873                         init_populate = atol(argv[++i]);
 874                         break;
 875                 case 'A':
 876                         opt_auto_resize = 1;
 877                         break;
 878                 case 'B':
 879                         if (argc < i + 2) {
 880                                 show_usage(argc, argv);
 881                                 return -1;
 882                         }
 883                         i++;
 884                         if (!strcmp("order", argv[i]))
 885                                 memory_backend = &cds_lfht_mm_order;
 886                         else if (!strcmp("chunk", argv[i]))
 887                                 memory_backend = &cds_lfht_mm_chunk;
 888                         else if (!strcmp("mmap", argv[i]))
 889                                 memory_backend = &cds_lfht_mm_mmap;
 890                         else {
 891                                 printf("Please specify memory backend with order|chunk|mmap.\n");
 892                                 exit(-1);
 893                         }
 894                         break;
 895                 case 'R':
 896                         lookup_pool_offset = atol(argv[++i]);
 897                         break;
 898                 case 'S':
 899                         write_pool_offset = atol(argv[++i]);
 900                         break;
 901                 case 'T':
 902                         init_pool_offset = atol(argv[++i]);
 903                         break;
 904                 case 'M':
 905                         lookup_pool_size = atol(argv[++i]);
 906                         break;
 907                 case 'N':
 908                         write_pool_size = atol(argv[++i]);
 909                         break;
 910                 case 'O':
 911                         init_pool_size = atol(argv[++i]);
 912                         break;
 913                 case 'V':
 914                         validate_lookup = 1;
 915                         break;
 916
 917                 }
 918         }
 919
 920         /* Check if hash size is power of 2 */
 921         if (init_hash_size && init_hash_size & (init_hash_size - 1)) {
 922                 printf("Error: Initial number of buckets (%lu) is not a power of 2.\n",
 923                         init_hash_size);
 924                 return -1;
 925         }
 926
 927         if (min_hash_alloc_size && min_hash_alloc_size & (min_hash_alloc_size - 1)) {
 928                 printf("Error: Minimum number of allocated buckets (%lu) is not a power of 2.\n",
 929                         min_hash_alloc_size);
 930                 return -1;
 931         }
 932
 933         if (max_hash_buckets_size && max_hash_buckets_size & (max_hash_buckets_size - 1)) {
 934                 printf("Error: Maximum number of buckets (%lu) is not a power of 2.\n",
 935                         max_hash_buckets_size);
 936                 return -1;
 937         }
 938
 939         memset(&act, 0, sizeof(act));
 940         ret = sigemptyset(&act.sa_mask);
 941         if (ret == -1) {
 942                 perror("sigemptyset");
 943                 return -1;
 944         }
 945         act.sa_handler = sigusr1_handler;
 946         act.sa_flags = SA_RESTART;
 947         ret = sigaction(SIGUSR1, &act, NULL);
 948         if (ret == -1) {
 949                 perror("sigaction");
 950                 return -1;
 951         }
 952
 953         ret = pipe(count_pipe);
 954         if (ret == -1) {
 955                 perror("pipe");
 956                 return -1;
 957         }
 958
 959         /* spawn counter thread */
 960         err = pthread_create(&tid_count, NULL, thr_count,
 961                              NULL);
 962         if (err != 0)
 963                 exit(1);
 964
 965         act.sa_handler = sigusr2_handler;
 966         act.sa_flags = SA_RESTART;
 967         ret = sigaction(SIGUSR2, &act, NULL);
 968         if (ret == -1) {
 969                 perror("sigaction");
 970                 return -1;
 971         }
 972
 973         printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
 974                 duration, nr_readers, nr_writers);
 975         printf_verbose("Writer delay : %lu loops.\n", wdelay);
 976         printf_verbose("Reader duration : %lu loops.\n", rduration);
 977         printf_verbose("Mode:%s%s.\n",
 978                 add_only ? " add only" : " add/remove",
 979                 add_unique ? " uniquify" : ( add_replace ? " replace" : " insert"));
 980         printf_verbose("Initial number of buckets: %lu buckets.\n", init_hash_size);
 981         printf_verbose("Minimum number of allocated buckets: %lu buckets.\n", min_hash_alloc_size);
 982         printf_verbose("Maximum number of buckets: %lu buckets.\n", max_hash_buckets_size);
 983         printf_verbose("Init pool size offset %lu size %lu.\n",
 984                 init_pool_offset, init_pool_size);
 985         printf_verbose("Lookup pool size offset %lu size %lu.\n",
 986                 lookup_pool_offset, lookup_pool_size);
 987         printf_verbose("Update pool size offset %lu size %lu.\n",
 988                 write_pool_offset, write_pool_size);
 989         printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
 990                         "main", pthread_self(), (unsigned long)gettid());
 991
 992         tid_reader = malloc(sizeof(*tid_reader) * nr_readers);
 993         tid_writer = malloc(sizeof(*tid_writer) * nr_writers);
 994         count_reader = malloc(sizeof(*count_reader) * nr_readers);
 995         count_writer = malloc(sizeof(*count_writer) * nr_writers);
 996
 997         err = create_all_cpu_call_rcu_data(0);
 998         assert(!err);
 999
1000         if (memory_backend) {
1001                 test_ht = _cds_lfht_new(init_hash_size, min_hash_alloc_size,
1002                                 max_hash_buckets_size,
1003                                 (opt_auto_resize ? CDS_LFHT_AUTO_RESIZE : 0) |
1004                                 CDS_LFHT_ACCOUNTING, memory_backend,
1005                                 &rcu_flavor, NULL);
1006         } else {
1007                 test_ht = cds_lfht_new(init_hash_size, min_hash_alloc_size,
1008                                 max_hash_buckets_size,
1009                                 (opt_auto_resize ? CDS_LFHT_AUTO_RESIZE : 0) |
1010                                 CDS_LFHT_ACCOUNTING, NULL);
1011         }
1012
1013         /*
1014          * Hash Population needs to be seen as a RCU reader
1015          * thread from the point of view of resize.
1016          */
1017         rcu_register_thread();
1018         ret = populate_hash();
1019         assert(!ret);
1020
1021         rcu_thread_offline();
1022
1023         next_aff = 0;
1024
1025         for (i = 0; i < nr_readers; i++) {
1026                 err = pthread_create(&tid_reader[i], NULL, thr_reader,
1027                                      &count_reader[i]);
1028                 if (err != 0)
1029                         exit(1);
1030         }
1031         for (i = 0; i < nr_writers; i++) {
1032                 err = pthread_create(&tid_writer[i], NULL, thr_writer,
1033                                      &count_writer[i]);
1034                 if (err != 0)
1035                         exit(1);
1036         }
1037
1038         cmm_smp_mb();
1039
1040         test_go = 1;
1041
1042         remain = duration;
1043         do {
1044                 remain = sleep(remain);
1045         } while (remain > 0);
1046
1047         test_stop = 1;
1048
1049         for (i = 0; i < nr_readers; i++) {
1050                 err = pthread_join(tid_reader[i], &tret);
1051                 if (err != 0)
1052                         exit(1);
1053                 tot_reads += count_reader[i];
1054         }
1055         for (i = 0; i < nr_writers; i++) {
1056                 err = pthread_join(tid_writer[i], &tret);
1057                 if (err != 0)
1058                         exit(1);
1059                 tot_writes += count_writer[i].update_ops;
1060                 tot_add += count_writer[i].add;
1061                 tot_add_exist += count_writer[i].add_exist;
1062                 tot_remove += count_writer[i].remove;
1063         }
1064
1065         /* teardown counter thread */
1066         act.sa_handler = SIG_IGN;
1067         act.sa_flags = SA_RESTART;
1068         ret = sigaction(SIGUSR2, &act, NULL);
1069         if (ret == -1) {
1070                 perror("sigaction");
1071                 return -1;
1072         }
1073         {
1074                 char msg[1] = { 0x42 };
1075                 ssize_t ret;
1076
1077                 do {
1078                         ret = write(count_pipe[1], msg, 1);     /* wakeup thread */
1079                 } while (ret == -1L && errno == EINTR);
1080         }
1081         err = pthread_join(tid_count, &tret);
1082         if (err != 0)
1083                 exit(1);
1084
1085         fflush(stdout);
1086         rcu_thread_online();
1087         rcu_read_lock();
1088         printf("Counting nodes... ");
1089         cds_lfht_count_nodes(test_ht, &approx_before, &count, &removed,
1090                 &approx_after);
1091         printf("done.\n");
1092         test_delete_all_nodes(test_ht);
1093         rcu_read_unlock();
1094         rcu_thread_offline();
1095         if (count || removed) {
1096                 printf("Approximation before node accounting: %ld nodes.\n",
1097                         approx_before);
1098                 printf("Nodes deleted from hash table before destroy: "
1099                         "%lu nodes + %lu logically removed.\n",
1100                         count, removed);
1101                 printf("Approximation after node accounting: %ld nodes.\n",
1102                         approx_after);
1103         }
1104         ret = cds_lfht_destroy(test_ht, NULL);
1105         if (ret)
1106                 printf_verbose("final delete aborted\n");
1107         else
1108                 printf_verbose("final delete success\n");
1109         printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
1110                tot_writes);
1111         printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
1112                 "nr_writers %3u "
1113                 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
1114                 "nr_add %12llu nr_add_fail %12llu nr_remove %12llu nr_leaked %12lld\n",
1115                 argv[0], duration, nr_readers, rduration,
1116                 nr_writers, wdelay, tot_reads, tot_writes,
1117                 tot_reads + tot_writes, tot_add, tot_add_exist, tot_remove,
1118                 (long long) tot_add + init_populate - tot_remove - count);
1119         rcu_unregister_thread();
1120         free_all_cpu_call_rcu_data();
1121         free(tid_reader);
1122         free(tid_writer);
1123         free(count_reader);
1124         free(count_writer);
1125         return 0;
1126 }