File Manager

003 File Manager

Current Path: /usr/include/c++/v1/tr1

📁 ..
📄 __bit_reference(51.94 KB)
📄 __bsd_locale_defaults.h(2.06 KB)
📄 __bsd_locale_fallbacks.h(3.94 KB)
📄 __config(51.99 KB)
📄 __debug(7.77 KB)
📄 __errc(9.13 KB)
📄 __functional_03(43.5 KB)
📄 __functional_base(17.4 KB)
📄 __functional_base_03(6.38 KB)
📄 __hash_table(101.98 KB)
📄 __libcpp_version(6 B)
📄 __locale(48.08 KB)
📄 __mutex_base(16.04 KB)
📄 __node_handle(5.93 KB)
📄 __nullptr(1.69 KB)
📄 __split_buffer(21.9 KB)
📄 __sso_allocator(2.49 KB)
📄 __std_stream(10.32 KB)
📄 __string(46.11 KB)
📄 __threading_support(20.64 KB)
📄 __tree(102.38 KB)
📄 __tuple(20.19 KB)
📄 __undef_macros(1.02 KB)
📄 algorithm(199 KB)
📄 any(18.58 KB)
📄 array(20.44 KB)
📄 atomic(96.81 KB)
📄 barrier(9.98 KB)
📄 bit(14.13 KB)
📄 bitset(33 KB)
📄 cassert(559 B)
📄 ccomplex(640 B)
📄 cctype(1.72 KB)
📄 cerrno(669 B)
📄 cfenv(1.56 KB)
📄 cfloat(1.39 KB)
📄 charconv(17.95 KB)
📄 chrono(113.59 KB)
📄 cinttypes(3.44 KB)
📄 ciso646(595 B)
📄 climits(907 B)
📄 clocale(998 B)
📄 cmath(16.71 KB)
📄 codecvt(20.12 KB)
📄 compare(30.14 KB)
📄 complex(45.51 KB)
📄 complex.h(739 B)
📄 concepts(4.63 KB)
📄 condition_variable(7.43 KB)
📄 csetjmp(813 B)
📄 csignal(964 B)
📄 cstdarg(903 B)
📄 cstdbool(721 B)
📄 cstddef(5.29 KB)
📄 cstdint(2.73 KB)
📄 cstdio(4.31 KB)
📄 cstdlib(4.69 KB)
📄 cstring(2.49 KB)
📄 ctgmath(650 B)
📄 ctime(1.67 KB)
📄 ctype.h(1.12 KB)
📄 cwchar(6.14 KB)
📄 cwctype(1.65 KB)
📄 deque(106.34 KB)
📄 errno.h(6.19 KB)
📄 exception(9.25 KB)
📄 execution(595 B)
📄 fenv.h(1.82 KB)
📄 filesystem(80.17 KB)
📄 float.h(1.58 KB)
📄 forward_list(61.11 KB)
📄 fstream(53.05 KB)
📄 functional(99.54 KB)
📄 future(70.91 KB)
📄 initializer_list(2.78 KB)
📄 inttypes.h(3.8 KB)
📄 iomanip(17.85 KB)
📄 ios(24.99 KB)
📄 iosfwd(8.27 KB)
📄 iostream(1.36 KB)
📄 istream(46.73 KB)
📄 iterator(70.11 KB)
📄 latch(2.35 KB)
📄 limits(39.71 KB)
📄 limits.h(1.44 KB)
📄 list(78.48 KB)
📄 locale(150.64 KB)
📄 locale.h(776 B)
📄 map(82.59 KB)
📄 math.h(48.03 KB)
📄 memory(160.89 KB)
📄 mutex(17.25 KB)
📄 new(13.79 KB)
📄 numbers(6.74 KB)
📄 numeric(20.08 KB)
📄 optional(41.59 KB)
📄 ostream(32.02 KB)
📄 queue(27.47 KB)
📄 random(221.29 KB)
📄 ratio(16.04 KB)
📄 regex(219.62 KB)
📄 scoped_allocator(25.14 KB)
📄 semaphore(6.52 KB)
📄 set(55.98 KB)
📄 setjmp.h(802 B)
📄 shared_mutex(14.75 KB)
📄 span(22.41 KB)
📄 sstream(32.59 KB)
📄 stack(9.86 KB)
📄 stdbool.h(815 B)
📄 stddef.h(1.08 KB)
📄 stdexcept(7.66 KB)
📄 stdint.h(2.27 KB)
📄 stdio.h(3.44 KB)
📄 stdlib.h(5.1 KB)
📄 streambuf(14.18 KB)
📄 string(163.38 KB)
📄 string.h(4.58 KB)
📄 string_view(33.74 KB)
📄 strstream(10.88 KB)
📄 system_error(13.88 KB)
📄 tgmath.h(732 B)
📄 thread(11.13 KB)
📄 tuple(55.25 KB)
📄 type_traits(147.84 KB)
📄 typeindex(2.76 KB)
📄 typeinfo(11.27 KB)
📄 unordered_map(97.16 KB)
📄 unordered_set(67.79 KB)
📄 utility(48.28 KB)
📄 valarray(131.97 KB)
📄 variant(60.89 KB)
📄 vector(109.43 KB)
📄 version(14.98 KB)
📄 wchar.h(8.24 KB)
📄 wctype.h(1.52 KB)

