HomeSort by relevance Sort by last modified time
    Searched refs:getEntryBlock (Results 1 - 25 of 66) sorted by null

1 2 3

  /external/llvm/lib/Transforms/Utils/
SimplifyInstructions.cpp 55 for (df_iterator<BasicBlock*> DI = df_begin(&F.getEntryBlock()),
56 DE = df_end(&F.getEntryBlock()); DI != DE; ++DI)
DemoteRegToStack.cpp 37 F->getEntryBlock().begin());
113 F->getEntryBlock().begin());
Mem2Reg.cpp 60 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
CloneFunction.cpp 68 BB != &BB->getParent()->getEntryBlock();
383 CloneWorklist.push_back(&OldFunc->getEntryBlock());
515 Function::iterator Begin = cast<BasicBlock>(VMap[&OldFunc->getEntryBlock()]);
566 for (Function::iterator I = cast<BasicBlock>(VMap[&OldFunc->getEntryBlock()]),
  /external/llvm/include/llvm/Support/
CFG.h 317 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); }
327 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();}
345 return &G.Graph->getEntryBlock();
351 return &G.Graph->getEntryBlock();
  /external/llvm/lib/Target/Hexagon/
HexagonRemoveSZExtArgs.cpp 65 Instruction* First = F.getEntryBlock().begin();
  /external/llvm/lib/Transforms/Instrumentation/
EdgeProfiling.cpp 88 IncrementCounterInBlock(&F->getEntryBlock(), i++, Counters);
OptimalEdgeProfiling.cpp 149 BasicBlock *entry = &(F->getEntryBlock());
  /external/llvm/lib/Transforms/Scalar/
Reg2Mem.cpp 75 BasicBlock *BBEntry = &F.getEntryBlock();
TailRecursionElimination.cpp 142 if (BB != &BB->getParent()->getEntryBlock() ||
391 if (BB == &F->getEntryBlock() &&
476 OldEntry = &F->getEntryBlock();
545 if (P == &F->getEntryBlock())
JumpThreading.cpp 170 BB != &BB->getParent()->getEntryBlock()) {
186 BB != &BB->getParent()->getEntryBlock() &&
633 BB != &BB->getParent()->getEntryBlock())
649 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock();
653 if (isEntry && BB != &BB->getParent()->getEntryBlock())
654 BB->moveBefore(&BB->getParent()->getEntryBlock());
    [all...]
  /external/llvm/include/llvm/
Function.h 337 const BasicBlock &getEntryBlock() const { return front(); }
338 BasicBlock &getEntryBlock() { return front(); }
  /external/llvm/lib/Analysis/
ProfileInfoLoaderPass.cpp 164 readEdge(getEdge(0,&F->getEntryBlock()), Counters);
185 readEdge(getEdge(0,&F->getEntryBlock()), Counters);
BranchProbabilityInfo.cpp 386 for (po_iterator<BasicBlock *> I = po_begin(&F.getEntryBlock()),
387 E = po_end(&F.getEntryBlock());
ProfileVerifierPass.cpp 155 printDebugInfo(&(DI->BB->getParent()->getEntryBlock()));
358 const BType *entry = &F.getEntryBlock();
PathProfileVerifier.cpp 128 if (currentPath->getFirstBlockInPath() == &F->getEntryBlock())
MemoryDependenceAnalysis.cpp 241 if (BB != &BB->getParent()->getEntryBlock())
588 if (BB != &BB->getParent()->getEntryBlock())
620 if (QueryParent != &QueryParent->getParent()->getEntryBlock())
774 } else if (DirtyBB != &DirtyBB->getParent()->getEntryBlock()) {
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/
SsaMethod.java 258 public SsaBasicBlock getEntryBlock() {
372 blockList.add(this.getEntryBlock());
761 SsaBasicBlock rootBlock = reverse ? getExitBlock() : getEntryBlock();
800 stack.add(getEntryBlock());
ConstCollector.java 98 SsaBasicBlock start = ssaMeth.getEntryBlock();
118 SsaBasicBlock entryBlock = ssaMeth.getEntryBlock();
Dominators.java 172 ? meth.getExitBlock() : meth.getEntryBlock();
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
SsaMethod.java 258 public SsaBasicBlock getEntryBlock() {
372 blockList.add(this.getEntryBlock());
761 SsaBasicBlock rootBlock = reverse ? getExitBlock() : getEntryBlock();
800 stack.add(getEntryBlock());
ConstCollector.java 98 SsaBasicBlock start = ssaMeth.getEntryBlock();
118 SsaBasicBlock entryBlock = ssaMeth.getEntryBlock();
Dominators.java 172 ? meth.getExitBlock() : meth.getEntryBlock();
  /external/llvm/lib/CodeGen/
StackProtector.cpp 175 BasicBlock &Entry = F->getEntryBlock();
  /external/llvm/lib/Transforms/IPO/
LoopExtractor.cpp 101 L->getHeader()->getParent()->getEntryBlock().getTerminator();

Completed in 3900 milliseconds

1 2 3