/freebsd/contrib/llvm-project/libcxx/include/__string/ |
H A D | constexpr_c_functions.h | 76 auto __count = static_cast<size_t>(__n); in __constexpr_memcmp() local 81 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)); in __constexpr_memcmp() 84 while (__count != 0) { in __constexpr_memcmp() 90 --__count; in __constexpr_memcmp() 96 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)); in __constexpr_memcmp() 109 auto __count = static_cast<size_t>(__n); in __constexpr_memcmp_equal() local 114 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0; in __constexpr_memcmp_equal() 116 while (__count != 0) { in __constexpr_memcmp_equal() 120 --__count; in __constexpr_memcmp_equal() 126 return ::__builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0; in __constexpr_memcmp_equal() [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | counted.h | 47 …iter_difference_t<_It> __count) noexcept(noexcept(span(std::to_address(__it), static_cast<size_t>(… in __go() 50 return span(std::to_address(__it), static_cast<size_t>(__count)); in __go() 54 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_It __it, iter_difference_t<_It> __count) noexcep… 55 noexcept(subrange(__it, __it + __count))) -> decltype(subrange(__it, __it + __count)) { 56 return subrange(__it, __it + __count); 60 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_It __it, iter_difference_t<_It> __count) noexcep… 61 noexcept(subrange(counted_iterator(std::move(__it), __count), default_sentinel))) 62 -> decltype(subrange(counted_iterator(std::move(__it), __count), default_sentinel)) { 63 return subrange(counted_iterator(std::move(__it), __count), default_sentinel); 68 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_It&& __it, _Diff&& __count) const [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | iterator_operations.h | 85 …HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 static void advance(_Iter& __iter, _Distance __count) { 86 std::advance(__iter, __count); 168 __advance_to(_Iter& __iter, __difference_type<_Iter> __count, const _Iter& __sentinel) { 169 …return _IterOps::__advance_to(__iter, __count, __sentinel, typename iterator_traits<_Iter>::iterat… 176 …_InputIter& __iter, __difference_type<_InputIter> __count, const _InputIter& __sentinel, input_ite… 178 for (; __dist < __count && __iter != __sentinel; ++__dist) 180 return __count - __dist; 187 __difference_type<_BiDirIter> __count, 191 if (__count >= 0) 192 for (; __dist < __count && __iter != __sentinel; ++__dist) [all …]
|
H A D | search_n.h | 35 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument 36 if (__count <= 0) in __search_n_forward_impl() 53 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) in __search_n_forward_impl() 72 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() argument 74 if (__count == 0) in __search_n_random_access_impl() 76 if (__size1 < static_cast<_DiffT>(__count)) { in __search_n_random_access_impl() 81 …const auto __s = __first + __size1 - difference_type(__count - 1); // Start of pattern match can't… in __search_n_random_access_impl() 97 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) in __search_n_random_access_impl() 98 return std::make_pair(__first, __first + _DiffT(__count)); in __search_n_random_access_impl() 119 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _… in __search_n_impl() argument [all …]
|
H A D | ranges_search_n.h | 46 …_Iter1 __first, _Sent1 __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj)… in __ranges_search_n_impl() 47 if (__count == 0) in __ranges_search_n_impl() 52 if (__size < __count) { in __ranges_search_n_impl() 59 __first, __last, __count, __value, __pred, __proj, __size); in __ranges_search_n_impl() 64 …auto __ret = std::__search_n_forward_impl<_RangeAlgPolicy>(__first, __last, __count, __value, __pr… in __ranges_search_n_impl() 77 iter_difference_t<_Iter> __count, in operator() 81 return __ranges_search_n_impl(__first, __last, __count, __value, __pred, __proj); 87 …_Range&& __range, range_difference_t<_Range> __count, const _Type& __value, _Pred __pred = {}, _Pr… in operator() 90 if (__count <= 0) 94 if (__size1 < static_cast<range_size_t<_Range>>(__count)) { [all …]
|
H A D | ranges_count.h | 37 namespace __count { 43 return std::__count<_RangeAlgPolicy>(std::move(__first), std::move(__last), __value, __proj); 50 return std::__count<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), __value, __proj); 56 inline constexpr auto count = __count::__fn{};
|
H A D | count.h | 35 __count(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __count() function 75 __count(__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, const _Tp& __v… in __count() function 85 return std::__count<_ClassicAlgPolicy>(__first, __last, __value, __proj); in count()
|
H A D | ranges_for_each_n.h | 43 operator()(_Iter __first, iter_difference_t<_Iter> __count, _Func __func, _Proj __proj = {}) const { 44 while (__count-- > 0) {
|
/freebsd/contrib/llvm-project/clang/lib/Headers/ |
H A D | mmintrin.h | 728 _mm_sll_pi16(__m64 __m, __m64 __count) in _mm_sll_pi16() argument 730 return (__m64)__builtin_ia32_psllw((__v4hi)__m, __count); in _mm_sll_pi16() 750 _mm_slli_pi16(__m64 __m, int __count) in _mm_slli_pi16() argument 752 return (__m64)__builtin_ia32_psllwi((__v4hi)__m, __count); in _mm_slli_pi16() 773 _mm_sll_pi32(__m64 __m, __m64 __count) in _mm_sll_pi32() argument 775 return (__m64)__builtin_ia32_pslld((__v2si)__m, __count); in _mm_sll_pi32() 795 _mm_slli_pi32(__m64 __m, int __count) in _mm_slli_pi32() argument 797 return (__m64)__builtin_ia32_pslldi((__v2si)__m, __count); in _mm_slli_pi32() 815 _mm_sll_si64(__m64 __m, __m64 __count) in _mm_sll_si64() argument 817 return (__m64)__builtin_ia32_psllq((__v1di)__m, __count); in _mm_sll_si64() [all …]
|
H A D | emmintrin.h | 2758 int __count) { in _mm_slli_epi16() argument 2759 return (__m128i)__builtin_ia32_psllwi128((__v8hi)__a, __count); in _mm_slli_epi16() 2776 __m128i __count) { in _mm_sll_epi16() argument 2777 return (__m128i)__builtin_ia32_psllw128((__v8hi)__a, (__v8hi)__count); in _mm_sll_epi16() 2794 int __count) { in _mm_slli_epi32() argument 2795 return (__m128i)__builtin_ia32_pslldi128((__v4si)__a, __count); in _mm_slli_epi32() 2812 __m128i __count) { in _mm_sll_epi32() argument 2813 return (__m128i)__builtin_ia32_pslld128((__v4si)__a, (__v4si)__count); in _mm_sll_epi32() 2830 int __count) { in _mm_slli_epi64() argument 2831 return __builtin_ia32_psllqi128((__v2di)__a, __count); in _mm_slli_epi64() [all …]
|
H A D | cpuid.h | 264 #define __cpuid_count(__leaf, __count, __eax, __ebx, __ecx, __edx) \ argument 266 : "0"(__leaf), "2"(__count)) 276 #define __cpuid_count(__leaf, __count, __eax, __ebx, __ecx, __edx) \ argument 281 : "0"(__leaf), "2"(__count))
|
/freebsd/contrib/llvm-project/clang/lib/Headers/ppc_wrappers/ |
H A D | mmintrin.h | 600 _mm_sll_si64(__m64 __m, __m64 __count) { in _mm_sll_si64() argument 601 return (__m << __count); in _mm_sll_si64() 606 _m_psllq(__m64 __m, __m64 __count) { in _m_psllq() argument 607 return _mm_sll_si64(__m, __count); in _m_psllq() 612 _mm_slli_si64(__m64 __m, const int __count) { in _mm_slli_si64() argument 613 return (__m << __count); in _mm_slli_si64() 618 _m_psllqi(__m64 __m, const int __count) { in _m_psllqi() argument 619 return _mm_slli_si64(__m, __count); in _m_psllqi() 625 _mm_srl_si64(__m64 __m, __m64 __count) { in _mm_srl_si64() argument 626 return (__m >> __count); in _mm_srl_si64() [all …]
|
H A D | tmmintrin.h | 77 _mm_alignr_epi8(__m128i __A, __m128i __B, const unsigned int __count) { in _mm_alignr_epi8() argument 78 if (__builtin_constant_p(__count) && __count < 16) { in _mm_alignr_epi8() 83 __A = (__m128i)vec_sld((__v16qu)__B, (__v16qu)__A, __count); in _mm_alignr_epi8() 90 if (__count == 0) in _mm_alignr_epi8() 93 if (__count >= 16) { in _mm_alignr_epi8() 94 if (__count >= 32) { in _mm_alignr_epi8() 98 const __v16qu __shift = vec_splats((unsigned char)((__count - 16) * 8)); in _mm_alignr_epi8() 106 const __v16qu __shiftA = vec_splats((unsigned char)((16 - __count) * 8)); in _mm_alignr_epi8() 107 const __v16qu __shiftB = vec_splats((unsigned char)(__count * 8)); in _mm_alignr_epi8() 121 _mm_alignr_pi8(__m64 __A, __m64 __B, unsigned int __count) { in _mm_alignr_pi8() argument [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__functional/ |
H A D | boyer_moore_searcher.h | 176 const size_t __count = __last - __first; in __search() 181 for (size_t __i = 1; __i != __count; ++__i) { in __search() 193 const size_t __count = __last - __first; in __compute_bm_prefix() 195 if (__count == 0) in __compute_bm_prefix() 198 vector<difference_type> __scratch(__count); in __compute_bm_prefix() 201 for (size_t __i = 0; __i <= __count; ++__i) in __compute_bm_prefix() 202 __suffix_[__i] = __count - __scratch[__count - 1]; in __compute_bm_prefix() 207 for (size_t __i = 0; __i != __count; ++__i) { in __build_suffix_table() local 208 const size_t __j = __count in __build_suffix_table() 190 const size_t __count = __last - __first; __compute_bm_prefix() local [all...] |
/freebsd/sys/sys/ |
H A D | blockcount.h | 49 atomic_store_int(&bc->__count, 0); in blockcount_init() 58 old = atomic_fetchadd_int(&bc->__count, n); in blockcount_acquire() 61 atomic_add_int(&bc->__count, n); in blockcount_acquire() 71 old = atomic_fetchadd_int(&bc->__count, -n); in blockcount_release()
|
H A D | _blockcount.h | 37 unsigned int __count; member 47 return (_BLOCKCOUNT_COUNT(atomic_load_int(&count->__count))); in blockcount_read()
|
/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | span | 266 …_LIBCPP_HIDE_FROM_ABI constexpr explicit span(_It __first, size_type __count) : __data_{std::to_ad… 267 (void)__count; 268 …_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(_Extent == __count, "size mismatch in span's constructor (iter… 318 …_LIBCPP_HIDE_FROM_ABI constexpr span<element_type, dynamic_extent> first(size_type __count) const … 319 …_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__count <= size(), "span<T, N>::first(count): count out of ran… 320 return {data(), __count}; 323 …_LIBCPP_HIDE_FROM_ABI constexpr span<element_type, dynamic_extent> last(size_type __count) const n… 324 …_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__count <= size(), "span<T, N>::last(count): count out of rang… 325 return {data() + size() - __count, __count}; 340 subspan(size_type __offset, size_type __count = dynamic_extent) const noexcept { [all …]
|
H A D | barrier | 217 static _LIBCPP_HIDE_FROM_ABI constexpr uint64_t __init(ptrdiff_t __count) _NOEXCEPT { 218 return ((uint64_t(1u << 31) - __count) << 32) | (uint64_t(1u << 31) - __count); 226 …_LIBCPP_HIDE_FROM_ABI explicit inline __barrier_base(ptrdiff_t __count, __empty_completion = __emp… 227 : __phase_arrived_expected(__init(__count)) {} 266 …_LIBCPP_HIDE_FROM_ABI explicit barrier(ptrdiff_t __count, _CompletionF __completion = _CompletionF… 267 : __b_(__count, std::move(__completion)) { 269 __count >= 0, 272 __count <= max(),
|
H A D | semaphore | 89 …BCPP_HIDE_FROM_ABI constexpr explicit __atomic_semaphore_base(ptrdiff_t __count) : __a_(__count) {} 135 …PP_HIDE_FROM_ABI constexpr explicit counting_semaphore(ptrdiff_t __count) : __semaphore_(__count) { 137 __count >= 0, 141 __count <= max(),
|
H A D | cwchar | 215 __constexpr_wmemcmp(const wchar_t* __lhs, const wchar_t* __rhs, size_t __count) { 217 return __builtin_wmemcmp(__lhs, __rhs, __count); 220 return std::wmemcmp(__lhs, __rhs, __count); 222 for (; __count; --__count, ++__lhs, ++__rhs) { 233 …I _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __constexpr_wmemchr(_Tp* __str, _Up __value, size_t __count) { 243 … __builtin_wmemchr(reinterpret_cast<__copy_cv_t<_Tp, wchar_t>*>(__str), __value_buffer, __count)); 247 return __builtin_wmemchr(__str, __value, __count); 251 for (; __count; --__count) {
|
/freebsd/contrib/llvm-project/libcxx/include/__thread/ |
H A D | poll_with_backoff.h | 40 for (int __count = 0;;) { variable 43 if (__count < __libcpp_polling_count) { 44 __count += 1;
|
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/omp/ |
H A D | parallel_stable_sort.h |
|
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
H A D | unseq_backend_simd.h |
|
/freebsd/contrib/llvm-project/libcxx/include/__random/ |
H A D | independent_bits_engine.h | 137 template <size_t __count, 138 __enable_if_t<__count< _Dt, int> = 0> _LIBCPP_HIDE_FROM_ABI static result_type __lshift(result_type __x) { 139 return __x << __count; 142 template <size_t __count, __enable_if_t<(__count >= _Dt), int> = 0>
|
/freebsd/contrib/llvm-project/libcxx/src/ |
H A D | barrier.cpp | 28 size_t const __count = (__expected + 1) >> 1; in __barrier_algorithm_base() local 29 __state_ = unique_ptr<__state_t[]>(new __state_t[__count]); in __barrier_algorithm_base()
|