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