| 1 | // -*- C++ -*- |
| 2 | //===----------------------------------------------------------------------===// |
| 3 | // |
| 4 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 5 | // See https://llvm.org/LICENSE.txt for license information. |
| 6 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | #ifndef _LIBCPP_SEMAPHORE |
| 11 | #define _LIBCPP_SEMAPHORE |
| 12 | |
| 13 | /* |
| 14 | semaphore synopsis |
| 15 | |
| 16 | namespace std { |
| 17 | |
| 18 | template<ptrdiff_t least_max_value = implementation-defined> |
| 19 | class counting_semaphore // since C++20 |
| 20 | { |
| 21 | public: |
| 22 | static constexpr ptrdiff_t max() noexcept; |
| 23 | |
| 24 | constexpr explicit counting_semaphore(ptrdiff_t desired); |
| 25 | ~counting_semaphore(); |
| 26 | |
| 27 | counting_semaphore(const counting_semaphore&) = delete; |
| 28 | counting_semaphore& operator=(const counting_semaphore&) = delete; |
| 29 | |
| 30 | void release(ptrdiff_t update = 1); |
| 31 | void acquire(); |
| 32 | bool try_acquire() noexcept; |
| 33 | template<class Rep, class Period> |
| 34 | bool try_acquire_for(const chrono::duration<Rep, Period>& rel_time); |
| 35 | template<class Clock, class Duration> |
| 36 | bool try_acquire_until(const chrono::time_point<Clock, Duration>& abs_time); |
| 37 | |
| 38 | private: |
| 39 | ptrdiff_t counter; // exposition only |
| 40 | }; |
| 41 | |
| 42 | using binary_semaphore = counting_semaphore<1>; // since C++20 |
| 43 | |
| 44 | } |
| 45 | |
| 46 | */ |
| 47 | |
| 48 | #if __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS) |
| 49 | # include <__cxx03/__config> |
| 50 | #else |
| 51 | # include <__config> |
| 52 | |
| 53 | # if _LIBCPP_HAS_THREADS |
| 54 | |
| 55 | # include <__assert> |
| 56 | # include <__atomic/atomic.h> |
| 57 | # include <__atomic/atomic_sync.h> |
| 58 | # include <__atomic/atomic_sync_timed.h> |
| 59 | # include <__atomic/memory_order.h> |
| 60 | # include <__chrono/time_point.h> |
| 61 | # include <__cstddef/ptrdiff_t.h> |
| 62 | # include <__thread/support.h> |
| 63 | # include <limits> |
| 64 | # include <version> |
| 65 | |
| 66 | # if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) |
| 67 | # pragma GCC system_header |
| 68 | # endif |
| 69 | |
| 70 | _LIBCPP_PUSH_MACROS |
| 71 | # include <__undef_macros> |
| 72 | |
| 73 | # if _LIBCPP_STD_VER >= 20 |
| 74 | |
| 75 | _LIBCPP_BEGIN_NAMESPACE_STD |
| 76 | |
| 77 | /* |
| 78 | |
| 79 | __atomic_semaphore_base is the general-case implementation. |
| 80 | It is a typical Dijkstra semaphore algorithm over atomics, wait and notify |
| 81 | functions. It avoids contention against users' own use of those facilities. |
| 82 | |
| 83 | */ |
| 84 | |
| 85 | # define _LIBCPP_SEMAPHORE_MAX (numeric_limits<ptrdiff_t>::max()) |
| 86 | |
| 87 | class __atomic_semaphore_base { |
| 88 | atomic<ptrdiff_t> __a_; |
| 89 | |
| 90 | public: |
| 91 | _LIBCPP_HIDE_FROM_ABI constexpr explicit __atomic_semaphore_base(ptrdiff_t __count) : __a_(__count) {} |
| 92 | _LIBCPP_HIDE_FROM_ABI void release(ptrdiff_t __update = 1) { |
| 93 | auto __old = __a_.fetch_add(__update, memory_order_release); |
| 94 | _LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN( |
| 95 | __update <= _LIBCPP_SEMAPHORE_MAX - __old, "update is greater than the expected value"); |
| 96 | if (__old == 0) { |
| 97 | __a_.notify_all(); |
| 98 | } |
| 99 | } |
| 100 | _LIBCPP_HIDE_FROM_ABI void acquire() { |
| 101 | std::__atomic_wait_unless(__a_, memory_order_relaxed, [this](ptrdiff_t& __old) { |
| 102 | return __try_acquire_impl(__old); |
| 103 | }); |
| 104 | } |
| 105 | template <class _Rep, class _Period> |
| 106 | _LIBCPP_HIDE_FROM_ABI bool try_acquire_for(chrono::duration<_Rep, _Period> const& __rel_time) { |
| 107 | if (__rel_time == chrono::duration<_Rep, _Period>::zero()) |
| 108 | return try_acquire(); |
| 109 | |
| 110 | return std::__atomic_wait_unless_with_timeout( |
| 111 | __a_, memory_order_relaxed, [this](ptrdiff_t& __old) { return __try_acquire_impl(__old); }, __rel_time); |
| 112 | } |
| 113 | _LIBCPP_HIDE_FROM_ABI bool try_acquire() { |
| 114 | auto __old = __a_.load(memory_order_relaxed); |
| 115 | return __try_acquire_impl(__old); |
| 116 | } |
| 117 | |
| 118 | private: |
| 119 | _LIBCPP_HIDE_FROM_ABI bool __try_acquire_impl(ptrdiff_t& __old) { |
| 120 | while (true) { |
| 121 | if (__old == 0) |
| 122 | return false; |
| 123 | if (__a_.compare_exchange_weak(__old, __old - 1, memory_order_acquire, memory_order_relaxed)) |
| 124 | return true; |
| 125 | } |
| 126 | } |
| 127 | }; |
| 128 | |
| 129 | template <ptrdiff_t __least_max_value = _LIBCPP_SEMAPHORE_MAX> |
| 130 | class counting_semaphore { |
| 131 | __atomic_semaphore_base __semaphore_; |
| 132 | |
| 133 | public: |
| 134 | static_assert(__least_max_value >= 0, "The least maximum value must be a positive number"); |
| 135 | |
| 136 | [[nodiscard]] static constexpr ptrdiff_t max() noexcept { return __least_max_value; } |
| 137 | |
| 138 | _LIBCPP_HIDE_FROM_ABI constexpr explicit counting_semaphore(ptrdiff_t __count) : __semaphore_(__count) { |
| 139 | _LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN( |
| 140 | __count >= 0, |
| 141 | "counting_semaphore::counting_semaphore(ptrdiff_t): counting_semaphore cannot be " |
| 142 | "initialized with a negative value"); |
| 143 | _LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN( |
| 144 | __count <= max(), |
| 145 | "counting_semaphore::counting_semaphore(ptrdiff_t): counting_semaphore cannot be " |
| 146 | "initialized with a value greater than max()"); |
| 147 | } |
| 148 | ~counting_semaphore() = default; |
| 149 | |
| 150 | counting_semaphore(const counting_semaphore&) = delete; |
| 151 | counting_semaphore& operator=(const counting_semaphore&) = delete; |
| 152 | |
| 153 | _LIBCPP_HIDE_FROM_ABI void release(ptrdiff_t __update = 1) { |
| 154 | _LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(__update >= 0, "counting_semaphore:release called with a negative value"); |
| 155 | __semaphore_.release(__update); |
| 156 | } |
| 157 | _LIBCPP_HIDE_FROM_ABI void acquire() { __semaphore_.acquire(); } |
| 158 | template <class _Rep, class _Period> |
| 159 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI bool try_acquire_for(chrono::duration<_Rep, _Period> const& __rel_time) { |
| 160 | return __semaphore_.try_acquire_for(chrono::duration_cast<chrono::nanoseconds>(__rel_time)); |
| 161 | } |
| 162 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI bool try_acquire() { return __semaphore_.try_acquire(); } |
| 163 | template <class _Clock, class _Duration> |
| 164 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI bool try_acquire_until(chrono::time_point<_Clock, _Duration> const& __abs_time) { |
| 165 | auto const __current = _Clock::now(); |
| 166 | if (__current >= __abs_time) |
| 167 | return try_acquire(); |
| 168 | else |
| 169 | return try_acquire_for(__abs_time - __current); |
| 170 | } |
| 171 | }; |
| 172 | |
| 173 | using binary_semaphore = counting_semaphore<1>; |
| 174 | |
| 175 | _LIBCPP_END_NAMESPACE_STD |
| 176 | |
| 177 | # endif // _LIBCPP_STD_VER >= 20 |
| 178 | |
| 179 | _LIBCPP_POP_MACROS |
| 180 | |
| 181 | # endif // _LIBCPP_HAS_THREADS |
| 182 | |
| 183 | # if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 |
| 184 | # include <atomic> |
| 185 | # include <cstddef> |
| 186 | # endif |
| 187 | #endif // __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS) |
| 188 | |
| 189 | #endif // _LIBCPP_SEMAPHORE |