Home
last modified time | relevance | path

Searched refs:__t (Results 1 – 25 of 133) sorted by relevance

123456

/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Daccess.h44 concept __member_begin = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
45 { _LIBCPP_AUTO_CAST(__t.begin()) } -> input_or_output_iterator; in requires()
52 …er_begin<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
53 { _LIBCPP_AUTO_CAST(begin(__t)) } -> input_or_output_iterator;
58 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[]) const noexcept in operator()
61 return __t + 0; in operator()
65 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[_Np]) const noexcept in operator()
68 return __t + 0; in operator()
73 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
74 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.begin()))) { in operator()
[all …]
H A Drend.h40 concept __member_rend = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
41 ranges::rbegin(__t); in requires()
42 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; in requires()
49 …ber_rend<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
50 ranges::rbegin(__t);
51 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
55 …rse = __can_borrow<_Tp> && !__member_rend<_Tp> && !__unqualified_rend<_Tp> && requires(_Tp&& __t) {
56 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
57 { ranges::begin(__t) } -> bidirectional_iterator;
64 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
[all …]
H A Dsize.h50 concept __member_size = __size_enabled<_Tp> && requires(_Tp&& __t) { in requires() argument
51 { _LIBCPP_AUTO_CAST(__t.size()) } -> __integer_like; in requires()
56 …nabled<_Tp> && !__member_size<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
57 { _LIBCPP_AUTO_CAST(size(__t)) } -> __integer_like;
62 …e<_Tp> && !__unqualified_size<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
63 { ranges::begin(__t) } -> forward_iterator;
64 { ranges::end(__t) } -> sized_sentinel_for<decltype(ranges::begin(std::declval<_Tp>()))>;
82 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr __integer_like auto operator()(_Tp&& __t) const in operator()
83 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.size()))) { in operator()
84 return _LIBCPP_AUTO_CAST(__t.size()); in operator()
[all …]
H A Drbegin.h39 concept __member_rbegin = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
40 { _LIBCPP_AUTO_CAST(__t.rbegin()) } -> input_or_output_iterator; in requires()
47 …r_rbegin<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
48 { _LIBCPP_AUTO_CAST(rbegin(__t)) } -> input_or_output_iterator;
53 … __can_borrow<_Tp> && !__member_rbegin<_Tp> && !__unqualified_rbegin<_Tp> && requires(_Tp&& __t) {
54 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
55 { ranges::begin(__t) } -> bidirectional_iterator;
61 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
62 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.rbegin()))) { in operator()
63 return _LIBCPP_AUTO_CAST(__t.rbegin()); in operator()
[all …]
H A Dempty.h32 concept __member_empty = requires(_Tp&& __t) { bool(__t.empty()); }; in requires() argument
35 concept __can_invoke_size = !__member_empty<_Tp> && requires(_Tp&& __t) { ranges::size(__t); };
38 … __can_compare_begin_end = !__member_empty<_Tp> && !__can_invoke_size<_Tp> && requires(_Tp&& __t) {
39 bool(ranges::begin(__t) == ranges::end(__t));
40 { ranges::begin(__t) } -> forward_iterator;
45 …d]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const noexcept(noexcept(bool(__t.em… in operator()
46 return bool(__t.empty()); in operator()
50 …_LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const noexcept(noexcept(ranges::size(__… in operator()
51 return ranges::size(__t) == 0; in operator()
55 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const in operator()
[all …]
H A Ddata.h43 concept __member_data = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
44 { _LIBCPP_AUTO_CAST(__t.data()) } -> __ptr_to_object; in requires()
48 concept __ranges_begin_invocable = !__member_data<_Tp> && __can_borrow<_Tp> && requires(_Tp&& __t) {
49 { ranges::begin(__t) } -> contiguous_iterator;
54 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const noexcept(noexcept(__t.data())) { in operator()
55 return __t.data(); in operator()
59 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
60 noexcept(noexcept(std::to_address(ranges::begin(__t)))) { in operator()
61 return std::to_address(ranges::begin(__t)); in operator()
78 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
[all …]
H A Dall.h42 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const noexcept(
43 …noexcept(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t)))) -> decltype(_LIBCPP_AUTO_CAST(std::forward<_T…
44 return _LIBCPP_AUTO_CAST(std::forward<_Tp>(__t));
48 …quires(!ranges::view<decay_t<_Tp>>) && requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__… in requires()
49 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
50 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) { in operator()
51 return ranges::ref_view{std::forward<_Tp>(__t)};
56 …!ranges::view<decay_t<_Tp>> && !requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } …
57 requires(_Tp&& __t) { ranges::owning_view{std::forward<_Tp>(__t)}; })
58 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
[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()
57 int32_t __rx = std::bit_cast<int32_t>(__t); in __go()
63 int64_t __rx = std::bit_cast<int64_t>(__t); 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 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()
58 bool __t_is_nan = __math::isnan(__t); in __go()
60 bool __t_is_negative = __math::signbit(__t); 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_partial_order_fallback.h33 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
34 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));
41 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(noexcept(
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)
47 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
48 : std::forward<_Tp>(__t) < st
[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 Dcompare_strong_order_fallback.h33 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
34 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));
41 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(noexcept(
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)
[all...]
H A Dcompare_weak_order_fallback.h33 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
34 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));
41 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(noexcept(
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)
[all...]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Doperations.h52 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
53 noexcept(noexcept(std::forward<_T1>(__t) + std::forward<_T2>(__u))) //
54 -> decltype(std::forward<_T1>(__t) + std::forward<_T2>(__u)) {
55 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
78 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
79 noexcept(noexcept(std::forward<_T1>(__t) - std::forward<_T2>(__u))) //
80 -> decltype(std::forward<_T1>(__t) - std::forward<_T2>(__u)) {
81 return std::forward<_T1>(__t) - std::forward<_T2>(__u);
104 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
105 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 …]
/freebsd/contrib/llvm-project/libcxx/include/__utility/
H A Dcmp.h30 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_equal(_Tp __t, _Up __u) noexcept {
32 return __t == __u;
34 return __t < 0 ? false : make_unsigned_t<_Tp>(__t) == __u;
36 return __u < 0 ? false : __t == make_unsigned_t<_Up>(__u);
40 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_not_equal(_Tp __t, _Up __u) noexcept {
41 return !std::cmp_equal(__t, __u);
45 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_less(_Tp __t, _Up __u) noexcept {
47 return __t < __u;
49 return __t < in cmp_equal()
48 cmp_equal(_Tp __t,_Up __u) cmp_equal() argument
60 cmp_not_equal(_Tp __t,_Up __u) cmp_not_equal() argument
67 cmp_less(_Tp __t,_Up __u) cmp_less() argument
79 cmp_greater(_Tp __t,_Up __u) cmp_greater() argument
86 cmp_less_equal(_Tp __t,_Up __u) cmp_less_equal() argument
93 cmp_greater_equal(_Tp __t,_Up __u) cmp_greater_equal() argument
[all...]
/freebsd/contrib/llvm-project/libcxx/include/__numeric/
H A Dpartial_sum.h30 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
31 *__result = __t; in partial_sum()
34 __t = std::move(__t) + *__first; in partial_sum()
36 __t = __t + *__first; in partial_sum()
38 *__result = __t; in partial_sum()
48 typename iterator_traits<_InputIterator>::value_type __t(*__first);
49 *__result = __t;
52 __t in partial_sum()
[all...]
/freebsd/contrib/llvm-project/libcxx/include/__bit/
H A Dcountr.h42 _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int __countr_zero(_Tp __t) _N… in __countr_zero() argument
44 return __builtin_ctzg(__t, numeric_limits<_Tp>::digits); in __countr_zero()
46 if (__t == 0) in __countr_zero()
49 return std::__libcpp_ctz(static_cast<unsigned int>(__t)); in __countr_zero()
51 return std::__libcpp_ctz(static_cast<unsigned long>(__t)); in __countr_zero()
53 return std::__libcpp_ctz(static_cast<unsigned long long>(__t)); in __countr_zero()
57 while (static_cast<unsigned long long>(__t) == 0uLL) { in __countr_zero()
59 __t >>= __ulldigits; in __countr_zero()
61 return __ret + std::__libcpp_ctz(static_cast<unsigned long long>(__t)); in __countr_zero()
69 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr int countr_zero(_Tp __t) noexcept { in countr_zero() argument
[all …]
H A Dcountl.h63 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int __countl_zero(_Tp __t) _NOEXCEPT { in __countl_zero() argument
66 return __builtin_clzg(__t, numeric_limits<_Tp>::digits); in __countl_zero()
68 if (__t == 0) in __countl_zero()
72 return std::__libcpp_clz(static_cast<unsigned int>(__t)) - in __countl_zero()
75 return std::__libcpp_clz(static_cast<unsigned long>(__t)) - in __countl_zero()
78 return std::__libcpp_clz(static_cast<unsigned long long>(__t)) - in __countl_zero()
85 __t = std::__rotl(__t, __ulldigits); in __countl_zero()
86 if ((__iter = std::__countl_zero(static_cast<unsigned long long>(__t))) != __ulldigits) in __countl_zero()
98 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr int countl_zero(_Tp __t) noexcept { in countl_zero() argument
99 return std::__countl_zero(__t); in countl_zero()
[all …]
H A Dpopcount.h44 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr int popcount(_Tp __t) noexcept { in popcount() argument
46 return __builtin_popcountg(__t); in popcount()
49 return std::__libcpp_popcount(static_cast<unsigned int>(__t)); in popcount()
51 return std::__libcpp_popcount(static_cast<unsigned long>(__t)); in popcount()
53 return std::__libcpp_popcount(static_cast<unsigned long long>(__t)); in popcount()
56 while (__t != 0) { in popcount()
57 __ret += std::__libcpp_popcount(static_cast<unsigned long long>(__t)); in popcount()
58 __t >>= numeric_limits<unsigned long long>::digits; in popcount()
/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()
77 noexcept(noexcept(swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { in operator()
78 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator()
84 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp (&__t)[_Size], _Up (&__u)[_Size]) const in operator()
85 noexcept(noexcept((*this)(*__t, *__u))) { in operator()
88 (*this)(__t[__i], __u[__i]); in operator()
[all …]
H A Dtotally_ordered.h29 concept __partially_ordered_with = requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_r… 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()
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Diter_move.h41 concept __unqualified_iter_move = __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) { in requires() argument
43 iter_move(std::forward<_Tp>(__t)); in requires()
47 concept __move_deref = !__unqualified_iter_move<_Tp> && requires(_Tp&& __t) {
48 *__t;
49 requires is_lvalue_reference_v<decltype(*__t)>;
53 concept __just_deref = !__unqualified_iter_move<_Tp> && !__move_deref<_Tp> && requires(_Tp&& __t) {
54 *__t;
55 requires(!is_lvalue_reference_v<decltype(*__t)>);
92 requires requires(_Tp& __t) { in requires() argument
93 { ranges::iter_move(__t) } -> __can_reference; in requires()
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Darm_acle.h157 __clz(uint32_t __t) { in __clz() argument
158 return __builtin_arm_clz(__t); in __clz()
162 __clzl(unsigned long __t) { in __clzl() argument
164 return __builtin_arm_clz(__t); in __clzl()
166 return __builtin_arm_clz64(__t); in __clzl()
171 __clzll(uint64_t __t) { in __clzll() argument
172 return __builtin_arm_clz64(__t); in __clzll()
177 __cls(uint32_t __t) { in __cls() argument
178 return __builtin_arm_cls(__t); in __cls()
182 __clsl(unsigned long __t) { in __clsl() argument
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__thread/support/
H A Dpthread.h169 inline _LIBCPP_HIDE_FROM_ABI __libcpp_thread_id __libcpp_thread_get_id(const __libcpp_thread_t* __t… in __libcpp_thread_get_id() argument
171 return __t->__; in __libcpp_thread_get_id()
173 return *__t; in __libcpp_thread_get_id()
177 inline _LIBCPP_HIDE_FROM_ABI bool __libcpp_thread_isnull(const __libcpp_thread_t* __t) { in __libcpp_thread_isnull() argument
178 return __libcpp_thread_get_id(__t) == 0; in __libcpp_thread_isnull()
181 inline _LIBCPP_HIDE_FROM_ABI int __libcpp_thread_create(__libcpp_thread_t* __t, void* (*__func)(voi… in __libcpp_thread_create() argument
182 return pthread_create(__t, nullptr, __func, __arg); in __libcpp_thread_create()
190 …PP_HIDE_FROM_ABI int __libcpp_thread_join(__libcpp_thread_t* __t) { return pthread_join(*__t, null… in __libcpp_thread_join() argument
192 …P_HIDE_FROM_ABI int __libcpp_thread_detach(__libcpp_thread_t* __t) { return pthread_detach(*__t); } in __libcpp_thread_detach() argument

123456