almost all recent changes to libc++ and libcxxrt. MFC r256642: Since C++ typeinfo objects are currently not guaranteed to be merged at runtime by the dynamic linker, check for their equality in libcxxrt by not only comparing the typeinfo's name pointers, but also comparing the full names, if necessary. (This is similar to what GNU libstdc++ does in its default configuration.) The 'deep' check can be turned off again by defining LIBCXXRT_MERGED_TYPEINFO, and recompiling libcxxrt. Reviewed by: theraven MFC r270522 (by rdivacky): The standard we compile libc++ with is called c++11 not c++0x. MFC r273066 (by bapt): Import patch from libc++ r197313 which allows using libc++ headers with gcc Differential Revision: https://reviews.freebsd.org/D942 Reviewed by: imp MFC r273381 (by bapt): Add support for __cxa_throw_bad_array_new_length in libcxxrt It is required for use with newer g++49 Differential Revision: https://reviews.freebsd.org/D982 Reviewed by: theraven Approved by: theraven MFC r273382 (by bapt): Fix build by marking the new functions as weak This is a temporary fix MFC r273407 (by bapt): When using an external gcc 4.8+ and not building libstdc++ then create in the objectdir a fake libstdc++.so and libstdc++.a which is a symlink on libc++ that allow g++ to satisfy its links dependencies in the least hackish way. Please note that this hacky libstds++ never get installed on the final system Reviewed by: imp MFC r273434 (by bapt): Do not define bad_array_new_length::bad_array_new_length in libc++ anymore when used in combinaison with libcxxrt since it is now defined there already. This fixes building world MFC r276417: Import libcxxrt master 00bc29eb6513624824a6d7db2ebc768a4216a604. Interesting fixes: 76584a0 Reorganize code to use only 32bit atomic ops for 32bit platforms 30d2ae5 Implement __cxa_throw_bad_array_new_length Reviewed by: bapt Differential Revision: https://reviews.freebsd.org/D1390 MFC r277217: Import libc++ trunk r224926. This fixes a number of bugs, completes C++14 support[1], adds more C++1z features[2], and fixes the following LWG issues[3]: 1450: Contradiction in regex_constants 2003: String exception inconsistency in erase. 2075: Progress guarantees, lock-free property, and scheduling assumptions 2104: unique_lock move-assignment should not be noexcept 2112: User-defined classes that cannot be derived from 2132: std::function ambiguity 2135: Unclear requirement for exceptions thrown in condition_variable::wait() 2142: packaged_task::operator() synchronization too broad? 2182: Container::[const_]reference types are misleadingly specified 2186: Incomplete action on async/launch::deferred 2188: Reverse iterator does not fully support targets that overload operator& 2193: Default constructors for standard library containers are explicit 2205: Problematic postconditions of regex_match and regex_search 2213: Return value of std::regex_replace 2240: Probable misuse of term "function scope" in [thread.condition] 2252: Strong guarantee on vector::push_back() still broken with C++11? 2257: Simplify container requirements with the new algorithms 2258: a.erase(q1, q2) unable to directly return q2 2263: Comparing iterators and allocator pointers with different const-character 2268: Setting a default argument in the declaration of a member function assign of std::basic_string 2271: regex_traits::lookup_classname specification unclear 2272: quoted should use char_traits::eq for character comparison 2278: User-defined literals for Standard Library types 2280: begin / end for arrays should be constexpr and noexcept 2285: make_reverse_iterator 2288: Inconsistent requirements for shared mutexes 2291: std::hash is vulnerable to collision DoS attack 2293: Wrong facet used by num_put::do_put 2299: Effects of inaccessible key_compare::is_transparent type are not clear 2301: Why is std::tie not constexpr? 2304: Complexity of count in unordered associative containers 2306: match_results::reference should be value_type&, not const value_type& 2308: Clarify container destructor requirements w.r.t. std::array 2313: tuple_size should always derive from integral_constant<size_t, N> 2314: apply() should return decltype(auto) and use decay_t before tuple_size 2315: weak_ptr should be movable 2316: weak_ptr::lock() should be atomic 2317: The type property queries should be UnaryTypeTraits returning size_t 2320: select_on_container_copy_construction() takes allocators, not containers 2322: Associative(initializer_list, stuff) constructors are underspecified 2323: vector::resize(n, t)'s specification should be simplified 2324: Insert iterator constructors should use addressof() 2329: regex_match()/regex_search() with match_results should forbid temporary strings 2330: regex("meow", regex::icase) is technically forbidden but should be permitted 2332: regex_iterator/regex_token_iterator should forbid temporary regexes 2339: Wording issue in nth_element 2341: Inconsistency between basic_ostream::seekp(pos) and basic_ostream::seekp(off, dir) 2344: quoted()'s interaction with padding is unclear 2346: integral_constant's member functions should be marked noexcept 2350: min, max, and minmax should be constexpr 2356: Stability of erasure in unordered associative containers 2357: Remaining "Assignable" requirement 2359: How does regex_constants::nosubs affect basic_regex::mark_count()? 2360: reverse_iterator::operator*() is unimplementable [1] http://libcxx.llvm.org/cxx1y_status.html [2] http://libcxx.llvm.org/cxx1z_status.html [3] http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html Exp-run: antoine MFC r277944: Partially revert r273382, to reduce diffs against upstream. This was a temporary fix to solve a conflict with an older version of libc++, and it is no longer relevant. MFC r278010: Revert r256642, not only to reduce diffs against upstream libcxxrt, but also because it is the wrong approach: comparing typeinfo names deeply causes trouble if two loaded DSOs use independent types of the same name. In addition, this particular change was never merged to FreeBSD 10.x and 9.x, so let's get rid of it before it ends up in an 11.x release. Discussed with: theraven, joerg@netbsd MFC r278016: Import libcxxrt master 1cb607e89f6135bbc10f3d3b6fba1f983e258dcc. Interesting fixes: 1cb607e Correct gcc version check for __cxa_begin_catch() declaration with or without throw()
408 lines
11 KiB
C++
408 lines
11 KiB
C++
// -*- C++ -*-
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___MUTEX_BASE
|
|
#define _LIBCPP___MUTEX_BASE
|
|
|
|
#include <__config>
|
|
#include <chrono>
|
|
#include <system_error>
|
|
#include <pthread.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
#ifndef _LIBCPP_HAS_NO_THREADS
|
|
|
|
class _LIBCPP_TYPE_VIS mutex
|
|
{
|
|
pthread_mutex_t __m_;
|
|
|
|
public:
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
#ifndef _LIBCPP_HAS_NO_CONSTEXPR
|
|
constexpr mutex() _NOEXCEPT : __m_(PTHREAD_MUTEX_INITIALIZER) {}
|
|
#else
|
|
mutex() _NOEXCEPT {__m_ = (pthread_mutex_t)PTHREAD_MUTEX_INITIALIZER;}
|
|
#endif
|
|
~mutex();
|
|
|
|
private:
|
|
mutex(const mutex&);// = delete;
|
|
mutex& operator=(const mutex&);// = delete;
|
|
|
|
public:
|
|
void lock();
|
|
bool try_lock() _NOEXCEPT;
|
|
void unlock() _NOEXCEPT;
|
|
|
|
typedef pthread_mutex_t* native_handle_type;
|
|
_LIBCPP_INLINE_VISIBILITY native_handle_type native_handle() {return &__m_;}
|
|
};
|
|
|
|
struct _LIBCPP_TYPE_VIS defer_lock_t {};
|
|
struct _LIBCPP_TYPE_VIS try_to_lock_t {};
|
|
struct _LIBCPP_TYPE_VIS adopt_lock_t {};
|
|
|
|
#if defined(_LIBCPP_HAS_NO_CONSTEXPR) || defined(_LIBCPP_BUILDING_MUTEX)
|
|
|
|
extern const defer_lock_t defer_lock;
|
|
extern const try_to_lock_t try_to_lock;
|
|
extern const adopt_lock_t adopt_lock;
|
|
|
|
#else
|
|
|
|
constexpr defer_lock_t defer_lock = defer_lock_t();
|
|
constexpr try_to_lock_t try_to_lock = try_to_lock_t();
|
|
constexpr adopt_lock_t adopt_lock = adopt_lock_t();
|
|
|
|
#endif
|
|
|
|
template <class _Mutex>
|
|
class _LIBCPP_TYPE_VIS_ONLY lock_guard
|
|
{
|
|
public:
|
|
typedef _Mutex mutex_type;
|
|
|
|
private:
|
|
mutex_type& __m_;
|
|
public:
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
explicit lock_guard(mutex_type& __m)
|
|
: __m_(__m) {__m_.lock();}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
lock_guard(mutex_type& __m, adopt_lock_t)
|
|
: __m_(__m) {}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
~lock_guard() {__m_.unlock();}
|
|
|
|
private:
|
|
lock_guard(lock_guard const&);// = delete;
|
|
lock_guard& operator=(lock_guard const&);// = delete;
|
|
};
|
|
|
|
template <class _Mutex>
|
|
class _LIBCPP_TYPE_VIS_ONLY unique_lock
|
|
{
|
|
public:
|
|
typedef _Mutex mutex_type;
|
|
|
|
private:
|
|
mutex_type* __m_;
|
|
bool __owns_;
|
|
|
|
public:
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock() _NOEXCEPT : __m_(nullptr), __owns_(false) {}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
explicit unique_lock(mutex_type& __m)
|
|
: __m_(&__m), __owns_(true) {__m_->lock();}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock(mutex_type& __m, defer_lock_t) _NOEXCEPT
|
|
: __m_(&__m), __owns_(false) {}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock(mutex_type& __m, try_to_lock_t)
|
|
: __m_(&__m), __owns_(__m.try_lock()) {}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock(mutex_type& __m, adopt_lock_t)
|
|
: __m_(&__m), __owns_(true) {}
|
|
template <class _Clock, class _Duration>
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock(mutex_type& __m, const chrono::time_point<_Clock, _Duration>& __t)
|
|
: __m_(&__m), __owns_(__m.try_lock_until(__t)) {}
|
|
template <class _Rep, class _Period>
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock(mutex_type& __m, const chrono::duration<_Rep, _Period>& __d)
|
|
: __m_(&__m), __owns_(__m.try_lock_for(__d)) {}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
~unique_lock()
|
|
{
|
|
if (__owns_)
|
|
__m_->unlock();
|
|
}
|
|
|
|
private:
|
|
unique_lock(unique_lock const&); // = delete;
|
|
unique_lock& operator=(unique_lock const&); // = delete;
|
|
|
|
public:
|
|
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock(unique_lock&& __u) _NOEXCEPT
|
|
: __m_(__u.__m_), __owns_(__u.__owns_)
|
|
{__u.__m_ = nullptr; __u.__owns_ = false;}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
unique_lock& operator=(unique_lock&& __u) _NOEXCEPT
|
|
{
|
|
if (__owns_)
|
|
__m_->unlock();
|
|
__m_ = __u.__m_;
|
|
__owns_ = __u.__owns_;
|
|
__u.__m_ = nullptr;
|
|
__u.__owns_ = false;
|
|
return *this;
|
|
}
|
|
|
|
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
|
|
|
|
void lock();
|
|
bool try_lock();
|
|
|
|
template <class _Rep, class _Period>
|
|
bool try_lock_for(const chrono::duration<_Rep, _Period>& __d);
|
|
template <class _Clock, class _Duration>
|
|
bool try_lock_until(const chrono::time_point<_Clock, _Duration>& __t);
|
|
|
|
void unlock();
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void swap(unique_lock& __u) _NOEXCEPT
|
|
{
|
|
_VSTD::swap(__m_, __u.__m_);
|
|
_VSTD::swap(__owns_, __u.__owns_);
|
|
}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
mutex_type* release() _NOEXCEPT
|
|
{
|
|
mutex_type* __m = __m_;
|
|
__m_ = nullptr;
|
|
__owns_ = false;
|
|
return __m;
|
|
}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
bool owns_lock() const _NOEXCEPT {return __owns_;}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
_LIBCPP_EXPLICIT
|
|
operator bool () const _NOEXCEPT {return __owns_;}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
mutex_type* mutex() const _NOEXCEPT {return __m_;}
|
|
};
|
|
|
|
template <class _Mutex>
|
|
void
|
|
unique_lock<_Mutex>::lock()
|
|
{
|
|
if (__m_ == nullptr)
|
|
__throw_system_error(EPERM, "unique_lock::lock: references null mutex");
|
|
if (__owns_)
|
|
__throw_system_error(EDEADLK, "unique_lock::lock: already locked");
|
|
__m_->lock();
|
|
__owns_ = true;
|
|
}
|
|
|
|
template <class _Mutex>
|
|
bool
|
|
unique_lock<_Mutex>::try_lock()
|
|
{
|
|
if (__m_ == nullptr)
|
|
__throw_system_error(EPERM, "unique_lock::try_lock: references null mutex");
|
|
if (__owns_)
|
|
__throw_system_error(EDEADLK, "unique_lock::try_lock: already locked");
|
|
__owns_ = __m_->try_lock();
|
|
return __owns_;
|
|
}
|
|
|
|
template <class _Mutex>
|
|
template <class _Rep, class _Period>
|
|
bool
|
|
unique_lock<_Mutex>::try_lock_for(const chrono::duration<_Rep, _Period>& __d)
|
|
{
|
|
if (__m_ == nullptr)
|
|
__throw_system_error(EPERM, "unique_lock::try_lock_for: references null mutex");
|
|
if (__owns_)
|
|
__throw_system_error(EDEADLK, "unique_lock::try_lock_for: already locked");
|
|
__owns_ = __m_->try_lock_for(__d);
|
|
return __owns_;
|
|
}
|
|
|
|
template <class _Mutex>
|
|
template <class _Clock, class _Duration>
|
|
bool
|
|
unique_lock<_Mutex>::try_lock_until(const chrono::time_point<_Clock, _Duration>& __t)
|
|
{
|
|
if (__m_ == nullptr)
|
|
__throw_system_error(EPERM, "unique_lock::try_lock_until: references null mutex");
|
|
if (__owns_)
|
|
__throw_system_error(EDEADLK, "unique_lock::try_lock_until: already locked");
|
|
__owns_ = __m_->try_lock_until(__t);
|
|
return __owns_;
|
|
}
|
|
|
|
template <class _Mutex>
|
|
void
|
|
unique_lock<_Mutex>::unlock()
|
|
{
|
|
if (!__owns_)
|
|
__throw_system_error(EPERM, "unique_lock::unlock: not locked");
|
|
__m_->unlock();
|
|
__owns_ = false;
|
|
}
|
|
|
|
template <class _Mutex>
|
|
inline _LIBCPP_INLINE_VISIBILITY
|
|
void
|
|
swap(unique_lock<_Mutex>& __x, unique_lock<_Mutex>& __y) _NOEXCEPT
|
|
{__x.swap(__y);}
|
|
|
|
//enum class cv_status
|
|
_LIBCPP_DECLARE_STRONG_ENUM(cv_status)
|
|
{
|
|
no_timeout,
|
|
timeout
|
|
};
|
|
_LIBCPP_DECLARE_STRONG_ENUM_EPILOG(cv_status)
|
|
|
|
class _LIBCPP_TYPE_VIS condition_variable
|
|
{
|
|
pthread_cond_t __cv_;
|
|
public:
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
#ifndef _LIBCPP_HAS_NO_CONSTEXPR
|
|
constexpr condition_variable() : __cv_(PTHREAD_COND_INITIALIZER) {}
|
|
#else
|
|
condition_variable() {__cv_ = (pthread_cond_t)PTHREAD_COND_INITIALIZER;}
|
|
#endif
|
|
~condition_variable();
|
|
|
|
private:
|
|
condition_variable(const condition_variable&); // = delete;
|
|
condition_variable& operator=(const condition_variable&); // = delete;
|
|
|
|
public:
|
|
void notify_one() _NOEXCEPT;
|
|
void notify_all() _NOEXCEPT;
|
|
|
|
void wait(unique_lock<mutex>& __lk) _NOEXCEPT;
|
|
template <class _Predicate>
|
|
void wait(unique_lock<mutex>& __lk, _Predicate __pred);
|
|
|
|
template <class _Clock, class _Duration>
|
|
cv_status
|
|
wait_until(unique_lock<mutex>& __lk,
|
|
const chrono::time_point<_Clock, _Duration>& __t);
|
|
|
|
template <class _Clock, class _Duration, class _Predicate>
|
|
bool
|
|
wait_until(unique_lock<mutex>& __lk,
|
|
const chrono::time_point<_Clock, _Duration>& __t,
|
|
_Predicate __pred);
|
|
|
|
template <class _Rep, class _Period>
|
|
cv_status
|
|
wait_for(unique_lock<mutex>& __lk,
|
|
const chrono::duration<_Rep, _Period>& __d);
|
|
|
|
template <class _Rep, class _Period, class _Predicate>
|
|
bool
|
|
wait_for(unique_lock<mutex>& __lk,
|
|
const chrono::duration<_Rep, _Period>& __d,
|
|
_Predicate __pred);
|
|
|
|
typedef pthread_cond_t* native_handle_type;
|
|
_LIBCPP_INLINE_VISIBILITY native_handle_type native_handle() {return &__cv_;}
|
|
|
|
private:
|
|
void __do_timed_wait(unique_lock<mutex>& __lk,
|
|
chrono::time_point<chrono::system_clock, chrono::nanoseconds>) _NOEXCEPT;
|
|
};
|
|
#endif // !_LIBCPP_HAS_NO_THREADS
|
|
|
|
template <class _To, class _Rep, class _Period>
|
|
inline _LIBCPP_INLINE_VISIBILITY
|
|
typename enable_if
|
|
<
|
|
chrono::__is_duration<_To>::value,
|
|
_To
|
|
>::type
|
|
__ceil(chrono::duration<_Rep, _Period> __d)
|
|
{
|
|
using namespace chrono;
|
|
_To __r = duration_cast<_To>(__d);
|
|
if (__r < __d)
|
|
++__r;
|
|
return __r;
|
|
}
|
|
|
|
#ifndef _LIBCPP_HAS_NO_THREADS
|
|
template <class _Predicate>
|
|
void
|
|
condition_variable::wait(unique_lock<mutex>& __lk, _Predicate __pred)
|
|
{
|
|
while (!__pred())
|
|
wait(__lk);
|
|
}
|
|
|
|
template <class _Clock, class _Duration>
|
|
cv_status
|
|
condition_variable::wait_until(unique_lock<mutex>& __lk,
|
|
const chrono::time_point<_Clock, _Duration>& __t)
|
|
{
|
|
using namespace chrono;
|
|
wait_for(__lk, __t - _Clock::now());
|
|
return _Clock::now() < __t ? cv_status::no_timeout : cv_status::timeout;
|
|
}
|
|
|
|
template <class _Clock, class _Duration, class _Predicate>
|
|
bool
|
|
condition_variable::wait_until(unique_lock<mutex>& __lk,
|
|
const chrono::time_point<_Clock, _Duration>& __t,
|
|
_Predicate __pred)
|
|
{
|
|
while (!__pred())
|
|
{
|
|
if (wait_until(__lk, __t) == cv_status::timeout)
|
|
return __pred();
|
|
}
|
|
return true;
|
|
}
|
|
|
|
template <class _Rep, class _Period>
|
|
cv_status
|
|
condition_variable::wait_for(unique_lock<mutex>& __lk,
|
|
const chrono::duration<_Rep, _Period>& __d)
|
|
{
|
|
using namespace chrono;
|
|
if (__d <= __d.zero())
|
|
return cv_status::timeout;
|
|
typedef time_point<system_clock, duration<long double, nano> > __sys_tpf;
|
|
typedef time_point<system_clock, nanoseconds> __sys_tpi;
|
|
__sys_tpf _Max = __sys_tpi::max();
|
|
system_clock::time_point __s_now = system_clock::now();
|
|
steady_clock::time_point __c_now = steady_clock::now();
|
|
if (_Max - __d > __s_now)
|
|
__do_timed_wait(__lk, __s_now + __ceil<nanoseconds>(__d));
|
|
else
|
|
__do_timed_wait(__lk, __sys_tpi::max());
|
|
return steady_clock::now() - __c_now < __d ? cv_status::no_timeout :
|
|
cv_status::timeout;
|
|
}
|
|
|
|
template <class _Rep, class _Period, class _Predicate>
|
|
inline _LIBCPP_INLINE_VISIBILITY
|
|
bool
|
|
condition_variable::wait_for(unique_lock<mutex>& __lk,
|
|
const chrono::duration<_Rep, _Period>& __d,
|
|
_Predicate __pred)
|
|
{
|
|
return wait_until(__lk, chrono::steady_clock::now() + __d,
|
|
_VSTD::move(__pred));
|
|
}
|
|
|
|
#endif // !_LIBCPP_HAS_NO_THREADS
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___MUTEX_BASE
|