4 * Userspace RCU library - test program
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>
41 #define RAND_POOL 1000
43 /* Make this big enough to include the POWER5+ L3 cacheline size of 256B */
44 #define CACHE_LINE_SIZE 4096
46 /* hardcoded number of CPUs */
49 #if defined(_syscall0)
50 _syscall0(pid_t
, gettid
)
51 #elif defined(__NR_gettid)
52 static inline pid_t
gettid(void)
54 return syscall(__NR_gettid
);
57 #warning "use pid as tid"
58 static inline pid_t
gettid(void)
64 #ifndef DYNAMIC_LINK_TEST
67 #define debug_yield_read()
70 #include <urcu/rculfhash.h>
71 #include <urcu-call-rcu.h>
73 static unsigned int __thread rand_lookup
;
74 static unsigned long __thread nr_add
;
75 static unsigned long __thread nr_addexist
;
76 static unsigned long __thread nr_del
;
77 static unsigned long __thread nr_delnoent
;
78 static unsigned long __thread lookup_fail
;
79 static unsigned long __thread lookup_ok
;
81 static struct rcu_ht
*test_ht
;
88 static volatile int test_go
, test_stop
;
90 static unsigned long wdelay
;
92 static unsigned long duration
;
94 /* read-side C.S. duration, in loops */
95 static unsigned long rduration
;
97 static inline void loop_sleep(unsigned long l
)
103 static int verbose_mode
;
105 #define printf_verbose(fmt, args...) \
111 static unsigned int cpu_affinities
[NR_CPUS
];
112 static unsigned int next_aff
= 0;
113 static int use_affinity
= 0;
115 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
117 static void set_affinity(void)
126 ret
= pthread_mutex_lock(&affinity_mutex
);
128 perror("Error in pthread mutex lock");
131 cpu
= cpu_affinities
[next_aff
++];
132 ret
= pthread_mutex_unlock(&affinity_mutex
);
134 perror("Error in pthread mutex unlock");
139 sched_setaffinity(0, sizeof(mask
), &mask
);
143 * returns 0 if test should end.
145 static int test_duration_write(void)
150 static int test_duration_read(void)
155 static unsigned long long __thread nr_writes
;
156 static unsigned long long __thread nr_reads
;
158 static unsigned int nr_readers
;
159 static unsigned int nr_writers
;
161 pthread_mutex_t rcu_copy_mutex
= PTHREAD_MUTEX_INITIALIZER
;
163 void rcu_copy_mutex_lock(void)
166 ret
= pthread_mutex_lock(&rcu_copy_mutex
);
168 perror("Error in pthread mutex lock");
173 void rcu_copy_mutex_unlock(void)
177 ret
= pthread_mutex_unlock(&rcu_copy_mutex
);
179 perror("Error in pthread mutex unlock");
185 unsigned long test_hash(void *_hashseed
, void *_key
)
187 unsigned long seed
= (unsigned long) _hashseed
;
188 unsigned long key
= (unsigned long) _key
;
202 void *thr_reader(void *_count
)
204 unsigned long long *count
= _count
;
205 struct rcu_ht_node
*node
;
207 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
208 "reader", pthread_self(), (unsigned long)gettid());
212 rcu_register_thread();
221 node
= ht_lookup(test_ht
,
222 (void *)(unsigned long)(rand_r(&rand_lookup
) % RAND_POOL
));
228 if (unlikely(rduration
))
229 loop_sleep(rduration
);
232 if (unlikely(!test_duration_read()))
236 rcu_unregister_thread();
239 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
240 "reader", pthread_self(), (unsigned long)gettid());
241 printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
242 pthread_self(), lookup_fail
, lookup_ok
);
248 void free_node_cb(struct rcu_head
*head
)
250 struct rcu_ht_node
*node
=
251 caa_container_of(head
, struct rcu_ht_node
, head
);
255 void *thr_writer(void *_count
)
257 struct rcu_ht_node
*node
;
258 unsigned long long *count
= _count
;
261 printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
262 "writer", pthread_self(), (unsigned long)gettid());
266 rcu_register_thread();
274 if (rand_r(&rand_lookup
) & 1) {
275 node
= malloc(sizeof(struct rcu_ht_node
));
278 (void *)(unsigned long)(rand_r(&rand_lookup
) % RAND_POOL
),
280 ht_add(test_ht
, node
);
286 node
= ht_lookup(test_ht
,
287 (void *)(unsigned long)(rand_r(&rand_lookup
) % RAND_POOL
));
289 ret
= ht_remove(test_ht
, node
);
294 call_rcu(&node
->head
, free_node_cb
);
300 //if (nr_writes % 100000 == 0) {
301 if (nr_writes
% 1000 == 0) {
303 if (rand_r(&rand_lookup
) & 1) {
304 ht_resize(test_ht
, 1);
306 ht_resize(test_ht
, -1);
312 if (unlikely(!test_duration_write()))
314 if (unlikely(wdelay
))
318 rcu_unregister_thread();
320 printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
321 "writer", pthread_self(), (unsigned long)gettid());
322 printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
323 "nr_delnoent %lu\n", pthread_self(), nr_add
,
324 nr_addexist
, nr_del
, nr_delnoent
);
329 void show_usage(int argc
, char **argv
)
331 printf("Usage : %s nr_readers nr_writers duration (s)", argv
[0]);
333 printf(" [-r] [-w] (yield reader and/or writer)");
335 printf(" [-d delay] (writer period (us))");
336 printf(" [-c duration] (reader C.S. duration (in loops))");
337 printf(" [-v] (verbose output)");
338 printf(" [-a cpu#] [-a cpu#]... (affinity)");
342 int main(int argc
, char **argv
)
345 pthread_t
*tid_reader
, *tid_writer
;
347 unsigned long long *count_reader
, *count_writer
;
348 unsigned long long tot_reads
= 0, tot_writes
= 0;
352 show_usage(argc
, argv
);
356 err
= sscanf(argv
[1], "%u", &nr_readers
);
358 show_usage(argc
, argv
);
362 err
= sscanf(argv
[2], "%u", &nr_writers
);
364 show_usage(argc
, argv
);
368 err
= sscanf(argv
[3], "%lu", &duration
);
370 show_usage(argc
, argv
);
374 for (i
= 4; i
< argc
; i
++) {
375 if (argv
[i
][0] != '-')
377 switch (argv
[i
][1]) {
380 yield_active
|= YIELD_READ
;
383 yield_active
|= YIELD_WRITE
;
388 show_usage(argc
, argv
);
392 cpu_affinities
[next_aff
++] = a
;
394 printf_verbose("Adding CPU %d affinity\n", a
);
398 show_usage(argc
, argv
);
401 rduration
= atol(argv
[++i
]);
405 show_usage(argc
, argv
);
408 wdelay
= atol(argv
[++i
]);
416 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
417 duration
, nr_readers
, nr_writers
);
418 printf_verbose("Writer delay : %lu loops.\n", wdelay
);
419 printf_verbose("Reader duration : %lu loops.\n", rduration
);
420 printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
421 "main", pthread_self(), (unsigned long)gettid());
423 tid_reader
= malloc(sizeof(*tid_reader
) * nr_readers
);
424 tid_writer
= malloc(sizeof(*tid_writer
) * nr_writers
);
425 count_reader
= malloc(sizeof(*count_reader
) * nr_readers
);
426 count_writer
= malloc(sizeof(*count_writer
) * nr_writers
);
427 test_ht
= ht_new(test_hash
, (void *) 0x42,
428 HASH_SIZE
, call_rcu
);
431 for (i
= 0; i
< nr_readers
; i
++) {
432 err
= pthread_create(&tid_reader
[i
], NULL
, thr_reader
,
437 for (i
= 0; i
< nr_writers
; i
++) {
438 err
= pthread_create(&tid_writer
[i
], NULL
, thr_writer
,
452 for (i
= 0; i
< nr_readers
; i
++) {
453 err
= pthread_join(tid_reader
[i
], &tret
);
456 tot_reads
+= count_reader
[i
];
458 for (i
= 0; i
< nr_writers
; i
++) {
459 err
= pthread_join(tid_writer
[i
], &tret
);
462 tot_writes
+= count_writer
[i
];
464 ret
= ht_destroy(test_ht
);
466 printf("WARNING: nodes left in the hash table upon destroy\n");
468 printf_verbose("final delete: %d items\n", ret
);
469 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads
,
471 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
473 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n",
474 argv
[0], duration
, nr_readers
, rduration
,
475 nr_writers
, wdelay
, tot_reads
, tot_writes
,
476 tot_reads
+ tot_writes
);