Commit | Line | Data |
---|---|---|
b257a10b MD |
1 | /* |
2 | * urcu.c | |
3 | * | |
4 | * Userspace RCU library | |
5 | * | |
6982d6d7 | 6 | * Copyright (c) 2009 Mathieu Desnoyers <mathieu.desnoyers@efficios.com> |
af02d47e | 7 | * Copyright (c) 2009 Paul E. McKenney, IBM Corporation. |
b257a10b | 8 | * |
af02d47e MD |
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 | |
54843abc PM |
22 | * |
23 | * IBM's contributions to this file may be relicensed under LGPLv2 or later. | |
b257a10b MD |
24 | */ |
25 | ||
fdf01eed | 26 | #define _BSD_SOURCE |
c1d2c60b | 27 | #define _GNU_SOURCE |
71c811bf | 28 | #define _LGPL_SOURCE |
82d50e1a | 29 | #define _DEFAULT_SOURCE |
27b012e2 MD |
30 | #include <stdio.h> |
31 | #include <pthread.h> | |
32 | #include <signal.h> | |
33 | #include <assert.h> | |
f69f195a | 34 | #include <stdlib.h> |
6d841bc2 | 35 | #include <stdint.h> |
f69f195a | 36 | #include <string.h> |
09a9f986 | 37 | #include <errno.h> |
e8043c1b | 38 | #include <poll.h> |
27b012e2 | 39 | |
d73fb81f | 40 | #include "urcu/wfcqueue.h" |
57760d44 | 41 | #include "urcu/map/urcu.h" |
af7c2dbe | 42 | #include "urcu/static/urcu.h" |
618b2595 | 43 | #include "urcu-pointer.h" |
bd252a04 | 44 | #include "urcu/tls-compat.h" |
71c811bf | 45 | |
4a6d7378 | 46 | #include "urcu-die.h" |
5bffdd5d | 47 | #include "urcu-wait.h" |
4a6d7378 | 48 | |
121a5d44 | 49 | /* Do not #define _LGPL_SOURCE to ensure we can emit the wrapper symbols */ |
71c811bf | 50 | #undef _LGPL_SOURCE |
27b012e2 | 51 | #include "urcu.h" |
71c811bf | 52 | #define _LGPL_SOURCE |
27b012e2 | 53 | |
3a71751e PB |
54 | /* |
55 | * If a reader is really non-cooperative and refuses to commit its | |
56 | * rcu_active_readers count to memory (there is no barrier in the reader | |
9340c38d | 57 | * per-se), kick it after 10 loops waiting for it. |
3a71751e | 58 | */ |
9340c38d | 59 | #define KICK_READER_LOOPS 10 |
3a71751e PB |
60 | |
61 | /* | |
62 | * Active attempts to check for reader Q.S. before calling futex(). | |
63 | */ | |
64 | #define RCU_QS_ACTIVE_ATTEMPTS 100 | |
65 | ||
553b7eb9 MD |
66 | /* |
67 | * RCU_MEMBARRIER is only possibly available on Linux. | |
68 | */ | |
69 | #if defined(RCU_MEMBARRIER) && defined(__linux__) | |
9ba261bd | 70 | #include <urcu/syscall-compat.h> |
553b7eb9 MD |
71 | #endif |
72 | ||
73 | /* If the headers do not support SYS_membarrier, fall back on RCU_MB */ | |
74 | #ifdef SYS_membarrier | |
75 | # define membarrier(...) syscall(SYS_membarrier, __VA_ARGS__) | |
76 | #else | |
77 | # define membarrier(...) -ENOSYS | |
78 | #endif | |
79 | ||
80 | #define MEMBARRIER_EXPEDITED (1 << 0) | |
81 | #define MEMBARRIER_DELAYED (1 << 1) | |
82 | #define MEMBARRIER_QUERY (1 << 16) | |
83 | ||
fdf01eed | 84 | #ifdef RCU_MEMBARRIER |
834a45ba | 85 | static int init_done; |
1de4df4b | 86 | int rcu_has_sys_membarrier; |
834a45ba | 87 | |
02be5561 | 88 | void __attribute__((constructor)) rcu_init(void); |
fdf01eed MD |
89 | #endif |
90 | ||
91 | #ifdef RCU_MB | |
02be5561 | 92 | void rcu_init(void) |
e90a6e9c MD |
93 | { |
94 | } | |
95 | #endif | |
8a5fb4c9 | 96 | |
fdf01eed MD |
97 | #ifdef RCU_SIGNAL |
98 | static int init_done; | |
99 | ||
100 | void __attribute__((constructor)) rcu_init(void); | |
101 | void __attribute__((destructor)) rcu_exit(void); | |
102 | #endif | |
103 | ||
731ccb96 MD |
104 | /* |
105 | * rcu_gp_lock ensures mutual exclusion between threads calling | |
106 | * synchronize_rcu(). | |
107 | */ | |
6abb4bd5 | 108 | static pthread_mutex_t rcu_gp_lock = PTHREAD_MUTEX_INITIALIZER; |
731ccb96 MD |
109 | /* |
110 | * rcu_registry_lock ensures mutual exclusion between threads | |
111 | * registering and unregistering themselves to/from the registry, and | |
112 | * with threads reading that registry from synchronize_rcu(). However, | |
113 | * this lock is not held all the way through the completion of awaiting | |
114 | * for the grace period. It is sporadically released between iterations | |
115 | * on the registry. | |
116 | * rcu_registry_lock may nest inside rcu_gp_lock. | |
117 | */ | |
118 | static pthread_mutex_t rcu_registry_lock = PTHREAD_MUTEX_INITIALIZER; | |
4de0cd31 | 119 | struct rcu_gp rcu_gp = { .ctr = RCU_GP_COUNT }; |
27b012e2 | 120 | |
b0d5e790 MD |
121 | /* |
122 | * Written to only by each individual reader. Read by both the reader and the | |
123 | * writers. | |
124 | */ | |
bd252a04 | 125 | DEFINE_URCU_TLS(struct rcu_reader, rcu_reader); |
27b012e2 | 126 | |
16aa9ee8 | 127 | static CDS_LIST_HEAD(registry); |
27b012e2 | 128 | |
5bffdd5d MD |
129 | /* |
130 | * Queue keeping threads awaiting to wait for a grace period. Contains | |
131 | * struct gp_waiters_thread objects. | |
132 | */ | |
133 | static DEFINE_URCU_WAIT_QUEUE(gp_waiters); | |
134 | ||
6abb4bd5 | 135 | static void mutex_lock(pthread_mutex_t *mutex) |
41718ff9 MD |
136 | { |
137 | int ret; | |
09a9f986 PM |
138 | |
139 | #ifndef DISTRUST_SIGNALS_EXTREME | |
6abb4bd5 | 140 | ret = pthread_mutex_lock(mutex); |
4a6d7378 MD |
141 | if (ret) |
142 | urcu_die(ret); | |
09a9f986 | 143 | #else /* #ifndef DISTRUST_SIGNALS_EXTREME */ |
6abb4bd5 | 144 | while ((ret = pthread_mutex_trylock(mutex)) != 0) { |
4a6d7378 MD |
145 | if (ret != EBUSY && ret != EINTR) |
146 | urcu_die(ret); | |
bd252a04 | 147 | if (CMM_LOAD_SHARED(URCU_TLS(rcu_reader).need_mb)) { |
5481ddb3 | 148 | cmm_smp_mb(); |
bd252a04 | 149 | _CMM_STORE_SHARED(URCU_TLS(rcu_reader).need_mb, 0); |
5481ddb3 | 150 | cmm_smp_mb(); |
09a9f986 PM |
151 | } |
152 | poll(NULL,0,10); | |
153 | } | |
154 | #endif /* #else #ifndef DISTRUST_SIGNALS_EXTREME */ | |
41718ff9 MD |
155 | } |
156 | ||
6abb4bd5 | 157 | static void mutex_unlock(pthread_mutex_t *mutex) |
41718ff9 MD |
158 | { |
159 | int ret; | |
160 | ||
6abb4bd5 | 161 | ret = pthread_mutex_unlock(mutex); |
4a6d7378 MD |
162 | if (ret) |
163 | urcu_die(ret); | |
41718ff9 MD |
164 | } |
165 | ||
fdf01eed | 166 | #ifdef RCU_MEMBARRIER |
25cc6d18 | 167 | static void smp_mb_master(int group) |
fdf01eed | 168 | { |
1de4df4b | 169 | if (caa_likely(rcu_has_sys_membarrier)) |
553b7eb9 | 170 | (void) membarrier(MEMBARRIER_EXPEDITED); |
fdf01eed | 171 | else |
5481ddb3 | 172 | cmm_smp_mb(); |
fdf01eed MD |
173 | } |
174 | #endif | |
175 | ||
02be5561 | 176 | #ifdef RCU_MB |
25cc6d18 | 177 | static void smp_mb_master(int group) |
40e140c9 | 178 | { |
5481ddb3 | 179 | cmm_smp_mb(); |
40e140c9 | 180 | } |
fdf01eed MD |
181 | #endif |
182 | ||
183 | #ifdef RCU_SIGNAL | |
78ff9419 | 184 | static void force_mb_all_readers(void) |
27b012e2 | 185 | { |
02be5561 | 186 | struct rcu_reader *index; |
e3b0cef0 | 187 | |
27b012e2 | 188 | /* |
5481ddb3 | 189 | * Ask for each threads to execute a cmm_smp_mb() so we can consider the |
27b012e2 MD |
190 | * compiler barriers around rcu read lock as real memory barriers. |
191 | */ | |
16aa9ee8 | 192 | if (cds_list_empty(®istry)) |
27b012e2 | 193 | return; |
3a86deba | 194 | /* |
5481ddb3 | 195 | * pthread_kill has a cmm_smp_mb(). But beware, we assume it performs |
157dca95 | 196 | * a cache flush on architectures with non-coherent cache. Let's play |
5481ddb3 | 197 | * safe and don't assume anything : we use cmm_smp_mc() to make sure the |
157dca95 | 198 | * cache flush is enforced. |
3a86deba | 199 | */ |
16aa9ee8 | 200 | cds_list_for_each_entry(index, ®istry, node) { |
6cf3827c | 201 | CMM_STORE_SHARED(index->need_mb, 1); |
02be5561 | 202 | pthread_kill(index->tid, SIGRCU); |
09a9f986 | 203 | } |
27b012e2 MD |
204 | /* |
205 | * Wait for sighandler (and thus mb()) to execute on every thread. | |
09a9f986 PM |
206 | * |
207 | * Note that the pthread_kill() will never be executed on systems | |
208 | * that correctly deliver signals in a timely manner. However, it | |
209 | * is not uncommon for kernels to have bugs that can result in | |
210 | * lost or unduly delayed signals. | |
211 | * | |
212 | * If you are seeing the below pthread_kill() executing much at | |
213 | * all, we suggest testing the underlying kernel and filing the | |
214 | * relevant bug report. For Linux kernels, we recommend getting | |
215 | * the Linux Test Project (LTP). | |
27b012e2 | 216 | */ |
16aa9ee8 | 217 | cds_list_for_each_entry(index, ®istry, node) { |
6cf3827c | 218 | while (CMM_LOAD_SHARED(index->need_mb)) { |
02be5561 | 219 | pthread_kill(index->tid, SIGRCU); |
09a9f986 PM |
220 | poll(NULL, 0, 1); |
221 | } | |
222 | } | |
5481ddb3 | 223 | cmm_smp_mb(); /* read ->need_mb before ending the barrier */ |
27b012e2 | 224 | } |
9d7e3f89 | 225 | |
25cc6d18 | 226 | static void smp_mb_master(int group) |
9d7e3f89 MD |
227 | { |
228 | force_mb_all_readers(); | |
229 | } | |
fdf01eed | 230 | #endif /* #ifdef RCU_SIGNAL */ |
27b012e2 | 231 | |
bc6c15bb MD |
232 | /* |
233 | * synchronize_rcu() waiting. Single thread. | |
234 | */ | |
cfe78e25 | 235 | static void wait_gp(void) |
bc6c15bb | 236 | { |
cfe78e25 | 237 | /* Read reader_gp before read futex */ |
25cc6d18 | 238 | smp_mb_master(RCU_MB_GROUP); |
ed1b099e LJ |
239 | if (uatomic_read(&rcu_gp.futex) == -1) |
240 | futex_async(&rcu_gp.futex, FUTEX_WAIT, -1, | |
cfe78e25 | 241 | NULL, NULL, 0); |
bc6c15bb MD |
242 | } |
243 | ||
731ccb96 MD |
244 | /* |
245 | * Always called with rcu_registry lock held. Releases this lock between | |
246 | * iterations and grabs it again. Holds the lock when it returns. | |
247 | */ | |
fd189fa5 MD |
248 | static void wait_for_readers(struct cds_list_head *input_readers, |
249 | struct cds_list_head *cur_snap_readers, | |
250 | struct cds_list_head *qsreaders) | |
27b012e2 | 251 | { |
9340c38d | 252 | unsigned int wait_loops = 0; |
02be5561 | 253 | struct rcu_reader *index, *tmp; |
9340c38d MD |
254 | #ifdef HAS_INCOHERENT_CACHES |
255 | unsigned int wait_gp_loops = 0; | |
256 | #endif /* HAS_INCOHERENT_CACHES */ | |
27b012e2 | 257 | |
40e140c9 | 258 | /* |
c9488684 MD |
259 | * Wait for each thread URCU_TLS(rcu_reader).ctr to either |
260 | * indicate quiescence (not nested), or observe the current | |
ed1b099e | 261 | * rcu_gp.ctr value. |
27b012e2 | 262 | */ |
cfe78e25 | 263 | for (;;) { |
5e81fed7 MD |
264 | if (wait_loops < RCU_QS_ACTIVE_ATTEMPTS) |
265 | wait_loops++; | |
9340c38d | 266 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
ed1b099e | 267 | uatomic_dec(&rcu_gp.futex); |
cfe78e25 | 268 | /* Write futex before read reader_gp */ |
25cc6d18 | 269 | smp_mb_master(RCU_MB_GROUP); |
cfe78e25 MD |
270 | } |
271 | ||
fd189fa5 MD |
272 | cds_list_for_each_entry_safe(index, tmp, input_readers, node) { |
273 | switch (rcu_reader_state(&index->ctr)) { | |
274 | case RCU_READER_ACTIVE_CURRENT: | |
275 | if (cur_snap_readers) { | |
276 | cds_list_move(&index->node, | |
277 | cur_snap_readers); | |
278 | break; | |
279 | } | |
280 | /* Fall-through */ | |
281 | case RCU_READER_INACTIVE: | |
282 | cds_list_move(&index->node, qsreaders); | |
283 | break; | |
284 | case RCU_READER_ACTIVE_OLD: | |
285 | /* | |
286 | * Old snapshot. Leaving node in | |
287 | * input_readers will make us busy-loop | |
288 | * until the snapshot becomes current or | |
289 | * the reader becomes inactive. | |
290 | */ | |
291 | break; | |
292 | } | |
cfe78e25 MD |
293 | } |
294 | ||
e8043c1b | 295 | #ifndef HAS_INCOHERENT_CACHES |
fd189fa5 | 296 | if (cds_list_empty(input_readers)) { |
9340c38d | 297 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
cfe78e25 | 298 | /* Read reader_gp before write futex */ |
25cc6d18 | 299 | smp_mb_master(RCU_MB_GROUP); |
ed1b099e | 300 | uatomic_set(&rcu_gp.futex, 0); |
bc6c15bb | 301 | } |
cfe78e25 MD |
302 | break; |
303 | } else { | |
731ccb96 MD |
304 | /* Temporarily unlock the registry lock. */ |
305 | mutex_unlock(&rcu_registry_lock); | |
9340c38d | 306 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) |
cfe78e25 MD |
307 | wait_gp(); |
308 | else | |
06f22bdb | 309 | caa_cpu_relax(); |
731ccb96 MD |
310 | /* Re-lock the registry lock before the next loop. */ |
311 | mutex_lock(&rcu_registry_lock); | |
bc6c15bb | 312 | } |
e8043c1b | 313 | #else /* #ifndef HAS_INCOHERENT_CACHES */ |
27b012e2 | 314 | /* |
40e140c9 | 315 | * BUSY-LOOP. Force the reader thread to commit its |
bd252a04 MD |
316 | * URCU_TLS(rcu_reader).ctr update to memory if we wait |
317 | * for too long. | |
27b012e2 | 318 | */ |
fd189fa5 | 319 | if (cds_list_empty(input_readers)) { |
9340c38d | 320 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
cfe78e25 | 321 | /* Read reader_gp before write futex */ |
25cc6d18 | 322 | smp_mb_master(RCU_MB_GROUP); |
ed1b099e | 323 | uatomic_set(&rcu_gp.futex, 0); |
cfe78e25 MD |
324 | } |
325 | break; | |
326 | } else { | |
9340c38d | 327 | if (wait_gp_loops == KICK_READER_LOOPS) { |
25cc6d18 | 328 | smp_mb_master(RCU_MB_GROUP); |
9340c38d MD |
329 | wait_gp_loops = 0; |
330 | } | |
731ccb96 MD |
331 | /* Temporarily unlock the registry lock. */ |
332 | mutex_unlock(&rcu_registry_lock); | |
9340c38d MD |
333 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
334 | wait_gp(); | |
335 | wait_gp_loops++; | |
336 | } else { | |
06f22bdb | 337 | caa_cpu_relax(); |
40e140c9 | 338 | } |
731ccb96 MD |
339 | /* Re-lock the registry lock before the next loop. */ |
340 | mutex_lock(&rcu_registry_lock); | |
40e140c9 | 341 | } |
e8043c1b | 342 | #endif /* #else #ifndef HAS_INCOHERENT_CACHES */ |
27b012e2 | 343 | } |
27b012e2 MD |
344 | } |
345 | ||
9598a481 | 346 | void synchronize_rcu(void) |
2bc59bd7 | 347 | { |
fd189fa5 MD |
348 | CDS_LIST_HEAD(cur_snap_readers); |
349 | CDS_LIST_HEAD(qsreaders); | |
5bffdd5d MD |
350 | DEFINE_URCU_WAIT_NODE(wait, URCU_WAIT_WAITING); |
351 | struct urcu_waiters waiters; | |
352 | ||
353 | /* | |
354 | * Add ourself to gp_waiters queue of threads awaiting to wait | |
355 | * for a grace period. Proceed to perform the grace period only | |
356 | * if we are the first thread added into the queue. | |
357 | * The implicit memory barrier before urcu_wait_add() | |
358 | * orders prior memory accesses of threads put into the wait | |
359 | * queue before their insertion into the wait queue. | |
360 | */ | |
361 | if (urcu_wait_add(&gp_waiters, &wait) != 0) { | |
362 | /* Not first in queue: will be awakened by another thread. */ | |
363 | urcu_adaptative_busy_wait(&wait); | |
364 | /* Order following memory accesses after grace period. */ | |
365 | cmm_smp_mb(); | |
366 | return; | |
367 | } | |
368 | /* We won't need to wake ourself up */ | |
369 | urcu_wait_set_state(&wait, URCU_WAIT_RUNNING); | |
fd189fa5 | 370 | |
6abb4bd5 | 371 | mutex_lock(&rcu_gp_lock); |
135530fd | 372 | |
5bffdd5d MD |
373 | /* |
374 | * Move all waiters into our local queue. | |
375 | */ | |
376 | urcu_move_waiters(&waiters, &gp_waiters); | |
377 | ||
731ccb96 MD |
378 | mutex_lock(&rcu_registry_lock); |
379 | ||
16aa9ee8 | 380 | if (cds_list_empty(®istry)) |
2dfb8b5e MD |
381 | goto out; |
382 | ||
731ccb96 MD |
383 | /* |
384 | * All threads should read qparity before accessing data structure | |
385 | * where new ptr points to. Must be done within rcu_registry_lock | |
386 | * because it iterates on reader threads. | |
387 | */ | |
9598a481 | 388 | /* Write new ptr before changing the qparity */ |
25cc6d18 | 389 | smp_mb_master(RCU_MB_GROUP); |
9598a481 | 390 | |
9598a481 | 391 | /* |
c9488684 | 392 | * Wait for readers to observe original parity or be quiescent. |
731ccb96 MD |
393 | * wait_for_readers() can release and grab again rcu_registry_lock |
394 | * interally. | |
9598a481 | 395 | */ |
fd189fa5 | 396 | wait_for_readers(®istry, &cur_snap_readers, &qsreaders); |
9598a481 MD |
397 | |
398 | /* | |
c9488684 | 399 | * Must finish waiting for quiescent state for original parity before |
ed1b099e | 400 | * committing next rcu_gp.ctr update to memory. Failure to do so could |
d40fde2c MD |
401 | * result in the writer waiting forever while new readers are always |
402 | * accessing data (no progress). Enforce compiler-order of load | |
ed1b099e | 403 | * URCU_TLS(rcu_reader).ctr before store to rcu_gp.ctr. |
9598a481 | 404 | */ |
5481ddb3 | 405 | cmm_barrier(); |
9598a481 | 406 | |
5dba80f9 | 407 | /* |
5481ddb3 | 408 | * Adding a cmm_smp_mb() which is _not_ formally required, but makes the |
5dba80f9 MD |
409 | * model easier to understand. It does not have a big performance impact |
410 | * anyway, given this is the write-side. | |
411 | */ | |
5481ddb3 | 412 | cmm_smp_mb(); |
67c2d80b | 413 | |
c9488684 | 414 | /* Switch parity: 0 -> 1, 1 -> 0 */ |
ed1b099e | 415 | CMM_STORE_SHARED(rcu_gp.ctr, rcu_gp.ctr ^ RCU_GP_CTR_PHASE); |
c9488684 MD |
416 | |
417 | /* | |
ed1b099e | 418 | * Must commit rcu_gp.ctr update to memory before waiting for quiescent |
c9488684 MD |
419 | * state. Failure to do so could result in the writer waiting forever |
420 | * while new readers are always accessing data (no progress). Enforce | |
ed1b099e | 421 | * compiler-order of store to rcu_gp.ctr before load rcu_reader ctr. |
c9488684 MD |
422 | */ |
423 | cmm_barrier(); | |
424 | ||
425 | /* | |
426 | * | |
427 | * Adding a cmm_smp_mb() which is _not_ formally required, but makes the | |
428 | * model easier to understand. It does not have a big performance impact | |
429 | * anyway, given this is the write-side. | |
430 | */ | |
431 | cmm_smp_mb(); | |
432 | ||
9598a481 | 433 | /* |
c9488684 | 434 | * Wait for readers to observe new parity or be quiescent. |
731ccb96 MD |
435 | * wait_for_readers() can release and grab again rcu_registry_lock |
436 | * interally. | |
9598a481 | 437 | */ |
fd189fa5 MD |
438 | wait_for_readers(&cur_snap_readers, NULL, &qsreaders); |
439 | ||
440 | /* | |
441 | * Put quiescent reader list back into registry. | |
442 | */ | |
443 | cds_list_splice(&qsreaders, ®istry); | |
9598a481 | 444 | |
731ccb96 MD |
445 | /* |
446 | * Finish waiting for reader threads before letting the old ptr | |
447 | * being freed. Must be done within rcu_registry_lock because it | |
448 | * iterates on reader threads. | |
449 | */ | |
25cc6d18 | 450 | smp_mb_master(RCU_MB_GROUP); |
2dfb8b5e | 451 | out: |
731ccb96 | 452 | mutex_unlock(&rcu_registry_lock); |
6abb4bd5 | 453 | mutex_unlock(&rcu_gp_lock); |
5bffdd5d MD |
454 | |
455 | /* | |
456 | * Wakeup waiters only after we have completed the grace period | |
457 | * and have ensured the memory barriers at the end of the grace | |
458 | * period have been issued. | |
459 | */ | |
460 | urcu_wake_all_waiters(&waiters); | |
2bc59bd7 PM |
461 | } |
462 | ||
121a5d44 MD |
463 | /* |
464 | * library wrappers to be used by non-LGPL compatible source code. | |
465 | */ | |
466 | ||
467 | void rcu_read_lock(void) | |
468 | { | |
469 | _rcu_read_lock(); | |
470 | } | |
471 | ||
472 | void rcu_read_unlock(void) | |
473 | { | |
474 | _rcu_read_unlock(); | |
475 | } | |
476 | ||
882f3357 MD |
477 | int rcu_read_ongoing(void) |
478 | { | |
479 | return _rcu_read_ongoing(); | |
480 | } | |
481 | ||
121a5d44 | 482 | void rcu_register_thread(void) |
27b012e2 | 483 | { |
bd252a04 MD |
484 | URCU_TLS(rcu_reader).tid = pthread_self(); |
485 | assert(URCU_TLS(rcu_reader).need_mb == 0); | |
486 | assert(!(URCU_TLS(rcu_reader).ctr & RCU_GP_CTR_NEST_MASK)); | |
02be5561 | 487 | |
731ccb96 | 488 | mutex_lock(&rcu_registry_lock); |
02be5561 | 489 | rcu_init(); /* In case gcc does not support constructor attribute */ |
bd252a04 | 490 | cds_list_add(&URCU_TLS(rcu_reader).node, ®istry); |
731ccb96 | 491 | mutex_unlock(&rcu_registry_lock); |
27b012e2 MD |
492 | } |
493 | ||
121a5d44 | 494 | void rcu_unregister_thread(void) |
27b012e2 | 495 | { |
731ccb96 | 496 | mutex_lock(&rcu_registry_lock); |
bd252a04 | 497 | cds_list_del(&URCU_TLS(rcu_reader).node); |
731ccb96 | 498 | mutex_unlock(&rcu_registry_lock); |
27b012e2 MD |
499 | } |
500 | ||
fdf01eed MD |
501 | #ifdef RCU_MEMBARRIER |
502 | void rcu_init(void) | |
503 | { | |
504 | if (init_done) | |
505 | return; | |
506 | init_done = 1; | |
cf5271ee | 507 | if (!membarrier(MEMBARRIER_EXPEDITED | MEMBARRIER_QUERY)) |
1de4df4b | 508 | rcu_has_sys_membarrier = 1; |
fdf01eed MD |
509 | } |
510 | #endif | |
511 | ||
512 | #ifdef RCU_SIGNAL | |
02be5561 | 513 | static void sigrcu_handler(int signo, siginfo_t *siginfo, void *context) |
27b012e2 | 514 | { |
40e140c9 | 515 | /* |
5481ddb3 DG |
516 | * Executing this cmm_smp_mb() is the only purpose of this signal handler. |
517 | * It punctually promotes cmm_barrier() into cmm_smp_mb() on every thread it is | |
40e140c9 MD |
518 | * executed on. |
519 | */ | |
5481ddb3 | 520 | cmm_smp_mb(); |
bd252a04 | 521 | _CMM_STORE_SHARED(URCU_TLS(rcu_reader).need_mb, 0); |
5481ddb3 | 522 | cmm_smp_mb(); |
27b012e2 MD |
523 | } |
524 | ||
8a5fb4c9 | 525 | /* |
02be5561 | 526 | * rcu_init constructor. Called when the library is linked, but also when |
8a5fb4c9 MD |
527 | * reader threads are calling rcu_register_thread(). |
528 | * Should only be called by a single thread at a given time. This is ensured by | |
731ccb96 MD |
529 | * holing the rcu_registry_lock from rcu_register_thread() or by running |
530 | * at library load time, which should not be executed by multiple | |
531 | * threads nor concurrently with rcu_register_thread() anyway. | |
8a5fb4c9 | 532 | */ |
02be5561 | 533 | void rcu_init(void) |
27b012e2 MD |
534 | { |
535 | struct sigaction act; | |
536 | int ret; | |
537 | ||
8a5fb4c9 MD |
538 | if (init_done) |
539 | return; | |
540 | init_done = 1; | |
541 | ||
02be5561 | 542 | act.sa_sigaction = sigrcu_handler; |
dd052bd3 | 543 | act.sa_flags = SA_SIGINFO | SA_RESTART; |
c297c21c | 544 | sigemptyset(&act.sa_mask); |
02be5561 | 545 | ret = sigaction(SIGRCU, &act, NULL); |
4a6d7378 MD |
546 | if (ret) |
547 | urcu_die(errno); | |
27b012e2 MD |
548 | } |
549 | ||
02be5561 | 550 | void rcu_exit(void) |
27b012e2 | 551 | { |
71210954 MD |
552 | /* |
553 | * Don't unregister the SIGRCU signal handler anymore, because | |
554 | * call_rcu threads could still be using it shortly before the | |
555 | * application exits. | |
556 | * Assertion disabled because call_rcu threads are now rcu | |
557 | * readers, and left running at exit. | |
558 | * assert(cds_list_empty(®istry)); | |
559 | */ | |
27b012e2 | 560 | } |
5e77fc1f | 561 | |
fdf01eed | 562 | #endif /* #ifdef RCU_SIGNAL */ |
5e77fc1f | 563 | |
5e6b23a6 | 564 | DEFINE_RCU_FLAVOR(rcu_flavor); |
541d828d | 565 | |
5e77fc1f | 566 | #include "urcu-call-rcu-impl.h" |
0376e7b2 | 567 | #include "urcu-defer-impl.h" |