Commit | Line | Data |
---|---|---|
420e5b92 MD |
1 | /* |
2 | * test_qsbr_timing.c | |
3 | * | |
4 | * Userspace QSBR - test program | |
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 | #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> | |
32 | #include <sys/syscall.h> | |
833dbdb6 | 33 | #include "../arch.h" |
420e5b92 | 34 | |
b430c6d4 MD |
35 | /* Make this big enough to include the POWER5+ L3 cacheline size of 256B */ |
36 | #define CACHE_LINE_SIZE 4096 | |
37 | ||
420e5b92 MD |
38 | #if defined(_syscall0) |
39 | _syscall0(pid_t, gettid) | |
40 | #elif defined(__NR_gettid) | |
41 | static inline pid_t gettid(void) | |
42 | { | |
43 | return syscall(__NR_gettid); | |
44 | } | |
45 | #else | |
46 | #warning "use pid as tid" | |
47 | static inline pid_t gettid(void) | |
48 | { | |
49 | return getpid(); | |
50 | } | |
51 | #endif | |
52 | ||
53 | #define _LGPL_SOURCE | |
833dbdb6 | 54 | #include "../urcu-qsbr.h" |
420e5b92 MD |
55 | |
56 | pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER; | |
57 | ||
58 | void rcu_copy_mutex_lock(void) | |
59 | { | |
60 | int ret; | |
61 | ret = pthread_mutex_lock(&rcu_copy_mutex); | |
62 | if (ret) { | |
63 | perror("Error in pthread mutex lock"); | |
64 | exit(-1); | |
65 | } | |
66 | } | |
67 | ||
68 | void rcu_copy_mutex_unlock(void) | |
69 | { | |
70 | int ret; | |
71 | ||
72 | ret = pthread_mutex_unlock(&rcu_copy_mutex); | |
73 | if (ret) { | |
74 | perror("Error in pthread mutex unlock"); | |
75 | exit(-1); | |
76 | } | |
77 | } | |
78 | ||
79 | struct test_array { | |
80 | int a; | |
81 | }; | |
82 | ||
83 | static struct test_array *test_rcu_pointer; | |
84 | ||
85 | #define OUTER_READ_LOOP 2000U | |
86 | #define INNER_READ_LOOP 100000U | |
87 | #define READ_LOOP ((unsigned long long)OUTER_READ_LOOP * INNER_READ_LOOP) | |
88 | ||
89 | #define OUTER_WRITE_LOOP 10U | |
90 | #define INNER_WRITE_LOOP 200U | |
91 | #define WRITE_LOOP ((unsigned long long)OUTER_WRITE_LOOP * INNER_WRITE_LOOP) | |
92 | ||
2c9689fe MD |
93 | static int num_read; |
94 | static int num_write; | |
420e5b92 | 95 | |
2c9689fe MD |
96 | #define NR_READ num_read |
97 | #define NR_WRITE num_write | |
98 | ||
b430c6d4 MD |
99 | static cycles_t __attribute__((aligned(CACHE_LINE_SIZE))) *reader_time; |
100 | static cycles_t __attribute__((aligned(CACHE_LINE_SIZE))) *writer_time; | |
420e5b92 MD |
101 | |
102 | void *thr_reader(void *arg) | |
103 | { | |
104 | int i, j; | |
105 | struct test_array *local_ptr; | |
106 | cycles_t time1, time2; | |
107 | ||
108 | printf("thread_begin %s, thread id : %lx, tid %lu\n", | |
109 | "reader", pthread_self(), (unsigned long)gettid()); | |
110 | sleep(2); | |
111 | ||
112 | rcu_register_thread(); | |
113 | ||
114 | time1 = get_cycles(); | |
115 | for (i = 0; i < OUTER_READ_LOOP; i++) { | |
116 | for (j = 0; j < INNER_READ_LOOP; j++) { | |
117 | _rcu_read_lock(); | |
118 | local_ptr = _rcu_dereference(test_rcu_pointer); | |
119 | if (local_ptr) { | |
120 | assert(local_ptr->a == 8); | |
121 | } | |
122 | _rcu_read_unlock(); | |
123 | } | |
124 | _rcu_quiescent_state(); | |
125 | } | |
126 | time2 = get_cycles(); | |
127 | ||
128 | rcu_unregister_thread(); | |
129 | ||
130 | reader_time[(unsigned long)arg] = time2 - time1; | |
131 | ||
132 | sleep(2); | |
133 | printf("thread_end %s, thread id : %lx, tid %lu\n", | |
134 | "reader", pthread_self(), (unsigned long)gettid()); | |
135 | return ((void*)1); | |
136 | ||
137 | } | |
138 | ||
139 | void *thr_writer(void *arg) | |
140 | { | |
141 | int i, j; | |
142 | struct test_array *new, *old; | |
143 | cycles_t time1, time2; | |
144 | ||
145 | printf("thread_begin %s, thread id : %lx, tid %lu\n", | |
146 | "writer", pthread_self(), (unsigned long)gettid()); | |
147 | sleep(2); | |
148 | ||
149 | for (i = 0; i < OUTER_WRITE_LOOP; i++) { | |
150 | for (j = 0; j < INNER_WRITE_LOOP; j++) { | |
151 | time1 = get_cycles(); | |
152 | new = malloc(sizeof(struct test_array)); | |
153 | rcu_copy_mutex_lock(); | |
154 | old = test_rcu_pointer; | |
155 | if (old) { | |
156 | assert(old->a == 8); | |
157 | } | |
158 | new->a = 8; | |
159 | old = _rcu_publish_content(&test_rcu_pointer, new); | |
160 | rcu_copy_mutex_unlock(); | |
161 | /* can be done after unlock */ | |
162 | if (old) { | |
163 | old->a = 0; | |
164 | } | |
165 | free(old); | |
166 | time2 = get_cycles(); | |
167 | writer_time[(unsigned long)arg] += time2 - time1; | |
168 | usleep(1); | |
169 | } | |
170 | } | |
171 | ||
172 | printf("thread_end %s, thread id : %lx, tid %lu\n", | |
173 | "writer", pthread_self(), (unsigned long)gettid()); | |
174 | return ((void*)2); | |
175 | } | |
176 | ||
2c9689fe | 177 | int main(int argc, char **argv) |
420e5b92 MD |
178 | { |
179 | int err; | |
2c9689fe | 180 | pthread_t *tid_reader, *tid_writer; |
420e5b92 MD |
181 | void *tret; |
182 | int i; | |
183 | cycles_t tot_rtime = 0; | |
184 | cycles_t tot_wtime = 0; | |
185 | ||
2c9689fe MD |
186 | if (argc < 2) { |
187 | printf("Usage : %s nr_readers nr_writers\n", argv[0]); | |
188 | exit(-1); | |
189 | } | |
190 | num_read = atoi(argv[1]); | |
191 | num_write = atoi(argv[2]); | |
192 | ||
193 | reader_time = malloc(sizeof(*reader_time) * num_read); | |
194 | writer_time = malloc(sizeof(*writer_time) * num_write); | |
195 | tid_reader = malloc(sizeof(*tid_reader) * num_read); | |
196 | tid_writer = malloc(sizeof(*tid_writer) * num_write); | |
197 | ||
420e5b92 MD |
198 | printf("thread %-6s, thread id : %lx, tid %lu\n", |
199 | "main", pthread_self(), (unsigned long)gettid()); | |
200 | ||
201 | for (i = 0; i < NR_READ; i++) { | |
202 | err = pthread_create(&tid_reader[i], NULL, thr_reader, | |
203 | (void *)(long)i); | |
204 | if (err != 0) | |
205 | exit(1); | |
206 | } | |
207 | for (i = 0; i < NR_WRITE; i++) { | |
208 | err = pthread_create(&tid_writer[i], NULL, thr_writer, | |
209 | (void *)(long)i); | |
210 | if (err != 0) | |
211 | exit(1); | |
212 | } | |
213 | ||
214 | sleep(10); | |
215 | ||
216 | for (i = 0; i < NR_READ; i++) { | |
217 | err = pthread_join(tid_reader[i], &tret); | |
218 | if (err != 0) | |
219 | exit(1); | |
220 | tot_rtime += reader_time[i]; | |
221 | } | |
222 | for (i = 0; i < NR_WRITE; i++) { | |
223 | err = pthread_join(tid_writer[i], &tret); | |
224 | if (err != 0) | |
225 | exit(1); | |
226 | tot_wtime += writer_time[i]; | |
227 | } | |
228 | free(test_rcu_pointer); | |
229 | printf("Time per read : %g cycles\n", | |
230 | (double)tot_rtime / ((double)NR_READ * (double)READ_LOOP)); | |
231 | printf("Time per write : %g cycles\n", | |
232 | (double)tot_wtime / ((double)NR_WRITE * (double)WRITE_LOOP)); | |
233 | ||
2c9689fe MD |
234 | free(reader_time); |
235 | free(writer_time); | |
236 | free(tid_reader); | |
237 | free(tid_writer); | |
238 | ||
420e5b92 MD |
239 | return 0; |
240 | } |