4 * Userspace RCU library - test program (with baatch reclamation)
6 * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
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.
28 #include <sys/types.h>
33 #include <sys/syscall.h>
37 #include <urcu/arch.h>
39 /* hardcoded number of CPUs */
42 #if defined(_syscall0)
43 _syscall0(pid_t
, gettid
)
44 #elif defined(__NR_gettid)
45 static inline pid_t
gettid(void)
47 return syscall(__NR_gettid
);
50 #warning "use pid as tid"
51 static inline pid_t
gettid(void)
58 #include <urcu-qsbr.h>
64 static volatile int test_go
, test_stop
;
66 static unsigned long wdelay
;
68 static struct test_array
*test_rcu_pointer
;
70 static unsigned long duration
;
72 /* read-side C.S. duration, in loops */
73 static unsigned long rduration
;
74 static unsigned int reclaim_batch
= 1;
76 struct reclaim_queue
{
77 void **queue
; /* Beginning of queue */
78 void **head
; /* Insert position */
81 static struct reclaim_queue
*pending_reclaims
;
84 static inline void loop_sleep(unsigned long l
)
90 static int verbose_mode
;
92 #define printf_verbose(fmt, args...) \
98 static unsigned int cpu_affinities
[NR_CPUS
];
99 static unsigned int next_aff
= 0;
100 static int use_affinity
= 0;
102 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
104 static void set_affinity(void)
113 ret
= pthread_mutex_lock(&affinity_mutex
);
115 perror("Error in pthread mutex lock");
118 cpu
= cpu_affinities
[next_aff
++];
119 ret
= pthread_mutex_unlock(&affinity_mutex
);
121 perror("Error in pthread mutex unlock");
126 sched_setaffinity(0, sizeof(mask
), &mask
);
130 * returns 0 if test should end.
132 static int test_duration_write(void)
137 static int test_duration_read(void)
142 static unsigned long long __thread nr_writes
;
143 static unsigned long long __thread nr_reads
;
145 static unsigned int nr_readers
;
146 static unsigned int nr_writers
;
148 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
150 unsigned long long __attribute__((aligned(CACHE_LINE_SIZE
))) *tot_nr_writes
;
153 void rcu_copy_mutex_lock(void)
156 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
158 perror("Error in pthread mutex lock");
163 void rcu_copy_mutex_unlock(void)
167 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
169 perror("Error in pthread mutex unlock");
174 void *thr_reader(void *_count
)
176 unsigned long long *count
= _count
;
177 struct test_array
*local_ptr
;
179 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
180 "reader", pthread_self(), (unsigned long)gettid());
184 rcu_register_thread();
193 local_ptr
= _rcu_dereference(test_rcu_pointer
);
196 assert(local_ptr
->a
== 8);
197 if (unlikely(rduration
))
198 loop_sleep(rduration
);
201 /* QS each 1024 reads */
202 if (unlikely((nr_reads
& ((1 << 10) - 1)) == 0))
203 _rcu_quiescent_state();
204 if (unlikely(!test_duration_read()))
208 rcu_unregister_thread();
211 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
212 "reader", pthread_self(), (unsigned long)gettid());
217 static void rcu_gc_clear_queue(unsigned long wtidx
)
221 /* Wait for Q.S and empty queue */
224 for (p
= pending_reclaims
[wtidx
].queue
;
225 p
< pending_reclaims
[wtidx
].head
; p
++) {
228 ((struct test_array
*)*p
)->a
= 0;
231 pending_reclaims
[wtidx
].head
= pending_reclaims
[wtidx
].queue
;
234 /* Using per-thread queue */
235 static void rcu_gc_reclaim(unsigned long wtidx
, void *old
)
238 *pending_reclaims
[wtidx
].head
= old
;
239 pending_reclaims
[wtidx
].head
++;
241 if (likely(pending_reclaims
[wtidx
].head
- pending_reclaims
[wtidx
].queue
245 rcu_gc_clear_queue(wtidx
);
248 void *thr_writer(void *data
)
250 unsigned long wtidx
= (unsigned long)data
;
252 struct test_array
*old
= NULL
;
254 struct test_array
*new, *old
;
257 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
258 "writer", pthread_self(), (unsigned long)gettid());
268 #ifndef TEST_LOCAL_GC
269 new = malloc(sizeof(*new));
271 old
= _rcu_xchg_pointer(&test_rcu_pointer
, new);
273 rcu_gc_reclaim(wtidx
, old
);
275 if (unlikely(!test_duration_write()))
277 if (unlikely(wdelay
))
281 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
282 "writer", pthread_self(), (unsigned long)gettid());
283 tot_nr_writes
[wtidx
] = nr_writes
;
287 void show_usage(int argc
, char **argv
)
289 printf("Usage : %s nr_readers nr_writers duration (s)", argv
[0]);
291 printf(" [-r] [-w] (yield reader and/or writer)");
293 printf(" [-d delay] (writer period (us))");
294 printf(" [-c duration] (reader C.S. duration (in loops))");
295 printf(" [-v] (verbose output)");
296 printf(" [-a cpu#] [-a cpu#]... (affinity)");
300 int main(int argc
, char **argv
)
303 pthread_t
*tid_reader
, *tid_writer
;
305 unsigned long long *count_reader
;
306 unsigned long long tot_reads
= 0, tot_writes
= 0;
310 show_usage(argc
, argv
);
314 err
= sscanf(argv
[1], "%u", &nr_readers
);
316 show_usage(argc
, argv
);
320 err
= sscanf(argv
[2], "%u", &nr_writers
);
322 show_usage(argc
, argv
);
326 err
= sscanf(argv
[3], "%lu", &duration
);
328 show_usage(argc
, argv
);
332 for (i
= 4; i
< argc
; i
++) {
333 if (argv
[i
][0] != '-')
335 switch (argv
[i
][1]) {
338 yield_active
|= YIELD_READ
;
341 yield_active
|= YIELD_WRITE
;
346 show_usage(argc
, argv
);
350 cpu_affinities
[next_aff
++] = a
;
352 printf_verbose("Adding CPU %d affinity\n", a
);
356 show_usage(argc
, argv
);
359 reclaim_batch
= atol(argv
[++i
]);
363 show_usage(argc
, argv
);
366 rduration
= atol(argv
[++i
]);
370 show_usage(argc
, argv
);
373 wdelay
= atol(argv
[++i
]);
381 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
382 duration
, nr_readers
, nr_writers
);
383 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
384 printf_verbose("Reader duration : %lu loops.\n", rduration
);
385 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
386 "main", pthread_self(), (unsigned long)gettid());
388 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
389 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
390 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
391 tot_nr_writes
= malloc(sizeof(*tot_nr_writes
) * nr_writers
);
392 pending_reclaims
= malloc(sizeof(*pending_reclaims
) * nr_writers
);
393 if (reclaim_batch
* sizeof(*pending_reclaims
[i
].queue
)
395 for (i
= 0; i
< nr_writers
; i
++)
396 pending_reclaims
[i
].queue
= calloc(1, CACHE_LINE_SIZE
);
398 for (i
= 0; i
< nr_writers
; i
++)
399 pending_reclaims
[i
].queue
= calloc(reclaim_batch
,
400 sizeof(*pending_reclaims
[i
].queue
));
401 for (i
= 0; i
< nr_writers
; i
++)
402 pending_reclaims
[i
].head
= pending_reclaims
[i
].queue
;
406 for (i
= 0; i
< nr_readers
; i
++) {
407 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
412 for (i
= 0; i
< nr_writers
; i
++) {
413 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
427 for (i
= 0; i
< nr_readers
; i
++) {
428 err
= pthread_join(tid_reader
[i
], &tret
);
431 tot_reads
+= count_reader
[i
];
433 for (i
= 0; i
< nr_writers
; i
++) {
434 err
= pthread_join(tid_writer
[i
], &tret
);
437 tot_writes
+= tot_nr_writes
[i
];
438 rcu_gc_clear_queue(i
);
441 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
443 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
445 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
447 argv
[0], duration
, nr_readers
, rduration
,
448 nr_writers
, wdelay
, tot_reads
, tot_writes
,
449 tot_reads
+ tot_writes
, reclaim_batch
);
454 for (i
= 0; i
< nr_writers
; i
++)
455 free(pending_reclaims
[i
].queue
);
456 free(pending_reclaims
);