Search

Home

Sort by

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

/external/libcxx/src/
H A D	valarray.cpp	`41 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) 42 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);`
H A D	debug.cpp	`381 __libcpp_db::__less_than_comparable(const void* __i, const void* __j) const 385 __i_node* j = __find_iterator(__j);`
/external/stlport/stlport/stl/
H A D	_bitset.c	`93 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) { 97 return __i__BITS_PER_WORD + __jCHAR_BIT + 130 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); ++__j ) { 134 return __i__BITS_PER_WORD + __jCHAR_BIT + 147 for ( size_t __j = 0; __j < sizeo [all...]`
H A D	_rope.h	259 size_t __j = 0; local 260 for (; __j < __len; __i++, __j++) { 261 _M_buffer[__i] = __s[__j]; 1768 void insert(size_t __p, const _CharT* __i, const _CharT* __j) { argument 1769 _Self __r(__i, __j); 1774 const const_iterator& __j) { 1775 _Self __r(__i, __j); 1780 const iterator& __j) { 1781 _Self __r(__i, __j); 1773 insert(size_t __p, const const_iterator& __i, const const_iterator& __j) argument 1779 insert(size_t __p, const iterator& __i, const iterator& __j) argument 1807 replace(size_t __p, size_t __n, const _CharT* __i, const _CharT* __j) argument 1813 replace(size_t __p, size_t __n, const const_iterator& __i, const const_iterator& __j) argument 1819 replace(size_t __p, size_t __n, const iterator& __i, const iterator& __j) argument 1844 replace(size_t __p, const _CharT* __i, const _CharT* __j) argument 1848 replace(size_t __p, const const_iterator& __i, const const_iterator& __j) argument 1853 replace(size_t __p, const iterator& __i, const iterator& __j) argument 1882 insert(const iterator& __p, const _CharT* __i, const _CharT* __j) argument 1885 insert(const iterator& __p, const const_iterator& __i, const const_iterator& __j) argument 1888 insert(const iterator& __p, const iterator& __i, const iterator& __j) argument 1904 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument 1907 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument 1910 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument 1923 replace(const iterator& __p, const _CharT* __i, const _CharT* __j) argument 1925 replace(const iterator& __p, const_iterator __i, const_iterator __j) argument 1928 replace(const iterator& __p, iterator __i, iterator __j) argument [all...]
H A D	_bitset.h	`281 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) { 285 return __jCHAR_BIT + _Bs_G::_S_first_one(__this_byte); 314 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) { 318 return __jCHAR_BIT + _Bs_G::_S_first_one(__this_byte); 391 // for b[i] = b[__j]; 392 reference& operator=(const reference& __j) { argument [all...]`
H A D	_deque.c	`754 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j) 755 this->_M_map_size.deallocate((this->_M_start._M_node - __j), this->buffer_size())) 768 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j) 769 this->_M_map_size.deallocate((this->_M_finish._M_node + __j), this->buffer_size()))`
H A D	_tree.c	`414 iterator __j = iterator(__y); local 416 if (__j == begin()) 419 --__j; 421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) { 424 return pair<iterator,bool>(__j, false);`
H A D	_algo.c	`468 for (_Distance __j = 0; __j < __l/__d; __j++) { 480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) { 1877 _BidirectionalIter __j = __last; local 1878 while (!__comp(__i, --__j)) {} 1879 iter_swap(__i, __j); 1928 _BidirectionalIter __j local [all...]`
H A D	_list.h	`611 iterator __j = __i; local 612 ++__j; 613 if (__pos == __i \|\| __pos == __j) return; 615 _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __i._M_node, __j._M_node);`
H A D	_rope.c	`193 int __j = __curr_depth + 1 - _S_path_cache_len; local 195 if (__j < 0) __j = 0; 196 while (__j <= __curr_depth) { 197 __x._M_path_end._M_data[++__i] = __path[__j++];`
H A D	concept_checks.h	`470 __difference_operator_requirement_violation(_Iterator __i, _Iterator __j, argument 472 __n = __i - __j;`
/external/qemu/hw/intc/
H A D	apic.c	`194 int __i, __j, __mask;\ 198 for(__j = 0; __j < 32; __j++) {\ 199 if (__mask & (1 << __j)) {\ 200 apic = local_apics[__i * 32 + __j];\`

Completed in 187 milliseconds