mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-06-27 06:48:31 +00:00
Release Cosmopolitan v3.6.0
This release is an atomic upgrade to GCC 14.1.0 with C23 and C++23
This commit is contained in:
Justine Tunney
parent
62ace3623a
commit
5660ec4741
1585 changed files with 117353 additions and 271644 deletions
210
third_party/libcxx/semaphore
vendored
210
third_party/libcxx/semaphore
vendored
|
|
@ -45,31 +45,30 @@ using binary_semaphore = counting_semaphore<1>;
|
|||
|
||||
*/
|
||||
|
||||
#include <__assert> // all public C++ headers provide the assertion handler
|
||||
#include <__atomic/atomic_base.h>
|
||||
#include <__atomic/atomic_sync.h>
|
||||
#include <__atomic/memory_order.h>
|
||||
#include <__availability>
|
||||
#include <__chrono/time_point.h>
|
||||
#include <__config>
|
||||
#include <__thread/timed_backoff_policy.h>
|
||||
#include <__threading_support>
|
||||
#include <cstddef>
|
||||
#include <limits>
|
||||
#include <version>
|
||||
|
||||
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
||||
# pragma GCC system_header
|
||||
#endif
|
||||
#if !defined(_LIBCPP_HAS_NO_THREADS)
|
||||
|
||||
#ifdef _LIBCPP_HAS_NO_THREADS
|
||||
# error "<semaphore> is not supported since libc++ has been configured without support for threads."
|
||||
#endif
|
||||
# include <__assert>
|
||||
# include <__atomic/atomic_base.h>
|
||||
# include <__atomic/atomic_sync.h>
|
||||
# include <__atomic/memory_order.h>
|
||||
# include <__chrono/time_point.h>
|
||||
# include <__thread/poll_with_backoff.h>
|
||||
# include <__thread/support.h>
|
||||
# include <__thread/timed_backoff_policy.h>
|
||||
# include <cstddef>
|
||||
# include <limits>
|
||||
# include <version>
|
||||
|
||||
# if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
||||
# pragma GCC system_header
|
||||
# endif
|
||||
|
||||
_LIBCPP_PUSH_MACROS
|
||||
#include <__undef_macros>
|
||||
# include <__undef_macros>
|
||||
|
||||
#if _LIBCPP_STD_VER >= 14
|
||||
# if _LIBCPP_STD_VER >= 14
|
||||
|
||||
_LIBCPP_BEGIN_NAMESPACE_STD
|
||||
|
||||
|
|
@ -81,116 +80,107 @@ functions. It avoids contention against users' own use of those facilities.
|
|||
|
||||
*/
|
||||
|
||||
class __atomic_semaphore_base
|
||||
{
|
||||
__atomic_base<ptrdiff_t> __a_;
|
||||
# define _LIBCPP_SEMAPHORE_MAX (numeric_limits<ptrdiff_t>::max())
|
||||
|
||||
class __atomic_semaphore_base {
|
||||
__atomic_base<ptrdiff_t> __a_;
|
||||
|
||||
public:
|
||||
_LIBCPP_INLINE_VISIBILITY
|
||||
constexpr explicit __atomic_semaphore_base(ptrdiff_t __count) : __a_(__count)
|
||||
{
|
||||
_LIBCPP_HIDE_FROM_ABI constexpr explicit __atomic_semaphore_base(ptrdiff_t __count) : __a_(__count) {}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void release(ptrdiff_t __update = 1) {
|
||||
auto __old = __a_.fetch_add(__update, memory_order_release);
|
||||
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(
|
||||
__update <= _LIBCPP_SEMAPHORE_MAX - __old, "update is greater than the expected value");
|
||||
if (__old == 0) {
|
||||
__a_.notify_all();
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
void release(ptrdiff_t __update = 1)
|
||||
{
|
||||
if(0 < __a_.fetch_add(__update, memory_order_release))
|
||||
;
|
||||
else if(__update > 1)
|
||||
__a_.notify_all();
|
||||
else
|
||||
__a_.notify_one();
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
void acquire()
|
||||
{
|
||||
auto const __test_fn = [this]() -> bool {
|
||||
auto __old = __a_.load(memory_order_relaxed);
|
||||
return (__old != 0) && __a_.compare_exchange_strong(__old, __old - 1, memory_order_acquire, memory_order_relaxed);
|
||||
};
|
||||
__cxx_atomic_wait(&__a_.__a_, __test_fn);
|
||||
}
|
||||
template <class Rep, class Period>
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
bool try_acquire_for(chrono::duration<Rep, Period> const& __rel_time)
|
||||
{
|
||||
if (__rel_time == chrono::duration<Rep, Period>::zero())
|
||||
return try_acquire();
|
||||
auto const __test_fn = [this]() { return try_acquire(); };
|
||||
return std::__libcpp_thread_poll_with_backoff(__test_fn, __libcpp_timed_backoff_policy(), __rel_time);
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
bool try_acquire()
|
||||
{
|
||||
auto __old = __a_.load(memory_order_acquire);
|
||||
while (true) {
|
||||
if (__old == 0)
|
||||
return false;
|
||||
if (__a_.compare_exchange_strong(__old, __old - 1, memory_order_acquire, memory_order_relaxed))
|
||||
return true;
|
||||
}
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void acquire() {
|
||||
std::__atomic_wait_unless(
|
||||
__a_, [this](ptrdiff_t& __old) { return __try_acquire_impl(__old); }, memory_order_relaxed);
|
||||
}
|
||||
template <class _Rep, class _Period>
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool
|
||||
try_acquire_for(chrono::duration<_Rep, _Period> const& __rel_time) {
|
||||
if (__rel_time == chrono::duration<_Rep, _Period>::zero())
|
||||
return try_acquire();
|
||||
auto const __poll_fn = [this]() { return try_acquire(); };
|
||||
return std::__libcpp_thread_poll_with_backoff(__poll_fn, __libcpp_timed_backoff_policy(), __rel_time);
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool try_acquire() {
|
||||
auto __old = __a_.load(memory_order_relaxed);
|
||||
return __try_acquire_impl(__old);
|
||||
}
|
||||
|
||||
private:
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool __try_acquire_impl(ptrdiff_t& __old) {
|
||||
while (true) {
|
||||
if (__old == 0)
|
||||
return false;
|
||||
if (__a_.compare_exchange_weak(__old, __old - 1, memory_order_acquire, memory_order_relaxed))
|
||||
return true;
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
#define _LIBCPP_SEMAPHORE_MAX (numeric_limits<ptrdiff_t>::max())
|
||||
|
||||
template<ptrdiff_t __least_max_value = _LIBCPP_SEMAPHORE_MAX>
|
||||
class counting_semaphore
|
||||
{
|
||||
__atomic_semaphore_base __semaphore_;
|
||||
template <ptrdiff_t __least_max_value = _LIBCPP_SEMAPHORE_MAX>
|
||||
class _LIBCPP_DEPRECATED_ATOMIC_SYNC counting_semaphore {
|
||||
__atomic_semaphore_base __semaphore_;
|
||||
|
||||
public:
|
||||
static constexpr ptrdiff_t max() noexcept {
|
||||
return __least_max_value;
|
||||
}
|
||||
static_assert(__least_max_value >= 0, "The least maximum value must be a positive number");
|
||||
|
||||
_LIBCPP_INLINE_VISIBILITY
|
||||
constexpr explicit counting_semaphore(ptrdiff_t __count) : __semaphore_(__count) { }
|
||||
~counting_semaphore() = default;
|
||||
static constexpr ptrdiff_t max() noexcept { return __least_max_value; }
|
||||
|
||||
counting_semaphore(const counting_semaphore&) = delete;
|
||||
counting_semaphore& operator=(const counting_semaphore&) = delete;
|
||||
_LIBCPP_HIDE_FROM_ABI constexpr explicit counting_semaphore(ptrdiff_t __count) : __semaphore_(__count) {
|
||||
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(
|
||||
__count >= 0,
|
||||
"counting_semaphore::counting_semaphore(ptrdiff_t): counting_semaphore cannot be "
|
||||
"initialized with a negative value");
|
||||
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(
|
||||
__count <= max(),
|
||||
"counting_semaphore::counting_semaphore(ptrdiff_t): counting_semaphore cannot be "
|
||||
"initialized with a value greater than max()");
|
||||
}
|
||||
~counting_semaphore() = default;
|
||||
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
void release(ptrdiff_t __update = 1)
|
||||
{
|
||||
__semaphore_.release(__update);
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
void acquire()
|
||||
{
|
||||
__semaphore_.acquire();
|
||||
}
|
||||
template<class Rep, class Period>
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
bool try_acquire_for(chrono::duration<Rep, Period> const& __rel_time)
|
||||
{
|
||||
return __semaphore_.try_acquire_for(chrono::duration_cast<chrono::nanoseconds>(__rel_time));
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
bool try_acquire()
|
||||
{
|
||||
return __semaphore_.try_acquire();
|
||||
}
|
||||
template <class Clock, class Duration>
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_INLINE_VISIBILITY
|
||||
bool try_acquire_until(chrono::time_point<Clock, Duration> const& __abs_time)
|
||||
{
|
||||
auto const __current = Clock::now();
|
||||
if (__current >= __abs_time)
|
||||
return try_acquire();
|
||||
else
|
||||
return try_acquire_for(__abs_time - __current);
|
||||
}
|
||||
counting_semaphore(const counting_semaphore&) = delete;
|
||||
counting_semaphore& operator=(const counting_semaphore&) = delete;
|
||||
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void release(ptrdiff_t __update = 1) {
|
||||
_LIBCPP_ASSERT_ARGUMENT_WITHIN_DOMAIN(__update >= 0, "counting_semaphore:release called with a negative value");
|
||||
__semaphore_.release(__update);
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI void acquire() { __semaphore_.acquire(); }
|
||||
template <class _Rep, class _Period>
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool
|
||||
try_acquire_for(chrono::duration<_Rep, _Period> const& __rel_time) {
|
||||
return __semaphore_.try_acquire_for(chrono::duration_cast<chrono::nanoseconds>(__rel_time));
|
||||
}
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool try_acquire() { return __semaphore_.try_acquire(); }
|
||||
template <class _Clock, class _Duration>
|
||||
_LIBCPP_AVAILABILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool
|
||||
try_acquire_until(chrono::time_point<_Clock, _Duration> const& __abs_time) {
|
||||
auto const __current = _Clock::now();
|
||||
if (__current >= __abs_time)
|
||||
return try_acquire();
|
||||
else
|
||||
return try_acquire_for(__abs_time - __current);
|
||||
}
|
||||
};
|
||||
|
||||
using binary_semaphore = counting_semaphore<1>;
|
||||
_LIBCPP_SUPPRESS_DEPRECATED_PUSH
|
||||
using binary_semaphore _LIBCPP_DEPRECATED_ATOMIC_SYNC = counting_semaphore<1>;
|
||||
_LIBCPP_SUPPRESS_DEPRECATED_POP
|
||||
|
||||
_LIBCPP_END_NAMESPACE_STD
|
||||
|
||||
#endif // _LIBCPP_STD_VER >= 14
|
||||
# endif // _LIBCPP_STD_VER >= 14
|
||||
|
||||
_LIBCPP_POP_MACROS
|
||||
|
||||
#endif // !defined(_LIBCPP_HAS_NO_THREADS)
|
||||
|
||||
#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
|
||||
# include <atomic>
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue