4 * Userspace RCU library - test program (with baatch reclamation)
6 * Copyright February 2009 - 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 #include "../config.h"
29 #include <sys/types.h>
37 #include <urcu/arch.h>
38 #include <urcu/tls-compat.h>
44 /* hardcoded number of CPUs */
47 #if defined(_syscall0)
48 _syscall0(pid_t
, gettid
)
49 #elif defined(__NR_gettid)
50 static inline pid_t
gettid(void)
52 return syscall(__NR_gettid
);
55 #warning "use pid as tid"
56 static inline pid_t
gettid(void)
63 #include <urcu-qsbr.h>
69 static volatile int test_go
, test_stop
;
71 static unsigned long wdelay
;
73 static struct test_array
*test_rcu_pointer
;
75 static unsigned long duration
;
77 /* read-side C.S. duration, in loops */
78 static unsigned long rduration
;
79 static unsigned int reclaim_batch
= 1;
81 struct reclaim_queue
{
82 void **queue
; /* Beginning of queue */
83 void **head
; /* Insert position */
86 static struct reclaim_queue
*pending_reclaims
;
89 /* write-side C.S. duration, in loops */
90 static unsigned long wduration
;
92 static inline void loop_sleep(unsigned long loops
)
98 static int verbose_mode
;
100 #define printf_verbose(fmt, args...) \
106 static unsigned int cpu_affinities
[NR_CPUS
];
107 static unsigned int next_aff
= 0;
108 static int use_affinity
= 0;
110 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
112 #ifndef HAVE_CPU_SET_T
113 typedef unsigned long cpu_set_t
;
114 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
115 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
118 static void set_affinity(void)
120 #if HAVE_SCHED_SETAFFINITY
123 #endif /* HAVE_SCHED_SETAFFINITY */
128 #if HAVE_SCHED_SETAFFINITY
129 ret
= pthread_mutex_lock(&affinity_mutex
);
131 perror("Error in pthread mutex lock");
134 cpu
= cpu_affinities
[next_aff
++];
135 ret
= pthread_mutex_unlock(&affinity_mutex
);
137 perror("Error in pthread mutex unlock");
143 #if SCHED_SETAFFINITY_ARGS == 2
144 sched_setaffinity(0, &mask
);
146 sched_setaffinity(0, sizeof(mask
), &mask
);
148 #endif /* HAVE_SCHED_SETAFFINITY */
152 * returns 0 if test should end.
154 static int test_duration_write(void)
159 static int test_duration_read(void)
164 static DEFINE_URCU_TLS(unsigned long long, nr_writes
);
165 static DEFINE_URCU_TLS(unsigned long long, nr_reads
);
167 static unsigned int nr_readers
;
168 static unsigned int nr_writers
;
170 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
172 unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE
))) *tot_nr_writes
;
175 void rcu_copy_mutex_lock(void)
178 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
180 perror("Error in pthread mutex lock");
185 void rcu_copy_mutex_unlock(void)
189 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
191 perror("Error in pthread mutex unlock");
196 void *thr_reader(void *_count
)
198 unsigned long long *count
= _count
;
199 struct test_array
*local_ptr
;
201 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
202 "reader", (unsigned long) pthread_self(),
203 (unsigned long) gettid());
207 rcu_register_thread();
216 local_ptr
= _rcu_dereference(test_rcu_pointer
);
217 rcu_debug_yield_read();
219 assert(local_ptr
->a
== 8);
220 if (caa_unlikely(rduration
))
221 loop_sleep(rduration
);
223 URCU_TLS(nr_reads
)++;
224 /* QS each 1024 reads */
225 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
226 _rcu_quiescent_state();
227 if (caa_unlikely(!test_duration_read()))
231 rcu_unregister_thread();
233 *count
= URCU_TLS(nr_reads
);
234 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
235 "reader", (unsigned long) pthread_self(),
236 (unsigned long) gettid());
241 static void rcu_gc_clear_queue(unsigned long wtidx
)
245 /* Wait for Q.S and empty queue */
248 for (p
= pending_reclaims
[wtidx
].queue
;
249 p
< pending_reclaims
[wtidx
].head
; p
++) {
252 ((struct test_array
*)*p
)->a
= 0;
255 pending_reclaims
[wtidx
].head
= pending_reclaims
[wtidx
].queue
;
258 /* Using per-thread queue */
259 static void rcu_gc_reclaim(unsigned long wtidx
, void *old
)
262 *pending_reclaims
[wtidx
].head
= old
;
263 pending_reclaims
[wtidx
].head
++;
265 if (caa_likely(pending_reclaims
[wtidx
].head
- pending_reclaims
[wtidx
].queue
269 rcu_gc_clear_queue(wtidx
);
272 void *thr_writer(void *data
)
274 unsigned long wtidx
= (unsigned long)data
;
276 struct test_array
*old
= NULL
;
278 struct test_array
*new, *old
;
281 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
282 "writer", (unsigned long) pthread_self(),
283 (unsigned long) gettid());
293 #ifndef TEST_LOCAL_GC
294 new = malloc(sizeof(*new));
296 old
= _rcu_xchg_pointer(&test_rcu_pointer
, new);
298 if (caa_unlikely(wduration
))
299 loop_sleep(wduration
);
300 rcu_gc_reclaim(wtidx
, old
);
301 URCU_TLS(nr_writes
)++;
302 if (caa_unlikely(!test_duration_write()))
304 if (caa_unlikely(wdelay
))
308 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
309 "writer", (unsigned long) pthread_self(),
310 (unsigned long) gettid());
311 tot_nr_writes
[wtidx
] = URCU_TLS(nr_writes
);
315 void show_usage(int argc
, char **argv
)
317 printf("Usage : %s nr_readers nr_writers duration (s)", argv
[0]);
319 printf(" [-r] [-w] (yield reader and/or writer)");
321 printf(" [-b batch] (batch reclaim)");
322 printf(" [-d delay] (writer period (us))");
323 printf(" [-c duration] (reader C.S. duration (in loops))");
324 printf(" [-e duration] (writer C.S. duration (in loops))");
325 printf(" [-v] (verbose output)");
326 printf(" [-a cpu#] [-a cpu#]... (affinity)");
330 int main(int argc
, char **argv
)
333 pthread_t
*tid_reader
, *tid_writer
;
335 unsigned long long *count_reader
;
336 unsigned long long tot_reads
= 0, tot_writes
= 0;
340 show_usage(argc
, argv
);
344 err
= sscanf(argv
[1], "%u", &nr_readers
);
346 show_usage(argc
, argv
);
350 err
= sscanf(argv
[2], "%u", &nr_writers
);
352 show_usage(argc
, argv
);
356 err
= sscanf(argv
[3], "%lu", &duration
);
358 show_usage(argc
, argv
);
362 for (i
= 4; i
< argc
; i
++) {
363 if (argv
[i
][0] != '-')
365 switch (argv
[i
][1]) {
368 rcu_yield_active
|= RCU_YIELD_READ
;
371 rcu_yield_active
|= RCU_YIELD_WRITE
;
376 show_usage(argc
, argv
);
380 cpu_affinities
[next_aff
++] = a
;
382 printf_verbose("Adding CPU %d affinity\n", a
);
386 show_usage(argc
, argv
);
389 reclaim_batch
= atol(argv
[++i
]);
393 show_usage(argc
, argv
);
396 rduration
= atol(argv
[++i
]);
400 show_usage(argc
, argv
);
403 wdelay
= atol(argv
[++i
]);
407 show_usage(argc
, argv
);
410 wduration
= atol(argv
[++i
]);
418 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
419 duration
, nr_readers
, nr_writers
);
420 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
421 printf_verbose("Reader duration : %lu loops.\n", rduration
);
422 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
423 "main", (unsigned long) pthread_self(),
424 (unsigned long) gettid());
426 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
427 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
428 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
429 tot_nr_writes
= malloc(sizeof(*tot_nr_writes
) * nr_writers
);
430 pending_reclaims
= malloc(sizeof(*pending_reclaims
) * nr_writers
);
431 if (reclaim_batch
* sizeof(*pending_reclaims
[i
].queue
)
432 < CAA_CACHE_LINE_SIZE
)
433 for (i
= 0; i
< nr_writers
; i
++)
434 pending_reclaims
[i
].queue
= calloc(1, CAA_CACHE_LINE_SIZE
);
436 for (i
= 0; i
< nr_writers
; i
++)
437 pending_reclaims
[i
].queue
= calloc(reclaim_batch
,
438 sizeof(*pending_reclaims
[i
].queue
));
439 for (i
= 0; i
< nr_writers
; i
++)
440 pending_reclaims
[i
].head
= pending_reclaims
[i
].queue
;
444 for (i
= 0; i
< nr_readers
; i
++) {
445 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
450 for (i
= 0; i
< nr_writers
; i
++) {
451 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
465 for (i
= 0; i
< nr_readers
; i
++) {
466 err
= pthread_join(tid_reader
[i
], &tret
);
469 tot_reads
+= count_reader
[i
];
471 for (i
= 0; i
< nr_writers
; i
++) {
472 err
= pthread_join(tid_writer
[i
], &tret
);
475 tot_writes
+= tot_nr_writes
[i
];
476 rcu_gc_clear_queue(i
);
479 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
481 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
483 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
485 argv
[0], duration
, nr_readers
, rduration
, wduration
,
486 nr_writers
, wdelay
, tot_reads
, tot_writes
,
487 tot_reads
+ tot_writes
, reclaim_batch
);
492 for (i
= 0; i
< nr_writers
; i
++)
493 free(pending_reclaims
[i
].queue
);
494 free(pending_reclaims
);