Home
last modified time | relevance | path

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

12

/freebsd-14.2/tools/coccinelle/
H A Dcopystr9.cocci2 expression __src, __dst, __len;
7 -copystr(__src, __dst, __len, NULL);
8 +strlcpy(__dst, __src, __len);
11 expression __src, __dst, __len;
18 -copystr(__src, __dst, __len, NULL) != 0
20 -copystr(__src, __dst, __len, NULL)
22 +strlcpy(__dst, __src, __len) >= __len
26 expression __src, __dst, __len;
34 +__done = MIN(__done, __len);
36 -copystr(__src, __dst, __len, __done);
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__functional/
H A Dhash.h59 for (; __len >= 4; __data += 4, __len -= 4) {
67 switch (__len) {
91 if (__len <= 32) {
92 if (__len <= 16) {
106 …__hash_len_16(std::__loadword<_Size>(__s + __len - 48) + __len, std::__loadword<_Size>(__s + __len…
112 __len = (__len - 1) & ~static_cast<_Size>(63);
123 __len -= 64;
124 } while (__len != 0);
158 if (__len > 8) {
163 if (__len >= 4) {
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/
H A Dpush_heap.h35 typename iterator_traits<_RandomAccessIterator>::difference_type __len) { in __sift_up() argument
38 if (__len > 1) { in __sift_up()
39 __len = (__len - 2) / 2; in __sift_up()
40 _RandomAccessIterator __ptr = __first + __len; in __sift_up()
47 if (__len == 0) in __sift_up()
49 __len = (__len - 1) / 2; in __sift_up()
50 __ptr = __first + __len; in __sift_up()
61 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first; in __push_heap() local
62 …t_up<_AlgPolicy, __comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __comp, __len); in __push_heap()
H A Dsift_down.h31 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __sift_down() argument
41 if (__len < 2 || (__len - 2) / 2 < __child) in __sift_down()
47 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down()
64 if ((__len - 2) / 2 < __child) in __sift_down()
71 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down()
86 typename iterator_traits<_RandomAccessIterator>::difference_type __len) { in __floyd_sift_down() argument
88 _LIBCPP_ASSERT_INTERNAL(__len >= 2, "shouldn't be called unless __len >= 2"); in __floyd_sift_down()
98 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __floyd_sift_down()
109 if (__child > (__len - 2) / 2) in __floyd_sift_down()
H A Dstable_partition.h39 _Distance __len, in __stable_partition_impl() argument
46 if (__len == 1) in __stable_partition_impl()
48 if (__len == 2) { in __stable_partition_impl()
88 _Distance __len2 = __len / 2; // __len2 >= 2 in __stable_partition_impl()
100 _Distance __len_half = __len - __len2; in __stable_partition_impl()
137 if (__len >= __alloc_limit) { in __stable_partition_impl()
153 _Distance __len, in __stable_partition_impl() argument
161 if (__len == 2) { in __stable_partition_impl()
165 if (__len == 3) { in __stable_partition_impl()
233 __len_half = __len - __len2; in __stable_partition_impl()
[all …]
H A Dstable_sort.h153 switch (__len) { in __stable_sort_move()
176 if (__len <= 8) { in __stable_sort_move()
180 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort_move()
183 …__stable_sort<_AlgPolicy, _Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - _… in __stable_sort_move()
201 switch (__len) { in __stable_sort()
214 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort()
216 if (__len <= __buff_size) { in __stable_sort()
222 __d.__set(__len, (value_type*)nullptr); in __stable_sort()
224 __buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); in __stable_sort()
243 difference_type __len = __last - __first; in __stable_sort_impl() local
[all …]
H A Dpartition_point.h28 difference_type __len = std::distance(__first, __last); in partition_point() local
29 while (__len != 0) { in partition_point()
30 difference_type __l2 = std::__half_positive(__len); in partition_point()
35 __len -= __l2 + 1; in partition_point()
37 __len = __l2; in partition_point()
H A Dpop_heap.h38 typename iterator_traits<_RandomAccessIterator>::difference_type __len) { in __pop_heap() argument
40 _LIBCPP_ASSERT_PEDANTIC(__len > 0, "The heap given to pop_heap must be non-empty"); in __pop_heap()
45 if (__len > 1) { in __pop_heap()
47 _RandomAccessIterator __hole = std::__floyd_sift_down<_AlgPolicy>(__first, __comp_ref, __len); in __pop_heap()
67 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first; in pop_heap() local
68 std::__pop_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp, __len); in pop_heap()
H A Dupper_bound.h36 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __upper_bound() local
37 while (__len != 0) { in __upper_bound()
38 auto __half_len = std::__half_positive(__len); in __upper_bound()
41 __len = __half_len; in __upper_bound()
44 __len -= __half_len + 1; in __upper_bound()
H A Dlower_bound.h33 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __lower_bound() local
35 while (__len != 0) { in __lower_bound()
36 auto __l2 = std::__half_positive(__len); in __lower_bound()
41 __len -= __l2 + 1; in __lower_bound()
43 __len = __l2; in __lower_bound()
H A Dranges_partition_point.h45 auto __len = ranges::distance(__first, __last); in __partition_point_fn_impl() local
47 while (__len != 0) { in __partition_point_fn_impl()
48 auto __half_len = std::__half_positive(__len); in __partition_point_fn_impl()
53 __len -= __half_len + 1; in __partition_point_fn_impl()
56 __len = __half_len; in __partition_point_fn_impl()
H A Dequal_range.h42 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __equal_range() local
44 while (__len != 0) { in __equal_range()
45 auto __half_len = std::__half_positive(__len); in __equal_range()
49 __len -= __half_len + 1; in __equal_range()
52 __len = __half_len; in __equal_range()
H A Dis_heap_until.h27 difference_type __len = __last - __first; in __is_heap_until() local
31 while (__c < __len) { in __is_heap_until()
37 if (__c == __len) in __is_heap_until()
H A Dnth_element.h58 difference_type __len = __last - __first; in __nth_element() local
59 switch (__len) { in __nth_element()
73 if (__len <= __limit) { in __nth_element()
78 _RandomAccessIterator __m = __first + __len / 2; in __nth_element()
H A Dranges_pop_heap.h50 auto __len = __last_iter - __first; in __pop_heap_fn_impl() local
53 std::__pop_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp, __len); in __pop_heap_fn_impl()
H A Dpartial_sort.h43 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()
H A Dpartial_sort_copy.h59 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; in __partial_sort_copy() local
63 std::__sift_down<_AlgPolicy>(__result_first, __projected_comp, __len, __result_first); in __partial_sort_copy()
/freebsd-14.2/contrib/llvm-project/libcxx/include/__locale_dir/locale_base_api/
H A Dbsd_locale_fallbacks.h48 __libcpp_wcsnrtombs_l(char* __dest, const wchar_t** __src, size_t __nwc, size_t __len, mbstate_t* _… in __libcpp_wcsnrtombs_l() argument
50 return wcsnrtombs(__dest, __src, __nwc, __len, __ps); in __libcpp_wcsnrtombs_l()
59 __libcpp_mbsnrtowcs_l(wchar_t* __dest, const char** __src, size_t __nms, size_t __len, mbstate_t* _… in __libcpp_mbsnrtowcs_l() argument
61 return mbsnrtowcs(__dest, __src, __nms, __len, __ps); in __libcpp_mbsnrtowcs_l()
88 __libcpp_mbsrtowcs_l(wchar_t* __dest, const char** __src, size_t __len, mbstate_t* __ps, locale_t _… in __libcpp_mbsrtowcs_l() argument
90 return mbsrtowcs(__dest, __src, __len, __ps); in __libcpp_mbsrtowcs_l()
/freebsd-14.2/contrib/llvm-project/libcxx/include/__type_traits/
H A Daligned_union.h40 static const size_t __len = __static_max<_Len, sizeof(_Type0), sizeof(_Types)...>::value;
41 typedef typename aligned_storage<__len, alignment_value>::type type;
/freebsd-14.2/contrib/llvm-project/libcxx/include/__string/
H A Dchar_traits.h112 size_t __len = 0; in length() local
114 ++__len; in length()
115 return __len; in length()
412 size_t __len = 0;
414 ++__len;
415 return __len;
505 size_t __len = 0;
507 ++__len;
508 return __len;
595 ++__len;
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/
H A Dwchar.h205 …wchar_t* __restrict __dst, const char** __restrict __src, size_t __nmc, size_t __len, mbstate_t* _…
207 …char* __restrict __dst, const wchar_t** __restrict __src, size_t __nwc, size_t __len, mbstate_t* _…
H A Dstring_view308 __size_(__len) {
904 operator""sv(const char* __str, size_t __len) _NOEXCEPT {
905 return basic_string_view<char>(__str, __len);
910 operator""sv(const wchar_t* __str, size_t __len) _NOEXCEPT {
911 return basic_string_view<wchar_t>(__str, __len);
917 operator""sv(const char8_t* __str, size_t __len) _NOEXCEPT {
918 return basic_string_view<char8_t>(__str, __len);
923 operator""sv(const char16_t* __str, size_t __len) _NOEXCEPT {
924 return basic_string_view<char16_t>(__str, __len);
928 operator""sv(const char32_t* __str, size_t __len) _NOEXCEPT {
[all …]
H A Dstreambuf366 …const streamsize __len = std::min(static_cast<streamsize>(INT_MAX), std::min(__einp_ - __ninp_, __…
367 traits_type::copy(__s, __ninp_, __len);
368 __s += __len;
369 __i += __len;
370 this->gbump(__len);
/freebsd-14.2/sys/sys/
H A Dsystm.h289 size_t __r, __len, *__outlen; \
291 __len = (len); \
293 __r = strlcpy((dst), (src), __len); \
295 *__outlen = ((__r >= __len) ? __len : __r + 1); \
296 ((__r >= __len) ? ENAMETOOLONG : 0); \
/freebsd-14.2/contrib/llvm-project/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