| /external/chromium_org/ppapi/generators/test_cgen/ |
| enum_typedef.idl | 17 /* typedef int32_t i2[3]; */
18 typedef int32_t[3] i2;
|
| /external/eigen/test/eigen2/ |
| eigen2_visitor.cpp | 23 for(int i2 = 0; i2 < i; i2++)
24 while(m(i) == m(i2)) // yes, ==
69 for(int i2 = 0; i2 < i; i2++)
70 while(v(i) == v(i2)) // yes, ==
|
| /external/eigen/test/ |
| visitor.cpp | 24 for(Index i2 = 0; i2 < i; i2++)
25 while(m(i) == m(i2)) // yes, ==
71 for(Index i2 = 0; i2 < i; i2++)
72 while(v(i) == v(i2)) // yes, ==
|
| /external/lzma/CPP/Common/ |
| MyCom.h | 195 #define MY_UNKNOWN_IMP2(i1, i2) MY_UNKNOWN_IMP_SPEC( \
198 MY_QUERYINTERFACE_ENTRY(i2) \
201 #define MY_UNKNOWN_IMP3(i1, i2, i3) MY_UNKNOWN_IMP_SPEC( \
204 MY_QUERYINTERFACE_ENTRY(i2) \
208 #define MY_UNKNOWN_IMP4(i1, i2, i3, i4) MY_UNKNOWN_IMP_SPEC( \
211 MY_QUERYINTERFACE_ENTRY(i2) \
216 #define MY_UNKNOWN_IMP5(i1, i2, i3, i4, i5) MY_UNKNOWN_IMP_SPEC( \
219 MY_QUERYINTERFACE_ENTRY(i2) \
|
| /dalvik/dx/tests/084-dex-high-register-moves/ |
| Blort.java | 26 int i2 = 0; local
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_stackdepot_test.cc | 52 u32 i2 = StackDepotPut(s1, ARRAY_SIZE(s1)); local
53 EXPECT_EQ(i1, i2);
65 u32 i2 = StackDepotPut(s2, ARRAY_SIZE(s2)); local
66 EXPECT_NE(i1, i2);
|
| /libcore/harmony-tests/src/test/java/tests/api/java/math/ |
| BigIntegerTest.java | 757 BigInteger i1 = element[0], i2 = element[1]; local
758 BigInteger res = i1.and(i2);
759 assertTrue("symmetry of and", res.equals(i2.and(i1)));
760 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66;
762 assertTrue("and", (i1.testBit(i) && i2.testBit(i)) == res
773 BigInteger i1 = element[0], i2 = element[1]; local
774 BigInteger res = i1.or(i2);
775 assertTrue("symmetry of or", res.equals(i2.or(i1)));
776 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66;
778 assertTrue("or", (i1.testBit(i) || i2.testBit(i)) == re
789 BigInteger i1 = element[0], i2 = element[1]; local
819 BigInteger i1 = element[0], i2 = element[1]; local
984 testDiv(i1.negate(), i2); local
[all...] |
| /external/valgrind/main/perf/ |
| 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 <= ip3; i2 += ifp2)
[all...] |
| /external/llvm/utils/TableGen/ |
| X86DisassemblerTables.cpp | 389 unsigned &i1, unsigned &i2,
397 o2.indent(i2) << "{ /* ModRMDecision */" << "\n";
398 i2++;
400 o2.indent(i2) << stringForDecisionType(dt) << "," << "\n";
401 o2.indent(i2) << 0 << " /* EmptyTable */\n";
403 i2--;
404 o2.indent(i2) << "}";
441 o2.indent(i2) << "{ /* struct ModRMDecision */" << "\n";
442 i2++;
444 o2.indent(i2) << stringForDecisionType(dt) << "," << "\n"
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/aes/asm/ |
| aes-armv4.pl | 46 $i2="r8";
284 and $i2,lr,$s0,lsr#8
290 ldr $t2,[$tbl,$i2,lsl#2] @ Te2[s0>>8]
291 and $i2,lr,$s1
298 ldr $i2,[$tbl,$i2,lsl#2] @ Te3[s1>>0]
303 eor $t2,$t2,$i2,ror#8
304 and $i2,lr,$s2,lsr#16 @ i1
309 ldr $i2,[$tbl,$i2,lsl#2] @ Te1[s2>>16
[all...] |
| /external/openssl/crypto/aes/asm/ |
| aes-armv4.pl | 46 $i2="r8";
284 and $i2,lr,$s0,lsr#8
290 ldr $t2,[$tbl,$i2,lsl#2] @ Te2[s0>>8]
291 and $i2,lr,$s1
298 ldr $i2,[$tbl,$i2,lsl#2] @ Te3[s1>>0]
303 eor $t2,$t2,$i2,ror#8
304 and $i2,lr,$s2,lsr#16 @ i1
309 ldr $i2,[$tbl,$i2,lsl#2] @ Te1[s2>>16
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
| RC4Engine.java | 132 int i2 = 0; local
136 i2 = ((keyBytes[i1] & 0xff) + engineState[i] + i2) & 0xff;
139 engineState[i] = engineState[i2];
140 engineState[i2] = tmp;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| find_selectors.h | 54 * @param i2 Iterator on second sequence (unused).
60 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
84 * @param i2 Iterator on second sequence (unused).
90 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
124 * @param i2 Iterator on second sequence (unused).
130 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
131 { return !pred(*i1, *i2); }
162 * @param i2 Iterator on second sequence (unused).
167 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| TCPageMap.h | 123 const Number i2 = k & (LEAF_LENGTH-1); local
124 return root_[i1]->values[i2];
130 const Number i2 = k & (LEAF_LENGTH-1); local
131 root_[i1]->values[i2] = v;
223 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
225 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
231 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
233 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
239 const Number i2 = (key >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
249 if (root_->ptrs[i1]->ptrs[i2] == NULL)
[all...] |
| /external/llvm/unittests/ADT/ |
| HashingTest.cpp | 337 const int i1 = 42, i2 = 43, i3 = 123, i4 = 999, i5 = 0, i6 = 79; local
338 const int arr1[] = { i1, i2, i3, i4, i5, i6 };
340 EXPECT_EQ(hash_combine_range(arr1, arr1 + 2), hash_combine(i1, i2));
341 EXPECT_EQ(hash_combine_range(arr1, arr1 + 3), hash_combine(i1, i2, i3));
342 EXPECT_EQ(hash_combine_range(arr1, arr1 + 4), hash_combine(i1, i2, i3, i4));
344 hash_combine(i1, i2, i3, i4, i5));
346 hash_combine(i1, i2, i3, i4, i5, i6));
363 EXPECT_NE(hash_combine(i1, i1, i1), hash_combine(i1, i1, i2));
364 EXPECT_NE(hash_combine(i1, i1, i1), hash_combine(i1, i2, i1));
365 EXPECT_NE(hash_combine(i1, i1, i1), hash_combine(i2, i1, i1))
[all...] |
| /external/stlport/src/ |
| locale.cpp | 300 _Locale_impl* i2 = L2._M_impl; local
309 impl->insert( i2, _STLP_STD::collate<char>::id);
311 impl->insert( i2, _STLP_STD::collate<wchar_t>::id);
315 impl->insert( i2, _STLP_STD::ctype<char>::id);
316 impl->insert( i2, _STLP_STD::codecvt<char, char, mbstate_t>::id);
318 impl->insert( i2, _STLP_STD::ctype<wchar_t>::id);
319 impl->insert( i2, _STLP_STD::codecvt<wchar_t, char, mbstate_t>::id);
323 impl->insert( i2, _STLP_STD::moneypunct<char, true>::id);
324 impl->insert( i2, _STLP_STD::moneypunct<char, false>::id);
325 impl->insert( i2, _STLP_STD::money_get<char, istreambuf_iterator<char, char_traits<char> > >::id)
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| locale.cpp | 300 _Locale_impl* i2 = L2._M_impl; local
309 impl->insert( i2, _STLP_STD::collate<char>::id);
311 impl->insert( i2, _STLP_STD::collate<wchar_t>::id);
315 impl->insert( i2, _STLP_STD::ctype<char>::id);
316 impl->insert( i2, _STLP_STD::codecvt<char, char, mbstate_t>::id);
318 impl->insert( i2, _STLP_STD::ctype<wchar_t>::id);
319 impl->insert( i2, _STLP_STD::codecvt<wchar_t, char, mbstate_t>::id);
323 impl->insert( i2, _STLP_STD::moneypunct<char, true>::id);
324 impl->insert( i2, _STLP_STD::moneypunct<char, false>::id);
325 impl->insert( i2, _STLP_STD::money_get<char, istreambuf_iterator<char, char_traits<char> > >::id)
[all...] |
| /external/apache-harmony/security/src/test/api/java.injected/java/security/ |
| IdentityTest.java | 65 Identity i2 = new IdentityStub("testEquals", IdentityScope.getSystemScope()); local
66 assertEquals(i1.identityEquals(i2), i1.equals(i2));
227 Identity i2 = IdentityScope.getSystemScope().getIdentity(name); local
228 i2.setPublicKey(pk);
229 assertTrue(i.identityEquals(i2));
250 Identity i2 = new IdentityStub("testGetScope2", s); local
251 assertSame(s, i2.getScope());
261 Identity i2 = new IdentityStub("testSetPublicKey2_2", IdentityScope.getSystemScope()); local
264 i2.setPublicKey(null)
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| c4_17pf.cpp | 167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have
172 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
396 Word16 i2; local
513 * i2 loop: 8 positions. *
528 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
531 /* ps1 = add(ps0, dn[i2], pOverflow); */
532 ps1 = ps0 + dn[i2];
534 /* alp1 = alp0 + rr[i0][i2] + rr[i1][i2] + 1/2*rr[i2][i2]; *
[all...] |
| c3_14pf.cpp | 155 The code length is 40, containing 3 nonzero pulses: i0...i2.
157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
163 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
383 Word16 i2; local
460 * "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]" *
503 * i2 loop: 8 positions. *
518 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
521 /* ps1 = add(ps0, dn[i2], pOverflow); *
[all...] |
| /external/chromium_org/sync/engine/ |
| download_unittest.cc | 73 Invalidation i2; local
74 i2.payload = "bookmark_payload";
75 invalidation_map.insert(std::make_pair(BOOKMARKS, i2));
|
| /frameworks/wilhelm/src/ |
| ThreadPool.h | 29 typedef void (*ClosureHandler_generic)(void *p1, void *p2, void *p3, int i1, int i2);
31 typedef void (*ClosureHandler_ppii) (void *p1, void *p2, int i1, int i2);
32 typedef void (*ClosureHandler_piipp) (void *p1, int i1, int i2, void *p2, void *p3);
|
| /external/apache-http/src/org/apache/http/util/ |
| ByteArrayBuffer.java | 106 for (int i1 = off, i2 = oldlen; i2 < newlen; i1++, i2++) {
107 this.buffer[i2] = (byte) b[i1];
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| itercoll.h | 109 void assertEqual(CollationElementIterator &i1, CollationElementIterator &i2);
|
| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.elab/ |
| p2.cpp | 26 namespace i2 { namespace in namespace:test0
|
