| /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
82 for (_Size __j = 0; __j < __n - __last_iteration; ++__j) { in __simd_transform_reduce() local
86 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
91 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
|
| /freebsd/contrib/llvm-project/libcxx/include/__random/ |
| H A D | mersenne_twister_engine.h | 737 const size_t __j = (__i_ + 1) % __n; in operator() local
769 size_t __j = std::min(_Np - __x.__i_, _Np - __y.__i_); variable
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
839 for (size_t __j = 0; __j < __x.__i_; ++__j) variable
|
| H A D | subtract_with_carry_engine.h | 208 size_t __j = std::min(_Rp - __x.__i_, _Rp - __y.__i_); variable
216 size_t __j = _Rp - __y.__i_; variable
223 size_t __j = _Rp - __x.__i_; variable
246 for (size_t __j = __x.__i_ + 1; __j < _Rp; ++__j) variable
248 for (size_t __j = 0; __j < __x.__i_; ++__j) variable
|
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | nth_element.h | 33 …_RandomAccessIterator& __i, _RandomAccessIterator& __j, _RandomAccessIterator __m, _Compare __comp… in __nth_element_find_guard()
85 _RandomAccessIterator __j = __lm1; in __nth_element() local
|
| H A D | ranges_find_first_of.h | 47 for (auto __j = __first2; __j != __last2; ++__j) { in __find_first_of_impl() local
|
| H A D | next_permutation.h | 43 _BidirectionalIterator __j = __last_iter; in __next_permutation() local
|
| H A D | prev_permutation.h | 43 _BidirectionalIterator __j = __last_iter; in __prev_permutation() local
|
| H A D | find_first_of.h | 31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce() local
|
| /freebsd/contrib/llvm-project/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 156 difference_type __j = __pattern_length_; in __search() local
208 const size_t __j = __count - __scratch[__i]; in __build_suffix_table() local
287 difference_type __j = __pattern_length_; in __search() local
|
| /freebsd/contrib/llvm-project/libcxx/src/ryu/ |
| H A D | d2fixed.cpp | 91 …ne uint32_t __mulShift_mod1e9(const uint64_t __m, const uint64_t* const __mul, const int32_t __j) { in __mulShift_mod1e9()
279 const uint32_t __j = __p10bits - __e2; in __d2fixed_buffered_n() local
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
518 const int32_t __j = __ADDITIONAL_BITS_2 + (-__e2 - 16 * __idx); in __d2exp_buffered_n() local
|
| 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()
108 …I inline uint64_t __mulShiftAll(const uint64_t __m, const uint64_t* const __mul, const int32_t __j, in __mulShiftAll()
241 const int32_t __j = static_cast<int32_t>(__q) - __k; in __d2d() local
|
| 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()
146 …M_ABI inline uint32_t __mulPow5divPow2(const uint32_t __m, const uint32_t __i, const int32_t __j) { in __mulPow5divPow2()
215 int32_t __j = static_cast<int32_t>(__q) - __k; in __f2d() local
|
| /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
|
| /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()
|
| /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()
|