Lines Matching defs:Probs

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