X-Git-Url: https://git.lttng.org/?a=blobdiff_plain;f=include%2Furcu%2Fstatic%2Furcu-bp.h;h=e660154094e7a3f568798f329ba121302788e8ce;hb=HEAD;hp=7f5d8736f4cd3b9c03cfb1617646bd9b1eb07df6;hpb=2a27e9319bacc9bc98f38afb7e4f050601ab979b;p=urcu.git diff --git a/include/urcu/static/urcu-bp.h b/include/urcu/static/urcu-bp.h index 7f5d873..e660154 100644 --- a/include/urcu/static/urcu-bp.h +++ b/include/urcu/static/urcu-bp.h @@ -1,31 +1,17 @@ +// SPDX-FileCopyrightText: 2009 Mathieu Desnoyers +// SPDX-FileCopyrightText: 2009 Paul E. McKenney, IBM Corporation. +// +// SPDX-License-Identifier: LGPL-2.1-or-later + #ifndef _URCU_BP_STATIC_H #define _URCU_BP_STATIC_H /* - * urcu-bp-static.h - * * Userspace RCU header. * * TO BE INCLUDED ONLY IN CODE THAT IS TO BE RECOMPILED ON EACH LIBURCU * RELEASE. See urcu.h for linking dynamically with the userspace rcu library. * - * Copyright (c) 2009 Mathieu Desnoyers - * 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. */ @@ -33,6 +19,8 @@ #include #include +#include +#include #include #include #include @@ -40,7 +28,6 @@ #include #include #include -#include /* * This code section can only be included in LGPL 2.1 compatible source code. @@ -117,7 +104,8 @@ static inline void urcu_bp_smp_mb_slave(void) cmm_smp_mb(); } -static inline enum urcu_bp_state urcu_bp_reader_state(unsigned long *ctr) +static inline enum urcu_bp_state urcu_bp_reader_state(unsigned long *ctr, + cmm_annotate_t *group) { unsigned long v; @@ -127,7 +115,9 @@ static inline enum urcu_bp_state urcu_bp_reader_state(unsigned long *ctr) * Make sure both tests below are done on the same version of *value * to insure consistency. */ - v = CMM_LOAD_SHARED(*ctr); + v = uatomic_load(ctr, CMM_RELAXED); + cmm_annotate_group_mem_acquire(group, ctr); + if (!(v & URCU_BP_GP_CTR_NEST_MASK)) return URCU_BP_READER_INACTIVE; if (!((v ^ urcu_bp_gp.ctr) & URCU_BP_GP_CTR_PHASE)) @@ -137,9 +127,9 @@ static inline enum urcu_bp_state urcu_bp_reader_state(unsigned long *ctr) /* * Helper for _urcu_bp_read_lock(). The format of urcu_bp_gp.ctr (as well as - * the per-thread rcu_reader.ctr) has the upper bits containing a count of - * _urcu_bp_read_lock() nesting, and a lower-order bit that contains either zero - * or URCU_BP_GP_CTR_PHASE. The smp_mb_slave() ensures that the accesses in + * the per-thread rcu_reader.ctr) has the lower-order bits containing a count of + * _urcu_bp_read_lock() nesting, and a single high-order URCU_BP_GP_CTR_PHASE bit + * that contains either zero or one. The smp_mb_slave() ensures that the accesses in * _urcu_bp_read_lock() happen before the subsequent read-side critical section. */ static inline void _urcu_bp_read_lock_update(unsigned long tmp) @@ -181,12 +171,14 @@ static inline void _urcu_bp_read_lock(void) static inline void _urcu_bp_read_unlock(void) { unsigned long tmp; + unsigned long *ctr = &URCU_TLS(urcu_bp_reader)->ctr; tmp = URCU_TLS(urcu_bp_reader)->ctr; urcu_assert_debug(tmp & URCU_BP_GP_CTR_NEST_MASK); /* Finish using rcu before decrementing the pointer. */ urcu_bp_smp_mb_slave(); - _CMM_STORE_SHARED(URCU_TLS(urcu_bp_reader)->ctr, tmp - URCU_BP_GP_COUNT); + cmm_annotate_mem_release(ctr); + uatomic_store(ctr, tmp - URCU_BP_GP_COUNT, CMM_RELAXED); cmm_barrier(); /* Ensure the compiler does not reorder us with mutex */ }