/external/llvm/lib/Transforms/Utils/ |
SimplifyInstructions.cpp | 52 for (df_iterator<BasicBlock*> DI = df_begin(&F.getEntryBlock()), 53 DE = df_end(&F.getEntryBlock()); DI != DE; ++DI)
|
DemoteRegToStack.cpp | 47 F->getEntryBlock().begin()); 125 F->getEntryBlock().begin());
|
Mem2Reg.cpp | 60 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
|
CloneFunction.cpp | 66 BB != &BB->getParent()->getEntryBlock(); 372 CloneWorklist.push_back(&OldFunc->getEntryBlock()); 508 Function::iterator I = cast<BasicBlock>(VMap[&OldFunc->getEntryBlock()]);
|
/external/llvm/include/llvm/Support/ |
CFG.h | 311 static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); } 320 static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();} 337 return &G.Graph->getEntryBlock(); 343 return &G.Graph->getEntryBlock();
|
/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 | 165 BB != &BB->getParent()->getEntryBlock()) { 181 BB != &BB->getParent()->getEntryBlock() && 628 BB != &BB->getParent()->getEntryBlock()) 644 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock(); 648 if (isEntry && BB != &BB->getParent()->getEntryBlock()) 649 BB->moveBefore(&BB->getParent()->getEntryBlock()); [all...] |
CodeGenPrepare.cpp | 291 bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock(); 294 if (isEntry && BB != &BB->getParent()->getEntryBlock()) 295 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);
|
ProfileVerifierPass.cpp | 155 printDebugInfo(&(DI->BB->getParent()->getEntryBlock())); 358 const BType *entry = &F.getEntryBlock();
|
PathProfileVerifier.cpp | 128 if (currentPath->getFirstBlockInPath() == &F->getEntryBlock())
|
MemoryDependenceAnalysis.cpp | 233 if (BB != &BB->getParent()->getEntryBlock()) 484 if (BB != &BB->getParent()->getEntryBlock()) 516 if (QueryParent != &QueryParent->getParent()->getEntryBlock()) 670 } else if (DirtyBB != &DirtyBB->getParent()->getEntryBlock()) { [all...] |
SparsePropagation.cpp | 293 MarkBlockExecutable(&F.getEntryBlock());
|
RegionInfo.cpp | 623 BasicBlock *entry = &(F.getEntryBlock()); 689 BasicBlock *BB = &F.getEntryBlock(); 700 TopLevelRegion = new Region(&F.getEntryBlock(), 0, this, DT, 0);
|
ProfileInfo.cpp | 148 double Count = getExecutionCount(&F->getEntryBlock()); 636 // if (getExecutionCount(&(F->getEntryBlock())) == 0) { 675 const BasicBlock *BB = &(F->getEntryBlock()); 713 ReturnWeight = getExecutionCount(&(F->getEntryBlock())) - ReturnWeight; [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/llvm/lib/CodeGen/ |
StackProtector.cpp | 180 BasicBlock &Entry = F->getEntryBlock();
|
GCStrategy.cpp | 177 BasicBlock::iterator IP = F.getEntryBlock().begin();
|
/external/llvm/lib/Transforms/IPO/ |
LoopExtractor.cpp | 100 L->getHeader()->getParent()->getEntryBlock().getTerminator();
|