1077   Probs.clear();  in releaseMemory()
1115   auto I = Probs.find(std::make_pair(Src, IndexInSuccessors));  in getEdgeProbability()
1116   assert((Probs.end() == Probs.find(std::make_pair(Src, 0))) ==  in getEdgeProbability()
1117              (Probs.end() == I) &&  in getEdgeProbability()
1121   if (I != Probs.end())  in getEdgeProbability()
1138   if (!Probs.count(std::make_pair(Src, 0)))  in getEdgeProbability()
1144       Prob += Probs.find(std::make_pair(Src, I.getSuccessorIndex()))->second;  in getEdgeProbability()
1151     const BasicBlock *Src, const SmallVectorImpl<BranchProbability> &Probs) {  in setEdgeProbability()  argument
1152   assert(Src->getTerminator()->getNumSuccessors() == Probs.size());  in setEdgeProbability()
1154   if (Probs.size() == 0)  in setEdgeProbability()
1159   for (unsigned SuccIdx = 0; SuccIdx < Probs.size(); ++SuccIdx) {  in setEdgeProbability()
1160     this->Probs[std::make_pair(Src, SuccIdx)] = Probs[SuccIdx];  in setEdgeProbability()
1162                       << " successor probability to " << Probs[SuccIdx]  in setEdgeProbability()
1164     TotalNumerator += Probs[SuccIdx].getNumerator();  in setEdgeProbability()
1172   assert(TotalNumerator <= BranchProbability::getDenominator() + Probs.size());  in setEdgeProbability()
1173   assert(TotalNumerator >= BranchProbability::getDenominator() - Probs.size());  in setEdgeProbability()
1184   if (this->Probs.find(std::make_pair(Src, 0)) == this->Probs.end())  in copyEdgeProbabilities()
1189     auto Prob = this->Probs[std::make_pair(Src, SuccIdx)];  in copyEdgeProbabilities()
1190     this->Probs[std::make_pair(Dst, SuccIdx)] = Prob;  in copyEdgeProbabilities()
1220     auto MapI = Probs.find(std::make_pair(BB, I));  in eraseBlock()
1221     if (MapI == Probs.end()) {  in eraseBlock()
1222       assert(Probs.count(std::make_pair(BB, I + 1)) == 0 &&  in eraseBlock()
1226     Probs.erase(MapI);  in eraseBlock()