Home
last modified time | relevance | path

Searched refs:__u (Results 1 – 25 of 83) sorted by relevance

1234

/freebsd/contrib/llvm-project/libcxx/include/__utility/
H A Dcmp.h30 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_equal(_Tp __t, _Up __u) noexcept { in cmp_equal() argument
32 return __t == __u; in cmp_equal()
34 return __t < 0 ? false : make_unsigned_t<_Tp>(__t) == __u; in cmp_equal()
36 return __u < 0 ? false : __t == make_unsigned_t<_Up>(__u); in cmp_equal()
40 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_not_equal(_Tp __t, _Up __u) noexcept { in cmp_not_equal() argument
41 return !std::cmp_equal(__t, __u); in cmp_not_equal()
45 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_less(_Tp __t, _Up __u) noexcept { in cmp_less() argument
47 return __t < __u; in cmp_less()
49 return __t < 0 ? true : make_unsigned_t<_Tp>(__t) < __u; in cmp_less()
51 return __u < 0 ? false : __t < make_unsigned_t<_Up>(__u); in cmp_less()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Doperations.h54 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
55 noexcept(noexcept(std::forward<_T1>(__t) + std::forward<_T2>(__u))) //
56 -> decltype(std::forward<_T1>(__t) + std::forward<_T2>(__u)) {
57 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
80 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
81 noexcept(noexcept(std::forward<_T1>(__t) - std::forward<_T2>(__u))) //
82 -> decltype(std::forward<_T1>(__t) - std::forward<_T2>(__u)) {
83 return std::forward<_T1>(__t) - std::forward<_T2>(__u);
106 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
107 noexcept(noexcept(std::forward<_T1>(__t) * std::forward<_T2>(__u))) //
[all …]
H A Dranges_operations.h32 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
33 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) { in operator()
34 return std::forward<_Tp>(__t) == std::forward<_Up>(__u); in operator()
43 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
44 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) { in operator()
45 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u)); in operator()
54 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
55 noexcept(noexcept(bool(std::forward<_Tp>(__t) < std::forward<_Up>(__u)))) { in operator()
56 return std::forward<_Tp>(__t) < std::forward<_Up>(__u); in operator()
65 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
[all …]
H A Dhash.h146 …ABI _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK static _Size __hash_len_16(_Size __u, _Size __v) {
148 _Size __a = (__u ^ __v) * __mul;
261 } __u;
262 __u.__a = 0;
263 __u.__t = __v;
264 return __u.__a;
274 } __u;
275 __u.__t = __v;
276 return __u.__a;
289 } __u;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dstrong_order.h46 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept(
47 noexcept(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 -> decltype(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
49 return strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
55 …_LIBCPP_HIDE_FROM_ABI static constexpr strong_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<1… in __go()
58 int32_t __ry = std::bit_cast<int32_t>(__u); in __go()
64 int64_t __ry = std::bit_cast<int64_t>(__u); in __go()
68 } else if (__t < __u) { in __go()
70 } else if (__t > __u) { in __go()
72 } else if (__t == __u) { in __go()
[all …]
H A Dcompare_partial_order_fallback.h34 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
35 noexcept(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
41 requires is_same_v<decay_t<_Tp>, decay_t<_Up>> && requires(_Tp&& __t, _Up&& __u) { in requires()
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
44 { std::forward<_Up>(__u) < std::forward<_Tp>(__t) } -> __boolean_testable; in requires()
46 …_LIBCPP_HIDE_FROM_ABI static constexpr partial_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<… in __go()
47 noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent in __go()
[all …]
H A Dweak_order.h39 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<3>) noexcept(
40 noexcept(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
41 -> decltype(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
42 return weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
48 …_LIBCPP_HIDE_FROM_ABI static constexpr weak_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<2>)… in __go()
49 partial_ordering __po = (__t <=> __u); in __go()
59 bool __u_is_nan = __math::isnan(__u); in __go()
61 bool __u_is_negative = __math::signbit(__u); in __go()
74 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
75 noexcept(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
[all …]
H A Dcompare_strong_order_fallback.h34 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
35 noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
41 requires is_same_v<decay_t<_Tp>, decay_t<_Up>> && requires(_Tp&& __t, _Up&& __u) { in requires()
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
45 …_LIBCPP_HIDE_FROM_ABI static constexpr strong_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<0… in __go()
46 noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal in __go()
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? strong_ordering::less in __go()
[all …]
H A Dcompare_weak_order_fallback.h34 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
35 noexcept(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
41 requires is_same_v<decay_t<_Tp>, decay_t<_Up>> && requires(_Tp&& __t, _Up&& __u) { in requires()
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
45 …_LIBCPP_HIDE_FROM_ABI static constexpr weak_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)… in __go()
46 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent in __go()
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) in __go()
[all …]
H A Dpartial_order.h37 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept(
38 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
39 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
40 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
46 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
47 … noexcept(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 …> decltype(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
49 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
54 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(
55 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
[all …]
H A Dsynth_three_way.h28 … inline constexpr auto __synth_three_way = []<class _Tp, class _Up>(const _Tp& __t, const _Up& __u)
30 { __t < __u } -> __boolean_testable;
31 { __u < __t } -> __boolean_testable;
35 return __t <=> __u;
37 if (__t < __u)
39 if (__u < __t)
/freebsd/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h49 requires(_Tp&& __t, _Up&& __u) { in requires() argument
50 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
61 requires(_Tp (&__t)[_Size], _Up (&__u)[_Size], const __fn& __swap) {
62 __swap(__t[0], __u[0]);
75 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp&& __t, _Up&& __u) const in operator()
76 noexcept(noexcept(swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { in operator()
77 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator()
83 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp (&__t)[_Size], _Up (&__u)[_Size]) const in operator()
84 noexcept(noexcept((*this)(*__t, *__u))) { in operator()
87 (*this)(__t[__i], __u[__i]); in operator()
[all …]
H A Dtotally_ordered.h29 …ially_ordered_with = requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) { in requires() argument
30 { __t < __u } -> __boolean_testable; in requires()
31 { __t > __u } -> __boolean_testable; in requires()
32 { __t <= __u } -> __boolean_testable; in requires()
33 { __t >= __u } -> __boolean_testable; in requires()
34 { __u < __t } -> __boolean_testable; in requires()
35 { __u > __t } -> __boolean_testable; in requires()
36 { __u <= __t } -> __boolean_testable; in requires()
37 { __u >= __t } -> __boolean_testable; in requires()
H A Dequality_comparable.h30 requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) { in requires() argument
31 { __t == __u } -> __boolean_testable; in requires()
32 { __t != __u } -> __boolean_testable; in requires()
33 { __u == __t } -> __boolean_testable; in requires()
34 { __u != __t } -> __boolean_testable; in requires()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__functional/
H A Dhash.h141 …ABI _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK static _Size __hash_len_16(_Size __u, _Size __v) {
143 _Size __a = (__u ^ __v) * __mul;
248 } __u;
249 __u.__a = 0;
250 __u.__t = __v;
251 return __u.__a;
261 } __u;
262 __u.__t = __v;
263 return __u.__a;
276 } __u;
[all …]
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Darm_cmse.h90 cmse_address_info_t __u; in cmse_TT() local
91 __u.value = __builtin_arm_cmse_TT(__p); in cmse_TT()
92 return __u; in cmse_TT()
96 cmse_address_info_t __u; in cmse_TTT() local
97 __u.value = __builtin_arm_cmse_TTT(__p); in cmse_TTT()
98 return __u; in cmse_TTT()
104 cmse_address_info_t __u; in cmse_TTA() local
105 __u.value = __builtin_arm_cmse_TTA(__p); in cmse_TTA()
106 return __u; in cmse_TTA()
110 cmse_address_info_t __u; in cmse_TTAT() local
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__mutex/
H A Dunique_lock.h69 [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI unique_lock(unique_lock&& __u) _NOEXCEPT in unique_lock() argument
70 : __m_(__u.__m_), in unique_lock()
71 __owns_(__u.__owns_) { in unique_lock()
72 __u.__m_ = nullptr; in unique_lock()
73 __u.__owns_ = false; in unique_lock()
76 _LIBCPP_HIDE_FROM_ABI unique_lock& operator=(unique_lock&& __u) _NOEXCEPT {
80 __m_ = __u.__m_;
81 __owns_ = __u.__owns_;
82 __u.__m_ = nullptr;
83 __u.__owns_ = false;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__mutex/
H A Dunique_lock.h71 _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI unique_lock(unique_lock&& __u) _NOEXCEPT in unique_lock() argument
72 : __m_(__u.__m_), in unique_lock()
73 __owns_(__u.__owns_) { in unique_lock()
74 __u.__m_ = nullptr; in unique_lock()
75 __u.__owns_ = false; in unique_lock()
78 _LIBCPP_HIDE_FROM_ABI unique_lock& operator=(unique_lock&& __u) _NOEXCEPT {
82 __m_ = __u.__m_;
83 __owns_ = __u.__owns_;
84 __u.__m_ = nullptr;
85 __u.__owns_ = false;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__random/
H A Dmersenne_twister_engine.h36 size_t __u,
128 size_t __u,
151 static_assert(__u <= __w, "mersenne_twister_engine invalid parameters");
172 static const size_t tempering_u = __u;
312 size_t __u,
321 …mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f…
329 size_t __u,
338 …mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f…
346 size_t __u,
355 …mersenne_twister_engine<_UIntType, __w, __n, __m, __r, __a, __u, __d, __s, __b, __t, __c, __l, __f…
[all …]
H A Duniform_int_distribution.h108 _Engine_result_type __u; in __eval() local
110 __u = __e_() - _Engine::min(); in __eval()
111 } while (__u >= __y0_); in __eval()
116 __sp += __u & __mask0_; in __eval()
119 _Engine_result_type __u; in __eval() local
121 __u = __e_() - _Engine::min(); in __eval()
122 } while (__u >= __y1_); in __eval()
127 __sp += __u & __mask1_; in __eval()
214 _UIntType __u; in operator() local
216 __u = __e(); in operator()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Dunique_ptr.h211 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(unique_ptr&& __u) _NOEXCEPT
212 : __ptr_(__u.release()),
213 __deleter_(std::forward<deleter_type>(__u.get_deleter())) {}
219 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr(unique_ptr<_Up, _Ep>&& __u) _NOEXCE…
220 : __ptr_(__u.release()),
221 __deleter_(std::forward<_Ep>(__u.get_deleter())) {}
229 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(unique_ptr&& __u) _NOEXC…
230 reset(__u.release());
231 __deleter_ = std::forward<deleter_type>(__u.get_deleter());
239 …ROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 unique_ptr& operator=(unique_ptr<_Up, _Ep>&& __u) _NOEXCEPT {
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__memory/
H A Dunique_ptr.h188 _LIBCPP_HIDE_FROM_ABI unique_ptr(unique_ptr&& __u) _NOEXCEPT
189 : __ptr_(__u.release(), std::forward<deleter_type>(__u.get_deleter())) {}
195 _LIBCPP_HIDE_FROM_ABI unique_ptr(unique_ptr<_Up, _Ep>&& __u) _NOEXCEPT
196 : __ptr_(__u.release(), std::forward<_Ep>(__u.get_deleter())) {}
202 _LIBCPP_HIDE_FROM_ABI unique_ptr& operator=(unique_ptr&& __u) _NOEXCEPT {
203 reset(__u.release());
204 __ptr_.second() = std::forward<deleter_type>(__u.get_deleter());
212 _LIBCPP_HIDE_FROM_ABI unique_ptr& operator=(unique_ptr<_Up, _Ep>&& __u) _NOEXCEPT {
213 reset(__u.release());
214 __ptr_.second() = std::forward<_Ep>(__u.get_deleter());
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__numeric/
H A Dtransform_inclusive_scan.h26 _InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOp __b, _UnaryOp __u, _Tp __init) {
28 __init = __b(__init, __u(*__first)); in transform_inclusive_scan() argument
37 _InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOp __b, _UnaryOp __u) {
39 typename iterator_traits<_InputIterator>::value_type __init = __u(*__first);
42 return std::transform_inclusive_scan(__first, __last, __result, __b, __u, __init); in transform_inclusive_scan() argument
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A D__hash_table712 _LIBCPP_HIDE_FROM_ABI __hash_table(const __hash_table& __u);
713 _LIBCPP_HIDE_FROM_ABI __hash_table(const __hash_table& __u, const allocator_type& __a);
714 _LIBCPP_HIDE_FROM_ABI __hash_table(__hash_table&& __u);
715 _LIBCPP_HIDE_FROM_ABI __hash_table(__hash_table&& __u, const allocator_type& __a);
718 _LIBCPP_HIDE_FROM_ABI __hash_table& operator=(const __hash_table& __u);
719 _LIBCPP_HIDE_FROM_ABI __hash_table& operator=(__hash_table&& __u);
860 _LIBCPP_HIDE_FROM_ABI void swap(__hash_table& __u);
912 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const __hash_table& __u) {
913 …__copy_assign_alloc(__u, integral_constant<bool, __node_traits::propagate_on_container_copy_assign…
915 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const __hash_table& __u, true_type);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__random/
H A Duniform_int_distribution.h112 _Engine_result_type __u; in __eval() local
114 __u = __e_() - _Engine::min(); in __eval()
115 } while (__u >= __y0_); in __eval()
120 __sp += __u & __mask0_; in __eval()
123 _Engine_result_type __u; in __eval() local
125 __u = __e_() - _Engine::min(); in __eval()
126 } while (__u >= __y1_); in __eval()
131 __sp += __u & __mask1_; in __eval()
225 _UIntType __u; in operator() local
227 __u = __e(); in operator()
[all …]

1234