Home
last modified time | relevance | path

Searched refs:__l1 (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dfind_end.h106 _Iter1 __l1 = __last1; in __find_end() local
112 if (__first1 == __l1) // return __last1 if no element matches *__first2 in __find_end()
114 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
118 _Iter1 __m1 = __l1; in __find_end()
163 _Iter1 __l1 = __last1; in __find_end() local
168 if (__s == __l1) in __find_end()
170 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
173 _Iter1 __m1 = __l1; in __find_end()
H A Dis_permutation.h129 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
130 if (__l1 == _D1(1))
132 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
176 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
180 if (__l1 != __l2)
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmutex326 _LIBCPP_HIDE_FROM_ABI int try_lock(_L0& __l0, _L1& __l1) {
329 if (__l1.try_lock()) {
341 _LIBCPP_HIDE_FROM_ABI int try_lock(_L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3) {
345 __r = std::try_lock(__l1, __l2, __l3...);
357 _LIBCPP_HIDE_FROM_ABI void lock(_L0& __l0, _L1& __l1) {
361 if (__l1.try_lock()) {
368 unique_lock<_L1> __u1(__l1);
381 void __lock_first(int __i, _L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3) {
386 __i = std::try_lock(__l1, __l2, __l3...);
396 unique_lock<_L1> __u1(__l1);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dalgorithm_impl.h