Lines Matching refs:SuccBB
1113 for (auto *SuccBB : successors(LoopBB))
1114 if (auto *ClonedSuccBB = cast_or_null<BasicBlock>(VMap.lookup(SuccBB)))
1121 for (auto *SuccBB : successors(ParentBB)) {
1122 if (SuccBB == UnswitchedSuccBB)
1125 auto *ClonedSuccBB = cast_or_null<BasicBlock>(VMap.lookup(SuccBB));
1160 for (auto *SuccBB : successors(ClonedBB))
1161 if (SuccSet.insert(SuccBB).second)
1162 DTUpdates.push_back({DominatorTree::Insert, ClonedBB, SuccBB});
1493 for (BasicBlock *SuccBB : successors(ClonedBB))
1494 SuccBB->removePredecessor(ClonedBB);
1529 for (BasicBlock *SuccBB : successors(BB)) {
1530 SuccBB->removePredecessor(BB);
1531 DeathCandidates.push_back(SuccBB);
2040 for (auto *SuccBB : llvm::concat<BasicBlock *const>(
2042 if (SuccBB->getUniquePredecessor() ||
2043 llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {
2044 return PredBB == ParentBB || DT.dominates(SuccBB, PredBB);
2046 visitDomSubTree(DT, SuccBB, [&](BasicBlock *BB) {
2047 DominatingSucc[BB] = SuccBB;
2066 for (auto *SuccBB : UnswitchedSuccBBs) {
2068 ClonedPHs[SuccBB] = buildClonedLoopBlocks(
2069 L, LoopPH, SplitBB, ExitBlocks, ParentBB, SuccBB, RetainedSuccBB,
2108 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2110 {DominatorTree::Insert, SplitBB, ClonedPHs.find(SuccBB)->second});
2121 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2122 MSSAU->removeDuplicatePhiEdgesBetween(ParentBB, SuccBB);
2130 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2131 MSSAU->removeEdge(ParentBB, SuccBB);
2163 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2164 DTUpdates.push_back({DominatorTree::Delete, ParentBB, SuccBB});
2503 llvm::count_if(successors(&TI), [&L](BasicBlock *SuccBB) {
2504 return L.contains(SuccBB);
2526 successors(CondBlock), [SkipExitingSuccessors, &L](BasicBlock *SuccBB) {
2527 return !SkipExitingSuccessors || L.contains(SuccBB);
2716 for (BasicBlock *SuccBB : successors(&BB)) {
2718 if (!Visited.insert(SuccBB).second)
2729 if (SuccBB == BI.getSuccessor(1))
2736 if (SuccBB == BI.getSuccessor(0))
2745 if (SuccBB->getUniquePredecessor() ||
2746 llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {
2747 return PredBB == &BB || DT.dominates(SuccBB, PredBB);
2749 Cost -= computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap);