| /dalvik/dx/tests/044-dex-math-ops/ |
| Blort.java | 24 public void blort(int i1, int i2) {
27 i = i1 + i2;
28 i = i1 - i2;
29 i = i1 * i2;
30 i = i1 / i2;
31 i = i1 % i2;
32 i = i1 & i2;
33 i = i1 | i2;
34 i = i1 ^ i2;
35 i = i1 << i2;
[all...] |
| /external/clang/test/Parser/ |
| namelookup-bug-2.c | 8 struct Object { int i2; } *X; member in struct:Object
|
| /cts/tools/dx-tests/src/dxc/junit/opcodes/invokestatic/jm/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/invoke_static/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/invoke_static_range/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/invoke_static/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/invoke_static_range/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /external/clang/test/SemaCXX/ |
| address-space-references.cpp | 14 static int_2 i2; local
18 f0(i2); // expected-error{{no matching function for call to 'f0'}}
|
| __null.cpp | 7 int i2 = __null; local
|
| cxx0x-initializer-aggregates.cpp | 9 int i2; member in struct:aggregate::S::T
|
| /dalvik/dx/tests/074-dex-form35c-edge-case/ |
| Blort.java | 22 int i2 = 0; local
|
| /external/clang/test/Sema/ |
| tentative-decls.c | 29 static int i2 = 5; // expected-note 1 {{previous definition is here}} variable
30 int i2 = 3; // expected-error{{non-static declaration of 'i2' follows static declaration}} variable
|
| /external/llvm/utils/TableGen/ |
| X86DisassemblerTables.cpp | 290 uint32_t &i2,
300 o2.indent(i2) << "{ /* ModRMDecision */" << "\n";
301 i2++;
303 o2.indent(i2) << stringForDecisionType(dt) << "," << "\n";
304 o2.indent(i2) << "modRMEmptyTable";
306 i2--;
307 o2.indent(i2) << "}";
350 o2.indent(i2) << "{ /* struct ModRMDecision */" << "\n";
351 i2++;
353 o2.indent(i2) << stringForDecisionType(dt) << "," << "\n"
[all...] |
| X86DisassemblerTables.h | 95 /// @param i2 - The indentation level to use with stream o2.
101 uint32_t &i2,
124 /// @param i2 - The indent level to use with stream o2.
130 uint32_t &i2,
159 /// @param i2 - The indent level to use with stream o2.
166 uint32_t &i2,
224 /// @param i2 - The indent level to use with stream o2.
228 uint32_t &i2) const;
|
| /external/icu4c/test/cintltst/ |
| citertst.h | 110 static void assertEqual(UCollationElements *i1, UCollationElements *i2);
|
| /external/webkit/Tools/Scripts/ |
| find-extra-includes | 86 for my $i2 (keys %{ $includes{$file} }) {
87 next if $i1 eq $i2;
88 if ($totalIncludes{$i2}{$i1}) {
93 print "$paths{$file} does not need to include $i1, because $i2 does\n" if $b1 ne $b2;
|
| /frameworks/base/core/java/android/os/ |
| WorkSource.java | 190 for (int i2=0; i2<N2 && i1<N1; i2++) {
191 if (uids2[i2] == uids1[i1]) {
195 while (i1 < N1 && uids2[i2] > uids1[i1]) {
212 for (int i2=0; i2<N2; i2++) {
213 if (i1 >= N1 || uids2[i2] < uids1[i1]) {
218 uids1[0] = uids2[i2];
[all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncer.h | 149 Iterator2 i2 = begin2; local
150 while (i1 != end1 && i2 != end2) {
151 if (*i1 == *i2)
153 if (*i1 > *i2)
154 ++i2;
|
| /external/valgrind/main/helgrind/ |
| hg_wordset.c | 614 UWord i1, i2, k, sz; local
620 i1 = i2 = 0;
622 if (i1 >= wv1->size || i2 >= wv2->size)
625 if (wv1->words[i1] < wv2->words[i2]) {
628 if (wv1->words[i1] > wv2->words[i2]) {
629 i2++;
632 i2++;
636 tl_assert(i2 <= wv2->size);
637 tl_assert(i1 == wv1->size || i2 == wv2->size);
638 if (i1 == wv1->size && i2 < wv2->size)
684 UWord i1, i2, k, sz; local
765 UWord i1, i2, k, sz; local
[all...] |
| /frameworks/base/libs/rs/ |
| rsUtils.h | 124 static inline uint16_t rsBoxFilter565(uint16_t i1, uint16_t i2, uint16_t i3, uint16_t i4) {
125 uint32_t r = ((i1 & 0x1f) + (i2 & 0x1f) + (i3 & 0x1f) + (i4 & 0x1f));
126 uint32_t g = ((i1 >> 5) & 0x3f) + ((i2 >> 5) & 0x3f) + ((i3 >> 5) & 0x3f) + ((i4 >> 5) & 0x3f);
127 uint32_t b = ((i1 >> 11) + (i2 >> 11) + (i3 >> 11) + (i4 >> 11));
131 static inline uint32_t rsBoxFilter8888(uint32_t i1, uint32_t i2, uint32_t i3, uint32_t i4) {
132 uint32_t r = (i1 & 0xff) + (i2 & 0xff) + (i3 & 0xff) + (i4 & 0xff);
133 uint32_t g = ((i1 >> 8) & 0xff) + ((i2 >> 8) & 0xff) + ((i3 >> 8) & 0xff) + ((i4 >> 8) & 0xff);
134 uint32_t b = ((i1 >> 16) & 0xff) + ((i2 >> 16) & 0xff) + ((i3 >> 16) & 0xff) + ((i4 >> 16) & 0xff);
135 uint32_t a = ((i1 >> 24) & 0xff) + ((i2 >> 24) & 0xff) + ((i3 >> 24) & 0xff) + ((i4 >> 24) & 0xff);
|
| /external/bzip2/ |
| blocksort.c | 348 UInt32 i2,
358 AssertD ( i1 != i2, "mainGtU" );
360 c1 = block[i1]; c2 = block[i2];
362 i1++; i2++;
364 c1 = block[i1]; c2 = block[i2];
366 i1++; i2++;
368 c1 = block[i1]; c2 = block[i2];
370 i1++; i2++;
372 c1 = block[i1]; c2 = block[i2];
374 i1++; i2++
[all...] |
| /external/apache-harmony/math/src/test/java/tests/api/java/math/ |
| BigIntegerTest.java | 782 BigInteger i1 = element[0], i2 = element[1]; local
783 BigInteger res = i1.and(i2);
784 assertTrue("symmetry of and", res.equals(i2.and(i1)));
785 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66;
787 assertTrue("and", (i1.testBit(i) && i2.testBit(i)) == res
798 BigInteger i1 = element[0], i2 = element[1]; local
799 BigInteger res = i1.or(i2);
800 assertTrue("symmetry of or", res.equals(i2.or(i1)));
801 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66;
803 assertTrue("or", (i1.testBit(i) || i2.testBit(i)) == re
814 BigInteger i1 = element[0], i2 = element[1]; local
844 BigInteger i1 = element[0], i2 = element[1]; local
1009 testDiv(i1.negate(), i2); local
[all...] |
| /dalvik/dx/tests/084-dex-high-register-moves/ |
| Blort.java | 26 int i2 = 0; local
|
| /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...] |
| /system/media/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);
|
