Home
last modified time | relevance | path

Searched refs:__i (Results 1 – 25 of 57) sorted by relevance

123

/external/kernel-headers/original/uapi/linux/netfilter_bridge/
Debtables.h202 unsigned int __i; \
206 for (__i = sizeof(struct ebt_entry); \
207 __i < (e)->watchers_offset; \
208 __i += __match->match_size + \
210 __match = (void *)(e) + __i; \
217 if (__i != (e)->watchers_offset) \
225 unsigned int __i; \
229 for (__i = e->watchers_offset; \
230 __i < (e)->target_offset; \
231 __i += __watcher->watcher_size + \
[all …]
/external/libcxx/src/
Dvalarray.cpp23 for (size_t __i = 0; __i < __size_.size(); ++__i) in __init() local
24 __k *= __size_[__i]; in __init()
32 size_t __i = __indices.size() - 1; in __init() local
35 if (++__indices[__i] < __size_[__i]) in __init()
38 __1d_[__k] = __1d_[__k-1] + __stride_[__i]; in __init()
39 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init()
45 if (__i == 0) in __init()
47 __indices[__i--] = 0; in __init()
Ddebug.cpp174 __libcpp_db::__find_c_from_i(void* __i) const in __find_c_from_i()
179 __i_node* i = __find_iterator(__i); in __find_c_from_i()
185 __libcpp_db::__insert_ic(void* __i, const void* __c) in __insert_ic() argument
202 __i_node* i = __insert_iterator(__i); in __insert_ic()
250 __libcpp_db::__erase_i(void* __i) in __erase_i() argument
257 size_t hi = hash<void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_); in __erase_i()
262 while (p->__i_ != __i) in __erase_i()
404 __libcpp_db::__iterator_copy(void* __i, const void* __i0) in __iterator_copy() argument
409 __i_node* i = __find_iterator(__i); in __iterator_copy()
413 i = __insert_iterator(__i); in __iterator_copy()
[all …]
/external/libcxx/include/
Dvalarray426 result_type operator[](size_t __i) const {return __op_(__a0_[__i]);}
447 value_type operator[](size_t __i) const {return __op_(__a0_[__i], __a1_[__i]);}
671 result_type operator[](size_t __i) const
672 {return __expr_[__start_ + __i * __stride_];}
718 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
719 ptrdiff_t __m = (__sn_ * __i - __ul_) >> _Np;
720 return (__expr_[(__i + __n_) & __m] & __m) | (value_type() & ~__m);
766 result_type operator[](size_t __i) const
768 if (__i < __m_)
769 return __expr_[__i + __o1_];
[all …]
D__debug105 explicit __libcpp_debug_exception(__libcpp_debug_info const& __i);
135 __i_node(void* __i, __i_node* __next, __c_node* __c)
136 : __i_(__i), __next_(__next), __c_(__c) {}
167 void __add(__i_node* __i);
168 _LIBCPP_HIDDEN void __remove(__i_node* __i);
186 _C_node<_Cont>::__dereferenceable(const void* __i) const
189 const iterator* __j = static_cast<const iterator*>(__i);
196 _C_node<_Cont>::__decrementable(const void* __i) const
199 const iterator* __j = static_cast<const iterator*>(__i);
206 _C_node<_Cont>::__addable(const void* __i, ptrdiff_t __n) const
[all …]
Dbitset239 …for (size_t __i = 0; __i < sizeof(__t)/sizeof(__t[0]); ++__i, __v >>= __bits_per_word, __sz -= __b…
241 __t[__i] = static_cast<__storage_type>(__v) & ( 1ULL << __sz ) - 1;
243 __t[__i] = static_cast<__storage_type>(__v);
290 for (size_type __i = 0; __i < _N_words; ++__i)
291 __first_[__i] &= __v.__first_[__i];
299 for (size_type __i = 0; __i < _N_words; ++__i)
300 __first_[__i] |= __v.__first_[__i];
308 for (size_type __i = 0; __i < _N_words; ++__i)
309 __first_[__i] ^= __v.__first_[__i];
336 const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long) * CHAR_BIT), __e, true);
[all …]
Dalgorithm1221 _ForwardIterator __i = __first;
1222 while (++__i != __last)
1224 if (__pred(*__first, *__i))
1226 __first = __i;
1418 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1420 // Have we already counted the number of *__i in [f1, l1)?
1422 for (; __match != __i; ++__match)
1423 if (__pred(*__match, *__i))
1425 if (__match == __i) {
1426 // Count number of *__i in [f2, l2)
[all …]
Dlist777 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
778 if (__i->__ptr_ == __c.__end_as_link())
790 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
791 if (__i->__ptr_ == __end_as_link())
1036 void splice(const_iterator __p, list&& __c, const_iterator __i)
1037 {splice(__p, __c, __i);}
1042 void splice(const_iterator __p, list& __c, const_iterator __i);
1086 bool __dereferenceable(const const_iterator* __i) const;
1087 bool __decrementable(const const_iterator* __i) const;
1088 bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
[all …]
D__hash_table319 __hash_iterator(const __hash_iterator& __i)
320 : __node_(__i.__node_)
322 __get_db()->__iterator_copy(this, &__i);
332 __hash_iterator& operator=(const __hash_iterator& __i)
334 if (this != &__i)
336 __get_db()->__iterator_copy(this, &__i);
337 __node_ = __i.__node_;
436 __hash_const_iterator(const __hash_const_iterator& __i)
437 : __node_(__i.__node_)
439 __get_db()->__iterator_copy(this, &__i);
[all …]
Distream322 _Ip __i(__is);
324 for (; __i != __eof; ++__i)
325 if (!__ct.is(__ct.space, *__i))
327 if (__i == __eof)
757 typename _Traits::int_type __i = __is.rdbuf()->sgetc();
758 if (_Traits::eq_int_type(__i, _Traits::eof()))
763 _CharT __ch = _Traits::to_char_type(__i);
813 typename _Traits::int_type __i = __is.rdbuf()->sbumpc();
814 if (_Traits::eq_int_type(__i, _Traits::eof()))
817 __c = _Traits::to_char_type(__i);
[all …]
Drandom2314 for (size_t __i = 1; __i < __n; ++__i)
2315 __x_[__i] = (__f * (__x_[__i-1] ^ __rshift<__w - 2>(__x_[__i-1])) + __i) & _Max;
2330 for (size_t __i = 0; __i < __n; ++__i)
2331 __x_[__i] = static_cast<result_type>(__ar[__i] & _Max);
2337 for (size_t __i = 1; __i < __n; ++__i)
2338 if (__x_[__i] != 0)
2355 for (size_t __i = 0; __i < __n; ++__i)
2356 __x_[__i] = static_cast<result_type>(
2357 (__ar[2 * __i] + ((uint64_t)__ar[2 * __i + 1] << 32)) & _Max);
2363 for (size_t __i = 1; __i < __n; ++__i)
[all …]
D__std_stream121 for (int __i = 0; __i < __nread; ++__i)
126 __extbuf[__i] = static_cast<char>(__c);
167 for (int __i = __nread; __i > 0;)
169 if (ungetc(traits_type::to_int_type(__extbuf[--__i]), __file_) == EOF)
319 streamsize __i = 0;
320 for (; __i < __n; ++__i, ++__s)
323 return __i;
Dforward_list799 void splice_after(const_iterator __p, forward_list&& __x, const_iterator __i);
805 void splice_after(const_iterator __p, forward_list& __x, const_iterator __i);
1047 iterator __i = before_begin();
1048 iterator __j = _VSTD::next(__i);
1050 for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
1053 insert_after(__i, __f, __l);
1055 erase_after(__i, __e);
1062 iterator __i = before_begin();
1063 iterator __j = _VSTD::next(__i);
1065 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
[all …]
Ddeque1036 for (typename __map::const_iterator __i = __map_.begin(), __e = __map_.end();
1037 __i != __e; ++__i)
1038 if (*__i == nullptr)
1106 typename __map::iterator __i = __map_.begin();
1108 for (; __i != __e; ++__i)
1109 __alloc_traits::deallocate(__alloc(), *__i, __block_size);
1167 for (iterator __i = begin(), __e = end(); __i != __e; ++__i)
1168 __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
1322 reference operator[](size_type __i);
1324 const_reference operator[](size_type __i) const;
[all …]
Diterator532 void __advance(_InputIter& __i,
536 ++__i;
541 void __advance(_BiDirIter& __i,
546 ++__i;
549 --__i;
554 void __advance(_RandIter& __i,
557 __i += __n;
562 void advance(_InputIter& __i,
565 __advance(__i, __n, typename iterator_traits<_InputIter>::iterator_category());
769 reverse_iterator<_Iter> make_reverse_iterator(_Iter __i)
[all …]
Dstreambuf408 streamsize __i = 0;
409 while(__i < __n)
414 _VSTD::min(__einp_ - __ninp_, __n - __i));
417 __i += __len;
424 ++__i;
429 return __i;
459 streamsize __i = 0;
461 while( __i < __n)
468 ++__i;
472 streamsize __chunk_size = _VSTD::min(__eout_ - __nout_, __n - __i);
[all …]
Dregex1198 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1199 __i != __e; ++__i)
1201 if (static_cast<unsigned>(*__i) >= 127)
1203 __n.push_back(char(*__i));
1251 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1252 __i != __e; ++__i)
1254 if (static_cast<unsigned>(*__i) >= 127)
1256 __n.push_back(char(*__i));
1567 for (size_t __i = __mexp_begin_-1; __i != __mexp_end_-1; ++__i)
1569 __s.__sub_matches_[__i].first = __s.__last_;
[all …]
Dunordered_map657 __hash_map_iterator(_HashIterator __i) _NOEXCEPT : __i_(__i) {}
706 __hash_map_const_iterator(_HashIterator __i) _NOEXCEPT : __i_(__i) {}
709 __hash_map_iterator<typename _HashIterator::__non_const_iterator> __i)
711 : __i_(__i.__i_) {}
1159 bool __dereferenceable(const const_iterator* __i) const
1160 {return __table_.__dereferenceable(&__i->__i_);}
1161 bool __decrementable(const const_iterator* __i) const
1162 {return __table_.__decrementable(&__i->__i_);}
1163 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
1164 {return __table_.__addable(&__i->__i_, __n);}
[all …]
Dmutex400 __lock_first(int __i, _L0& __l0, _L1& __l1, _L2& __l2, _L3& ...__l3)
404 switch (__i)
409 __i = try_lock(__l1, __l2, __l3...);
410 if (__i == -1)
416 ++__i;
422 __i = try_lock(__l2, __l3..., __l0);
423 if (__i == -1)
429 if (__i == sizeof...(_L3) + 1)
430 __i = 0;
432 __i += 2;
[all …]
/external/iptables/include/linux/netfilter/
Dx_tables.h129 unsigned int __i; \
133 for (__i = sizeof(type); \
134 __i < (e)->target_offset; \
135 __i += __m->u.match_size) { \
136 __m = (void *)e + __i; \
148 unsigned int __i, __n; \
152 for (__i = 0, __n = 0; __i < (size); \
153 __i += __entry->next_offset, __n++) { \
154 __entry = (void *)(entries) + __i; \
/external/kernel-headers/original/uapi/linux/netfilter/
Dx_tables.h131 unsigned int __i; \
135 for (__i = sizeof(type); \
136 __i < (e)->target_offset; \
137 __i += __m->u.match_size) { \
138 __m = (void *)e + __i; \
150 unsigned int __i, __n; \
154 for (__i = 0, __n = 0; __i < (size); \
155 __i += __entry->next_offset, __n++) { \
156 __entry = (void *)(entries) + __i; \
/external/iproute2/include/uapi/linux/netfilter/
Dx_tables.h130 unsigned int __i; \
134 for (__i = sizeof(type); \
135 __i < (e)->target_offset; \
136 __i += __m->u.match_size) { \
137 __m = (void *)e + __i; \
149 unsigned int __i, __n; \
153 for (__i = 0, __n = 0; __i < (size); \
154 __i += __entry->next_offset, __n++) { \
155 __entry = (void *)(entries) + __i; \
/external/autotest/client/tests/tsc/src/
Dsched.h28 unsigned int __i; \
30 for (__i = 0; __i < sizeof (cpu_set_t) / sizeof (__cpu_mask); ++__i) \
31 __arr->__bits[__i] = 0; \
/external/libcxx/include/experimental/
Dfunctional233 for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
234 __skip_->insert(*__f, __i);
309 for ( std::size_t __i = 1; __i < __count; ++__i )
311 while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
314 if ( __pred ( __f[__k], __f[__i] ))
316 __prefix [ __i ] = __k;
330 for ( std::size_t __i = 0; __i <= __count; __i++ )
331 __suffix[__i] = __count - __scratch[__count-1];
336 for ( std::size_t __i = 0; __i < __count; __i++ )
338 const std::size_t __j = __count - __scratch[__i];
[all …]
/external/mesa3d/src/util/
Dbitset.h131 #define BITSET_FOREACH_SET(__i, __tmp, __set, __size) \ argument
132 for (__tmp = *(__set), __i = 0; \
133 (__i = __bitset_next_set(__i, &__tmp, __set, __size)) < __size;)

123