Home
last modified time | relevance | path

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

12345

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/tr1/
H A Driemann_zeta.tcc199 for (unsigned int __j = 0; __j <= __i; ++__j) in __riemann_zeta_glob() local
203 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __j)) in __riemann_zeta_glob()
204 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __i - __j)); in __riemann_zeta_glob()
207 - __log_gamma(_Tp(1 + __j)) in __riemann_zeta_glob()
208 - __log_gamma(_Tp(1 + __i - __j)); in __riemann_zeta_glob()
217 __term += __sgn * __bincoeff * std::pow(_Tp(1 + __j), -__s); in __riemann_zeta_glob()
382 for (unsigned int __j = 0; __j <= __i; ++__j) in __hurwitz_zeta_glob() local
386 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __j)) in __hurwitz_zeta_glob()
387 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __i - __j)); in __hurwitz_zeta_glob()
390 - __log_gamma(_Tp(1 + __j)) in __hurwitz_zeta_glob()
[all …]
H A Dexp_integral.tcc256 for (unsigned int __j = 2; __j < __n; ++__j) in __expint_En_recursion() local
257 __En = (std::exp(-__x) - __x * __En) / _Tp(__j - 1); in __expint_En_recursion()
265 for (int __j = __N; __j > 0; --__j) in __expint_En_recursion() local
267 __En = (std::exp(-__x) - __j * __En) / __x; in __expint_En_recursion()
268 if (__j == __n) in __expint_En_recursion()
H A Drandom.tcc450 for (int __j = 0; __j < __n; ++__j) in seed() local
557 for (int __j = 0; __j < __n; ++__j) in _M_initialize_npows() local
559 _M_npows[__j] = std::tr1::ldexp(_RealType(1), -__w + __j * 32); in _M_initialize_npows()
561 _M_npows[__j] = std::pow(_RealType(2), -__w + __j * 32); in _M_initialize_npows()
589 for (int __j = 0; __j < __n - 1; ++__j) in seed() local
590 _M_x[__i][__j] = __detail::__mod<_UInt32Type, 1, 0, 0>(__gen()); in seed()
596 for (int __j = 0; __j < __n; ++__j) in seed() local
597 if (_M_x[long_lag - 1][__j] != 0) in seed()
617 for (int __j = 0; __j < __n - 1; ++__j) in operator ()() local
619 if (_M_x[__ps][__j] > _M_x[_M_p][__j] in operator ()()
[all …]
H A Dhypergeometric.tcc505 const int __j = __i - 1; in __hyperg_reflect() local
506 __term *= (__a + __d2 + __j) * (__b + __d2 + __j) in __hyperg_reflect()
507 / (_Tp(1) + __d2 + __j) / __i * (_Tp(1) - __x); in __hyperg_reflect()
556 int __j; in __hyperg_reflect() local
557 for (__j = 1; __j < __maxiter; ++__j) in __hyperg_reflect()
561 const _Tp __term1 = _Tp(1) / _Tp(__j) in __hyperg_reflect()
562 + _Tp(1) / (__ad + __j); in __hyperg_reflect()
563 const _Tp __term2 = _Tp(1) / (__a + __d1 + _Tp(__j - 1)) in __hyperg_reflect()
564 + _Tp(1) / (__b + __d1 + _Tp(__j - 1)); in __hyperg_reflect()
566 __fact *= (__a + __d1 + _Tp(__j - 1)) in __hyperg_reflect()
[all …]
H A Dlegendre_function.tcc173 for (unsigned int __j = __m + 2; __j <= __l; ++__j) in __assoc_legendre_p() local
175 __p_lm = (_Tp(2 * __j - 1) * __x * __P_lm1m in __assoc_legendre_p()
176 - _Tp(__j + __m - 1) * __p_lm2m) / _Tp(__j - __m); in __assoc_legendre_p()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/tr1/
H A Driemann_zeta.tcc199 for (unsigned int __j = 0; __j <= __i; ++__j) in __riemann_zeta_glob() local
203 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __j)) in __riemann_zeta_glob()
204 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __i - __j)); in __riemann_zeta_glob()
207 - __log_gamma(_Tp(1 + __j)) in __riemann_zeta_glob()
208 - __log_gamma(_Tp(1 + __i - __j)); in __riemann_zeta_glob()
217 __term += __sgn * __bincoeff * std::pow(_Tp(1 + __j), -__s); in __riemann_zeta_glob()
382 for (unsigned int __j = 0; __j <= __i; ++__j) in __hurwitz_zeta_glob() local
386 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __j)) in __hurwitz_zeta_glob()
387 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __i - __j)); in __hurwitz_zeta_glob()
390 - __log_gamma(_Tp(1 + __j)) in __hurwitz_zeta_glob()
[all …]
H A Dexp_integral.tcc256 for (unsigned int __j = 2; __j < __n; ++__j) in __expint_En_recursion() local
257 __En = (std::exp(-__x) - __x * __En) / _Tp(__j - 1); in __expint_En_recursion()
265 for (int __j = __N; __j > 0; --__j) in __expint_En_recursion() local
267 __En = (std::exp(-__x) - __j * __En) / __x; in __expint_En_recursion()
268 if (__j == __n) in __expint_En_recursion()
H A Drandom.tcc450 for (int __j = 0; __j < __n; ++__j) in seed() local
557 for (int __j = 0; __j < __n; ++__j) in _M_initialize_npows() local
559 _M_npows[__j] = std::tr1::ldexp(_RealType(1), -__w + __j * 32); in _M_initialize_npows()
561 _M_npows[__j] = std::pow(_RealType(2), -__w + __j * 32); in _M_initialize_npows()
589 for (int __j = 0; __j < __n - 1; ++__j) in seed() local
590 _M_x[__i][__j] = __detail::__mod<_UInt32Type, 1, 0, 0>(__gen()); in seed()
596 for (int __j = 0; __j < __n; ++__j) in seed() local
597 if (_M_x[long_lag - 1][__j] != 0) in seed()
617 for (int __j = 0; __j < __n - 1; ++__j) in operator ()() local
619 if (_M_x[__ps][__j] > _M_x[_M_p][__j] in operator ()()
[all …]
H A Dhypergeometric.tcc505 const int __j = __i - 1; in __hyperg_reflect() local
506 __term *= (__a + __d2 + __j) * (__b + __d2 + __j) in __hyperg_reflect()
507 / (_Tp(1) + __d2 + __j) / __i * (_Tp(1) - __x); in __hyperg_reflect()
556 int __j; in __hyperg_reflect() local
557 for (__j = 1; __j < __maxiter; ++__j) in __hyperg_reflect()
561 const _Tp __term1 = _Tp(1) / _Tp(__j) in __hyperg_reflect()
562 + _Tp(1) / (__ad + __j); in __hyperg_reflect()
563 const _Tp __term2 = _Tp(1) / (__a + __d1 + _Tp(__j - 1)) in __hyperg_reflect()
564 + _Tp(1) / (__b + __d1 + _Tp(__j - 1)); in __hyperg_reflect()
566 __fact *= (__a + __d1 + _Tp(__j - 1)) in __hyperg_reflect()
[all …]
H A Dlegendre_function.tcc173 for (unsigned int __j = __m + 2; __j <= __l; ++__j) in __assoc_legendre_p() local
175 __p_lm = (_Tp(2 * __j - 1) * __x * __P_lm1m in __assoc_legendre_p()
176 - _Tp(__j + __m - 1) * __p_lm2m) / _Tp(__j - __m); in __assoc_legendre_p()
/OK3568_Linux_fs/kernel/security/apparmor/include/
H A Dlib.h230 int __j, __k, __count; \
237 __j = 0; \
243 __lvec[__j++] = __new_; \
245 for (__j = __count = 0; __j < (L)->size; __j++) \
246 __count += __lvec[__j]->size; \
248 for (__j = __k = 0; __j < (L)->size; __j++) { \
249 label_for_each(__i, __lvec[__j], (P)) \
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Dvalarray_array.h239 for (size_t __j = 0; __j < __n; ++__j, ++__i) in _GLIBCXX_VISIBILITY()
314 for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i) in _GLIBCXX_VISIBILITY()
324 for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i) in _GLIBCXX_VISIBILITY()
334 _Tp* __restrict__ __dst, const size_t* __restrict__ __j) in _GLIBCXX_VISIBILITY()
337 __dst[*__j++] = __src[*__i++]; in _GLIBCXX_VISIBILITY()
484 _Array<_Tp> __dst, _Array<size_t> __j) in _GLIBCXX_VISIBILITY()
487 __dst._M_data, __j._M_data); in _GLIBCXX_VISIBILITY()
577 for (size_t* __j = __i._M_data; __j < __i._M_data + __n; \ in _GLIBCXX_VISIBILITY()
578 ++__j, ++__q) \ in _GLIBCXX_VISIBILITY()
579 __a._M_data[*__j] _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
[all …]
H A Dvalarray_array.tcc168 size_t* __j (__i._M_data); in __valarray_copy() local
169 for (size_t __k = 0; __k < __n; ++__k, ++__j) in __valarray_copy()
170 __a._M_data[*__j] = __e[__k]; in __valarray_copy()
182 size_t* __j (__i._M_data); in __valarray_copy() local
183 for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) in __valarray_copy()
184 __a._M_data[*__j] = __e._M_data[*__g]; in __valarray_copy()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Dvalarray_array.h239 for (size_t __j = 0; __j < __n; ++__j, ++__i) in _GLIBCXX_VISIBILITY()
314 for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i) in _GLIBCXX_VISIBILITY()
324 for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i) in _GLIBCXX_VISIBILITY()
334 _Tp* __restrict__ __dst, const size_t* __restrict__ __j) in _GLIBCXX_VISIBILITY()
337 __dst[*__j++] = __src[*__i++]; in _GLIBCXX_VISIBILITY()
484 _Array<_Tp> __dst, _Array<size_t> __j) in _GLIBCXX_VISIBILITY()
487 __dst._M_data, __j._M_data); in _GLIBCXX_VISIBILITY()
577 for (size_t* __j = __i._M_data; __j < __i._M_data + __n; \ in _GLIBCXX_VISIBILITY()
578 ++__j, ++__q) \ in _GLIBCXX_VISIBILITY()
579 __a._M_data[*__j] _Op##= *__q; \ in _GLIBCXX_VISIBILITY()
[all …]
H A Dvalarray_array.tcc168 size_t* __j (__i._M_data); in __valarray_copy() local
169 for (size_t __k = 0; __k < __n; ++__k, ++__j) in __valarray_copy()
170 __a._M_data[*__j] = __e[__k]; in __valarray_copy()
182 size_t* __j (__i._M_data); in __valarray_copy() local
183 for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) in __valarray_copy()
184 __a._M_data[*__j] = __e._M_data[*__g]; in __valarray_copy()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/parallel/
H A Dmultiseq_selection.h217 _SeqNumber __j; variable
218 for (__j = 0;
219 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
220 ++__j)
221 __a[__sample[__j].second] += __n + 1;
222 for (; __j < __m; __j++)
223 __b[__sample[__j].second] -= __n + 1;
470 _SeqNumber __j; variable
471 for (__j = 0;
472 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
[all …]
H A Dsearch.h60 for (_DifferenceType __j = 2; __j <= __length; __j++) in __calc_borders() local
62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1])) in __calc_borders()
64 __off[__j] = ++__k; in __calc_borders()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/parallel/
H A Dmultiseq_selection.h217 _SeqNumber __j; variable
218 for (__j = 0;
219 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
220 ++__j)
221 __a[__sample[__j].second] += __n + 1;
222 for (; __j < __m; __j++)
223 __b[__sample[__j].second] -= __n + 1;
470 _SeqNumber __j; variable
471 for (__j = 0;
472 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
[all …]
H A Dsearch.h60 for (_DifferenceType __j = 2; __j <= __length; __j++) in __calc_borders() local
62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1])) in __calc_borders()
64 __off[__j] = ++__k; in __calc_borders()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/pstl/
H A Dparallel_impl.h37 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) { in __parallel_find()
42 _Index __res = __f(__i, __j); in __parallel_find()
44 if (__res != __j) in __parallel_find()
68 [__f, &__found](_Index __i, _Index __j) { in __parallel_or()
69 if (!__found.load(std::memory_order_relaxed) && __f(__i, __j)) in __parallel_or()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/pstl/
H A Dparallel_impl.h37 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) { in __parallel_find()
42 _Index __res = __f(__i, __j); in __parallel_find()
44 if (__res != __j) in __parallel_find()
68 [__f, &__found](_Index __i, _Index __j) { in __parallel_or()
69 if (!__found.load(std::memory_order_relaxed) && __f(__i, __j)) in __parallel_or()
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/experimental/
H A Dfunctional281 difference_type __j = __pattern_length_;
282 while (__pred_(__first_ [__j-1], __cur [__j-1])) {
283 __j--;
285 if ( __j == 0 )
290 difference_type __k = __skip[__cur [ __j - 1 ]];
291 difference_type __m = __j - __k - 1;
292 if (__k < __j && __m > __suffix[ __j ])
295 __cur += __suffix[ __j ];
338 const std::size_t __j = __count - __scratch[__i];
341 if (__suffix[__j] > __k)
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/experimental/
H A Dfunctional281 difference_type __j = __pattern_length_;
282 while (__pred_(__first_ [__j-1], __cur [__j-1])) {
283 __j--;
285 if ( __j == 0 )
290 difference_type __k = __skip[__cur [ __j - 1 ]];
291 difference_type __m = __j - __k - 1;
292 if (__k < __j && __m > __suffix[ __j ])
295 __cur += __suffix[ __j ];
338 const std::size_t __j = __count - __scratch[__i];
341 if (__suffix[__j] > __k)
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A D__debug189 const iterator* __j = static_cast<const iterator*>(__i);
191 return _Cp->__dereferenceable(__j);
199 const iterator* __j = static_cast<const iterator*>(__i);
201 return _Cp->__decrementable(__j);
209 const iterator* __j = static_cast<const iterator*>(__i);
211 return _Cp->__addable(__j, __n);
219 const iterator* __j = static_cast<const iterator*>(__i);
221 return _Cp->__subscriptable(__j, __n);
283 bool __less_than_comparable(const void* __i, const void* __j) const;
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A D__debug189 const iterator* __j = static_cast<const iterator*>(__i);
191 return _Cp->__dereferenceable(__j);
199 const iterator* __j = static_cast<const iterator*>(__i);
201 return _Cp->__decrementable(__j);
209 const iterator* __j = static_cast<const iterator*>(__i);
211 return _Cp->__addable(__j, __n);
219 const iterator* __j = static_cast<const iterator*>(__i);
221 return _Cp->__subscriptable(__j, __n);
283 bool __less_than_comparable(const void* __i, const void* __j) const;

12345