Searched refs:prob (Results 1 - 25 of 65) sorted by relevance

123

/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_cost.h14 #include "vpx_dsp/prob.h"
26 #define vp9_cost_zero(prob) (vp9_prob_cost[prob])
28 #define vp9_cost_one(prob) vp9_cost_zero(256 - (prob))
30 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? 256 - (prob) : (prob))
H A Dvp9_cost.c41 const vpx_prob prob = probs[i / 2]; local
44 assert(prob != 0);
46 const int cc = c + vp9_cost_bit(prob, b);
/external/iproute2/tc/
H A Dtc_red.h4 extern int tc_red_eval_P(unsigned qmin, unsigned qmax, double prob);
H A Dtc_red.c28 Plog = log(prob/(qmax - qmin))
30 int tc_red_eval_P(unsigned qmin, unsigned qmax, double prob) argument
37 prob /= i;
40 if (prob > 1.0)
42 prob *= 2;
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
H A Deval.pass.cpp38 std::vector<double> prob = d.probabilities(); local
40 assert((double)u[i]/N == prob[i]);
56 std::vector<double> prob = d.probabilities(); local
58 assert((double)u[i]/N == prob[i]);
74 std::vector<double> prob = d.probabilities(); local
76 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
92 std::vector<double> prob = d.probabilities();
93 assert((double)u[0]/N == prob[0]);
94 assert((double)u[1]/N == prob[
[all...]
H A Deval_param.pass.cpp41 std::vector<double> prob = p.probabilities(); local
43 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
/external/lzma/C/
H A DPpmd.h22 #define PPMD_UPDATE_PROB_0(prob) ((prob) + (1 << PPMD_INT_BITS) - PPMD_GET_MEAN(prob))
23 #define PPMD_UPDATE_PROB_1(prob) ((prob) - PPMD_GET_MEAN(prob))
H A DLzmaDec.c49 #define NORMAL_LITER_DEC GET_BIT(prob + symbol, symbol)
53 probLit = prob + offs + bit + symbol; \
164 CLzmaProb *prob; local
169 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
170 IF_BIT_0(prob)
173 UPDATE_0(prob);
174 prob = probs + Literal;
176 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
231 UPDATE_1(prob);
232 prob
530 CLzmaProb *prob; local
542 prob = probs + Literal; local
[all...]
H A DBcj2.c63 CProb *prob; local
87 prob = p + prevByte;
89 prob = p + 256;
91 prob = p + 257;
93 IF_BIT_0(prob)
95 UPDATE_0(prob)
102 UPDATE_1(prob)
H A DPpmd7Enc.c119 UInt16 *prob = Ppmd7_GetBinSumm(p); local
123 RangeEnc_EncodeBit_0(rc, *prob);
124 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
131 RangeEnc_EncodeBit_1(rc, *prob);
132 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
133 p->InitEsc = PPMD7_kExpEscape[*prob >> 10];
/external/lzma/Java/SevenZip/Compression/RangeCoder/
H A DDecoder.java56 int prob = probs[index];
57 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
H A DEncoder.java104 int prob = probs[index];
105 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
/external/lzma/Java/Tukaani/src/org/tukaani/xz/rangecoder/
H A DRangeDecoder.java25 int prob = probs[index];
26 int bound = (range >>> BIT_MODEL_TOTAL_BITS) * prob;
33 prob + ((BIT_MODEL_TOTAL - prob) >>> MOVE_BITS));
38 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
H A DRangeEncoder.java105 int prob = probs[index];
106 int bound = (range >>> BIT_MODEL_TOTAL_BITS) * prob;
112 prob + ((BIT_MODEL_TOTAL - prob) >>> MOVE_BITS));
116 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
125 public static int getBitPrice(int prob, int bit) { argument
128 return prices[(prob ^ ((-bit) & (BIT_MODEL_TOTAL - 1)))
/external/deqp/modules/glshared/
H A DglsLongStressCase.hpp236 FeatureProbabilities& pRebuildProgram (const float prob) { rebuildProgram = prob; return *this; } argument
237 FeatureProbabilities& pReuploadTexture (const float prob) { reuploadTexture = prob; return *this; } argument
238 FeatureProbabilities& pReuploadBuffer (const float prob) { reuploadBuffer = prob; return *this; } argument
239 FeatureProbabilities& pReuploadWithTexImage (const float prob) { reuploadWithTexImage = prob; return *this; } argument
240 FeatureProbabilities& pReuploadWithBufferData (const float prob) { reuploadWithBufferData = prob; retur argument
241 pDeleteTexture(const float prob) argument
242 pDeleteBuffer(const float prob) argument
243 pWastefulTextureMemoryUsage(const float prob) argument
244 pWastefulBufferMemoryUsage(const float prob) argument
245 pClientMemoryAttributeData(const float prob) argument
246 pClientMemoryIndexData(const float prob) argument
247 pRandomBufferUploadTarget(const float prob) argument
248 pRandomBufferUsage(const float prob) argument
249 pUseDrawArrays(const float prob) argument
250 pSeparateAttribBuffers(const float prob) argument
[all...]
/external/webp/src/dec/
H A Dtree_dec.c319 const uint8_t* const prob = kBModesProba[top[x]][ymode]; local
322 int i = kYModesIntra4[VP8GetBit(br, prob[0])];
324 i = kYModesIntra4[2 * i + VP8GetBit(br, prob[i])];
329 ymode = !VP8GetBit(br, prob[0]) ? B_DC_PRED :
330 !VP8GetBit(br, prob[1]) ? B_TM_PRED :
331 !VP8GetBit(br, prob[2]) ? B_VE_PRED :
332 !VP8GetBit(br, prob[3]) ?
333 (!VP8GetBit(br, prob[4]) ? B_HE_PRED :
334 (!VP8GetBit(br, prob[5]) ? B_RD_PRED : B_VR_PRED)) :
335 (!VP8GetBit(br, prob[
[all...]
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/
H A Deval_param.pass.cpp55 std::vector<double> prob(std::begin(p), std::end(p));
56 double s = std::accumulate(prob.begin(), prob.end(), 0.0);
57 for (std::size_t i = 0; i < prob.size(); ++i)
58 prob[i] /= s;
66 if (prob[i] == 0)
70 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01);
H A Deval.pass.cpp52 std::vector<double> prob(std::begin(p), std::end(p));
53 double s = std::accumulate(prob.begin(), prob.end(), 0.0);
54 for (std::size_t i = 0; i < prob.size(); ++i)
55 prob[i] /= s;
63 if (prob[i] == 0)
67 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01);
115 std::vector<double> prob(std::begin(p), std::end(p));
116 double s = std::accumulate(prob
[all...]
/external/libvpx/libvpx/vp8/common/
H A Dentropymv.h40 vp8_prob prob[MVPcount]; /* often come in row, col pairs */ member in struct:mv_context
/external/webp/src/enc/
H A Dtree_enc.c271 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[
270 PutI4Mode(VP8BitWriter* const bw, int mode, const uint8_t* const prob) argument
[all...]
/external/iproute2/examples/diffserv/
H A Dafcbq80 $prob = $drop*0.02;
85 "probability $prob ".
90 "probability $prob \n";
/external/libvpx/libvpx/vpx_dsp/
H A Dprob.h72 const vpx_prob prob = get_binary_prob(ct[0], ct[1]); local
75 return weighted_prob(pre_prob, prob, factor);
92 const vpx_prob prob = get_prob(ct[0], den); local
93 return weighted_prob(pre_prob, prob, factor);
H A Dbitreader.h21 #include "vpx_dsp/prob.h"
73 static INLINE int vpx_read(vpx_reader *r, int prob) { argument
79 unsigned int split = (r->range * prob + (256 - prob)) >> CHAR_BIT;
/external/guava/guava-tests/benchmark/com/google/common/base/
H A DCharMatcherBenchmark.java169 int r = prob.length - 1;
170 int c = prob.length / 2;
171 int lv = prob[l];
172 int rv = prob[r];
173 int cv = prob[c];
186 cv = prob[c];
193 cv = prob[c];
199 private static int[] prob; field in class:CharMatcherBenchmark.CharSamples
202 prob = new int[10003];
919 System.arraycopy(temp, 0, prob,
[all...]
/external/webp/src/dsp/
H A Dcost_mips_dsp_r2.c22 // should be prob[VP8EncBands[n]], but it's equivalent for n=0 or 1
23 int p0 = res->prob[n][ctx0][0];
87 const int last_p0 = res->prob[b][ctx][0];

Completed in 511 milliseconds

123