Commit | Line | Data |
---|---|---|
51299083 MD |
1 | /* |
2 | * test_urcu.c | |
3 | * | |
4 | * Userspace RCU library - test program | |
5 | * | |
6982d6d7 | 6 | * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com> |
51299083 MD |
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 | ||
51299083 MD |
23 | #include <stdio.h> |
24 | #include <pthread.h> | |
25 | #include <stdlib.h> | |
26 | #include <string.h> | |
27 | #include <sys/types.h> | |
28 | #include <sys/wait.h> | |
29 | #include <unistd.h> | |
30 | #include <stdio.h> | |
31 | #include <assert.h> | |
94b343fd | 32 | #include <errno.h> |
51299083 | 33 | |
ec4e58a3 | 34 | #include <urcu/arch.h> |
bd252a04 | 35 | #include <urcu/tls-compat.h> |
2953b501 | 36 | #include "cpuset.h" |
94df6318 | 37 | #include "thread-id.h" |
65fcc7e9 | 38 | |
2a7ac59d MD |
39 | /* hardcoded number of CPUs */ |
40 | #define NR_CPUS 16384 | |
41 | ||
51299083 MD |
42 | #ifndef DYNAMIC_LINK_TEST |
43 | #define _LGPL_SOURCE | |
51299083 | 44 | #endif |
ec4e58a3 | 45 | #include <urcu.h> |
51299083 MD |
46 | |
47 | struct test_array { | |
48 | int a; | |
49 | }; | |
50 | ||
f61dfd97 | 51 | static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER; |
51299083 MD |
52 | |
53 | static volatile int test_go, test_stop; | |
54 | ||
9e31d0f0 | 55 | static unsigned long wdelay; |
51299083 MD |
56 | |
57 | static volatile struct test_array test_array = { 8 }; | |
58 | ||
59 | static unsigned long duration; | |
60 | ||
daddf5b0 | 61 | /* read-side C.S. duration, in loops */ |
8b632bab MD |
62 | static unsigned long rduration; |
63 | ||
31b598e0 MD |
64 | /* write-side C.S. duration, in loops */ |
65 | static unsigned long wduration; | |
66 | ||
ab0aacbe | 67 | static inline void loop_sleep(unsigned long loops) |
daddf5b0 | 68 | { |
ab0aacbe | 69 | while (loops-- != 0) |
06f22bdb | 70 | caa_cpu_relax(); |
daddf5b0 MD |
71 | } |
72 | ||
4bad7d45 MD |
73 | static int verbose_mode; |
74 | ||
75 | #define printf_verbose(fmt, args...) \ | |
76 | do { \ | |
77 | if (verbose_mode) \ | |
78 | printf(fmt, args); \ | |
79 | } while (0) | |
80 | ||
2a7ac59d MD |
81 | static unsigned int cpu_affinities[NR_CPUS]; |
82 | static unsigned int next_aff = 0; | |
83 | static int use_affinity = 0; | |
84 | ||
6af882ba MD |
85 | pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER; |
86 | ||
2a7ac59d MD |
87 | static void set_affinity(void) |
88 | { | |
95bc7fb9 | 89 | #if HAVE_SCHED_SETAFFINITY |
2a7ac59d | 90 | cpu_set_t mask; |
95bc7fb9 MD |
91 | int cpu, ret; |
92 | #endif /* HAVE_SCHED_SETAFFINITY */ | |
2a7ac59d MD |
93 | |
94 | if (!use_affinity) | |
95 | return; | |
96 | ||
d8540fc5 | 97 | #if HAVE_SCHED_SETAFFINITY |
6af882ba MD |
98 | ret = pthread_mutex_lock(&affinity_mutex); |
99 | if (ret) { | |
100 | perror("Error in pthread mutex lock"); | |
101 | exit(-1); | |
102 | } | |
2a7ac59d | 103 | cpu = cpu_affinities[next_aff++]; |
6af882ba MD |
104 | ret = pthread_mutex_unlock(&affinity_mutex); |
105 | if (ret) { | |
106 | perror("Error in pthread mutex unlock"); | |
107 | exit(-1); | |
108 | } | |
2a7ac59d MD |
109 | CPU_ZERO(&mask); |
110 | CPU_SET(cpu, &mask); | |
d8540fc5 PA |
111 | #if SCHED_SETAFFINITY_ARGS == 2 |
112 | sched_setaffinity(0, &mask); | |
113 | #else | |
2a7ac59d | 114 | sched_setaffinity(0, sizeof(mask), &mask); |
d8540fc5 PA |
115 | #endif |
116 | #endif /* HAVE_SCHED_SETAFFINITY */ | |
2a7ac59d MD |
117 | } |
118 | ||
51299083 MD |
119 | /* |
120 | * returns 0 if test should end. | |
121 | */ | |
122 | static int test_duration_write(void) | |
123 | { | |
124 | return !test_stop; | |
125 | } | |
126 | ||
127 | static int test_duration_read(void) | |
128 | { | |
129 | return !test_stop; | |
130 | } | |
131 | ||
bd252a04 MD |
132 | static DEFINE_URCU_TLS(unsigned long long, nr_writes); |
133 | static DEFINE_URCU_TLS(unsigned long long, nr_reads); | |
51299083 | 134 | |
55271c13 | 135 | static |
06f22bdb | 136 | unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_writes; |
55271c13 | 137 | static |
06f22bdb | 138 | unsigned long long __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *tot_nr_reads; |
51299083 MD |
139 | |
140 | static unsigned int nr_readers; | |
141 | static unsigned int nr_writers; | |
142 | ||
143 | pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER; | |
144 | ||
145 | void rcu_copy_mutex_lock(void) | |
146 | { | |
147 | int ret; | |
148 | ret = pthread_mutex_lock(&rcu_copy_mutex); | |
149 | if (ret) { | |
150 | perror("Error in pthread mutex lock"); | |
151 | exit(-1); | |
152 | } | |
153 | } | |
154 | ||
155 | void rcu_copy_mutex_unlock(void) | |
156 | { | |
157 | int ret; | |
158 | ||
159 | ret = pthread_mutex_unlock(&rcu_copy_mutex); | |
160 | if (ret) { | |
161 | perror("Error in pthread mutex unlock"); | |
162 | exit(-1); | |
163 | } | |
164 | } | |
165 | ||
166 | void *thr_reader(void *data) | |
167 | { | |
168 | unsigned long tidx = (unsigned long)data; | |
169 | ||
94df6318 MD |
170 | printf_verbose("thread_begin %s, tid %lu\n", |
171 | "reader", urcu_get_thread_id()); | |
51299083 | 172 | |
2a7ac59d MD |
173 | set_affinity(); |
174 | ||
51299083 MD |
175 | while (!test_go) |
176 | { | |
177 | } | |
178 | ||
179 | for (;;) { | |
19d0e7ef MD |
180 | int v; |
181 | ||
51299083 | 182 | pthread_mutex_lock(&lock); |
19d0e7ef MD |
183 | v = test_array.a; |
184 | assert(v == 8); | |
a0b7f7ea | 185 | if (caa_unlikely(rduration)) |
daddf5b0 | 186 | loop_sleep(rduration); |
51299083 | 187 | pthread_mutex_unlock(&lock); |
bd252a04 | 188 | URCU_TLS(nr_reads)++; |
a0b7f7ea | 189 | if (caa_unlikely(!test_duration_read())) |
51299083 MD |
190 | break; |
191 | } | |
192 | ||
bd252a04 | 193 | tot_nr_reads[tidx] = URCU_TLS(nr_reads); |
94df6318 MD |
194 | printf_verbose("thread_end %s, tid %lu\n", |
195 | "reader", urcu_get_thread_id()); | |
51299083 MD |
196 | return ((void*)1); |
197 | ||
198 | } | |
199 | ||
200 | void *thr_writer(void *data) | |
201 | { | |
202 | unsigned long wtidx = (unsigned long)data; | |
203 | ||
94df6318 MD |
204 | printf_verbose("thread_begin %s, tid %lu\n", |
205 | "writer", urcu_get_thread_id()); | |
51299083 | 206 | |
2a7ac59d MD |
207 | set_affinity(); |
208 | ||
51299083 MD |
209 | while (!test_go) |
210 | { | |
211 | } | |
5481ddb3 | 212 | cmm_smp_mb(); |
51299083 MD |
213 | |
214 | for (;;) { | |
215 | pthread_mutex_lock(&lock); | |
216 | test_array.a = 0; | |
217 | test_array.a = 8; | |
a0b7f7ea | 218 | if (caa_unlikely(wduration)) |
31b598e0 | 219 | loop_sleep(wduration); |
51299083 | 220 | pthread_mutex_unlock(&lock); |
bd252a04 | 221 | URCU_TLS(nr_writes)++; |
a0b7f7ea | 222 | if (caa_unlikely(!test_duration_write())) |
51299083 | 223 | break; |
a0b7f7ea | 224 | if (caa_unlikely(wdelay)) |
9e31d0f0 | 225 | loop_sleep(wdelay); |
51299083 MD |
226 | } |
227 | ||
94df6318 MD |
228 | printf_verbose("thread_end %s, tid %lu\n", |
229 | "writer", urcu_get_thread_id()); | |
bd252a04 | 230 | tot_nr_writes[wtidx] = URCU_TLS(nr_writes); |
51299083 MD |
231 | return ((void*)2); |
232 | } | |
233 | ||
234 | void show_usage(int argc, char **argv) | |
235 | { | |
06637138 MD |
236 | printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n", |
237 | argv[0]); | |
238 | printf("OPTIONS:\n"); | |
06637138 MD |
239 | printf(" [-d delay] (writer period (us))\n"); |
240 | printf(" [-c duration] (reader C.S. duration (in loops))\n"); | |
241 | printf(" [-e duration] (writer C.S. duration (in loops))\n"); | |
242 | printf(" [-v] (verbose output)\n"); | |
243 | printf(" [-a cpu#] [-a cpu#]... (affinity)\n"); | |
51299083 MD |
244 | printf("\n"); |
245 | } | |
246 | ||
51299083 MD |
247 | int main(int argc, char **argv) |
248 | { | |
249 | int err; | |
250 | pthread_t *tid_reader, *tid_writer; | |
251 | void *tret; | |
252 | unsigned long long *count_reader, *count_writer; | |
253 | unsigned long long tot_reads = 0, tot_writes = 0; | |
254 | int i, a; | |
51299083 MD |
255 | |
256 | if (argc < 4) { | |
257 | show_usage(argc, argv); | |
258 | return -1; | |
259 | } | |
5481ddb3 | 260 | cmm_smp_mb(); |
51299083 MD |
261 | |
262 | err = sscanf(argv[1], "%u", &nr_readers); | |
263 | if (err != 1) { | |
264 | show_usage(argc, argv); | |
265 | return -1; | |
266 | } | |
267 | ||
268 | err = sscanf(argv[2], "%u", &nr_writers); | |
269 | if (err != 1) { | |
270 | show_usage(argc, argv); | |
271 | return -1; | |
272 | } | |
273 | ||
274 | err = sscanf(argv[3], "%lu", &duration); | |
275 | if (err != 1) { | |
276 | show_usage(argc, argv); | |
277 | return -1; | |
278 | } | |
279 | ||
51299083 MD |
280 | for (i = 4; i < argc; i++) { |
281 | if (argv[i][0] != '-') | |
282 | continue; | |
283 | switch (argv[i][1]) { | |
51299083 MD |
284 | case 'a': |
285 | if (argc < i + 2) { | |
286 | show_usage(argc, argv); | |
287 | return -1; | |
288 | } | |
289 | a = atoi(argv[++i]); | |
2a7ac59d | 290 | cpu_affinities[next_aff++] = a; |
51299083 | 291 | use_affinity = 1; |
4bad7d45 | 292 | printf_verbose("Adding CPU %d affinity\n", a); |
51299083 | 293 | break; |
8b632bab MD |
294 | case 'c': |
295 | if (argc < i + 2) { | |
296 | show_usage(argc, argv); | |
297 | return -1; | |
298 | } | |
9e31d0f0 | 299 | rduration = atol(argv[++i]); |
8b632bab | 300 | break; |
51299083 MD |
301 | case 'd': |
302 | if (argc < i + 2) { | |
303 | show_usage(argc, argv); | |
304 | return -1; | |
305 | } | |
9e31d0f0 | 306 | wdelay = atol(argv[++i]); |
51299083 | 307 | break; |
31b598e0 MD |
308 | case 'e': |
309 | if (argc < i + 2) { | |
310 | show_usage(argc, argv); | |
311 | return -1; | |
312 | } | |
313 | wduration = atol(argv[++i]); | |
314 | break; | |
4bad7d45 MD |
315 | case 'v': |
316 | verbose_mode = 1; | |
317 | break; | |
51299083 MD |
318 | } |
319 | } | |
320 | ||
4bad7d45 | 321 | printf_verbose("running test for %lu seconds, %u readers, %u writers.\n", |
51299083 | 322 | duration, nr_readers, nr_writers); |
9e31d0f0 | 323 | printf_verbose("Writer delay : %lu loops.\n", wdelay); |
4bad7d45 | 324 | printf_verbose("Reader duration : %lu loops.\n", rduration); |
94df6318 MD |
325 | printf_verbose("thread %-6s, tid %lu\n", |
326 | "main", urcu_get_thread_id()); | |
51299083 | 327 | |
9aa14175 MD |
328 | tid_reader = calloc(nr_readers, sizeof(*tid_reader)); |
329 | tid_writer = calloc(nr_writers, sizeof(*tid_writer)); | |
330 | count_reader = calloc(nr_readers, sizeof(*count_reader)); | |
331 | count_writer = calloc(nr_writers, sizeof(*count_writer)); | |
332 | tot_nr_reads = calloc(nr_readers, sizeof(*tot_nr_reads)); | |
333 | tot_nr_writes = calloc(nr_writers, sizeof(*tot_nr_writes)); | |
51299083 | 334 | |
2a7ac59d MD |
335 | next_aff = 0; |
336 | ||
51299083 MD |
337 | for (i = 0; i < nr_readers; i++) { |
338 | err = pthread_create(&tid_reader[i], NULL, thr_reader, | |
339 | (void *)(long)i); | |
340 | if (err != 0) | |
341 | exit(1); | |
342 | } | |
343 | for (i = 0; i < nr_writers; i++) { | |
344 | err = pthread_create(&tid_writer[i], NULL, thr_writer, | |
345 | (void *)(long)i); | |
346 | if (err != 0) | |
347 | exit(1); | |
348 | } | |
349 | ||
5481ddb3 | 350 | cmm_smp_mb(); |
51299083 MD |
351 | |
352 | test_go = 1; | |
353 | ||
354 | sleep(duration); | |
355 | ||
356 | test_stop = 1; | |
357 | ||
358 | for (i = 0; i < nr_readers; i++) { | |
359 | err = pthread_join(tid_reader[i], &tret); | |
360 | if (err != 0) | |
361 | exit(1); | |
362 | tot_reads += tot_nr_reads[i]; | |
363 | } | |
364 | for (i = 0; i < nr_writers; i++) { | |
365 | err = pthread_join(tid_writer[i], &tret); | |
366 | if (err != 0) | |
367 | exit(1); | |
368 | tot_writes += tot_nr_writes[i]; | |
369 | } | |
4bad7d45 MD |
370 | |
371 | printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads, | |
51299083 | 372 | tot_writes); |
a50a7b43 | 373 | printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu " |
cda3c71d | 374 | "nr_writers %3u " |
9e31d0f0 | 375 | "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n", |
a50a7b43 | 376 | argv[0], duration, nr_readers, rduration, wduration, |
4bad7d45 MD |
377 | nr_writers, wdelay, tot_reads, tot_writes, |
378 | tot_reads + tot_writes); | |
379 | ||
51299083 MD |
380 | free(tid_reader); |
381 | free(tid_writer); | |
382 | free(count_reader); | |
383 | free(count_writer); | |
384 | free(tot_nr_reads); | |
385 | free(tot_nr_writes); | |
386 | return 0; | |
387 | } |