4 * Userspace RCU library - test program
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>
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)
58 #ifndef DYNAMIC_LINK_TEST
61 #define debug_yield_read()
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
;
80 /* write-side C.S. duration, in loops */
81 static unsigned long wduration
;
83 static inline void loop_sleep(unsigned long l
)
89 static int verbose_mode
;
91 #define printf_verbose(fmt, args...) \
97 static unsigned int cpu_affinities
[NR_CPUS
];
98 static unsigned int next_aff
= 0;
99 static int use_affinity
= 0;
101 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
103 #ifndef HAVE_CPU_SET_T
104 typedef unsigned long cpu_set_t
;
105 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
106 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
109 static void set_affinity(void)
118 #if HAVE_SCHED_SETAFFINITY
119 ret
= pthread_mutex_lock(&affinity_mutex
);
121 perror("Error in pthread mutex lock");
124 cpu
= cpu_affinities
[next_aff
++];
125 ret
= pthread_mutex_unlock(&affinity_mutex
);
127 perror("Error in pthread mutex unlock");
133 #if SCHED_SETAFFINITY_ARGS == 2
134 sched_setaffinity(0, &mask
);
136 sched_setaffinity(0, sizeof(mask
), &mask
);
138 #endif /* HAVE_SCHED_SETAFFINITY */
142 * returns 0 if test should end.
144 static int test_duration_write(void)
149 static int test_duration_read(void)
154 static unsigned long long __thread nr_writes
;
155 static unsigned long long __thread nr_reads
;
157 static unsigned int nr_readers
;
158 static unsigned int nr_writers
;
160 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
162 void rcu_copy_mutex_lock(void)
165 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
167 perror("Error in pthread mutex lock");
172 void rcu_copy_mutex_unlock(void)
176 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
178 perror("Error in pthread mutex unlock");
184 * malloc/free are reusing memory areas too quickly, which does not let us
185 * test races appropriately. Use a large circular array for allocations.
186 * ARRAY_SIZE is larger than nr_writers, which insures we never run over our tail.
188 #define ARRAY_SIZE (1048576 * nr_writers)
189 #define ARRAY_POISON 0xDEADBEEF
190 static int array_index
;
191 static struct test_array
*test_array
;
193 static struct test_array
*test_array_alloc(void)
195 struct test_array
*ret
;
198 rcu_copy_mutex_lock();
199 index
= array_index
% ARRAY_SIZE
;
200 assert(test_array
[index
].a
== ARRAY_POISON
||
201 test_array
[index
].a
== 0);
202 ret
= &test_array
[index
];
204 if (array_index
== ARRAY_SIZE
)
206 rcu_copy_mutex_unlock();
210 static void test_array_free(struct test_array
*ptr
)
214 rcu_copy_mutex_lock();
215 ptr
->a
= ARRAY_POISON
;
216 rcu_copy_mutex_unlock();
219 void *thr_reader(void *_count
)
221 unsigned long long *count
= _count
;
222 struct test_array
*local_ptr
;
224 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
225 "reader", pthread_self(), (unsigned long)gettid());
229 rcu_register_thread();
238 local_ptr
= rcu_dereference(test_rcu_pointer
);
241 assert(local_ptr
->a
== 8);
242 if (unlikely(rduration
))
243 loop_sleep(rduration
);
246 if (unlikely(!test_duration_read()))
250 rcu_unregister_thread();
253 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
254 "reader", pthread_self(), (unsigned long)gettid());
259 void *thr_writer(void *_count
)
261 unsigned long long *count
= _count
;
262 struct test_array
*new, *old
;
264 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
265 "writer", pthread_self(), (unsigned long)gettid());
275 new = test_array_alloc();
277 rcu_copy_mutex_lock();
278 old
= test_rcu_pointer
;
279 rcu_assign_pointer(test_rcu_pointer
, new);
280 if (unlikely(wduration
))
281 loop_sleep(wduration
);
282 rcu_copy_mutex_unlock();
286 test_array_free(old
);
288 if (unlikely(!test_duration_write()))
290 if (unlikely(wdelay
))
294 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
295 "writer", pthread_self(), (unsigned long)gettid());
300 void show_usage(int argc
, char **argv
)
302 printf("Usage : %s nr_readers nr_writers duration (s)", argv
[0]);
304 printf(" [-r] [-w] (yield reader and/or writer)");
306 printf(" [-d delay] (writer period (us))");
307 printf(" [-c duration] (reader C.S. duration (in loops))");
308 printf(" [-e duration] (writer 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
, *count_writer
;
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 rduration
= atol(argv
[++i
]);
377 show_usage(argc
, argv
);
380 wdelay
= atol(argv
[++i
]);
384 show_usage(argc
, argv
);
387 wduration
= 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 test_array
= calloc(1, sizeof(*test_array
) * ARRAY_SIZE
);
403 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
404 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
405 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
406 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
410 for (i
= 0; i
< nr_readers
; i
++) {
411 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
416 for (i
= 0; i
< nr_writers
; i
++) {
417 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
431 for (i
= 0; i
< nr_readers
; i
++) {
432 err
= pthread_join(tid_reader
[i
], &tret
);
435 tot_reads
+= count_reader
[i
];
437 for (i
= 0; i
< nr_writers
; i
++) {
438 err
= pthread_join(tid_writer
[i
], &tret
);
441 tot_writes
+= count_writer
[i
];
444 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
446 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
448 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n",
449 argv
[0], duration
, nr_readers
, rduration
, wduration
,
450 nr_writers
, wdelay
, tot_reads
, tot_writes
,
451 tot_reads
+ tot_writes
);
452 test_array_free(test_rcu_pointer
);