ff4f298780
This patch applies the _LIBCPP_SAFE_STATIC attribute to internal globals, most of which are locking primitives, in order to ensure that they can safely be used during program startup. This patch also fixes an unsafe static init issue with the global locks used to implement atomic operations on shared pointers. Previously the locks were initialized using a dynamically initialized pointer, so it was possible that the pointer was uninitialized. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@282640 91177308-0d34-0410-b5e6-96231b3b80d8
92 lines
4.4 KiB
C++
92 lines
4.4 KiB
C++
//===----------------------- algorithm.cpp --------------------------------===//
|
|
//
|
|
// 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "algorithm"
|
|
#include "random"
|
|
#include "mutex"
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template void __sort<__less<char>&, char*>(char*, char*, __less<char>&);
|
|
template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
|
|
template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
|
|
template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&);
|
|
template void __sort<__less<short>&, short*>(short*, short*, __less<short>&);
|
|
template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&);
|
|
template void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
|
|
template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
|
|
template void __sort<__less<long>&, long*>(long*, long*, __less<long>&);
|
|
template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&);
|
|
template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&);
|
|
template void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&);
|
|
template void __sort<__less<float>&, float*>(float*, float*, __less<float>&);
|
|
template void __sort<__less<double>&, double*>(double*, double*, __less<double>&);
|
|
template void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&);
|
|
|
|
template bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&);
|
|
template bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
|
|
template bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
|
|
template bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&);
|
|
template bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&);
|
|
template bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&);
|
|
template bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&);
|
|
template bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
|
|
template bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&);
|
|
template bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&);
|
|
template bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&);
|
|
template bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&);
|
|
template bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&);
|
|
template bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&);
|
|
template bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&);
|
|
|
|
template unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&);
|
|
|
|
#ifndef _LIBCPP_HAS_NO_THREADS
|
|
_LIBCPP_SAFE_STATIC static __libcpp_mutex_t __rs_mut = _LIBCPP_MUTEX_INITIALIZER;
|
|
#endif
|
|
unsigned __rs_default::__c_ = 0;
|
|
|
|
__rs_default::__rs_default()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_THREADS
|
|
__libcpp_mutex_lock(&__rs_mut);
|
|
#endif
|
|
__c_ = 1;
|
|
}
|
|
|
|
__rs_default::__rs_default(const __rs_default&)
|
|
{
|
|
++__c_;
|
|
}
|
|
|
|
__rs_default::~__rs_default()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_THREADS
|
|
if (--__c_ == 0)
|
|
__libcpp_mutex_unlock(&__rs_mut);
|
|
#else
|
|
--__c_;
|
|
#endif
|
|
}
|
|
|
|
__rs_default::result_type
|
|
__rs_default::operator()()
|
|
{
|
|
static mt19937 __rs_g;
|
|
return __rs_g();
|
|
}
|
|
|
|
__rs_default
|
|
__rs_get()
|
|
{
|
|
return __rs_default();
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|