HomeSort by relevance Sort by last modified time
    Searched full:prob (Results 1 - 25 of 178) sorted by null

1 2 3 4 5 6 7 8

  /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/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/llvm/unittests/Support/
BlockFrequencyTest.cpp 13 BranchProbability Prob(UINT32_MAX - 1, UINT32_MAX);
14 Freq *= Prob;
20 BranchProbability Prob(UINT32_MAX, UINT32_MAX);
21 Freq *= Prob;
27 BranchProbability Prob(3000000, 9000000);
28 Freq *= Prob;
34 BranchProbability Prob(UINT32_MAX / 2, UINT32_MAX);
35 Freq *= Prob;
43 BranchProbability Prob(P, P);
44 Freq *= Prob;
    [all...]
  /external/iproute2/tc/
tc_red.h 4 extern int tc_red_eval_P(unsigned qmin, unsigned qmax, double prob);
tc_red.c 28 Plog = log(prob/(qmax - qmin))
30 int tc_red_eval_P(unsigned qmin, unsigned qmax, double prob)
37 prob /= i;
40 if (prob > 1.0)
42 prob *= 2;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
eval.pass.cpp 36 std::vector<double> prob = d.probabilities(); local
38 assert((double)u[i]/N == prob[i]);
54 std::vector<double> prob = d.probabilities(); local
56 assert((double)u[i]/N == prob[i]);
72 std::vector<double> prob = d.probabilities(); local
74 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
90 std::vector<double> prob = d.probabilities();
91 assert((double)u[0]/N == prob[0]);
92 assert((double)u[1]/N == prob[1])
    [all...]
eval_param.pass.cpp 39 std::vector<double> prob = p.probabilities(); local
41 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
  /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...]
Decoder.java 56 int prob = probs[index]; local
57 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
  /external/chromium_org/third_party/lzma_sdk/
LzmaDec.c 155 CLzmaProb *prob; local
160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
161 IF_BIT_0(prob)
164 UPDATE_0(prob);
165 prob = probs + Literal;
167 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
174 do { GET_BIT(prob + symbol, symbol) } while (symbol < 0x100);
188 probLit = prob + offs + bit + symbol;
199 UPDATE_1(prob);
200 prob = probs + IsRep + state
497 CLzmaProb *prob; local
509 prob = probs + Literal; local
    [all...]
Bcj2.c 61 CProb *prob; local
85 prob = p + prevByte;
87 prob = p + 256;
89 prob = p + 257;
91 IF_BIT_0(prob)
93 UPDATE_0(prob)
100 UPDATE_1(prob)
  /external/chromium_org/third_party/ots/third_party/lzma_sdk/
LzmaDec.c 156 CLzmaProb *prob; local
161 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
162 IF_BIT_0(prob)
165 UPDATE_0(prob);
166 prob = probs + Literal;
168 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
175 do { GET_BIT(prob + symbol, symbol) } while (symbol < 0x100);
189 probLit = prob + offs + bit + symbol;
200 UPDATE_1(prob);
201 prob = probs + IsRep + state
498 CLzmaProb *prob; local
510 prob = probs + Literal; local
    [all...]
  /external/lzma/C/
LzmaDec.c 155 CLzmaProb *prob; local
160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
161 IF_BIT_0(prob)
164 UPDATE_0(prob);
165 prob = probs + Literal;
167 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
174 do { GET_BIT(prob + symbol, symbol) } while (symbol < 0x100);
188 probLit = prob + offs + bit + symbol;
199 UPDATE_1(prob);
200 prob = probs + IsRep + state;
497 CLzmaProb *prob; local
509 prob = probs + Literal; local
    [all...]
Ppmd.h 23 #define PPMD_UPDATE_PROB_0(prob) ((prob) + (1 << PPMD_INT_BITS) - PPMD_GET_MEAN(prob))
24 #define PPMD_UPDATE_PROB_1(prob) ((prob) - PPMD_GET_MEAN(prob))
Bcj2.c 61 CProb *prob; local
85 prob = p + prevByte;
87 prob = p + 256;
89 prob = p + 257;
91 IF_BIT_0(prob)
93 UPDATE_0(prob)
100 UPDATE_1(prob)
Ppmd7Enc.c 117 UInt16 *prob = Ppmd7_GetBinSumm(p); local
121 RangeEnc_EncodeBit_0(rc, *prob);
122 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
129 RangeEnc_EncodeBit_1(rc, *prob);
130 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
131 p->InitEsc = PPMD7_kExpEscape[*prob >> 10];
Ppmd7Dec.c 122 UInt16 *prob = Ppmd7_GetBinSumm(p); local
123 if (rc->DecodeBit(rc, *prob) == 0)
126 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
131 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
132 p->InitEsc = PPMD7_kExpEscape[*prob >> 10];
  /external/libvpx/libvpx/vp9/decoder/
