Home
last modified time | relevance | path

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

123

/external/u-boot/drivers/net/
Dsmc91111.h105 #define SMC_outsl(a,r,b,l) ({ int __i; \
108 for (__i = 0; __i < l; __i++) { \
109 SMC_outl((a), *(__b2 + __i), r); \
113 #define SMC_outsw(a,r,b,l) ({ int __i; \
116 for (__i = 0; __i < l; __i++) { \
117 SMC_outw((a), *(__b2 + __i), r); \
121 #define SMC_insl(a,r,b,l) ({ int __i ; \
124 for (__i = 0; __i < l; __i++) { \
125 *(__b2 + __i) = SMC_inl((a),(r)); \
130 #define SMC_insw(a,r,b,l) ({ int __i ; \
[all …]
Dlan91c96.h82 #define SMC_outsl(edev, r, b, l) ({ int __i; \
85 for (__i = 0; __i < l; __i++) { \
86 SMC_outl(edev, *(__b2 + __i),\
91 #define SMC_outsw(edev, r, b, l) ({ int __i; \
94 for (__i = 0; __i < l; __i++) { \
95 SMC_outw(edev, *(__b2 + __i),\
100 #define SMC_insl(edev, r, b, l) ({ int __i ; \
103 for (__i = 0; __i < l; __i++) { \
104 *(__b2 + __i) = SMC_inl(edev,\
110 #define SMC_insw(edev, r, b, l) ({ int __i ; \
[all …]
/external/kernel-headers/original/uapi/linux/netfilter_bridge/
Debtables.h218 unsigned int __i; \
222 for (__i = sizeof(struct ebt_entry); \
223 __i < (e)->watchers_offset; \
224 __i += __match->match_size + \
226 __match = (void *)(e) + __i; \
233 if (__i != (e)->watchers_offset) \
241 unsigned int __i; \
245 for (__i = e->watchers_offset; \
246 __i < (e)->target_offset; \
247 __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 …]
Dalgorithm1113 _ForwardIterator __i = __first;
1114 while (++__i != __last)
1116 if (__pred(*__first, *__i))
1118 __first = __i;
1310 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1312 // Have we already counted the number of *__i in [f1, l1)?
1314 for (; __match != __i; ++__match)
1315 if (__pred(*__match, *__i))
1317 if (__match == __i) {
1318 // Count number of *__i in [f2, l2)
[all …]
Dlist806 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
807 if (__i->__ptr_ == __c.__end_as_link())
819 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
820 if (__i->__ptr_ == __end_as_link())
1065 void splice(const_iterator __p, list&& __c, const_iterator __i)
1066 {splice(__p, __c, __i);}
1071 void splice(const_iterator __p, list& __c, const_iterator __i);
1115 bool __dereferenceable(const const_iterator* __i) const;
1116 bool __decrementable(const const_iterator* __i) const;
1117 bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
[all …]
D__hash_table304 __hash_iterator(const __hash_iterator& __i)
305 : __node_(__i.__node_)
307 __get_db()->__iterator_copy(this, &__i);
317 __hash_iterator& operator=(const __hash_iterator& __i)
319 if (this != &__i)
321 __get_db()->__iterator_copy(this, &__i);
322 __node_ = __i.__node_;
421 __hash_const_iterator(const __hash_const_iterator& __i)
422 : __node_(__i.__node_)
424 __get_db()->__iterator_copy(this, &__i);
[all …]
Distream323 _Ip __i(__is);
325 for (; __i != __eof; ++__i)
326 if (!__ct.is(__ct.space, *__i))
328 if (__i == __eof)
537 typename _Traits::int_type __i = __is.rdbuf()->sgetc();
538 if (_Traits::eq_int_type(__i, _Traits::eof()))
543 _CharT __ch = _Traits::to_char_type(__i);
636 typename _Traits::int_type __i = __is.rdbuf()->sbumpc();
637 if (_Traits::eq_int_type(__i, _Traits::eof()))
640 __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_list816 void splice_after(const_iterator __p, forward_list&& __x, const_iterator __i);
822 void splice_after(const_iterator __p, forward_list& __x, const_iterator __i);
1078 iterator __i = before_begin();
1079 iterator __j = _VSTD::next(__i);
1081 for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
1084 insert_after(__i, __f, __l);
1086 erase_after(__i, __e);
1093 iterator __i = before_begin();
1094 iterator __j = _VSTD::next(__i);
1096 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
[all …]
Ddeque1048 for (typename __map::const_iterator __i = __map_.begin(), __e = __map_.end();
1049 __i != __e; ++__i)
1050 if (*__i == nullptr)
1118 typename __map::iterator __i = __map_.begin();
1120 for (; __i != __e; ++__i)
1121 __alloc_traits::deallocate(__alloc(), *__i, __block_size);
1179 for (iterator __i = begin(), __e = end(); __i != __e; ++__i)
1180 __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
1334 reference operator[](size_type __i);
1336 const_reference operator[](size_type __i) const;
[all …]
/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/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/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/u-boot/include/
Dusbdevice.h86 #define mmio_insw(r,b,l) ({ int __i ; \
89 for (__i = 0; __i < l; __i++) { \
90 *(__b2 + __i) = inw(r); \
96 #define mmio_outsw(r,b,l) ({ int __i; \
99 for (__i = 0; __i < l; __i++) { \
100 outw( *(__b2 + __i), r); \
106 #define mmio_insb(r,b,l) ({ int __i ; \
109 for (__i = 0; __i < l; __i++) { \
110 *(__b2 + __i) = inb(r); \
/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/u-boot/arch/mips/include/asm/
Dposix_types.h87 int __i; in __FD_ZERO() local
115 __i = __FDSET_LONGS; in __FD_ZERO()
116 while (__i) { in __FD_ZERO()
117 __i--; in __FD_ZERO()
/external/u-boot/arch/sh/include/asm/
Dposix_types.h85 int __i; in __FD_ZERO() local
113 __i = __FDSET_LONGS; in __FD_ZERO()
114 while (__i) { in __FD_ZERO()
115 __i--; in __FD_ZERO()
/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