| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_cost.h | 22 #define vp9_cost_zero(prob) (vp9_prob_cost[prob])
24 #define vp9_cost_one(prob) vp9_cost_zero(vp9_complement(prob))
26 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vp9_complement(prob) \
27 : (prob))
|
| vp9_cost.c | 39 const vp9_prob prob = probs[i / 2]; local
43 const int cc = c + vp9_cost_bit(prob, b);
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.h | 22 #define vp9_cost_zero(prob) (vp9_prob_cost[prob])
24 #define vp9_cost_one(prob) vp9_cost_zero(vp9_complement(prob))
26 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vp9_complement(prob) \
27 : (prob))
|
| vp9_cost.c | 39 const vp9_prob prob = probs[i / 2]; local
43 const int cc = c + vp9_cost_bit(prob, b);
|
| /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;
|
| /external/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/C/ |
| 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))
|
| 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/lzma/Java/SevenZip/Compression/RangeCoder/ |
| 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));
|
| 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/deqp/modules/glshared/ |
| glsLongStressCase.hpp | 236 FeatureProbabilities& pRebuildProgram (const float prob) { rebuildProgram = prob; return *this; }
237 FeatureProbabilities& pReuploadTexture (const float prob) { reuploadTexture = prob; return *this; }
238 FeatureProbabilities& pReuploadBuffer (const float prob) { reuploadBuffer = prob; return *this; }
239 FeatureProbabilities& pReuploadWithTexImage (const float prob) { reuploadWithTexImage = prob; return *this; }
240 FeatureProbabilities& pReuploadWithBufferData (const float prob) { reuploadWithBufferData = prob; return *this;
[all...] |
| /external/chromium_org/third_party/libwebp/dec/ |
| tree.c | 316 const uint8_t* const prob = kBModesProba[top[x]][ymode]; local
319 int i = kYModesIntra4[VP8GetBit(br, prob[0])];
321 i = kYModesIntra4[2 * i + VP8GetBit(br, prob[i])];
326 ymode = !VP8GetBit(br, prob[0]) ? B_DC_PRED :
327 !VP8GetBit(br, prob[1]) ? B_TM_PRED :
328 !VP8GetBit(br, prob[2]) ? B_VE_PRED :
329 !VP8GetBit(br, prob[3]) ?
330 (!VP8GetBit(br, prob[4]) ? B_HE_PRED :
331 (!VP8GetBit(br, prob[5]) ? B_RD_PRED : B_VR_PRED)) :
332 (!VP8GetBit(br, prob[6]) ? B_LD_PRED
[all...] |
| /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/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| 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);
|
| 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...] |
| /external/libvpx/libvpx/vp9/decoder/ |
| vp9_detokenize.c | 77 #define ADJUST_COEF(prob, bits_count) \
79 val += (vp9_read(r, prob) << bits_count); \
93 const vp9_prob *prob; local
108 prob = coef_probs[band][ctx];
111 if (!vp9_read(r, prob[EOB_CONTEXT_NODE])) {
116 while (!vp9_read(r, prob[ZERO_CONTEXT_NODE])) {
125 prob = coef_probs[band][ctx];
129 if (!vp9_read(r, prob[ONE_CONTEXT_NODE])) {
136 prob = vp9_pareto8_full[prob[PIVOT_NODE] - 1]
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
| entropymv.h | 43 vp8_prob prob[MVPcount]; /* often come in row, col pairs */ member in struct:mv_context
|
| /external/libvpx/libvpx/vp8/common/ |
| entropymv.h | 43 vp8_prob prob[MVPcount]; /* often come in row, col pairs */ member in struct:mv_context
|
| /external/chromium_org/third_party/libwebp/enc/ |
| tree.c | 271 const uint8_t* const prob) {
272 if (VP8PutBit(bw, mode != B_DC_PRED, prob[0])) {
273 if (VP8PutBit(bw, mode != B_TM_PRED, prob[1])) {
274 if (VP8PutBit(bw, mode != B_VE_PRED, prob[2])) {
275 if (!VP8PutBit(bw, mode >= B_LD_PRED, prob[3])) {
276 if (VP8PutBit(bw, mode != B_HE_PRED, prob[4])) {
277 VP8PutBit(bw, mode != B_RD_PRED, prob[5]);
280 if (VP8PutBit(bw, mode != B_LD_PRED, prob[6])) {
281 if (VP8PutBit(bw, mode != B_VL_PRED, prob[7])) {
282 VP8PutBit(bw, mode != B_HD_PRED, prob[8])
[all...] |
| /external/iproute2/examples/diffserv/ |
| afcbq | 80 $prob = $drop*0.02;
85 "probability $prob ".
90 "probability $prob \n";
|
