4 * Userspace RCU library, "bulletproof" version.
6 * Copyright (c) 2009 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
7 * Copyright (c) 2009 Paul E. McKenney, IBM Corporation.
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.
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.
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
23 * IBM's contributions to this file may be relicensed under LGPLv2 or later.
39 #include "urcu/wfcqueue.h"
40 #include "urcu/map/urcu-bp.h"
41 #include "urcu/static/urcu-bp.h"
42 #include "urcu-pointer.h"
43 #include "urcu/tls-compat.h"
47 /* Do not #define _LGPL_SOURCE to ensure we can emit the wrapper symbols */
53 #define MAP_ANONYMOUS MAP_ANON
58 void *mremap_wrapper(void *old_address
, size_t old_size
,
59 size_t new_size
, int flags
)
61 return mremap(old_address
, old_size
, new_size
, flags
);
65 #define MREMAP_MAYMOVE 1
66 #define MREMAP_FIXED 2
69 * mremap wrapper for non-Linux systems. Maps a RW, anonymous private mapping.
70 * This is not generic.
73 void *mremap_wrapper(void *old_address
, size_t old_size
,
74 size_t new_size
, int flags
)
78 assert(flags
& MREMAP_MAYMOVE
);
79 assert(!(flags
& MREMAP_FIXED
));
80 new_address
= mmap(old_address
, new_size
,
81 PROT_READ
| PROT_WRITE
,
82 MAP_ANONYMOUS
| MAP_PRIVATE
,
84 if (new_address
== MAP_FAILED
)
87 memcpy(new_address
, old_address
, old_size
);
88 munmap(old_address
, old_size
);
94 /* Sleep delay in us */
95 #define RCU_SLEEP_DELAY 1000
96 #define ARENA_INIT_ALLOC 16
99 * Active attempts to check for reader Q.S. before calling sleep().
101 #define RCU_QS_ACTIVE_ATTEMPTS 100
103 void __attribute__((destructor
)) rcu_bp_exit(void);
105 static pthread_mutex_t rcu_gp_lock
= PTHREAD_MUTEX_INITIALIZER
;
108 unsigned int rcu_yield_active
;
109 DEFINE_URCU_TLS(unsigned int, rcu_rand_yield
);
112 struct rcu_gp rcu_gp
= { .ctr
= RCU_GP_COUNT
};
115 * Pointer to registry elements. Written to only by each individual reader. Read
116 * by both the reader and the writers.
118 DEFINE_URCU_TLS(struct rcu_reader
*, rcu_reader
);
120 static CDS_LIST_HEAD(registry
);
122 struct registry_arena
{
128 static struct registry_arena registry_arena
;
130 /* Saved fork signal mask, protected by rcu_gp_lock */
131 static sigset_t saved_fork_signal_mask
;
133 static void rcu_gc_registry(void);
135 static void mutex_lock(pthread_mutex_t
*mutex
)
139 #ifndef DISTRUST_SIGNALS_EXTREME
140 ret
= pthread_mutex_lock(mutex
);
143 #else /* #ifndef DISTRUST_SIGNALS_EXTREME */
144 while ((ret
= pthread_mutex_trylock(mutex
)) != 0) {
145 if (ret
!= EBUSY
&& ret
!= EINTR
)
149 #endif /* #else #ifndef DISTRUST_SIGNALS_EXTREME */
152 static void mutex_unlock(pthread_mutex_t
*mutex
)
156 ret
= pthread_mutex_unlock(mutex
);
161 static void wait_for_readers(struct cds_list_head
*input_readers
,
162 struct cds_list_head
*cur_snap_readers
,
163 struct cds_list_head
*qsreaders
)
166 struct rcu_reader
*index
, *tmp
;
169 * Wait for each thread URCU_TLS(rcu_reader).ctr to either
170 * indicate quiescence (not nested), or observe the current
175 cds_list_for_each_entry_safe(index
, tmp
, input_readers
, node
) {
176 switch (rcu_reader_state(&index
->ctr
)) {
177 case RCU_READER_ACTIVE_CURRENT
:
178 if (cur_snap_readers
) {
179 cds_list_move(&index
->node
,
184 case RCU_READER_INACTIVE
:
185 cds_list_move(&index
->node
, qsreaders
);
187 case RCU_READER_ACTIVE_OLD
:
189 * Old snapshot. Leaving node in
190 * input_readers will make us busy-loop
191 * until the snapshot becomes current or
192 * the reader becomes inactive.
198 if (cds_list_empty(input_readers
)) {
201 if (wait_loops
== RCU_QS_ACTIVE_ATTEMPTS
)
202 usleep(RCU_SLEEP_DELAY
);
209 void synchronize_rcu(void)
211 CDS_LIST_HEAD(cur_snap_readers
);
212 CDS_LIST_HEAD(qsreaders
);
213 sigset_t newmask
, oldmask
;
216 ret
= sigemptyset(&newmask
);
218 ret
= pthread_sigmask(SIG_SETMASK
, &newmask
, &oldmask
);
221 mutex_lock(&rcu_gp_lock
);
223 if (cds_list_empty(®istry
))
226 /* All threads should read qparity before accessing data structure
227 * where new ptr points to. */
228 /* Write new ptr before changing the qparity */
231 /* Remove old registry elements */
235 * Wait for readers to observe original parity or be quiescent.
237 wait_for_readers(®istry
, &cur_snap_readers
, &qsreaders
);
240 * Adding a cmm_smp_mb() which is _not_ formally required, but makes the
241 * model easier to understand. It does not have a big performance impact
242 * anyway, given this is the write-side.
246 /* Switch parity: 0 -> 1, 1 -> 0 */
247 CMM_STORE_SHARED(rcu_gp
.ctr
, rcu_gp
.ctr
^ RCU_GP_CTR_PHASE
);
250 * Must commit qparity update to memory before waiting for other parity
251 * quiescent state. Failure to do so could result in the writer waiting
252 * forever while new readers are always accessing data (no progress).
253 * Ensured by CMM_STORE_SHARED and CMM_LOAD_SHARED.
257 * Adding a cmm_smp_mb() which is _not_ formally required, but makes the
258 * model easier to understand. It does not have a big performance impact
259 * anyway, given this is the write-side.
264 * Wait for readers to observe new parity or be quiescent.
266 wait_for_readers(&cur_snap_readers
, NULL
, &qsreaders
);
269 * Put quiescent reader list back into registry.
271 cds_list_splice(&qsreaders
, ®istry
);
274 * Finish waiting for reader threads before letting the old ptr being
279 mutex_unlock(&rcu_gp_lock
);
280 ret
= pthread_sigmask(SIG_SETMASK
, &oldmask
, NULL
);
285 * library wrappers to be used by non-LGPL compatible source code.
288 void rcu_read_lock(void)
293 void rcu_read_unlock(void)
298 int rcu_read_ongoing(void)
300 return _rcu_read_ongoing();
306 static void resize_arena(struct registry_arena
*arena
, size_t len
)
311 new_arena
= mmap(arena
->p
, len
,
312 PROT_READ
| PROT_WRITE
,
313 MAP_ANONYMOUS
| MAP_PRIVATE
,
316 new_arena
= mremap_wrapper(arena
->p
, arena
->len
,
317 len
, MREMAP_MAYMOVE
);
318 assert(new_arena
!= MAP_FAILED
);
321 * re-used the same region ?
323 if (new_arena
== arena
->p
)
326 bzero(new_arena
+ arena
->len
, len
- arena
->len
);
327 arena
->p
= new_arena
;
330 /* Called with signals off and mutex locked */
331 static void add_thread(void)
333 struct rcu_reader
*rcu_reader_reg
;
335 if (registry_arena
.len
336 < registry_arena
.used
+ sizeof(struct rcu_reader
))
337 resize_arena(®istry_arena
,
338 caa_max(registry_arena
.len
<< 1, ARENA_INIT_ALLOC
));
342 for (rcu_reader_reg
= registry_arena
.p
;
343 (void *)rcu_reader_reg
< registry_arena
.p
+ registry_arena
.len
;
345 if (!rcu_reader_reg
->alloc
)
348 rcu_reader_reg
->alloc
= 1;
349 registry_arena
.used
+= sizeof(struct rcu_reader
);
351 /* Add to registry */
352 rcu_reader_reg
->tid
= pthread_self();
353 assert(rcu_reader_reg
->ctr
== 0);
354 cds_list_add(&rcu_reader_reg
->node
, ®istry
);
355 URCU_TLS(rcu_reader
) = rcu_reader_reg
;
358 /* Called with signals off and mutex locked */
359 static void rcu_gc_registry(void)
361 struct rcu_reader
*rcu_reader_reg
;
365 for (rcu_reader_reg
= registry_arena
.p
;
366 (void *)rcu_reader_reg
< registry_arena
.p
+ registry_arena
.len
;
368 if (!rcu_reader_reg
->alloc
)
370 tid
= rcu_reader_reg
->tid
;
371 ret
= pthread_kill(tid
, 0);
372 assert(ret
!= EINVAL
);
374 cds_list_del(&rcu_reader_reg
->node
);
375 rcu_reader_reg
->ctr
= 0;
376 rcu_reader_reg
->alloc
= 0;
377 registry_arena
.used
-= sizeof(struct rcu_reader
);
382 /* Disable signals, take mutex, add to registry */
383 void rcu_bp_register(void)
385 sigset_t newmask
, oldmask
;
388 ret
= sigemptyset(&newmask
);
390 ret
= pthread_sigmask(SIG_SETMASK
, &newmask
, &oldmask
);
394 * Check if a signal concurrently registered our thread since
395 * the check in rcu_read_lock(). */
396 if (URCU_TLS(rcu_reader
))
399 mutex_lock(&rcu_gp_lock
);
401 mutex_unlock(&rcu_gp_lock
);
403 ret
= pthread_sigmask(SIG_SETMASK
, &oldmask
, NULL
);
407 void rcu_bp_exit(void)
409 if (registry_arena
.p
)
410 munmap(registry_arena
.p
, registry_arena
.len
);
414 * Holding the rcu_gp_lock across fork will make sure we fork() don't race with
415 * a concurrent thread executing with this same lock held. This ensures that the
416 * registry is in a coherent state in the child.
418 void rcu_bp_before_fork(void)
420 sigset_t newmask
, oldmask
;
423 ret
= sigemptyset(&newmask
);
425 ret
= pthread_sigmask(SIG_SETMASK
, &newmask
, &oldmask
);
427 mutex_lock(&rcu_gp_lock
);
428 saved_fork_signal_mask
= oldmask
;
431 void rcu_bp_after_fork_parent(void)
436 oldmask
= saved_fork_signal_mask
;
437 mutex_unlock(&rcu_gp_lock
);
438 ret
= pthread_sigmask(SIG_SETMASK
, &oldmask
, NULL
);
442 void rcu_bp_after_fork_child(void)
448 oldmask
= saved_fork_signal_mask
;
449 mutex_unlock(&rcu_gp_lock
);
450 ret
= pthread_sigmask(SIG_SETMASK
, &oldmask
, NULL
);
454 void *rcu_dereference_sym_bp(void *p
)
456 return _rcu_dereference(p
);
459 void *rcu_set_pointer_sym_bp(void **p
, void *v
)
466 void *rcu_xchg_pointer_sym_bp(void **p
, void *v
)
469 return uatomic_xchg(p
, v
);
472 void *rcu_cmpxchg_pointer_sym_bp(void **p
, void *old
, void *_new
)
475 return uatomic_cmpxchg(p
, old
, _new
);
478 DEFINE_RCU_FLAVOR(rcu_flavor
);
480 #include "urcu-call-rcu-impl.h"
481 #include "urcu-defer-impl.h"