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 |
ed42f676 | 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 | |
71c811bf | 40 | #include "urcu/wfqueue.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 MD |
46 | #include "urcu-die.h" |
47 | ||
121a5d44 | 48 | /* Do not #define _LGPL_SOURCE to ensure we can emit the wrapper symbols */ |
71c811bf | 49 | #undef _LGPL_SOURCE |
27b012e2 | 50 | #include "urcu.h" |
71c811bf | 51 | #define _LGPL_SOURCE |
27b012e2 | 52 | |
3a71751e PB |
53 | /* |
54 | * If a reader is really non-cooperative and refuses to commit its | |
55 | * rcu_active_readers count to memory (there is no barrier in the reader | |
6b702fa4 | 56 | * per-se), kick it after 10 loops waiting for it. |
3a71751e | 57 | */ |
6b702fa4 | 58 | #define KICK_READER_LOOPS 10 |
3a71751e PB |
59 | |
60 | /* | |
61 | * Active attempts to check for reader Q.S. before calling futex(). | |
62 | */ | |
63 | #define RCU_QS_ACTIVE_ATTEMPTS 100 | |
64 | ||
fdf01eed | 65 | #ifdef RCU_MEMBARRIER |
834a45ba | 66 | static int init_done; |
fdf01eed | 67 | int has_sys_membarrier; |
834a45ba | 68 | |
02be5561 | 69 | void __attribute__((constructor)) rcu_init(void); |
fdf01eed MD |
70 | #endif |
71 | ||
72 | #ifdef RCU_MB | |
02be5561 | 73 | void rcu_init(void) |
e90a6e9c MD |
74 | { |
75 | } | |
76 | #endif | |
8a5fb4c9 | 77 | |
fdf01eed MD |
78 | #ifdef RCU_SIGNAL |
79 | static int init_done; | |
80 | ||
81 | void __attribute__((constructor)) rcu_init(void); | |
82 | void __attribute__((destructor)) rcu_exit(void); | |
83 | #endif | |
84 | ||
66bc4dcd MD |
85 | /* |
86 | * rcu_gp_lock ensures mutual exclusion between threads calling | |
87 | * synchronize_rcu(). | |
88 | */ | |
6abb4bd5 | 89 | static pthread_mutex_t rcu_gp_lock = PTHREAD_MUTEX_INITIALIZER; |
66bc4dcd MD |
90 | /* |
91 | * rcu_registry_lock ensures mutual exclusion between threads | |
92 | * registering and unregistering themselves to/from the registry, and | |
93 | * with threads reading that registry from synchronize_rcu(). However, | |
94 | * this lock is not held all the way through the completion of awaiting | |
95 | * for the grace period. It is sporadically released between iterations | |
96 | * on the registry. | |
97 | * rcu_registry_lock may nest inside rcu_gp_lock. | |
98 | */ | |
99 | static pthread_mutex_t rcu_registry_lock = PTHREAD_MUTEX_INITIALIZER; | |
27b012e2 | 100 | |
6d841bc2 | 101 | int32_t gp_futex; |
bc6c15bb | 102 | |
128166c9 MD |
103 | /* |
104 | * Global grace period counter. | |
02be5561 | 105 | * Contains the current RCU_GP_CTR_PHASE. |
afb8f2c9 | 106 | * Also has a RCU_GP_COUNT of 1, to accelerate the reader fast path. |
b0d5e790 | 107 | * Written to only by writer with mutex taken. Read by both writer and readers. |
128166c9 | 108 | */ |
27d65bc5 | 109 | unsigned long rcu_gp_ctr = RCU_GP_COUNT; |
b0d5e790 MD |
110 | /* |
111 | * Written to only by each individual reader. Read by both the reader and the | |
112 | * writers. | |
113 | */ | |
1745be1a | 114 | __DEFINE_URCU_TLS_GLOBAL(struct rcu_reader, rcu_reader); |
27b012e2 | 115 | |
cf380c2f | 116 | #ifdef DEBUG_YIELD |
9d335088 | 117 | unsigned int yield_active; |
1745be1a | 118 | __DEFINE_URCU_TLS_GLOBAL(unsigned int, rand_yield); |
cf380c2f MD |
119 | #endif |
120 | ||
16aa9ee8 | 121 | static CDS_LIST_HEAD(registry); |
27b012e2 | 122 | |
6abb4bd5 | 123 | static void mutex_lock(pthread_mutex_t *mutex) |
41718ff9 MD |
124 | { |
125 | int ret; | |
09a9f986 PM |
126 | |
127 | #ifndef DISTRUST_SIGNALS_EXTREME | |
6abb4bd5 | 128 | ret = pthread_mutex_lock(mutex); |
4a6d7378 MD |
129 | if (ret) |
130 | urcu_die(ret); | |
09a9f986 | 131 | #else /* #ifndef DISTRUST_SIGNALS_EXTREME */ |
6abb4bd5 | 132 | while ((ret = pthread_mutex_trylock(mutex)) != 0) { |
4a6d7378 MD |
133 | if (ret != EBUSY && ret != EINTR) |
134 | urcu_die(ret); | |
bd252a04 | 135 | if (CMM_LOAD_SHARED(URCU_TLS(rcu_reader).need_mb)) { |
5481ddb3 | 136 | cmm_smp_mb(); |
bd252a04 | 137 | _CMM_STORE_SHARED(URCU_TLS(rcu_reader).need_mb, 0); |
5481ddb3 | 138 | cmm_smp_mb(); |
09a9f986 PM |
139 | } |
140 | poll(NULL,0,10); | |
141 | } | |
142 | #endif /* #else #ifndef DISTRUST_SIGNALS_EXTREME */ | |
41718ff9 MD |
143 | } |
144 | ||
6abb4bd5 | 145 | static void mutex_unlock(pthread_mutex_t *mutex) |
41718ff9 MD |
146 | { |
147 | int ret; | |
148 | ||
6abb4bd5 | 149 | ret = pthread_mutex_unlock(mutex); |
4a6d7378 MD |
150 | if (ret) |
151 | urcu_die(ret); | |
41718ff9 MD |
152 | } |
153 | ||
fdf01eed | 154 | #ifdef RCU_MEMBARRIER |
25cc6d18 | 155 | static void smp_mb_master(int group) |
fdf01eed | 156 | { |
a0b7f7ea | 157 | if (caa_likely(has_sys_membarrier)) |
f0708810 | 158 | membarrier(MEMBARRIER_EXPEDITED); |
fdf01eed | 159 | else |
5481ddb3 | 160 | cmm_smp_mb(); |
fdf01eed MD |
161 | } |
162 | #endif | |
163 | ||
02be5561 | 164 | #ifdef RCU_MB |
25cc6d18 | 165 | static void smp_mb_master(int group) |
40e140c9 | 166 | { |
5481ddb3 | 167 | cmm_smp_mb(); |
40e140c9 | 168 | } |
fdf01eed MD |
169 | #endif |
170 | ||
171 | #ifdef RCU_SIGNAL | |
78ff9419 | 172 | static void force_mb_all_readers(void) |
27b012e2 | 173 | { |
02be5561 | 174 | struct rcu_reader *index; |
e3b0cef0 | 175 | |
27b012e2 | 176 | /* |
5481ddb3 | 177 | * Ask for each threads to execute a cmm_smp_mb() so we can consider the |
27b012e2 MD |
178 | * compiler barriers around rcu read lock as real memory barriers. |
179 | */ | |
16aa9ee8 | 180 | if (cds_list_empty(®istry)) |
27b012e2 | 181 | return; |
3a86deba | 182 | /* |
5481ddb3 | 183 | * pthread_kill has a cmm_smp_mb(). But beware, we assume it performs |
157dca95 | 184 | * a cache flush on architectures with non-coherent cache. Let's play |
5481ddb3 | 185 | * safe and don't assume anything : we use cmm_smp_mc() to make sure the |
157dca95 | 186 | * cache flush is enforced. |
3a86deba | 187 | */ |
16aa9ee8 | 188 | cds_list_for_each_entry(index, ®istry, node) { |
6cf3827c | 189 | CMM_STORE_SHARED(index->need_mb, 1); |
02be5561 | 190 | pthread_kill(index->tid, SIGRCU); |
09a9f986 | 191 | } |
27b012e2 MD |
192 | /* |
193 | * Wait for sighandler (and thus mb()) to execute on every thread. | |
09a9f986 PM |
194 | * |
195 | * Note that the pthread_kill() will never be executed on systems | |
196 | * that correctly deliver signals in a timely manner. However, it | |
197 | * is not uncommon for kernels to have bugs that can result in | |
198 | * lost or unduly delayed signals. | |
199 | * | |
200 | * If you are seeing the below pthread_kill() executing much at | |
201 | * all, we suggest testing the underlying kernel and filing the | |
202 | * relevant bug report. For Linux kernels, we recommend getting | |
203 | * the Linux Test Project (LTP). | |
27b012e2 | 204 | */ |
16aa9ee8 | 205 | cds_list_for_each_entry(index, ®istry, node) { |
6cf3827c | 206 | while (CMM_LOAD_SHARED(index->need_mb)) { |
02be5561 | 207 | pthread_kill(index->tid, SIGRCU); |
09a9f986 PM |
208 | poll(NULL, 0, 1); |
209 | } | |
210 | } | |
5481ddb3 | 211 | cmm_smp_mb(); /* read ->need_mb before ending the barrier */ |
27b012e2 | 212 | } |
9d7e3f89 | 213 | |
25cc6d18 | 214 | static void smp_mb_master(int group) |
9d7e3f89 MD |
215 | { |
216 | force_mb_all_readers(); | |
217 | } | |
fdf01eed | 218 | #endif /* #ifdef RCU_SIGNAL */ |
27b012e2 | 219 | |
bc6c15bb MD |
220 | /* |
221 | * synchronize_rcu() waiting. Single thread. | |
222 | */ | |
cfe78e25 | 223 | static void wait_gp(void) |
bc6c15bb | 224 | { |
cfe78e25 | 225 | /* Read reader_gp before read futex */ |
25cc6d18 | 226 | smp_mb_master(RCU_MB_GROUP); |
cfe78e25 | 227 | if (uatomic_read(&gp_futex) == -1) |
0854ccff | 228 | futex_async(&gp_futex, FUTEX_WAIT, -1, |
cfe78e25 | 229 | NULL, NULL, 0); |
bc6c15bb MD |
230 | } |
231 | ||
66bc4dcd MD |
232 | /* |
233 | * Always called with rcu_registry lock held. Releases this lock between | |
234 | * iterations and grabs it again. Holds the lock when it returns. | |
235 | */ | |
2dfb8b5e | 236 | void update_counter_and_wait(void) |
27b012e2 | 237 | { |
16aa9ee8 | 238 | CDS_LIST_HEAD(qsreaders); |
6b702fa4 | 239 | unsigned int wait_loops = 0; |
02be5561 | 240 | struct rcu_reader *index, *tmp; |
6b702fa4 MD |
241 | #ifdef HAS_INCOHERENT_CACHES |
242 | unsigned int wait_gp_loops = 0; | |
243 | #endif /* HAS_INCOHERENT_CACHES */ | |
27b012e2 | 244 | |
32c15e4e | 245 | /* Switch parity: 0 -> 1, 1 -> 0 */ |
6cf3827c | 246 | CMM_STORE_SHARED(rcu_gp_ctr, rcu_gp_ctr ^ RCU_GP_CTR_PHASE); |
2dfb8b5e MD |
247 | |
248 | /* | |
d40fde2c MD |
249 | * Must commit rcu_gp_ctr update to memory before waiting for quiescent |
250 | * state. Failure to do so could result in the writer waiting forever | |
251 | * while new readers are always accessing data (no progress). Enforce | |
252 | * compiler-order of store to rcu_gp_ctr before load rcu_reader ctr. | |
2dfb8b5e | 253 | */ |
5481ddb3 | 254 | cmm_barrier(); |
2dfb8b5e MD |
255 | |
256 | /* | |
935b11ff | 257 | * |
5481ddb3 | 258 | * Adding a cmm_smp_mb() which is _not_ formally required, but makes the |
2dfb8b5e MD |
259 | * model easier to understand. It does not have a big performance impact |
260 | * anyway, given this is the write-side. | |
261 | */ | |
5481ddb3 | 262 | cmm_smp_mb(); |
2dfb8b5e | 263 | |
40e140c9 | 264 | /* |
bd252a04 | 265 | * Wait for each thread URCU_TLS(rcu_reader).ctr count to become 0. |
27b012e2 | 266 | */ |
cfe78e25 | 267 | for (;;) { |
cca4c8dc MD |
268 | if (wait_loops < RCU_QS_ACTIVE_ATTEMPTS) |
269 | wait_loops++; | |
6b702fa4 | 270 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
cfe78e25 MD |
271 | uatomic_dec(&gp_futex); |
272 | /* Write futex before read reader_gp */ | |
25cc6d18 | 273 | smp_mb_master(RCU_MB_GROUP); |
cfe78e25 MD |
274 | } |
275 | ||
16aa9ee8 | 276 | cds_list_for_each_entry_safe(index, tmp, ®istry, node) { |
b95a001f | 277 | if (!rcu_gp_ongoing(&index->ctr)) |
16aa9ee8 | 278 | cds_list_move(&index->node, &qsreaders); |
cfe78e25 MD |
279 | } |
280 | ||
e8043c1b | 281 | #ifndef HAS_INCOHERENT_CACHES |
16aa9ee8 | 282 | if (cds_list_empty(®istry)) { |
6b702fa4 | 283 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
cfe78e25 | 284 | /* Read reader_gp before write futex */ |
25cc6d18 | 285 | smp_mb_master(RCU_MB_GROUP); |
cfe78e25 | 286 | uatomic_set(&gp_futex, 0); |
bc6c15bb | 287 | } |
cfe78e25 MD |
288 | break; |
289 | } else { | |
66bc4dcd MD |
290 | /* Temporarily unlock the registry lock. */ |
291 | mutex_unlock(&rcu_registry_lock); | |
6b702fa4 | 292 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) |
cfe78e25 MD |
293 | wait_gp(); |
294 | else | |
06f22bdb | 295 | caa_cpu_relax(); |
66bc4dcd MD |
296 | /* Re-lock the registry lock before the next loop. */ |
297 | mutex_lock(&rcu_registry_lock); | |
bc6c15bb | 298 | } |
e8043c1b | 299 | #else /* #ifndef HAS_INCOHERENT_CACHES */ |
27b012e2 | 300 | /* |
40e140c9 | 301 | * BUSY-LOOP. Force the reader thread to commit its |
bd252a04 MD |
302 | * URCU_TLS(rcu_reader).ctr update to memory if we wait |
303 | * for too long. | |
27b012e2 | 304 | */ |
16aa9ee8 | 305 | if (cds_list_empty(®istry)) { |
6b702fa4 | 306 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
cfe78e25 | 307 | /* Read reader_gp before write futex */ |
25cc6d18 | 308 | smp_mb_master(RCU_MB_GROUP); |
cfe78e25 MD |
309 | uatomic_set(&gp_futex, 0); |
310 | } | |
311 | break; | |
312 | } else { | |
6b702fa4 | 313 | if (wait_gp_loops == KICK_READER_LOOPS) { |
25cc6d18 | 314 | smp_mb_master(RCU_MB_GROUP); |
6b702fa4 MD |
315 | wait_gp_loops = 0; |
316 | } | |
66bc4dcd MD |
317 | /* Temporarily unlock the registry lock. */ |
318 | mutex_unlock(&rcu_registry_lock); | |
6b702fa4 MD |
319 | if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) { |
320 | wait_gp(); | |
321 | wait_gp_loops++; | |
322 | } else { | |
06f22bdb | 323 | caa_cpu_relax(); |
40e140c9 | 324 | } |
66bc4dcd MD |
325 | /* Re-lock the registry lock before the next loop. */ |
326 | mutex_lock(&rcu_registry_lock); | |
40e140c9 | 327 | } |
e8043c1b | 328 | #endif /* #else #ifndef HAS_INCOHERENT_CACHES */ |
27b012e2 | 329 | } |
cfe78e25 | 330 | /* put back the reader list in the registry */ |
16aa9ee8 | 331 | cds_list_splice(&qsreaders, ®istry); |
27b012e2 MD |
332 | } |
333 | ||
9598a481 | 334 | void synchronize_rcu(void) |
2bc59bd7 | 335 | { |
6abb4bd5 | 336 | mutex_lock(&rcu_gp_lock); |
66bc4dcd | 337 | mutex_lock(&rcu_registry_lock); |
135530fd | 338 | |
16aa9ee8 | 339 | if (cds_list_empty(®istry)) |
2dfb8b5e MD |
340 | goto out; |
341 | ||
66bc4dcd MD |
342 | /* |
343 | * All threads should read qparity before accessing data structure | |
344 | * where new ptr points to. Must be done within rcu_registry_lock | |
345 | * because it iterates on reader threads. | |
346 | */ | |
9598a481 | 347 | /* Write new ptr before changing the qparity */ |
25cc6d18 | 348 | smp_mb_master(RCU_MB_GROUP); |
9598a481 | 349 | |
9598a481 MD |
350 | /* |
351 | * Wait for previous parity to be empty of readers. | |
66bc4dcd MD |
352 | * update_counter_and_wait() can release and grab again |
353 | * rcu_registry_lock interally. | |
9598a481 | 354 | */ |
2dfb8b5e | 355 | update_counter_and_wait(); /* 0 -> 1, wait readers in parity 0 */ |
9598a481 MD |
356 | |
357 | /* | |
358 | * Must finish waiting for quiescent state for parity 0 before | |
d40fde2c MD |
359 | * committing next rcu_gp_ctr update to memory. Failure to do so could |
360 | * result in the writer waiting forever while new readers are always | |
361 | * accessing data (no progress). Enforce compiler-order of load | |
bd252a04 | 362 | * URCU_TLS(rcu_reader).ctr before store to rcu_gp_ctr. |
9598a481 | 363 | */ |
5481ddb3 | 364 | cmm_barrier(); |
9598a481 | 365 | |
5dba80f9 | 366 | /* |
5481ddb3 | 367 | * Adding a cmm_smp_mb() which is _not_ formally required, but makes the |
5dba80f9 MD |
368 | * model easier to understand. It does not have a big performance impact |
369 | * anyway, given this is the write-side. | |
370 | */ | |
5481ddb3 | 371 | cmm_smp_mb(); |
67c2d80b | 372 | |
9598a481 MD |
373 | /* |
374 | * Wait for previous parity to be empty of readers. | |
66bc4dcd MD |
375 | * update_counter_and_wait() can release and grab again |
376 | * rcu_registry_lock interally. | |
9598a481 | 377 | */ |
2dfb8b5e | 378 | update_counter_and_wait(); /* 1 -> 0, wait readers in parity 1 */ |
9598a481 | 379 | |
66bc4dcd MD |
380 | /* |
381 | * Finish waiting for reader threads before letting the old ptr | |
382 | * being freed. Must be done within rcu_registry_lock because it | |
383 | * iterates on reader threads. | |
384 | */ | |
25cc6d18 | 385 | smp_mb_master(RCU_MB_GROUP); |
2dfb8b5e | 386 | out: |
66bc4dcd | 387 | mutex_unlock(&rcu_registry_lock); |
6abb4bd5 | 388 | mutex_unlock(&rcu_gp_lock); |
2bc59bd7 PM |
389 | } |
390 | ||
121a5d44 MD |
391 | /* |
392 | * library wrappers to be used by non-LGPL compatible source code. | |
393 | */ | |
394 | ||
395 | void rcu_read_lock(void) | |
396 | { | |
397 | _rcu_read_lock(); | |
398 | } | |
399 | ||
400 | void rcu_read_unlock(void) | |
401 | { | |
402 | _rcu_read_unlock(); | |
403 | } | |
404 | ||
121a5d44 | 405 | void rcu_register_thread(void) |
27b012e2 | 406 | { |
bd252a04 MD |
407 | URCU_TLS(rcu_reader).tid = pthread_self(); |
408 | assert(URCU_TLS(rcu_reader).need_mb == 0); | |
409 | assert(!(URCU_TLS(rcu_reader).ctr & RCU_GP_CTR_NEST_MASK)); | |
02be5561 | 410 | |
66bc4dcd | 411 | mutex_lock(&rcu_registry_lock); |
02be5561 | 412 | rcu_init(); /* In case gcc does not support constructor attribute */ |
bd252a04 | 413 | cds_list_add(&URCU_TLS(rcu_reader).node, ®istry); |
66bc4dcd | 414 | mutex_unlock(&rcu_registry_lock); |
27b012e2 MD |
415 | } |
416 | ||
121a5d44 | 417 | void rcu_unregister_thread(void) |
27b012e2 | 418 | { |
66bc4dcd | 419 | mutex_lock(&rcu_registry_lock); |
bd252a04 | 420 | cds_list_del(&URCU_TLS(rcu_reader).node); |
66bc4dcd | 421 | mutex_unlock(&rcu_registry_lock); |
27b012e2 MD |
422 | } |
423 | ||
fdf01eed MD |
424 | #ifdef RCU_MEMBARRIER |
425 | void rcu_init(void) | |
426 | { | |
427 | if (init_done) | |
428 | return; | |
429 | init_done = 1; | |
cf5271ee | 430 | if (!membarrier(MEMBARRIER_EXPEDITED | MEMBARRIER_QUERY)) |
fdf01eed MD |
431 | has_sys_membarrier = 1; |
432 | } | |
433 | #endif | |
434 | ||
435 | #ifdef RCU_SIGNAL | |
02be5561 | 436 | static void sigrcu_handler(int signo, siginfo_t *siginfo, void *context) |
27b012e2 | 437 | { |
40e140c9 | 438 | /* |
5481ddb3 DG |
439 | * Executing this cmm_smp_mb() is the only purpose of this signal handler. |
440 | * It punctually promotes cmm_barrier() into cmm_smp_mb() on every thread it is | |
40e140c9 MD |
441 | * executed on. |
442 | */ | |
5481ddb3 | 443 | cmm_smp_mb(); |
bd252a04 | 444 | _CMM_STORE_SHARED(URCU_TLS(rcu_reader).need_mb, 0); |
5481ddb3 | 445 | cmm_smp_mb(); |
27b012e2 MD |
446 | } |
447 | ||
8a5fb4c9 | 448 | /* |
02be5561 | 449 | * rcu_init constructor. Called when the library is linked, but also when |
8a5fb4c9 MD |
450 | * reader threads are calling rcu_register_thread(). |
451 | * Should only be called by a single thread at a given time. This is ensured by | |
66bc4dcd MD |
452 | * holing the rcu_registry_lock from rcu_register_thread() or by running |
453 | * at library load time, which should not be executed by multiple | |
454 | * threads nor concurrently with rcu_register_thread() anyway. | |
8a5fb4c9 | 455 | */ |
02be5561 | 456 | void rcu_init(void) |
27b012e2 MD |
457 | { |
458 | struct sigaction act; | |
459 | int ret; | |
460 | ||
8a5fb4c9 MD |
461 | if (init_done) |
462 | return; | |
463 | init_done = 1; | |
464 | ||
02be5561 | 465 | act.sa_sigaction = sigrcu_handler; |
dd052bd3 | 466 | act.sa_flags = SA_SIGINFO | SA_RESTART; |
c297c21c | 467 | sigemptyset(&act.sa_mask); |
02be5561 | 468 | ret = sigaction(SIGRCU, &act, NULL); |
4a6d7378 MD |
469 | if (ret) |
470 | urcu_die(errno); | |
27b012e2 MD |
471 | } |
472 | ||
02be5561 | 473 | void rcu_exit(void) |
27b012e2 MD |
474 | { |
475 | struct sigaction act; | |
476 | int ret; | |
477 | ||
02be5561 | 478 | ret = sigaction(SIGRCU, NULL, &act); |
4a6d7378 MD |
479 | if (ret) |
480 | urcu_die(errno); | |
02be5561 | 481 | assert(act.sa_sigaction == sigrcu_handler); |
16aa9ee8 | 482 | assert(cds_list_empty(®istry)); |
27b012e2 | 483 | } |
5e77fc1f | 484 | |
fdf01eed | 485 | #endif /* #ifdef RCU_SIGNAL */ |
5e77fc1f | 486 | |
5e6b23a6 | 487 | DEFINE_RCU_FLAVOR(rcu_flavor); |
541d828d | 488 | |
5e77fc1f | 489 | #include "urcu-call-rcu-impl.h" |
0376e7b2 | 490 | #include "urcu-defer-impl.h" |