Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/libcxx/include/__utility/
H A Dcmp.h32 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()
41 return !std::cmp_equal(__t, __u); in cmp_not_equal()
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()
56 return std::cmp_less(__u, __t); in cmp_greater()
61 return !std::cmp_greater(__t, __u); in cmp_less_equal()
66 return !std::cmp_less(__t, __u); in cmp_greater_equal()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Doperations.h56 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
82 return std::forward<_T1>(__t) - std::forward<_T2>(__u);
108 return std::forward<_T1>(__t) * std::forward<_T2>(__u);
134 return std::forward<_T1>(__t) / std::forward<_T2>(__u);
160 return std::forward<_T1>(__t) % std::forward<_T2>(__u);
211 return std::forward<_T1>(__t) & std::forward<_T2>(__u);
255 return std::forward<_T1>(__t) | std::forward<_T2>(__u);
281 return std::forward<_T1>(__t) ^ std::forward<_T2>(__u);
309 return std::forward<_T1>(__t) == std::forward<_T2>(__u);
370 return std::forward<_T1>(__t) < std::forward<_T2>(__u);
[all …]
H A Dranges_operations.h34 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) { in operator()
35 return std::forward<_Tp>(__t) == std::forward<_Up>(__u); in operator()
45 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) { in operator()
46 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u)); in operator()
56 noexcept(noexcept(bool(std::forward<_Tp>(__t) < std::forward<_Up>(__u)))) { in operator()
57 return std::forward<_Tp>(__t) < std::forward<_Up>(__u); in operator()
67 noexcept(noexcept(bool(!(std::forward<_Up>(__u) < std::forward<_Tp>(__t))))) { in operator()
68 return !(std::forward<_Up>(__u) < std::forward<_Tp>(__t)); in operator()
78 noexcept(noexcept(bool(std::forward<_Up>(__u) < std::forward<_Tp>(__t)))) { in operator()
79 return std::forward<_Up>(__u) < std::forward<_Tp>(__t); in operator()
[all …]
H A Dhash.h253 } __u;
254 __u.__a = 0;
266 } __u;
281 } __u;
297 } __u;
314 } __u;
337 } __u;
469 } __u;
475 return __u.__s.__a ^ __u.__s.__b ^ __u.__s.__c ^ __u.__s.__d;
484 } __u;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dstrong_order.h53 int32_t __ry = std::bit_cast<int32_t>(__u); in __go()
59 int64_t __ry = std::bit_cast<int64_t>(__u); in __go()
63 } else if (__t < __u) { in __go()
65 } else if (__t > __u) { in __go()
67 } else if (__t == __u) { in __go()
69 return std::signbit(__u) <=> std::signbit(__t); in __go()
75 return std::signbit(__u) <=> std::signbit(__t); in __go()
79 (void)std::frexp(__u, &__uexp); in __go()
87 bool __u_is_nan = std::isnan(__u); in __go()
89 bool __u_is_negative = std::signbit(__u); in __go()
[all …]
H A Dweak_order.h36 noexcept(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
37 -> decltype(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
38 return weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
45 partial_ordering __po = (__t <=> __u); in __go()
55 bool __u_is_nan = std::isnan(__u); in __go()
57 bool __u_is_negative = std::signbit(__u); in __go()
73 return weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
79 noexcept(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
81 return weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
85 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
H A Dcompare_partial_order_fallback.h34 noexcept(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
44 : std::forward<_Up>(__u) < std::forward<_Tp>(__t)
49 : std::forward<_Up>(__u) < std::forward<_Tp>(__t)
53 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
54 : std::forward<_Up>(__u) < std::forward<_Tp>(__t)
60 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
H A Dpartial_order.h35 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept(
36 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
37 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
38 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
47 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
53 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
55 return partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
59 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
60 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())))
61 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())) {
[all …]
H A Dcompare_strong_order_fallback.h34 noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
46 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
50 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
51 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
57 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
H A Dcompare_weak_order_fallback.h34 noexcept(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
46 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
50 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
51 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
57 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
H A Dsynth_three_way.h33 _LIBCPP_HIDE_FROM_ABI constexpr auto __synth_three_way(const _Tp& __t, const _Up& __u) in __synth_three_way() argument
35 { __t < __u } -> __boolean_testable; in __synth_three_way()
36 { __u < __t } -> __boolean_testable; in __synth_three_way()
40 return __t <=> __u;
42 if (__t < __u)
44 if (__u < __t)
/freebsd/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h50 requires(_Tp&& __t, _Up&& __u) { in requires() argument
51 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
62 requires(_Tp (&__t)[_Size], _Up (&__u)[_Size], const __fn& __swap) {
63 __swap(__t[0], __u[0]);
76 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp&& __t, _Up&& __u) const in operator()
78 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator()
85 noexcept(noexcept((*this)(*__t, *__u))) { in operator()
88 (*this)(__t[__i], __u[__i]); in operator()
112 ranges::swap(std::forward<_Up>(__u), std::forward<_Up>(__u)); in requires()
113 ranges::swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
[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/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 …]
H A Demmintrin.h1535 double __u; in _mm_load1_pd() member
1537 double __u = ((const struct __mm_load1_pd_struct *)__dp)->__u; in _mm_load1_pd() local
1538 return __extension__(__m128d){__u, __u}; in _mm_load1_pd()
1650 double __u; in _mm_load_sd() member
1652 double __u = ((const struct __mm_load_sd_struct *)__dp)->__u; in _mm_load_sd() local
1676 double __u; in _mm_loadh_pd() member
1678 double __u = ((const struct __mm_loadh_pd_struct *)__dp)->__u; in _mm_loadh_pd() local
1702 double __u; in _mm_loadl_pd() member
1860 double __u; in _mm_store_sd() member
1976 double __u; in _mm_storeh_pd() member
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__mutex/
H A Dunique_lock.h69 …_LIBCPP_HIDE_FROM_ABI unique_lock(unique_lock&& __u) _NOEXCEPT : __m_(__u.__m_), __owns_(__u.__own… in unique_lock() argument
70 __u.__m_ = nullptr; in unique_lock()
71 __u.__owns_ = false; in unique_lock()
74 _LIBCPP_HIDE_FROM_ABI unique_lock& operator=(unique_lock&& __u) _NOEXCEPT {
78 __m_ = __u.__m_;
79 __owns_ = __u.__owns_;
80 __u.__m_ = nullptr;
81 __u.__owns_ = false;
96 _LIBCPP_HIDE_FROM_ABI void swap(unique_lock& __u) _NOEXCEPT { in swap() argument
97 std::swap(__m_, __u.__m_); in swap()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__random/
H A Dmersenne_twister_engine.h36 size_t __u,
128 size_t __u,
318 size_t __u,
335 size_t __u,
352 size_t __u,
401 __u,
449 __u,
497 __u,
545 __u,
593 __u,
[all …]
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 …]
H A Dgamma_distribution.h113 const result_type __u = __gen(__g); in operator() local
115 const result_type __w = __u * (1 - __u); in operator()
117 const result_type __y = std::sqrt(__c / __w) * (__u - result_type(0.5)); in operator()
131 const result_type __u = __gen(__g); in operator() local
133 if (__u <= 1 - __a) { in operator()
134 __x = std::pow(__u, 1 / __a); in operator()
138 const result_type __e = -std::log((1 - __u) / __a); in operator()
H A Dpoisson_distribution.h149 double __u; in operator() local
155 __u = __urd(__urng); in operator()
156 if (__pr.__d_ * __u >= __difmuk * __difmuk * __difmuk) in operator()
166 __u = __urd(__urng); in operator()
167 __u += __u - 1; in operator()
168 __t = 1.8 + (__u < 0 ? -__e : __e); in operator()
202 if (__pr.__c_ * std::abs(__u) <= __py * std::exp(__px + __e) - __fy * std::exp(__fx + __e)) in operator()
205 if (__fy - __u * __fy <= __py * std::exp(__px - __fx)) in operator()
/freebsd/contrib/llvm-project/libcxx/include/__numeric/
H A Dtransform_inclusive_scan.h26 …_first, _InputIterator __last, _OutputIterator __result, _BinaryOp __b, _UnaryOp __u, _Tp __init) { in transform_inclusive_scan() argument
28 __init = __b(__init, __u(*__first)); in transform_inclusive_scan()
37 …utIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOp __b, _UnaryOp __u) { in transform_inclusive_scan() argument
39 typename iterator_traits<_InputIterator>::value_type __init = __u(*__first); in transform_inclusive_scan()
42 return std::transform_inclusive_scan(__first, __last, __result, __b, __u, __init); in transform_inclusive_scan()
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Dunique_ptr.h191 : __ptr_(__u.release(), std::forward<deleter_type>(__u.get_deleter())) {}
198 : __ptr_(__u.release(), std::forward<_Ep>(__u.get_deleter())) {}
207 reset(__u.release());
217 reset(__u.release());
218 __ptr_.second() = std::forward<_Ep>(__u.get_deleter());
269 …ROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX23 void swap(unique_ptr& __u) _NOEXCEPT { __ptr_.swap(__u.__ptr…
375 : __ptr_(__u.release(), std::forward<deleter_type>(__u.get_deleter())) {}
378 reset(__u.release());
388 : __ptr_(__u.release(), std::forward<_Ep>(__u.get_deleter())) {}
395 reset(__u.release());
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A D__hash_table1027 __p3_(__u.__p3_) {}
1034 __p3_(__u.__p3_) {}
1062 if (__u.size() > 0) {
1096 __copy_assign_alloc(__u);
1100 __assign_multi(__u.begin(), __u.end());
1138 __move_assign_alloc(__u);
1180 while (__u.size() != 0) {
1980 __p2_.swap(__u.__p2_);
1981 __p3_.swap(__u.__p3_);
1984 if (__u.size() > 0)
[all …]
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Dpropagate_const169 return __u;
174 return __get_pointer(__u.get());
179 return __u;
184 return __get_pointer(__u.get());
222 …LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR propagate_const(_Up&& __u) : __t_(std::forward<_Up>(__u)) {}
228 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR propagate_const(_Up&& __u) : __t_(std::forward<_Up>(__u)) …
242 __t_ = std::forward<_Up>(__u);
335 return experimental::get_underlying(__pt) == __u;
340 return experimental::get_underlying(__pt) != __u;
345 return experimental::get_underlying(__pt) < __u;
[all …]

123