5fc15c0c6780dda2e216db8667e82b3fdb996c09
[urcu.git] / tests / benchmark / test_urcu_qsbr_gc.c
1 /*
2 * test_urcu_gc.c
3 *
4 * Userspace RCU library - test program (with baatch reclamation)
5 *
6 * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
7 *
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.
12 *
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.
17 *
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.
21 */
22
23 #define _GNU_SOURCE
24 #include "config.h"
25 #include <stdio.h>
26 #include <pthread.h>
27 #include <stdlib.h>
28 #include <string.h>
29 #include <sys/types.h>
30 #include <sys/wait.h>
31 #include <unistd.h>
32 #include <stdio.h>
33 #include <assert.h>
34 #include <errno.h>
35
36 #include <urcu/arch.h>
37 #include <urcu/tls-compat.h>
38 #include "cpuset.h"
39 #include "thread-id.h"
40
41 /* hardcoded number of CPUs */
42 #define NR_CPUS 16384
43
44 #define _LGPL_SOURCE
45 #include <urcu-qsbr.h>
46
47 struct test_array {
48 int a;
49 };
50
51 static volatile int test_go, test_stop;
52
53 static unsigned long wdelay;
54
55 static struct test_array *test_rcu_pointer;
56
57 static unsigned long duration;
58
59 /* read-side C.S. duration, in loops */
60 static unsigned long rduration;
61 static unsigned int reclaim_batch = 1;
62
63 struct reclaim_queue {
64 void **queue; /* Beginning of queue */
65 void **head; /* Insert position */
66 };
67
68 static struct reclaim_queue *pending_reclaims;
69
70
71 /* write-side C.S. duration, in loops */
72 static unsigned long wduration;
73
74 static inline void loop_sleep(unsigned long loops)
75 {
76 while (loops-- != 0)
77 caa_cpu_relax();
78 }
79
80 static int verbose_mode;
81
82 #define printf_verbose(fmt, args...) \
83 do { \
84 if (verbose_mode) \
85 printf(fmt, args); \
86 } while (0)
87
88 static unsigned int cpu_affinities[NR_CPUS];
89 static unsigned int next_aff = 0;
90 static int use_affinity = 0;
91
92 pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
93
94 static void set_affinity(void)
95 {
96 #if HAVE_SCHED_SETAFFINITY
97 cpu_set_t mask;
98 int cpu, ret;
99 #endif /* HAVE_SCHED_SETAFFINITY */
100
101 if (!use_affinity)
102 return;
103
104 #if HAVE_SCHED_SETAFFINITY
105 ret = pthread_mutex_lock(&affinity_mutex);
106 if (ret) {
107 perror("Error in pthread mutex lock");
108 exit(-1);
109 }
110 cpu = cpu_affinities[next_aff++];
111 ret = pthread_mutex_unlock(&affinity_mutex);
112 if (ret) {
113 perror("Error in pthread mutex unlock");
114 exit(-1);
115 }
116
117 CPU_ZERO(&mask);
118 CPU_SET(cpu, &mask);
119 #if SCHED_SETAFFINITY_ARGS == 2
120 sched_setaffinity(0, &mask);
121 #else
122 sched_setaffinity(0, sizeof(mask), &mask);
123 #endif
124 #endif /* HAVE_SCHED_SETAFFINITY */
125 }
126
127 /*
128 * returns 0 if test should end.
129 */
130 static int test_duration_write(void)
131 {
132 return !test_stop;
133 }
134
135 static int test_duration_read(void)
136 {
137 return !test_stop;
138 }
139
140 static DEFINE_URCU_TLS(unsigned long long, nr_writes);
141 static DEFINE_URCU_TLS(unsigned long long, nr_reads);
142
143 static unsigned int nr_readers;
144 static unsigned int nr_writers;
145
146 pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
147 static
148 unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes;
149
150
151 void rcu_copy_mutex_lock(void)
152 {
153 int ret;
154 ret = pthread_mutex_lock(&rcu_copy_mutex);
155 if (ret) {
156 perror("Error in pthread mutex lock");
157 exit(-1);
158 }
159 }
160
161 void rcu_copy_mutex_unlock(void)
162 {
163 int ret;
164
165 ret = pthread_mutex_unlock(&rcu_copy_mutex);
166 if (ret) {
167 perror("Error in pthread mutex unlock");
168 exit(-1);
169 }
170 }
171
172 void *thr_reader(void *_count)
173 {
174 unsigned long long *count = _count;
175 struct test_array *local_ptr;
176
177 printf_verbose("thread_begin %s, tid %lu\n",
178 "reader", urcu_get_thread_id());
179
180 set_affinity();
181
182 rcu_register_thread();
183
184 while (!test_go)
185 {
186 }
187 cmm_smp_mb();
188
189 for (;;) {
190 _rcu_read_lock();
191 local_ptr = _rcu_dereference(test_rcu_pointer);
192 rcu_debug_yield_read();
193 if (local_ptr)
194 assert(local_ptr->a == 8);
195 if (caa_unlikely(rduration))
196 loop_sleep(rduration);
197 _rcu_read_unlock();
198 URCU_TLS(nr_reads)++;
199 /* QS each 1024 reads */
200 if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0))
201 _rcu_quiescent_state();
202 if (caa_unlikely(!test_duration_read()))
203 break;
204 }
205
206 rcu_unregister_thread();
207
208 *count = URCU_TLS(nr_reads);
209 printf_verbose("thread_end %s, tid %lu\n",
210 "reader", urcu_get_thread_id());
211 return ((void*)1);
212
213 }
214
215 static void rcu_gc_clear_queue(unsigned long wtidx)
216 {
217 void **p;
218
219 /* Wait for Q.S and empty queue */
220 synchronize_rcu();
221
222 for (p = pending_reclaims[wtidx].queue;
223 p < pending_reclaims[wtidx].head; p++) {
224 /* poison */
225 if (*p)
226 ((struct test_array *)*p)->a = 0;
227 free(*p);
228 }
229 pending_reclaims[wtidx].head = pending_reclaims[wtidx].queue;
230 }
231
232 /* Using per-thread queue */
233 static void rcu_gc_reclaim(unsigned long wtidx, void *old)
234 {
235 /* Queue pointer */
236 *pending_reclaims[wtidx].head = old;
237 pending_reclaims[wtidx].head++;
238
239 if (caa_likely(pending_reclaims[wtidx].head - pending_reclaims[wtidx].queue
240 < reclaim_batch))
241 return;
242
243 rcu_gc_clear_queue(wtidx);
244 }
245
246 void *thr_writer(void *data)
247 {
248 unsigned long wtidx = (unsigned long)data;
249 #ifdef TEST_LOCAL_GC
250 struct test_array *old = NULL;
251 #else
252 struct test_array *new, *old;
253 #endif
254
255 printf_verbose("thread_begin %s, tid %lu\n",
256 "writer", urcu_get_thread_id());
257
258 set_affinity();
259
260 while (!test_go)
261 {
262 }
263 cmm_smp_mb();
264
265 for (;;) {
266 #ifndef TEST_LOCAL_GC
267 new = malloc(sizeof(*new));
268 new->a = 8;
269 old = _rcu_xchg_pointer(&test_rcu_pointer, new);
270 #endif
271 if (caa_unlikely(wduration))
272 loop_sleep(wduration);
273 rcu_gc_reclaim(wtidx, old);
274 URCU_TLS(nr_writes)++;
275 if (caa_unlikely(!test_duration_write()))
276 break;
277 if (caa_unlikely(wdelay))
278 loop_sleep(wdelay);
279 }
280
281 printf_verbose("thread_end %s, tid %lu\n",
282 "writer", urcu_get_thread_id());
283 tot_nr_writes[wtidx] = URCU_TLS(nr_writes);
284 return ((void*)2);
285 }
286
287 void show_usage(int argc, char **argv)
288 {
289 printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
290 argv[0]);
291 printf("OPTIONS:\n");
292 #ifdef DEBUG_YIELD
293 printf(" [-r] [-w] (yield reader and/or writer)\n");
294 #endif
295 printf(" [-b batch] (batch reclaim)\n");
296 printf(" [-d delay] (writer period (us))\n");
297 printf(" [-c duration] (reader C.S. duration (in loops))\n");
298 printf(" [-e duration] (writer C.S. duration (in loops))\n");
299 printf(" [-v] (verbose output)\n");
300 printf(" [-a cpu#] [-a cpu#]... (affinity)\n");
301 printf("\n");
302 }
303
304 int main(int argc, char **argv)
305 {
306 int err;
307 pthread_t *tid_reader, *tid_writer;
308 void *tret;
309 unsigned long long *count_reader;
310 unsigned long long tot_reads = 0, tot_writes = 0;
311 int i, a;
312
313 if (argc < 4) {
314 show_usage(argc, argv);
315 return -1;
316 }
317
318 err = sscanf(argv[1], "%u", &nr_readers);
319 if (err != 1) {
320 show_usage(argc, argv);
321 return -1;
322 }
323
324 err = sscanf(argv[2], "%u", &nr_writers);
325 if (err != 1) {
326 show_usage(argc, argv);
327 return -1;
328 }
329
330 err = sscanf(argv[3], "%lu", &duration);
331 if (err != 1) {
332 show_usage(argc, argv);
333 return -1;
334 }
335
336 for (i = 4; i < argc; i++) {
337 if (argv[i][0] != '-')
338 continue;
339 switch (argv[i][1]) {
340 #ifdef DEBUG_YIELD
341 case 'r':
342 rcu_yield_active |= RCU_YIELD_READ;
343 break;
344 case 'w':
345 rcu_yield_active |= RCU_YIELD_WRITE;
346 break;
347 #endif
348 case 'a':
349 if (argc < i + 2) {
350 show_usage(argc, argv);
351 return -1;
352 }
353 a = atoi(argv[++i]);
354 cpu_affinities[next_aff++] = a;
355 use_affinity = 1;
356 printf_verbose("Adding CPU %d affinity\n", a);
357 break;
358 case 'b':
359 if (argc < i + 2) {
360 show_usage(argc, argv);
361 return -1;
362 }
363 reclaim_batch = atol(argv[++i]);
364 break;
365 case 'c':
366 if (argc < i + 2) {
367 show_usage(argc, argv);
368 return -1;
369 }
370 rduration = atol(argv[++i]);
371 break;
372 case 'd':
373 if (argc < i + 2) {
374 show_usage(argc, argv);
375 return -1;
376 }
377 wdelay = atol(argv[++i]);
378 break;
379 case 'e':
380 if (argc < i + 2) {
381 show_usage(argc, argv);
382 return -1;
383 }
384 wduration = atol(argv[++i]);
385 break;
386 case 'v':
387 verbose_mode = 1;
388 break;
389 }
390 }
391
392 printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
393 duration, nr_readers, nr_writers);
394 printf_verbose("Writer delay : %lu loops.\n", wdelay);
395 printf_verbose("Reader duration : %lu loops.\n", rduration);
396 printf_verbose("thread %-6s, tid %lu\n",
397 "main", urcu_get_thread_id());
398
399 tid_reader = calloc(nr_readers, sizeof(*tid_reader));
400 tid_writer = calloc(nr_writers, sizeof(*tid_writer));
401 count_reader = calloc(nr_readers, sizeof(*count_reader));
402 tot_nr_writes = calloc(nr_writers, sizeof(*tot_nr_writes));
403 pending_reclaims = calloc(nr_writers, sizeof(*pending_reclaims));
404 if (reclaim_batch * sizeof(*pending_reclaims[i].queue)
405 < CAA_CACHE_LINE_SIZE)
406 for (i = 0; i < nr_writers; i++)
407 pending_reclaims[i].queue = calloc(1, CAA_CACHE_LINE_SIZE);
408 else
409 for (i = 0; i < nr_writers; i++)
410 pending_reclaims[i].queue = calloc(reclaim_batch,
411 sizeof(*pending_reclaims[i].queue));
412 for (i = 0; i < nr_writers; i++)
413 pending_reclaims[i].head = pending_reclaims[i].queue;
414
415 next_aff = 0;
416
417 for (i = 0; i < nr_readers; i++) {
418 err = pthread_create(&tid_reader[i], NULL, thr_reader,
419 &count_reader[i]);
420 if (err != 0)
421 exit(1);
422 }
423 for (i = 0; i < nr_writers; i++) {
424 err = pthread_create(&tid_writer[i], NULL, thr_writer,
425 (void *)(long)i);
426 if (err != 0)
427 exit(1);
428 }
429
430 cmm_smp_mb();
431
432 test_go = 1;
433
434 sleep(duration);
435
436 test_stop = 1;
437
438 for (i = 0; i < nr_readers; i++) {
439 err = pthread_join(tid_reader[i], &tret);
440 if (err != 0)
441 exit(1);
442 tot_reads += count_reader[i];
443 }
444 for (i = 0; i < nr_writers; i++) {
445 err = pthread_join(tid_writer[i], &tret);
446 if (err != 0)
447 exit(1);
448 tot_writes += tot_nr_writes[i];
449 rcu_gc_clear_queue(i);
450 }
451
452 printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
453 tot_writes);
454 printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
455 "nr_writers %3u "
456 "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
457 "batch %u\n",
458 argv[0], duration, nr_readers, rduration, wduration,
459 nr_writers, wdelay, tot_reads, tot_writes,
460 tot_reads + tot_writes, reclaim_batch);
461 free(tid_reader);
462 free(tid_writer);
463 free(count_reader);
464 free(tot_nr_writes);
465 for (i = 0; i < nr_writers; i++)
466 free(pending_reclaims[i].queue);
467 free(pending_reclaims);
468
469 return 0;
470 }
This page took 0.038128 seconds and 3 git commands to generate.