1203       for (auto *SuccBB : successors(LoopBB))  in buildClonedLoopBlocks()  local
1204         if (auto *ClonedSuccBB = cast_or_null<BasicBlock>(VMap.lookup(SuccBB)))  in buildClonedLoopBlocks()
1211   for (auto *SuccBB : successors(ParentBB)) {  in buildClonedLoopBlocks()  local
1212     if (SuccBB == UnswitchedSuccBB)  in buildClonedLoopBlocks()
1215     auto *ClonedSuccBB = cast_or_null<BasicBlock>(VMap.lookup(SuccBB));  in buildClonedLoopBlocks()
1263     for (auto *SuccBB : successors(ClonedBB))  in buildClonedLoopBlocks()  local
1264       if (SuccSet.insert(SuccBB).second)  in buildClonedLoopBlocks()
1265         DTUpdates.push_back({DominatorTree::Insert, ClonedBB, SuccBB});  in buildClonedLoopBlocks()
1596           for (BasicBlock *SuccBB : successors(ClonedBB))  in deleteDeadClonedBlocks()
1597             SuccBB->removePredecessor(ClonedBB);  in deleteDeadClonedBlocks()
1634       for (BasicBlock *SuccBB : successors(BB)) {  in deleteDeadBlocksFromLoop()
1635         SuccBB->removePredecessor(BB);  in deleteDeadBlocksFromLoop()
1636         DeathCandidates.push_back(SuccBB);  in deleteDeadBlocksFromLoop()
2166   for (auto *SuccBB : llvm::concat<BasicBlock *const>(  in unswitchNontrivialInvariants()  local
2168     if (SuccBB->getUniquePredecessor() ||  in unswitchNontrivialInvariants()
2169         llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {  in unswitchNontrivialInvariants()
2170           return PredBB == ParentBB || DT.dominates(SuccBB, PredBB);  in unswitchNontrivialInvariants()
2172       visitDomSubTree(DT, SuccBB, [&](BasicBlock *BB) {  in unswitchNontrivialInvariants()
2173         DominatingSucc[BB] = SuccBB;  in unswitchNontrivialInvariants()
2192   for (auto *SuccBB : UnswitchedSuccBBs) {  in unswitchNontrivialInvariants()  local
2194     ClonedPHs[SuccBB] = buildClonedLoopBlocks(  in unswitchNontrivialInvariants()
2195         L, LoopPH, SplitBB, ExitBlocks, ParentBB, SuccBB, RetainedSuccBB,  in unswitchNontrivialInvariants()
2262       for (BasicBlock *SuccBB : UnswitchedSuccBBs)  in unswitchNontrivialInvariants()
2264             {DominatorTree::Insert, SplitBB, ClonedPHs.find(SuccBB)->second});  in unswitchNontrivialInvariants()
2275       for (BasicBlock *SuccBB : UnswitchedSuccBBs)  in unswitchNontrivialInvariants()
2276         MSSAU->removeDuplicatePhiEdgesBetween(ParentBB, SuccBB);  in unswitchNontrivialInvariants()
2284       for (BasicBlock *SuccBB : UnswitchedSuccBBs)  in unswitchNontrivialInvariants()
2285         MSSAU->removeEdge(ParentBB, SuccBB);  in unswitchNontrivialInvariants()
2317       for (BasicBlock *SuccBB : UnswitchedSuccBBs)  in unswitchNontrivialInvariants()
2318         DTUpdates.push_back({DominatorTree::Delete, ParentBB, SuccBB});  in unswitchNontrivialInvariants()
2666        llvm::count_if(successors(&TI), [&L](BasicBlock *SuccBB) {  in CalculateUnswitchCostMultiplier()  argument
2667          return L.contains(SuccBB);  in CalculateUnswitchCostMultiplier()
2689         successors(CondBlock), [SkipExitingSuccessors, &L](BasicBlock *SuccBB) {  in CalculateUnswitchCostMultiplier()  argument
2690           return !SkipExitingSuccessors || L.contains(SuccBB);  in CalculateUnswitchCostMultiplier()
2911     for (BasicBlock *SuccBB : successors(&BB)) {  in unswitchBestCondition()
2913       if (!Visited.insert(SuccBB).second)  in unswitchBestCondition()
2925           if (SuccBB == BI.getSuccessor(1))  in unswitchBestCondition()
2928           if (SuccBB == BI.getSuccessor(0))  in unswitchBestCondition()
2931                     SuccBB == BI.getSuccessor(0)) ||  in unswitchBestCondition()
2933                     SuccBB == BI.getSuccessor(1)))  in unswitchBestCondition()
2941       if (SuccBB->getUniquePredecessor() ||  in unswitchBestCondition()
2942           llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {  in unswitchBestCondition()
2943             return PredBB == &BB || DT.dominates(SuccBB, PredBB);  in unswitchBestCondition()
2945         Cost += computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap);  in unswitchBestCondition()