Lines Matching refs:BasicBlock
1 //===-- CFG.cpp - BasicBlock analysis --------------------------------------==//
28 SmallVectorImpl<std::pair<const BasicBlock*,const BasicBlock*> > &Result) {
29 const BasicBlock *BB = &F.getEntryBlock();
33 SmallPtrSet<const BasicBlock*, 8> Visited;
34 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack;
35 SmallPtrSet<const BasicBlock*, 8> InStack;
41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back();
42 const BasicBlock *ParentBB = Top.first;
72 unsigned llvm::GetSuccessorNumber(const BasicBlock *BB,
73 const BasicBlock *Succ) {
94 bool llvm::isCriticalEdge(const Instruction *TI, const BasicBlock *Dest,
106 const BasicBlock *FirstPred = *I;
121 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) {
131 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB,
132 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
160 SmallPtrSet<const BasicBlock*, 32> Visited;
162 BasicBlock *BB = Worklist.pop_back_val();
206 bool llvm::isPotentiallyReachable(const BasicBlock *A, const BasicBlock *B,
211 SmallVector<BasicBlock*, 32> Worklist;
212 Worklist.push_back(const_cast<BasicBlock*>(A));
214 return isPotentiallyReachableFromMany(Worklist, const_cast<BasicBlock *>(B),
220 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
225 SmallVector<BasicBlock*, 32> Worklist;
233 BasicBlock *BB = const_cast<BasicBlock *>(A->getParent());
241 for (BasicBlock::const_iterator I = A->getIterator(), E = BB->end(); I != E;
260 Worklist.push_back(const_cast<BasicBlock*>(A->getParent()));
278 Worklist, const_cast<BasicBlock *>(B->getParent()), ExclusionSet, DT, LI);