Home
last modified time | relevance | path

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

/external/llvm/unittests/Support/
DBranchProbabilityTest.cpp293 SmallVector<BranchProbability, 2> Probs{{0, 1}, {0, 1}}; in TEST() local
294 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in TEST()
295 EXPECT_EQ(BranchProbability::getDenominator() / 2, Probs[0].getNumerator()); in TEST()
296 EXPECT_EQ(BranchProbability::getDenominator() / 2, Probs[1].getNumerator()); in TEST()
299 SmallVector<BranchProbability, 2> Probs{{0, 1}, {1, 1}}; in TEST() local
300 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in TEST()
301 EXPECT_EQ(0u, Probs[0].getNumerator()); in TEST()
302 EXPECT_EQ(BranchProbability::getDenominator(), Probs[1].getNumerator()); in TEST()
305 SmallVector<BranchProbability, 2> Probs{{1, 100}, {1, 100}}; in TEST() local
306 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in TEST()
[all …]
/external/deqp/modules/gles2/stress/
Des2sLongRunningTests.cpp54 typedef gls::LongStressCase::FeatureProbabilities Probs; in init() typedef
79 const Probs probs; in init()
80 …Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()… in init()
86 Probs().pReuploadBuffer(1.0f)), in init()
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)), in init()
96 Probs().pDeleteBuffer(1.0f)), in init()
101 Probs().pWastefulBufferMemoryUsage(1.0f)), in init()
106 Probs().pSeparateAttribBuffers(1.0f).pWastefulBufferMemoryUsage(1.0f)) in init()
151 const Probs probs; in init()
152 …ar* const name_, const char* const desc_, int numTextures_, const Probs& probs_ = Probs()) : name(… in init()
[all …]
/external/deqp/modules/gles3/stress/
Des3sLongRunningTests.cpp54 typedef gls::LongStressCase::FeatureProbabilities Probs; in init() typedef
79 const Probs probs; in init()
80 …Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()… in init()
86 Probs().pReuploadBuffer(1.0f)), in init()
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)), in init()
96 Probs().pDeleteBuffer(1.0f)), in init()
101 Probs().pWastefulBufferMemoryUsage(1.0f)), in init()
106 Probs().pSeparateAttribBuffers(1.0f).pWastefulBufferMemoryUsage(1.0f)) in init()
151 const Probs probs; in init()
152 …ar* const name_, const char* const desc_, int numTextures_, const Probs& probs_ = Probs()) : name(… in init()
[all …]
/external/llvm/include/llvm/Analysis/
DBranchProbabilityInfo.h49 : Probs(std::move(Arg.Probs)), LastF(Arg.LastF), in BranchProbabilityInfo()
55 Probs = std::move(RHS.Probs);
135 DenseMap<Edge, BranchProbability> Probs; variable
/external/llvm/lib/Analysis/
DBranchProbabilityInfo.cpp369 BranchProbability Probs[] = {BranchProbability::getZero(), in calcLoopBranchHeuristics() local
376 Probs[0] = BranchProbability(LBH_TAKEN_WEIGHT, Denom); in calcLoopBranchHeuristics()
378 Probs[1] = BranchProbability(LBH_TAKEN_WEIGHT, Denom); in calcLoopBranchHeuristics()
380 Probs[2] = BranchProbability(LBH_NONTAKEN_WEIGHT, Denom); in calcLoopBranchHeuristics()
383 auto Prob = Probs[0] / numBackEdges; in calcLoopBranchHeuristics()
389 auto Prob = Probs[1] / numInEdges; in calcLoopBranchHeuristics()
395 auto Prob = Probs[2] / numExitingEdges; in calcLoopBranchHeuristics()
536 Probs.clear(); in releaseMemory()
587 auto I = Probs.find(std::make_pair(Src, IndexInSuccessors)); in getEdgeProbability()
589 if (I != Probs.end()) in getEdgeProbability()
[all …]
/external/llvm/lib/CodeGen/
DMachineBasicBlock.cpp313 if (!Probs.empty()) in print()
516 for (auto Prob : Probs) in validateSuccProbs()
522 Probs.size() && in validateSuccProbs()
531 if (!(Probs.empty() && !Successors.empty())) in addSuccessor()
532 Probs.push_back(Prob); in addSuccessor()
541 Probs.clear(); in addSuccessorWithoutProb()
558 if (!Probs.empty()) { in removeSuccessor()
560 Probs.erase(WI); in removeSuccessor()
601 if (!Probs.empty()) { in replaceSuccessor()
627 if (!FromMBB->Probs.empty()) { in transferSuccessors()
[all …]
/external/lzma/CPP/7zip/Bundles/LzmaSpec/
DLzmaSpec.cpp240 CProb Probs[(unsigned)1 << NumBits]; member in CBitTreeDecoder
246 INIT_PROBS(Probs); in Init()
253 m = (m << 1) + rc->DecodeBit(&Probs[m]); in Decode()
259 return BitTreeReverseDecode(Probs, NumBits, rc); in ReverseDecode()
/external/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h99 std::vector<BranchProbability> Probs;
401 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
436 bool hasSuccessorProbabilities() const { return !Probs.empty(); }
/external/lzma/DOC/
Dlzma-specification.txt544 CProb Probs[(unsigned)1 << NumBits];
550 INIT_PROBS(Probs);
557 m = (m << 1) + rc->DecodeBit(&Probs[m]);
563 return BitTreeReverseDecode(Probs, NumBits, rc);
/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAGBuilder.cpp1712 SmallVector<BranchProbability, 2> Probs{TProb / 2, FProb}; in FindMergedConditions() local
1713 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
1716 Probs[0], Probs[1]); in FindMergedConditions()
1745 SmallVector<BranchProbability, 2> Probs{TProb, FProb / 2}; in FindMergedConditions() local
1746 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
1749 Probs[0], Probs[1]); in FindMergedConditions()