Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineBasicBlock.cpp356 if (!Probs.empty()) in print()
635 for (auto Prob : Probs) in validateSuccProbs()
641 Probs.size() && in validateSuccProbs()
651 Probs.push_back(Prob); in addSuccessor()
660 Probs.clear(); in addSuccessorWithoutProb()
696 if (!Probs.empty()) { in removeSuccessor()
698 Probs.erase(WI); in removeSuccessor()
739 if (!Probs.empty()) { in replaceSuccessor()
749 if (Orig->Probs.empty()) in copySuccessor()
1321 if (Probs.empty()) in getSuccProbability()
[all …]
H A DMIRPrinter.cpp531 SmallVector<BranchProbability,8> Normalized(MBB.Probs.begin(), in canPredictBranchProbabilities()
532 MBB.Probs.end()); in canPredictBranchProbabilities()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DBranchProbabilityInfo.h63 : Probs(std::move(Arg.Probs)), LastF(Arg.LastF), in BranchProbabilityInfo()
72 Probs = std::move(RHS.Probs);
180 DenseMap<Edge, BranchProbability> Probs; variable
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp816 Probs.clear(); in releaseMemory()
867 auto I = Probs.find(std::make_pair(Src, IndexInSuccessors)); in getEdgeProbability()
869 if (I != Probs.end()) in getEdgeProbability()
890 auto MapI = Probs.find(std::make_pair(Src, I.getSuccessorIndex())); in getEdgeProbability()
891 if (MapI != Probs.end()) { in getEdgeProbability()
905 Probs[std::make_pair(Src, IndexInSuccessors)] = Prob; in setEdgeProbability()
925 for (auto I = Probs.begin(), E = Probs.end(); I != E; ++I) { in eraseBlock()
928 Probs.erase(Key); in eraseBlock()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h96 std::vector<BranchProbability> Probs;
448 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
495 bool hasSuccessorProbabilities() const { return !Probs.empty(); }
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.cpp1921 SmallVector<BranchProbability, 2> Probs{TProb / 2, FProb}; in FindMergedConditions() local
1922 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
1925 Probs[0], Probs[1], InvertCond); in FindMergedConditions()
1954 SmallVector<BranchProbability, 2> Probs{TProb, FProb / 2}; in FindMergedConditions() local
1955 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
1958 Probs[0], Probs[1], InvertCond); in FindMergedConditions()