288   for (const MachineBasicBlock *Succ : successors())  in hasEHPadSuccessor()
305   for (const MachineBasicBlock *Succ : successors()) {  in mayHaveInlineAsmBr()
393     // Print the successors  in print()
394     OS.indent(2) << "successors: ";  in print()
697   // A block with no successors has no concerns with fall-through edges.  in updateTerminator()
735     // successors is its layout successor, rewrite it to a fallthrough  in updateTerminator()
789   // no greater than the number of successors.  in validateSuccProbs()
792          "The sum of successors's probabilities exceeds one.");  in validateSuccProbs()
800   if (!(Probs.empty() && !Successors.empty()))  in addSuccessor()
802   Successors.push_back(Succ);  in addSuccessor()
811   Successors.push_back(Succ);  in addSuccessorWithoutProb()
818   succ_iterator OldI = llvm::find(successors(), Old);  in splitSuccessor()
820   assert(!llvm::is_contained(successors(), New) &&  in splitSuccessor()
836   succ_iterator I = find(Successors, Succ);  in removeSuccessor()
842   assert(I != Successors.end() && "Not a current successor!");  in removeSuccessor()
854   return Successors.erase(I);  in removeSuccessor()
959   return is_contained(successors(), MBB);  in isSuccessor()
968   return Successors.size() == 1 ? Successors[0] : nullptr;  in getSingleSuccessor()
1608   assert(Probs.size() == Successors.size() && "Async probability list!");  in getProbabilityIterator()
1609   const size_t index = std::distance(Successors.begin(), I);  in getProbabilityIterator()
1617   assert(Probs.size() == Successors.size() && "Async probability list!");  in getProbabilityIterator()
1618   const size_t index = std::distance(Successors.begin(), I);  in getProbabilityIterator()
1656     for (MachineBasicBlock *S : successors()) {  in computeRegisterLiveness()
1735   // If we see a return block with successors, this must be a funclet return,  in getEndClobberMask()
1736   // which does not preserve any registers. If there are no successors, we don't  in getEndClobberMask()