vp9_detokenize.c 87 #define ADJUST_COEF(prob, bits_count) \
89 val += (vp9_read(r, prob) << bits_count); \
105 const vp9_prob *prob; local
120 prob = coef_probs[band][pt];
123 if (!vp9_read(r, prob[EOB_CONTEXT_NODE]))
133 prob = coef_probs[band][pt];
136 if (!vp9_read(r, prob[ZERO_CONTEXT_NODE])) {
144 if (!vp9_read(r, prob[ONE_CONTEXT_NODE])) {
153 prob = coef_probs_full[band][pt];
155 if (!vp9_read(r, prob[LOW_VAL_CONTEXT_NODE]))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/
eval.pass.cpp 49 std::vector<double> prob(std::begin(p), std::end(p));
50 double s = std::accumulate(prob.begin(), prob.end(), 0.0);
51 for (int i = 0; i < prob.size(); ++i)
52 prob[i] /= s;
60 if (prob[i] == 0)
64 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01);
109 std::vector<double> prob(std::begin(p), std::end(p));
110 double s = std::accumulate(prob.begin(), prob.end(), 0.0)
    [all...]
eval_param.pass.cpp 51 std::vector<double> prob(std::begin(p), std::end(p));
52 double s = std::accumulate(prob.begin(), prob.end(), 0.0);
53 for (int i = 0; i < prob.size(); ++i)
54 prob[i] /= s;
62 if (prob[i] == 0)
66 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01);
  /external/llvm/lib/Support/
BlockFrequency.cpp 89 BlockFrequency &BlockFrequency::operator*=(const BranchProbability &Prob) {
90 scale(Prob.getNumerator(), Prob.getDenominator());
95 BlockFrequency::operator*(const BranchProbability &Prob) const {
97 Freq *= Prob;
101 BlockFrequency &BlockFrequency::operator/=(const BranchProbability &Prob) {
102 scale(Prob.getDenominator(), Prob.getNumerator());
106 BlockFrequency BlockFrequency::operator/(const BranchProbability &Prob) const {
108 Freq /= Prob;
    [all...]
  /external/libvpx/libvpx/vp9/encoder/
vp9_treewriter.c 15 const vp9_prob prob = probs[i / 2]; local
19 const int cc = c + vp9_cost_bit(prob, b);
  /external/libvpx/libvpx/vp8/encoder/
encodemv.c 29 const vp8_prob *p = mvc->prob;
102 const vp8_prob *p = mvc->prob;
156 mvcost [0] [i] = cost0 + vp8_cost_zero(mvc[0].prob[MVPsign]);
157 mvcost [0] [-i] = cost0 + vp8_cost_one(mvc[0].prob[MVPsign]);
172 mvcost [1] [i] = cost1 + vp8_cost_zero(mvc[1].prob[MVPsign]);
173 mvcost [1] [-i] = cost1 + vp8_cost_one(mvc[1].prob[MVPsign]);
233 vp8_prob *Pcur = cur_mvc->prob;
234 const vp8_prob *default_mvc = default_mvc_->prob;
235 const vp8_prob *Pupdate = update_mvc->prob;
  /external/llvm/include/llvm/Support/
BlockFrequency.h 48 BlockFrequency &operator*=(const BranchProbability &Prob);
49 const BlockFrequency operator*(const BranchProbability &Prob) const;
53 BlockFrequency &operator/=(const BranchProbability &Prob);
54 BlockFrequency operator/(const BranchProbability &Prob) const;
  /external/llvm/test/CodeGen/Generic/
stop-after.ll 8 ; START: -machine-branch-prob -gc-lowering

Completed in 953 milliseconds

1 2 3 4 5 6 7 8