| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_char/d/ |
| T_sget_char_5.d | 19 .field public i1 C
27 iput-char v2, v3, dot.junit.opcodes.sget_char.d.T_sget_char_5.i1 C
34 sget-char v1, dot.junit.opcodes.sget_char.d.T_sget_char_5.i1 C
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_object/d/ |
| T_sget_object_5.d | 19 .field public i1 Ljava/lang/Object;
27 iput-object v2, v3, dot.junit.opcodes.sget_object.d.T_sget_object_5.i1 Ljava/lang/Object;
34 sget-object v1, dot.junit.opcodes.sget_object.d.T_sget_object_5.i1 Ljava/lang/Object;
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_short/d/ |
| T_sget_short_5.d | 19 .field public i1 S
27 iput-short v2, v3, dot.junit.opcodes.sget_short.d.T_sget_short_5.i1 S
34 sget-short v1, dot.junit.opcodes.sget_short.d.T_sget_short_5.i1 S
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/sget_wide/d/ |
| T_sget_wide_5.d | 19 .field public i1 J
27 iput-wide v0, v3, dot.junit.opcodes.sget_wide.d.T_sget_wide_5.i1 J
34 sget-wide v1, dot.junit.opcodes.sget_wide.d.T_sget_wide_5.i1 J
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sget/d/ |
| T_sget_5.d | 19 .field public i1 I
27 iput v2, v3, dot.junit.opcodes.sget.d.T_sget_5.i1 I
34 sget v1, dot.junit.opcodes.sget.d.T_sget_5.i1 I
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sget_boolean/d/ |
| T_sget_boolean_5.d | 19 .field public i1 Z
27 iput-boolean v2, v3, dot.junit.opcodes.sget_boolean.d.T_sget_boolean_5.i1 Z
34 sget-boolean v1, dot.junit.opcodes.sget_boolean.d.T_sget_boolean_5.i1 Z
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sget_byte/d/ |
| T_sget_byte_5.d | 19 .field public i1 B
27 iput-byte v2, v3, dot.junit.opcodes.sget_byte.d.T_sget_byte_5.i1 B
34 sget-byte v1, dot.junit.opcodes.sget_byte.d.T_sget_byte_5.i1 B
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sget_char/d/ |
| T_sget_char_5.d | 19 .field public i1 C
27 iput-char v2, v3, dot.junit.opcodes.sget_char.d.T_sget_char_5.i1 C
34 sget-char v1, dot.junit.opcodes.sget_char.d.T_sget_char_5.i1 C
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sget_object/d/ |
| T_sget_object_5.d | 19 .field public i1 Ljava/lang/Object;
27 iput-object v2, v3, dot.junit.opcodes.sget_object.d.T_sget_object_5.i1 Ljava/lang/Object;
34 sget-object v1, dot.junit.opcodes.sget_object.d.T_sget_object_5.i1 Ljava/lang/Object;
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sget_short/d/ |
| T_sget_short_5.d | 19 .field public i1 S
27 iput-short v2, v3, dot.junit.opcodes.sget_short.d.T_sget_short_5.i1 S
34 sget-short v1, dot.junit.opcodes.sget_short.d.T_sget_short_5.i1 S
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sget_wide/d/ |
| T_sget_wide_5.d | 19 .field public i1 J
27 iput-wide v0, v3, dot.junit.opcodes.sget_wide.d.T_sget_wide_5.i1 J
34 sget-wide v1, dot.junit.opcodes.sget_wide.d.T_sget_wide_5.i1 J
|
| /frameworks/base/media/libstagefright/codecs/amrnb/enc/src/ |
| c3_14pf.cpp | 157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
161 i1 : 1, 6, 11, 16, 21, 26, 31, 36.
382 Word16 i1; local
448 * i1 loop: 8 positions. *
464 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP)
467 /* ps1 = add(ps0, dn[i1], pOverflow); */
468 ps1 = ps0 + dn[i1];
470 /* alp1 = alp0 + rr[i0][i1] + 1/2*rr[i1][i1]; *
[all...] |
| c2_11pf.cpp | 73 * The code length is 40, containing 2 nonzero pulses: i0...i1.
75 * Pulse i0 can have 2x8=16 possible positions, pulse i1 can have
80 * i1 : 0, 5, 10, 15, 20, 25, 30, 35.
179 The code length is 40, containing 2 nonzero pulses: i0...i1.
181 Pulse i0 can have 2x8=16 possible positions, pulse i1 can have
186 i1 : 0, 5, 10, 15, 20, 25, 30, 35.
412 Word16 i1; local
466 * i1 loop: 8 positions. *
480 for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP
[all...] |
| c2_9pf.cpp | 197 The code length is 40, containing 2 nonzero pulses: i0...i1. All pulses can
199 pulse i1 can have 8 positions. Also coded is which track pair should be used,
204 i1 : 2, 7, 12, 17, 22, 27, 32, 37.
206 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
210 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
212 i1 : 4, 9, 14, 19, 24, 29, 34, 39.
216 i1 : 2, 7, 12, 17, 22, 27, 32, 37.
218 i1 : 4, 9, 14, 19, 24, 29, 34, 39.
222 i1 : 3, 8, 13, 18, 23, 28, 33, 38.
224 i1 : 4, 9, 14, 19, 24, 29, 34, 39
596 register Word16 i1; local
[all...] |
| /external/bouncycastle/src/main/java/org/bouncycastle/crypto/engines/ |
| RC4Engine.java | 130 int i1 = 0; local
135 i2 = ((keyBytes[i1] & 0xff) + engineState[i] + i2) & 0xff;
140 i1 = (i1+1) % keyBytes.length;
|
| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.elab/ |
| p2.cpp | 17 namespace i1 { namespace in namespace:test0
|
| /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/ |
| p9.cpp | 5 int i1 = f<1>(0); // expected-error{{ambiguous}} variable
|
| /external/clang/test/Sema/ |
| attr-unused.c | 23 Int_unused i1; // expected-warning {{'Int_unused' was marked unused but was used}} local
|
| /external/icu4c/test/intltest/ |
| itercoll.h | 109 void assertEqual(CollationElementIterator &i1, CollationElementIterator &i2);
|
| /system/extras/tests/bionic/libstdc++/ |
| test_climits.cpp | 52 volatile int i1 = INT_MAX; local
|
| /external/apache-harmony/security/src/test/api/java.injected/java/security/ |
| IdentityTest.java | 52 Identity i1 = new IdentityStub("testEquals"); local
56 i1, Boolean.TRUE,
57 new IdentityStub(i1.getName()), Boolean.TRUE
61 assertEquals(value[k+1], new Boolean(i1.equals(value[k])));
62 if (Boolean.TRUE.equals(value[k+1])) assertEquals(i1.hashCode(), value[k].hashCode());
66 assertEquals(i1.identityEquals(i2), i1.equals(i2));
68 assertEquals(i1.identityEquals(i3), i1.equals(i3));
277 // Identity i1 = new IdentityStub("testSetPublicKey3_1", IdentityScope.getSystemScope())
[all...] |
| /external/apache-http/src/org/apache/http/message/ |
| BasicHeaderValueParser.java | 361 int i1 = pos; local
384 while (i1 < i2 && (HTTP.isWhitespace(buffer.charAt(i1)))) {
385 i1++;
388 while ((i2 > i1) && (HTTP.isWhitespace(buffer.charAt(i2 - 1)))) {
392 if (((i2 - i1) >= 2)
393 && (buffer.charAt(i1) == '"')
395 i1++;
398 value = buffer.substring(i1, i2);
|
| /external/valgrind/main/perf/ |
| ffbench.c | 172 register int i1, i2, i3; local
191 for (i1 = i2; i1 <= i2 + ip1 - 2; i1 += 2) {
192 for (i3 = i1; i3 <= ip3; i3 += ip2) {
216 for (i1 = i3; i1 <= i3 + ip1 - 2; i1 += 2) {
217 for (i2 = i1; i2 <= ip3; i2 += ifp2) {
|
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
| c2t64fx.c | 56 Word32 i, j, k, i0, i1, ix, iy, pos, pos2; local
237 for (i1 = 1; i1 < L_SUBFR; i1 += STEP)
239 ps2 = add1(ps1, dn[i1]);
247 pos = i1;
267 i1 = (iy >> 1); /* pos of pulse 2 (0..31) */
285 i1 += NB_POS;
288 *index = add1((i0 << 6), i1);
|
| /external/llvm/utils/TableGen/ |
| X86DisassemblerTables.cpp | 289 uint32_t &i1,
311 o1.indent(i1) << "static const InstrUID modRMTable" << thisTableNumber;
328 i1++;
334 emitOneID(o1, i1, decision.instructionIDs[0], false);
337 emitOneID(o1, i1, decision.instructionIDs[0x00], true); // mod = 0b00
338 emitOneID(o1, i1, decision.instructionIDs[0xc0], false); // mod = 0b11
342 emitOneID(o1, i1, decision.instructionIDs[index], index < 255);
346 i1--;
347 o1.indent(i1) << "};" << "\n";
365 uint32_t &i1,
[all...] |
