Home
last modified time | relevance | path

Searched refs:__count (Results 1 – 25 of 64) sorted by relevance

123

/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__string/
H A Dconstexpr_c_functions.h71 auto __count = static_cast<size_t>(__n); in __constexpr_memcmp() local
76 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)); in __constexpr_memcmp()
79 while (__count != 0) { in __constexpr_memcmp()
85 --__count; in __constexpr_memcmp()
91 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)); in __constexpr_memcmp()
103 auto __count = static_cast<size_t>(__n); in __constexpr_memcmp_equal() local
108 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0; in __constexpr_memcmp_equal()
110 while (__count != 0) { in __constexpr_memcmp_equal()
114 --__count; in __constexpr_memcmp_equal()
120 return ::__builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0; in __constexpr_memcmp_equal()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__string/
H A Dconstexpr_c_functions.h75 auto __count = static_cast<size_t>(__n); in __constexpr_memcmp() local
80 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)); in __constexpr_memcmp()
83 while (__count != 0) { in __constexpr_memcmp()
89 --__count; in __constexpr_memcmp()
95 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)); in __constexpr_memcmp()
108 auto __count = static_cast<size_t>(__n); in __constexpr_memcmp_equal() local
113 return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0; in __constexpr_memcmp_equal()
115 while (__count != 0) { in __constexpr_memcmp_equal()
119 --__count; in __constexpr_memcmp_equal()
125 return ::__builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0; in __constexpr_memcmp_equal()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Diterator_operations.h55 _LIBCPP_HIDE_FROM_ABI static void advance(_Iter& __iter, _Distance __count) {
56 std::advance(__iter, __count);
137 __advance_to(_Iter& __iter, __difference_type<_Iter> __count, const _Iter& __sentinel) {
138 …return _IterOps::__advance_to(__iter, __count, __sentinel, typename iterator_traits<_Iter>::iterat…
145 …_InputIter& __iter, __difference_type<_InputIter> __count, const _InputIter& __sentinel, input_ite…
147 for (; __dist < __count && __iter != __sentinel; ++__dist)
149 return __count - __dist;
156 __difference_type<_BiDirIter> __count,
160 if (__count >= 0)
161 for (; __dist < __count && __iter != __sentinel; ++__dist)
[all …]
H A Dsearch_n.h33 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument
34 if (__count <= 0) in __search_n_forward_impl()
51 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) in __search_n_forward_impl()
70 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() argument
72 if (__count == 0) in __search_n_random_access_impl()
74 if (__size1 < static_cast<_DiffT>(__count)) { in __search_n_random_access_impl()
79 …const auto __s = __first + __size1 - difference_type(__count - 1); // Start of pattern match can't… in __search_n_random_access_impl()
95 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) in __search_n_random_access_impl()
96 return std::make_pair(__first, __first + _DiffT(__count)); in __search_n_random_access_impl()
117 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _… in __search_n_impl() argument
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dcounted.h47 …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/__memory/
H A Dunique_temporary_buffer.h35 …P_CONSTEXPR explicit __temporary_buffer_deleter(ptrdiff_t __count) _NOEXCEPT : __count_(__count) {} in __temporary_buffer_deleter()
52 __allocate_unique_temporary_buffer(ptrdiff_t __count) { in __allocate_unique_temporary_buffer() argument
57 return __unique_buffer_type(allocator<_Tp>().allocate(__count), __deleter_type(__count)); in __allocate_unique_temporary_buffer()
63 if (__count > __max_count) in __allocate_unique_temporary_buffer()
64 __count = __max_count; in __allocate_unique_temporary_buffer()
65 while (__count > 0) { in __allocate_unique_temporary_buffer()
69 __ptr = static_cast<_Tp*>(::operator new(__count * sizeof(_Tp), __al, nothrow)); in __allocate_unique_temporary_buffer()
71 __ptr = static_cast<_Tp*>(::operator new(__count * sizeof(_Tp), nothrow)); in __allocate_unique_temporary_buffer()
79 __ptr = static_cast<_Tp*>(::operator new(__count * sizeof(_Tp), nothrow)); in __allocate_unique_temporary_buffer()
85 __count /= 2; in __allocate_unique_temporary_buffer()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Diterator_operations.h85 …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 Dsearch_n.h36 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument
37 if (__count <= 0) in __search_n_forward_impl()
54 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) in __search_n_forward_impl()
73 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() argument
75 if (__count == 0) in __search_n_random_access_impl()
77 if (__size1 < static_cast<_DiffT>(__count)) { in __search_n_random_access_impl()
82 …const auto __s = __first + __size1 - difference_type(__count - 1); // Start of pattern match can't… in __search_n_random_access_impl()
98 … if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) in __search_n_random_access_impl()
99 return std::make_pair(__first, __first + _DiffT(__count)); in __search_n_random_access_impl()
120 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _… in __search_n_impl() argument
[all …]
H A Dranges_search_n.h45 …_Iter1 __first, _Sent1 __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj)… in __ranges_search_n_impl()
46 if (__count == 0) in __ranges_search_n_impl()
51 if (__size < __count) { in __ranges_search_n_impl()
58 __first, __last, __count, __value, __pred, __proj, __size); in __ranges_search_n_impl()
63 …auto __ret = std::__search_n_forward_impl<_RangeAlgPolicy>(__first, __last, __count, __value, __pr… in __ranges_search_n_impl()
76 iter_difference_t<_Iter> __count, in operator()
80 return __ranges_search_n_impl(__first, __last, __count, __value, __pred, __proj);
86 …_Range&& __range, range_difference_t<_Range> __count, const _Type& __value, _Pred __pred = {}, _Pr… in operator()
89 if (__count <= 0)
93 if (__size1 < static_cast<range_size_t<_Range>>(__count)) {
[all …]
H A Dranges_count.h37 struct __count { struct
42 return std::__count<_RangeAlgPolicy>(std::move(__first), std::move(__last), __value, __proj); argument
49 return std::__count<_RangeAlgPolicy>(ranges::begin(__r), ranges::end(__r), __value, __proj); argument
54 inline constexpr auto count = __count{};
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Dmmintrin.h772 _mm_sll_pi16(__m64 __m, __m64 __count) in _mm_sll_pi16() argument
775 (__v8hi)__anyext128(__count))); in _mm_sll_pi16()
795 _mm_slli_pi16(__m64 __m, int __count) in _mm_slli_pi16() argument
798 __count)); in _mm_slli_pi16()
819 _mm_sll_pi32(__m64 __m, __m64 __count) in _mm_sll_pi32() argument
822 (__v4si)__anyext128(__count))); in _mm_sll_pi32()
842 _mm_slli_pi32(__m64 __m, int __count) in _mm_slli_pi32() argument
845 __count)); in _mm_slli_pi32()
863 _mm_sll_si64(__m64 __m, __m64 __count) in _mm_sll_si64() argument
866 (__v2di)__anyext128(__count))); in _mm_sll_si64()
[all …]
H A Davx2intrin.h2138 _mm256_slli_epi16(__m256i __a, int __count) in _mm256_slli_epi16() argument
2140 return (__m256i)__builtin_ia32_psllwi256((__v16hi)__a, __count); in _mm256_slli_epi16()
2159 _mm256_sll_epi16(__m256i __a, __m128i __count) in _mm256_sll_epi16() argument
2161 return (__m256i)__builtin_ia32_psllw256((__v16hi)__a, (__v8hi)__count); in _mm256_sll_epi16()
2178 _mm256_slli_epi32(__m256i __a, int __count) in _mm256_slli_epi32() argument
2180 return (__m256i)__builtin_ia32_pslldi256((__v8si)__a, __count); in _mm256_slli_epi32()
2199 _mm256_sll_epi32(__m256i __a, __m128i __count) in _mm256_sll_epi32() argument
2201 return (__m256i)__builtin_ia32_pslld256((__v8si)__a, (__v4si)__count); in _mm256_sll_epi32()
2218 _mm256_slli_epi64(__m256i __a, int __count) in _mm256_slli_epi64() argument
2220 return __builtin_ia32_psllqi256((__v4di)__a, __count); in _mm256_slli_epi64()
[all …]
H A Demmintrin.h2771 int __count) { in _mm_slli_epi16() argument
2772 return (__m128i)__builtin_ia32_psllwi128((__v8hi)__a, __count); in _mm_slli_epi16()
2789 __m128i __count) { in _mm_sll_epi16() argument
2790 return (__m128i)__builtin_ia32_psllw128((__v8hi)__a, (__v8hi)__count); in _mm_sll_epi16()
2807 int __count) { in _mm_slli_epi32() argument
2808 return (__m128i)__builtin_ia32_pslldi128((__v4si)__a, __count); in _mm_slli_epi32()
2825 __m128i __count) { in _mm_sll_epi32() argument
2826 return (__m128i)__builtin_ia32_pslld128((__v4si)__a, (__v4si)__count); in _mm_sll_epi32()
2843 int __count) { in _mm_slli_epi64() argument
2844 return __builtin_ia32_psllqi128((__v2di)__a, __count); in _mm_slli_epi64()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Headers/ppc_wrappers/
H A Dmmintrin.h600 _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 Dtmmintrin.h77 _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/
H A Dspan270 …_LIBCPP_HIDE_FROM_ABI constexpr explicit span(_It __first, size_type __count) : __data_{std::to_ad…
271 (void)__count;
272 …_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(_Extent == __count, "size mismatch in span's constructor (iter…
273 _LIBCPP_ASSERT_VALID_INPUT_RANGE(__count == 0 || std::to_address(__first) != nullptr,
324 …_LIBCPP_HIDE_FROM_ABI constexpr span<element_type, dynamic_extent> first(size_type __count) const …
325 …_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__count <= size(), "span<T, N>::first(count): count out of ran…
326 return {data(), __count};
329 …_LIBCPP_HIDE_FROM_ABI constexpr span<element_type, dynamic_extent> last(size_type __count) const n…
330 …_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__count <= size(), "span<T, N>::last(count): count out of rang…
331 return {data() + size() - __count, __count};
[all …]
H A Dsemaphore92 …BCPP_HIDE_FROM_ABI constexpr explicit __atomic_semaphore_base(ptrdiff_t __count) : __a_(__count) {}
139 …PP_HIDE_FROM_ABI constexpr explicit counting_semaphore(ptrdiff_t __count) : __semaphore_(__count) {
141 __count >= 0,
145 __count <= max(),
H A Dcwchar219 __constexpr_wmemcmp(const wchar_t* __lhs, const wchar_t* __rhs, size_t __count) {
221 return __builtin_wmemcmp(__lhs, __rhs, __count);
224 return std::wmemcmp(__lhs, __rhs, __count);
226 for (; __count; --__count, ++__lhs, ++__rhs) {
237 …I _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __constexpr_wmemchr(_Tp* __str, _Up __value, size_t __count) {
247 … __builtin_wmemchr(reinterpret_cast<__copy_cv_t<_Tp, wchar_t>*>(__str), __value_buffer, __count));
251 return __builtin_wmemchr(__str, __value, __count);
255 for (; __count; --__count) {
/freebsd/sys/sys/
H A Dblockcount.h49 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.h37 unsigned int __count; member
47 return (_BLOCKCOUNT_COUNT(atomic_load_int(&count->__count))); in blockcount_read()
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h175 const size_t __count = __last - __first; in __compute_bm_prefix() local
180 for (size_t __i = 1; __i != __count; ++__i) { in __compute_bm_prefix()
192 const size_t __count = __last - __first; in __build_suffix_table() local
194 if (__count == 0) in __build_suffix_table()
197 auto __scratch = std::make_unique<difference_type[]>(__count); in __build_suffix_table()
200 for (size_t __i = 0; __i <= __count; ++__i) in __build_suffix_table()
201 __suffix_[__i] = __count - __scratch[__count - 1]; in __build_suffix_table()
206 for (size_t __i = 0; __i != __count; ++__i) { in __build_suffix_table()
207 const size_t __j = __count - __scratch[__i]; in __build_suffix_table()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__thread/
H A Dpoll_with_backoff.h40 for (int __count = 0;;) { variable
43 if (__count < __libcpp_polling_count) {
44 __count += 1;
/freebsd/contrib/llvm-project/libcxx/include/__thread/
H A Dpoll_with_backoff.h40 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 Dparallel_stable_sort.h
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dunseq_backend_simd.h

123