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>
36 #include <urcu/arch.h>
37 #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 static void set_affinity(void)
114 #if HAVE_SCHED_SETAFFINITY
117 #endif /* HAVE_SCHED_SETAFFINITY */
122 #if HAVE_SCHED_SETAFFINITY
123 ret
= pthread_mutex_lock(&affinity_mutex
);
125 perror("Error in pthread mutex lock");
128 cpu
= cpu_affinities
[next_aff
++];
129 ret
= pthread_mutex_unlock(&affinity_mutex
);
131 perror("Error in pthread mutex unlock");
137 #if SCHED_SETAFFINITY_ARGS == 2
138 sched_setaffinity(0, &mask
);
140 sched_setaffinity(0, sizeof(mask
), &mask
);
142 #endif /* HAVE_SCHED_SETAFFINITY */
146 * returns 0 if test should end.
148 static int test_duration_write(void)
153 static int test_duration_read(void)
158 static DEFINE_URCU_TLS(unsigned long long, nr_writes
);
159 static DEFINE_URCU_TLS(unsigned long long, nr_reads
);
161 static unsigned int nr_readers
;
162 static unsigned int nr_writers
;
164 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
166 unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE
))) *tot_nr_writes
;
169 void rcu_copy_mutex_lock(void)
172 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
174 perror("Error in pthread mutex lock");
179 void rcu_copy_mutex_unlock(void)
183 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
185 perror("Error in pthread mutex unlock");
190 void *thr_reader(void *_count
)
192 unsigned long long *count
= _count
;
193 struct test_array
*local_ptr
;
195 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
196 "reader", (unsigned long) pthread_self(),
197 (unsigned long) gettid());
201 rcu_register_thread();
210 local_ptr
= _rcu_dereference(test_rcu_pointer
);
211 rcu_debug_yield_read();
213 assert(local_ptr
->a
== 8);
214 if (caa_unlikely(rduration
))
215 loop_sleep(rduration
);
217 URCU_TLS(nr_reads
)++;
218 /* QS each 1024 reads */
219 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
220 _rcu_quiescent_state();
221 if (caa_unlikely(!test_duration_read()))
225 rcu_unregister_thread();
227 *count
= URCU_TLS(nr_reads
);
228 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
229 "reader", (unsigned long) pthread_self(),
230 (unsigned long) gettid());
235 static void rcu_gc_clear_queue(unsigned long wtidx
)
239 /* Wait for Q.S and empty queue */
242 for (p
= pending_reclaims
[wtidx
].queue
;
243 p
< pending_reclaims
[wtidx
].head
; p
++) {
246 ((struct test_array
*)*p
)->a
= 0;
249 pending_reclaims
[wtidx
].head
= pending_reclaims
[wtidx
].queue
;
252 /* Using per-thread queue */
253 static void rcu_gc_reclaim(unsigned long wtidx
, void *old
)
256 *pending_reclaims
[wtidx
].head
= old
;
257 pending_reclaims
[wtidx
].head
++;
259 if (caa_likely(pending_reclaims
[wtidx
].head
- pending_reclaims
[wtidx
].queue
263 rcu_gc_clear_queue(wtidx
);
266 void *thr_writer(void *data
)
268 unsigned long wtidx
= (unsigned long)data
;
270 struct test_array
*old
= NULL
;
272 struct test_array
*new, *old
;
275 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
276 "writer", (unsigned long) pthread_self(),
277 (unsigned long) gettid());
287 #ifndef TEST_LOCAL_GC
288 new = malloc(sizeof(*new));
290 old
= _rcu_xchg_pointer(&test_rcu_pointer
, new);
292 if (caa_unlikely(wduration
))
293 loop_sleep(wduration
);
294 rcu_gc_reclaim(wtidx
, old
);
295 URCU_TLS(nr_writes
)++;
296 if (caa_unlikely(!test_duration_write()))
298 if (caa_unlikely(wdelay
))
302 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
303 "writer", (unsigned long) pthread_self(),
304 (unsigned long) gettid());
305 tot_nr_writes
[wtidx
] = URCU_TLS(nr_writes
);
309 void show_usage(int argc
, char **argv
)
311 printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
313 printf("OPTIONS:\n");
315 printf(" [-r] [-w] (yield reader and/or writer)\n");
317 printf(" [-b batch] (batch reclaim)\n");
318 printf(" [-d delay] (writer period (us))\n");
319 printf(" [-c duration] (reader C.S. duration (in loops))\n");
320 printf(" [-e duration] (writer C.S. duration (in loops))\n");
321 printf(" [-v] (verbose output)\n");
322 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
326 int main(int argc
, char **argv
)
329 pthread_t
*tid_reader
, *tid_writer
;
331 unsigned long long *count_reader
;
332 unsigned long long tot_reads
= 0, tot_writes
= 0;
336 show_usage(argc
, argv
);
340 err
= sscanf(argv
[1], "%u", &nr_readers
);
342 show_usage(argc
, argv
);
346 err
= sscanf(argv
[2], "%u", &nr_writers
);
348 show_usage(argc
, argv
);
352 err
= sscanf(argv
[3], "%lu", &duration
);
354 show_usage(argc
, argv
);
358 for (i
= 4; i
< argc
; i
++) {
359 if (argv
[i
][0] != '-')
361 switch (argv
[i
][1]) {
364 rcu_yield_active
|= RCU_YIELD_READ
;
367 rcu_yield_active
|= RCU_YIELD_WRITE
;
372 show_usage(argc
, argv
);
376 cpu_affinities
[next_aff
++] = a
;
378 printf_verbose("Adding CPU %d affinity\n", a
);
382 show_usage(argc
, argv
);
385 reclaim_batch
= atol(argv
[++i
]);
389 show_usage(argc
, argv
);
392 rduration
= atol(argv
[++i
]);
396 show_usage(argc
, argv
);
399 wdelay
= atol(argv
[++i
]);
403 show_usage(argc
, argv
);
406 wduration
= atol(argv
[++i
]);
414 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
415 duration
, nr_readers
, nr_writers
);
416 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
417 printf_verbose("Reader duration : %lu loops.\n", rduration
);
418 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
419 "main", (unsigned long) pthread_self(),
420 (unsigned long) gettid());
422 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
423 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
424 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
425 tot_nr_writes
= malloc(sizeof(*tot_nr_writes
) * nr_writers
);
426 pending_reclaims
= malloc(sizeof(*pending_reclaims
) * nr_writers
);
427 if (reclaim_batch
* sizeof(*pending_reclaims
[i
].queue
)
428 < CAA_CACHE_LINE_SIZE
)
429 for (i
= 0; i
< nr_writers
; i
++)
430 pending_reclaims
[i
].queue
= calloc(1, CAA_CACHE_LINE_SIZE
);
432 for (i
= 0; i
< nr_writers
; i
++)
433 pending_reclaims
[i
].queue
= calloc(reclaim_batch
,
434 sizeof(*pending_reclaims
[i
].queue
));
435 for (i
= 0; i
< nr_writers
; i
++)
436 pending_reclaims
[i
].head
= pending_reclaims
[i
].queue
;
440 for (i
= 0; i
< nr_readers
; i
++) {
441 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
446 for (i
= 0; i
< nr_writers
; i
++) {
447 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
461 for (i
= 0; i
< nr_readers
; i
++) {
462 err
= pthread_join(tid_reader
[i
], &tret
);
465 tot_reads
+= count_reader
[i
];
467 for (i
= 0; i
< nr_writers
; i
++) {
468 err
= pthread_join(tid_writer
[i
], &tret
);
471 tot_writes
+= tot_nr_writes
[i
];
472 rcu_gc_clear_queue(i
);
475 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
477 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
479 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
481 argv
[0], duration
, nr_readers
, rduration
, wduration
,
482 nr_writers
, wdelay
, tot_reads
, tot_writes
,
483 tot_reads
+ tot_writes
, reclaim_batch
);
488 for (i
= 0; i
< nr_writers
; i
++)
489 free(pending_reclaims
[i
].queue
);
490 free(pending_reclaims
);