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