Move mb() outside of the synchronize C.S.
[urcu.git] / urcu-qsbr.c
1 /*
2 * urcu-qsbr.c
3 *
4 * Userspace RCU QSBR library
5 *
6 * Copyright (c) 2009 Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
7 * Copyright (c) 2009 Paul E. McKenney, IBM Corporation.
8 *
9 * This library is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public
11 * License as published by the Free Software Foundation; either
12 * version 2.1 of the License, or (at your option) any later version.
13 *
14 * This library is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
18 *
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with this library; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
22 *
23 * IBM's contributions to this file may be relicensed under LGPLv2 or later.
24 */
25
26 #include <stdio.h>
27 #include <pthread.h>
28 #include <signal.h>
29 #include <assert.h>
30 #include <stdlib.h>
31 #include <string.h>
32 #include <errno.h>
33 #include <poll.h>
34
35 #define BUILD_QSBR_LIB
36 #include "urcu-qsbr-static.h"
37 /* Do not #define _LGPL_SOURCE to ensure we can emit the wrapper symbols */
38 #include "urcu-qsbr.h"
39
40 pthread_mutex_t urcu_mutex = PTHREAD_MUTEX_INITIALIZER;
41
42 /*
43 * Global grace period counter.
44 */
45 long urcu_gp_ctr = 0;
46
47 /*
48 * Written to only by each individual reader. Read by both the reader and the
49 * writers.
50 */
51 long __thread rcu_reader_qs_gp;
52
53 /* Thread IDs of registered readers */
54 #define INIT_NUM_THREADS 4
55
56 struct reader_registry {
57 pthread_t tid;
58 long *rcu_reader_qs_gp;
59 };
60
61 #ifdef DEBUG_YIELD
62 unsigned int yield_active;
63 unsigned int __thread rand_yield;
64 #endif
65
66 static struct reader_registry *registry;
67 static int num_readers, alloc_readers;
68
69 static void internal_urcu_lock(void)
70 {
71 int ret;
72
73 #ifndef DISTRUST_SIGNALS_EXTREME
74 ret = pthread_mutex_lock(&urcu_mutex);
75 if (ret) {
76 perror("Error in pthread mutex lock");
77 exit(-1);
78 }
79 #else /* #ifndef DISTRUST_SIGNALS_EXTREME */
80 while ((ret = pthread_mutex_trylock(&urcu_mutex)) != 0) {
81 if (ret != EBUSY && ret != EINTR) {
82 printf("ret = %d, errno = %d\n", ret, errno);
83 perror("Error in pthread mutex lock");
84 exit(-1);
85 }
86 poll(NULL,0,10);
87 }
88 #endif /* #else #ifndef DISTRUST_SIGNALS_EXTREME */
89 }
90
91 static void internal_urcu_unlock(void)
92 {
93 int ret;
94
95 ret = pthread_mutex_unlock(&urcu_mutex);
96 if (ret) {
97 perror("Error in pthread mutex unlock");
98 exit(-1);
99 }
100 }
101
102 #ifdef HAS_INCOHERENT_CACHES
103 static void force_mb_single_thread(struct reader_registry *index)
104 {
105 smp_mb();
106 }
107 #endif /* #ifdef HAS_INCOHERENT_CACHES */
108
109 static void force_mb_all_threads(void)
110 {
111 smp_mb();
112 }
113
114 static void wait_for_quiescent_state(void)
115 {
116 struct reader_registry *index;
117
118 if (!registry)
119 return;
120 /*
121 * Wait for each thread rcu_reader_qs_gp count to become 0.
122 */
123 for (index = registry; index < registry + num_readers; index++) {
124 #ifndef HAS_INCOHERENT_CACHES
125 while (rcu_gp_ongoing(index->rcu_reader_qs_gp))
126 cpu_relax();
127 #else /* #ifndef HAS_INCOHERENT_CACHES */
128 int wait_loops = 0;
129 /*
130 * BUSY-LOOP. Force the reader thread to commit its
131 * rcu_reader_qs_gp update to memory if we wait for too long.
132 */
133 while (rcu_gp_ongoing(index->rcu_reader_qs_gp)) {
134 if (wait_loops++ == KICK_READER_LOOPS) {
135 force_mb_single_thread(index);
136 wait_loops = 0;
137 } else {
138 cpu_relax();
139 }
140 }
141 #endif /* #else #ifndef HAS_INCOHERENT_CACHES */
142 }
143 }
144
145 void synchronize_rcu(void)
146 {
147 int was_online;
148
149 was_online = rcu_reader_qs_gp & 1;
150
151 /*
152 * Mark the writer thread offline to make sure we don't wait for
153 * our own quiescent state. This allows using synchronize_rcu() in
154 * threads registered as readers.
155 */
156 if (was_online)
157 _rcu_thread_offline();
158
159 force_mb_all_threads();
160 internal_urcu_lock();
161 STORE_SHARED(urcu_gp_ctr, urcu_gp_ctr + 2);
162 wait_for_quiescent_state();
163 internal_urcu_unlock();
164 force_mb_all_threads();
165
166 if (was_online)
167 _rcu_thread_online();
168 }
169
170 /*
171 * library wrappers to be used by non-LGPL compatible source code.
172 */
173
174 void rcu_read_lock(void)
175 {
176 _rcu_read_lock();
177 }
178
179 void rcu_read_unlock(void)
180 {
181 _rcu_read_unlock();
182 }
183
184 void *rcu_dereference(void *p)
185 {
186 return _rcu_dereference(p);
187 }
188
189 void *rcu_assign_pointer_sym(void **p, void *v)
190 {
191 wmb();
192 return STORE_SHARED(p, v);
193 }
194
195 void *rcu_xchg_pointer_sym(void **p, void *v)
196 {
197 wmb();
198 return xchg(p, v);
199 }
200
201 void *rcu_publish_content_sym(void **p, void *v)
202 {
203 void *oldptr;
204
205 oldptr = _rcu_xchg_pointer(p, v);
206 synchronize_rcu();
207 return oldptr;
208 }
209
210 void rcu_quiescent_state(void)
211 {
212 _rcu_quiescent_state();
213 }
214
215 void rcu_thread_offline(void)
216 {
217 _rcu_thread_offline();
218 }
219
220 void rcu_thread_online(void)
221 {
222 _rcu_thread_online();
223 }
224
225 static void rcu_add_reader(pthread_t id)
226 {
227 struct reader_registry *oldarray;
228
229 if (!registry) {
230 alloc_readers = INIT_NUM_THREADS;
231 num_readers = 0;
232 registry =
233 malloc(sizeof(struct reader_registry) * alloc_readers);
234 }
235 if (alloc_readers < num_readers + 1) {
236 oldarray = registry;
237 registry = malloc(sizeof(struct reader_registry)
238 * (alloc_readers << 1));
239 memcpy(registry, oldarray,
240 sizeof(struct reader_registry) * alloc_readers);
241 alloc_readers <<= 1;
242 free(oldarray);
243 }
244 registry[num_readers].tid = id;
245 /* reference to the TLS of _this_ reader thread. */
246 registry[num_readers].rcu_reader_qs_gp = &rcu_reader_qs_gp;
247 num_readers++;
248 }
249
250 /*
251 * Never shrink (implementation limitation).
252 * This is O(nb threads). Eventually use a hash table.
253 */
254 static void rcu_remove_reader(pthread_t id)
255 {
256 struct reader_registry *index;
257
258 assert(registry != NULL);
259 for (index = registry; index < registry + num_readers; index++) {
260 if (pthread_equal(index->tid, id)) {
261 memcpy(index, &registry[num_readers - 1],
262 sizeof(struct reader_registry));
263 registry[num_readers - 1].tid = 0;
264 registry[num_readers - 1].rcu_reader_qs_gp = NULL;
265 num_readers--;
266 return;
267 }
268 }
269 /* Hrm not found, forgot to register ? */
270 assert(0);
271 }
272
273 void rcu_register_thread(void)
274 {
275 internal_urcu_lock();
276 rcu_add_reader(pthread_self());
277 internal_urcu_unlock();
278 _rcu_thread_online();
279 }
280
281 void rcu_unregister_thread(void)
282 {
283 /*
284 * We have to make the thread offline otherwise we end up dealocking
285 * with a waiting writer.
286 */
287 _rcu_thread_offline();
288 internal_urcu_lock();
289 rcu_remove_reader(pthread_self());
290 internal_urcu_unlock();
291 }
This page took 0.034818 seconds and 5 git commands to generate.