Home
last modified time | relevance | path

Searched refs:__len (Results 1 – 25 of 34) sorted by relevance

12

/llvm-project-15.0.7/libcxx/include/__functional/
H A Dhash.h61 _Size __h = __len;
63 for (; __len >= 4; __data += 4, __len -= 4)
72 switch (__len)
129 if (__len > 8) {
134 if (__len >= 4) {
139 if (__len > 0) {
196 (__len + __loadword<_Size>(__s + __len - 16)) * __k0;
224 if (__len <= 32) {
239 _Size __z = __hash_len_16(__loadword<_Size>(__s + __len - 48) + __len,
246 __len = (__len - 1) & ~static_cast<_Size>(63);
[all …]
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dpush_heap.h29 typename iterator_traits<_RandomAccessIterator>::difference_type __len) { in __sift_up() argument
32 if (__len > 1) { in __sift_up()
33 __len = (__len - 2) / 2; in __sift_up()
34 _RandomAccessIterator __ptr = __first + __len; in __sift_up()
41 if (__len == 0) in __sift_up()
43 __len = (__len - 1) / 2; in __sift_up()
44 __ptr = __first + __len; in __sift_up()
56 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first; in __push_heap() local
57 std::__sift_up<_AlgPolicy, _CompRef>(std::move(__first), std::move(__last), __comp, __len); in __push_heap()
H A Dsift_down.h27 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __sift_down() argument
38 if (__len < 2 || (__len - 2) / 2 < __child) in __sift_down()
44 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down()
62 if ((__len - 2) / 2 < __child) in __sift_down()
69 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down()
83 typename iterator_traits<_RandomAccessIterator>::difference_type __len) in __floyd_sift_down() argument
86 _LIBCPP_ASSERT(__len >= 2, "shouldn't be called unless __len >= 2"); in __floyd_sift_down()
96 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __floyd_sift_down()
107 if (__child > (__len - 2) / 2) in __floyd_sift_down()
H A Dstable_sort.h105 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
117 switch (__len) in __stable_sort_move()
144 if (__len <= 8) in __stable_sort_move()
152 …__stable_sort<_AlgPolicy, _Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - _… in __stable_sort_move()
165 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __stable_sort() argument
170 switch (__len) in __stable_sort()
187 if (__len <= __buff_size) in __stable_sort()
194 __d.__set(__len, (value_type*)nullptr); in __stable_sort()
196 __buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); in __stable_sort()
215 difference_type __len = __last - __first; in __stable_sort_impl() local
[all …]
H A Dstable_partition.h36 if (__len == 1) in __stable_partition_impl()
38 if (__len == 2) in __stable_partition_impl()
48 if (__len <= __p.second) in __stable_partition_impl()
85 _Distance __len2 = __len / 2; // __len2 >= 2 in __stable_partition_impl()
97 _Distance __len_half = __len - __len2; in __stable_partition_impl()
138 if (__len >= __alloc_limit) in __stable_partition_impl()
160 if (__len == 2) in __stable_partition_impl()
165 if (__len == 3) in __stable_partition_impl()
178 if (__len <= __p.second) in __stable_partition_impl()
242 __len_half = __len - __len2; in __stable_partition_impl()
[all …]
H A Dpartition_point.h29 difference_type __len = _VSTD::distance(__first, __last); in partition_point() local
30 while (__len != 0) in partition_point()
32 difference_type __l2 = _VSTD::__half_positive(__len); in partition_point()
38 __len -= __l2 + 1; in partition_point()
41 __len = __l2; in partition_point()
H A Dpop_heap.h32 typename iterator_traits<_RandomAccessIterator>::difference_type __len) { in __pop_heap() argument
33 _LIBCPP_ASSERT(__len > 0, "The heap given to pop_heap must be non-empty"); in __pop_heap()
39 if (__len > 1) { in __pop_heap()
41 _RandomAccessIterator __hole = std::__floyd_sift_down<_AlgPolicy>(__first, __comp_ref, __len); in __pop_heap()
61 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first; in pop_heap() local
62 std::__pop_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp, __len); in pop_heap()
H A Dlower_bound.h34 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __lower_bound_impl() local
36 while (__len != 0) { in __lower_bound_impl()
37 auto __l2 = std::__half_positive(__len); in __lower_bound_impl()
42 __len -= __l2 + 1; in __lower_bound_impl()
44 __len = __l2; in __lower_bound_impl()
H A Dranges_partition_point.h43 auto __len = ranges::distance(__first, __last); in __partition_point_fn_impl() local
45 while (__len != 0) { in __partition_point_fn_impl()
46 auto __half_len = std::__half_positive(__len); in __partition_point_fn_impl()
51 __len -= __half_len + 1; in __partition_point_fn_impl()
54 __len = __half_len; in __partition_point_fn_impl()
H A Dupper_bound.h33 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __upper_bound() local
34 while (__len != 0) { in __upper_bound()
35 auto __half_len = std::__half_positive(__len); in __upper_bound()
38 __len = __half_len; in __upper_bound()
41 __len -= __half_len + 1; in __upper_bound()
H A Dequal_range.h39 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __equal_range() local
41 while (__len != 0) { in __equal_range()
42 auto __half_len = std::__half_positive(__len); in __equal_range()
46 __len -= __half_len + 1; in __equal_range()
49 __len = __half_len; in __equal_range()
H A Dis_heap_until.h28 difference_type __len = __last - __first; in __is_heap_until() local
32 while (__c < __len) in __is_heap_until()
39 if (__c == __len) in __is_heap_until()
H A Dnth_element.h57 difference_type __len = __last - __first; in __nth_element() local
58 switch (__len) in __nth_element()
74 if (__len <= __limit) in __nth_element()
80 _RandomAccessIterator __m = __first + __len/2; in __nth_element()
H A Dranges_pop_heap.h47 auto __len = __last_iter - __first; in __pop_heap_fn_impl() local
50 std::__pop_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp, __len); in __pop_heap_fn_impl()
H A Dpartial_sort_copy.h49 … typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; in __partial_sort_copy() local
53 … std::__sift_down<_AlgPolicy>(__result_first, __projected_comp, __len, __result_first); in __partial_sort_copy()
H A Dpartial_sort.h41 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; in __partial_sort_impl() local
48 std::__sift_down<_AlgPolicy>(__first, __comp, __len, __first); in __partial_sort_impl()
/llvm-project-15.0.7/libcxx/include/
H A D__bsd_locale_fallbacks.h50 size_t __len, mbstate_t *__ps, locale_t __l) in __libcpp_wcsnrtombs_l() argument
53 return wcsnrtombs(__dest, __src, __nwc, __len, __ps); in __libcpp_wcsnrtombs_l()
65 size_t __len, mbstate_t *__ps, locale_t __l) in __libcpp_mbsnrtowcs_l() argument
68 return mbsnrtowcs(__dest, __src, __nms, __len, __ps); in __libcpp_mbsnrtowcs_l()
103 size_t __libcpp_mbsrtowcs_l(wchar_t *__dest, const char **__src, size_t __len, in __libcpp_mbsrtowcs_l() argument
107 return mbsrtowcs(__dest, __src, __len, __ps); in __libcpp_mbsrtowcs_l()
H A Dwchar.h180 size_t __nmc, size_t __len, mbstate_t *__restrict __ps);
182 size_t __nwc, size_t __len, mbstate_t *__restrict __ps);
H A Dstring_view301 basic_string_view(const _CharT* __s, size_type __len) _NOEXCEPT
302 : __data(__s), __size(__len)
937 basic_string_view<char> operator "" sv(const char *__str, size_t __len) _NOEXCEPT
939 return basic_string_view<char> (__str, __len);
944 basic_string_view<wchar_t> operator "" sv(const wchar_t *__str, size_t __len) _NOEXCEPT
946 return basic_string_view<wchar_t> (__str, __len);
952 basic_string_view<char8_t> operator "" sv(const char8_t *__str, size_t __len) _NOEXCEPT
954 return basic_string_view<char8_t> (__str, __len);
959 basic_string_view<char16_t> operator "" sv(const char16_t *__str, size_t __len) _NOEXCEPT
961 return basic_string_view<char16_t> (__str, __len);
[all …]
H A Dstreambuf415 const streamsize __len = _VSTD::min(static_cast<streamsize>(INT_MAX),
417 traits_type::copy(__s, __ninp_, __len);
418 __s += __len;
419 __i += __len;
420 this->gbump(__len);
/llvm-project-15.0.7/libcxx/include/__string/
H A Dchar_traits.h101 size_t __len = 0; in length() local
103 ++__len; in length()
104 return __len; in length()
389 ++__len;
390 return __len;
481 ++__len;
482 return __len;
593 ++__len;
594 return __len;
682 ++__len;
[all …]
/llvm-project-15.0.7/libcxx/include/__type_traits/
H A Daligned_union.h44 static const size_t __len = __static_max<_Len, sizeof(_Type0),
46 typedef typename aligned_storage<__len, alignment_value>::type type;
/llvm-project-15.0.7/libcxx/test/support/
H A Dconstexpr_char_traits.h78 size_t __len = 0; in length() local
80 ++__len; in length()
81 return __len; in length()
/llvm-project-15.0.7/libcxx/include/__support/win32/
H A Dlocale_win32.h200 size_t __len, mbstate_t *__restrict __ps, locale_t __loc );
206 size_t __nms, size_t __len, mbstate_t *__restrict __ps, locale_t __loc);
208 size_t __nwc, size_t __len, mbstate_t *__restrict __ps, locale_t __loc);
/llvm-project-15.0.7/clang/lib/Headers/
H A Dvecintrin.h31 __constant_pow2_range(__len, 64, 4096);
1554 unsigned int __len) { in vec_store_len() argument
1560 unsigned int __len) { in vec_store_len() argument
1566 unsigned int __len) { in vec_store_len() argument
1572 unsigned int __len) { in vec_store_len() argument
1578 unsigned int __len) { in vec_store_len() argument
1584 unsigned int __len) { in vec_store_len() argument
1590 unsigned int __len) { in vec_store_len() argument
1596 unsigned int __len) { in vec_store_len() argument
1603 unsigned int __len) { in vec_store_len() argument
[all …]

12