159     BranchProbability Prob(1, UnreachableEdges.size());  in calcUnreachableHeuristics()  local
161       setEdgeProbability(BB, SuccIdx, Prob);  in calcUnreachableHeuristics()
287     BranchProbability Prob(1, ColdEdges.size());  in calcColdCallHeuristics()  local
289       setEdgeProbability(BB, SuccIdx, Prob);  in calcColdCallHeuristics()
383     auto Prob = Probs[0] / numBackEdges;  in calcLoopBranchHeuristics()  local
385       setEdgeProbability(BB, SuccIdx, Prob);  in calcLoopBranchHeuristics()
389     auto Prob = Probs[1] / numInEdges;  in calcLoopBranchHeuristics()  local
391       setEdgeProbability(BB, SuccIdx, Prob);  in calcLoopBranchHeuristics()
395     auto Prob = Probs[2] / numExitingEdges;  in calcLoopBranchHeuristics()  local
397       setEdgeProbability(BB, SuccIdx, Prob);  in calcLoopBranchHeuristics()
566     auto Prob = getEdgeProbability(BB, Succ);  in getHotSucc()  local
567     if (Prob > MaxProb) {  in getHotSucc()
568       MaxProb = Prob;  in getHotSucc()
607   auto Prob = BranchProbability::getZero();  in getEdgeProbability()  local
614         Prob += MapI->second;  in getEdgeProbability()
618   return FoundProb ? Prob : BranchProbability(1, succ_num);  in getEdgeProbability()
625                                                BranchProbability Prob) {  in setEdgeProbability()  argument
626   Probs[std::make_pair(Src, IndexInSuccessors)] = Prob;  in setEdgeProbability()
628                << " successor probability to " << Prob << "\n");  in setEdgeProbability()
636   const BranchProbability Prob = getEdgeProbability(Src, Dst);  in printEdgeProbability()  local
638      << " probability is " << Prob  in printEdgeProbability()