Searched refs:j (Results 1 – 25 of 248) sorted by relevance
12345678910
6 blort.j:@0000: move-object v3:Lblort; <- v0:Lblort;7 blort.j:@0000: goto . <- .15 blort.j:@0004: move-object v4:Lblort; <- v0:Lblort;16 blort.j:@0006: const-int(10) v4:I=10 <- .17 blort.j:@0008: move-int v0:I=10 <- v4:I=1018 blort.j:@0008: goto . <- .26 blort.j:@000c: move-int v4:I <- v0:I27 blort.j:@000c: goto . <- .34 blort.j:@0000: move-param-object(0) v0:Lblort; <- .35 blort.j:@0000: goto . <- .[all …]
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 …]
106 for (int j = i + 1; j < oldRegCount; j++) { in allocateRegisters()107 if (mapped.get(j) || isDefinitionMoveParam(j)) { in allocateRegisters()116 if (!current.has(j) in allocateRegisters()118 && (maxCategory < getCategoryForSsaReg(j)))) { in allocateRegisters()120 interference.mergeInterferenceSet(j, current); in allocateRegisters()123 getCategoryForSsaReg(j)); in allocateRegisters()125 mapper.addMapping(j, newReg, maxCategory); in allocateRegisters()126 mapped.set(j); in allocateRegisters()
88 for (int j = i + 1; j < szPreds; j++) { in process()89 int jLabel = preds.get(j); in process()144 for (int j = 0; j < szPreds; j++) { in combineBlocks()145 BasicBlock predBlock = newBlocks.labelToBlock(preds.get(j)); in combineBlocks()
267 for (int j = 0; j < szPhis; j++) { in coInterferePhis()268 if (i == j) { in coInterferePhis()273 SsaInsn second = phis.get(j); in coInterferePhis()
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 …]
68 int j = 0; in merge() local70 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()
72 int j = 0; in merge() local74 while (j < szOther && i < szThis) { in merge()75 while (j < szOther && o.ints.get(j) < ints.get(i)) { in merge()76 add(o.ints.get(j++)); in merge()78 if (j == szOther) { in merge()81 while (i < szThis && o.ints.get(j) >= ints.get(i)) { in merge()86 while (j < szOther) { in merge()87 add(o.ints.get(j++)); in merge()
79 for (int j = 0; j < numDex; ++j) { in main()81 fileNames[j] = args[fileIndex]; in main()90 for (int j = 0; j < numDex; ++j) { in main()92 dexesToMerge[j] = new Dex(new File(fileNames[j])); in main()94 System.err.println("Error opening " + fileNames[j]); in main()
22 int j = 1; in phiTest() local26 if (j < 20) { in phiTest()27 j = i; in phiTest()30 j = k; in phiTest()35 return j; in phiTest()
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()
232 for (int j = start; j < end; j += len) { in regularDump()233 len = code.parseInstruction(j, codeObserver); in regularDump()234 codeObserver.setPreviousOffset(j); in regularDump()242 for (int j = 0; j < ssz; j++) { in regularDump()243 int succ = successors.get(j); in regularDump()250 for (int j = 0; j < csz; j++) { in regularDump()251 ByteCatchList.Item one = catches.get(j); in regularDump()
206 for (int j = preds.nextSetBit(0); j >= 0; in edgeSplitMoveExceptionsAndResults()207 j = preds.nextSetBit(j + 1)) { in edgeSplitMoveExceptionsAndResults()208 SsaBasicBlock predecessor = blocks.get(j); in edgeSplitMoveExceptionsAndResults()243 for (int j = successors.nextSetBit(0); in edgeSplitSuccessors()244 j >= 0; j = successors.nextSetBit(j+1)) { in edgeSplitSuccessors()246 SsaBasicBlock succ = blocks.get(j); in edgeSplitSuccessors()
196 for (int j = preds.nextSetBit(0); in run()197 j >= 0; in run()198 j = preds.nextSetBit(j + 1)) { in run()199 SsaBasicBlock predBlock = blocks.get(j); in run()
148 for (int j = 0; j < sourcesSize; j++) { in pruneDeadInstructions()149 RegisterSpec source = sources.get(j); in pruneDeadInstructions()
17 for i in Blort*.j; do18 o=${i%.j}.class
1 blort.j:@0000: const-int(99) v1:I=99 <- .2 blort.j:@0002: move-int v0:I=99 <- v1:I=99
20 bash multidimensional.sh > multidimensional.j21 jasmin -d . multidimensional.j >/dev/null
... init> () void bar (int) int j Consumer consumer private synthetic void lambda$bar$0
23 void bar(int j) { in bar() argument24 Consumer consumer = k -> System.out.println(((i + j) + (int)k)); in bar()
169 for (int j = 0; j < ssz; j++) { in calcPredecessors()170 int succLabel = successors.get(j); in calcPredecessors()
137 for (int j = 0; j < insnsSz; j++) { in getEffectiveInstructionCount()138 Insn insn = insns.get(j); in getEffectiveInstructionCount()
170 for (int j = 0; j < ssz; j++) { in calcPredecessors()171 int succLabel = successors.get(j); in calcPredecessors()
471 for (var j = i + 1; j < n; ++j) {472 var name2 = matches[j].match(pr_tagNameRe);481 if (j < n) {483 sourceBufLen, matches.slice(i, j + 1).join(''));484 i = j;