Lines Matching defs:SuccBB
603 auto *SuccBB = Case.getCaseSuccessor();
604 if (!L.contains(SuccBB) &&
605 areLoopExitPHIsLoopInvariant(L, *ParentBB, *SuccBB))
1096 for (auto *SuccBB : successors(LoopBB))
1097 if (auto *ClonedSuccBB = cast_or_null<BasicBlock>(VMap.lookup(SuccBB)))
1104 for (auto *SuccBB : successors(ParentBB)) {
1105 if (SuccBB == UnswitchedSuccBB)
1108 auto *ClonedSuccBB = cast_or_null<BasicBlock>(VMap.lookup(SuccBB));
1143 for (auto *SuccBB : successors(ClonedBB))
1144 if (SuccSet.insert(SuccBB).second)
1145 DTUpdates.push_back({DominatorTree::Insert, ClonedBB, SuccBB});
1476 for (BasicBlock *SuccBB : successors(ClonedBB))
1477 SuccBB->removePredecessor(ClonedBB);
1512 for (BasicBlock *SuccBB : successors(BB)) {
1513 SuccBB->removePredecessor(BB);
1514 DeathCandidates.push_back(SuccBB);
2018 for (auto *SuccBB : llvm::concat<BasicBlock *const>(
2020 if (SuccBB->getUniquePredecessor() ||
2021 llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {
2022 return PredBB == ParentBB || DT.dominates(SuccBB, PredBB);
2024 visitDomSubTree(DT, SuccBB, [&](BasicBlock *BB) {
2025 DominatingSucc[BB] = SuccBB;
2044 for (auto *SuccBB : UnswitchedSuccBBs) {
2046 ClonedPHs[SuccBB] = buildClonedLoopBlocks(
2047 L, LoopPH, SplitBB, ExitBlocks, ParentBB, SuccBB, RetainedSuccBB,
2086 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2088 {DominatorTree::Insert, SplitBB, ClonedPHs.find(SuccBB)->second});
2099 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2100 MSSAU->removeDuplicatePhiEdgesBetween(ParentBB, SuccBB);
2108 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2109 MSSAU->removeEdge(ParentBB, SuccBB);
2141 for (BasicBlock *SuccBB : UnswitchedSuccBBs)
2142 DTUpdates.push_back({DominatorTree::Delete, ParentBB, SuccBB});
2481 llvm::count_if(successors(&TI), [&L](BasicBlock *SuccBB) {
2482 return L.contains(SuccBB);
2504 successors(CondBlock), [SkipExitingSuccessors, &L](BasicBlock *SuccBB) {
2505 return !SkipExitingSuccessors || L.contains(SuccBB);
2694 for (BasicBlock *SuccBB : successors(&BB)) {
2696 if (!Visited.insert(SuccBB).second)
2707 if (SuccBB == BI.getSuccessor(1))
2714 if (SuccBB == BI.getSuccessor(0))
2723 if (SuccBB->getUniquePredecessor() ||
2724 llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {
2725 return PredBB == &BB || DT.dominates(SuccBB, PredBB);
2727 Cost -= computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap);