Current Path: > > usr > include > c++ > 8
Operation : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64 Software : Apache Server IP : 162.0.232.56 | Your IP: 216.73.216.111 Domains : 1034 Domain(s) Permission : [ 0755 ]
Name | Type | Size | Last Modified | Actions |
---|---|---|---|---|
backward | Directory | - | - | |
bits | Directory | - | - | |
debug | Directory | - | - | |
decimal | Directory | - | - | |
experimental | Directory | - | - | |
ext | Directory | - | - | |
parallel | Directory | - | - | |
profile | Directory | - | - | |
tr1 | Directory | - | - | |
tr2 | Directory | - | - | |
x86_64-redhat-linux | Directory | - | - | |
algorithm | File | 2518 bytes | March 31 2025 10:36:18. | |
any | File | 18604 bytes | March 31 2025 10:36:18. | |
array | File | 11657 bytes | March 31 2025 10:36:18. | |
atomic | File | 41057 bytes | March 31 2025 10:36:18. | |
bitset | File | 45910 bytes | March 31 2025 10:36:18. | |
cassert | File | 1648 bytes | March 31 2025 10:36:18. | |
ccomplex | File | 1335 bytes | March 31 2025 10:36:18. | |
cctype | File | 2409 bytes | March 31 2025 10:36:18. | |
cerrno | File | 1770 bytes | March 31 2025 10:36:18. | |
cfenv | File | 2051 bytes | March 31 2025 10:36:18. | |
cfloat | File | 1889 bytes | March 31 2025 10:36:18. | |
charconv | File | 16708 bytes | March 31 2025 10:36:18. | |
chrono | File | 29874 bytes | March 31 2025 10:36:18. | |
cinttypes | File | 2157 bytes | March 31 2025 10:36:18. | |
ciso646 | File | 1464 bytes | March 31 2025 10:36:18. | |
climits | File | 1913 bytes | March 31 2025 10:36:18. | |
clocale | File | 1905 bytes | March 31 2025 10:36:18. | |
cmath | File | 48142 bytes | March 31 2025 10:36:18. | |
codecvt | File | 5341 bytes | March 31 2025 10:36:18. | |
complex | File | 54537 bytes | March 31 2025 10:36:18. | |
complex.h | File | 1596 bytes | March 31 2025 10:36:18. | |
condition_variable | File | 8954 bytes | March 31 2025 10:36:18. | |
csetjmp | File | 1949 bytes | March 31 2025 10:36:18. | |
csignal | File | 1855 bytes | March 31 2025 10:36:18. | |
cstdalign | File | 1407 bytes | March 31 2025 10:36:18. | |
cstdarg | File | 1868 bytes | March 31 2025 10:36:18. | |
cstdbool | File | 1401 bytes | March 31 2025 10:36:18. | |
cstddef | File | 6440 bytes | March 31 2025 10:36:18. | |
cstdint | File | 2167 bytes | March 31 2025 10:36:18. | |
cstdio | File | 4439 bytes | March 31 2025 10:36:18. | |
cstdlib | File | 6325 bytes | March 31 2025 10:36:18. | |
cstring | File | 3123 bytes | March 31 2025 10:36:18. | |
ctgmath | File | 1360 bytes | March 31 2025 10:36:18. | |
ctime | File | 2125 bytes | March 31 2025 10:36:18. | |
cuchar | File | 2210 bytes | March 31 2025 10:36:18. | |
cwchar | File | 6509 bytes | March 31 2025 10:36:18. | |
cwctype | File | 2793 bytes | March 31 2025 10:36:18. | |
cxxabi.h | File | 21977 bytes | March 31 2025 10:36:18. | |
deque | File | 2665 bytes | March 31 2025 10:36:18. | |
exception | File | 4803 bytes | March 31 2025 10:36:18. | |
fenv.h | File | 2020 bytes | March 31 2025 10:36:18. | |
filesystem | File | 1438 bytes | March 31 2025 10:36:18. | |
forward_list | File | 1577 bytes | March 31 2025 10:36:18. | |
fstream | File | 36787 bytes | March 31 2025 10:36:18. | |
functional | File | 37750 bytes | March 31 2025 10:36:18. | |
future | File | 50678 bytes | March 31 2025 10:36:18. | |
initializer_list | File | 2974 bytes | March 31 2025 10:36:18. | |
iomanip | File | 16547 bytes | March 31 2025 10:36:18. | |
ios | File | 1601 bytes | March 31 2025 10:36:18. | |
iosfwd | File | 6918 bytes | March 31 2025 10:36:18. | |
iostream | File | 2695 bytes | March 31 2025 10:36:18. | |
istream | File | 32843 bytes | March 31 2025 10:36:18. | |
iterator | File | 2644 bytes | March 31 2025 10:36:18. | |
limits | File | 69181 bytes | March 31 2025 10:36:18. | |
list | File | 2594 bytes | March 31 2025 10:36:18. | |
locale | File | 1488 bytes | March 31 2025 10:36:18. | |
map | File | 2559 bytes | March 31 2025 10:36:18. | |
math.h | File | 4367 bytes | March 31 2025 10:36:18. | |
memory | File | 4711 bytes | March 31 2025 10:36:18. | |
mutex | File | 18224 bytes | March 31 2025 10:36:18. | |
new | File | 7521 bytes | March 31 2025 10:36:18. | |
numeric | File | 5444 bytes | March 31 2025 10:36:18. | |
optional | File | 43963 bytes | March 31 2025 10:36:18. | |
ostream | File | 22091 bytes | March 31 2025 10:36:18. | |
queue | File | 2467 bytes | March 31 2025 10:36:18. | |
random | File | 1692 bytes | March 31 2025 10:36:18. | |
ratio | File | 19886 bytes | March 31 2025 10:36:18. | |
regex | File | 1894 bytes | March 31 2025 10:36:18. | |
scoped_allocator | File | 16221 bytes | March 31 2025 10:36:18. | |
set | File | 2559 bytes | March 31 2025 10:36:18. | |
shared_mutex | File | 19409 bytes | March 31 2025 10:36:18. | |
sstream | File | 26871 bytes | March 31 2025 10:36:18. | |
stack | File | 2391 bytes | March 31 2025 10:36:18. | |
stdexcept | File | 7975 bytes | March 31 2025 10:36:18. | |
stdlib.h | File | 2248 bytes | March 31 2025 10:36:18. | |
streambuf | File | 30017 bytes | March 31 2025 10:36:18. | |
string | File | 1940 bytes | March 31 2025 10:36:18. | |
string_view | File | 20791 bytes | March 31 2025 10:36:18. | |
system_error | File | 11522 bytes | March 31 2025 10:36:18. | |
tgmath.h | File | 1360 bytes | March 31 2025 10:36:18. | |
thread | File | 10519 bytes | March 31 2025 10:36:18. | |
tuple | File | 60350 bytes | March 31 2025 10:36:18. | |
type_traits | File | 85871 bytes | March 31 2025 10:36:18. | |
typeindex | File | 3093 bytes | March 31 2025 10:36:18. | |
typeinfo | File | 7692 bytes | March 31 2025 10:36:18. | |
unordered_map | File | 1848 bytes | March 31 2025 10:36:18. | |
unordered_set | File | 1847 bytes | March 31 2025 10:36:18. | |
utility | File | 12303 bytes | March 31 2025 10:36:18. | |
valarray | File | 40274 bytes | March 31 2025 10:36:18. | |
variant | File | 48242 bytes | March 31 2025 10:36:18. | |
vector | File | 2747 bytes | March 31 2025 10:36:18. |
// <mutex> -*- C++ -*- // Copyright (C) 2003-2018 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // <http://www.gnu.org/licenses/>. /** @file include/mutex * This is a Standard C++ Library header. */ #ifndef _GLIBCXX_MUTEX #define _GLIBCXX_MUTEX 1 #pragma GCC system_header #if __cplusplus < 201103L # include <bits/c++0x_warning.h> #else #include <tuple> #include <chrono> #include <exception> #include <type_traits> #include <system_error> #include <bits/std_mutex.h> #if ! _GTHREAD_USE_MUTEX_TIMEDLOCK # include <condition_variable> # include <thread> #endif #ifndef _GLIBCXX_HAVE_TLS # include <bits/std_function.h> #endif #ifdef _GLIBCXX_USE_C99_STDINT_TR1 namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @ingroup mutexes * @{ */ #ifdef _GLIBCXX_HAS_GTHREADS // Common base class for std::recursive_mutex and std::recursive_timed_mutex class __recursive_mutex_base { protected: typedef __gthread_recursive_mutex_t __native_type; __recursive_mutex_base(const __recursive_mutex_base&) = delete; __recursive_mutex_base& operator=(const __recursive_mutex_base&) = delete; #ifdef __GTHREAD_RECURSIVE_MUTEX_INIT __native_type _M_mutex = __GTHREAD_RECURSIVE_MUTEX_INIT; __recursive_mutex_base() = default; #else __native_type _M_mutex; __recursive_mutex_base() { // XXX EAGAIN, ENOMEM, EPERM, EBUSY(may), EINVAL(may) __GTHREAD_RECURSIVE_MUTEX_INIT_FUNCTION(&_M_mutex); } ~__recursive_mutex_base() { __gthread_recursive_mutex_destroy(&_M_mutex); } #endif }; /// The standard recursive mutex type. class recursive_mutex : private __recursive_mutex_base { public: typedef __native_type* native_handle_type; recursive_mutex() = default; ~recursive_mutex() = default; recursive_mutex(const recursive_mutex&) = delete; recursive_mutex& operator=(const recursive_mutex&) = delete; void lock() { int __e = __gthread_recursive_mutex_lock(&_M_mutex); // EINVAL, EAGAIN, EBUSY, EINVAL, EDEADLK(may) if (__e) __throw_system_error(__e); } bool try_lock() noexcept { // XXX EINVAL, EAGAIN, EBUSY return !__gthread_recursive_mutex_trylock(&_M_mutex); } void unlock() { // XXX EINVAL, EAGAIN, EBUSY __gthread_recursive_mutex_unlock(&_M_mutex); } native_handle_type native_handle() noexcept { return &_M_mutex; } }; #if _GTHREAD_USE_MUTEX_TIMEDLOCK template<typename _Derived> class __timed_mutex_impl { protected: typedef chrono::high_resolution_clock __clock_t; template<typename _Rep, typename _Period> bool _M_try_lock_for(const chrono::duration<_Rep, _Period>& __rtime) { using chrono::steady_clock; auto __rt = chrono::duration_cast<steady_clock::duration>(__rtime); if (ratio_greater<steady_clock::period, _Period>()) ++__rt; return _M_try_lock_until(steady_clock::now() + __rt); } template<typename _Duration> bool _M_try_lock_until(const chrono::time_point<__clock_t, _Duration>& __atime) { auto __s = chrono::time_point_cast<chrono::seconds>(__atime); auto __ns = chrono::duration_cast<chrono::nanoseconds>(__atime - __s); __gthread_time_t __ts = { static_cast<std::time_t>(__s.time_since_epoch().count()), static_cast<long>(__ns.count()) }; return static_cast<_Derived*>(this)->_M_timedlock(__ts); } template<typename _Clock, typename _Duration> bool _M_try_lock_until(const chrono::time_point<_Clock, _Duration>& __atime) { auto __rtime = __atime - _Clock::now(); return _M_try_lock_until(__clock_t::now() + __rtime); } }; /// The standard timed mutex type. class timed_mutex : private __mutex_base, public __timed_mutex_impl<timed_mutex> { public: typedef __native_type* native_handle_type; timed_mutex() = default; ~timed_mutex() = default; timed_mutex(const timed_mutex&) = delete; timed_mutex& operator=(const timed_mutex&) = delete; void lock() { int __e = __gthread_mutex_lock(&_M_mutex); // EINVAL, EAGAIN, EBUSY, EINVAL, EDEADLK(may) if (__e) __throw_system_error(__e); } bool try_lock() noexcept { // XXX EINVAL, EAGAIN, EBUSY return !__gthread_mutex_trylock(&_M_mutex); } template <class _Rep, class _Period> bool try_lock_for(const chrono::duration<_Rep, _Period>& __rtime) { return _M_try_lock_for(__rtime); } template <class _Clock, class _Duration> bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __atime) { return _M_try_lock_until(__atime); } void unlock() { // XXX EINVAL, EAGAIN, EBUSY __gthread_mutex_unlock(&_M_mutex); } native_handle_type native_handle() noexcept { return &_M_mutex; } private: friend class __timed_mutex_impl<timed_mutex>; bool _M_timedlock(const __gthread_time_t& __ts) { return !__gthread_mutex_timedlock(&_M_mutex, &__ts); } }; /// recursive_timed_mutex class recursive_timed_mutex : private __recursive_mutex_base, public __timed_mutex_impl<recursive_timed_mutex> { public: typedef __native_type* native_handle_type; recursive_timed_mutex() = default; ~recursive_timed_mutex() = default; recursive_timed_mutex(const recursive_timed_mutex&) = delete; recursive_timed_mutex& operator=(const recursive_timed_mutex&) = delete; void lock() { int __e = __gthread_recursive_mutex_lock(&_M_mutex); // EINVAL, EAGAIN, EBUSY, EINVAL, EDEADLK(may) if (__e) __throw_system_error(__e); } bool try_lock() noexcept { // XXX EINVAL, EAGAIN, EBUSY return !__gthread_recursive_mutex_trylock(&_M_mutex); } template <class _Rep, class _Period> bool try_lock_for(const chrono::duration<_Rep, _Period>& __rtime) { return _M_try_lock_for(__rtime); } template <class _Clock, class _Duration> bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __atime) { return _M_try_lock_until(__atime); } void unlock() { // XXX EINVAL, EAGAIN, EBUSY __gthread_recursive_mutex_unlock(&_M_mutex); } native_handle_type native_handle() noexcept { return &_M_mutex; } private: friend class __timed_mutex_impl<recursive_timed_mutex>; bool _M_timedlock(const __gthread_time_t& __ts) { return !__gthread_recursive_mutex_timedlock(&_M_mutex, &__ts); } }; #else // !_GTHREAD_USE_MUTEX_TIMEDLOCK /// timed_mutex class timed_mutex { mutex _M_mut; condition_variable _M_cv; bool _M_locked = false; public: timed_mutex() = default; ~timed_mutex() { __glibcxx_assert( !_M_locked ); } timed_mutex(const timed_mutex&) = delete; timed_mutex& operator=(const timed_mutex&) = delete; void lock() { unique_lock<mutex> __lk(_M_mut); _M_cv.wait(__lk, [&]{ return !_M_locked; }); _M_locked = true; } bool try_lock() { lock_guard<mutex> __lk(_M_mut); if (_M_locked) return false; _M_locked = true; return true; } template<typename _Rep, typename _Period> bool try_lock_for(const chrono::duration<_Rep, _Period>& __rtime) { unique_lock<mutex> __lk(_M_mut); if (!_M_cv.wait_for(__lk, __rtime, [&]{ return !_M_locked; })) return false; _M_locked = true; return true; } template<typename _Clock, typename _Duration> bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __atime) { unique_lock<mutex> __lk(_M_mut); if (!_M_cv.wait_until(__lk, __atime, [&]{ return !_M_locked; })) return false; _M_locked = true; return true; } void unlock() { lock_guard<mutex> __lk(_M_mut); __glibcxx_assert( _M_locked ); _M_locked = false; _M_cv.notify_one(); } }; /// recursive_timed_mutex class recursive_timed_mutex { mutex _M_mut; condition_variable _M_cv; thread::id _M_owner; unsigned _M_count = 0; // Predicate type that tests whether the current thread can lock a mutex. struct _Can_lock { // Returns true if the mutex is unlocked or is locked by _M_caller. bool operator()() const noexcept { return _M_mx->_M_count == 0 || _M_mx->_M_owner == _M_caller; } const recursive_timed_mutex* _M_mx; thread::id _M_caller; }; public: recursive_timed_mutex() = default; ~recursive_timed_mutex() { __glibcxx_assert( _M_count == 0 ); } recursive_timed_mutex(const recursive_timed_mutex&) = delete; recursive_timed_mutex& operator=(const recursive_timed_mutex&) = delete; void lock() { auto __id = this_thread::get_id(); _Can_lock __can_lock{this, __id}; unique_lock<mutex> __lk(_M_mut); _M_cv.wait(__lk, __can_lock); if (_M_count == -1u) __throw_system_error(EAGAIN); // [thread.timedmutex.recursive]/3 _M_owner = __id; ++_M_count; } bool try_lock() { auto __id = this_thread::get_id(); _Can_lock __can_lock{this, __id}; lock_guard<mutex> __lk(_M_mut); if (!__can_lock()) return false; if (_M_count == -1u) return false; _M_owner = __id; ++_M_count; return true; } template<typename _Rep, typename _Period> bool try_lock_for(const chrono::duration<_Rep, _Period>& __rtime) { auto __id = this_thread::get_id(); _Can_lock __can_lock{this, __id}; unique_lock<mutex> __lk(_M_mut); if (!_M_cv.wait_for(__lk, __rtime, __can_lock)) return false; if (_M_count == -1u) return false; _M_owner = __id; ++_M_count; return true; } template<typename _Clock, typename _Duration> bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __atime) { auto __id = this_thread::get_id(); _Can_lock __can_lock{this, __id}; unique_lock<mutex> __lk(_M_mut); if (!_M_cv.wait_until(__lk, __atime, __can_lock)) return false; if (_M_count == -1u) return false; _M_owner = __id; ++_M_count; return true; } void unlock() { lock_guard<mutex> __lk(_M_mut); __glibcxx_assert( _M_owner == this_thread::get_id() ); __glibcxx_assert( _M_count > 0 ); if (--_M_count == 0) { _M_owner = {}; _M_cv.notify_one(); } } }; #endif #endif // _GLIBCXX_HAS_GTHREADS template<typename _Lock> inline unique_lock<_Lock> __try_to_lock(_Lock& __l) { return unique_lock<_Lock>{__l, try_to_lock}; } template<int _Idx, bool _Continue = true> struct __try_lock_impl { template<typename... _Lock> static void __do_try_lock(tuple<_Lock&...>& __locks, int& __idx) { __idx = _Idx; auto __lock = std::__try_to_lock(std::get<_Idx>(__locks)); if (__lock.owns_lock()) { constexpr bool __cont = _Idx + 2 < sizeof...(_Lock); using __try_locker = __try_lock_impl<_Idx + 1, __cont>; __try_locker::__do_try_lock(__locks, __idx); if (__idx == -1) __lock.release(); } } }; template<int _Idx> struct __try_lock_impl<_Idx, false> { template<typename... _Lock> static void __do_try_lock(tuple<_Lock&...>& __locks, int& __idx) { __idx = _Idx; auto __lock = std::__try_to_lock(std::get<_Idx>(__locks)); if (__lock.owns_lock()) { __idx = -1; __lock.release(); } } }; /** @brief Generic try_lock. * @param __l1 Meets Lockable requirements (try_lock() may throw). * @param __l2 Meets Lockable requirements (try_lock() may throw). * @param __l3 Meets Lockable requirements (try_lock() may throw). * @return Returns -1 if all try_lock() calls return true. Otherwise returns * a 0-based index corresponding to the argument that returned false. * @post Either all arguments are locked, or none will be. * * Sequentially calls try_lock() on each argument. */ template<typename _Lock1, typename _Lock2, typename... _Lock3> int try_lock(_Lock1& __l1, _Lock2& __l2, _Lock3&... __l3) { int __idx; auto __locks = std::tie(__l1, __l2, __l3...); __try_lock_impl<0>::__do_try_lock(__locks, __idx); return __idx; } /** @brief Generic lock. * @param __l1 Meets Lockable requirements (try_lock() may throw). * @param __l2 Meets Lockable requirements (try_lock() may throw). * @param __l3 Meets Lockable requirements (try_lock() may throw). * @throw An exception thrown by an argument's lock() or try_lock() member. * @post All arguments are locked. * * All arguments are locked via a sequence of calls to lock(), try_lock() * and unlock(). If the call exits via an exception any locks that were * obtained will be released. */ template<typename _L1, typename _L2, typename... _L3> void lock(_L1& __l1, _L2& __l2, _L3&... __l3) { while (true) { using __try_locker = __try_lock_impl<0, sizeof...(_L3) != 0>; unique_lock<_L1> __first(__l1); int __idx; auto __locks = std::tie(__l2, __l3...); __try_locker::__do_try_lock(__locks, __idx); if (__idx == -1) { __first.release(); return; } } } #if __cplusplus >= 201703L #define __cpp_lib_scoped_lock 201703 /** @brief A scoped lock type for multiple lockable objects. * * A scoped_lock controls mutex ownership within a scope, releasing * ownership in the destructor. */ template<typename... _MutexTypes> class scoped_lock { public: explicit scoped_lock(_MutexTypes&... __m) : _M_devices(std::tie(__m...)) { std::lock(__m...); } explicit scoped_lock(adopt_lock_t, _MutexTypes&... __m) noexcept : _M_devices(std::tie(__m...)) { } // calling thread owns mutex ~scoped_lock() { std::apply([](_MutexTypes&... __m) { char __i[] __attribute__((__unused__)) = { (__m.unlock(), 0)... }; }, _M_devices); } scoped_lock(const scoped_lock&) = delete; scoped_lock& operator=(const scoped_lock&) = delete; private: tuple<_MutexTypes&...> _M_devices; }; template<> class scoped_lock<> { public: explicit scoped_lock() = default; explicit scoped_lock(adopt_lock_t) noexcept { } ~scoped_lock() = default; scoped_lock(const scoped_lock&) = delete; scoped_lock& operator=(const scoped_lock&) = delete; }; template<typename _Mutex> class scoped_lock<_Mutex> { public: using mutex_type = _Mutex; explicit scoped_lock(mutex_type& __m) : _M_device(__m) { _M_device.lock(); } explicit scoped_lock(adopt_lock_t, mutex_type& __m) noexcept : _M_device(__m) { } // calling thread owns mutex ~scoped_lock() { _M_device.unlock(); } scoped_lock(const scoped_lock&) = delete; scoped_lock& operator=(const scoped_lock&) = delete; private: mutex_type& _M_device; }; #endif // C++17 #ifdef _GLIBCXX_HAS_GTHREADS /// once_flag struct once_flag { private: typedef __gthread_once_t __native_type; __native_type _M_once = __GTHREAD_ONCE_INIT; public: /// Constructor constexpr once_flag() noexcept = default; /// Deleted copy constructor once_flag(const once_flag&) = delete; /// Deleted assignment operator once_flag& operator=(const once_flag&) = delete; template<typename _Callable, typename... _Args> friend void call_once(once_flag& __once, _Callable&& __f, _Args&&... __args); }; #ifdef _GLIBCXX_HAVE_TLS extern __thread void* __once_callable; extern __thread void (*__once_call)(); #else extern function<void()> __once_functor; extern void __set_once_functor_lock_ptr(unique_lock<mutex>*); extern mutex& __get_once_mutex(); #endif extern "C" void __once_proxy(void); /// call_once template<typename _Callable, typename... _Args> void call_once(once_flag& __once, _Callable&& __f, _Args&&... __args) { // _GLIBCXX_RESOLVE_LIB_DEFECTS // 2442. call_once() shouldn't DECAY_COPY() auto __callable = [&] { std::__invoke(std::forward<_Callable>(__f), std::forward<_Args>(__args)...); }; #ifdef _GLIBCXX_HAVE_TLS __once_callable = std::__addressof(__callable); // NOLINT: PR 82481 __once_call = []{ (*(decltype(__callable)*)__once_callable)(); }; #else unique_lock<mutex> __functor_lock(__get_once_mutex()); __once_functor = __callable; __set_once_functor_lock_ptr(&__functor_lock); #endif int __e = __gthread_once(&__once._M_once, &__once_proxy); #ifndef _GLIBCXX_HAVE_TLS if (__functor_lock) __set_once_functor_lock_ptr(0); #endif if (__e) __throw_system_error(__e); } #endif // _GLIBCXX_HAS_GTHREADS // @} group mutexes _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif // _GLIBCXX_USE_C99_STDINT_TR1 #endif // C++11 #endif // _GLIBCXX_MUTEX
SILENT KILLER Tool