Home
last modified time | relevance | path

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

12

/NextBSD/contrib/libstdc++/config/locale/gnu/
Dnumeric_members.cc61 for (size_t __j = 0; __j < __num_base::_S_iend; ++__j) in _GLIBCXX_BEGIN_NAMESPACE() local
62 _M_data->_M_atoms_in[__j] = __num_base::_S_atoms_in[__j]; in _GLIBCXX_BEGIN_NAMESPACE()
116 for (size_t __j = 0; __j < __num_base::_S_iend; ++__j) in _M_initialize_numpunct() local
117 _M_data->_M_atoms_in[__j] = in _M_initialize_numpunct()
118 static_cast<wchar_t>(__num_base::_S_atoms_in[__j]); in _M_initialize_numpunct()
Dctype_members.cc289 for (size_t __j = 0; in _M_initialize_ctype() local
290 __j < sizeof(_M_widen) / sizeof(wint_t); ++__j) in _M_initialize_ctype()
291 _M_widen[__j] = btowc(__j); in _M_initialize_ctype()
/NextBSD/contrib/libstdc++/src/
Dlocale.cc263 for (size_t __j = 0; __j < _M_facets_size; ++__j) in _Impl() local
265 _M_caches[__j] = __imp._M_caches[__j]; in _Impl()
266 if (_M_caches[__j]) in _Impl()
267 _M_caches[__j]->_M_add_reference(); in _Impl()
343 for (size_t __j = 0; __j < _M_facets_size; ++__j) in _M_install_facet() local
344 __newc[__j] = _M_caches[__j]; in _M_install_facet()
Dlocalename.cc98 for (size_t __j = 0; __j < __i; ++__j) in locale() local
100 __str += _S_categories[__j]; in locale()
193 for (size_t __j = 0; __j < _M_facets_size; ++__j) in _Impl() local
194 _M_caches[__j] = 0; in _Impl()
Dvalarray-inst.cc85 for (size_t __j = 0; __j < __z; ++__j) in __gslice_to_index() local
94 __i[__j] = __a; in __gslice_to_index()
Dmt_allocator.cc178 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); in _M_initialize() local
179 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j)); in _M_initialize()
475 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); in _M_initialize() local
476 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j)); in _M_initialize()
668 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); in _M_initialize() local
669 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j)); in _M_initialize()
Dlocale_init.cc376 for (size_t __j = 1; __j < _S_categories_size; ++__j) in _Impl() local
377 _M_names[__j] = 0; in _Impl()
/NextBSD/contrib/libc++/src/
Dvalarray.cpp39 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init() local
40 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
/NextBSD/contrib/libstdc++/include/bits/
Dvalarray_array.h248 for (size_t __j = 0; __j < __n; ++__j, ++__i)
320 for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i)
330 for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i)
340 _Tp* __restrict__ __dst, const size_t* __restrict__ __j)
343 __dst[*__j++] = __src[*__i++];
504 _Array<_Tp> __dst, _Array<size_t> __j)
507 __dst._M_data, __j._M_data);
603 for (size_t* __j = __i._M_data; __j < __i._M_data + __n; \
604 ++__j, ++__q) \
605 __a._M_data[*__j] _Op##= *__q; \
[all …]
Dvalarray_array.tcc171 size_t* __j (__i._M_data); in __valarray_copy() local
172 for (size_t __k = 0; __k < __n; ++__k, ++__j) in __valarray_copy()
173 __a._M_data[*__j] = __e[__k]; in __valarray_copy()
185 size_t* __j (__i._M_data); in __valarray_copy() local
186 for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) in __valarray_copy()
187 __a._M_data[*__j] = __e._M_data[*__g]; in __valarray_copy()
Ddeque.tcc677 for (size_type __j = 1; __j < __i; ++__j) in _M_new_elements_at_front() local
678 _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j)); in _M_new_elements_at_front()
702 for (size_type __j = 1; __j < __i; ++__j) in _M_new_elements_at_back() local
703 _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j)); in _M_new_elements_at_back()
Dstl_tree.h1000 iterator __j = iterator(__y);
1003 if (__j == begin())
1006 --__j;
1008 if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
1010 return pair<iterator, bool>(__j, false);
1400 iterator __j = iterator(__y);
1401 return (__j == end()
1403 _S_key(__j._M_node))) ? end() : __j;
1422 const_iterator __j = const_iterator(__y);
1423 return (__j == end()
[all …]
Dstl_list.h959 iterator __j = __i; in splice() local
960 ++__j; in splice()
961 if (__position == __i || __position == __j) in splice()
967 this->_M_transfer(__position, __i, __j); in splice()
Dstl_algo.h1866 for (_Distance __j = 0; __j < __l / __d; __j++) in __rotate() local
1880 for (_Distance __j = 0; __j < __k / __d - 1; __j ++) in __rotate() local
5020 _BidirectionalIterator __j = __last; in next_permutation() local
5021 while (!(*__i < *--__j)) in next_permutation()
5023 std::iter_swap(__i, __j); in next_permutation()
5077 _BidirectionalIterator __j = __last; in next_permutation() local
5078 while (!__comp(*__i, *--__j)) in next_permutation()
5080 std::iter_swap(__i, __j); in next_permutation()
5131 _BidirectionalIterator __j = __last; in prev_permutation() local
5132 while (!(*--__j < *__i)) in prev_permutation()
[all …]
/NextBSD/contrib/libstdc++/include/tr1/
Drandom.tcc347 for (int __j = 0; __j < __n; ++__j) in seed() local
442 for (int __j = 0; __j < __n; ++__j) in _M_initialize_npows() local
444 _M_npows[__j] = std::tr1::ldexp(_RealType(1), -__w + __j * 32); in _M_initialize_npows()
446 _M_npows[__j] = std::pow(_RealType(2), -__w + __j * 32); in _M_initialize_npows()
474 for (int __j = 0; __j < __n - 1; ++__j) in seed() local
475 _M_x[__i][__j] = __detail::__mod<_UInt32Type, 1, 0, 0>(__gen()); in seed()
481 for (int __j = 0; __j < __n; ++__j) in seed() local
482 if (_M_x[long_lag - 1][__j] != 0) in seed()
502 for (int __j = 0; __j < __n - 1; ++__j) in operator ()() local
504 if (_M_x[__ps][__j] > _M_x[_M_p][__j] in operator ()()
[all …]
Dtuple84 template<int __check_equal_size, int __i, int __j, typename _Tp, typename _Up>
108 template<int __i, int __j, typename _Tp, typename _Up>
109 struct __tuple_compare<0, __i, __j, _Tp, _Up>
114 __tuple_compare<0, __i+1, __j, _Tp, _Up>::__eq(__t, __u);
119 __tuple_compare<0, __i+1, __j, _Tp, _Up>::__less(__t, __u);
/NextBSD/contrib/libc++/include/
D__debug109 const iterator* __j = static_cast<const iterator*>(__i);
111 return _Cp->__dereferenceable(__j);
119 const iterator* __j = static_cast<const iterator*>(__i);
121 return _Cp->__decrementable(__j);
129 const iterator* __j = static_cast<const iterator*>(__i);
131 return _Cp->__addable(__j, __n);
139 const iterator* __j = static_cast<const iterator*>(__i);
141 return _Cp->__subscriptable(__j, __n);
203 bool __less_than_comparable(const void* __i, const void* __j) const;
Dalgorithm1051 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1052 if (__pred(*__first1, *__j))
1286 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1287 if (__pred(*__j, *__i))
1292 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1293 if (__pred(*__i, *__j))
1299 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1300 if (__pred(*__i, *__j))
1349 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1350 if (__pred(*__j, *__i))
[all …]
Dforward_list972 iterator __j = _VSTD::next(__i);
974 for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
975 *__j = *__f;
976 if (__j == __e)
987 iterator __j = _VSTD::next(__i);
989 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
990 *__j = __v;
991 if (__j == __e)
1410 iterator __j = _VSTD::next(__i, 2);
1411 for (; __j != __e && *__j == __v; ++__j)
[all …]
Dvalarray715 result_type operator[](size_t __j) const
717 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
1609 size_t __j = 0;
1610 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1611 __vp_[*__i] = __v[__j];
1625 size_t __j = 0;
1626 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1627 __vp_[*__i] *= __v[__j];
1641 size_t __j = 0;
1642 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
[all …]
Dlist1962 iterator* __j = static_cast<iterator*>((*__p)->__i_);
1963 if (__j->__ptr_ == __f)
2016 iterator* __j = static_cast<iterator*>((*__p)->__i_);
2020 if (__j->__ptr_ == __k)
2043 const_iterator __j = _VSTD::next(__i);
2044 for (; __j != __e && *__j == __x; ++__j)
2046 __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
2047 __i = __j;
2065 iterator __j = _VSTD::next(__i);
2066 for (; __j != __e && __pred(*__j); ++__j)
[all …]
Drandom2374 const size_t __j = (__i_ + 1) % __n;
2377 const result_type _Yp = (__x_[__i_] & ~__mask) | (__x_[__j] & __mask);
2381 __i_ = __j;
2400 size_t __j = _VSTD::min(_Np - __x.__i_, _Np - __y.__i_);
2401 if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j,
2405 return _VSTD::equal(__x.__x_ + __j, __x.__x_ + _Np, __y.__x_);
2406 return _VSTD::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j);
2410 size_t __j = _Np - __y.__i_;
2411 if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j),
2414 if (!_VSTD::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Np,
[all …]
/NextBSD/sys/ofed/drivers/infiniband/ulp/sdp/
HDsdp_proc.c247 unsigned int __j; \
249 for (__j = 0; __j < hist_len; __j++) { \
250 sum[__j] += h[__j]; \
/NextBSD/contrib/libstdc++/include/ext/
Drope248 for (size_t __j = 0; __j < __len; __i++, __j++)
249 _M_buffer[__i] = __s[__j];
2209 insert(size_t __p, const _CharT* __i, const _CharT* __j)
2211 rope __r(__i, __j);
2217 const const_iterator& __j)
2219 rope __r(__i, __j);
2225 const iterator& __j)
2227 rope __r(__i, __j);
2266 const _CharT* __i, const _CharT* __j)
2268 rope __r(__i, __j);
[all …]
/NextBSD/contrib/libstdc++/include/c_std/
Dstd_cstdlib.h146 div(long __i, long __j) { return ldiv(__i, __j); }

12