Home
last modified time | relevance | path

Searched refs:__l2 (Results 1 – 7 of 7) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dstable_sort.h180 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort_move() local
181 _RandomAccessIterator __m = __first1 + __l2; in __stable_sort_move()
182 std::__stable_sort<_AlgPolicy, _Compare>(__first1, __m, __comp, __l2, __first2, __l2); in __stable_sort_move()
183 …able_sort<_AlgPolicy, _Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); in __stable_sort_move()
214 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort() local
215 _RandomAccessIterator __m = __first + __l2; in __stable_sort()
219 std::__stable_sort_move<_AlgPolicy, _Compare>(__first, __m, __comp, __l2, __buff); in __stable_sort()
220 __d.__set(__l2, (value_type*)nullptr); in __stable_sort()
221 std::__stable_sort_move<_AlgPolicy, _Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); in __stable_sort()
224 __buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); in __stable_sort()
[all …]
H A Dpartition_point.h30 difference_type __l2 = std::__half_positive(__len); in partition_point()
32 std::advance(__m, __l2); in partition_point() local
35 __len -= __l2 + 1; in partition_point()
37 __len = __l2; in partition_point()
H A Dfind_end.h107 _Iter2 __l2 = __last2; in __find_end() local
108 --__l2; in __find_end()
114 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
119 _Iter2 __m2 = __l2; in __find_end()
164 _Iter2 __l2 = __last2; in __find_end() local
165 --__l2; in __find_end()
170 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
174 _Iter2 __m2 = __l2; in __find_end()
H A Dlower_bound.h38 auto __l2 = std::__half_positive(__len); in __lower_bound_bisecting() local
40 _IterOps<_AlgPolicy>::advance(__m, __l2); in __lower_bound_bisecting()
43 __len -= __l2 + 1; in __lower_bound_bisecting()
45 __len = __l2; in __lower_bound_bisecting()
H A Dis_permutation.h179 _D2 __l2 = _IterOps<_AlgPolicy>::distance(__first2, __last2);
180 if (__l1 != __l2)
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmutex341 _LIBCPP_HIDE_FROM_ABI int try_lock(_L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3) {
345 __r = std::try_lock(__l1, __l2, __l3...);
381 void __lock_first(int __i, _L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3) {
386 __i = std::try_lock(__l1, __l2, __l3...);
397 __i = std::try_lock(__l2, __l3..., __l0);
410 std::__lock_first(__i - 2, __l2, __l3..., __l0, __l1);
417 inline _LIBCPP_HIDE_FROM_ABI void lock(_L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3) {
418 std::__lock_first(0, __l0, __l1, __l2, __l3...);
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dalgorithm_impl.h