| /* |
| * Copyright (C) 2011 The Android Open Source Project |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| #include "Dalvik.h" |
| #include "CompilerInternals.h" |
| #include "Dataflow.h" |
| #include "constants.h" |
| |
| static inline bool contentIsInsn(const u2* codePtr) { |
| u2 instr = *codePtr; |
| Opcode opcode = (Opcode)(instr & 0xff); |
| |
| /* |
| * Since the low 8-bit in metadata may look like OP_NOP, we need to check |
| * both the low and whole sub-word to determine whether it is code or data. |
| */ |
| return (opcode != OP_NOP || instr == 0); |
| } |
| |
| /* |
| * Parse an instruction, return the length of the instruction |
| */ |
| static inline int parseInsn(const u2* codePtr, DecodedInstruction* decInsn, |
| bool printMe) |
| { |
| // Don't parse instruction data |
| if (!contentIsInsn(codePtr)) { |
| return 0; |
| } |
| |
| u2 instr = *codePtr; |
| Opcode opcode = dexOpcodeFromCodeUnit(instr); |
| |
| dexDecodeInstruction(codePtr, decInsn); |
| if (printMe) { |
| char *decodedString = oatGetDalvikDisassembly(decInsn, NULL); |
| LOG(INFO) << codePtr << ": 0x" << std::hex << (int)opcode << |
| " " << decodedString; |
| } |
| return dexGetWidthFromOpcode(opcode); |
| } |
| |
| #define UNKNOWN_TARGET 0xffffffff |
| |
| static inline bool isGoto(MIR* insn) |
| { |
| switch (insn->dalvikInsn.opcode) { |
| case OP_GOTO: |
| case OP_GOTO_16: |
| case OP_GOTO_32: |
| return true; |
| default: |
| return false; |
| } |
| } |
| |
| /* |
| * Identify unconditional branch instructions |
| */ |
| static inline bool isUnconditionalBranch(MIR* insn) |
| { |
| switch (insn->dalvikInsn.opcode) { |
| case OP_RETURN_VOID: |
| case OP_RETURN: |
| case OP_RETURN_WIDE: |
| case OP_RETURN_OBJECT: |
| return true; |
| default: |
| return isGoto(insn); |
| } |
| } |
| |
| /* Split an existing block from the specified code offset into two */ |
| static BasicBlock *splitBlock(CompilationUnit* cUnit, |
| unsigned int codeOffset, |
| BasicBlock* origBlock) |
| { |
| MIR* insn = origBlock->firstMIRInsn; |
| while (insn) { |
| if (insn->offset == codeOffset) break; |
| insn = insn->next; |
| } |
| if (insn == NULL) { |
| LOG(FATAL) << "Break split failed"; |
| } |
| BasicBlock *bottomBlock = oatNewBB(kDalvikByteCode, |
| cUnit->numBlocks++); |
| oatInsertGrowableList(&cUnit->blockList, (intptr_t) bottomBlock); |
| |
| bottomBlock->startOffset = codeOffset; |
| bottomBlock->firstMIRInsn = insn; |
| bottomBlock->lastMIRInsn = origBlock->lastMIRInsn; |
| |
| /* Handle the taken path */ |
| bottomBlock->taken = origBlock->taken; |
| if (bottomBlock->taken) { |
| origBlock->taken = NULL; |
| oatClearBit(bottomBlock->taken->predecessors, origBlock->id); |
| oatSetBit(bottomBlock->taken->predecessors, bottomBlock->id); |
| } |
| |
| /* Handle the fallthrough path */ |
| bottomBlock->needFallThroughBranch = origBlock->needFallThroughBranch; |
| bottomBlock->fallThrough = origBlock->fallThrough; |
| origBlock->fallThrough = bottomBlock; |
| origBlock->needFallThroughBranch = true; |
| oatSetBit(bottomBlock->predecessors, origBlock->id); |
| if (bottomBlock->fallThrough) { |
| oatClearBit(bottomBlock->fallThrough->predecessors, |
| origBlock->id); |
| oatSetBit(bottomBlock->fallThrough->predecessors, |
| bottomBlock->id); |
| } |
| |
| /* Handle the successor list */ |
| if (origBlock->successorBlockList.blockListType != kNotUsed) { |
| bottomBlock->successorBlockList = origBlock->successorBlockList; |
| origBlock->successorBlockList.blockListType = kNotUsed; |
| GrowableListIterator iterator; |
| |
| oatGrowableListIteratorInit(&bottomBlock->successorBlockList.blocks, |
| &iterator); |
| while (true) { |
| SuccessorBlockInfo *successorBlockInfo = |
| (SuccessorBlockInfo *) oatGrowableListIteratorNext(&iterator); |
| if (successorBlockInfo == NULL) break; |
| BasicBlock *bb = successorBlockInfo->block; |
| oatClearBit(bb->predecessors, origBlock->id); |
| oatSetBit(bb->predecessors, bottomBlock->id); |
| } |
| } |
| |
| origBlock->lastMIRInsn = insn->prev; |
| |
| insn->prev->next = NULL; |
| insn->prev = NULL; |
| return bottomBlock; |
| } |
| |
| /* |
| * Given a code offset, find out the block that starts with it. If the offset |
| * is in the middle of an existing block, split it into two. |
| */ |
| static BasicBlock *findBlock(CompilationUnit* cUnit, |
| unsigned int codeOffset, |
| bool split, bool create) |
| { |
| GrowableList* blockList = &cUnit->blockList; |
| BasicBlock* bb; |
| unsigned int i; |
| |
| for (i = 0; i < blockList->numUsed; i++) { |
| bb = (BasicBlock *) blockList->elemList[i]; |
| if (bb->blockType != kDalvikByteCode) continue; |
| if (bb->startOffset == codeOffset) return bb; |
| /* Check if a branch jumps into the middle of an existing block */ |
| if ((split == true) && (codeOffset > bb->startOffset) && |
| (bb->lastMIRInsn != NULL) && |
| (codeOffset <= bb->lastMIRInsn->offset)) { |
| BasicBlock *newBB = splitBlock(cUnit, codeOffset, bb); |
| return newBB; |
| } |
| } |
| if (create) { |
| bb = oatNewBB(kDalvikByteCode, cUnit->numBlocks++); |
| oatInsertGrowableList(&cUnit->blockList, (intptr_t) bb); |
| bb->startOffset = codeOffset; |
| return bb; |
| } |
| return NULL; |
| } |
| |
| /* Dump the CFG into a DOT graph */ |
| void oatDumpCFG(CompilationUnit* cUnit, const char* dirPrefix) |
| { |
| FILE* file; |
| std::string name = art::PrettyMethod(cUnit->method, true); |
| char startOffset[80]; |
| sprintf(startOffset, "_%x", cUnit->entryBlock->fallThrough->startOffset); |
| char* fileName = (char *) oatNew( |
| strlen(dirPrefix) + |
| name.length() + |
| strlen(".dot") + 1, true); |
| sprintf(fileName, "%s%s%s.dot", dirPrefix, name.c_str(), startOffset); |
| |
| /* |
| * Convert the special characters into a filesystem- and shell-friendly |
| * format. |
| */ |
| int i; |
| for (i = strlen(dirPrefix); fileName[i]; i++) { |
| if (fileName[i] == '/') { |
| fileName[i] = '_'; |
| } else if (fileName[i] == ';') { |
| fileName[i] = '#'; |
| } else if (fileName[i] == '$') { |
| fileName[i] = '+'; |
| } else if (fileName[i] == '(' || fileName[i] == ')') { |
| fileName[i] = '@'; |
| } else if (fileName[i] == '<' || fileName[i] == '>') { |
| fileName[i] = '='; |
| } |
| } |
| file = fopen(fileName, "w"); |
| if (file == NULL) { |
| return; |
| } |
| fprintf(file, "digraph G {\n"); |
| |
| fprintf(file, " rankdir=TB\n"); |
| |
| int numReachableBlocks = cUnit->numReachableBlocks; |
| int idx; |
| const GrowableList *blockList = &cUnit->blockList; |
| |
| for (idx = 0; idx < numReachableBlocks; idx++) { |
| int blockIdx = cUnit->dfsOrder.elemList[idx]; |
| BasicBlock *bb = (BasicBlock *) oatGrowableListGetElement(blockList, |
| blockIdx); |
| if (bb == NULL) break; |
| if (bb->blockType == kEntryBlock) { |
| fprintf(file, " entry [shape=Mdiamond];\n"); |
| } else if (bb->blockType == kExitBlock) { |
| fprintf(file, " exit [shape=Mdiamond];\n"); |
| } else if (bb->blockType == kDalvikByteCode) { |
| fprintf(file, " block%04x [shape=record,label = \"{ \\\n", |
| bb->startOffset); |
| const MIR *mir; |
| fprintf(file, " {block id %d\\l}%s\\\n", bb->id, |
| bb->firstMIRInsn ? " | " : " "); |
| for (mir = bb->firstMIRInsn; mir; mir = mir->next) { |
| fprintf(file, " {%04x %s\\l}%s\\\n", mir->offset, |
| mir->ssaRep ? |
| oatFullDisassembler(cUnit, mir) : |
| dexGetOpcodeName(mir->dalvikInsn.opcode), |
| mir->next ? " | " : " "); |
| } |
| fprintf(file, " }\"];\n\n"); |
| } else if (bb->blockType == kExceptionHandling) { |
| char blockName[BLOCK_NAME_LEN]; |
| |
| oatGetBlockName(bb, blockName); |
| fprintf(file, " %s [shape=invhouse];\n", blockName); |
| } |
| |
| char blockName1[BLOCK_NAME_LEN], blockName2[BLOCK_NAME_LEN]; |
| |
| if (bb->taken) { |
| oatGetBlockName(bb, blockName1); |
| oatGetBlockName(bb->taken, blockName2); |
| fprintf(file, " %s:s -> %s:n [style=dotted]\n", |
| blockName1, blockName2); |
| } |
| if (bb->fallThrough) { |
| oatGetBlockName(bb, blockName1); |
| oatGetBlockName(bb->fallThrough, blockName2); |
| fprintf(file, " %s:s -> %s:n\n", blockName1, blockName2); |
| } |
| |
| if (bb->successorBlockList.blockListType != kNotUsed) { |
| fprintf(file, " succ%04x [shape=%s,label = \"{ \\\n", |
| bb->startOffset, |
| (bb->successorBlockList.blockListType == kCatch) ? |
| "Mrecord" : "record"); |
| GrowableListIterator iterator; |
| oatGrowableListIteratorInit(&bb->successorBlockList.blocks, |
| &iterator); |
| SuccessorBlockInfo *successorBlockInfo = |
| (SuccessorBlockInfo *) oatGrowableListIteratorNext(&iterator); |
| |
| int succId = 0; |
| while (true) { |
| if (successorBlockInfo == NULL) break; |
| |
| BasicBlock *destBlock = successorBlockInfo->block; |
| SuccessorBlockInfo *nextSuccessorBlockInfo = |
| (SuccessorBlockInfo *) oatGrowableListIteratorNext(&iterator); |
| |
| fprintf(file, " {<f%d> %04x: %04x\\l}%s\\\n", |
| succId++, |
| successorBlockInfo->key, |
| destBlock->startOffset, |
| (nextSuccessorBlockInfo != NULL) ? " | " : " "); |
| |
| successorBlockInfo = nextSuccessorBlockInfo; |
| } |
| fprintf(file, " }\"];\n\n"); |
| |
| oatGetBlockName(bb, blockName1); |
| fprintf(file, " %s:s -> succ%04x:n [style=dashed]\n", |
| blockName1, bb->startOffset); |
| |
| if (bb->successorBlockList.blockListType == kPackedSwitch || |
| bb->successorBlockList.blockListType == kSparseSwitch) { |
| |
| oatGrowableListIteratorInit(&bb->successorBlockList.blocks, |
| &iterator); |
| |
| succId = 0; |
| while (true) { |
| SuccessorBlockInfo *successorBlockInfo = |
| (SuccessorBlockInfo *) |
| oatGrowableListIteratorNext(&iterator); |
| if (successorBlockInfo == NULL) break; |
| |
| BasicBlock *destBlock = successorBlockInfo->block; |
| |
| oatGetBlockName(destBlock, blockName2); |
| fprintf(file, " succ%04x:f%d:e -> %s:n\n", |
| bb->startOffset, succId++, |
| blockName2); |
| } |
| } |
| } |
| fprintf(file, "\n"); |
| |
| /* |
| * If we need to debug the dominator tree, uncomment the following code |
| */ |
| #if 1 |
| oatGetBlockName(bb, blockName1); |
| fprintf(file, " cfg%s [label=\"%s\", shape=none];\n", |
| blockName1, blockName1); |
| if (bb->iDom) { |
| oatGetBlockName(bb->iDom, blockName2); |
| fprintf(file, " cfg%s:s -> cfg%s:n\n\n", |
| blockName2, blockName1); |
| } |
| #endif |
| } |
| fprintf(file, "}\n"); |
| fclose(file); |
| } |
| |
| /* Verify if all the successor is connected with all the claimed predecessors */ |
| static bool verifyPredInfo(CompilationUnit* cUnit, BasicBlock* bb) |
| { |
| ArenaBitVectorIterator bvIterator; |
| |
| oatBitVectorIteratorInit(bb->predecessors, &bvIterator); |
| while (true) { |
| int blockIdx = oatBitVectorIteratorNext(&bvIterator); |
| if (blockIdx == -1) break; |
| BasicBlock *predBB = (BasicBlock *) |
| oatGrowableListGetElement(&cUnit->blockList, blockIdx); |
| bool found = false; |
| if (predBB->taken == bb) { |
| found = true; |
| } else if (predBB->fallThrough == bb) { |
| found = true; |
| } else if (predBB->successorBlockList.blockListType != kNotUsed) { |
| GrowableListIterator iterator; |
| oatGrowableListIteratorInit(&predBB->successorBlockList.blocks, |
| &iterator); |
| while (true) { |
| SuccessorBlockInfo *successorBlockInfo = |
| (SuccessorBlockInfo *) |
| oatGrowableListIteratorNext(&iterator); |
| if (successorBlockInfo == NULL) break; |
| BasicBlock *succBB = successorBlockInfo->block; |
| if (succBB == bb) { |
| found = true; |
| break; |
| } |
| } |
| } |
| if (found == false) { |
| char blockName1[BLOCK_NAME_LEN], blockName2[BLOCK_NAME_LEN]; |
| oatGetBlockName(bb, blockName1); |
| oatGetBlockName(predBB, blockName2); |
| oatDumpCFG(cUnit, "/sdcard/cfg/"); |
| LOG(FATAL) << "Successor " << blockName1 << "not found from " |
| << blockName2; |
| } |
| } |
| return true; |
| } |
| |
| /* Identify code range in try blocks and set up the empty catch blocks */ |
| static void processTryCatchBlocks(CompilationUnit* cUnit) |
| { |
| |
| UNIMPLEMENTED(WARNING) << "Need to finish processTryCatchBlocks()"; |
| #if 0 |
| const Method* meth = cUnit->method; |
| const DexCode *pCode = dvmGetMethodCode(meth); |
| int triesSize = pCode->triesSize; |
| int i; |
| int offset; |
| |
| if (triesSize == 0) { |
| return; |
| } |
| |
| const DexTry* pTries = dexGetTries(pCode); |
| ArenaBitVector* tryBlockAddr = cUnit->tryBlockAddr; |
| |
| /* Mark all the insn offsets in Try blocks */ |
| for (i = 0; i < triesSize; i++) { |
| const DexTry* pTry = &pTries[i]; |
| /* all in 16-bit units */ |
| int startOffset = pTry->startAddr; |
| int endOffset = startOffset + pTry->insnCount; |
| |
| for (offset = startOffset; offset < endOffset; offset++) { |
| oatSetBit(tryBlockAddr, offset); |
| } |
| } |
| |
| /* Iterate over each of the handlers to enqueue the empty Catch blocks */ |
| offset = dexGetFirstHandlerOffset(pCode); |
| int handlersSize = dexGetHandlersSize(pCode); |
| |
| for (i = 0; i < handlersSize; i++) { |
| DexCatchIterator iterator; |
| dexCatchIteratorInit(&iterator, pCode, offset); |
| |
| for (;;) { |
| DexCatchHandler* handler = dexCatchIteratorNext(&iterator); |
| |
| if (handler == NULL) { |
| break; |
| } |
| |
| /* |
| * Create dummy catch blocks first. Since these are created before |
| * other blocks are processed, "split" is specified as false. |
| */ |
| findBlock(cUnit, handler->address, |
| /* split */ |
| false, |
| /* create */ |
| true); |
| } |
| |
| offset = dexCatchIteratorGetEndOffset(&iterator, pCode); |
| } |
| #endif |
| } |
| |
| /* Process instructions with the kInstrCanBranch flag */ |
| static void processCanBranch(CompilationUnit* cUnit, BasicBlock* curBlock, |
| MIR* insn, int curOffset, int width, int flags, |
| const u2* codePtr, const u2* codeEnd) |
| { |
| int target = curOffset; |
| switch (insn->dalvikInsn.opcode) { |
| case OP_GOTO: |
| case OP_GOTO_16: |
| case OP_GOTO_32: |
| target += (int) insn->dalvikInsn.vA; |
| break; |
| case OP_IF_EQ: |
| case OP_IF_NE: |
| case OP_IF_LT: |
| case OP_IF_GE: |
| case OP_IF_GT: |
| case OP_IF_LE: |
| target += (int) insn->dalvikInsn.vC; |
| break; |
| case OP_IF_EQZ: |
| case OP_IF_NEZ: |
| case OP_IF_LTZ: |
| case OP_IF_GEZ: |
| case OP_IF_GTZ: |
| case OP_IF_LEZ: |
| target += (int) insn->dalvikInsn.vB; |
| break; |
| default: |
| LOG(FATAL) << "Unexpected opcode(" << (int)insn->dalvikInsn.opcode |
| << ") with kInstrCanBranch set"; |
| } |
| BasicBlock *takenBlock = findBlock(cUnit, target, |
| /* split */ |
| true, |
| /* create */ |
| true); |
| curBlock->taken = takenBlock; |
| oatSetBit(takenBlock->predecessors, curBlock->id); |
| |
| /* Always terminate the current block for conditional branches */ |
| if (flags & kInstrCanContinue) { |
| BasicBlock *fallthroughBlock = findBlock(cUnit, |
| curOffset + width, |
| /* |
| * If the method is processed |
| * in sequential order from the |
| * beginning, we don't need to |
| * specify split for continue |
| * blocks. However, this |
| * routine can be called by |
| * compileLoop, which starts |
| * parsing the method from an |
| * arbitrary address in the |
| * method body. |
| */ |
| true, |
| /* create */ |
| true); |
| curBlock->fallThrough = fallthroughBlock; |
| oatSetBit(fallthroughBlock->predecessors, curBlock->id); |
| } else if (codePtr < codeEnd) { |
| /* Create a fallthrough block for real instructions (incl. OP_NOP) */ |
| if (contentIsInsn(codePtr)) { |
| findBlock(cUnit, curOffset + width, |
| /* split */ |
| false, |
| /* create */ |
| true); |
| } |
| } |
| } |
| |
| /* Process instructions with the kInstrCanSwitch flag */ |
| static void processCanSwitch(CompilationUnit* cUnit, BasicBlock* curBlock, |
| MIR* insn, int curOffset, int width, int flags) |
| { |
| u2* switchData= (u2 *) (cUnit->insns + curOffset + |
| insn->dalvikInsn.vB); |
| int size; |
| int* keyTable; |
| int* targetTable; |
| int i; |
| int firstKey; |
| |
| /* |
| * Packed switch data format: |
| * ushort ident = 0x0100 magic value |
| * ushort size number of entries in the table |
| * int first_key first (and lowest) switch case value |
| * int targets[size] branch targets, relative to switch opcode |
| * |
| * Total size is (4+size*2) 16-bit code units. |
| */ |
| if (insn->dalvikInsn.opcode == OP_PACKED_SWITCH) { |
| assert(switchData[0] == kPackedSwitchSignature); |
| size = switchData[1]; |
| firstKey = switchData[2] | (switchData[3] << 16); |
| targetTable = (int *) &switchData[4]; |
| keyTable = NULL; // Make the compiler happy |
| /* |
| * Sparse switch data format: |
| * ushort ident = 0x0200 magic value |
| * ushort size number of entries in the table; > 0 |
| * int keys[size] keys, sorted low-to-high; 32-bit aligned |
| * int targets[size] branch targets, relative to switch opcode |
| * |
| * Total size is (2+size*4) 16-bit code units. |
| */ |
| } else { |
| assert(switchData[0] == kSparseSwitchSignature); |
| size = switchData[1]; |
| keyTable = (int *) &switchData[2]; |
| targetTable = (int *) &switchData[2 + size*2]; |
| firstKey = 0; // To make the compiler happy |
| } |
| |
| if (curBlock->successorBlockList.blockListType != kNotUsed) { |
| LOG(FATAL) << "Successor block list already in use: " << |
| (int)curBlock->successorBlockList.blockListType; |
| } |
| curBlock->successorBlockList.blockListType = |
| (insn->dalvikInsn.opcode == OP_PACKED_SWITCH) ? |
| kPackedSwitch : kSparseSwitch; |
| oatInitGrowableList(&curBlock->successorBlockList.blocks, size); |
| |
| for (i = 0; i < size; i++) { |
| BasicBlock *caseBlock = findBlock(cUnit, curOffset + targetTable[i], |
| /* split */ |
| true, |
| /* create */ |
| true); |
| SuccessorBlockInfo *successorBlockInfo = |
| (SuccessorBlockInfo *) oatNew(sizeof(SuccessorBlockInfo), |
| false); |
| successorBlockInfo->block = caseBlock; |
| successorBlockInfo->key = (insn->dalvikInsn.opcode == OP_PACKED_SWITCH)? |
| firstKey + i : keyTable[i]; |
| oatInsertGrowableList(&curBlock->successorBlockList.blocks, |
| (intptr_t) successorBlockInfo); |
| oatSetBit(caseBlock->predecessors, curBlock->id); |
| } |
| |
| /* Fall-through case */ |
| BasicBlock* fallthroughBlock = findBlock(cUnit, |
| curOffset + width, |
| /* split */ |
| false, |
| /* create */ |
| true); |
| curBlock->fallThrough = fallthroughBlock; |
| oatSetBit(fallthroughBlock->predecessors, curBlock->id); |
| } |
| |
| /* Process instructions with the kInstrCanThrow flag */ |
| static void processCanThrow(CompilationUnit* cUnit, BasicBlock* curBlock, |
| MIR* insn, int curOffset, int width, int flags, |
| ArenaBitVector* tryBlockAddr, const u2* codePtr, |
| const u2* codeEnd) |
| { |
| UNIMPLEMENTED(WARNING) << "Need to complete processCanThrow"; |
| #if 0 |
| const Method* method = cUnit->method; |
| const DexCode* dexCode = dvmGetMethodCode(method); |
| |
| /* In try block */ |
| if (oatIsBitSet(tryBlockAddr, curOffset)) { |
| DexCatchIterator iterator; |
| |
| if (!dexFindCatchHandler(&iterator, dexCode, curOffset)) { |
| LOG(FATAL) << "Catch block not found in dexfile for insn " << |
| curOffset << " in " << method->name; |
| |
| } |
| if (curBlock->successorBlockList.blockListType != kNotUsed) { |
| LOG(FATAL) << "Successor block list already in use: " << |
| (int)curBlock->successorBlockList.blockListType; |
| } |
| curBlock->successorBlockList.blockListType = kCatch; |
| oatInitGrowableList(&curBlock->successorBlockList.blocks, 2); |
| |
| for (;;) { |
| DexCatchHandler* handler = dexCatchIteratorNext(&iterator); |
| |
| if (handler == NULL) { |
| break; |
| } |
| |
| BasicBlock *catchBlock = findBlock(cUnit, handler->address, |
| /* split */ |
| false, |
| /* create */ |
| false); |
| |
| SuccessorBlockInfo *successorBlockInfo = |
| (SuccessorBlockInfo *) oatNew(sizeof(SuccessorBlockInfo), |
| false); |
| successorBlockInfo->block = catchBlock; |
| successorBlockInfo->key = handler->typeIdx; |
| oatInsertGrowableList(&curBlock->successorBlockList.blocks, |
| (intptr_t) successorBlockInfo); |
| oatSetBit(catchBlock->predecessors, curBlock->id); |
| } |
| } else { |
| BasicBlock *ehBlock = oatNewBB(kExceptionHandling, |
| cUnit->numBlocks++); |
| curBlock->taken = ehBlock; |
| oatInsertGrowableList(&cUnit->blockList, (intptr_t) ehBlock); |
| ehBlock->startOffset = curOffset; |
| oatSetBit(ehBlock->predecessors, curBlock->id); |
| } |
| |
| /* |
| * Force the current block to terminate. |
| * |
| * Data may be present before codeEnd, so we need to parse it to know |
| * whether it is code or data. |
| */ |
| if (codePtr < codeEnd) { |
| /* Create a fallthrough block for real instructions (incl. OP_NOP) */ |
| if (contentIsInsn(codePtr)) { |
| BasicBlock *fallthroughBlock = findBlock(cUnit, |
| curOffset + width, |
| /* split */ |
| false, |
| /* create */ |
| true); |
| /* |
| * OP_THROW and OP_THROW_VERIFICATION_ERROR are unconditional |
| * branches. |
| */ |
| if (insn->dalvikInsn.opcode != OP_THROW_VERIFICATION_ERROR && |
| insn->dalvikInsn.opcode != OP_THROW) { |
| curBlock->fallThrough = fallthroughBlock; |
| oatSetBit(fallthroughBlock->predecessors, curBlock->id); |
| } |
| } |
| } |
| #endif |
| } |
| |
| /* |
| * Compile a method. |
| */ |
| bool oatCompileMethod(Method* method, art::InstructionSet insnSet) |
| { |
| bool compiling = true; |
| if (!method->IsStatic()) { |
| compiling = false; |
| } else if ( (method->GetName()->ToModifiedUtf8().find("foo") != std::string::npos) || |
| (method->GetName()->ToModifiedUtf8().find("main") != std::string::npos)) { |
| compiling = false; |
| } |
| |
| if (compiling) { |
| LOG(INFO) << "Compiling " << PrettyMethod(method, true); |
| } else { |
| LOG(INFO) << "not compiling " << PrettyMethod(method, true); |
| return false; |
| } |
| |
| CompilationUnit cUnit; |
| art::ClassLinker* class_linker = art::Runtime::Current()->GetClassLinker(); |
| const art::DexFile& dex_file = class_linker->FindDexFile( |
| method->GetDeclaringClass()->GetDexCache()); |
| const art::DexFile::CodeItem* code_item = |
| dex_file.GetCodeItem(method->code_off_); |
| const u2* codePtr = code_item->insns_; |
| const u2* codeEnd = code_item->insns_ + code_item->insns_size_; |
| int numBlocks = 0; |
| unsigned int curOffset = 0; |
| |
| #if 1 |
| // FIXME - temp 'till properly integrated |
| oatInit(); |
| #endif |
| |
| memset(&cUnit, 0, sizeof(cUnit)); |
| cUnit.method = method; |
| cUnit.instructionSet = (OatInstructionSetType)insnSet; |
| cUnit.insns = code_item->insns_; |
| cUnit.insnsSize = code_item->insns_size_; |
| #if 1 |
| // TODO: Use command-line argument passing mechanism |
| cUnit.printMe = true; |
| cUnit.printMeVerbose = true; |
| cUnit.disableOpt = 0 | |
| (1 << kLoadStoreElimination) | |
| (1 << kLoadHoisting) | |
| (1 << kTrackLiveTemps) | |
| (1 << kSuppressLoads) | |
| (1 << kPromoteRegs) | |
| 0; |
| #endif |
| |
| /* Initialize the block list */ |
| oatInitGrowableList(&cUnit.blockList, 40); |
| |
| /* Initialize the switchTables list */ |
| oatInitGrowableList(&cUnit.switchTables, 4); |
| |
| /* Intialize the fillArrayData list */ |
| oatInitGrowableList(&cUnit.fillArrayData, 4); |
| |
| /* Allocate the bit-vector to track the beginning of basic blocks */ |
| ArenaBitVector *tryBlockAddr = oatAllocBitVector(cUnit.insnsSize, |
| true /* expandable */); |
| cUnit.tryBlockAddr = tryBlockAddr; |
| |
| /* Create the default entry and exit blocks and enter them to the list */ |
| BasicBlock *entryBlock = oatNewBB(kEntryBlock, numBlocks++); |
| BasicBlock *exitBlock = oatNewBB(kExitBlock, numBlocks++); |
| |
| cUnit.entryBlock = entryBlock; |
| cUnit.exitBlock = exitBlock; |
| |
| oatInsertGrowableList(&cUnit.blockList, (intptr_t) entryBlock); |
| oatInsertGrowableList(&cUnit.blockList, (intptr_t) exitBlock); |
| |
| /* Current block to record parsed instructions */ |
| BasicBlock *curBlock = oatNewBB(kDalvikByteCode, numBlocks++); |
| curBlock->startOffset = 0; |
| oatInsertGrowableList(&cUnit.blockList, (intptr_t) curBlock); |
| entryBlock->fallThrough = curBlock; |
| oatSetBit(curBlock->predecessors, entryBlock->id); |
| |
| /* |
| * Store back the number of blocks since new blocks may be created of |
| * accessing cUnit. |
| */ |
| cUnit.numBlocks = numBlocks; |
| |
| /* Identify code range in try blocks and set up the empty catch blocks */ |
| processTryCatchBlocks(&cUnit); |
| |
| /* Parse all instructions and put them into containing basic blocks */ |
| while (codePtr < codeEnd) { |
| MIR *insn = (MIR *) oatNew(sizeof(MIR), true); |
| insn->offset = curOffset; |
| int width = parseInsn(codePtr, &insn->dalvikInsn, false); |
| insn->width = width; |
| |
| /* Terminate when the data section is seen */ |
| if (width == 0) |
| break; |
| |
| oatAppendMIR(curBlock, insn); |
| |
| codePtr += width; |
| int flags = dexGetFlagsFromOpcode(insn->dalvikInsn.opcode); |
| |
| if (flags & kInstrCanBranch) { |
| processCanBranch(&cUnit, curBlock, insn, curOffset, width, flags, |
| codePtr, codeEnd); |
| } else if (flags & kInstrCanReturn) { |
| curBlock->fallThrough = exitBlock; |
| oatSetBit(exitBlock->predecessors, curBlock->id); |
| /* |
| * Terminate the current block if there are instructions |
| * afterwards. |
| */ |
| if (codePtr < codeEnd) { |
| /* |
| * Create a fallthrough block for real instructions |
| * (incl. OP_NOP). |
| */ |
| if (contentIsInsn(codePtr)) { |
| findBlock(&cUnit, curOffset + width, |
| /* split */ |
| false, |
| /* create */ |
| true); |
| } |
| } |
| } else if (flags & kInstrCanThrow) { |
| processCanThrow(&cUnit, curBlock, insn, curOffset, width, flags, |
| tryBlockAddr, codePtr, codeEnd); |
| } else if (flags & kInstrCanSwitch) { |
| processCanSwitch(&cUnit, curBlock, insn, curOffset, width, flags); |
| } |
| curOffset += width; |
| BasicBlock *nextBlock = findBlock(&cUnit, curOffset, |
| /* split */ |
| false, |
| /* create */ |
| false); |
| if (nextBlock) { |
| /* |
| * The next instruction could be the target of a previously parsed |
| * forward branch so a block is already created. If the current |
| * instruction is not an unconditional branch, connect them through |
| * the fall-through link. |
| */ |
| assert(curBlock->fallThrough == NULL || |
| curBlock->fallThrough == nextBlock || |
| curBlock->fallThrough == exitBlock); |
| |
| if ((curBlock->fallThrough == NULL) && |
| (flags & kInstrCanContinue)) { |
| curBlock->fallThrough = nextBlock; |
| oatSetBit(nextBlock->predecessors, curBlock->id); |
| } |
| curBlock = nextBlock; |
| } |
| } |
| |
| if (cUnit.printMe) { |
| oatDumpCompilationUnit(&cUnit); |
| } |
| |
| /* Adjust this value accordingly once inlining is performed */ |
| cUnit.numDalvikRegisters = cUnit.method->num_registers_; |
| |
| |
| /* Verify if all blocks are connected as claimed */ |
| oatDataFlowAnalysisDispatcher(&cUnit, verifyPredInfo, |
| kAllNodes, |
| false /* isIterative */); |
| |
| |
| |
| /* Perform SSA transformation for the whole method */ |
| oatMethodSSATransformation(&cUnit); |
| |
| oatInitializeRegAlloc(&cUnit); // Needs to happen after SSA naming |
| |
| /* Allocate Registers using simple local allocation scheme */ |
| oatSimpleRegAlloc(&cUnit); |
| |
| /* Convert MIR to LIR, etc. */ |
| oatMethodMIR2LIR(&cUnit); |
| |
| // Debugging only |
| //oatDumpCFG(&cUnit, "/sdcard/cfg/"); |
| |
| /* Method is not empty */ |
| if (cUnit.firstLIRInsn) { |
| |
| // mark the targets of switch statement case labels |
| oatProcessSwitchTables(&cUnit); |
| |
| /* Convert LIR into machine code. */ |
| oatAssembleLIR(&cUnit); |
| |
| if (cUnit.printMe) { |
| oatCodegenDump(&cUnit); |
| } |
| } |
| |
| method->SetCode((const art::byte*)&cUnit.codeBuffer[0], |
| cUnit.codeBuffer.size() * 2, art::kThumb2); |
| method->SetFrameSizeInBytes(cUnit.frameSize); |
| method->SetCoreSpillMask(cUnit.coreSpillMask); |
| method->SetFpSpillMask(cUnit.fpSpillMask); |
| // TODO: Transmit mapping table to caller |
| |
| #if 0 |
| oatDumpCFG(&cUnit, "/sdcard/cfg/"); |
| #endif |
| |
| return true; |
| } |
| |
| void oatInit(void) |
| { |
| #if 1 |
| // FIXME - temp hack 'till properly integrated |
| static bool initialized = false; |
| if (initialized) |
| return; |
| initialized = true; |
| LOG(INFO) << "Initializing compiler"; |
| #endif |
| if (!oatArchInit()) { |
| LOG(FATAL) << "Failed to initialize oat"; |
| } |
| if (!oatHeapInit()) { |
| LOG(FATAL) << "Failed to initialize oat heap"; |
| } |
| } |
