2020-02-18 09:58:34 -05:00
|
|
|
// -*- C++ -*-
|
2021-11-17 16:25:01 -05:00
|
|
|
//===----------------------------------------------------------------------===//
|
2020-02-18 09:58:34 -05:00
|
|
|
//
|
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef _LIBCPP_SEMAPHORE
|
|
|
|
#define _LIBCPP_SEMAPHORE
|
|
|
|
|
|
|
|
/*
|
|
|
|
semaphore synopsis
|
|
|
|
|
|
|
|
namespace std {
|
|
|
|
|
|
|
|
template<ptrdiff_t least_max_value = implementation-defined>
|
2024-07-31 16:53:09 -05:00
|
|
|
class counting_semaphore // since C++20
|
2020-02-18 09:58:34 -05:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
static constexpr ptrdiff_t max() noexcept;
|
|
|
|
|
|
|
|
constexpr explicit counting_semaphore(ptrdiff_t desired);
|
|
|
|
~counting_semaphore();
|
|
|
|
|
|
|
|
counting_semaphore(const counting_semaphore&) = delete;
|
|
|
|
counting_semaphore& operator=(const counting_semaphore&) = delete;
|
|
|
|
|
|
|
|
void release(ptrdiff_t update = 1);
|
|
|
|
void acquire();
|
|
|
|
bool try_acquire() noexcept;
|
|
|
|
template<class Rep, class Period>
|
|
|
|
bool try_acquire_for(const chrono::duration<Rep, Period>& rel_time);
|
|
|
|
template<class Clock, class Duration>
|
|
|
|
bool try_acquire_until(const chrono::time_point<Clock, Duration>& abs_time);
|
|
|
|
|
|
|
|
private:
|
|
|
|
ptrdiff_t counter; // exposition only
|
|
|
|
};
|
|
|
|
|
2024-07-31 16:53:09 -05:00
|
|
|
using binary_semaphore = counting_semaphore<1>; // since C++20
|
2020-02-18 09:58:34 -05:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2024-12-21 13:01:48 +01:00
|
|
|
#if __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS)
|
2025-04-09 15:00:46 +02:00
|
|
|
# include <__cxx03/__config>
|
2024-12-21 13:01:48 +01:00
|
|
|
#else
|
2024-12-10 16:02:12 +01:00
|
|
|
# include <__config>
|
|
|
|
|
|
|
|
# if _LIBCPP_HAS_THREADS
|
|
|
|
|
|
|
|
# include <__assert>
|
|
|
|
# include <__atomic/atomic.h>
|
|
|
|
# include <__atomic/atomic_sync.h>
|
|
|
|
# include <__atomic/memory_order.h>
|
|
|
|
# include <__chrono/time_point.h>
|
|
|
|
# include <__cstddef/ptrdiff_t.h>
|
|
|
|
# include <__thread/poll_with_backoff.h>
|
|
|
|
# include <__thread/support.h>
|
|
|
|
# include <__thread/timed_backoff_policy.h>
|
|
|
|
# include <limits>
|
|
|
|
# include <version>
|
|
|
|
|
|
|
|
# if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
|
|
# pragma GCC system_header
|
|
|
|
# endif
|
2020-02-18 09:58:34 -05:00
|
|
|
|
2020-12-02 18:55:01 -05:00
|
|
|
_LIBCPP_PUSH_MACROS
|
2024-12-10 16:02:12 +01:00
|
|
|
# include <__undef_macros>
|
2020-12-02 18:55:01 -05:00
|
|
|
|
2024-12-10 16:02:12 +01:00
|
|
|
# if _LIBCPP_STD_VER >= 20
|
2020-02-18 09:58:34 -05:00
|
|
|
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
2021-09-20 18:03:49 -04:00
|
|
|
__atomic_semaphore_base is the general-case implementation.
|
2020-12-12 11:57:32 -05:00
|
|
|
It is a typical Dijkstra semaphore algorithm over atomics, wait and notify
|
2020-02-18 09:58:34 -05:00
|
|
|
functions. It avoids contention against users' own use of those facilities.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2024-12-10 16:02:12 +01:00
|
|
|
# define _LIBCPP_SEMAPHORE_MAX (numeric_limits<ptrdiff_t>::max())
|
2023-07-19 17:29:25 -04:00
|
|
|
|
2020-02-18 09:58:34 -05:00
|
|
|
class __atomic_semaphore_base {
|
2024-11-20 00:35:14 +01:00
|
|
|
atomic<ptrdiff_t> __a_;
|
2020-02-18 09:58:34 -05:00
|
|
|
|
|
|
|
public:
|
2022-09-02 16:19:07 +02:00
|
|
|
_LIBCPP_HIDE_FROM_ABI constexpr explicit __atomic_semaphore_base(ptrdiff_t __count) : __a_(__count) {}
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void release(ptrdiff_t __update = 1) {
|
2023-07-19 17:29:25 -04:00
|
|
|
auto __old = __a_.fetch_add(__update, memory_order_release);
|
2024-01-20 23:38:02 -08:00
|
|
|
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(
|
2023-07-19 17:29:25 -04:00
|
|
|
__update <= _LIBCPP_SEMAPHORE_MAX - __old, "update is greater than the expected value");
|
2024-02-05 13:59:48 +00:00
|
|
|
if (__old == 0) {
|
2022-09-02 16:19:07 +02:00
|
|
|
__a_.notify_all();
|
2024-02-05 13:59:48 +00:00
|
|
|
}
|
2020-02-18 09:58:34 -05:00
|
|
|
}
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void acquire() {
|
2024-11-27 14:49:57 -05:00
|
|
|
std::__atomic_wait_unless(__a_, memory_order_relaxed, [this](ptrdiff_t& __old) {
|
|
|
|
return __try_acquire_impl(__old);
|
|
|
|
});
|
2020-02-18 09:58:34 -05:00
|
|
|
}
|
2023-07-24 19:53:39 -07:00
|
|
|
template <class _Rep, class _Period>
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool
|
2023-07-24 19:53:39 -07:00
|
|
|
try_acquire_for(chrono::duration<_Rep, _Period> const& __rel_time) {
|
|
|
|
if (__rel_time == chrono::duration<_Rep, _Period>::zero())
|
2021-11-04 17:58:33 -04:00
|
|
|
return try_acquire();
|
2024-02-05 13:59:48 +00:00
|
|
|
auto const __poll_fn = [this]() { return try_acquire(); };
|
|
|
|
return std::__libcpp_thread_poll_with_backoff(__poll_fn, __libcpp_timed_backoff_policy(), __rel_time);
|
2020-02-18 09:58:34 -05:00
|
|
|
}
|
2021-11-04 17:58:33 -04:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool try_acquire() {
|
[libc++] Refactor the predicate taking variant of `__cxx_atomic_wait` (#80596)
This is a follow-up PR to
<https://github.com/llvm/llvm-project/pull/79265>. It aims to be a
gentle refactoring of the `__cxx_atomic_wait` function that takes a
predicate.
The key idea here is that this function's signature is changed to look
like this (`std::function` used just for clarity):
```c++
__cxx_atomic_wait_fn(Atp*, std::function<bool(Tp &)> poll, memory_order __order);
```
...where `Tp` is the corresponding `value_type` to the atomic variable
type `Atp`. The function's semantics are similar to `atomic`s `.wait()`,
but instead of having a hardcoded predicate (is the loaded value unequal
to `old`?) the predicate is specified explicitly.
The `poll` function may change its argument, and it is very important
that if it returns `false`, it leaves its current understanding of the
atomic's value in the argument. Internally, `__cxx_atomic_wait_fn`
dispatches to two waiting mechanisms, depending on the type of the
atomic variable:
1. If the atomic variable can be waited on directly (for example,
Linux's futex mechanism only supports waiting on 32 bit long variables),
the value of the atomic variable (which `poll` made its decision on) is
then given to the underlying system wait function (e.g. futex).
2. If the atomic variable can not be waited on directly, there is a
global pool of atomics that are used for this task. The ["eventcount"
pattern](<https://gist.github.com/mratsim/04a29bdd98d6295acda4d0677c4d0041>)
is employed to make this possible.
The eventcount pattern needs a "monitor" variable which is read before
the condition is checked another time. libcxx has the
`__libcpp_atomic_monitor` function for this. However, this function only
has to be called in case "2", i.e. when the eventcount is actually used.
In case "1", the futex is used directly, so the monitor must be the
value of the atomic variable that the `poll` function made its decision
on to continue blocking. Previously, `__libcpp_atomic_monitor` was
_also_ used in case "1". This was the source of the ABA style bug that
PR#79265 fixed.
However, the solution in PR#79265 has some disadvantages:
- It exposes internals such as `cxx_contention_t` or the fact that
`__libcpp_thread_poll_with_backoff` needs two functions to higher level
constructs such as `semaphore`.
- It doesn't prevent consumers calling `__cxx_atomic_wait` in an error
prone way, i.e. by providing to it a predicate that doesn't take an
argument. This makes ABA style issues more likely to appear.
Now, `__cxx_atomic_wait_fn` takes just _one_ function, which is then
transformed into the `poll` and `backoff` callables needed by
`__libcpp_thread_poll_with_backoff`.
Aside from the `__cxx_atomic_wait` changes, the only other change is the
weakening of the initial atomic load of `semaphore`'s `try_acquire` into
`memory_order_relaxed` and the CAS inside the loop is changed from
`strong` to `weak`. Both weakenings should be fine, since the CAS is
called in a loop, and the "acquire" semantics of `try_acquire` come from
the CAS, not from the initial load.
2024-02-19 15:28:51 +01:00
|
|
|
auto __old = __a_.load(memory_order_relaxed);
|
2024-02-05 13:59:48 +00:00
|
|
|
return __try_acquire_impl(__old);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool __try_acquire_impl(ptrdiff_t& __old) {
|
2021-11-04 17:58:33 -04:00
|
|
|
while (true) {
|
|
|
|
if (__old == 0)
|
|
|
|
return false;
|
[libc++] Refactor the predicate taking variant of `__cxx_atomic_wait` (#80596)
This is a follow-up PR to
<https://github.com/llvm/llvm-project/pull/79265>. It aims to be a
gentle refactoring of the `__cxx_atomic_wait` function that takes a
predicate.
The key idea here is that this function's signature is changed to look
like this (`std::function` used just for clarity):
```c++
__cxx_atomic_wait_fn(Atp*, std::function<bool(Tp &)> poll, memory_order __order);
```
...where `Tp` is the corresponding `value_type` to the atomic variable
type `Atp`. The function's semantics are similar to `atomic`s `.wait()`,
but instead of having a hardcoded predicate (is the loaded value unequal
to `old`?) the predicate is specified explicitly.
The `poll` function may change its argument, and it is very important
that if it returns `false`, it leaves its current understanding of the
atomic's value in the argument. Internally, `__cxx_atomic_wait_fn`
dispatches to two waiting mechanisms, depending on the type of the
atomic variable:
1. If the atomic variable can be waited on directly (for example,
Linux's futex mechanism only supports waiting on 32 bit long variables),
the value of the atomic variable (which `poll` made its decision on) is
then given to the underlying system wait function (e.g. futex).
2. If the atomic variable can not be waited on directly, there is a
global pool of atomics that are used for this task. The ["eventcount"
pattern](<https://gist.github.com/mratsim/04a29bdd98d6295acda4d0677c4d0041>)
is employed to make this possible.
The eventcount pattern needs a "monitor" variable which is read before
the condition is checked another time. libcxx has the
`__libcpp_atomic_monitor` function for this. However, this function only
has to be called in case "2", i.e. when the eventcount is actually used.
In case "1", the futex is used directly, so the monitor must be the
value of the atomic variable that the `poll` function made its decision
on to continue blocking. Previously, `__libcpp_atomic_monitor` was
_also_ used in case "1". This was the source of the ABA style bug that
PR#79265 fixed.
However, the solution in PR#79265 has some disadvantages:
- It exposes internals such as `cxx_contention_t` or the fact that
`__libcpp_thread_poll_with_backoff` needs two functions to higher level
constructs such as `semaphore`.
- It doesn't prevent consumers calling `__cxx_atomic_wait` in an error
prone way, i.e. by providing to it a predicate that doesn't take an
argument. This makes ABA style issues more likely to appear.
Now, `__cxx_atomic_wait_fn` takes just _one_ function, which is then
transformed into the `poll` and `backoff` callables needed by
`__libcpp_thread_poll_with_backoff`.
Aside from the `__cxx_atomic_wait` changes, the only other change is the
weakening of the initial atomic load of `semaphore`'s `try_acquire` into
`memory_order_relaxed` and the CAS inside the loop is changed from
`strong` to `weak`. Both weakenings should be fine, since the CAS is
called in a loop, and the "acquire" semantics of `try_acquire` come from
the CAS, not from the initial load.
2024-02-19 15:28:51 +01:00
|
|
|
if (__a_.compare_exchange_weak(__old, __old - 1, memory_order_acquire, memory_order_relaxed))
|
2021-11-04 17:58:33 -04:00
|
|
|
return true;
|
|
|
|
}
|
2023-12-18 14:01:33 -05:00
|
|
|
}
|
2020-02-18 09:58:34 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
template <ptrdiff_t __least_max_value = _LIBCPP_SEMAPHORE_MAX>
|
2024-07-31 16:53:09 -05:00
|
|
|
class counting_semaphore {
|
2022-09-02 16:19:07 +02:00
|
|
|
__atomic_semaphore_base __semaphore_;
|
2020-02-18 09:58:34 -05:00
|
|
|
|
|
|
|
public:
|
2023-07-19 17:29:25 -04:00
|
|
|
static_assert(__least_max_value >= 0, "The least maximum value must be a positive number");
|
2023-12-18 14:01:33 -05:00
|
|
|
|
2020-02-18 09:58:34 -05:00
|
|
|
static constexpr ptrdiff_t max() noexcept { return __least_max_value; }
|
2023-12-18 14:01:33 -05:00
|
|
|
|
2023-07-19 17:29:25 -04:00
|
|
|
_LIBCPP_HIDE_FROM_ABI constexpr explicit counting_semaphore(ptrdiff_t __count) : __semaphore_(__count) {
|
2024-01-20 23:38:02 -08:00
|
|
|
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(
|
2023-07-19 17:29:25 -04:00
|
|
|
__count >= 0,
|
|
|
|
"counting_semaphore::counting_semaphore(ptrdiff_t): counting_semaphore cannot be "
|
|
|
|
"initialized with a negative value");
|
2024-01-20 23:38:02 -08:00
|
|
|
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(
|
2023-07-19 17:29:25 -04:00
|
|
|
__count <= max(),
|
|
|
|
"counting_semaphore::counting_semaphore(ptrdiff_t): counting_semaphore cannot be "
|
|
|
|
"initialized with a value greater than max()");
|
|
|
|
}
|
2020-02-18 09:58:34 -05:00
|
|
|
~counting_semaphore() = default;
|
2023-12-18 14:01:33 -05:00
|
|
|
|
2020-02-18 09:58:34 -05:00
|
|
|
counting_semaphore(const counting_semaphore&) = delete;
|
|
|
|
counting_semaphore& operator=(const counting_semaphore&) = delete;
|
2023-12-18 14:01:33 -05:00
|
|
|
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void release(ptrdiff_t __update = 1) {
|
2024-01-20 23:38:02 -08:00
|
|
|
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(__update >= 0, "counting_semaphore:release called with a negative value");
|
2022-09-02 16:19:07 +02:00
|
|
|
__semaphore_.release(__update);
|
2020-02-18 09:58:34 -05:00
|
|
|
}
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void acquire() { __semaphore_.acquire(); }
|
2023-07-24 19:53:39 -07:00
|
|
|
template <class _Rep, class _Period>
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool
|
2023-07-24 19:53:39 -07:00
|
|
|
try_acquire_for(chrono::duration<_Rep, _Period> const& __rel_time) {
|
2022-09-02 16:19:07 +02:00
|
|
|
return __semaphore_.try_acquire_for(chrono::duration_cast<chrono::nanoseconds>(__rel_time));
|
2020-02-18 09:58:34 -05:00
|
|
|
}
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool try_acquire() { return __semaphore_.try_acquire(); }
|
2023-07-24 19:53:39 -07:00
|
|
|
template <class _Clock, class _Duration>
|
2020-02-24 10:09:29 -05:00
|
|
|
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool
|
2023-07-24 19:53:39 -07:00
|
|
|
try_acquire_until(chrono::time_point<_Clock, _Duration> const& __abs_time) {
|
|
|
|
auto const __current = _Clock::now();
|
2023-02-10 16:25:40 +01:00
|
|
|
if (__current >= __abs_time)
|
2020-02-18 09:58:34 -05:00
|
|
|
return try_acquire();
|
|
|
|
else
|
2023-02-10 16:25:40 +01:00
|
|
|
return try_acquire_for(__abs_time - __current);
|
2020-02-18 09:58:34 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2024-07-31 16:53:09 -05:00
|
|
|
using binary_semaphore = counting_semaphore<1>;
|
2020-02-18 09:58:34 -05:00
|
|
|
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
|
2024-12-10 16:02:12 +01:00
|
|
|
# endif // _LIBCPP_STD_VER >= 20
|
2020-02-24 18:12:44 -05:00
|
|
|
|
2020-12-02 18:55:01 -05:00
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
|
2024-12-10 16:02:12 +01:00
|
|
|
# endif // _LIBCPP_HAS_THREADS
|
2024-07-15 09:11:23 -05:00
|
|
|
|
2024-12-10 16:02:12 +01:00
|
|
|
# if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
|
|
|
|
# include <atomic>
|
|
|
|
# include <cstddef>
|
|
|
|
# endif
|
2024-12-21 13:01:48 +01:00
|
|
|
#endif // __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS)
|
2023-01-31 19:23:30 +01:00
|
|
|
|
2024-07-31 16:53:09 -05:00
|
|
|
#endif // _LIBCPP_SEMAPHORE
|