4 * Userspace RCU library - test program (with batch 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.
27 #include <sys/types.h>
34 #include <urcu/arch.h>
35 #include <urcu/tls-compat.h>
37 #include "thread-id.h"
38 #include "../common/debug-yield.h"
40 /* hardcoded number of CPUs */
43 #ifndef DYNAMIC_LINK_TEST
52 static volatile int test_go
, test_stop
;
54 static unsigned long wdelay
;
56 static struct test_array
*test_rcu_pointer
;
58 static long reclaim_batch
= 1;
60 struct reclaim_queue
{
61 void **queue
; /* Beginning of queue */
62 void **head
; /* Insert position */
65 static struct reclaim_queue
*pending_reclaims
;
67 static unsigned long duration
;
69 /* read-side C.S. duration, in loops */
70 static unsigned long rduration
;
72 /* write-side C.S. duration, in loops */
73 static unsigned long wduration
;
75 static inline void loop_sleep(unsigned long loops
)
81 static int verbose_mode
;
83 #define printf_verbose(fmt, args...) \
89 static unsigned int cpu_affinities
[NR_CPUS
];
90 static unsigned int next_aff
= 0;
91 static int use_affinity
= 0;
93 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
95 static void set_affinity(void)
97 #ifdef HAVE_SCHED_SETAFFINITY
100 #endif /* HAVE_SCHED_SETAFFINITY */
105 #ifdef HAVE_SCHED_SETAFFINITY
106 ret
= pthread_mutex_lock(&affinity_mutex
);
108 perror("Error in pthread mutex lock");
111 cpu
= cpu_affinities
[next_aff
++];
112 ret
= pthread_mutex_unlock(&affinity_mutex
);
114 perror("Error in pthread mutex unlock");
120 #if SCHED_SETAFFINITY_ARGS == 2
121 sched_setaffinity(0, &mask
);
123 sched_setaffinity(0, sizeof(mask
), &mask
);
125 #endif /* HAVE_SCHED_SETAFFINITY */
129 * returns 0 if test should end.
131 static int test_duration_write(void)
136 static int test_duration_read(void)
141 static DEFINE_URCU_TLS(unsigned long long, nr_writes
);
142 static DEFINE_URCU_TLS(unsigned long long, nr_reads
);
145 unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE
))) *tot_nr_writes
;
147 static unsigned int nr_readers
;
148 static unsigned int nr_writers
;
150 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
153 void *thr_reader(void *_count
)
155 unsigned long long *count
= _count
;
156 struct test_array
*local_ptr
;
158 printf_verbose("thread_begin %s, tid %lu\n",
159 "reader", urcu_get_thread_id());
163 rcu_register_thread();
172 local_ptr
= rcu_dereference(test_rcu_pointer
);
173 rcu_debug_yield_read();
175 assert(local_ptr
->a
== 8);
176 if (caa_unlikely(rduration
))
177 loop_sleep(rduration
);
179 URCU_TLS(nr_reads
)++;
180 if (caa_unlikely(!test_duration_read()))
184 rcu_unregister_thread();
186 *count
= URCU_TLS(nr_reads
);
187 printf_verbose("thread_end %s, tid %lu\n",
188 "reader", urcu_get_thread_id());
193 static void rcu_gc_clear_queue(unsigned long wtidx
)
197 /* Wait for Q.S and empty queue */
200 for (p
= pending_reclaims
[wtidx
].queue
;
201 p
< pending_reclaims
[wtidx
].head
; p
++) {
204 ((struct test_array
*)*p
)->a
= 0;
207 pending_reclaims
[wtidx
].head
= pending_reclaims
[wtidx
].queue
;
210 /* Using per-thread queue */
211 static void rcu_gc_reclaim(unsigned long wtidx
, void *old
)
214 *pending_reclaims
[wtidx
].head
= old
;
215 pending_reclaims
[wtidx
].head
++;
217 if (caa_likely(pending_reclaims
[wtidx
].head
- pending_reclaims
[wtidx
].queue
221 rcu_gc_clear_queue(wtidx
);
225 void *thr_writer(void *data
)
227 unsigned long wtidx
= (unsigned long)data
;
229 struct test_array
*old
= NULL
;
231 struct test_array
*new, *old
;
234 printf_verbose("thread_begin %s, tid %lu\n",
235 "writer", urcu_get_thread_id());
245 #ifndef TEST_LOCAL_GC
246 new = malloc(sizeof(*new));
248 old
= rcu_xchg_pointer(&test_rcu_pointer
, new);
250 if (caa_unlikely(wduration
))
251 loop_sleep(wduration
);
252 rcu_gc_reclaim(wtidx
, old
);
253 URCU_TLS(nr_writes
)++;
254 if (caa_unlikely(!test_duration_write()))
256 if (caa_unlikely(wdelay
))
260 printf_verbose("thread_end %s, tid %lu\n",
261 "writer", urcu_get_thread_id());
262 tot_nr_writes
[wtidx
] = URCU_TLS(nr_writes
);
267 void show_usage(char **argv
)
269 printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
271 printf("OPTIONS:\n");
272 printf(" [-r] [-w] (yield reader and/or writer)\n");
273 printf(" [-d delay] (writer period (us))\n");
274 printf(" [-c duration] (reader C.S. duration (in loops))\n");
275 printf(" [-e duration] (writer C.S. duration (in loops))\n");
276 printf(" [-v] (verbose output)\n");
277 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
281 int main(int argc
, char **argv
)
284 pthread_t
*tid_reader
, *tid_writer
;
286 unsigned long long *count_reader
;
287 unsigned long long tot_reads
= 0, tot_writes
= 0;
296 err
= sscanf(argv
[1], "%u", &nr_readers
);
302 err
= sscanf(argv
[2], "%u", &nr_writers
);
308 err
= sscanf(argv
[3], "%lu", &duration
);
314 for (i
= 4; i
< argc
; i
++) {
315 if (argv
[i
][0] != '-')
317 switch (argv
[i
][1]) {
319 rcu_debug_yield_enable(RCU_YIELD_READ
);
322 rcu_debug_yield_enable(RCU_YIELD_WRITE
);
330 cpu_affinities
[next_aff
++] = a
;
332 printf_verbose("Adding CPU %d affinity\n", a
);
339 reclaim_batch
= atol(argv
[++i
]);
346 rduration
= atol(argv
[++i
]);
353 wdelay
= atol(argv
[++i
]);
360 wduration
= atol(argv
[++i
]);
368 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
369 duration
, nr_readers
, nr_writers
);
370 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
371 printf_verbose("Reader duration : %lu loops.\n", rduration
);
372 printf_verbose("thread %-6s, tid %lu\n",
373 "main", urcu_get_thread_id());
375 tid_reader
= calloc(nr_readers
, sizeof(*tid_reader
));
376 tid_writer
= calloc(nr_writers
, sizeof(*tid_writer
));
377 count_reader
= calloc(nr_readers
, sizeof(*count_reader
));
378 tot_nr_writes
= calloc(nr_writers
, sizeof(*tot_nr_writes
));
379 pending_reclaims
= calloc(nr_writers
, sizeof(*pending_reclaims
));
381 if (reclaim_batch
* sizeof(*pending_reclaims
[0].queue
)
382 < CAA_CACHE_LINE_SIZE
)
383 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
384 pending_reclaims
[i_thr
].queue
= calloc(1, CAA_CACHE_LINE_SIZE
);
386 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
387 pending_reclaims
[i_thr
].queue
= calloc(reclaim_batch
,
388 sizeof(*pending_reclaims
[i_thr
].queue
));
389 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
390 pending_reclaims
[i_thr
].head
= pending_reclaims
[i_thr
].queue
;
394 for (i_thr
= 0; i_thr
< nr_readers
; i_thr
++) {
395 err
= pthread_create(&tid_reader
[i_thr
], NULL
, thr_reader
,
396 &count_reader
[i_thr
]);
400 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++) {
401 err
= pthread_create(&tid_writer
[i_thr
], NULL
, thr_writer
,
402 (void *)(long)i_thr
);
415 for (i_thr
= 0; i_thr
< nr_readers
; i_thr
++) {
416 err
= pthread_join(tid_reader
[i_thr
], &tret
);
419 tot_reads
+= count_reader
[i_thr
];
421 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++) {
422 err
= pthread_join(tid_writer
[i_thr
], &tret
);
425 tot_writes
+= tot_nr_writes
[i_thr
];
426 rcu_gc_clear_queue(i_thr
);
429 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
431 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
433 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
435 argv
[0], duration
, nr_readers
, rduration
, wduration
,
436 nr_writers
, wdelay
, tot_reads
, tot_writes
,
437 tot_reads
+ tot_writes
, reclaim_batch
);
444 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
445 free(pending_reclaims
[i_thr
].queue
);
446 free(pending_reclaims
);