tests/test_urcu_rbtree.c

   1 /*
   2  * test_urcu_rbtree.c
   3  *
   4  * Userspace RCU library - test program for RB tree
   5  *
   6  * Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
   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 #ifndef DYNAMIC_LINK_TEST
  25 #define _LGPL_SOURCE
  26 #else
  27 #define debug_yield_read()
  28 #endif
  29 #include "../config.h"
  30 #include <stdio.h>
  31 #include <pthread.h>
  32 #include <stdlib.h>
  33 #include <string.h>
  34 #include <sys/types.h>
  35 #include <sys/wait.h>
  36 #include <unistd.h>
  37 #include <stdio.h>
  38 #include <assert.h>
  39 #include <sys/syscall.h>
  40 #include <sched.h>
  41 #include <errno.h>
  42 #include <time.h>
  43
  44 #include <urcu/arch.h>
  45
  46 /* hardcoded number of CPUs */
  47 #define NR_CPUS 16384
  48
  49 /* number of insert/delete */
  50 #define NR_RAND 6
  51 //#define NR_RAND 7
  52
  53 #if defined(_syscall0)
  54 _syscall0(pid_t, gettid)
  55 #elif defined(__NR_gettid)
  56 static inline pid_t gettid(void)
  57 {
  58         return syscall(__NR_gettid);
  59 }
  60 #else
  61 #warning "use pid as tid"
  62 static inline pid_t gettid(void)
  63 {
  64         return getpid();
  65 }
  66 #endif
  67
  68 #include <urcu.h>
  69 #include <urcu/rcurbtree.h>
  70 #include <urcu-defer.h>
  71
  72 /* TODO: error handling testing for -ENOMEM */
  73 struct rcu_rbtree_node *rbtree_alloc(void)
  74 {
  75         return calloc(1, sizeof(struct rcu_rbtree_node));
  76 }
  77
  78 void rbtree_free(struct rcu_head *head)
  79 {
  80         struct rcu_rbtree_node *node =
  81                 caa_container_of(head, struct rcu_rbtree_node, head);
  82         free(node);
  83 }
  84
  85 int tree_comp(void *a, void *b)
  86 {
  87         if ((unsigned long)a < (unsigned long)b)
  88                 return -1;
  89         else if ((unsigned long)a > (unsigned long)b)
  90                 return 1;
  91         else
  92                 return 0;
  93 }
  94
  95 static DEFINE_RCU_RBTREE(rbtree, tree_comp, rbtree_alloc, rbtree_free);
  96
  97 static volatile int test_go, test_stop;
  98
  99 static unsigned long wdelay;
 100
 101 static unsigned long duration;
 102
 103 /* read-side C.S. duration, in loops */
 104 static unsigned long rduration;
 105
 106 /* write-side C.S. duration, in loops */
 107 static unsigned long wduration;
 108
 109 static inline void loop_sleep(unsigned long l)
 110 {
 111         while(l-- != 0)
 112                 caa_cpu_relax();
 113 }
 114
 115 static int verbose_mode;
 116
 117 #define printf_verbose(fmt, args...)            \
 118         do {                                    \
 119                 if (verbose_mode)               \
 120                         printf(fmt, args);      \
 121         } while (0)
 122
 123 static unsigned int cpu_affinities[NR_CPUS];
 124 static unsigned int next_aff = 0;
 125 static int use_affinity = 0;
 126
 127 pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
 128
 129 #ifndef HAVE_CPU_SET_T
 130 typedef unsigned long cpu_set_t;
 131 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
 132 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
 133 #endif
 134
 135 static void set_affinity(void)
 136 {
 137         cpu_set_t mask;
 138         int cpu;
 139         int ret;
 140
 141         if (!use_affinity)
 142                 return;
 143
 144 #if HAVE_SCHED_SETAFFINITY
 145         ret = pthread_mutex_lock(&affinity_mutex);
 146         if (ret) {
 147                 perror("Error in pthread mutex lock");
 148                 exit(-1);
 149         }
 150         cpu = cpu_affinities[next_aff++];
 151         ret = pthread_mutex_unlock(&affinity_mutex);
 152         if (ret) {
 153                 perror("Error in pthread mutex unlock");
 154                 exit(-1);
 155         }
 156
 157         CPU_ZERO(&mask);
 158         CPU_SET(cpu, &mask);
 159 #if SCHED_SETAFFINITY_ARGS == 2
 160         sched_setaffinity(0, &mask);
 161 #else
 162         sched_setaffinity(0, sizeof(mask), &mask);
 163 #endif
 164 #endif /* HAVE_SCHED_SETAFFINITY */
 165 }
 166
 167 /*
 168  * returns 0 if test should end.
 169  */
 170 static int test_duration_write(void)
 171 {
 172         return !test_stop;
 173 }
 174
 175 static int test_duration_read(void)
 176 {
 177         return !test_stop;
 178 }
 179
 180 static unsigned long long __thread nr_writes;
 181 static unsigned long long __thread nr_reads;
 182
 183 static unsigned int nr_readers;
 184 static unsigned int nr_writers;
 185
 186 static unsigned long global_items;
 187 static void **global_key = NULL;
 188
 189 pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
 190
 191 void rcu_copy_mutex_lock(void)
 192 {
 193         int ret;
 194         ret = pthread_mutex_lock(&rcu_copy_mutex);
 195         if (ret) {
 196                 perror("Error in pthread mutex lock");
 197                 exit(-1);
 198         }
 199 }
 200
 201 void rcu_copy_mutex_unlock(void)
 202 {
 203         int ret;
 204
 205         ret = pthread_mutex_unlock(&rcu_copy_mutex);
 206         if (ret) {
 207                 perror("Error in pthread mutex unlock");
 208                 exit(-1);
 209         }
 210 }
 211
 212 static
 213 void set_lookup_index(struct rcu_rbtree_node *node,
 214                 char *lookup_hit)
 215 {
 216         int i;
 217
 218         for (i = 0; i < global_items; i++) {
 219                 if (node->key == global_key[i]
 220                     && !lookup_hit[i]) {
 221                         lookup_hit[i] = 1;
 222                         break;
 223                 }
 224         }
 225 }
 226
 227 void *thr_reader(void *_count)
 228 {
 229         unsigned long long *count = _count;
 230         struct rcu_rbtree_node *node;
 231         int i, index;
 232         char *lookup_hit;
 233
 234         printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
 235                         "reader", pthread_self(), (unsigned long)gettid());
 236
 237         set_affinity();
 238
 239         rcu_register_thread();
 240
 241         lookup_hit = malloc(sizeof(*lookup_hit) * global_items);
 242
 243         while (!test_go)
 244         {
 245         }
 246         cmm_smp_mb();
 247
 248         for (;;) {
 249
 250                 /* search */
 251                 for (i = 0; i < global_items; i++) {
 252                         rcu_read_lock();
 253                         node = rcu_rbtree_search(&rbtree,
 254                                                  rcu_dereference(rbtree.root),
 255                                                  global_key[i]);
 256                         assert(!rcu_rbtree_is_nil(node));
 257                         rcu_read_unlock();
 258                 }
 259                 /* min + next */
 260                 memset(lookup_hit, 0, sizeof(*lookup_hit) * global_items);
 261
 262                 rcu_read_lock();
 263                 node = rcu_rbtree_min(&rbtree,
 264                                       rcu_dereference(rbtree.root));
 265                 while (!rcu_rbtree_is_nil(node)) {
 266                         set_lookup_index(node, lookup_hit);
 267                         node = rcu_rbtree_next(&rbtree, node);
 268                 }
 269                 rcu_read_unlock();
 270
 271                 for (i = 0; i < global_items; i++)
 272                         assert(lookup_hit[i]);
 273
 274                 /* max + prev */
 275                 memset(lookup_hit, 0, sizeof(*lookup_hit) * global_items);
 276
 277                 rcu_read_lock();
 278                 node = rcu_rbtree_max(&rbtree,
 279                                       rcu_dereference(rbtree.root));
 280                 while (!rcu_rbtree_is_nil(node)) {
 281                         set_lookup_index(node, lookup_hit);
 282                         node = rcu_rbtree_prev(&rbtree, node);
 283                 }
 284                 rcu_read_unlock();
 285
 286                 for (i = 0; i < global_items; i++)
 287                         assert(lookup_hit[i]);
 288
 289                 debug_yield_read();
 290                 if (unlikely(rduration))
 291                         loop_sleep(rduration);
 292                 nr_reads++;
 293                 if (unlikely(!test_duration_read()))
 294                         break;
 295         }
 296
 297         rcu_unregister_thread();
 298
 299         /* test extra thread registration */
 300         rcu_register_thread();
 301         rcu_unregister_thread();
 302
 303         free(lookup_hit);
 304
 305         *count = nr_reads;
 306         printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
 307                         "reader", pthread_self(), (unsigned long)gettid());
 308         return ((void*)1);
 309
 310 }
 311
 312 void *thr_writer(void *_count)
 313 {
 314         unsigned long long *count = _count;
 315         struct rcu_rbtree_node *node;
 316         void *key[NR_RAND];
 317         int i;
 318
 319         printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
 320                         "writer", pthread_self(), (unsigned long)gettid());
 321
 322         set_affinity();
 323
 324         rcu_register_thread();
 325
 326         while (!test_go)
 327         {
 328         }
 329         cmm_smp_mb();
 330
 331         for (;;) {
 332                 rcu_copy_mutex_lock();
 333
 334                 for (i = 0; i < NR_RAND; i++) {
 335                         node = rbtree_alloc();
 336                         key[i] = (void *)(unsigned long)(rand() % 2048);
 337                         node->key = key[i];
 338                         rcu_read_lock();
 339                         rcu_rbtree_insert(&rbtree, node);
 340                         rcu_read_unlock();
 341                 }
 342                 rcu_copy_mutex_unlock();
 343
 344                 if (unlikely(wduration))
 345                         loop_sleep(wduration);
 346
 347                 rcu_copy_mutex_lock();
 348                 for (i = 0; i < NR_RAND; i++) {
 349 #if 0
 350                         node = rcu_rbtree_min(rbtree, rbtree->root);
 351                         while (!rcu_rbtree_is_nil(node)) {
 352                                 printf("{ 0x%lX p:%lX r:%lX l:%lX %s %s %s} ",
 353                                         (unsigned long)node->key,
 354                                         node->p->key,
 355                                         node->right->key,
 356                                         node->left->key,
 357                                         node->color ? "red" : "black",
 358                                         node->pos ? "right" : "left",
 359                                         node->nil ? "nil" : "");
 360                                 node = rcu_rbtree_next(rbtree, node);
 361                         }
 362                         printf("\n");
 363 #endif
 364                         rcu_read_lock();
 365                         node = rcu_rbtree_search(&rbtree, rbtree.root, key[i]);
 366                         assert(!rcu_rbtree_is_nil(node));
 367                         rcu_rbtree_remove(&rbtree, node);
 368                         rcu_read_unlock();
 369                         call_rcu(&node->head, rbtree_free);
 370                 }
 371
 372                 rcu_copy_mutex_unlock();
 373                 nr_writes++;
 374                 if (unlikely(!test_duration_write()))
 375                         break;
 376                 if (unlikely(wdelay))
 377                         loop_sleep(wdelay);
 378         }
 379
 380         rcu_unregister_thread();
 381
 382         printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
 383                         "writer", pthread_self(), (unsigned long)gettid());
 384         *count = nr_writes;
 385         return ((void*)2);
 386 }
 387
 388 void show_usage(int argc, char **argv)
 389 {
 390         printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
 391 #ifdef DEBUG_YIELD
 392         printf(" [-r] [-w] (yield reader and/or writer)");
 393 #endif
 394         printf(" [-d delay] (writer period (us))");
 395         printf(" [-c duration] (reader C.S. duration (in loops))");
 396         printf(" [-e duration] (writer C.S. duration (in loops))");
 397         printf(" [-v] (verbose output)");
 398         printf(" [-a cpu#] [-a cpu#]... (affinity)");
 399         printf("\n");
 400 }
 401
 402 int main(int argc, char **argv)
 403 {
 404         int err;
 405         pthread_t *tid_reader, *tid_writer;
 406         void *tret;
 407         unsigned long long *count_reader, *count_writer;
 408         unsigned long long tot_reads = 0, tot_writes = 0;
 409         int i, a;
 410         struct rcu_rbtree_node *node;
 411
 412         if (argc < 4) {
 413                 show_usage(argc, argv);
 414                 return -1;
 415         }
 416
 417         err = sscanf(argv[1], "%u", &nr_readers);
 418         if (err != 1) {
 419                 show_usage(argc, argv);
 420                 return -1;
 421         }
 422
 423         err = sscanf(argv[2], "%u", &nr_writers);
 424         if (err != 1) {
 425                 show_usage(argc, argv);
 426                 return -1;
 427         }
 428
 429         err = sscanf(argv[3], "%lu", &duration);
 430         if (err != 1) {
 431                 show_usage(argc, argv);
 432                 return -1;
 433         }
 434
 435         for (i = 4; i < argc; i++) {
 436                 if (argv[i][0] != '-')
 437                         continue;
 438                 switch (argv[i][1]) {
 439 #ifdef DEBUG_YIELD
 440                 case 'r':
 441                         yield_active |= YIELD_READ;
 442                         break;
 443                 case 'w':
 444                         yield_active |= YIELD_WRITE;
 445                         break;
 446 #endif
 447                 case 'a':
 448                         if (argc < i + 2) {
 449                                 show_usage(argc, argv);
 450                                 return -1;
 451                         }
 452                         a = atoi(argv[++i]);
 453                         cpu_affinities[next_aff++] = a;
 454                         use_affinity = 1;
 455                         printf_verbose("Adding CPU %d affinity\n", a);
 456                         break;
 457                 case 'c':
 458                         if (argc < i + 2) {
 459                                 show_usage(argc, argv);
 460                                 return -1;
 461                         }
 462                         rduration = atol(argv[++i]);
 463                         break;
 464                 case 'd':
 465                         if (argc < i + 2) {
 466                                 show_usage(argc, argv);
 467                                 return -1;
 468                         }
 469                         wdelay = atol(argv[++i]);
 470                         break;
 471                 case 'e':
 472                         if (argc < i + 2) {
 473                                 show_usage(argc, argv);
 474                                 return -1;
 475                         }
 476                         wduration = atol(argv[++i]);
 477                         break;
 478                 case 'v':
 479                         verbose_mode = 1;
 480                         break;
 481                 case 'g':
 482                         if (argc < i + 2) {
 483                                 show_usage(argc, argv);
 484                                 return -1;
 485                         }
 486                         global_items = atol(argv[++i]);
 487                         break;
 488                 }
 489         }
 490
 491         printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
 492                 duration, nr_readers, nr_writers);
 493         printf_verbose("Writer delay : %lu loops.\n", wdelay);
 494         printf_verbose("Reader duration : %lu loops.\n", rduration);
 495         printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
 496                         "main", pthread_self(), (unsigned long)gettid());
 497
 498         tid_reader = malloc(sizeof(*tid_reader) * nr_readers);
 499         tid_writer = malloc(sizeof(*tid_writer) * nr_writers);
 500         count_reader = malloc(sizeof(*count_reader) * nr_readers);
 501         count_writer = malloc(sizeof(*count_writer) * nr_writers);
 502         global_key = malloc(sizeof(*global_key) * global_items);
 503
 504         srand(time(NULL));
 505
 506         next_aff = 0;
 507
 508         for (i = 0; i < nr_readers; i++) {
 509                 err = pthread_create(&tid_reader[i], NULL, thr_reader,
 510                                      &count_reader[i]);
 511                 if (err != 0)
 512                         exit(1);
 513         }
 514         for (i = 0; i < nr_writers; i++) {
 515                 err = pthread_create(&tid_writer[i], NULL, thr_writer,
 516                                      &count_writer[i]);
 517                 if (err != 0)
 518                         exit(1);
 519         }
 520
 521         rcu_register_thread();
 522         rcu_read_lock();
 523         /* Insert items looked up by readers */
 524         for (i = 0; i < global_items; i++) {
 525                 node = rbtree_alloc();
 526                 global_key[i] = (void *)(unsigned long)(rand() % 2048);
 527                 node->key = global_key[i];
 528                 rcu_rbtree_insert(&rbtree, node);
 529         }
 530         rcu_read_unlock();
 531
 532         cmm_smp_mb();
 533
 534         test_go = 1;
 535
 536         sleep(duration);
 537
 538         test_stop = 1;
 539
 540         for (i = 0; i < nr_readers; i++) {
 541                 err = pthread_join(tid_reader[i], &tret);
 542                 if (err != 0)
 543                         exit(1);
 544                 tot_reads += count_reader[i];
 545         }
 546         for (i = 0; i < nr_writers; i++) {
 547                 err = pthread_join(tid_writer[i], &tret);
 548                 if (err != 0)
 549                         exit(1);
 550                 tot_writes += count_writer[i];
 551         }
 552
 553         rcu_read_lock();
 554         for (i = 0; i < global_items; i++) {
 555                 node = rcu_rbtree_search(&rbtree, rbtree.root, global_key[i]);
 556                 assert(!rcu_rbtree_is_nil(node));
 557                 rcu_rbtree_remove(&rbtree, node);
 558                 call_rcu(&node->head, rbtree_free);
 559         }
 560         rcu_read_unlock();
 561         rcu_unregister_thread();
 562
 563         printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
 564                tot_writes);
 565         printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
 566                 "nr_writers %3u "
 567                 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
 568                 "global_items %6lu\n",
 569                 argv[0], duration, nr_readers, rduration, wduration,
 570                 nr_writers, wdelay, tot_reads, tot_writes,
 571                 tot_reads + tot_writes, global_items);
 572         free(tid_reader);
 573         free(tid_writer);
 574         free(count_reader);
 575         free(count_writer);
 576         free(global_key);
 577         return 0;
 578 }