Lines Matching defs:BB
36 const BasicBlock *BB = &F.getEntryBlock();
37 if (succ_empty(BB))
44 Visited.insert(BB);
45 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
46 InStack.insert(BB);
54 BB = *I++;
55 if (Visited.insert(BB).second) {
60 if (InStack.count(BB))
61 Result.push_back(std::make_pair(ParentBB, BB));
66 InStack.insert(BB);
67 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
75 /// GetSuccessorNumber - Search for the specified successor of basic block BB
79 unsigned llvm::GetSuccessorNumber(const BasicBlock *BB,
81 const Instruction *Term = BB->getTerminator();
127 // the outermost loop in the loop nest that contains BB.
128 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) {
129 const Loop *L = LI->getLoopFor(BB);
141 for (auto *BB : StopSet) {
142 if (!DT->isReachableFromEntry(BB)) {
159 for (auto *BB : *ExclusionSet) {
160 if (const Loop *L = getOutermostLoop(LI, BB))
176 BasicBlock *BB = Worklist.pop_back_val();
177 if (!Visited.insert(BB).second)
179 if (StopSet.contains(BB))
181 if (ExclusionSet && ExclusionSet->count(BB))
185 return DT->dominates(BB, StopBB);
192 Outer = getOutermostLoop(LI, BB);
196 // excluded block. Clear Outer so we process BB's successors.
215 Worklist.append(succ_begin(BB), succ_end(BB));
294 BasicBlock *BB = const_cast<BasicBlock *>(A->getParent());
298 if (LI && LI->getLoopFor(BB) != nullptr)
307 if (BB->isEntryBlock())
310 // Otherwise, continue doing the normal per-BB CFG walk.
312 Worklist.append(succ_begin(BB), succ_end(BB));