Home
last modified time | relevance | path

Searched refs:__i (Results 1 – 25 of 140) sorted by relevance

123456

/freebsd/sys/sys/
H A Dbitset.h62 for (__i = 0; __i < __bitset_words((_s)); __i++) \
68 for (__i = 0; __i < __bitset_words((_s)); __i++) \
80 for (__i = 0; __i < __bitset_words((_s)); __i++) \
89 for (__i = 0; __i < __bitset_words((_s)); __i++) \
98 for (__i = 0; __i < __bitset_words((_s)); __i++) \
109 for (__i = 0; __i < __bitset_words((_s)); __i++) \
119 for (__i = 0; __i < __bitset_words((_s)); __i++) \
128 for (__i = 0; __i < __bitset_words((_s)); __i++) \
134 for (__i = 0; __i < __bitset_words((_s)); __i++) \
140 for (__i = 0; __i < __bitset_words((_s)); __i++) \
[all …]
H A Dsignalvar.h117 int __i; \
118 for (__i = 0; __i < _SIG_WORDS; __i++) \
124 int __i; \
125 for (__i = 0; __i < _SIG_WORDS; __i++) \
140 int __i; \
141 for (__i = 0; __i < _SIG_WORDS; __i++) \
142 (set1).__bits[__i] |= (set2).__bits[__i]; \
148 for (__i = 0; __i < _SIG_WORDS; __i++) \
149 (set1).__bits[__i] &= (set2).__bits[__i]; \
155 for (__i = 0; __i < _SIG_WORDS; __i++) \
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dnth_element.h36 if (__i == --__j) { in __nth_element_find_guard()
107 ++__i; in __nth_element()
110 ++__i; in __nth_element()
119 ++__i; in __nth_element()
134 ++__i; in __nth_element()
147 ++__i; in __nth_element()
150 if (__i < __j) { in __nth_element()
155 ++__i; in __nth_element()
175 ++__i; in __nth_element()
179 if (__i != __m && __comp(*__m, *__i)) { in __nth_element()
[all …]
H A Dminmax_element.h56 _Iter __i = __first; in __minmax_element_impl() local
58 if (__less(__i, __result.first)) in __minmax_element_impl()
59 __result.first = __i; in __minmax_element_impl()
60 else if (!__less(__i, __result.second)) in __minmax_element_impl()
61 __result.second = __i; in __minmax_element_impl()
65 if (__less(__first, __i)) { in __minmax_element_impl()
68 if (!__less(__i, __result.second)) in __minmax_element_impl()
69 __result.second = __i; in __minmax_element_impl()
71 if (__less(__i, __result.first)) in __minmax_element_impl()
72 __result.first = __i; in __minmax_element_impl()
H A Dunwrap_iter.h40 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __unwrap(_Iter __i) _NOEXCEPT { return __i; } in __unwrap()
55 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ToAddressT __unwrap(_Iter __i) _NOEXCEPT {
56 return std::__to_address(__i);
64 __unwrap_iter(_Iter __i) _NOEXCEPT {
65 return _Impl::__unwrap(__i);
71 inline _LIBCPP_HIDE_FROM_ABI constexpr _Iter __unwrap_iter(_Iter __i) noexcept {
72 return __i;
H A Dstable_partition.h66 _ForwardIterator __i = __first; in __stable_partition_impl() local
67 while (++__i != __last) { in __stable_partition_impl()
68 if (__pred(*__i)) { in __stable_partition_impl()
69 *__first = _Ops::__iter_move(__i); in __stable_partition_impl()
79 __i = __first; in __stable_partition_impl()
81 *__i = _Ops::__iter_move(__t2); in __stable_partition_impl()
187 while (++__i != __last) { in __stable_partition_impl()
188 if (__pred(*__i)) { in __stable_partition_impl()
198 *__first = _Ops::__iter_move(__i); in __stable_partition_impl()
199 __i = ++__first; in __stable_partition_impl()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Dadvance.h41 ++__i; in __advance()
49 ++__i; in __advance()
52 --__i; in __advance()
58 __i += __n; in __advance()
87 ++__i; in __advance_forward()
95 --__i; in __advance_backward()
109 __i += __n; in operator()
135 (*this)(__i, __bound_sentinel - __i); in operator()
140 ++__i; in operator()
174 ++__i; in operator()
[all …]
H A Diter_move.h64 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator()(_Ip&& __i) const in decltype()
65 noexcept(noexcept(iter_move(std::forward<_Ip>(__i)))) { in decltype()
66 return iter_move(std::forward<_Ip>(__i)); in decltype()
72 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ip&& __i) const
73 …noexcept(noexcept(std::move(*std::forward<_Ip>(__i)))) -> decltype(std::move(*std::forward<_Ip>(__…
74 return std::move(*std::forward<_Ip>(__i));
79 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ip&& __i) const
80 noexcept(noexcept(*std::forward<_Ip>(__i))) -> decltype(*std::forward<_Ip>(__i)) {
81 return *std::forward<_Ip>(__i);
H A Dconcepts.h54 requires(const _In __i) { in requires() argument
91 movable<_Ip> && requires(_Ip __i) {
101 { __i++ } -> same_as<_Ip>; in requires()
107 { *__i } -> __can_reference; in requires()
120 requires(const _Ip& __i, const _Sp& __s) {
148 { --__i } -> same_as<_Ip&>; in requires()
149 { __i-- } -> same_as<_Ip>; in requires()
157 { __i += __n } -> same_as<_Ip&>; in requires()
160 { __i -= __n } -> same_as<_Ip&>; in requires()
169 requires(const _Ip& __i) { in requires() argument
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__random/
H A Dpiecewise_linear_distribution.h161 for (size_t __i = 0; __i < __areas_.size(); ++__i) { in __init() local
162 __areas_[__i] = (__densities_[__i + 1] + __densities_[__i]) * (__b_[__i + 1] - __b_[__i]) * .5; in __init()
170 for (size_t __i = 1; __i < __areas_.size(); ++__i) in __init() local
215 for (size_t __i = 0; __i < __b_.size(); ++__i) in param_type() local
231 for (size_t __i = 0; __i < __n; ++__i) { in param_type() local
269 for (size_t __i = 0; __i < __n; ++__i) variable
273 for (size_t __i = 0; __i < __n; ++__i) variable
277 for (size_t __i = 0; __i < __n; ++__i) variable
293 for (size_t __i = 0; __i < __n; ++__i) variable
297 for (size_t __i = 0; __i < __n; ++__i) variable
[all …]
H A Dpiecewise_constant_distribution.h161 for (size_t __i = 0; __i < __densities_.size(); ++__i) in __init() local
168 for (size_t __i = 0; __i < __densities_.size(); ++__i) in __init() local
169 __densities_[__i] /= (__b_[__i + 1] - __b_[__i]); in __init()
212 for (size_t __i = 0; __i < __b_.size() - 1; ++__i) in param_type() local
228 for (size_t __i = 0; __i < __n; ++__i) { in param_type() local
256 for (size_t __i = 0; __i < __n; ++__i) variable
260 for (size_t __i = 0; __i < __n; ++__i) variable
264 for (size_t __i = 0; __i < __n; ++__i) variable
280 for (size_t __i = 0; __i < __n; ++__i) variable
284 for (size_t __i = 0; __i < __n; ++__i) variable
[all …]
H A Dsubtract_with_carry_engine.h148 for (size_t __i = 0; __i < __r; ++__i) in seed() local
149 __x_[__i] = static_cast<result_type>(__e() & _Max); in seed()
157 for (size_t __i = 0; __i < __r; ++__i) { in seed() local
171 for (size_t __i = 0; __i < __r; ++__i) in __seed() local
172 __x_[__i] = static_cast<result_type>(__ar[__i] & _Max); in __seed()
183 for (size_t __i = 0; __i < __r; ++__i) in __seed() local
184 …__x_[__i] = static_cast<result_type>((__ar[2 * __i] + ((uint64_t)__ar[2 * __i + 1] << 32)) & _Max); in __seed()
261 for (size_t __i = 0; __i < _Rp + 1; ++__i) variable
262 __is >> __t[__i];
264 for (size_t __i = 0; __i < _Rp; ++__i) variable
[all …]
H A Dshuffle_order_engine.h138 for (size_t __i = 0; __i < __k; ++__i)
139 __v_[__i] = __e_();
200 for (size_t __i = 1; __i < _Kp; ++__i)
201 __os << __sp << __x.__v_[__i];
215 for (size_t __i = 0; __i < _Kp + 1; ++__i)
216 __is >> __vp[__i];
219 for (size_t __i = 0; __i < _Kp; ++__i)
220 __x.__v_[__i] = __vp[__i];
/freebsd/contrib/llvm-project/libcxx/src/ryu/
H A Dd2fixed.cpp127 uint32_t __i = 0; in __append_n_digits() local
139 __i += 4; in __append_n_digits()
145 __i += 2; in __append_n_digits()
168 __i += 4; in __append_d_digits()
174 __i += 2; in __append_d_digits()
189 for (; __i < __count - 1; __i += 2) { in __append_c_digits()
206 for (uint32_t __i = 0; __i < 5; __i += 4) { in __append_nine_digits() local
278 for (int32_t __i = __len - 1; __i >= 0; --__i) { in __d2fixed_buffered_n() local
334 for (; __i < __blocks; ++__i) { in __d2fixed_buffered_n()
474 for (int32_t __i = __len - 1; __i >= 0; --__i) { in __d2exp_buffered_n() local
[all …]
/freebsd/contrib/llvm-project/libcxx/include/experimental/__simd/
H A Dvec_ext.h61 for (int __i = 0; __i < _Np; ++__i) {
62 __result.__set(__i, __v);
79 for (size_t __i = 0; __i < _Np; __i++)
80 __s.__data[__i] = static_cast<_Tp>(__mem[__i]);
91 for (int __i = 0; __i < _Np; ++__i) {
92 __result.__set(__i, __all_bits_v);
98 for (size_t __i = 0; __i < _Np; __i++)
99 __s.__data[__i] = experimental::__set_all_bits<_Tp>(__mem[__i]);
H A Dsimd_mask.h50 for (size_t __i = 0; __i < size(); __i++) { in simd_mask() local
51 (*this)[__i] = __v[__i]; in simd_mask()
62 _LIBCPP_HIDE_FROM_ABI reference operator[](size_t __i) noexcept { return reference(__s_, __i); }
63 _LIBCPP_HIDE_FROM_ABI value_type operator[](size_t __i) const noexcept { return __s_.__get(__i); }
H A Dsimd.h57 for (size_t __i = 0; __i < size(); __i++) { in simd() local
58 (*this)[__i] = static_cast<value_type>(__v[__i]); in simd()
74 _LIBCPP_HIDE_FROM_ABI reference operator[](size_t __i) noexcept { return reference(__s_, __i); }
75 _LIBCPP_HIDE_FROM_ABI value_type operator[](size_t __i) const noexcept { return __s_.__get(__i); }
/freebsd/contrib/llvm-project/libcxx/src/
H A Dvalarray.cpp24 for (size_t __i = 0; __i < __size_.size(); ++__i) in __init() local
25 __k *= __size_[__i]; in __init()
31 size_t __i = __indices.size() - 1; in __init() local
33 if (++__indices[__i] < __size_[__i]) { in __init()
35 __1d_[__k] = __1d_[__k - 1] + __stride_[__i]; in __init()
36 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init()
40 if (__i == 0) in __init()
42 __indices[__i--] = 0; in __init()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/
H A Dtransform_reduce.h46 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_transform_reduce() local
47 __init += __f(__i); in __simd_transform_reduce()
68 for (_Size __i = 0; __i < __block_size; ++__i) { in __simd_transform_reduce() local
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() local
74 for (; __i < __last_iteration; __i += __block_size) { in __simd_transform_reduce()
77 __lane[__j] = __binary_op(std::move(__lane[__j]), __f(__i + __j)); in __simd_transform_reduce()
95 for (_Size __i = 0; __i < __n; ++__i) { in __simd_transform_reduce() local
96 __init = __binary_op(std::move(__init), __f(__i)); in __simd_transform_reduce()
143 return __transform(__first1[__i], __first2[__i]); in __pstl_transform_reduce()
[all …]
H A Dfind_if.h45 …__par_backend::__parallel_for(__first, __last, [__comp, __f, __first, &__extremum](_Index __i, _In… in __parallel_find()
48 if (__comp(__i - __first, __extremum)) { in __parallel_find()
49 _Index __result = __f(__i, __j); in __parallel_find()
72 …A_SIMD_REDUCTION(| : __found) for (_DifferenceType __i = __begin; __i < __begin + __block_size; ++… in __simd_first() local
73 const _DifferenceType __t = __comp(__first, __i); in __simd_first()
74 __lane[__i - __begin] = __t; in __simd_first()
78 _DifferenceType __i; in __simd_first() local
80 for (__i = 0; __i < __block_size; ++__i) { in __simd_first()
81 if (__lane[__i]) { in __simd_first()
85 return __first + __begin + __i; in __simd_first()
[all …]
H A Dtransform.h37 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_walk() local
38 __f(__first1[__i], __first2[__i]); in __simd_walk()
79 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_walk() local
80 __f(__first1[__i], __first2[__i], __first3[__i]); in __simd_walk()
/freebsd/contrib/ntp/libntp/lib/isc/win32/include/isc/
H A Dnet.h158 u_int __i; \
159 for (__i = 0; __i < ((fd_set FAR *)(set))->fd_count; __i++) { \
160 if (((fd_set FAR *)(set))->fd_array[__i] == (SOCKET) fd) { \
161 while (__i < ((fd_set FAR *)(set))->fd_count-1) { \
162 ((fd_set FAR *)(set))->fd_array[__i] = \
163 ((fd_set FAR *)(set))->fd_array[__i+1]; \
164 __i++; \
174 u_int __i; \
175 for (__i = 0; __i < ((fd_set FAR *)(set))->fd_count; __i++) { \
180 if (__i == ((fd_set FAR *)(set))->fd_count) { \
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__mdspan/
H A Dextents.h101 for (int __i = 0; __i != sizeof...(_Values); ++__i) {
103 __running_sum += __values[__i];
159 for (size_t __i = 0; __i < _Size; __i++)
160 __dyn_vals_[__i] = static_cast<_TDynamic>(__vals[__i]);
170 for (size_t __i = 0; __i < __size_; __i++) {
173 __dyn_vals_[_DynamicIdxMap::__get(__i)] = __values[__i];
189 for (size_t __i = 0; __i < __size_; __i++) {
192 __dyn_vals_[_DynamicIdxMap::__get(__i)] = static_cast<_TDynamic>(__vals[__i]);
207 return _StaticValues::__get(__i);
217 return __value(__i);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dvalarray1446 for (size_t __i = 0; __i < __n; ++__i)
1454 for (size_t __i = 0; __i < __n; ++__i)
1462 for (size_t __i = 0; __i < __n; ++__i)
1470 for (size_t __i = 0; __i < __n; ++__i)
1478 for (size_t __i = 0; __i < __n; ++__i)
1486 for (size_t __i = 0; __i < __n; ++__i)
1494 for (size_t __i = 0; __i < __n; ++__i)
1502 for (size_t __i = 0; __i < __n; ++__i)
1510 for (size_t __i = 0; __i < __n; ++__i)
1518 for (size_t __i = 0; __i < __n; ++__i)
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h115 difference_type __i = 0; in __first_() local
117 __skip_table_->insert(*__first, __i); in __first_()
119 ++__i; in __first_()
181 for (size_t __i = 1; __i != __count; ++__i) { in __compute_bm_prefix() local
185 if (__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
187 __prefix[__i] = __k; in __compute_bm_prefix()
201 for (size_t __i = 0; __i <= __count; ++__i) in __build_suffix_table() local
207 for (size_t __i = 0; __i != __count; ++__i) { in __build_suffix_table() local
209 const difference_type __k = __i - __scratch[__i] + 1; in __build_suffix_table()
247 difference_type __i = 0; in __first_() local
[all …]

123456