| /external/stlport/test/unit/ |
| H A D | iter_test.cpp | 132 vector<bool>::iterator i2 = boolVector.begin(); local
133 ++i2;
136 bool v1 = *i2;
138 iter_swap( i1, i2 );
140 CPPUNIT_ASSERT(( *i1 == v1 && *i2 == v0 ));
|
| H A D | list_test.cpp | 63 list<int>::iterator i2 = l2.begin(); local
76 CPPUNIT_ASSERT( i2 == l1.begin() );
|
| /external/valgrind/main/cachegrind/ |
| H A D | cg-arch.c | 80 Long i1, i2, i3; local
86 i2 = VG_(strtoll10)(endptr+1, &endptr); if (*endptr != ',') goto bad;
91 cache->assoc = (Int)i2;
94 if (cache->assoc != i2) goto overflow;
|
| /external/chromium/chrome/browser/sync/engine/ |
| H A D | syncer.h | 149 Iterator2 i2 = begin2; local
150 while (i1 != end1 && i2 != end2) {
151 if (*i1 == *i2)
153 if (*i1 > *i2)
154 ++i2;
|
| /external/clang/test/CodeGen/ |
| H A D | ms_struct-bitfield.c | 104 int i2; member in struct:__anon4252
|
| /external/clang/test/Sema/ |
| H A D | complex-int.c | 58 int i2[(29i-11)/(5+7i) == 2+3i ? 1 : -1]; variable
|
| H A D | init.c | 102 int i2; member in struct:__anon4555
105 st st1 = { .i2 = 1 };
|
| /external/clang/test/SemaCXX/ |
| H A D | address-of-temporary.cpp | 36 void i2() { S s = { A{} }; } // expected-warning{{pointer is initialized by a temporary array}} function in namespace:PointerToArrayDecay
|
| H A D | overload-member-call.cpp | 29 int &i2 = g(0); local
41 int& i2 = xcp->f(0); local
|
| H A D | rval-references.cpp | 38 int i2 = over(i1); local
|
| H A D | constant-expression.cpp | 49 i2 = eval, member in struct:C
|
| H A D | cxx0x-initializer-aggregates.cpp | 12 int i2; member in struct:aggregate::S::T
|
| H A D | explicit.cpp | 61 int i2 = int(z); local
|
| H A D | member-expr.cpp | 13 int i2 = xp->f(); local
|
| H A D | qualified-id-lookup.cpp | 55 f1::type& i2 = x; local
66 int i2 = N::f2::member; variable
|
| /external/clang/test/SemaTemplate/ |
| H A D | instantiate-field.cpp | 16 const int &i2 = xi->y; local
|
| H A D | instantiate-declref.cpp | 63 Inner<T> i2; local
64 i2.foo();
|
| /external/chromium/net/base/ |
| H A D | x509_cert_types_mac.cc | 171 unsigned i2; local
172 for (i2 = 0; i2 < rdn2.size(); ++i2) {
173 if (match(rdn1[i1], rdn2[i2]))
176 if (i2 == rdn2.size())
|
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
| H A D | p3-0x.cpp | 80 const int& i2 = { 1.1 }; // expected-error {{type 'double' cannot be narrowed to 'int' in initializer list}} expected-note {{override}} expected-warning {{implicit conversion}} member in namespace:bullet5
|
| /external/freetype/src/base/ |
| H A D | ftcalc.c | 261 FT_UInt32 lo1, hi1, lo2, hi2, lo, hi, i1, i2; local
269 i2 = lo2 * hi1;
272 /* Check carry overflow of i1 + i2 */
273 i1 += i2;
274 hi += (FT_UInt32)( i1 < i2 ) << 16;
|
| /external/icu4c/test/intltest/ |
| H A D | itercoll.cpp | 599 void CollationIteratorTest::assertEqual(CollationElementIterator &i1, CollationElementIterator &i2) argument
607 c2 = i2.next(status);
|
| /external/skia/src/effects/ |
| H A D | SkArithmeticMode.cpp | 159 int32_t i2 = toDot8(k2); local
164 return SkNEW_ARGS(SkArithmeticMode_quad, (i1, i2, i3, i4));
166 if (0 == i2) {
170 return SkNEW_ARGS(SkArithmeticMode_src, (i2, i4));
172 return SkNEW_ARGS(SkArithmeticMode_linear, (i2, i3, i4));
|
| /external/stlport/src/ |
| H A D | locale.cpp | 299 _Locale_impl* i2 = L2._M_impl; local
308 impl->insert( i2, _STLP_STD::collate<char>::id);
310 impl->insert( i2, _STLP_STD::collate<wchar_t>::id);
314 impl->insert( i2, _STLP_STD::ctype<char>::id);
315 impl->insert( i2, _STLP_STD::codecvt<char, char, mbstate_t>::id);
317 impl->insert( i2, _STLP_STD::ctype<wchar_t>::id);
318 impl->insert( i2, _STLP_STD::codecvt<wchar_t, char, mbstate_t>::id);
322 impl->insert( i2, _STLP_STD::moneypunct<char, true>::id);
323 impl->insert( i2, _STLP_STD::moneypunct<char, false>::id);
324 impl->insert( i2, _STLP_ST
[all...] |
| /external/valgrind/main/perf/ |
| H A D | ffbench.c | 172 register int i1, i2, i3; local
189 for (i2 = 1; i2 <= ip2; i2 += ip1) {
190 if (i2 < i2rev) {
191 for (i1 = i2; i1 <= i2 + ip1 - 2; i1 += 2) {
193 i3rev = i2rev + i3 - i2;
217 for (i2 = i1; i2 <
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| H A D | TCPageMap.h | 130 const Number i2 = k & (LEAF_LENGTH-1); local
131 return root_[i1]->values[i2];
137 const Number i2 = k & (LEAF_LENGTH-1); local
138 root_[i1]->values[i2] = v;
232 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
234 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
240 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
242 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
248 const Number i2 = (key >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
258 if (root_->ptrs[i1]->ptrs[i2]
[all...] |