Home
last modified time | relevance | path

Searched refs:Probs (Results 1 – 8 of 8) 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/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/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/llvm/lib/CodeGen/
DMachineBasicBlock.cpp323 if (!Probs.empty()) in print()
513 for (auto Prob : Probs) in validateSuccProbs()
519 Probs.size() && in validateSuccProbs()
528 if (!(Probs.empty() && !Successors.empty())) in addSuccessor()
529 Probs.push_back(Prob); in addSuccessor()
538 Probs.clear(); in addSuccessorWithoutProb()
555 if (!Probs.empty()) { in removeSuccessor()
557 Probs.erase(WI); in removeSuccessor()
598 if (!Probs.empty()) { in replaceSuccessor()
624 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.h97 std::vector<BranchProbability> Probs;
462 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
497 bool hasSuccessorProbabilities() const { return !Probs.empty(); }
/external/lzma/DOC/
Dlzma-specification.txt543 CProb Probs[(unsigned)1 << NumBits];
549 INIT_PROBS(Probs);
556 m = (m << 1) + rc->DecodeBit(&Probs[m]);
562 return BitTreeReverseDecode(Probs, NumBits, rc);
/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAGBuilder.cpp1607 SmallVector<BranchProbability, 2> Probs{TProb / 2, FProb}; in FindMergedConditions() local
1608 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
1611 Probs[0], Probs[1]); in FindMergedConditions()
1640 SmallVector<BranchProbability, 2> Probs{TProb, FProb / 2}; in FindMergedConditions() local
1641 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end()); in FindMergedConditions()
1644 Probs[0], Probs[1]); in FindMergedConditions()