Version 0.7.17
[userspace-rcu.git] / urcu-qsbr.c
CommitLineData
9f1621ca 1/*
7ac06cef 2 * urcu-qsbr.c
9f1621ca 3 *
7ac06cef 4 * Userspace RCU QSBR library
9f1621ca 5 *
6982d6d7 6 * Copyright (c) 2009 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
9f1621ca
MD
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
c1d2c60b 26#define _GNU_SOURCE
71c811bf 27#define _LGPL_SOURCE
9f1621ca
MD
28#include <stdio.h>
29#include <pthread.h>
30#include <signal.h>
31#include <assert.h>
32#include <stdlib.h>
6d841bc2 33#include <stdint.h>
9f1621ca
MD
34#include <string.h>
35#include <errno.h>
36#include <poll.h>
37
71c811bf 38#include "urcu/wfqueue.h"
57760d44 39#include "urcu/map/urcu-qsbr.h"
727f819d 40#define BUILD_QSBR_LIB
af7c2dbe 41#include "urcu/static/urcu-qsbr.h"
618b2595 42#include "urcu-pointer.h"
bd252a04 43#include "urcu/tls-compat.h"
71c811bf 44
4a6d7378
MD
45#include "urcu-die.h"
46
9f1621ca 47/* Do not #define _LGPL_SOURCE to ensure we can emit the wrapper symbols */
71c811bf 48#undef _LGPL_SOURCE
7ac06cef 49#include "urcu-qsbr.h"
71c811bf 50#define _LGPL_SOURCE
9f1621ca 51
f6d18c64
MD
52void __attribute__((destructor)) rcu_exit(void);
53
66bc4dcd
MD
54/*
55 * rcu_gp_lock ensures mutual exclusion between threads calling
56 * synchronize_rcu().
57 */
6abb4bd5 58static pthread_mutex_t rcu_gp_lock = PTHREAD_MUTEX_INITIALIZER;
66bc4dcd
MD
59/*
60 * rcu_registry_lock ensures mutual exclusion between threads
61 * registering and unregistering themselves to/from the registry, and
62 * with threads reading that registry from synchronize_rcu(). However,
63 * this lock is not held all the way through the completion of awaiting
64 * for the grace period. It is sporadically released between iterations
65 * on the registry.
66 * rcu_registry_lock may nest inside rcu_gp_lock.
67 */
68static pthread_mutex_t rcu_registry_lock = PTHREAD_MUTEX_INITIALIZER;
9f1621ca 69
6d841bc2 70int32_t gp_futex;
bc6c15bb 71
9f1621ca
MD
72/*
73 * Global grace period counter.
74 */
02be5561 75unsigned long rcu_gp_ctr = RCU_GP_ONLINE;
9f1621ca 76
408f6d92
PB
77/*
78 * Active attempts to check for reader Q.S. before calling futex().
79 */
80#define RCU_QS_ACTIVE_ATTEMPTS 100
81
9f1621ca
MD
82/*
83 * Written to only by each individual reader. Read by both the reader and the
84 * writers.
85 */
1745be1a 86__DEFINE_URCU_TLS_GLOBAL(struct rcu_reader, rcu_reader);
9f1621ca
MD
87
88#ifdef DEBUG_YIELD
89unsigned int yield_active;
1745be1a 90__DEFINE_URCU_TLS_GLOBAL(unsigned int, rand_yield);
9f1621ca
MD
91#endif
92
16aa9ee8 93static CDS_LIST_HEAD(registry);
9f1621ca 94
6abb4bd5 95static void mutex_lock(pthread_mutex_t *mutex)
9f1621ca
MD
96{
97 int ret;
98
99#ifndef DISTRUST_SIGNALS_EXTREME
6abb4bd5 100 ret = pthread_mutex_lock(mutex);
4a6d7378
MD
101 if (ret)
102 urcu_die(ret);
9f1621ca 103#else /* #ifndef DISTRUST_SIGNALS_EXTREME */
6abb4bd5 104 while ((ret = pthread_mutex_trylock(mutex)) != 0) {
4a6d7378
MD
105 if (ret != EBUSY && ret != EINTR)
106 urcu_die(ret);
9f1621ca
MD
107 poll(NULL,0,10);
108 }
109#endif /* #else #ifndef DISTRUST_SIGNALS_EXTREME */
110}
111
6abb4bd5 112static void mutex_unlock(pthread_mutex_t *mutex)
9f1621ca
MD
113{
114 int ret;
115
6abb4bd5 116 ret = pthread_mutex_unlock(mutex);
4a6d7378
MD
117 if (ret)
118 urcu_die(ret);
9f1621ca
MD
119}
120
bc6c15bb
MD
121/*
122 * synchronize_rcu() waiting. Single thread.
123 */
4d703340 124static void wait_gp(void)
bc6c15bb 125{
4d703340 126 /* Read reader_gp before read futex */
5481ddb3 127 cmm_smp_rmb();
11eb040f
MD
128 if (uatomic_read(&gp_futex) != -1)
129 return;
130 while (futex_noasync(&gp_futex, FUTEX_WAIT, -1,
131 NULL, NULL, 0)) {
132 switch (errno) {
133 case EWOULDBLOCK:
134 /* Value already changed. */
135 return;
136 case EINTR:
137 /* Retry if interrupted by signal. */
138 break; /* Get out of switch. */
139 default:
140 /* Unexpected error. */
141 urcu_die(errno);
142 }
143 }
bc6c15bb
MD
144}
145
66bc4dcd
MD
146/*
147 * Always called with rcu_registry lock held. Releases this lock between
148 * iterations and grabs it again. Holds the lock when it returns.
149 */
2dfb8b5e 150static void update_counter_and_wait(void)
9f1621ca 151{
16aa9ee8 152 CDS_LIST_HEAD(qsreaders);
6b702fa4 153 unsigned int wait_loops = 0;
02be5561 154 struct rcu_reader *index, *tmp;
9f1621ca 155
b39e1761 156#if (CAA_BITS_PER_LONG < 64)
32c15e4e 157 /* Switch parity: 0 -> 1, 1 -> 0 */
6cf3827c 158 CMM_STORE_SHARED(rcu_gp_ctr, rcu_gp_ctr ^ RCU_GP_CTR);
b39e1761 159#else /* !(CAA_BITS_PER_LONG < 64) */
2dfb8b5e 160 /* Increment current G.P. */
6cf3827c 161 CMM_STORE_SHARED(rcu_gp_ctr, rcu_gp_ctr + RCU_GP_CTR);
b39e1761 162#endif /* !(CAA_BITS_PER_LONG < 64) */
2dfb8b5e 163
7a5a38f5 164 /*
5e77fc1f
PM
165 * Must commit rcu_gp_ctr update to memory before waiting for
166 * quiescent state. Failure to do so could result in the writer
167 * waiting forever while new readers are always accessing data
168 * (no progress). Enforce compiler-order of store to rcu_gp_ctr
bd252a04 169 * before load URCU_TLS(rcu_reader).ctr.
d40fde2c 170 */
5481ddb3 171 cmm_barrier();
d40fde2c
MD
172
173 /*
5481ddb3 174 * Adding a cmm_smp_mb() which is _not_ formally required, but makes the
935b11ff
MD
175 * model easier to understand. It does not have a big performance impact
176 * anyway, given this is the write-side.
7a5a38f5 177 */
5481ddb3 178 cmm_smp_mb();
7a5a38f5 179
9f1621ca 180 /*
3395d46c 181 * Wait for each thread rcu_reader_qs_gp count to become 0.
9f1621ca 182 */
4d703340 183 for (;;) {
cca4c8dc
MD
184 if (wait_loops < RCU_QS_ACTIVE_ATTEMPTS)
185 wait_loops++;
83a2c421
PB
186 if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) {
187 uatomic_set(&gp_futex, -1);
188 /*
189 * Write futex before write waiting (the other side
190 * reads them in the opposite order).
191 */
192 cmm_smp_wmb();
193 cds_list_for_each_entry(index, &registry, node) {
194 _CMM_STORE_SHARED(index->waiting, 1);
195 }
4d703340 196 /* Write futex before read reader_gp */
5481ddb3 197 cmm_smp_mb();
4d703340 198 }
16aa9ee8 199 cds_list_for_each_entry_safe(index, tmp, &registry, node) {
4d703340 200 if (!rcu_gp_ongoing(&index->ctr))
16aa9ee8 201 cds_list_move(&index->node, &qsreaders);
4d703340 202 }
bc6c15bb 203
16aa9ee8 204 if (cds_list_empty(&registry)) {
83a2c421 205 if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) {
4d703340 206 /* Read reader_gp before write futex */
5481ddb3 207 cmm_smp_mb();
4d703340
MD
208 uatomic_set(&gp_futex, 0);
209 }
210 break;
211 } else {
66bc4dcd
MD
212 /* Temporarily unlock the registry lock. */
213 mutex_unlock(&rcu_registry_lock);
83a2c421 214 if (wait_loops >= RCU_QS_ACTIVE_ATTEMPTS) {
4d703340 215 wait_gp();
bc6c15bb 216 } else {
9f1621ca 217#ifndef HAS_INCOHERENT_CACHES
06f22bdb 218 caa_cpu_relax();
9f1621ca 219#else /* #ifndef HAS_INCOHERENT_CACHES */
5481ddb3 220 cmm_smp_mb();
9f1621ca 221#endif /* #else #ifndef HAS_INCOHERENT_CACHES */
bc6c15bb 222 }
66bc4dcd
MD
223 /* Re-lock the registry lock before the next loop. */
224 mutex_lock(&rcu_registry_lock);
bc6c15bb 225 }
9f1621ca 226 }
4d703340 227 /* put back the reader list in the registry */
16aa9ee8 228 cds_list_splice(&qsreaders, &registry);
9f1621ca
MD
229}
230
47d2f29e
MD
231/*
232 * Using a two-subphases algorithm for architectures with smaller than 64-bit
233 * long-size to ensure we do not encounter an overflow bug.
234 */
235
b39e1761 236#if (CAA_BITS_PER_LONG < 64)
47d2f29e
MD
237void synchronize_rcu(void)
238{
bc49c323
MD
239 unsigned long was_online;
240
bd252a04 241 was_online = URCU_TLS(rcu_reader).ctr;
bc49c323 242
47d2f29e 243 /* All threads should read qparity before accessing data structure
27b940e7
PB
244 * where new ptr points to. In the "then" case, rcu_thread_offline
245 * includes a memory barrier.
246 *
bc49c323 247 * Mark the writer thread offline to make sure we don't wait for
5e77fc1f
PM
248 * our own quiescent state. This allows using synchronize_rcu()
249 * in threads registered as readers.
bc49c323 250 */
27b940e7
PB
251 if (was_online)
252 rcu_thread_offline();
253 else
254 cmm_smp_mb();
bc49c323 255
6abb4bd5 256 mutex_lock(&rcu_gp_lock);
66bc4dcd 257 mutex_lock(&rcu_registry_lock);
47d2f29e 258
16aa9ee8 259 if (cds_list_empty(&registry))
2dfb8b5e 260 goto out;
47d2f29e
MD
261
262 /*
263 * Wait for previous parity to be empty of readers.
66bc4dcd
MD
264 * update_counter_and_wait() can release and grab again
265 * rcu_registry_lock interally.
47d2f29e 266 */
2dfb8b5e 267 update_counter_and_wait(); /* 0 -> 1, wait readers in parity 0 */
47d2f29e
MD
268
269 /*
270 * Must finish waiting for quiescent state for parity 0 before
5e77fc1f
PM
271 * committing next rcu_gp_ctr update to memory. Failure to
272 * do so could result in the writer waiting forever while new
273 * readers are always accessing data (no progress). Enforce
bd252a04 274 * compiler-order of load URCU_TLS(rcu_reader).ctr before store to
5e77fc1f 275 * rcu_gp_ctr.
47d2f29e 276 */
5481ddb3 277 cmm_barrier();
47d2f29e 278
47d2f29e 279 /*
5481ddb3 280 * Adding a cmm_smp_mb() which is _not_ formally required, but makes the
2dfb8b5e
MD
281 * model easier to understand. It does not have a big performance impact
282 * anyway, given this is the write-side.
47d2f29e 283 */
5481ddb3 284 cmm_smp_mb();
47d2f29e
MD
285
286 /*
287 * Wait for previous parity to be empty of readers.
66bc4dcd
MD
288 * update_counter_and_wait() can release and grab again
289 * rcu_registry_lock interally.
47d2f29e 290 */
2dfb8b5e
MD
291 update_counter_and_wait(); /* 1 -> 0, wait readers in parity 1 */
292out:
66bc4dcd 293 mutex_unlock(&rcu_registry_lock);
6abb4bd5 294 mutex_unlock(&rcu_gp_lock);
47d2f29e 295
bc49c323
MD
296 /*
297 * Finish waiting for reader threads before letting the old ptr being
47d2f29e
MD
298 * freed.
299 */
bc49c323 300 if (was_online)
27b940e7
PB
301 rcu_thread_online();
302 else
303 cmm_smp_mb();
47d2f29e 304}
b39e1761 305#else /* !(CAA_BITS_PER_LONG < 64) */
9f1621ca
MD
306void synchronize_rcu(void)
307{
f0f7dbdd 308 unsigned long was_online;
ff2f67a0 309
bd252a04 310 was_online = URCU_TLS(rcu_reader).ctr;
ff2f67a0
MD
311
312 /*
313 * Mark the writer thread offline to make sure we don't wait for
5e77fc1f
PM
314 * our own quiescent state. This allows using synchronize_rcu()
315 * in threads registered as readers.
ff2f67a0 316 */
27b940e7
PB
317 if (was_online)
318 rcu_thread_offline();
319 else
320 cmm_smp_mb();
ff2f67a0 321
6abb4bd5 322 mutex_lock(&rcu_gp_lock);
66bc4dcd 323 mutex_lock(&rcu_registry_lock);
16aa9ee8 324 if (cds_list_empty(&registry))
2dfb8b5e 325 goto out;
66bc4dcd
MD
326 /*
327 * update_counter_and_wait() can release and grab again
328 * rcu_registry_lock interally.
329 */
2dfb8b5e
MD
330 update_counter_and_wait();
331out:
66bc4dcd 332 mutex_unlock(&rcu_registry_lock);
6abb4bd5 333 mutex_unlock(&rcu_gp_lock);
ff2f67a0
MD
334
335 if (was_online)
27b940e7
PB
336 rcu_thread_online();
337 else
338 cmm_smp_mb();
9f1621ca 339}
b39e1761 340#endif /* !(CAA_BITS_PER_LONG < 64) */
9f1621ca
MD
341
342/*
343 * library wrappers to be used by non-LGPL compatible source code.
344 */
345
346void rcu_read_lock(void)
347{
348 _rcu_read_lock();
349}
350
351void rcu_read_unlock(void)
352{
353 _rcu_read_unlock();
354}
355
7ac06cef
MD
356void rcu_quiescent_state(void)
357{
358 _rcu_quiescent_state();
359}
360
361void rcu_thread_offline(void)
362{
363 _rcu_thread_offline();
364}
365
366void rcu_thread_online(void)
367{
368 _rcu_thread_online();
369}
370
9f1621ca
MD
371void rcu_register_thread(void)
372{
bd252a04
MD
373 URCU_TLS(rcu_reader).tid = pthread_self();
374 assert(URCU_TLS(rcu_reader).ctr == 0);
4f8e3380 375
66bc4dcd 376 mutex_lock(&rcu_registry_lock);
bd252a04 377 cds_list_add(&URCU_TLS(rcu_reader).node, &registry);
66bc4dcd 378 mutex_unlock(&rcu_registry_lock);
5f373c84 379 _rcu_thread_online();
9f1621ca
MD
380}
381
382void rcu_unregister_thread(void)
383{
76f3022f
MD
384 /*
385 * We have to make the thread offline otherwise we end up dealocking
386 * with a waiting writer.
387 */
388 _rcu_thread_offline();
66bc4dcd 389 mutex_lock(&rcu_registry_lock);
bd252a04 390 cds_list_del(&URCU_TLS(rcu_reader).node);
66bc4dcd 391 mutex_unlock(&rcu_registry_lock);
9f1621ca 392}
f6d18c64
MD
393
394void rcu_exit(void)
395{
01cadde4
MD
396 /*
397 * Assertion disabled because call_rcu threads are now rcu
398 * readers, and left running at exit.
399 * assert(cds_list_empty(&registry));
400 */
f6d18c64 401}
5e77fc1f 402
5e6b23a6 403DEFINE_RCU_FLAVOR(rcu_flavor);
541d828d 404
5e77fc1f 405#include "urcu-call-rcu-impl.h"
0376e7b2 406#include "urcu-defer-impl.h"
This page took 0.05038 seconds and 4 git commands to generate.