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.
27 #include <sys/types.h>
34 #include <urcu/arch.h>
35 #include <urcu/tls-compat.h>
36 #include "thread-id.h"
37 #include "../common/debug-yield.h"
39 /* hardcoded number of CPUs */
43 #include <urcu-qsbr.h>
49 static volatile int test_go
, test_stop
;
51 static unsigned long wdelay
;
53 static struct test_array
*test_rcu_pointer
;
55 static unsigned long duration
;
57 /* read-side C.S. duration, in loops */
58 static unsigned long rduration
;
59 static long reclaim_batch
= 1;
61 struct reclaim_queue
{
62 void **queue
; /* Beginning of queue */
63 void **head
; /* Insert position */
66 static struct reclaim_queue
*pending_reclaims
;
69 /* write-side C.S. duration, in loops */
70 static unsigned long wduration
;
72 static inline void loop_sleep(unsigned long loops
)
78 static int verbose_mode
;
80 #define printf_verbose(fmt, args...) \
86 static unsigned int cpu_affinities
[NR_CPUS
];
87 static unsigned int next_aff
= 0;
88 static int use_affinity
= 0;
90 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
92 static void set_affinity(void)
94 #ifdef HAVE_SCHED_SETAFFINITY
97 #endif /* HAVE_SCHED_SETAFFINITY */
102 #ifdef HAVE_SCHED_SETAFFINITY
103 ret
= pthread_mutex_lock(&affinity_mutex
);
105 perror("Error in pthread mutex lock");
108 cpu
= cpu_affinities
[next_aff
++];
109 ret
= pthread_mutex_unlock(&affinity_mutex
);
111 perror("Error in pthread mutex unlock");
117 sched_setaffinity(0, sizeof(mask
), &mask
);
118 #endif /* HAVE_SCHED_SETAFFINITY */
122 * returns 0 if test should end.
124 static int test_duration_write(void)
129 static int test_duration_read(void)
134 static DEFINE_URCU_TLS(unsigned long long, nr_writes
);
135 static DEFINE_URCU_TLS(unsigned long long, nr_reads
);
137 static unsigned int nr_readers
;
138 static unsigned int nr_writers
;
140 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
142 unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE
))) *tot_nr_writes
;
145 void *thr_reader(void *_count
)
147 unsigned long long *count
= _count
;
148 struct test_array
*local_ptr
;
150 printf_verbose("thread_begin %s, tid %lu\n",
151 "reader", urcu_get_thread_id());
155 rcu_register_thread();
164 local_ptr
= _rcu_dereference(test_rcu_pointer
);
165 rcu_debug_yield_read();
167 assert(local_ptr
->a
== 8);
168 if (caa_unlikely(rduration
))
169 loop_sleep(rduration
);
171 URCU_TLS(nr_reads
)++;
172 /* QS each 1024 reads */
173 if (caa_unlikely((URCU_TLS(nr_reads
) & ((1 << 10) - 1)) == 0))
174 _rcu_quiescent_state();
175 if (caa_unlikely(!test_duration_read()))
179 rcu_unregister_thread();
181 *count
= URCU_TLS(nr_reads
);
182 printf_verbose("thread_end %s, tid %lu\n",
183 "reader", urcu_get_thread_id());
188 static void rcu_gc_clear_queue(unsigned long wtidx
)
192 /* Wait for Q.S and empty queue */
195 for (p
= pending_reclaims
[wtidx
].queue
;
196 p
< pending_reclaims
[wtidx
].head
; p
++) {
199 ((struct test_array
*)*p
)->a
= 0;
202 pending_reclaims
[wtidx
].head
= pending_reclaims
[wtidx
].queue
;
205 /* Using per-thread queue */
206 static void rcu_gc_reclaim(unsigned long wtidx
, void *old
)
209 *pending_reclaims
[wtidx
].head
= old
;
210 pending_reclaims
[wtidx
].head
++;
212 if (caa_likely(pending_reclaims
[wtidx
].head
- pending_reclaims
[wtidx
].queue
216 rcu_gc_clear_queue(wtidx
);
220 void *thr_writer(void *data
)
222 unsigned long wtidx
= (unsigned long)data
;
224 struct test_array
*old
= NULL
;
226 struct test_array
*new, *old
;
229 printf_verbose("thread_begin %s, tid %lu\n",
230 "writer", urcu_get_thread_id());
240 #ifndef TEST_LOCAL_GC
241 new = malloc(sizeof(*new));
243 old
= _rcu_xchg_pointer(&test_rcu_pointer
, new);
245 if (caa_unlikely(wduration
))
246 loop_sleep(wduration
);
247 rcu_gc_reclaim(wtidx
, old
);
248 URCU_TLS(nr_writes
)++;
249 if (caa_unlikely(!test_duration_write()))
251 if (caa_unlikely(wdelay
))
255 printf_verbose("thread_end %s, tid %lu\n",
256 "writer", urcu_get_thread_id());
257 tot_nr_writes
[wtidx
] = URCU_TLS(nr_writes
);
262 void show_usage(char **argv
)
264 printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
266 printf("OPTIONS:\n");
267 printf(" [-r] [-w] (yield reader and/or writer)\n");
268 printf(" [-b batch] (batch reclaim)\n");
269 printf(" [-d delay] (writer period (us))\n");
270 printf(" [-c duration] (reader C.S. duration (in loops))\n");
271 printf(" [-e duration] (writer C.S. duration (in loops))\n");
272 printf(" [-v] (verbose output)\n");
273 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
277 int main(int argc
, char **argv
)
280 pthread_t
*tid_reader
, *tid_writer
;
282 unsigned long long *count_reader
;
283 unsigned long long tot_reads
= 0, tot_writes
= 0;
292 err
= sscanf(argv
[1], "%u", &nr_readers
);
298 err
= sscanf(argv
[2], "%u", &nr_writers
);
304 err
= sscanf(argv
[3], "%lu", &duration
);
310 for (i
= 4; i
< argc
; i
++) {
311 if (argv
[i
][0] != '-')
313 switch (argv
[i
][1]) {
315 rcu_debug_yield_enable(RCU_YIELD_READ
);
318 rcu_debug_yield_enable(RCU_YIELD_WRITE
);
326 cpu_affinities
[next_aff
++] = a
;
328 printf_verbose("Adding CPU %d affinity\n", a
);
335 reclaim_batch
= atol(argv
[++i
]);
342 rduration
= atol(argv
[++i
]);
349 wdelay
= atol(argv
[++i
]);
356 wduration
= atol(argv
[++i
]);
364 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
365 duration
, nr_readers
, nr_writers
);
366 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
367 printf_verbose("Reader duration : %lu loops.\n", rduration
);
368 printf_verbose("thread %-6s, tid %lu\n",
369 "main", urcu_get_thread_id());
371 tid_reader
= calloc(nr_readers
, sizeof(*tid_reader
));
372 tid_writer
= calloc(nr_writers
, sizeof(*tid_writer
));
373 count_reader
= calloc(nr_readers
, sizeof(*count_reader
));
374 tot_nr_writes
= calloc(nr_writers
, sizeof(*tot_nr_writes
));
375 pending_reclaims
= calloc(nr_writers
, sizeof(*pending_reclaims
));
376 if (reclaim_batch
* sizeof(*pending_reclaims
[0].queue
)
377 < CAA_CACHE_LINE_SIZE
)
378 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
379 pending_reclaims
[i_thr
].queue
= calloc(1, CAA_CACHE_LINE_SIZE
);
381 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
382 pending_reclaims
[i_thr
].queue
= calloc(reclaim_batch
,
383 sizeof(*pending_reclaims
[i_thr
].queue
));
384 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
385 pending_reclaims
[i_thr
].head
= pending_reclaims
[i_thr
].queue
;
389 for (i_thr
= 0; i_thr
< nr_readers
; i_thr
++) {
390 err
= pthread_create(&tid_reader
[i_thr
], NULL
, thr_reader
,
391 &count_reader
[i_thr
]);
395 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++) {
396 err
= pthread_create(&tid_writer
[i_thr
], NULL
, thr_writer
,
397 (void *)(long)i_thr
);
410 for (i_thr
= 0; i_thr
< nr_readers
; i_thr
++) {
411 err
= pthread_join(tid_reader
[i_thr
], &tret
);
414 tot_reads
+= count_reader
[i_thr
];
416 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++) {
417 err
= pthread_join(tid_writer
[i_thr
], &tret
);
420 tot_writes
+= tot_nr_writes
[i_thr
];
421 rcu_gc_clear_queue(i_thr
);
424 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
426 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
428 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
430 argv
[0], duration
, nr_readers
, rduration
, wduration
,
431 nr_writers
, wdelay
, tot_reads
, tot_writes
,
432 tot_reads
+ tot_writes
, reclaim_batch
);
439 for (i_thr
= 0; i_thr
< nr_writers
; i_thr
++)
440 free(pending_reclaims
[i_thr
].queue
);
441 free(pending_reclaims
);