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