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