Tony Finch
36e56923ce
Add a singly-linked stack that supports lock-free prepend and drain (to empty the list and clean up its elements). Intended for use with QSBR to collect objects that need safe memory reclamation, or any other user that works with adding objects to the stack and then draining them in one go like various work queues. In <isc/atomic.h>, add an `atomic_ptr()` macro to make type declarations a little less abominable, and clean up a duplicate definition of `atomic_compare_exchange_strong_acq_rel()`
78 lines
3.0 KiB
C
78 lines
3.0 KiB
C
/*
|
|
* Copyright (C) Internet Systems Consortium, Inc. ("ISC")
|
|
*
|
|
* SPDX-License-Identifier: MPL-2.0
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, you can obtain one at https://mozilla.org/MPL/2.0/.
|
|
*
|
|
* See the COPYRIGHT file distributed with this work for additional
|
|
* information regarding copyright ownership.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <stdatomic.h>
|
|
|
|
#include <isc/util.h>
|
|
|
|
/*
|
|
* We define a few additional macros to make things easier
|
|
*/
|
|
|
|
/* Relaxed Memory Ordering */
|
|
|
|
#define atomic_store_relaxed(o, v) \
|
|
atomic_store_explicit((o), (v), memory_order_relaxed)
|
|
#define atomic_load_relaxed(o) atomic_load_explicit((o), memory_order_relaxed)
|
|
#define atomic_fetch_add_relaxed(o, v) \
|
|
atomic_fetch_add_explicit((o), (v), memory_order_relaxed)
|
|
#define atomic_fetch_sub_relaxed(o, v) \
|
|
atomic_fetch_sub_explicit((o), (v), memory_order_relaxed)
|
|
#define atomic_fetch_or_relaxed(o, v) \
|
|
atomic_fetch_or_explicit((o), (v), memory_order_relaxed)
|
|
#define atomic_fetch_and_relaxed(o, v) \
|
|
atomic_fetch_and_explicit((o), (v), memory_order_relaxed)
|
|
#define atomic_exchange_relaxed(o, v) \
|
|
atomic_exchange_explicit((o), (v), memory_order_relaxed)
|
|
#define atomic_compare_exchange_weak_relaxed(o, e, d) \
|
|
atomic_compare_exchange_weak_explicit( \
|
|
(o), (e), (d), memory_order_relaxed, memory_order_relaxed)
|
|
#define atomic_compare_exchange_strong_relaxed(o, e, d) \
|
|
atomic_compare_exchange_strong_explicit( \
|
|
(o), (e), (d), memory_order_relaxed, memory_order_relaxed)
|
|
|
|
/* Acquire-Release Memory Ordering */
|
|
|
|
#define atomic_store_release(o, v) \
|
|
atomic_store_explicit((o), (v), memory_order_release)
|
|
#define atomic_load_acquire(o) atomic_load_explicit((o), memory_order_acquire)
|
|
#define atomic_fetch_add_release(o, v) \
|
|
atomic_fetch_add_explicit((o), (v), memory_order_release)
|
|
#define atomic_fetch_sub_release(o, v) \
|
|
atomic_fetch_sub_explicit((o), (v), memory_order_release)
|
|
#define atomic_fetch_and_release(o, v) \
|
|
atomic_fetch_and_explicit((o), (v), memory_order_release)
|
|
#define atomic_fetch_or_release(o, v) \
|
|
atomic_fetch_or_explicit((o), (v), memory_order_release)
|
|
#define atomic_exchange_acquire(o, v) \
|
|
atomic_exchange_explicit((o), (v), memory_order_acquire)
|
|
#define atomic_exchange_acq_rel(o, v) \
|
|
atomic_exchange_explicit((o), (v), memory_order_acq_rel)
|
|
#define atomic_fetch_sub_acq_rel(o, v) \
|
|
atomic_fetch_sub_explicit((o), (v), memory_order_acq_rel)
|
|
#define atomic_compare_exchange_weak_acq_rel(o, e, d) \
|
|
atomic_compare_exchange_weak_explicit( \
|
|
(o), (e), (d), memory_order_acq_rel, memory_order_acquire)
|
|
#define atomic_compare_exchange_strong_acq_rel(o, e, d) \
|
|
atomic_compare_exchange_strong_explicit( \
|
|
(o), (e), (d), memory_order_acq_rel, memory_order_acquire)
|
|
|
|
/* compare/exchange that MUST succeed */
|
|
#define atomic_compare_exchange_enforced(o, e, d) \
|
|
RUNTIME_CHECK(atomic_compare_exchange_strong((o), (e), (d)))
|
|
|
|
/* more comfortable atomic pointer declarations */
|
|
#define atomic_ptr(type) _Atomic(type *)
|