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

12

/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20011008-3.c68 int __j; local
71 for (__j = 0; __j < elp->u.l.ntxns - 1; __j++)
72 if (log_compare(&elp->u.l.lsn_array[__j], &elp->u.l.lsn_array[__j + 1]) < 0)
74 __tmp = elp->u.l.lsn_array[__j];
75 elp->u.l.lsn_array[__j] = elp->u.l.lsn_array[__j + 1];
76 elp->u.l.lsn_array[__j
[all...]
/haiku-buildtools/gcc/libstdc++-v3/config/locale/gnu/
H A Dnumeric_members.cc58 for (size_t __j = 0; __j < __num_base::_S_iend; ++__j)
59 _M_data->_M_atoms_in[__j] = __num_base::_S_atoms_in[__j];
146 for (size_t __j = 0; __j < __num_base::_S_iend; ++__j)
147 _M_data->_M_atoms_in[__j] =
148 static_cast<wchar_t>(__num_base::_S_atoms_in[__j]);
[all...]
H A Dctype_members.cc290 for (size_t __j = 0;
291 __j < sizeof(_M_widen) / sizeof(wint_t); ++__j)
292 _M_widen[__j] = btowc(__j);
/haiku-buildtools/legacy/gcc/libstdc++/
H A Dvalarray.cc30 for (size_t __j=0; __j<__z; ++__j) {
32 __i[__j] += __s[__k]*__t[__k];
/haiku-buildtools/gcc/libstdc++-v3/src/c++98/
H A Dvalarray.cc79 for (size_t __j = 0; __j < __z; ++__j)
82 __i[__j] = __o;
H A Dlocale_facets.cc115 for (size_t __j = 0; __j < __min && __test; --__i, ++__j)
116 __test = __grouping_tmp[__i] == __grouping[__j];
H A Dlocale.cc266 for (size_t __j = 0; __j < _M_facets_size; ++__j)
268 _M_caches[__j] = __imp._M_caches[__j];
269 if (_M_caches[__j])
270 _M_caches[__j]->_M_add_reference();
346 for (size_t __j = 0; __j < _M_facets_size; ++__j)
[all...]
H A Dlocalename.cc96 for (size_t __j = 0; __j < __i; ++__j)
98 __str += _S_categories[__j];
H A Dmt_allocator.cc194 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
195 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
491 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
492 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
686 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
687 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
/haiku-buildtools/legacy/gcc/libstdc++/std/
H A Dvalarray_array.h62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; }
91 { for (size_t __j=0; __j<__n; ++__j, ++__b, ++__i) *__b = __a[*__i]; }
98 { for (size_t __j=0; __j<__n; ++__j, ++__a, ++__i) __b[*__i] = *__a; }
250 for (size_t* __j
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dsearch.h60 for (_DifferenceType __j = 2; __j <= __length; __j++)
62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1]))
64 __off[__j] = ++__k;
H A Dmultiseq_selection.h217 _SeqNumber __j;
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;
[all...]
H A Drandom_shuffle.h374 int __j = __pus[__i]._M_bins_begin = __bin_cursor; local
381 for (; __j < __bin_cursor; ++__j)
382 __sd._M_bin_proc[__j] = __i;
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dsse4_2-pcmpstr.h14 int __i, __j; \
16 for (__j = 0; __j < __size; __j++) \
17 RES[__j][__i] = (X[__i] == Y[__j]); \
23 int __i, __j; \
24 for (__j = 0; __j < __size; __j
[all...]
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dbitset279 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
283 return __i*__BITS_PER_WORDT(_WordT) + __j*CHAR_BIT +
317 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) {
321 return __i*__BITS_PER_WORDT(_WordT) + __j*CHAR_BIT +
334 for ( size_t __j = 0; __j < sizeo
[all...]
H A Dstl_rope.h162 size_t __j = 0; local
163 for (; __j < __len; __i++, __j++) {
164 _M_buffer[__i] = __s[__j];
2012 void insert(size_t __p, const _CharT* __i, const _CharT* __j) { argument
2013 rope __r(__i, __j);
2018 const const_iterator& __j) {
2019 rope __r(__i, __j);
2024 const iterator& __j) {
2025 rope __r(__i, __j);
2017 insert(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
2023 insert(size_t __p, const iterator& __i, const iterator& __j) argument
2054 replace(size_t __p, size_t __n, const _CharT* __i, const _CharT* __j) argument
2060 replace(size_t __p, size_t __n, const const_iterator& __i, const const_iterator& __j) argument
2066 replace(size_t __p, size_t __n, const iterator& __i, const iterator& __j) argument
2090 replace(size_t __p, const _CharT* __i, const _CharT* __j) argument
2094 replace(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
2099 replace(size_t __p, const iterator& __i, const iterator& __j) argument
2129 insert(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
2132 insert(const iterator& __p, const const_iterator& __i, const const_iterator& __j) argument
2135 insert(const iterator& __p, const iterator& __i, const iterator& __j) argument
2151 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument
2154 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument
2157 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument
2170 replace(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
2172 replace(const iterator& __p, const_iterator __i, const_iterator __j) argument
2175 replace(const iterator& __p, iterator __i, iterator __j) argument
[all...]
H A Dstl_tree.h887 iterator __j = iterator(__y); local
889 if (__j == begin())
892 --__j;
893 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
895 return pair<iterator,bool>(__j, false);
1126 iterator __j = iterator(__y); local
1127 return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ?
1128 end() : __j;
1145 const_iterator __j local
[all...]
H A Dstl_algo.h788 for (_Distance __j = 0; __j < __l/__d; __j++) {
800 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
2543 _BidirectionalIter __j = __last; local
2544 while (!(*__i < *--__j))
2546 iter_swap(__i, __j);
2573 _BidirectionalIter __j local
2602 _BidirectionalIter __j = __last; local
2632 _BidirectionalIter __j = __last; local
[all...]
H A Dstl_deque.h1588 for (size_type __j = 1; __j < __i; ++__j)
1589 _M_deallocate_node(*(_M_start._M_node - __j));
1609 for (size_type __j = 1; __j < __i; ++__j)
1610 _M_deallocate_node(*(_M_finish._M_node + __j));
H A Dstl_list.h489 iterator __j = __i; local
490 ++__j;
491 if (__position == __i || __position == __j) return;
492 transfer(__position, __i, __j);
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dvalarray_array.h239 for (size_t __j = 0; __j < __n; ++__j, ++__i)
311 for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i)
321 for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i)
326 // another indexed array __dst[<__j>]
329 __valarray_copy(const _Tp* __restrict__ __src, size_t __n, const size_t* __restrict__ __i, _Tp* __restrict__ __dst, const size_t* __restrict__ __j) argument
493 __valarray_copy(_Array<_Tp> __src, size_t __n, _Array<size_t> __i, _Array<_Tp> __dst, _Array<size_t> __j) argument
[all...]
H A Dstl_tree.h1154 auto __j = _S_lower_bound_tr(__cmp, _M_begin(), _M_end(), __k);
1155 return (__j == end() || __cmp(__k, _S_key(__j._M_node)))
1156 ? end() : __j;
1165 auto __j = _S_lower_bound_tr(__cmp, _M_begin(), _M_end(), __k);
1166 return (__j == end() || __cmp(__k, _S_key(__j._M_node)))
1167 ? end() : __j;
1813 iterator __j = iterator(__y);
1816 if (__j
[all...]
H A Dboost_concept_check.h432 *__i = *__j; // require dereference and assignment
434 _Tp __i, __j;
538 __n = __i - __j; // require difference operator
542 _Tp __i, __j;
H A Dstl_list.h1436 iterator __j = __i._M_const_cast();
1437 ++__j;
1438 if (__position == __i || __position == __j)
1445 __i._M_const_cast(), __j);
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/
H A Dpr47333.C881 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
882 return (__j == end()
884 _S_key(__j._M_node))) ? end() : __j;

Completed in 205 milliseconds

12