xref: /freebsd/contrib/llvm-project/libcxx/src/algorithm.cpp (revision e64bea71c21eb42e97aa615188ba91f6cce0d36d)
1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 
9 #include <algorithm>
10 #include <bit>
11 
12 _LIBCPP_BEGIN_NAMESPACE_STD
13 
14 template <class Comp, class RandomAccessIterator>
__sort(RandomAccessIterator first,RandomAccessIterator last,Comp comp)15 void __sort(RandomAccessIterator first, RandomAccessIterator last, Comp comp) {
16   if (first == last) // log(0) is undefined, so don't try computing the depth
17     return;
18 
19   auto depth_limit = 2 * std::__bit_log2(static_cast<size_t>(last - first));
20 
21   // Only use bitset partitioning for arithmetic types.  We should also check
22   // that the default comparator is in use so that we are sure that there are no
23   // branches in the comparator.
24   std::__introsort<_ClassicAlgPolicy,
25                    ranges::less,
26                    RandomAccessIterator,
27                    __use_branchless_sort<ranges::less, RandomAccessIterator>>(first, last, ranges::less{}, depth_limit);
28 }
29 
30 // clang-format off
31 template void __sort<__less<char>&, char*>(char*, char*, __less<char>&);
32 #if _LIBCPP_HAS_WIDE_CHARACTERS
33 template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
34 #endif
35 template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
36 template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&);
37 template void __sort<__less<short>&, short*>(short*, short*, __less<short>&);
38 template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&);
39 template void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
40 template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
41 template void __sort<__less<long>&, long*>(long*, long*, __less<long>&);
42 template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&);
43 template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&);
44 template void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&);
45 template void __sort<__less<float>&, float*>(float*, float*, __less<float>&);
46 template void __sort<__less<double>&, double*>(double*, double*, __less<double>&);
47 template void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&);
48 // clang-format on
49 
50 _LIBCPP_END_NAMESPACE_STD
51