Home
last modified time | relevance | path

Searched refs:__j (Results 1 – 25 of 31) sorted by relevance

12

/freebsd-14-stable/contrib/llvm-project/libcxx/include/__algorithm/
HDnth_element.h33 …_RandomAccessIterator& __i, _RandomAccessIterator& __j, _RandomAccessIterator __m, _Compare __comp… in __nth_element_find_guard() argument
36 if (__i == --__j) { in __nth_element_find_guard()
39 if (__comp(*__j, *__m)) { in __nth_element_find_guard()
85 _RandomAccessIterator __j = __lm1; in __nth_element() local
92 if (std::__nth_element_find_guard<_Compare>(__i, __j, __m, __comp)) { in __nth_element()
93 _Ops::iter_swap(__i, __j); in __nth_element()
99 __j = __last; in __nth_element()
100 if (!__comp(*__first, *--__j)) { // we need a guard if *__first == *(__last-1) in __nth_element()
102 if (__i == __j) { in __nth_element()
105 _Ops::iter_swap(__i, __j); in __nth_element()
[all …]
HDsort.h292 _BidirectionalIterator __j = __i;
293 --__j;
294 if (__comp(*__i, *__j)) {
296 _BidirectionalIterator __k = __j;
297 __j = __i;
299 *__j = _Ops::__iter_move(__k);
300 __j = __k;
301 } while (__j != __first && __comp(__t, *--__k));
302 *__j = std::move(__t);
323 _RandomAccessIterator __j = __i - difference_type(1);
[all …]
HDfind_first_of.h31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce() local
32 if (__pred(*__first1, *__j)) in __find_first_of_ce()
HDis_permutation.h93 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)))
HDranges_find_first_of.h47 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()
HDprev_permutation.h43 _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()
HDnext_permutation.h43 _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()
/freebsd-14-stable/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/
HDtransform_reduce.h81 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
82 __lane[__j] = __binary_op(std::move(__lane[__j]), __f(__i + __j)); in __simd_transform_reduce()
87 for (_Size __j = 0; __j < __n - __last_iteration; ++__j) { in __simd_transform_reduce() local
88 __lane[__j] = __binary_op(std::move(__lane[__j]), __f(__last_iteration + __j)); in __simd_transform_reduce()
91 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
92 __init = __binary_op(std::move(__init), std::move(__lane[__j])); in __simd_transform_reduce()
96 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
97 __lane[__j].~_Tp(); in __simd_transform_reduce()
HDfind_if.h46 …Backend>::__for_each(__first, __last, [__comp, __f, __first, &__extremum](_Index __i, _Index __j) { in __parallel_find()
50 _Index __result = __f(__i, __j); in __parallel_find()
52 if (__result != __j) { in __parallel_find()
HDany_of.h35 …ret = __cpu_traits<_Backend>::__for_each(__first, __last, [__f, &__found](_Index __i, _Index __j) { in __parallel_or()
36 if (!__found.load(std::memory_order_relaxed) && __f(__i, __j)) { in __parallel_or()
/freebsd-14-stable/contrib/llvm-project/libcxx/include/__functional/
HDboyer_moore_searcher.h156 difference_type __j = __pattern_length_; in __search() local
157 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
158 --__j; in __search()
159 if (__j == 0) in __search()
163 difference_type __k = __skip_table[__current[__j - 1]]; 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()
208 const size_t __j = __count - __scratch[__i]; in __build_suffix_table() local
211 if (__suffix_[__j] > __k) in __build_suffix_table()
[all …]
/freebsd-14-stable/contrib/llvm-project/libcxx/include/__random/
HDsubtract_with_carry_engine.h208 size_t __j = std::min(_Rp - __x.__i_, _Rp - __y.__i_); variable
209 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
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
217 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
219 if (!std::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Rp, __y.__x_))
221 return std::equal(__x.__x_, __x.__x_ + __x.__i_, __y.__x_ + (_Rp - (__x.__i_ + __j)));
223 size_t __j = _Rp - __x.__i_; variable
224 if (!std::equal(__y.__x_ + __y.__i_, __y.__x_ + (__y.__i_ + __j), __x.__x_ + __x.__i_))
[all …]
HDmersenne_twister_engine.h737 const size_t __j = (__i_ + 1) % __n; in operator() local
739 const result_type __yp = (__x_[__i_] & ~__mask) | (__x_[__j] & __mask); in operator()
743 __i_ = __j; in operator()
769 size_t __j = std::min(_Np - __x.__i_, _Np - __y.__i_); variable
770 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
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
778 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
780 if (!std::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Np, __y.__x_))
[all …]
HDshuffle_order_engine.h160 …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-14-stable/contrib/llvm-project/libcxx/src/
HDvalarray.cpp36 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init() local
37 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
/freebsd-14-stable/contrib/llvm-project/libcxx/src/ryu/
HDd2fixed.cpp91 …ne uint32_t __mulShift_mod1e9(const uint64_t __m, const uint64_t* const __mul, const int32_t __j) { in __mulShift_mod1e9() argument
105 _LIBCPP_ASSERT_INTERNAL(__j >= 128, ""); in __mulShift_mod1e9()
106 _LIBCPP_ASSERT_INTERNAL(__j <= 180, ""); in __mulShift_mod1e9()
108 const uint32_t __dist = static_cast<uint32_t>(__j - 128); // __dist: [0, 52] 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
[all …]
HDd2s.cpp95 …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()
108 …I inline uint64_t __mulShiftAll(const uint64_t __m, const uint64_t* const __mul, const int32_t __j, in __mulShiftAll() argument
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()
117 …_ALWAYS_INLINE uint64_t __mulShiftAll(uint64_t __m, const uint64_t* const __mul, const int32_t __j,
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));
[all …]
HDf2s.cpp142 …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-14-stable/contrib/llvm-project/libcxx/include/__charconv/
HDtraits.h163 int __j = digits - 1;
171 __a = __inner_product(__cprod + __i + 1, __cprod + __j, __pow() + 1, __cprod[__i]);
172 if (__itoa::__mul_overflowed(__cprod[__j], __pow()[__j - __i], __b))
/freebsd-14-stable/sys/ofed/drivers/infiniband/ulp/sdp/
HDsdp_proc.c248 unsigned int __j; \
250 for (__j = 0; __j < hist_len; __j++) { \
251 sum[__j] += h[__j]; \
/freebsd-14-stable/contrib/llvm-project/libcxx/include/__ranges/
HDiota_view.h85 requires(_Iter __i, const _Iter __j, const _IotaDiffT<_Iter> __n) { in requires() argument
88 _Iter(__j + __n); in requires()
89 _Iter(__n + __j); in requires()
90 _Iter(__j - __n); in requires()
91 { __j - __j } -> convertible_to<_IotaDiffT<_Iter>>; in requires()
/freebsd-14-stable/contrib/llvm-project/libcxx/include/
HDforward_list1024 iterator __j = std::next(__i);
1026 for (; __j != __e && __f != __l; ++__i, (void)++__j, ++__f)
1027 *__j = *__f;
1028 if (__j == __e)
1037 iterator __j = std::next(__i);
1039 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
1040 *__j = __v;
1041 if (__j == __e)
1322 iterator __j = std::next(__i, 2);
1323 for (; __j != __e && *__j == __v; ++__j)
[all …]
HDvalarray671 _LIBCPP_HIDE_FROM_ABI __result_type operator[](size_t __j) const {
672 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
1334 size_t __j = 0;
1335 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1336 __vp_[*__i] = __v[__j];
1343 size_t __j = 0;
1344 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1345 __vp_[*__i] *= __v[__j];
1352 size_t __j = 0;
1353 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
[all …]
HDlist1476 const_iterator __j = std::next(__i);
1477 for (; __j != __e && *__j == __x; ++__j)
1479 __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
1480 __i = __j;
1496 iterator __j = std::next(__i);
1497 for (; __j != __e && __pred(*__j); ++__j)
1499 __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
1500 __i = __j;
1515 iterator __j = std::next(__i);
1516 for (; __j != __e && __binary_pred(*__i, *__j); ++__j)
[all …]
/freebsd-14-stable/contrib/llvm-project/libcxx/include/__iterator/
HDconcepts.h156 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()

12