225     BranchProbability Prob(1, UnreachableEdges.size());  in calcUnreachableHeuristics()  local
227       setEdgeProbability(BB, SuccIdx, Prob);  in calcUnreachableHeuristics()
371     BranchProbability Prob(1, ColdEdges.size());  in calcColdCallHeuristics()  local
373       setEdgeProbability(BB, SuccIdx, Prob);  in calcColdCallHeuristics()
622     auto Prob = TakenProb / numBackEdges;  in calcLoopBranchHeuristics()  local
624       setEdgeProbability(BB, SuccIdx, Prob);  in calcLoopBranchHeuristics()
629     auto Prob = TakenProb / numInEdges;  in calcLoopBranchHeuristics()  local
631       setEdgeProbability(BB, SuccIdx, Prob);  in calcLoopBranchHeuristics()
637     auto Prob = NotTakenProb / numExitingEdges;  in calcLoopBranchHeuristics()  local
639       setEdgeProbability(BB, SuccIdx, Prob);  in calcLoopBranchHeuristics()
645     auto Prob = UnlikelyProb / numUnlikelyEdges;  in calcLoopBranchHeuristics()  local
647       setEdgeProbability(BB, SuccIdx, Prob);  in calcLoopBranchHeuristics()
846     auto Prob = getEdgeProbability(BB, Succ);  in getHotSucc()  local
847     if (Prob > MaxProb) {  in getHotSucc()
848       MaxProb = Prob;  in getHotSucc()
886   auto Prob = BranchProbability::getZero();  in getEdgeProbability()  local
893         Prob += MapI->second;  in getEdgeProbability()
897   return FoundProb ? Prob : BranchProbability(1, succ_num);  in getEdgeProbability()
904                                                BranchProbability Prob) {  in setEdgeProbability()  argument
905   Probs[std::make_pair(Src, IndexInSuccessors)] = Prob;  in setEdgeProbability()
908                     << IndexInSuccessors << " successor probability to " << Prob  in setEdgeProbability()
916   const BranchProbability Prob = getEdgeProbability(Src, Dst);  in printEdgeProbability()  local
918      << " probability is " << Prob  in printEdgeProbability()