| /dalvik/dx/tests/085-dex-jsr-ret/ |
| D | expected.txt | 7 blort.j:@0000: move-object v3:Lblort; <- v0:Lblort;
8 blort.j:@0000: goto . <- .
16 blort.j:@0004: move-object v4:Lblort; <- v0:Lblort;
17 blort.j:@0006: const-int(10) v4:I=10 <- .
18 blort.j:@0008: move-int v0:I=10 <- v4:I=10
19 blort.j:@0008: goto . <- .
27 blort.j:@000c: move-int v4:I <- v0:I
28 blort.j:@000c: goto . <- .
35 blort.j:@0000: move-param-object(0) v0:Lblort; <- .
36 blort.j:@0000: goto . <- .
[all …]
|
| /dalvik/tests/005-args/src/ |
| D | ArgsTest.java | 33 void argTest(int a, char c, double d, long j, float f) { in argTest() argument
35 + Long.toHexString(mLongArray[1]) + " " + Long.toHexString(j)); in argTest()
37 + mLongArray[1] + " " + j); in argTest()
39 System.out.println(j); in argTest()
40 System.out.println("j = " + j); in argTest()
42 + " j=" + j + " f=" + f); in argTest()
|
| /dalvik/dx/tests/083-ssa-phi-placement/ |
| D | Blort.java | 22 int j = 1; in phiTest() local
26 if (j < 20) { in phiTest()
27 j = i; in phiTest()
30 j = k; in phiTest()
35 return j; in phiTest()
|
| /dalvik/dx/tests/094-scala-locals/ |
| D | expected.txt | 7 blort.j:@0000: Rop{invoke-static . <- . call throws <any>}(blort.returnint:()
14 blort.j:@0003: Rop{invoke-static . <- . call throws <any>}(blort.returnint:()
21 blort.j:@0006: Rop{invoke-static . <- . call throws <any>}(blort.returnint:()
28 blort.j:@0009: Rop{invoke-static . <- . call throws <any>}(blort.returnint:()
36 blort.j:@001b: goto . <- .
42 blort.j:@0000: goto . <- .
48 blort.j:@001b: return-void . <- .
54 blort.j:@0000: goto . <- .
60 blort.j:@0003: goto . <- .
66 blort.j:@0006: goto . <- .
[all …]
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| D | FirstFitAllocator.java | 108 for (int j = i + 1; j < oldRegCount; j++) { in allocateRegisters()
109 if (mapped.get(j) || isDefinitionMoveParam(j)) { in allocateRegisters()
118 if (!current.has(j) in allocateRegisters()
120 && (maxCategory < getCategoryForSsaReg(j)))) { in allocateRegisters()
122 interference.mergeInterferenceSet(j, current); in allocateRegisters()
125 getCategoryForSsaReg(j)); in allocateRegisters()
127 mapper.addMapping(j, newReg, maxCategory); in allocateRegisters()
128 mapped.set(j); in allocateRegisters()
|
| D | IdenticalBlockCombiner.java | 93 for (int j = i + 1; j < szPreds; j++) { in process()
94 int jLabel = preds.get(j); in process()
149 for (int j = 0; j < szPreds; j++) { in combineBlocks()
150 BasicBlock predBlock = newBlocks.labelToBlock(preds.get(j)); in combineBlocks()
|
| /dalvik/dx/src/com/android/dx/util/ |
| D | ListIntSet.java | 68 int j = 0; in merge() local
70 while (j < szOther && i < szThis) { in merge()
71 while (j < szOther && o.ints.get(j) < ints.get(i)) { in merge()
72 add(o.ints.get(j++)); in merge()
74 if (j == szOther) { in merge()
77 while (i < szThis && o.ints.get(j) >= ints.get(i)) { in merge()
82 while (j < szOther) { in merge()
83 add(o.ints.get(j++)); in merge()
|
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| D | ListIntSet.java | 68 int j = 0; in merge() local
70 while (j < szOther && i < szThis) { in merge()
71 while (j < szOther && o.ints.get(j) < ints.get(i)) { in merge()
72 add(o.ints.get(j++)); in merge()
74 if (j == szOther) { in merge()
77 while (i < szThis && o.ints.get(j) >= ints.get(i)) { in merge()
82 while (j < szOther) { in merge()
83 add(o.ints.get(j++)); in merge()
|
| /dalvik/tests/021-string2/src/junit/framework/ |
| D | ComparisonFailure.java | 41 int j= fExpected.length()-1; in getMessage() local
43 for (; k >= i && j >= i; k--,j--) { in getMessage()
44 if (fExpected.charAt(j) != fActual.charAt(k)) in getMessage()
50 if (j < i && k < i) { in getMessage()
54 expected= fExpected.substring(i, j+1); in getMessage()
61 if (j < fExpected.length()-1) in getMessage()
|
| /dalvik/tests/082-inline-execute/src/junit/framework/ |
| D | ComparisonFailure.java | 41 int j= fExpected.length()-1; in getMessage() local
43 for (; k >= i && j >= i; k--,j--) { in getMessage()
44 if (fExpected.charAt(j) != fActual.charAt(k)) in getMessage()
50 if (j < i && k < i) { in getMessage()
54 expected= fExpected.substring(i, j+1); in getMessage()
61 if (j < fExpected.length()-1) in getMessage()
|
| /dalvik/vm/reflect/ |
| D | Proxy.cpp | 265 int j; in gatherMethods() local
266 for (j = 0; j < clazz->iftableCount; j++) { in gatherMethods()
267 ClassObject* iclass = clazz->iftable[j].clazz; in gatherMethods()
297 int j; in gatherMethods() local
299 for (j = 0; j < clazz->virtualMethodCount; j++) { in gatherMethods()
300 allMethods[allCount++] = &clazz->virtualMethods[j]; in gatherMethods()
303 for (j = 0; j < clazz->iftableCount; j++) { in gatherMethods()
304 ClassObject* iclass = clazz->iftable[j].clazz; in gatherMethods()
378 int i, j; in copyWithoutDuplicates() local
408 for (j = 0; j < allCount; j++) { in copyWithoutDuplicates()
[all …]
|
| /dalvik/dx/junit-tests/com/android/dx/util/ |
| D | BitsTest.java | 172 for (int j = i % 11; j >= 0; j--) { in test2_isEmpty()
173 int x = i - 1 - (j * 13); in test2_isEmpty()
192 for (int j = 0; j < i; j += 20) { in test2_bitCount()
193 Bits.set(bits, j); in test2_bitCount()
196 for (int j = 7; j < i; j += 11) { in test2_bitCount()
197 if (!Bits.get(bits, j)) { in test2_bitCount()
198 Bits.set(bits, j); in test2_bitCount()
202 for (int j = 3; j < i; j += 17) { in test2_bitCount()
203 if (!Bits.get(bits, j)) { in test2_bitCount()
204 Bits.set(bits, j); in test2_bitCount()
[all …]
|
| /dalvik/dx/tests/100-local-mismatch/ |
| D | run | 17 jasmin -d . blort1.j >/dev/null
18 jasmin -d . blort2.j >/dev/null
19 jasmin -d . blort3.j >/dev/null
20 jasmin -d . blort4.j >/dev/null
|
| /dalvik/tests/005-args/ |
| D | expected.txt | 4 j = 1234605616436508552
5 a=123 c=q d=3.343434 j=1234605616436508552 f=0.12345
|
| /dalvik/tools/dexdeps/src/com/android/dexdeps/ |
| D | Output.java | 119 for (int j = 0; j < fields.length; j++) { in printFieldRefs()
120 FieldRef ref = fields[j]; in printFieldRefs()
136 for (int j = 0; j < methods.length; j++) { in printMethodRefs()
137 MethodRef ref = methods[j]; in printMethodRefs()
224 for (int j = 0; j < args.length; j++) { in printXmlMethods()
226 descriptorToDot(args[j]) + "\"/>"); in printXmlMethods()
|
| /dalvik/vm/mterp/c/ |
| D | OP_MOVE_RESULT_WIDE.cpp | 3 ILOGV("|move-result-wide v%d %s(0x%08llx)", vdst, kSpacing, retval.j);
4 SET_REGISTER_WIDE(vdst, retval.j);
|
| /dalvik/dx/tests/114-value-propagation/ |
| D | expected.txt | 2 blort.j:@0000: const-int(99) v1:I=99 <- .
3 blort.j:@0002: move-int v0:I=99 <- v1:I=99
|
| /dalvik/dx/src/com/android/dx/command/dump/ |
| D | BlockDumper.java | 240 for (int j = start; j < end; j += len) { in regularDump()
241 len = code.parseInstruction(j, codeObserver); in regularDump()
242 codeObserver.setPreviousOffset(j); in regularDump()
250 for (int j = 0; j < ssz; j++) { in regularDump()
251 int succ = successors.get(j); in regularDump()
258 for (int j = 0; j < csz; j++) { in regularDump()
259 ByteCatchList.Item one = catches.get(j); in regularDump()
|
| /dalvik/tests/014-math3/src/ |
| D | Main.java | 24 long j; in main() local
33 try { j = 10L / 0L; } in main()
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| D | SsaConverter.java | 207 for (int j = preds.nextSetBit(0); j >= 0; in edgeSplitMoveExceptionsAndResults()
208 j = preds.nextSetBit(j + 1)) { in edgeSplitMoveExceptionsAndResults()
209 SsaBasicBlock predecessor = blocks.get(j); in edgeSplitMoveExceptionsAndResults()
244 for (int j = successors.nextSetBit(0); in edgeSplitSuccessors()
245 j >= 0; j = successors.nextSetBit(j+1)) { in edgeSplitSuccessors()
247 SsaBasicBlock succ = blocks.get(j); in edgeSplitSuccessors()
|
| /dalvik/tests/030-bad-finalizer/src/ |
| D | BadFinalizer.java | 17 int j = 0; in finalize() local
23 j++; in finalize()
|
| /dalvik/vm/ |
| D | PointerSet.cpp | 240 int i, j; in dvmPointerSetIntersect() local
243 for (j = 0; j < count; j++) { in dvmPointerSetIntersect()
244 if (pSet->list[i] == ptrArray[j]) { in dvmPointerSetIntersect()
250 if (j == count) { in dvmPointerSetIntersect()
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| D | RopMethod.java | 170 for (int j = 0; j < ssz; j++) { in calcPredecessors()
171 int succLabel = successors.get(j); in calcPredecessors()
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| D | RopMethod.java | 170 for (int j = 0; j < ssz; j++) { in calcPredecessors()
171 int succLabel = successors.get(j); in calcPredecessors()
|
| /dalvik/libdex/ |
| D | sha1.cpp | 218 unsigned long i, j; /* JHB */ in SHA1Update() local
220 j = (context->count[0] >> 3) & 63; in SHA1Update()
224 if ((j + len) > 63) in SHA1Update()
226 memcpy(&context->buffer[j], data, (i = 64-j)); in SHA1Update()
231 j = 0; in SHA1Update()
235 memcpy(&context->buffer[j], &data[i], len - i); in SHA1Update()
331 int j, k; in verifyfile() local
359 for (k=0, j=5; k < HASHSIZE; k++) in verifyfile()
361 expected_digest[k]=hexval(checkline[j++]); in verifyfile()
363 +hexval(checkline[j++]); in verifyfile()
[all …]
|