+// SPDX-FileCopyrightText: 2009 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+// SPDX-FileCopyrightText: 2009 Paul E. McKenney, IBM Corporation.
+//
+// SPDX-License-Identifier: LGPL-2.1-or-later
+
/*
- * urcu-bp.c
- *
* Userspace RCU library, "bulletproof" version.
*
- * Copyright (c) 2009 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
- * Copyright (c) 2009 Paul E. McKenney, IBM Corporation.
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- *
* IBM's contributions to this file may be relicensed under LGPLv2 or later.
*/
#include <stdbool.h>
#include <sys/mman.h>
+#include <urcu/annotate.h>
#include <urcu/assert.h>
#include <urcu/config.h>
#include <urcu/arch.h>
/* Sleep delay in ms */
#define RCU_SLEEP_DELAY_MS 10
-#define INIT_NR_THREADS 8
-#define ARENA_INIT_ALLOC \
- sizeof(struct registry_chunk) \
- + INIT_NR_THREADS * sizeof(struct urcu_bp_reader)
+#define INIT_READER_COUNT 8
/*
* Active attempts to check for reader Q.S. before calling sleep().
static
void __attribute__((constructor)) _urcu_bp_init(void);
static
-void __attribute__((destructor)) urcu_bp_exit(void);
+void urcu_bp_exit(void);
+static
+void __attribute__((destructor)) urcu_bp_exit_destructor(void);
static void urcu_call_rcu_exit(void);
#ifndef CONFIG_RCU_FORCE_SYS_MEMBARRIER
static CDS_LIST_HEAD(registry);
struct registry_chunk {
- size_t data_len; /* data length */
- size_t used; /* amount of data used */
+ size_t capacity; /* capacity of this chunk (in elements) */
+ size_t used; /* count of elements used */
struct cds_list_head node; /* chunk_list node */
- char data[];
+ struct urcu_bp_reader readers[];
};
struct registry_arena {
}
}
+/* Get the size of a chunk's allocation from its capacity (an element count). */
+static size_t chunk_allocation_size(size_t capacity)
+{
+ return (capacity * sizeof(struct urcu_bp_reader)) +
+ sizeof(struct registry_chunk);
+}
+
/*
* Always called with rcu_registry lock held. Releases this lock between
* iterations and grabs it again. Holds the lock when it returns.
*/
static void wait_for_readers(struct cds_list_head *input_readers,
struct cds_list_head *cur_snap_readers,
- struct cds_list_head *qsreaders)
+ struct cds_list_head *qsreaders,
+ cmm_annotate_t *group)
{
unsigned int wait_loops = 0;
struct urcu_bp_reader *index, *tmp;
wait_loops++;
cds_list_for_each_entry_safe(index, tmp, input_readers, node) {
- switch (urcu_bp_reader_state(&index->ctr)) {
+ switch (urcu_bp_reader_state(&index->ctr, group)) {
case URCU_BP_READER_ACTIVE_CURRENT:
if (cur_snap_readers) {
cds_list_move(&index->node,
void urcu_bp_synchronize_rcu(void)
{
+ cmm_annotate_define(acquire_group);
+ cmm_annotate_define(release_group);
CDS_LIST_HEAD(cur_snap_readers);
CDS_LIST_HEAD(qsreaders);
sigset_t newmask, oldmask;
* where new ptr points to. */
/* Write new ptr before changing the qparity */
smp_mb_master();
+ cmm_annotate_group_mb_release(&release_group);
/*
* Wait for readers to observe original parity or be quiescent.
* wait_for_readers() can release and grab again rcu_registry_lock
* internally.
*/
- wait_for_readers(®istry, &cur_snap_readers, &qsreaders);
+ wait_for_readers(®istry, &cur_snap_readers, &qsreaders, &acquire_group);
/*
* Adding a cmm_smp_mb() which is _not_ formally required, but makes the
cmm_smp_mb();
/* Switch parity: 0 -> 1, 1 -> 0 */
- CMM_STORE_SHARED(rcu_gp.ctr, rcu_gp.ctr ^ URCU_BP_GP_CTR_PHASE);
+ cmm_annotate_group_mem_release(&release_group, &rcu_gp.ctr);
+ uatomic_store(&rcu_gp.ctr, rcu_gp.ctr ^ URCU_BP_GP_CTR_PHASE, CMM_RELAXED);
/*
* Must commit qparity update to memory before waiting for other parity
* wait_for_readers() can release and grab again rcu_registry_lock
* internally.
*/
- wait_for_readers(&cur_snap_readers, NULL, &qsreaders);
+ wait_for_readers(&cur_snap_readers, NULL, &qsreaders, &acquire_group);
/*
* Put quiescent reader list back into registry.
* freed.
*/
smp_mb_master();
+ cmm_annotate_group_mb_acquire(&acquire_group);
out:
mutex_unlock(&rcu_registry_lock);
mutex_unlock(&rcu_gp_lock);
void expand_arena(struct registry_arena *arena)
{
struct registry_chunk *new_chunk, *last_chunk;
- size_t old_chunk_len, new_chunk_len;
+ size_t old_chunk_size_bytes, new_chunk_size_bytes, new_capacity;
/* No chunk. */
if (cds_list_empty(&arena->chunk_list)) {
- urcu_posix_assert(ARENA_INIT_ALLOC >=
- sizeof(struct registry_chunk)
- + sizeof(struct rcu_reader));
- new_chunk_len = ARENA_INIT_ALLOC;
+ new_chunk_size_bytes = chunk_allocation_size(INIT_READER_COUNT);
new_chunk = (struct registry_chunk *) mmap(NULL,
- new_chunk_len,
+ new_chunk_size_bytes,
PROT_READ | PROT_WRITE,
MAP_ANONYMOUS | MAP_PRIVATE,
-1, 0);
if (new_chunk == MAP_FAILED)
abort();
- memset(new_chunk, 0, new_chunk_len);
- new_chunk->data_len =
- new_chunk_len - sizeof(struct registry_chunk);
+ memset(new_chunk, 0, new_chunk_size_bytes);
+ new_chunk->capacity = INIT_READER_COUNT;
cds_list_add_tail(&new_chunk->node, &arena->chunk_list);
return; /* We're done. */
}
/* Try expanding last chunk. */
last_chunk = cds_list_entry(arena->chunk_list.prev,
struct registry_chunk, node);
- old_chunk_len =
- last_chunk->data_len + sizeof(struct registry_chunk);
- new_chunk_len = old_chunk_len << 1;
+ old_chunk_size_bytes = chunk_allocation_size(last_chunk->capacity);
+ new_capacity = last_chunk->capacity << 1;
+ new_chunk_size_bytes = chunk_allocation_size(new_capacity);
/* Don't allow memory mapping to move, just expand. */
- new_chunk = mremap_wrapper(last_chunk, old_chunk_len,
- new_chunk_len, 0);
+ new_chunk = mremap_wrapper(last_chunk, old_chunk_size_bytes,
+ new_chunk_size_bytes, 0);
if (new_chunk != MAP_FAILED) {
/* Should not have moved. */
- urcu_posix_assert(new_chunk == last_chunk);
- memset((char *) last_chunk + old_chunk_len, 0,
- new_chunk_len - old_chunk_len);
- last_chunk->data_len =
- new_chunk_len - sizeof(struct registry_chunk);
+ assert(new_chunk == last_chunk);
+ memset((char *) last_chunk + old_chunk_size_bytes, 0,
+ new_chunk_size_bytes - old_chunk_size_bytes);
+ last_chunk->capacity = new_capacity;
return; /* We're done. */
}
/* Remap did not succeed, we need to add a new chunk. */
new_chunk = (struct registry_chunk *) mmap(NULL,
- new_chunk_len,
+ new_chunk_size_bytes,
PROT_READ | PROT_WRITE,
MAP_ANONYMOUS | MAP_PRIVATE,
-1, 0);
if (new_chunk == MAP_FAILED)
abort();
- memset(new_chunk, 0, new_chunk_len);
- new_chunk->data_len =
- new_chunk_len - sizeof(struct registry_chunk);
+ memset(new_chunk, 0, new_chunk_size_bytes);
+ new_chunk->capacity = new_capacity;
cds_list_add_tail(&new_chunk->node, &arena->chunk_list);
}
struct rcu_reader *arena_alloc(struct registry_arena *arena)
{
struct registry_chunk *chunk;
- struct rcu_reader *rcu_reader_reg;
int expand_done = 0; /* Only allow to expand once per alloc */
- size_t len = sizeof(struct rcu_reader);
retry:
cds_list_for_each_entry(chunk, &arena->chunk_list, node) {
- if (chunk->data_len - chunk->used < len)
+ size_t spot_idx;
+
+ /* Skip fully used chunks. */
+ if (chunk->used == chunk->capacity) {
continue;
- /* Find spot */
- for (rcu_reader_reg = (struct rcu_reader *) &chunk->data[0];
- rcu_reader_reg < (struct rcu_reader *) &chunk->data[chunk->data_len];
- rcu_reader_reg++) {
- if (!rcu_reader_reg->alloc) {
- rcu_reader_reg->alloc = 1;
- chunk->used += len;
- return rcu_reader_reg;
+ }
+
+ /* Find a spot. */
+ for (spot_idx = 0; spot_idx < chunk->capacity; spot_idx++) {
+ if (!chunk->readers[spot_idx].alloc) {
+ chunk->readers[spot_idx].alloc = 1;
+ chunk->used++;
+ return &chunk->readers[spot_idx];
}
}
}
cds_list_del(&rcu_reader_reg->node);
rcu_reader_reg->tid = 0;
rcu_reader_reg->alloc = 0;
- chunk->used -= sizeof(struct rcu_reader);
+ chunk->used--;
}
static
struct registry_chunk *chunk;
cds_list_for_each_entry(chunk, ®istry_arena.chunk_list, node) {
- if (rcu_reader_reg < (struct rcu_reader *) &chunk->data[0])
+ if (rcu_reader_reg < (struct urcu_bp_reader *) &chunk->readers[0])
continue;
- if (rcu_reader_reg >= (struct rcu_reader *) &chunk->data[chunk->data_len])
+ if (rcu_reader_reg >= (struct urcu_bp_reader *) &chunk->readers[chunk->capacity])
continue;
return chunk;
}
static
void urcu_bp_exit(void)
{
- urcu_call_rcu_exit();
-
mutex_lock(&init_lock);
if (!--urcu_bp_refcount) {
struct registry_chunk *chunk, *tmp;
cds_list_for_each_entry_safe(chunk, tmp,
®istry_arena.chunk_list, node) {
- munmap((void *) chunk, chunk->data_len
- + sizeof(struct registry_chunk));
+ munmap((void *) chunk, chunk_allocation_size(chunk->capacity));
}
CDS_INIT_LIST_HEAD(®istry_arena.chunk_list);
ret = pthread_key_delete(urcu_bp_key);
mutex_unlock(&init_lock);
}
+static
+void urcu_bp_exit_destructor(void)
+{
+ urcu_call_rcu_exit();
+ urcu_bp_exit();
+}
+
/*
* Holding the rcu_gp_lock and rcu_registry_lock across fork will make
* sure we fork() don't race with a concurrent thread executing with
void urcu_bp_prune_registry(void)
{
struct registry_chunk *chunk;
- struct urcu_bp_reader *rcu_reader_reg;
cds_list_for_each_entry(chunk, ®istry_arena.chunk_list, node) {
- for (rcu_reader_reg = (struct urcu_bp_reader *) &chunk->data[0];
- rcu_reader_reg < (struct urcu_bp_reader *) &chunk->data[chunk->data_len];
- rcu_reader_reg++) {
- if (!rcu_reader_reg->alloc)
+ size_t spot_idx;
+
+ for (spot_idx = 0; spot_idx < chunk->capacity; spot_idx++) {
+ struct urcu_bp_reader *reader = &chunk->readers[spot_idx];
+
+ if (!reader->alloc)
continue;
- if (rcu_reader_reg->tid == pthread_self())
+ if (reader->tid == pthread_self())
continue;
- cleanup_thread(chunk, rcu_reader_reg);
+ cleanup_thread(chunk, reader);
}
}
}
projects / urcu.git / blobdiff