1059   Probs.clear();  in releaseMemory()
1097   auto I = Probs.find(std::make_pair(Src, IndexInSuccessors));  in getEdgeProbability()
1098   assert((Probs.end() == Probs.find(std::make_pair(Src, 0))) ==  in getEdgeProbability()
1099              (Probs.end() == I) &&  in getEdgeProbability()
1103   if (I != Probs.end())  in getEdgeProbability()
1120   if (!Probs.count(std::make_pair(Src, 0)))  in getEdgeProbability()
1126       Prob += Probs.find(std::make_pair(Src, I.getSuccessorIndex()))->second;  in getEdgeProbability()
1133     const BasicBlock *Src, const SmallVectorImpl<BranchProbability> &Probs) {  in setEdgeProbability()  argument
1134   assert(Src->getTerminator()->getNumSuccessors() == Probs.size());  in setEdgeProbability()
1136   if (Probs.size() == 0)  in setEdgeProbability()
1141   for (unsigned SuccIdx = 0; SuccIdx < Probs.size(); ++SuccIdx) {  in setEdgeProbability()
1142     this->Probs[std::make_pair(Src, SuccIdx)] = Probs[SuccIdx];  in setEdgeProbability()
1144                       << " successor probability to " << Probs[SuccIdx]  in setEdgeProbability()
1146     TotalNumerator += Probs[SuccIdx].getNumerator();  in setEdgeProbability()
1154   assert(TotalNumerator <= BranchProbability::getDenominator() + Probs.size());  in setEdgeProbability()
1155   assert(TotalNumerator >= BranchProbability::getDenominator() - Probs.size());  in setEdgeProbability()
1166   if (!this->Probs.contains(std::make_pair(Src, 0)))  in copyEdgeProbabilities()
1171     auto Prob = this->Probs[std::make_pair(Src, SuccIdx)];  in copyEdgeProbabilities()
1172     this->Probs[std::make_pair(Dst, SuccIdx)] = Prob;  in copyEdgeProbabilities()
1180   if (!Probs.contains(std::make_pair(Src, 0)))  in swapSuccEdgesProbabilities()
1182   assert(Probs.contains(std::make_pair(Src, 1)));  in swapSuccEdgesProbabilities()
1183   std::swap(Probs[std::make_pair(Src, 0)], Probs[std::make_pair(Src, 1)]);  in swapSuccEdgesProbabilities()
1213     auto MapI = Probs.find(std::make_pair(BB, I));  in eraseBlock()
1214     if (MapI == Probs.end()) {  in eraseBlock()
1215       assert(Probs.count(std::make_pair(BB, I + 1)) == 0 &&  in eraseBlock()
1219     Probs.erase(MapI);  in eraseBlock()