| /external/lzma/CPP/7zip/Compress/ |
| RangeCoderBit.h | 26 UInt32 Prob;
30 Prob -= (Prob + ((symbol - 1) & ((1 << numMoveBits) - 1))) >> numMoveBits;
31 Prob += (1 - symbol) << (kNumBitModelTotalBits - numMoveBits);
34 Prob += (kBitModelTotal - Prob) >> numMoveBits;
36 Prob -= (Prob) >> numMoveBits;
39 void Init() { Prob = kBitModelTotal / 2; }
49 encoder->EncodeBit(this->Prob, kNumBitModelTotalBits, symbol);
[all...] |
| /external/lzma/CS/7zip/Compress/RangeCoder/ |
| RangeCoderBit.cs | 13 uint Prob;
15 public void Init() { Prob = kBitModelTotal >> 1; }
20 Prob += (kBitModelTotal - Prob) >> kNumMoveBits;
22 Prob -= (Prob) >> kNumMoveBits;
27 // encoder.EncodeBit(Prob, kNumBitModelTotalBits, symbol);
29 uint newBound = (encoder.Range >> kNumBitModelTotalBits) * Prob;
33 Prob += (kBitModelTotal - Prob) >> kNumMoveBits;
[all...] |
| /external/llvm/lib/Support/ |
| BlockFrequency.cpp | 20 BlockFrequency &BlockFrequency::operator*=(BranchProbability Prob) {
21 Frequency = Prob.scale(Frequency);
25 BlockFrequency BlockFrequency::operator*(BranchProbability Prob) const {
27 Freq *= Prob;
31 BlockFrequency &BlockFrequency::operator/=(BranchProbability Prob) {
32 Frequency = Prob.scaleByInverse(Frequency);
36 BlockFrequency BlockFrequency::operator/(BranchProbability Prob) const {
38 Freq /= Prob;
|
| /external/llvm/unittests/Support/ |
| BlockFrequencyTest.cpp | 22 BranchProbability Prob(UINT32_MAX / 3, UINT32_MAX);
23 Freq *= Prob;
27 Freq *= Prob;
33 BranchProbability Prob(UINT32_MAX, UINT32_MAX);
34 Freq *= Prob;
38 Freq *= Prob;
44 BranchProbability Prob(3000000, 9000000);
45 Freq *= Prob;
49 Freq *= Prob;
55 BranchProbability Prob(UINT32_MAX / 2, UINT32_MAX)
[all...] |
| BranchProbabilityTest.cpp | 198 uint32_t Prob[2];
286 EXPECT_EQ(T.Result, BP(T.Prob[0], T.Prob[1]).scale(T.Num));
|
| /external/llvm/include/llvm/Support/ |
| BlockFrequency.h | 40 BlockFrequency &operator*=(BranchProbability Prob);
41 BlockFrequency operator*(BranchProbability Prob) const;
45 BlockFrequency &operator/=(BranchProbability Prob);
46 BlockFrequency operator/(BranchProbability Prob) const;
|
| BranchProbability.h | 129 BranchProbability Prob(*this);
130 return Prob += RHS;
134 BranchProbability Prob(*this);
135 return Prob -= RHS;
139 BranchProbability Prob(*this);
140 return Prob *= RHS;
144 BranchProbability Prob(*this);
145 return Prob /= RHS;
176 inline raw_ostream &operator<<(raw_ostream &OS, BranchProbability Prob) {
177 return Prob.print(OS)
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineBranchProbabilityInfo.cpp | 22 INITIALIZE_PASS_BEGIN(MachineBranchProbabilityInfo, "machine-branch-prob",
24 INITIALIZE_PASS_END(MachineBranchProbabilityInfo, "machine-branch-prob",
59 auto Prob = getEdgeProbability(MBB, I);
60 if (Prob > MaxProb) {
61 MaxProb = Prob;
77 const BranchProbability Prob = getEdgeProbability(Src, Dst);
79 << " probability is " << Prob
|
| MachineBasicBlock.cpp | 513 for (auto Prob : Probs)
514 Sum += Prob.getNumerator();
525 BranchProbability Prob) {
529 Probs.push_back(Prob);
625 auto Prob = *FromMBB->Probs.begin();
626 addSuccessor(Succ, Prob);
642 auto Prob = *FromMBB->Probs.begin();
643 addSuccessor(Succ, Prob);
[all...] |
| BranchFolding.cpp | [all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/rangecoder/ |
| Encoder.java | 101 int prob = probs[index];
local
102 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
105 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
109 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
129 static public int GetPrice (int Prob, int symbol) {
130 return ProbPrices[(((Prob - symbol) ^ ((-symbol))) & (kBitModelTotal - 1)) >>> kNumMoveReducingBits];
133 static public int GetPrice0 (int Prob) {
134 return ProbPrices[Prob >>> kNumMoveReducingBits];
[all...] |
| /external/lzma/Java/SevenZip/Compression/RangeCoder/ |
| Encoder.java | 104 int prob = probs[index];
local
105 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
139 static public int GetPrice(int Prob, int symbol)
141 return ProbPrices[(((Prob - symbol) ^ ((-symbol))) & (kBitModelTotal - 1)) >>> kNumMoveReducingBits];
143 static public int GetPrice0(int Prob)
145 return ProbPrices[Prob >>> kNumMoveReducingBits];
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.h | 157 BranchProbability Prob;
160 MachineBasicBlock *MBB, BranchProbability Prob) {
166 C.Prob = Prob;
172 BranchProbability Prob) {
178 C.Prob = Prob;
183 unsigned BTCasesIndex, BranchProbability Prob) {
189 C.Prob = Prob;
[all...] |
| SelectionDAGBuilder.cpp | [all...] |
| SelectionDAGISel.cpp | [all...] |
| /external/opencv/cv/src/ |
| cvcondens.cpp | 237 float Prob = 1.f / conDens->SamplesNum;
272 conDens->flConfidence[j] = Prob;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 437 /// of Succ is automatically updated. PROB parameter is stored in
445 BranchProbability Prob = BranchProbability::getUnknown());
454 void setSuccProbability(succ_iterator I, BranchProbability Prob);
[all...] |
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 28 #define DEBUG_TYPE "branch-prob"
30 INITIALIZE_PASS_BEGIN(BranchProbabilityInfoWrapperPass, "branch-prob",
33 INITIALIZE_PASS_END(BranchProbabilityInfoWrapperPass, "branch-prob",
671 const BranchProbability Prob = getEdgeProbability(Src, Dst);
673 << " probability is " << Prob
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonEarlyIfConv.cpp | 92 cl::opt<bool> EnableHexagonBP("enable-hexagon-br-prob", cl::Hidden,
478 BranchProbability Prob(9, 10);
479 if (MBPI->getEdgeProbability(FP.SplitB, FP.TrueB) > Prob)
481 if (MBPI->getEdgeProbability(FP.SplitB, FP.FalseB) > Prob)
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 803 auto &Prob = getAnalysis<MachineBranchProbabilityInfo>();
807 return Prob.getEdgeProbability(&B, Dst0) <
808 Prob.getEdgeProbability(&B, Dst1);
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | [all...] |
