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.
24 #include "../config.h"
29 #include <sys/types.h>
34 #include <sys/syscall.h>
38 #include <urcu/arch.h>
40 /* hardcoded number of CPUs */
43 #if defined(_syscall0)
44 _syscall0(pid_t
, gettid
)
45 #elif defined(__NR_gettid)
46 static inline pid_t
gettid(void)
48 return syscall(__NR_gettid
);
51 #warning "use pid as tid"
52 static inline pid_t
gettid(void)
59 #include <urcu-qsbr.h>
65 static volatile int test_go
, test_stop
;
67 static unsigned long wdelay
;
69 static struct test_array
*test_rcu_pointer
;
71 static unsigned long duration
;
73 /* read-side C.S. duration, in loops */
74 static unsigned long rduration
;
75 static unsigned int reclaim_batch
= 1;
77 struct reclaim_queue
{
78 void **queue
; /* Beginning of queue */
79 void **head
; /* Insert position */
82 static struct reclaim_queue
*pending_reclaims
;
85 static inline void loop_sleep(unsigned long l
)
91 static int verbose_mode
;
93 #define printf_verbose(fmt, args...) \
99 static unsigned int cpu_affinities
[NR_CPUS
];
100 static unsigned int next_aff
= 0;
101 static int use_affinity
= 0;
103 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
105 #ifndef HAVE_CPU_SET_T
106 typedef unsigned long cpu_set_t
;
107 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
108 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
111 static void set_affinity(void)
120 #if HAVE_SCHED_SETAFFINITY
121 ret
= pthread_mutex_lock(&affinity_mutex
);
123 perror("Error in pthread mutex lock");
126 cpu
= cpu_affinities
[next_aff
++];
127 ret
= pthread_mutex_unlock(&affinity_mutex
);
129 perror("Error in pthread mutex unlock");
135 #if SCHED_SETAFFINITY_ARGS == 2
136 sched_setaffinity(0, &mask
);
138 sched_setaffinity(0, sizeof(mask
), &mask
);
140 #endif /* HAVE_SCHED_SETAFFINITY */
144 * returns 0 if test should end.
146 static int test_duration_write(void)
151 static int test_duration_read(void)
156 static unsigned long long __thread nr_writes
;
157 static unsigned long long __thread nr_reads
;
159 static unsigned int nr_readers
;
160 static unsigned int nr_writers
;
162 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
164 unsigned long long __attribute__((aligned(CACHE_LINE_SIZE
))) *tot_nr_writes
;
167 void rcu_copy_mutex_lock(void)
170 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
172 perror("Error in pthread mutex lock");
177 void rcu_copy_mutex_unlock(void)
181 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
183 perror("Error in pthread mutex unlock");
188 void *thr_reader(void *_count
)
190 unsigned long long *count
= _count
;
191 struct test_array
*local_ptr
;
193 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
194 "reader", pthread_self(), (unsigned long)gettid());
198 rcu_register_thread();
207 local_ptr
= _rcu_dereference(test_rcu_pointer
);
210 assert(local_ptr
->a
== 8);
211 if (unlikely(rduration
))
212 loop_sleep(rduration
);
215 /* QS each 1024 reads */
216 if (unlikely((nr_reads
& ((1 << 10) - 1)) == 0))
217 _rcu_quiescent_state();
218 if (unlikely(!test_duration_read()))
222 rcu_unregister_thread();
225 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
226 "reader", pthread_self(), (unsigned long)gettid());
231 static void rcu_gc_clear_queue(unsigned long wtidx
)
235 /* Wait for Q.S and empty queue */
238 for (p
= pending_reclaims
[wtidx
].queue
;
239 p
< pending_reclaims
[wtidx
].head
; p
++) {
242 ((struct test_array
*)*p
)->a
= 0;
245 pending_reclaims
[wtidx
].head
= pending_reclaims
[wtidx
].queue
;
248 /* Using per-thread queue */
249 static void rcu_gc_reclaim(unsigned long wtidx
, void *old
)
252 *pending_reclaims
[wtidx
].head
= old
;
253 pending_reclaims
[wtidx
].head
++;
255 if (likely(pending_reclaims
[wtidx
].head
- pending_reclaims
[wtidx
].queue
259 rcu_gc_clear_queue(wtidx
);
262 void *thr_writer(void *data
)
264 unsigned long wtidx
= (unsigned long)data
;
266 struct test_array
*old
= NULL
;
268 struct test_array
*new, *old
;
271 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
272 "writer", pthread_self(), (unsigned long)gettid());
282 #ifndef TEST_LOCAL_GC
283 new = malloc(sizeof(*new));
285 old
= _rcu_xchg_pointer(&test_rcu_pointer
, new);
287 rcu_gc_reclaim(wtidx
, old
);
289 if (unlikely(!test_duration_write()))
291 if (unlikely(wdelay
))
295 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
296 "writer", pthread_self(), (unsigned long)gettid());
297 tot_nr_writes
[wtidx
] = nr_writes
;
301 void show_usage(int argc
, char **argv
)
303 printf("Usage : %s nr_readers nr_writers duration (s)", argv
[0]);
305 printf(" [-r] [-w] (yield reader and/or writer)");
307 printf(" [-d delay] (writer period (us))");
308 printf(" [-c duration] (reader C.S. duration (in loops))");
309 printf(" [-v] (verbose output)");
310 printf(" [-a cpu#] [-a cpu#]... (affinity)");
314 int main(int argc
, char **argv
)
317 pthread_t
*tid_reader
, *tid_writer
;
319 unsigned long long *count_reader
;
320 unsigned long long tot_reads
= 0, tot_writes
= 0;
324 show_usage(argc
, argv
);
328 err
= sscanf(argv
[1], "%u", &nr_readers
);
330 show_usage(argc
, argv
);
334 err
= sscanf(argv
[2], "%u", &nr_writers
);
336 show_usage(argc
, argv
);
340 err
= sscanf(argv
[3], "%lu", &duration
);
342 show_usage(argc
, argv
);
346 for (i
= 4; i
< argc
; i
++) {
347 if (argv
[i
][0] != '-')
349 switch (argv
[i
][1]) {
352 yield_active
|= YIELD_READ
;
355 yield_active
|= YIELD_WRITE
;
360 show_usage(argc
, argv
);
364 cpu_affinities
[next_aff
++] = a
;
366 printf_verbose("Adding CPU %d affinity\n", a
);
370 show_usage(argc
, argv
);
373 reclaim_batch
= atol(argv
[++i
]);
377 show_usage(argc
, argv
);
380 rduration
= atol(argv
[++i
]);
384 show_usage(argc
, argv
);
387 wdelay
= atol(argv
[++i
]);
395 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
396 duration
, nr_readers
, nr_writers
);
397 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
398 printf_verbose("Reader duration : %lu loops.\n", rduration
);
399 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
400 "main", pthread_self(), (unsigned long)gettid());
402 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
403 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
404 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
405 tot_nr_writes
= malloc(sizeof(*tot_nr_writes
) * nr_writers
);
406 pending_reclaims
= malloc(sizeof(*pending_reclaims
) * nr_writers
);
407 if (reclaim_batch
* sizeof(*pending_reclaims
[i
].queue
)
409 for (i
= 0; i
< nr_writers
; i
++)
410 pending_reclaims
[i
].queue
= calloc(1, CACHE_LINE_SIZE
);
412 for (i
= 0; i
< nr_writers
; i
++)
413 pending_reclaims
[i
].queue
= calloc(reclaim_batch
,
414 sizeof(*pending_reclaims
[i
].queue
));
415 for (i
= 0; i
< nr_writers
; i
++)
416 pending_reclaims
[i
].head
= pending_reclaims
[i
].queue
;
420 for (i
= 0; i
< nr_readers
; i
++) {
421 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
426 for (i
= 0; i
< nr_writers
; i
++) {
427 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
441 for (i
= 0; i
< nr_readers
; i
++) {
442 err
= pthread_join(tid_reader
[i
], &tret
);
445 tot_reads
+= count_reader
[i
];
447 for (i
= 0; i
< nr_writers
; i
++) {
448 err
= pthread_join(tid_writer
[i
], &tret
);
451 tot_writes
+= tot_nr_writes
[i
];
452 rcu_gc_clear_queue(i
);
455 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
457 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
459 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
461 argv
[0], duration
, nr_readers
, rduration
,
462 nr_writers
, wdelay
, tot_reads
, tot_writes
,
463 tot_reads
+ tot_writes
, reclaim_batch
);
468 for (i
= 0; i
< nr_writers
; i
++)
469 free(pending_reclaims
[i
].queue
);
470 free(pending_reclaims
);