| /external/deqp/modules/gles2/stress/ |
| es2sLongRunningTests.cpp | 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
79 const Probs probs; member in struct:deqp::gles2::Stress::Case
80 Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles2::Stress::Case
208 const Probs probs; member in struct:deqp::gles2::Stress::Case
257 const Probs probs; member in struct:deqp::gles2::Stress::Case
[all...] |
| /external/deqp/modules/gles3/stress/ |
| es3sLongRunningTests.cpp | 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
79 const Probs probs; member in struct:deqp::gles3::Stress::Case
80 Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles3::Stress::Case
208 const Probs probs; member in struct:deqp::gles3::Stress::Case
257 const Probs probs; member in struct:deqp::gles3::Stress::Case
[all...] |
| /external/llvm/unittests/Support/ |
| BranchProbabilityTest.cpp | 293 SmallVector<BranchProbability, 2> Probs{{0, 1}, {0, 1}};
294 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
295 EXPECT_EQ(BranchProbability::getDenominator() / 2, Probs[0].getNumerator());
296 EXPECT_EQ(BranchProbability::getDenominator() / 2, Probs[1].getNumerator());
299 SmallVector<BranchProbability, 2> Probs{{0, 1}, {1, 1}};
300 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
301 EXPECT_EQ(0u, Probs[0].getNumerator());
302 EXPECT_EQ(BranchProbability::getDenominator(), Probs[1].getNumerator())
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineBasicBlock.cpp | 323 if (!Probs.empty())
513 for (auto Prob : Probs)
519 Probs.size() &&
528 if (!(Probs.empty() && !Successors.empty()))
529 Probs.push_back(Prob);
538 Probs.clear();
555 if (!Probs.empty()) {
557 Probs.erase(WI);
598 if (!Probs.empty()) {
624 if (!FromMBB->Probs.empty())
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 97 std::vector<BranchProbability> Probs;
462 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
497 bool hasSuccessorProbabilities() const { return !Probs.empty(); }
[all...] |
| /external/lzma/CPP/7zip/Bundles/LzmaSpec/ |
| LzmaSpec.cpp | 223 unsigned BitTreeReverseDecode(CProb *probs, unsigned numBits, CRangeDecoder *rc)
229 unsigned bit = rc->DecodeBit(&probs[m]);
240 CProb Probs[(unsigned)1 << NumBits];
246 INIT_PROBS(Probs);
253 m = (m << 1) + rc->DecodeBit(&Probs[m]);
259 return BitTreeReverseDecode(Probs, NumBits, rc);
380 CProb *probs = &LitProbs[(UInt32)0x300 * litState];
local
389 unsigned bit = RangeDec.DecodeBit(&probs[((1 + matchBit) << 8) + symbol]);
397 symbol = (symbol << 1) | RangeDec.DecodeBit(&probs[symbol]);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.cpp | [all...] |
