/external/stlport/stlport/stl/ |
H A D | _valarray.h | 181 for (size_t __i = 0; __i < this->size(); ++__i) 182 __tmp[__i] = -(*this)[__i]; 188 for (size_t __i = 0; __i < this->size(); ++__i) 189 __tmp[__i] = ~(*this)[__i]; [all...] |
H A D | _carray.h | 38 for (size_t __i = 0; __i < _Nb; ++__i) { 39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val); 48 _Tp& operator [] (size_t __i) { argument 49 _STLP_ASSERT(__i < _Nb) 50 return *__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp));
|
H A D | _valarray.c | 38 for (size_t __i = 0; __i < this->size(); ++__i) 39 __tmp[__i] = !(*this)[__i]; 48 for (size_t __i = 0; 49 __i < __x._M_slice.size(); 50 ++__i, __index += __x._M_slice.stride()) 51 (*this)[__i] = __x._M_array[__index]; 59 for (size_t __i [all...] |
H A D | _threads.c | 124 unsigned __i; local 126 for (__i = 0; __i < __my_spin_max; ++__i) { 127 if (__i < __my_last_spins/2 || *__lock) { 136 _STLP_mutex_spin<0>::__last = __i; 146 for (__i = 0 ;; ++__i) { 147 int __log_nsec = __i + 6; 153 _S_nsec_sleep(__log_nsec, __i); [all...] |
H A D | _bitset.c | 81 for (size_t __i = 1; __i < _Nw; ++__i) 82 if (_M_w[__i]) 89 for ( size_t __i = 0; __i < _Nw; __i++ ) { 90 _WordT __thisword = _M_w[__i]; 97 return __i*__BITS_PER_WORD + __j*CHAR_BIT + 120 size_t __i [all...] |
H A D | concept_checks.h | 407 __dereference_operator_requirement_violation(_Iterator __i) { argument 408 __sink_unused_warning(*__i); 412 __dereference_operator_and_assignment_requirement_violation(_Iterator __i) { argument 413 *__i = *__i; 417 __preincrement_operator_requirement_violation(_Iterator __i) { argument 418 ++__i; 422 __postincrement_operator_requirement_violation(_Iterator __i) { argument 423 __i++; 427 __predecrement_operator_requirement_violation(_Iterator __i) { argument 432 __postdecrement_operator_requirement_violation(_Iterator __i) argument 437 __postincrement_operator_and_assignment_requirement_violation(_Iterator __i, _Type __t) argument 443 __iterator_addition_assignment_requirement_violation(_Iterator __i, _Distance __n) argument 450 __iterator_addition_requirement_violation(_Iterator __i, _Distance __n) argument 457 __iterator_subtraction_assignment_requirement_violation(_Iterator __i, _Distance __n) argument 464 __iterator_subtraction_requirement_violation(_Iterator __i, _Distance __n) argument 470 __difference_operator_requirement_violation(_Iterator __i, _Iterator __j, _Distance __n) argument 569 _TrivialIterator_requirement_violation(_TrivialIterator __i) argument 590 _Mutable_TrivialIterator_requirement_violation(_TrivialIterator __i) argument 603 _InputIterator_requirement_violation(_InputIterator __i) argument 623 _OutputIterator_requirement_violation(_OutputIterator __i) argument 643 _ForwardIterator_requirement_violation(_ForwardIterator __i) argument 653 _Mutable_ForwardIterator_requirement_violation(_ForwardIterator __i) argument 667 _BidirectionalIterator_requirement_violation(_BidirectionalIterator __i) argument 680 _Mutable_BidirectionalIterator_requirement_violation( _BidirectionalIterator __i) argument 704 _RandomAccessIterator_requirement_violation(_RandAccIter __i) argument 743 _Mutable_RandomAccessIterator_requirement_violation(_RandAccIter __i) argument [all...] |
H A D | _list.c | 96 iterator __i = begin(); local 98 for ( ; __i != end() && __len < __new_size; ++__i, ++__len); 101 erase(__i, end()); 102 else // __i == end() 125 iterator __i = begin(); local 126 for ( ; __i != end() && __n > 0; ++__i, --__n) 127 *__i = __val; 131 erase(__i, en 218 int __i = 0; local [all...] |
H A D | _string_hash.h | 38 for ( size_t __i = 0; __i < __len; ++__i) 39 __h = /* 5 *__h */(__h << 2) + __h + __data[__i];
|
H A D | char_traits.h | 147 for (size_t __i = 0; __i < __n; ++__i) 148 if (!eq(__s1[__i], __s2[__i])) 149 return __s1[__i] < __s2[__i] ? -1 : 1; 155 size_t __i(0); 156 for (; !eq(__s[__i], _NullChar); ++__i) {} [all...] |
H A D | _bitset.h | 139 for ( size_t __i = 0; __i < _Nw; __i++ ) { 140 _M_w[__i] &= __x._M_w[__i]; 145 for ( size_t __i = 0; __i < _Nw; __i++ ) { 146 _M_w[__i] |= __x._M_w[__i]; [all...] |
H A D | _slist.c | 194 int __i = 0; local 195 while (__i < __fill && !__counter[__i].empty()) { 196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp); 197 __carry.swap(__counter[__i]); 198 ++__i; 200 __carry.swap(__counter[__i]); 201 if (__i == __fill) { 210 for (int __i = 1; __i < __fil [all...] |
H A D | _rope.c | 192 int __i = -1; local 197 __x._M_path_end._M_data[++__i] = __path[__j++]; 199 __x._M_leaf_index = __i; 252 int __i; local 253 for (__i = 0; __i < _S_path_cache_len-1; ++__i) { 254 __x._M_path_end._M_data[__i] = __x._M_path_end._M_data[__i+1]; 744 size_t __i; local 777 size_t __i; local 1031 int __i; local 1083 int __i; // forest[0..__i-1] is empty local 1123 _S_fetch(_RopeRep* __r, size_type __i) argument 1170 _S_fetch_ptr(_RopeRep* __r, size_type __i) argument [all...] |
H A D | _time_facets.c | 81 difference_type __i, __start = 0; local 91 for (__i = __start; __i < __n; ++__i) { 92 if (!__do_not_check[__i]) { 93 if (*__first == __name[__i][__pos]) { 94 if (__pos == (__name[__i].size() - 1)) { 95 __matching_name_index = __i; 96 __do_not_check[__i] = true; 97 if (__i [all...] |
H A D | _complex.h | 124 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local 126 _M_im = __i; 132 value_type __i; local 133 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i); 135 _M_im = __i; 154 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local 156 _M_im = __i; 162 value_type __i; local 163 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i); 165 _M_im = __i; 259 float __i = _M_re * __z._M_im + _M_im * __z._M_re; local 268 float __i; local 297 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local 305 value_type __i; local 397 double __i = _M_re * __z._M_im + _M_im * __z._M_re; local 406 double __i; local 435 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local 443 value_type __i; local 537 long double __i = _M_re * __z._M_im + _M_im * __z._M_re; local 546 long double __i; local 575 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local 583 value_type __i; local [all...] |
H A D | _bvector.h | 131 void _M_advance (difference_type __i) { argument 132 difference_type __n = __i + _M_offset; 208 _Self& operator+=(difference_type __i) { argument 209 _M_advance(__i); 212 _Self& operator-=(difference_type __i) { argument 213 *this += -__i; 216 _Self operator+(difference_type __i) const { 218 return __tmp += __i; 220 _Self operator-(difference_type __i) const { 222 return __tmp -= __i; 227 operator [](difference_type __i) argument 406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local 459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local 732 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local 753 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local 774 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local [all...] |
/external/webkit/WebKit/qt/tests/ |
H A D | util.h | 60 for (int __i = 0; __i < __timeout && !(__expr); __i+=__step) { \ 74 for (int __i = 0; __i < __timeout && ((__expr) != (__expected)); __i+=__step) { \
|
/external/iproute2/include/linux/netfilter/ |
H A D | x_tables.h | 134 unsigned int __i; \ 138 for (__i = sizeof(type); \ 139 __i < (e)->target_offset; \ 140 __i += __m->u.match_size) { \ 141 __m = (void *)e + __i; \ 153 unsigned int __i, __n; \ 157 for (__i = 0, __n = 0; __i < (size); \ 158 __i += __entry->next_offset, __n++) { \ 159 __entry = (void *)(entries) + __i; \ [all...] |
/external/kernel-headers/original/linux/netfilter_ipv6/ |
H A D | ip6_tables.h | 244 unsigned int __i; \ 248 for (__i = sizeof(struct ip6t_entry); \ 249 __i < (e)->target_offset; \ 250 __i += __m->u.match_size) { \ 251 __m = (void *)(e) + __i; \ 263 unsigned int __i; \ 267 for (__i = 0; __i < (size); __i += __e->next_offset) { \ 268 __e = (void *)(entries) + __i; \ [all...] |
/external/kernel-headers/original/linux/netfilter/ |
H A D | nfnetlink.h | 155 ({ int __i, __res = 0; \ 156 for (__i=0; __i<max; __i++) { \ 157 if (!cta_min[__i]) \ 159 if (tb[__i] && NFA_PAYLOAD(tb[__i]) < cta_min[__i]){ \
|
/external/kernel-headers/original/asm-generic/ |
H A D | percpu.h | 24 unsigned int __i; \ 25 for_each_possible_cpu(__i) \ 26 memcpy((pcpudst)+__per_cpu_offset[__i], \
|
/external/kernel-headers/original/linux/netfilter_ipv4/ |
H A D | ip_tables.h | 231 unsigned int __i; \ 235 for (__i = sizeof(struct ipt_entry); \ 236 __i < (e)->target_offset; \ 237 __i += __match->u.match_size) { \ 238 __match = (void *)(e) + __i; \ 250 unsigned int __i; \ 254 for (__i = 0; __i < (size); __i += __entry->next_offset) { \ 255 __entry = (void *)(entries) + __i; \ [all...] |
/external/kernel-headers/original/asm-x86/ |
H A D | atomic_32.h | 182 int __i; local 189 __i = i; 194 return i + __i; 199 __i = atomic_read(v); 200 atomic_set(v, i + __i); 202 return i + __i;
|
H A D | local_32.h | 135 long __i; local 142 __i = i; 147 return i + __i; 152 __i = local_read(l); 153 local_set(l, i + __i); 155 return i + __i;
|
H A D | percpu_32.h | 80 unsigned int __i; \ 81 for_each_possible_cpu(__i) \ 82 memcpy((pcpudst)+__per_cpu_offset[__i], \
|
/external/kernel-headers/original/linux/netfilter_arp/ |
H A D | arp_tables.h | 220 unsigned int __i; \ 224 for (__i = 0; __i < (size); __i += __entry->next_offset) { \ 225 __entry = (void *)(entries) + __i; \
|