4 * Userspace RCU library - test program for RB tree
6 * Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
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.
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.
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.
24 #ifndef DYNAMIC_LINK_TEST
27 #define debug_yield_read()
29 #include "../config.h"
34 #include <sys/types.h>
39 #include <sys/syscall.h>
44 #include <urcu/arch.h>
46 extern int __thread disable_debug
;
48 /* hardcoded number of CPUs */
51 /* number of insert/delete */
55 #if defined(_syscall0)
56 _syscall0(pid_t
, gettid
)
57 #elif defined(__NR_gettid)
58 static inline pid_t
gettid(void)
60 return syscall(__NR_gettid
);
63 #warning "use pid as tid"
64 static inline pid_t
gettid(void)
71 #include <urcu/rcurbtree.h>
72 #include <urcu-defer.h>
74 /* TODO: error handling testing for -ENOMEM */
75 struct rcu_rbtree_node
*rbtree_alloc(void)
77 return calloc(1, sizeof(struct rcu_rbtree_node
));
80 void rbtree_free(struct rcu_head
*head
)
82 struct rcu_rbtree_node
*node
=
83 caa_container_of(head
, struct rcu_rbtree_node
, head
);
87 int tree_comp(void *a
, void *b
)
89 if ((unsigned long)a
< (unsigned long)b
)
91 else if ((unsigned long)a
> (unsigned long)b
)
97 static DEFINE_RCU_RBTREE(rbtree
, tree_comp
, rbtree_alloc
, rbtree_free
);
99 static volatile int test_go
, test_stop
;
101 static unsigned long wdelay
;
103 static unsigned long duration
;
105 /* read-side C.S. duration, in loops */
106 static unsigned long rduration
;
108 /* write-side C.S. duration, in loops */
109 static unsigned long wduration
;
111 static inline void loop_sleep(unsigned long l
)
117 static int verbose_mode
;
119 #define printf_verbose(fmt, args...) \
125 static unsigned int cpu_affinities
[NR_CPUS
];
126 static unsigned int next_aff
= 0;
127 static int use_affinity
= 0;
129 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
131 #ifndef HAVE_CPU_SET_T
132 typedef unsigned long cpu_set_t
;
133 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
134 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
137 static void set_affinity(void)
146 #if HAVE_SCHED_SETAFFINITY
147 ret
= pthread_mutex_lock(&affinity_mutex
);
149 perror("Error in pthread mutex lock");
152 cpu
= cpu_affinities
[next_aff
++];
153 ret
= pthread_mutex_unlock(&affinity_mutex
);
155 perror("Error in pthread mutex unlock");
161 #if SCHED_SETAFFINITY_ARGS == 2
162 sched_setaffinity(0, &mask
);
164 sched_setaffinity(0, sizeof(mask
), &mask
);
166 #endif /* HAVE_SCHED_SETAFFINITY */
170 * returns 0 if test should end.
172 static int test_duration_write(void)
177 static int test_duration_read(void)
182 static unsigned long long __thread nr_writes
;
183 static unsigned long long __thread nr_reads
;
185 static unsigned int nr_readers
;
186 static unsigned int nr_writers
;
188 static unsigned long global_items
;
189 static void **global_key
= NULL
;
191 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
193 void rcu_copy_mutex_lock(void)
196 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
198 perror("Error in pthread mutex lock");
203 void rcu_copy_mutex_unlock(void)
207 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
209 perror("Error in pthread mutex unlock");
215 void set_lookup_index(struct rcu_rbtree_node
*node
,
220 for (i
= 0; i
< global_items
; i
++) {
221 if (node
->begin
== global_key
[i
]
229 void *thr_reader(void *_count
)
231 unsigned long long *count
= _count
;
232 struct rcu_rbtree_node
*node
;
236 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
237 "reader", pthread_self(), (unsigned long)gettid());
241 rcu_register_thread();
243 lookup_hit
= malloc(sizeof(*lookup_hit
) * global_items
);
252 for (i
= 0; i
< global_items
; i
++) {
254 node
= rcu_rbtree_search(&rbtree
,
255 rcu_dereference(rbtree
.root
),
257 assert(!rcu_rbtree_is_nil(&rbtree
, node
));
262 for (i
= 0; i
< global_items
; i
++) {
264 node
= rcu_rbtree_search_range(&rbtree
,
265 rcu_dereference(rbtree
.root
),
267 (void*) ((unsigned long) global_key
[i
] + 1));
268 assert(!rcu_rbtree_is_nil(&rbtree
, node
));
272 /* search begin key */
273 for (i
= 0; i
< global_items
; i
++) {
275 node
= rcu_rbtree_search_begin_key(&rbtree
,
276 rcu_dereference(rbtree
.root
),
278 assert(!rcu_rbtree_is_nil(&rbtree
, node
));
283 memset(lookup_hit
, 0, sizeof(*lookup_hit
) * global_items
);
286 node
= rcu_rbtree_min(&rbtree
,
287 rcu_dereference(rbtree
.root
));
288 while (!rcu_rbtree_is_nil(&rbtree
, node
)) {
289 set_lookup_index(node
, lookup_hit
);
290 node
= rcu_rbtree_next(&rbtree
, node
);
294 for (i
= 0; i
< global_items
; i
++)
295 assert(lookup_hit
[i
]);
298 memset(lookup_hit
, 0, sizeof(*lookup_hit
) * global_items
);
301 node
= rcu_rbtree_max(&rbtree
,
302 rcu_dereference(rbtree
.root
));
303 while (!rcu_rbtree_is_nil(&rbtree
, node
)) {
304 set_lookup_index(node
, lookup_hit
);
305 node
= rcu_rbtree_prev(&rbtree
, node
);
309 for (i
= 0; i
< global_items
; i
++)
310 assert(lookup_hit
[i
]);
313 if (unlikely(rduration
))
314 loop_sleep(rduration
);
316 if (unlikely(!test_duration_read()))
320 rcu_unregister_thread();
322 /* test extra thread registration */
323 rcu_register_thread();
324 rcu_unregister_thread();
329 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
330 "reader", pthread_self(), (unsigned long)gettid());
335 void *thr_writer(void *_count
)
337 unsigned long long *count
= _count
;
338 struct rcu_rbtree_node
*node
;
342 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
343 "writer", pthread_self(), (unsigned long)gettid());
349 rcu_register_thread();
357 rcu_copy_mutex_lock();
359 for (i
= 0; i
< NR_RAND
; i
++) {
360 node
= rbtree_alloc();
361 //key[i] = (void *)(unsigned long)(rand() % 2048);
362 key
[i
] = (void *)(unsigned long)(rand() % 6);
363 node
->begin
= key
[i
];
364 node
->end
= (void *)((unsigned long) key
[i
] + 1);
366 rcu_rbtree_insert(&rbtree
, node
);
369 rcu_copy_mutex_unlock();
371 if (unlikely(wduration
))
372 loop_sleep(wduration
);
374 rcu_copy_mutex_lock();
375 for (i
= 0; i
< NR_RAND
; i
++) {
377 node
= rcu_rbtree_min(rbtree
, rbtree
->root
);
378 while (!rcu_rbtree_is_nil(&rbtree
, node
)) {
379 printf("{ 0x%lX p:%lX r:%lX l:%lX %s %s %s} ",
380 (unsigned long)node
->key
,
384 node
->color
? "red" : "black",
385 node
->pos
? "right" : "left",
386 node
->nil
? "nil" : "");
387 node
= rcu_rbtree_next(rbtree
, node
);
392 node
= rcu_rbtree_search(&rbtree
, rbtree
.root
, key
[i
]);
393 assert(!rcu_rbtree_is_nil(&rbtree
, node
));
394 rcu_rbtree_remove(&rbtree
, node
);
396 call_rcu(&node
->head
, rbtree_free
);
399 rcu_copy_mutex_unlock();
401 if (unlikely(!test_duration_write()))
403 if (unlikely(wdelay
))
407 rcu_unregister_thread();
409 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
410 "writer", pthread_self(), (unsigned long)gettid());
415 void show_usage(int argc
, char **argv
)
417 printf("Usage : %s nr_readers nr_writers duration (s)", argv
[0]);
419 printf(" [-r] [-w] (yield reader and/or writer)");
421 printf(" [-d delay] (writer period (us))");
422 printf(" [-c duration] (reader C.S. duration (in loops))");
423 printf(" [-e duration] (writer C.S. duration (in loops))");
424 printf(" [-v] (verbose output)");
425 printf(" [-a cpu#] [-a cpu#]... (affinity)");
429 int main(int argc
, char **argv
)
432 pthread_t
*tid_reader
, *tid_writer
;
434 unsigned long long *count_reader
, *count_writer
;
435 unsigned long long tot_reads
= 0, tot_writes
= 0;
437 struct rcu_rbtree_node
*node
;
440 show_usage(argc
, argv
);
444 err
= sscanf(argv
[1], "%u", &nr_readers
);
446 show_usage(argc
, argv
);
450 err
= sscanf(argv
[2], "%u", &nr_writers
);
452 show_usage(argc
, argv
);
456 err
= sscanf(argv
[3], "%lu", &duration
);
458 show_usage(argc
, argv
);
462 for (i
= 4; i
< argc
; i
++) {
463 if (argv
[i
][0] != '-')
465 switch (argv
[i
][1]) {
468 yield_active
|= YIELD_READ
;
471 yield_active
|= YIELD_WRITE
;
476 show_usage(argc
, argv
);
480 cpu_affinities
[next_aff
++] = a
;
482 printf_verbose("Adding CPU %d affinity\n", a
);
486 show_usage(argc
, argv
);
489 rduration
= atol(argv
[++i
]);
493 show_usage(argc
, argv
);
496 wdelay
= atol(argv
[++i
]);
500 show_usage(argc
, argv
);
503 wduration
= atol(argv
[++i
]);
510 show_usage(argc
, argv
);
513 global_items
= atol(argv
[++i
]);
518 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
519 duration
, nr_readers
, nr_writers
);
520 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
521 printf_verbose("Reader duration : %lu loops.\n", rduration
);
522 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
523 "main", pthread_self(), (unsigned long)gettid());
525 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
526 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
527 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
528 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
529 global_key
= malloc(sizeof(*global_key
) * global_items
);
535 for (i
= 0; i
< nr_readers
; i
++) {
536 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
541 for (i
= 0; i
< nr_writers
; i
++) {
542 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
548 rcu_register_thread();
550 /* Insert items looked up by readers */
551 for (i
= 0; i
< global_items
; i
++) {
552 node
= rbtree_alloc();
553 global_key
[i
] = (void *)(unsigned long)(rand() % 6);
554 node
->begin
= global_key
[i
];
555 node
->end
= (void *)((unsigned long) global_key
[i
] + 1);
556 rcu_rbtree_insert(&rbtree
, node
);
568 for (i
= 0; i
< nr_readers
; i
++) {
569 err
= pthread_join(tid_reader
[i
], &tret
);
572 tot_reads
+= count_reader
[i
];
574 for (i
= 0; i
< nr_writers
; i
++) {
575 err
= pthread_join(tid_writer
[i
], &tret
);
578 tot_writes
+= count_writer
[i
];
582 for (i
= 0; i
< global_items
; i
++) {
583 node
= rcu_rbtree_search(&rbtree
, rbtree
.root
, global_key
[i
]);
584 assert(!rcu_rbtree_is_nil(&rbtree
, node
));
585 rcu_rbtree_remove(&rbtree
, node
);
586 call_rcu(&node
->head
, rbtree_free
);
589 rcu_unregister_thread();
591 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
593 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
595 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
596 "global_items %6lu\n",
597 argv
[0], duration
, nr_readers
, rduration
, wduration
,
598 nr_writers
, wdelay
, tot_reads
, tot_writes
,
599 tot_reads
+ tot_writes
, global_items
);