/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | nth_element.h | 36 if (__i == --__j) { in __nth_element_find_guard() 99 __j = __last; in __nth_element() 114 if (__i == __j) { in __nth_element() 128 --__j; in __nth_element() 150 if (__i < __j) { in __nth_element() 165 --__j; in __nth_element() 167 if (__i >= __j) in __nth_element() 174 __m = __j; in __nth_element() 200 __m = __j; in __nth_element() 204 __j = __m = __i; in __nth_element() [all …]
|
H A D | sort.h | 293 --__j; 300 __j = __k; 330 __j = __k; 383 __j = __k; 389 __j = __i; 418 for (int __j = 0; __j < __detail::__block_size;) { 421 __j++; 434 for (int __j = 0; __j < __detail::__block_size;) { 437 __j++; 471 for (int __j = 0; __j < __l_size; __j++) { [all …]
|
H A D | find_first_of.h | 31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce() local 32 if (__pred(*__first1, *__j)) in __find_first_of_ce()
|
H A D | is_permutation.h | 93 for (auto __j = __first2; __j != __last2; ++__j) { 94 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j))) 102 for (auto __j = _IterOps<_AlgPolicy>::next(__i); __j != __last1; ++__j) { 103 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj1, *__j)))
|
H A D | ranges_find_first_of.h | 47 for (auto __j = __first2; __j != __last2; ++__j) { in __find_first_of_impl() local 48 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl()
|
H A D | next_permutation.h | 43 _BidirectionalIterator __j = __last_iter; in __next_permutation() local 44 while (!__comp(*__i, *--__j)) in __next_permutation() 46 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __next_permutation()
|
H A D | prev_permutation.h | 43 _BidirectionalIterator __j = __last_iter; in __prev_permutation() local 44 while (!__comp(*--__j, *__i)) in __prev_permutation() 46 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __prev_permutation()
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/ |
H A D | transform_reduce.h | 76 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local 77 __lane[__j] = __binary_op(std::move(__lane[__j]), __f(__i + __j)); in __simd_transform_reduce() 82 for (_Size __j = 0; __j < __n - __last_iteration; ++__j) { in __simd_transform_reduce() local 83 __lane[__j] = __binary_op(std::move(__lane[__j]), __f(__last_iteration + __j)); in __simd_transform_reduce() 86 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local 87 __init = __binary_op(std::move(__init), std::move(__lane[__j])); in __simd_transform_reduce() 91 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local 92 __lane[__j].~_Tp(); in __simd_transform_reduce()
|
H A D | find_if.h | 45 …kend::__parallel_for(__first, __last, [__comp, __f, __first, &__extremum](_Index __i, _Index __j) { in __parallel_find() 49 _Index __result = __f(__i, __j); in __parallel_find() 51 if (__result != __j) { in __parallel_find()
|
H A D | any_of.h | 36 …to __ret = __par_backend::__parallel_for(__first, __last, [__f, &__found](_Index __i, _Index __j) { in __parallel_or() 37 if (!__found.load(std::memory_order_relaxed) && __f(__i, __j)) { in __parallel_or()
|
/freebsd/contrib/llvm-project/libcxx/include/__functional/ |
H A D | boyer_moore_searcher.h | 157 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search() 158 --__j; in __search() 159 if (__j == 0) in __search() 164 difference_type __m = __j - __k - 1; in __search() 165 if (__k < __j && __m > __suffix_[__j]) in __search() 168 __current += __suffix_[__j]; in __search() 211 if (__suffix_[__j] > __k) in __build_suffix_table() 212 __suffix_[__j] = __k; in __build_suffix_table() 288 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search() 289 --__j; in __search() [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__random/ |
H A D | subtract_with_carry_engine.h | 208 size_t __j = std::min(_Rp - __x.__i_, _Rp - __y.__i_); variable 212 return std::equal(__x.__x_ + __j, __x.__x_ + _Rp, __y.__x_); 213 return std::equal(__x.__x_, __x.__x_ + (_Rp - __j), __y.__x_ + __j); 216 size_t __j = _Rp - __y.__i_; variable 219 if (!std::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Rp, __y.__x_)) 223 size_t __j = _Rp - __x.__i_; variable 226 if (!std::equal(__y.__x_ + (__y.__i_ + __j), __y.__x_ + _Rp, __x.__x_)) 246 for (size_t __j = __x.__i_ + 1; __j < _Rp; ++__j) variable 247 __os << __sp << __x.__x_[__j]; 248 for (size_t __j = 0; __j < __x.__i_; ++__j) variable [all …]
|
H A D | mersenne_twister_engine.h | 737 const size_t __j = (__i_ + 1) % __n; in operator() local 743 __i_ = __j; in operator() 769 size_t __j = std::min(_Np - __x.__i_, _Np - __y.__i_); variable 773 return std::equal(__x.__x_ + __j, __x.__x_ + _Np, __y.__x_); 774 return std::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j); 777 size_t __j = _Np - __y.__i_; variable 784 size_t __j = _Np - __x.__i_; variable 837 for (size_t __j = __x.__i_ + 1; __j < _Np; ++__j) variable 838 __os << __sp << __x.__x_[__j]; 839 for (size_t __j = 0; __j < __x.__i_; ++__j) variable [all …]
|
H A D | shuffle_order_engine.h | 160 …const size_t __j = static_cast<size_t>(__uratio<_Np, _Dp>::num * (__y_ - _Min) / __uratio<_Np, _Dp… 161 __y_ = __v_[__j]; 162 __v_[__j] = __e_(); 169 const size_t __j = static_cast<size_t>(__fp * (__y_ - _Min)); 170 __y_ = __v_[__j]; 171 __v_[__j] = __e_();
|
/freebsd/contrib/llvm-project/libcxx/src/ |
H A D | valarray.cpp | 36 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init() local 37 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
|
/freebsd/contrib/llvm-project/libcxx/src/ryu/ |
H A D | d2fixed.cpp | 105 _LIBCPP_ASSERT_INTERNAL(__j >= 128, ""); in __mulShift_mod1e9() 106 _LIBCPP_ASSERT_INTERNAL(__j <= 180, ""); in __mulShift_mod1e9() 113 if (__j < 160) { // __j: [128, 160) in __mulShift_mod1e9() 117 return __mod1e9(__r2 >> (__j - 128)); in __mulShift_mod1e9() 121 return __mod1e9(__r1 >> (__j - 160)); in __mulShift_mod1e9() 279 const uint32_t __j = __p10bits - __e2; in __d2fixed_buffered_n() local 283 static_cast<int32_t>(__j + 8)); in __d2fixed_buffered_n() 335 const int32_t __j = __ADDITIONAL_BITS_2 + (-__e2 - 16 * __idx); in __d2fixed_buffered_n() local 475 const uint32_t __j = __p10bits - __e2; in __d2exp_buffered_n() local 479 static_cast<int32_t>(__j + 8)); in __d2exp_buffered_n() [all …]
|
H A D | d2s.cpp | 95 …BI inline uint64_t __mulShift(const uint64_t __m, const uint64_t* const __mul, const int32_t __j) { in __mulShift() argument 105 return __ryu_shiftright128(__sum, __high1, static_cast<uint32_t>(__j - 64)); in __mulShift() 110 *__vp = __mulShift(4 * __m + 2, __mul, __j); in __mulShiftAll() 111 *__vm = __mulShift(4 * __m - 1 - __mmShift, __mul, __j); in __mulShiftAll() 112 return __mulShift(4 * __m, __mul, __j); in __mulShiftAll() 130 *__vp = __ryu_shiftright128(__mid2, __hi2, static_cast<uint32_t>(__j - 64 - 1)); 136 *__vm = __ryu_shiftright128(__mid3, __hi3, static_cast<uint32_t>(__j - 64 - 1)); 144 *__vm = __ryu_shiftright128(__mid4, __hi4, static_cast<uint32_t>(__j - 64)); 147 return __ryu_shiftright128(__mid, __hi, static_cast<uint32_t>(__j - 64 - 1)); 241 const int32_t __j = static_cast<int32_t>(__q) - __k; in __d2d() local [all …]
|
H A D | f2s.cpp | 142 …BI inline uint32_t __mulPow5InvDivPow2(const uint32_t __m, const uint32_t __q, const int32_t __j) { in __mulPow5InvDivPow2() argument 143 return __mulShift(__m, __FLOAT_POW5_INV_SPLIT[__q], __j); in __mulPow5InvDivPow2() 146 …M_ABI inline uint32_t __mulPow5divPow2(const uint32_t __m, const uint32_t __i, const int32_t __j) { in __mulPow5divPow2() argument 147 return __mulShift(__m, __FLOAT_POW5_SPLIT[__i], __j); in __mulPow5divPow2() 215 int32_t __j = static_cast<int32_t>(__q) - __k; in __f2d() local 216 __vr = __mulPow5divPow2(__mv, static_cast<uint32_t>(__i), __j); in __f2d() 217 __vp = __mulPow5divPow2(__mp, static_cast<uint32_t>(__i), __j); in __f2d() 218 __vm = __mulPow5divPow2(__mm, static_cast<uint32_t>(__i), __j); in __f2d() 220 __j = static_cast<int32_t>(__q) - 1 - (__pow5bits(__i + 1) - __FLOAT_POW5_BITCOUNT); in __f2d() 221 …ovedDigit = static_cast<uint8_t>(__mulPow5divPow2(__mv, static_cast<uint32_t>(__i + 1), __j) % 10); in __f2d()
|
/freebsd/contrib/llvm-project/libcxx/include/__charconv/ |
H A D | traits.h | 162 int __j = digits - 1; 170 __a = __inner_product(__cprod + __i + 1, __cprod + __j, __pow() + 1, __cprod[__i]); 171 if (__itoa::__mul_overflowed(__cprod[__j], __pow()[__j - __i], __b))
|
/freebsd/sys/ofed/drivers/infiniband/ulp/sdp/ |
H A D | sdp_proc.c | 248 unsigned int __j; \ 250 for (__j = 0; __j < hist_len; __j++) { \ 251 sum[__j] += h[__j]; \
|
/freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | iota_view.h | 86 requires(_Iter __i, const _Iter __j, const _IotaDiffT<_Iter> __n) { in requires() argument 89 _Iter(__j + __n); in requires() 90 _Iter(__n + __j); in requires() 91 _Iter(__j - __n); in requires() 92 { __j - __j } -> convertible_to<_IotaDiffT<_Iter>>; in requires()
|
/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | forward_list | 1045 for (; __j != __e && __f != __l; ++__i, (void)++__j, ++__f) 1046 *__j = *__f; 1047 if (__j == __e) 1058 for (; __j != __e && __n > 0; --__n, ++__i, ++__j) 1059 *__j = __v; 1342 for (; __j != __e && *__j == __v; ++__j) 1347 __i = __j; 1365 for (; __j != __e && __pred(*__j); ++__j) 1370 __i = __j; 1386 for (; __j != __e && __binary_pred(*__i, *__j); ++__j) [all …]
|
H A D | valarray | 1266 size_t __j = 0; 1275 size_t __j = 0; 1284 size_t __j = 0; 1293 size_t __j = 0; 1302 size_t __j = 0; 1311 size_t __j = 0; 1320 size_t __j = 0; 1329 size_t __j = 0; 1338 size_t __j = 0; 1347 size_t __j = 0; [all …]
|
H A D | list | 1498 const_iterator __j = std::next(__i); 1499 for (; __j != __e && *__j == __x; ++__j) 1501 __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j); 1502 __i = __j; 1518 iterator __j = std::next(__i); 1519 for (; __j != __e && __pred(*__j); ++__j) 1522 __i = __j; 1537 iterator __j = std::next(__i); 1538 for (; __j != __e && __binary_pred(*__i, *__j); ++__j) 1540 if (++__i != __j) { [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
H A D | concepts.h | 156 requires(_Ip __i, const _Ip __j, const iter_difference_t<_Ip> __n) { in requires() argument 158 { __j + __n } -> same_as<_Ip>; in requires() 159 { __n + __j } -> same_as<_Ip>; in requires() 161 { __j - __n } -> same_as<_Ip>; in requires() 162 { __j[__n] } -> same_as<iter_reference_t<_Ip>>; in requires()
|