234     auto *SuccBB = PhiBB;  in updatePredecessorProfileMetadata()  local
239         return {PredBB, SuccBB};  in updatePredecessorProfileMetadata()
250       SuccBB = PredBB;  in updatePredecessorProfileMetadata()
1554   for (auto *SuccBB : successors(BB))  in findMostPopularDest()  local
1555     DestPopularity[SuccBB] = 0;  in findMostPopularDest()
1705       for (BasicBlock *SuccBB : successors(BB)) {  in processThreadableEdges()
1706         if (SuccBB == OnlyDest && !SeenFirstBranchToOnlyDest) {  in processThreadableEdges()
1709           SuccBB->removePredecessor(BB, true); // This is unreachable successor.  in processThreadableEdges()
1710           Updates.push_back({DominatorTree::Delete, BB, SuccBB});  in processThreadableEdges()
2197   BasicBlock *SuccBB = CondBr->getSuccessor(PredPredBB == ZeroPred);  in maybethreadThroughTwoBasicBlocks()  local
2200   if (SuccBB == BB) {  in maybethreadThroughTwoBasicBlocks()
2208   if (LoopHeaders.count(BB) || LoopHeaders.count(SuccBB)) {  in maybethreadThroughTwoBasicBlocks()
2211       bool SuccIsHeader = LoopHeaders.count(SuccBB);  in maybethreadThroughTwoBasicBlocks()
2216              << SuccBB->getName()  in maybethreadThroughTwoBasicBlocks()
2240   threadThroughTwoBasicBlocks(PredPredBB, PredBB, BB, SuccBB);  in maybethreadThroughTwoBasicBlocks()
2247                                                     BasicBlock *SuccBB) {  in threadThroughTwoBasicBlocks()  argument
2306   threadEdge(BB, PredsToFactor, SuccBB);  in threadThroughTwoBasicBlocks()
2312     BasicBlock *SuccBB) {  in tryThreadEdge()  argument
2314   if (SuccBB == BB) {  in tryThreadEdge()
2322   if (LoopHeaders.count(BB) || LoopHeaders.count(SuccBB)) {  in tryThreadEdge()
2325       bool SuccIsHeader = LoopHeaders.count(SuccBB);  in tryThreadEdge()
2329           << SuccBB->getName() << "' - it might create an irreducible loop!\n";  in tryThreadEdge()
2342   threadEdge(BB, PredBBs, SuccBB);  in tryThreadEdge()
2351                                    BasicBlock *SuccBB) {  in threadEdge()  argument
2352   assert(SuccBB != BB && "Don't create an infinite loop");  in threadEdge()
2354   assert(!LoopHeaders.count(BB) && !LoopHeaders.count(SuccBB) &&  in threadEdge()
2369                     << "' to '" << SuccBB->getName()  in threadEdge()
2372   LVI->threadEdge(PredBB, BB, SuccBB);  in threadEdge()
2392   BranchInst *NewBI = BranchInst::Create(SuccBB, NewBB);  in threadEdge()
2397   addPHINodeEntriesForMappedBlock(SuccBB, BB, NewBB, ValueMapping);  in threadEdge()
2410   DTU->applyUpdatesPermissive({{DominatorTree::Insert, NewBB, SuccBB},  in threadEdge()
2422   updateBlockFreqAndEdgeWeight(PredBB, BB, NewBB, SuccBB);  in threadEdge()
2495                                                      BasicBlock *SuccBB) {  in updateBlockFreqAndEdgeWeight()  argument
2505   auto BB2SuccBBFreq = BBOrigFreq * BPI->getEdgeProbability(BB, SuccBB);  in updateBlockFreqAndEdgeWeight()
2513     auto SuccFreq = (Succ == SuccBB)  in updateBlockFreqAndEdgeWeight()
2683         if (BasicBlock *SuccBB = dyn_cast<BasicBlock>(New->getOperand(i)))  in duplicateCondBranchOnPHIIntoPred()  local
2684           Updates.push_back({DominatorTree::Insert, PredBB, SuccBB});  in duplicateCondBranchOnPHIIntoPred()