Home
last modified time | relevance | path

Searched refs:Probs (Results 1 – 7 of 7) sorted by relevance

/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp1077 Probs.clear(); in releaseMemory()
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()
1154 if (Probs.size() == 0) in setEdgeProbability()
1160 this->Probs[std::make_pair(Src, SuccIdx)] = Probs[SuccIdx]; in setEdgeProbability()
1184 if (this->Probs.find(std::make_pair(Src, 0)) == this->Probs.end()) in copyEdgeProbabilities()
1220 auto MapI = Probs.find(std::make_pair(BB, I)); in eraseBlock()
1221 if (MapI == Probs.end()) { in eraseBlock()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineBasicBlock.cpp388 if (!Probs.empty()) in print()
735 for (auto Prob : Probs) in validateSuccProbs()
751 Probs.push_back(Prob); in addSuccessor()
760 Probs.clear(); in addSuccessorWithoutProb()
796 if (!Probs.empty()) { in removeSuccessor()
798 Probs.erase(WI); in removeSuccessor()
839 if (!Probs.empty()) { in replaceSuccessor()
849 if (!Orig->Probs.empty()) in copySuccessor()
1430 if (Probs.empty()) in getSuccProbability()
1439 for (auto &P : Probs) { in getSuccProbability()
[all …]
H A DMIRPrinter.cpp629 SmallVector<BranchProbability,8> Normalized(MBB.Probs.begin(), in canPredictBranchProbabilities()
630 MBB.Probs.end()); in canPredictBranchProbabilities()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBranchProbabilityInfo.h127 : Probs(std::move(Arg.Probs)), LastF(Arg.LastF), in BranchProbabilityInfo()
135 Probs = std::move(RHS.Probs);
186 const SmallVectorImpl<BranchProbability> &Probs);
320 DenseMap<Edge, BranchProbability> Probs; variable
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h125 std::vector<BranchProbability> Probs;
655 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
702 bool hasSuccessorProbabilities() const { return !Probs.empty(); }
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DIRTranslator.cpp489 SmallVector<BranchProbability, 2> Probs{TProb / 2, FProb}; in findMergedConditions() local
490 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in findMergedConditions()
492 findMergedConditions(BOpOp1, TBB, FBB, TmpBB, SwitchBB, Opc, Probs[0], in findMergedConditions()
493 Probs[1], InvertCond); in findMergedConditions()
522 SmallVector<BranchProbability, 2> Probs{TProb, FProb / 2}; in findMergedConditions() local
523 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in findMergedConditions()
525 findMergedConditions(BOpOp1, TBB, FBB, TmpBB, SwitchBB, Opc, Probs[0], in findMergedConditions()
526 Probs[1], InvertCond); in findMergedConditions()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.cpp2267 SmallVector<BranchProbability, 2> Probs{TProb / 2, FProb}; in FindMergedConditions() local
2268 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
2270 FindMergedConditions(BOpOp1, TBB, FBB, TmpBB, SwitchBB, Opc, Probs[0], in FindMergedConditions()
2271 Probs[1], InvertCond); in FindMergedConditions()
2300 SmallVector<BranchProbability, 2> Probs{TProb, FProb / 2}; in FindMergedConditions() local
2301 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
2303 FindMergedConditions(BOpOp1, TBB, FBB, TmpBB, SwitchBB, Opc, Probs[0], in FindMergedConditions()
2304 Probs[1], InvertCond); in FindMergedConditions()