Editing: semaphore

// -*- C++ -*-
//===--------------------------- semaphore --------------------------------===//
//
// 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>
class counting_semaphore
{
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
};

using binary_semaphore = counting_semaphore<1>;

}

#include <__config>
#include <__threading_support>
#include <atomic>
#include <cassert>

#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
#pragma GCC system_header
#endif

#ifdef _LIBCPP_HAS_NO_THREADS
# error <semaphore> is not supported on this single threaded system
#endif

#if _LIBCPP_STD_VER >= 14

_LIBCPP_BEGIN_NAMESPACE_STD

__atomic_semaphore_base is the general-case implementation, to be used for
user-requested least-max values that exceed the OS implementation support
(incl. when the OS has no support of its own) and for binary semaphores.

It is a typical Dijsktra semaphore algorithm over atomics, wait and notify
functions. It avoids contention against users' own use of those facilities.

class __atomic_semaphore_base
{
    __atomic_base<ptrdiff_t> __a;

public:
    _LIBCPP_INLINE_VISIBILITY
    __atomic_semaphore_base(ptrdiff_t __count) : __a(__count)
    {
    }
    _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 = [=]() -> 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)
    {
        auto const __test_fn = [=]() -> bool {
            auto __old = __a.load(memory_order_acquire);
            while(1) {
                if (__old == 0)
                    return false;
                if(__a.compare_exchange_strong(__old, __old - 1, memory_order_acquire, memory_order_relaxed))
                    return true;
            }
        };
        return __libcpp_thread_poll_with_backoff(__test_fn, __libcpp_timed_backoff_policy(), __rel_time);
    }
};

#ifndef _LIBCPP_NO_NATIVE_SEMAPHORES

__platform_semaphore_base a simple wrapper for the OS semaphore type. That
is, every call is routed to the OS in the most direct manner possible.

class __platform_semaphore_base
{
    __libcpp_semaphore_t __semaphore;

public:
    _LIBCPP_INLINE_VISIBILITY
    __platform_semaphore_base(ptrdiff_t __count) :
        __semaphore()
    {
        __libcpp_semaphore_init(&__semaphore, __count);
    }
    _LIBCPP_INLINE_VISIBILITY
    ~__platform_semaphore_base() {
        __libcpp_semaphore_destroy(&__semaphore);
    }
    _LIBCPP_INLINE_VISIBILITY
    void release(ptrdiff_t __update)
    {
        for(; __update; --__update)
            __libcpp_semaphore_post(&__semaphore);
    }
    _LIBCPP_INLINE_VISIBILITY
    void acquire()
    {
        __libcpp_semaphore_wait(&__semaphore);
    }
    _LIBCPP_INLINE_VISIBILITY
    bool try_acquire_for(chrono::nanoseconds __rel_time)
    {
        return __libcpp_semaphore_wait_timed(&__semaphore, __rel_time);
    }
};

template<ptrdiff_t __least_max_value>
using __semaphore_base =
    typename conditional<(__least_max_value > 1 && __least_max_value <= _LIBCPP_SEMAPHORE_MAX),
                         __platform_semaphore_base,
                         __atomic_semaphore_base>::type;

#else

template<ptrdiff_t __least_max_value>
using __semaphore_base =
    __atomic_semaphore_base;

#define _LIBCPP_SEMAPHORE_MAX (numeric_limits<ptrdiff_t>::max())

#endif //_LIBCPP_NO_NATIVE_SEMAPHORES

template<ptrdiff_t __least_max_value = _LIBCPP_SEMAPHORE_MAX>
class counting_semaphore
{
    __semaphore_base<__least_max_value> __semaphore;

public:
    static constexpr ptrdiff_t max() noexcept {
        return __least_max_value;
    }

_LIBCPP_INLINE_VISIBILITY
    counting_semaphore(ptrdiff_t __count = 0) : __semaphore(__count) { }
    ~counting_semaphore() = default;

counting_semaphore(const counting_semaphore&) = delete;
    counting_semaphore& operator=(const counting_semaphore&) = delete;

_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 try_acquire_for(chrono::nanoseconds::zero());
    }
    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);
    }
};

using binary_semaphore = counting_semaphore<1>;

_LIBCPP_END_NAMESPACE_STD

#endif // _LIBCPP_STD_VER >= 14

#endif //_LIBCPP_SEMAPHORE

003 File Manager

Editing: semaphore

Upload File

Create Folder