4 * Userspace RCU library - example RCU-based lock-free stack
6 * Copyright February 2010 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
7 * Copyright February 2010 - Paolo Bonzini <pbonzini@redhat.com>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
30 #include <sys/types.h>
37 #include <urcu/arch.h>
38 #include <urcu/tls-compat.h>
40 #include "thread-id.h"
42 /* hardcoded number of CPUs */
45 #ifndef DYNAMIC_LINK_TEST
50 /* Remove deprecation warnings from test build. */
51 #define CDS_LFS_RCU_DEPRECATED
55 static volatile int test_go
, test_stop
;
57 static unsigned long rduration
;
59 static unsigned long duration
;
61 /* read-side C.S. duration, in loops */
62 static unsigned long wdelay
;
64 static inline void loop_sleep(unsigned long loops
)
70 static int verbose_mode
;
72 #define printf_verbose(fmt, args...) \
78 static unsigned int cpu_affinities
[NR_CPUS
];
79 static unsigned int next_aff
= 0;
80 static int use_affinity
= 0;
82 pthread_mutex_t affinity_mutex
= PTHREAD_MUTEX_INITIALIZER
;
84 static void set_affinity(void)
86 #if HAVE_SCHED_SETAFFINITY
89 #endif /* HAVE_SCHED_SETAFFINITY */
94 #if HAVE_SCHED_SETAFFINITY
95 ret
= pthread_mutex_lock(&affinity_mutex
);
97 perror("Error in pthread mutex lock");
100 cpu
= cpu_affinities
[next_aff
++];
101 ret
= pthread_mutex_unlock(&affinity_mutex
);
103 perror("Error in pthread mutex unlock");
109 #if SCHED_SETAFFINITY_ARGS == 2
110 sched_setaffinity(0, &mask
);
112 sched_setaffinity(0, sizeof(mask
), &mask
);
114 #endif /* HAVE_SCHED_SETAFFINITY */
118 * returns 0 if test should end.
120 static int test_duration_dequeue(void)
125 static int test_duration_enqueue(void)
130 static DEFINE_URCU_TLS(unsigned long long, nr_dequeues
);
131 static DEFINE_URCU_TLS(unsigned long long, nr_enqueues
);
133 static DEFINE_URCU_TLS(unsigned long long, nr_successful_dequeues
);
134 static DEFINE_URCU_TLS(unsigned long long, nr_successful_enqueues
);
136 static unsigned int nr_enqueuers
;
137 static unsigned int nr_dequeuers
;
140 struct cds_lfs_node_rcu list
;
144 static struct cds_lfs_stack_rcu s
;
146 void *thr_enqueuer(void *_count
)
148 unsigned long long *count
= _count
;
150 printf_verbose("thread_begin %s, tid %lu\n",
151 "enqueuer", urcu_get_thread_id());
155 rcu_register_thread();
163 struct test
*node
= malloc(sizeof(*node
));
166 cds_lfs_node_init_rcu(&node
->list
);
167 /* No rcu read-side is needed for push */
168 cds_lfs_push_rcu(&s
, &node
->list
);
169 URCU_TLS(nr_successful_enqueues
)++;
171 if (caa_unlikely(wdelay
))
174 URCU_TLS(nr_enqueues
)++;
175 if (caa_unlikely(!test_duration_enqueue()))
179 rcu_unregister_thread();
181 count
[0] = URCU_TLS(nr_enqueues
);
182 count
[1] = URCU_TLS(nr_successful_enqueues
);
183 printf_verbose("enqueuer thread_end, tid %lu, "
184 "enqueues %llu successful_enqueues %llu\n",
185 urcu_get_thread_id(),
186 URCU_TLS(nr_enqueues
),
187 URCU_TLS(nr_successful_enqueues
));
193 void free_node_cb(struct rcu_head
*head
)
196 caa_container_of(head
, struct test
, rcu
);
200 void *thr_dequeuer(void *_count
)
202 unsigned long long *count
= _count
;
204 printf_verbose("thread_begin %s, tid %lu\n",
205 "dequeuer", urcu_get_thread_id());
209 rcu_register_thread();
217 struct cds_lfs_node_rcu
*snode
;
220 snode
= cds_lfs_pop_rcu(&s
);
225 node
= caa_container_of(snode
, struct test
, list
);
226 call_rcu(&node
->rcu
, free_node_cb
);
227 URCU_TLS(nr_successful_dequeues
)++;
229 URCU_TLS(nr_dequeues
)++;
230 if (caa_unlikely(!test_duration_dequeue()))
232 if (caa_unlikely(rduration
))
233 loop_sleep(rduration
);
236 rcu_unregister_thread();
238 printf_verbose("dequeuer thread_end, tid %lu, "
239 "dequeues %llu, successful_dequeues %llu\n",
240 urcu_get_thread_id(),
241 URCU_TLS(nr_dequeues
),
242 URCU_TLS(nr_successful_dequeues
));
243 count
[0] = URCU_TLS(nr_dequeues
);
244 count
[1] = URCU_TLS(nr_successful_dequeues
);
248 void test_end(struct cds_lfs_stack_rcu
*s
, unsigned long long *nr_dequeues
)
250 struct cds_lfs_node_rcu
*snode
;
253 snode
= cds_lfs_pop_rcu(s
);
257 node
= caa_container_of(snode
, struct test
, list
);
264 void show_usage(int argc
, char **argv
)
266 printf("Usage : %s nr_dequeuers nr_enqueuers duration (s) <OPTIONS>\n",
268 printf("OPTIONS:\n");
269 printf(" [-d delay] (enqueuer period (in loops))\n");
270 printf(" [-c duration] (dequeuer period (in loops))\n");
271 printf(" [-v] (verbose output)\n");
272 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
276 int main(int argc
, char **argv
)
279 pthread_t
*tid_enqueuer
, *tid_dequeuer
;
281 unsigned long long *count_enqueuer
, *count_dequeuer
;
282 unsigned long long tot_enqueues
= 0, tot_dequeues
= 0;
283 unsigned long long tot_successful_enqueues
= 0,
284 tot_successful_dequeues
= 0;
285 unsigned long long end_dequeues
= 0;
290 show_usage(argc
, argv
);
294 err
= sscanf(argv
[1], "%u", &nr_dequeuers
);
296 show_usage(argc
, argv
);
300 err
= sscanf(argv
[2], "%u", &nr_enqueuers
);
302 show_usage(argc
, argv
);
306 err
= sscanf(argv
[3], "%lu", &duration
);
308 show_usage(argc
, argv
);
312 for (i
= 4; i
< argc
; i
++) {
313 if (argv
[i
][0] != '-')
315 switch (argv
[i
][1]) {
318 show_usage(argc
, argv
);
322 cpu_affinities
[next_aff
++] = a
;
324 printf_verbose("Adding CPU %d affinity\n", a
);
328 show_usage(argc
, argv
);
331 rduration
= atol(argv
[++i
]);
335 show_usage(argc
, argv
);
338 wdelay
= atol(argv
[++i
]);
346 printf_verbose("running test for %lu seconds, %u enqueuers, "
348 duration
, nr_enqueuers
, nr_dequeuers
);
349 printf_verbose("Writer delay : %lu loops.\n", rduration
);
350 printf_verbose("Reader duration : %lu loops.\n", wdelay
);
351 printf_verbose("thread %-6s, tid %lu\n",
352 "main", urcu_get_thread_id());
354 tid_enqueuer
= calloc(nr_enqueuers
, sizeof(*tid_enqueuer
));
355 tid_dequeuer
= calloc(nr_dequeuers
, sizeof(*tid_dequeuer
));
356 count_enqueuer
= calloc(nr_enqueuers
, 2 * sizeof(*count_enqueuer
));
357 count_dequeuer
= calloc(nr_dequeuers
, 2 * sizeof(*count_dequeuer
));
358 cds_lfs_init_rcu(&s
);
359 err
= create_all_cpu_call_rcu_data(0);
361 printf("Per-CPU call_rcu() worker threads unavailable. Using default global worker thread.\n");
366 for (i_thr
= 0; i_thr
< nr_enqueuers
; i_thr
++) {
367 err
= pthread_create(&tid_enqueuer
[i_thr
], NULL
, thr_enqueuer
,
368 &count_enqueuer
[2 * i_thr
]);
372 for (i_thr
= 0; i_thr
< nr_dequeuers
; i_thr
++) {
373 err
= pthread_create(&tid_dequeuer
[i_thr
], NULL
, thr_dequeuer
,
374 &count_dequeuer
[2 * i_thr
]);
383 for (i_thr
= 0; i_thr
< duration
; i_thr
++) {
386 fwrite(".", sizeof(char), 1, stdout
);
393 for (i_thr
= 0; i_thr
< nr_enqueuers
; i_thr
++) {
394 err
= pthread_join(tid_enqueuer
[i_thr
], &tret
);
397 tot_enqueues
+= count_enqueuer
[2 * i_thr
];
398 tot_successful_enqueues
+= count_enqueuer
[2 * i_thr
+ 1];
400 for (i_thr
= 0; i_thr
< nr_dequeuers
; i_thr
++) {
401 err
= pthread_join(tid_dequeuer
[i_thr
], &tret
);
404 tot_dequeues
+= count_dequeuer
[2 * i_thr
];
405 tot_successful_dequeues
+= count_dequeuer
[2 * i_thr
+ 1];
408 test_end(&s
, &end_dequeues
);
410 printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
411 tot_enqueues
, tot_dequeues
);
412 printf_verbose("total number of successful enqueues : %llu, "
413 "successful dequeues %llu\n",
414 tot_successful_enqueues
, tot_successful_dequeues
);
415 printf("SUMMARY %-25s testdur %4lu nr_enqueuers %3u wdelay %6lu "
417 "rdur %6lu nr_enqueues %12llu nr_dequeues %12llu "
418 "successful enqueues %12llu successful dequeues %12llu "
419 "end_dequeues %llu nr_ops %12llu\n",
420 argv
[0], duration
, nr_enqueuers
, wdelay
,
421 nr_dequeuers
, rduration
, tot_enqueues
, tot_dequeues
,
422 tot_successful_enqueues
,
423 tot_successful_dequeues
, end_dequeues
,
424 tot_enqueues
+ tot_dequeues
);
425 if (tot_successful_enqueues
!= tot_successful_dequeues
+ end_dequeues
)
426 printf("WARNING! Discrepancy between nr succ. enqueues %llu vs "
427 "succ. dequeues + end dequeues %llu.\n",
428 tot_successful_enqueues
,
429 tot_successful_dequeues
+ end_dequeues
);
431 free_all_cpu_call_rcu_data();
432 free(count_enqueuer
);
433 free(count_dequeuer
);