Searched refs:__i (Results 1 - 25 of 65) sorted by relevance

123

/external/chromium_org/v8/test/webkit/
H A Ddfg-inline-arguments-use-directly-from-inlined-code.js46 for (var __i = 0; __i < 200; ++__i)
47 shouldBe("argsToStr(bar(\"a\" + __i, \"b\" + __i, \"c\" + __i))", "\"[object Arguments]: a" + __i + ", b" + __i + ", c" + __i + "\"");
H A Ddfg-inline-arguments-use-from-getter.js49 for (var __i = 0; __i < 200; ++__i)
50 shouldBe("argsToStr(bar(o, \"b\" + __i, \"c\" + __i))", "\"[object Arguments]: [object Object], b" + __i + ", c" + __i + "\"");
H A Ddfg-inline-arguments-use-from-uninlined-code.js51 for (var __i = 0; __i < 200; ++__i)
52 shouldBe("\"\" + baz(\"a\" + __i, \"b\" + (__i + 1), \"c\" + (__i + 2))",
53 "\"a" + __i + ",b" + (__i + 1) + ",c" + (__i + 2) + ",a" + __i
[all...]
H A Ddfg-inline-arguments-int32.js50 for (var __i = 0; __i < 200; ++__i)
51 shouldBe("argsToStr(baz(__i + 1, __i + 2, __i + 3))", "\"[object Arguments]: " + (__i + 1) + ", " + (__i + 2) + ", " + (__i + 3) + "\"");
H A Ddfg-inline-arguments-reset-changetype.js51 for (var __i = 0; __i < 200; ++__i)
52 shouldBe("argsToStr(baz(\"a\" + __i, __i + 2, \"c\" + __i))", "\"[object Arguments]: a" + __i + ", a" + __i + ", c" + __i + "\"");
H A Ddfg-inline-arguments-reset.js51 for (var __i = 0; __i < 200; ++__i)
52 shouldBe("argsToStr(baz(\"a\" + __i, \"b\" + __i, \"c\" + __i))", "\"[object Arguments]: a" + __i + ", a" + __i + ", c" + __i + "\"");
H A Ddfg-inline-arguments-simple.js50 for (var __i = 0; __i < 200; ++__i)
51 shouldBe("argsToStr(baz(\"a\" + __i, \"b\" + __i, \"c\" + __i))", "\"[object Arguments]: a" + __i + ", b" + __i + ", c" + __i + "\"");
H A Ddfg-inline-arguments-become-double.js51 for (var __i = 0; __i < 200; ++__i)
52 shouldBe("argsToStr(baz(\"a\" + __i, \"b\" + __i, \"c\" + __i))", "\"[object Arguments]: a" + __i + ", 42.5, c" + __i + "\"");
H A Ddfg-inline-arguments-become-int32.js51 for (var __i = 0; __i < 200; ++__i)
52 shouldBe("argsToStr(baz(\"a\" + __i, \"b\" + __i, \"c\" + __i))", "\"[object Arguments]: a" + __i + ", 42, c" + __i + "\"");
H A Ddfg-inline-arguments-use-from-all-the-places.js59 for (var __i = 0; __i < 200; ++__i) {
60 var text1 = "[[object Arguments]: [object Object], b" + __i + ", c" + __i + "]";
63 shouldBe("argsToStr(bar(o, \"b\" + __i, \"c\" + __i))", "\"[[object Arguments],[object Arguments],[object Arguments],[object Arguments],[object Arguments],[object Arguments],[object Arguments],[object Arguments],[object Arguments],[object Arguments]: " + text1 + ", " + text1 + ", " + text1 + ", " + text1 + ", " + text1 + ", " + text2 + ", " + text1 + ", " + text1 + ", " + text2 + ", " + text3 + "]\"");
H A Ddfg-inline-arguments-use-from-all-the-places-broken.js59 for (var __i = 0; __i < 200; ++__i)
60 shouldThrow("argsToStr(bar(\"a\" + __i, \"b\" + __i, \"c\" + __i))");
/external/stlport/stlport/stl/
H A D_valarray.h181 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.h38 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.c38 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.c124 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.c81 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 Dconcept_checks.h407 __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.c96 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.h38 for ( size_t __i = 0; __i < __len; ++__i)
39 __h = /* 5 *__h */(__h << 2) + __h + __data[__i];
H A Dchar_traits.h147 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...]
/external/libcxx/src/
H A Dvalarray.cpp25 for (size_t __i = 0; __i < __size_.size(); ++__i)
26 __k *= __size_[__i];
34 size_t __i = __indices.size() - 1; local
37 if (++__indices[__i] < __size_[__i])
40 __1d_[__k] = __1d_[__k-1] + __stride_[__i];
41 for (size_t __j = __i + 1; __j != __indices.size(); ++__j)
47 if (__i
[all...]
/external/kernel-headers/original/uapi/linux/netfilter_bridge/
H A Debtables.h201 unsigned int __i; \
205 for (__i = sizeof(struct ebt_entry); \
206 __i < (e)->watchers_offset; \
207 __i += __match->match_size + \
209 __match = (void *)(e) + __i; \
216 if (__i != (e)->watchers_offset) \
224 unsigned int __i; \
228 for (__i = e->watchers_offset; \
229 __i < (e)->target_offset; \
230 __i
[all...]
/external/iproute2/include/linux/netfilter/
H A 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; \
[all...]
/external/iptables/include/linux/netfilter/
H A 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; \
[all...]
/external/kernel-headers/original/uapi/linux/netfilter/
H A 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; \
[all...]

Completed in 238 milliseconds

123