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