Home
last modified time | relevance | path

Searched refs:__block_size (Results 1 – 5 of 5) sorted by relevance

/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/
H A Dtransform_reduce.h61 const _Size __block_size = __lane_size / sizeof(_Tp); in __simd_transform_reduce() local
62 if (__n > 2 * __block_size && __block_size > 1) { in __simd_transform_reduce()
68 for (_Size __i = 0; __i < __block_size; ++__i) { in __simd_transform_reduce()
69 ::new (__lane + __i) _Tp(__binary_op(__f(__i), __f(__block_size + __i))); in __simd_transform_reduce()
72 _Size __i = 2 * __block_size; in __simd_transform_reduce()
73 const _Size __last_iteration = __block_size * (__n / __block_size); in __simd_transform_reduce()
74 for (; __i < __last_iteration; __i += __block_size) { in __simd_transform_reduce()
76 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
86 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
91 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
H A Dany_of.h50 _DifferenceType __block_size = 4 < __n ? 4 : __n; in __simd_or() local
55 for (_DifferenceType __i = 0; __i < __block_size; ++__i) in __simd_or()
61 __first += __block_size; in __simd_or()
62 if (__last - __first >= __block_size << 1) { in __simd_or()
64 __block_size <<= 1; in __simd_or()
66 __block_size = __last - __first; in __simd_or()
H A Dfind_if.h68 const _DifferenceType __block_size = 8; in __simd_first() local
69 alignas(__lane_size) _DifferenceType __lane[__block_size] = {0}; in __simd_first()
70 while (__end - __begin >= __block_size) { in __simd_first()
72 …D_REDUCTION(| : __found) for (_DifferenceType __i = __begin; __i < __begin + __block_size; ++__i) { in __simd_first()
80 for (__i = 0; __i < __block_size; ++__i) { in __simd_first()
87 __begin += __block_size; in __simd_first()
/freebsd-14.2/contrib/llvm-project/libcxx/include/
H A Ddeque343 __ptr_ = *__m_iter_ + (__block_size - 1 - __z % __block_size);
849 return __n / __block_size + (__n % __block_size != 0);
1106 …std::__to_address(*__last_mp + ((__end % __block_size == 0) ? __block_size : __end % __block_size)…
1491 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
1498 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
1506 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
1514 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
1530 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
1536 return *(*(__map_.begin() + __p / __block_size) + __p % __block_size);
2032 __start_ = __map_.size() == 1 ? __block_size / 2 : __start_ + __block_size;
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/
H A Dsort.h155 enum { __block_size = sizeof(uint64_t) * 8 };
418 for (int __j = 0; __j < __detail::__block_size;) {
434 for (int __j = 0; __j < __detail::__block_size;) {
462 __l_size = __remaining_len - __detail::__block_size;
463 __r_size = __detail::__block_size;
465 __l_size = __detail::__block_size;
466 __r_size = __remaining_len - __detail::__block_size;
501 difference_type __tz_left = __detail::__block_size - 1 - __libcpp_clz(__left_bitset);
514 difference_type __tz_right = __detail::__block_size - 1 - __libcpp_clz(__right_bitset);
586 while (__lm1 - __first >= 2 * __detail::__block_size - 1) {
[all …]