Home
last modified time | relevance | path

Searched refs:__t2 (Results 1 – 10 of 10) sorted by relevance

/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dstable_partition.h77 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) in __stable_partition_impl() local
78 *__i = _Ops::__iter_move(__t2); in __stable_partition_impl()
209 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) in __stable_partition_impl() local
210 *__i = _Ops::__iter_move(__t2); in __stable_partition_impl()
/llvm-project-15.0.7/clang/test/CodeGen/
H A Ddebug-info-enum-case-val.c19 typedef __t1 __t2; typedef
20 int func2(__t2 a) { in func2()
/llvm-project-15.0.7/clang/test/Sema/
H A Dattr-btf_tag.c47 } __t2 __tag1 __tag2;
48 int convert2(__t2 *arg) { in convert2()
/llvm-project-15.0.7/libcxx/include/__utility/
H A Dpair.h63 pair(_T1 const& __t1, _T2 const& __t2) : first(__t1), second(__t2) {} in pair()
157 explicit pair(_T1 const& __t1, _T2 const& __t2) in pair()
160 : first(__t1), second(__t2) {} in pair()
166 pair(_T1 const& __t1, _T2 const& __t2) in pair()
169 : first(__t1), second(__t2) {} in pair()
428 make_pair(_T1&& __t1, _T2&& __t2)
431 (_VSTD::forward<_T1>(__t1), _VSTD::forward<_T2>(__t2));
/llvm-project-15.0.7/libcxx/include/
H A D__threading_support209 bool __libcpp_thread_id_equal(__libcpp_thread_id __t1, __libcpp_thread_id __t2);
212 bool __libcpp_thread_id_less(__libcpp_thread_id __t1, __libcpp_thread_id __t2);
357 bool __libcpp_thread_id_equal(__libcpp_thread_id __t1, __libcpp_thread_id __t2)
359 return __t1 == __t2;
363 bool __libcpp_thread_id_less(__libcpp_thread_id __t1, __libcpp_thread_id __t2)
365 return __t1 < __t2;
H A Dvariant1616 _LIBCPP_INLINE_VISIBILITY constexpr bool operator()(_T1 && __t1, _T2&& __t2) const {
1617 …vertible<decltype(_Operator{}(_VSTD::forward<_T1>(__t1), _VSTD::forward<_T2>(__t2))), bool>::value,
1619 return _Operator{}(_VSTD::forward<_T1>(__t1), _VSTD::forward<_T2>(__t2));
H A Dregex4461 _ForwardIterator __t2 = __parse_decimal_escape(__t1, __last);
4462 if (__t2 != __t1)
4463 __first = __t2;
4466 __t2 = __parse_character_class_escape(__t1, __last);
4467 if (__t2 != __t1)
4468 __first = __t2;
4471 __t2 = __parse_character_escape(__t1, __last);
4472 if (__t2 != __t1)
4473 __first = __t2;
/llvm-project-15.0.7/lldb/test/API/functionalities/data-formatter/data-formatter-stl/libcxx/string/simulator/
H A Dmain.cpp61 explicit __compressed_pair(_T1 __t1, _T2 __t2) : _Base1(__t1), _Base2(__t2) {} in __compressed_pair() argument
/llvm-project-15.0.7/libcxx/include/__memory/
H A Dcompressed_pair.h108 …icit __compressed_pair(_U1&& __t1, _U2&& __t2) : _Base1(std::forward<_U1>(__t1)), _Base2(std::forw…
/llvm-project-15.0.7/clang/lib/Headers/ppc_wrappers/
H A Dxmmintrin.h1807 __v4sf __t2 = vec_vmrglw(__r0, __r1); \
1813 (row2) = (__v4sf)vec_mergeh((__vector long long)__t2, \
1815 (row3) = (__v4sf)vec_mergel((__vector long long)__t2, \