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