384       if (!Probs.empty())  in print()
389     if (!Probs.empty() && IsStandalone) {  in print()
736   for (auto Prob : Probs)  in validateSuccProbs()
742              Probs.size() &&  in validateSuccProbs()
751   if (!(Probs.empty() && !Successors.empty()))  in addSuccessor()
752     Probs.push_back(Prob);  in addSuccessor()
761   Probs.clear();  in addSuccessorWithoutProb()
779   addSuccessor(New, Probs.empty() ? BranchProbability::getUnknown()  in splitSuccessor()
797   if (!Probs.empty()) {  in removeSuccessor()
799     Probs.erase(WI);  in removeSuccessor()
840   if (!Probs.empty()) {  in replaceSuccessor()
850   if (!Orig->Probs.empty())  in copySuccessor()
875     if (!FromMBB->Probs.empty()) {  in transferSuccessors()
876       auto Prob = *FromMBB->Probs.begin();  in transferSuccessors()
892     if (!FromMBB->Probs.empty()) {  in transferSuccessorsAndUpdatePHIs()
893       auto Prob = *FromMBB->Probs.begin();  in transferSuccessorsAndUpdatePHIs()
1430   if (Probs.empty())  in getSuccProbability()
1439     for (const auto &P : Probs) {  in getSuccProbability()
1445     return Sum.getCompl() / (Probs.size() - KnownProbNum);  in getSuccProbability()
1454   if (Probs.empty())  in setSuccProbability()
1463   assert(Probs.size() == Successors.size() && "Async probability list!");  in getProbabilityIterator()
1465   assert(index < Probs.size() && "Not a current successor!");  in getProbabilityIterator()
1466   return Probs.begin() + index;  in getProbabilityIterator()
1472   assert(Probs.size() == Successors.size() && "Async probability list!");  in getProbabilityIterator()
1474   assert(index < Probs.size() && "Not a current successor!");  in getProbabilityIterator()
1475   return Probs.begin() + index;  in getProbabilityIterator()