Lines Matching defs:Probs

1058   Probs.clear();
1096   auto I = Probs.find(std::make_pair(Src, IndexInSuccessors));
1097   assert((Probs.end() == Probs.find(std::make_pair(Src, 0))) ==
1098              (Probs.end() == I) &&
1102   if (I != Probs.end())
1119   if (!Probs.count(std::make_pair(Src, 0)))
1125       Prob += Probs.find(std::make_pair(Src, I.getSuccessorIndex()))->second;
1132     const BasicBlock *Src, const SmallVectorImpl<BranchProbability> &Probs) {
1133   assert(Src->getTerminator()->getNumSuccessors() == Probs.size());
1135   if (Probs.size() == 0)
1140   for (unsigned SuccIdx = 0; SuccIdx < Probs.size(); ++SuccIdx) {
1141     this->Probs[std::make_pair(Src, SuccIdx)] = Probs[SuccIdx];
1143                       << " successor probability to " << Probs[SuccIdx]
1145     TotalNumerator += Probs[SuccIdx].getNumerator();
1150   // Instead, every single probability in Probs must be as accurate as possible.
1152   // should be within Probs.size / BranchProbability::getDenominator.
1153   assert(TotalNumerator <= BranchProbability::getDenominator() + Probs.size());
1154   assert(TotalNumerator >= BranchProbability::getDenominator() - Probs.size());
1165   if (!this->Probs.contains(std::make_pair(Src, 0)))
1170     auto Prob = this->Probs[std::make_pair(Src, SuccIdx)];
1171     this->Probs[std::make_pair(Dst, SuccIdx)] = Prob;
1179   auto It0 = Probs.find(std::make_pair(Src, 0));
1180   if (It0 == Probs.end())
1182   auto It1 = Probs.find(std::make_pair(Src, 1));
1183   assert(It1 != Probs.end());
1214     auto MapI = Probs.find(std::make_pair(BB, I));
1215     if (MapI == Probs.end()) {
1216       assert(Probs.count(std::make_pair(BB, I + 1)) == 0 &&
1220     Probs.erase(MapI);