Home
last modified time | relevance | path

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

/freebsd-12-stable/contrib/llvm-project/libcxx/include/__algorithm/
Dfind_end.h71 _BidirectionalIterator1 __l1 = __last1; in __find_end() local
77 if (__first1 == __l1) // return __last1 if no element matches *__first2 in __find_end()
79 if (__pred(*--__l1, *__l2)) in __find_end()
83 _BidirectionalIterator1 __m1 = __l1; in __find_end()
110 _RandomAccessIterator1 __l1 = __last1; in __find_end() local
115 if (__s == __l1) in __find_end()
117 if (__pred(*--__l1, *__l2)) in __find_end()
120 _RandomAccessIterator1 __m1 = __l1; in __find_end()
Dis_permutation.h41 _D1 __l1 = _VSTD::distance(__first1, __last1); in is_permutation() local
42 if (__l1 == _D1(1)) in is_permutation()
44 _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); in is_permutation()
96 _D1 __l1 = _VSTD::distance(__first1, __last1); in __is_permutation() local
100 if (__l1 != __l2) in __is_permutation()
/freebsd-12-stable/contrib/llvm-project/libcxx/include/
Dmutex334 try_lock(_L0& __l0, _L1& __l1)
339 if (__l1.try_lock())
354 try_lock(_L0& __l0, _L1& __l1, _L2& __l2, _L3&... __l3)
360 __r = try_lock(__l1, __l2, __l3...);
373 lock(_L0& __l0, _L1& __l1)
379 if (__l1.try_lock())
387 unique_lock<_L1> __u1(__l1);
402 __lock_first(int __i, _L0& __l0, _L1& __l1, _L2& __l2, _L3& ...__l3)
411 __i = try_lock(__l1, __l2, __l3...);
423 unique_lock<_L1> __u1(__l1);
[all …]
/freebsd-12-stable/contrib/libstdc++/include/tr1/
Drandom589 _UIntType1 __c1, int __l1,
594 __a1, __u1, __s1, __b1, __t1, __c1, __l1>& __x);
608 _UIntType1 __c1, int __l1,
613 __a1, __u1, __s1, __b1, __t1, __c1, __l1>& __x);