Merge branch 'master' into urcu/ht
[urcu.git] / urcu / static / urcu.h
CommitLineData
adcfce54
MD
1#ifndef _URCU_STATIC_H
2#define _URCU_STATIC_H
3
4/*
5 * urcu-static.h
6 *
d2d23035 7 * Userspace RCU header.
adcfce54 8 *
d2d23035
MD
9 * TO BE INCLUDED ONLY IN LGPL-COMPATIBLE CODE. See urcu.h for linking
10 * dynamically with the userspace rcu library.
adcfce54 11 *
6982d6d7 12 * Copyright (c) 2009 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
d2d23035 13 * Copyright (c) 2009 Paul E. McKenney, IBM Corporation.
adcfce54 14 *
d2d23035
MD
15 * This library is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU Lesser General Public
17 * License as published by the Free Software Foundation; either
18 * version 2.1 of the License, or (at your option) any later version.
19 *
20 * This library is distributed in the hope that it will be useful,
21 * but WITHOUT ANY WARRANTY; without even the implied warranty of
22 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
23 * Lesser General Public License for more details.
24 *
25 * You should have received a copy of the GNU Lesser General Public
26 * License along with this library; if not, write to the Free Software
27 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
adcfce54
MD
28 *
29 * IBM's contributions to this file may be relicensed under LGPLv2 or later.
30 */
31
32#include <stdlib.h>
33#include <pthread.h>
bc6c15bb 34#include <unistd.h>
6d841bc2 35#include <stdint.h>
adcfce54 36
ec4e58a3
MD
37#include <urcu/compiler.h>
38#include <urcu/arch.h>
7e30abe3 39#include <urcu/system.h>
a2e7bf9c 40#include <urcu/uatomic.h>
e3b0cef0 41#include <urcu/list.h>
41849996 42#include <urcu/futex.h>
bc6c15bb 43
36bc70a8
MD
44#ifdef __cplusplus
45extern "C" {
46#endif
47
65f1e634 48/* Default is RCU_MEMBARRIER */
fdf01eed 49#if !defined(RCU_MEMBARRIER) && !defined(RCU_MB) && !defined(RCU_SIGNAL)
65f1e634
MD
50#define RCU_MEMBARRIER
51#endif
52
53/*
54 * RCU_MEMBARRIER is only possibly available on Linux. Fallback to RCU_MB
55 * otherwise.
56 */
57#if !defined(__linux__) && defined(RCU_MEMBARRIER)
58#undef RCU_MEMBARRIER
59#define RCU_MB
fdf01eed
MD
60#endif
61
62#ifdef RCU_MEMBARRIER
4906d398 63#include <syscall.h>
fdf01eed
MD
64
65/* If the headers do not support SYS_membarrier, statically use RCU_MB */
66#ifdef SYS_membarrier
cf5271ee
MD
67# define MEMBARRIER_EXPEDITED (1 << 0)
68# define MEMBARRIER_DELAYED (1 << 1)
69# define MEMBARRIER_QUERY (1 << 16)
d4fc680a 70# define membarrier(...) syscall(SYS_membarrier, __VA_ARGS__)
fdf01eed 71#else
f0708810
MD
72# undef RCU_MEMBARRIER
73# define RCU_MB
fdf01eed
MD
74#endif
75#endif
76
adcfce54
MD
77/*
78 * This code section can only be included in LGPL 2.1 compatible source code.
79 * See below for the function call wrappers which can be used in code meant to
80 * be only linked with the Userspace RCU library. This comes with a small
81 * performance degradation on the read-side due to the added function calls.
82 * This is required to permit relinking with newer versions of the library.
83 */
84
85/*
86 * The signal number used by the RCU library can be overridden with
02be5561 87 * -DSIGRCU= when compiling the library.
ddf7eefb 88 * Provide backward compatibility for liburcu 0.3.x SIGURCU.
adcfce54 89 */
ddf7eefb
MD
90#ifdef SIGURCU
91#define SIGRCU SIGURCU
92#endif
93
02be5561
MD
94#ifndef SIGRCU
95#define SIGRCU SIGUSR1
adcfce54
MD
96#endif
97
98/*
99 * If a reader is really non-cooperative and refuses to commit its
02be5561 100 * rcu_active_readers count to memory (there is no barrier in the reader
adcfce54
MD
101 * per-se), kick it after a few loops waiting for it.
102 */
103#define KICK_READER_LOOPS 10000
104
bc6c15bb
MD
105/*
106 * Active attempts to check for reader Q.S. before calling futex().
107 */
108#define RCU_QS_ACTIVE_ATTEMPTS 100
109
7ac06cef
MD
110#ifdef DEBUG_RCU
111#define rcu_assert(args...) assert(args)
112#else
113#define rcu_assert(args...)
114#endif
115
adcfce54
MD
116#ifdef DEBUG_YIELD
117#include <sched.h>
118#include <time.h>
119#include <pthread.h>
120#include <unistd.h>
121
122#define YIELD_READ (1 << 0)
123#define YIELD_WRITE (1 << 1)
124
b4ce1526 125/*
fdf01eed 126 * Updates with RCU_SIGNAL are much slower. Account this in the delay.
b4ce1526 127 */
fdf01eed 128#ifdef RCU_SIGNAL
adcfce54 129/* maximum sleep delay, in us */
adcfce54 130#define MAX_SLEEP 30000
fdf01eed
MD
131#else
132#define MAX_SLEEP 50
adcfce54
MD
133#endif
134
135extern unsigned int yield_active;
136extern unsigned int __thread rand_yield;
137
138static inline void debug_yield_read(void)
139{
140 if (yield_active & YIELD_READ)
141 if (rand_r(&rand_yield) & 0x1)
142 usleep(rand_r(&rand_yield) % MAX_SLEEP);
143}
144
145static inline void debug_yield_write(void)
146{
147 if (yield_active & YIELD_WRITE)
148 if (rand_r(&rand_yield) & 0x1)
149 usleep(rand_r(&rand_yield) % MAX_SLEEP);
150}
151
152static inline void debug_yield_init(void)
153{
8ddd7970 154 rand_yield = time(NULL) ^ (unsigned long) pthread_self();
adcfce54
MD
155}
156#else
157static inline void debug_yield_read(void)
158{
159}
160
161static inline void debug_yield_write(void)
162{
163}
164
165static inline void debug_yield_init(void)
166{
167
168}
169#endif
170
25cc6d18
MD
171/*
172 * RCU memory barrier broadcast group. Currently, only broadcast to all process
173 * threads is supported (group 0).
174 *
175 * Slave barriers are only guaranteed to be ordered wrt master barriers.
176 *
177 * The pair ordering is detailed as (O: ordered, X: not ordered) :
178 * slave master
179 * slave X O
180 * master O O
181 */
182
183#define MB_GROUP_ALL 0
184#define RCU_MB_GROUP MB_GROUP_ALL
185
fdf01eed
MD
186#ifdef RCU_MEMBARRIER
187extern int has_sys_membarrier;
188
25cc6d18 189static inline void smp_mb_slave(int group)
fdf01eed
MD
190{
191 if (likely(has_sys_membarrier))
5481ddb3 192 cmm_barrier();
fdf01eed 193 else
5481ddb3 194 cmm_smp_mb();
fdf01eed
MD
195}
196#endif
197
02be5561 198#ifdef RCU_MB
25cc6d18 199static inline void smp_mb_slave(int group)
adcfce54 200{
5481ddb3 201 cmm_smp_mb();
adcfce54 202}
fdf01eed
MD
203#endif
204
205#ifdef RCU_SIGNAL
25cc6d18 206static inline void smp_mb_slave(int group)
adcfce54 207{
5481ddb3 208 cmm_barrier();
adcfce54
MD
209}
210#endif
211
212/*
02be5561
MD
213 * The trick here is that RCU_GP_CTR_PHASE must be a multiple of 8 so we can use
214 * a full 8-bits, 16-bits or 32-bits bitmask for the lower order bits.
adcfce54
MD
215 */
216#define RCU_GP_COUNT (1UL << 0)
217/* Use the amount of bits equal to half of the architecture long size */
27d65bc5 218#define RCU_GP_CTR_PHASE (1UL << (sizeof(unsigned long) << 2))
02be5561 219#define RCU_GP_CTR_NEST_MASK (RCU_GP_CTR_PHASE - 1)
adcfce54
MD
220
221/*
222 * Global quiescent period counter with low-order bits unused.
223 * Using a int rather than a char to eliminate false register dependencies
224 * causing stalls on some architectures.
225 */
27d65bc5 226extern unsigned long rcu_gp_ctr;
adcfce54 227
02be5561 228struct rcu_reader {
bd1a5e15 229 /* Data used by both reader and synchronize_rcu() */
27d65bc5 230 unsigned long ctr;
e3b0cef0 231 char need_mb;
bd1a5e15 232 /* Data used for registry */
16aa9ee8 233 struct cds_list_head node __attribute__((aligned(CAA_CACHE_LINE_SIZE)));
bd1a5e15 234 pthread_t tid;
e3b0cef0
MD
235};
236
02be5561 237extern struct rcu_reader __thread rcu_reader;
adcfce54 238
6d841bc2 239extern int32_t gp_futex;
bc6c15bb
MD
240
241/*
242 * Wake-up waiting synchronize_rcu(). Called from many concurrent threads.
243 */
244static inline void wake_up_gp(void)
245{
ec4e58a3
MD
246 if (unlikely(uatomic_read(&gp_futex) == -1)) {
247 uatomic_set(&gp_futex, 0);
0854ccff 248 futex_async(&gp_futex, FUTEX_WAKE, 1,
bc6c15bb
MD
249 NULL, NULL, 0);
250 }
251}
252
e26fa029 253static inline int rcu_gp_ongoing(unsigned long *ctr)
adcfce54 254{
27d65bc5 255 unsigned long v;
adcfce54 256
adcfce54
MD
257 /*
258 * Make sure both tests below are done on the same version of *value
259 * to insure consistency.
260 */
6cf3827c 261 v = CMM_LOAD_SHARED(*ctr);
adcfce54 262 return (v & RCU_GP_CTR_NEST_MASK) &&
02be5561 263 ((v ^ rcu_gp_ctr) & RCU_GP_CTR_PHASE);
adcfce54
MD
264}
265
266static inline void _rcu_read_lock(void)
267{
27d65bc5 268 unsigned long tmp;
adcfce54 269
5481ddb3 270 cmm_barrier(); /* Ensure the compiler does not reorder us with mutex */
02be5561
MD
271 tmp = rcu_reader.ctr;
272 /*
273 * rcu_gp_ctr is
274 * RCU_GP_COUNT | (~RCU_GP_CTR_PHASE or RCU_GP_CTR_PHASE)
275 */
67ef1a2c 276 if (likely(!(tmp & RCU_GP_CTR_NEST_MASK))) {
6cf3827c 277 _CMM_STORE_SHARED(rcu_reader.ctr, _CMM_LOAD_SHARED(rcu_gp_ctr));
67ef1a2c
MD
278 /*
279 * Set active readers count for outermost nesting level before
25cc6d18 280 * accessing the pointer. See smp_mb_master().
67ef1a2c 281 */
25cc6d18 282 smp_mb_slave(RCU_MB_GROUP);
67ef1a2c 283 } else {
6cf3827c 284 _CMM_STORE_SHARED(rcu_reader.ctr, tmp + RCU_GP_COUNT);
67ef1a2c 285 }
adcfce54
MD
286}
287
288static inline void _rcu_read_unlock(void)
289{
27d65bc5 290 unsigned long tmp;
bc6c15bb 291
02be5561 292 tmp = rcu_reader.ctr;
adcfce54
MD
293 /*
294 * Finish using rcu before decrementing the pointer.
25cc6d18 295 * See smp_mb_master().
adcfce54 296 */
bc6c15bb 297 if (likely((tmp & RCU_GP_CTR_NEST_MASK) == RCU_GP_COUNT)) {
25cc6d18 298 smp_mb_slave(RCU_MB_GROUP);
6cf3827c 299 _CMM_STORE_SHARED(rcu_reader.ctr, rcu_reader.ctr - RCU_GP_COUNT);
02be5561 300 /* write rcu_reader.ctr before read futex */
25cc6d18 301 smp_mb_slave(RCU_MB_GROUP);
bc6c15bb
MD
302 wake_up_gp();
303 } else {
6cf3827c 304 _CMM_STORE_SHARED(rcu_reader.ctr, rcu_reader.ctr - RCU_GP_COUNT);
bc6c15bb 305 }
5481ddb3 306 cmm_barrier(); /* Ensure the compiler does not reorder us with mutex */
adcfce54
MD
307}
308
ad918eeb 309#ifdef __cplusplus
36bc70a8
MD
310}
311#endif
312
adcfce54 313#endif /* _URCU_STATIC_H */
This page took 0.042171 seconds and 4 git commands to generate.