Searched refs:probs (Results 1 - 25 of 38) sorted by relevance

12

/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_cost.c39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, argument
41 const vpx_prob prob = probs[i / 2];
52 cost(costs, tree, probs, ii, cc);
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { argument
57 cost(costs, tree, probs, 0, 0);
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
64 cost(costs, tree, probs, 2, 0);
H A Dvp9_cost.h37 static INLINE int treed_cost(vpx_tree tree, const vpx_prob *probs, int bits, argument
44 cost += vp9_cost_bit(probs[i >> 1], bit);
51 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree);
52 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree);
H A Dvp9_treewriter.h32 const vpx_prob *probs, int bits, int len,
36 vpx_write(w, bit, probs[i >> 1]);
42 const vpx_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
31 vp9_write_tree(vpx_writer *w, const vpx_tree_index *tree, const vpx_prob *probs, int bits, int len, vpx_tree_index i) argument
41 vp9_write_token(vpx_writer *w, const vpx_tree_index *tree, const vpx_prob *probs, const struct vp9_token *token) argument
H A Dvp9_segmentation.c67 static int cost_segmap(int *segcounts, vpx_prob *probs) { argument
76 int cost = c0123 * vp9_cost_zero(probs[0]) + c4567 * vp9_cost_one(probs[0]);
80 cost += c01 * vp9_cost_zero(probs[1]) + c23 * vp9_cost_one(probs[1]);
83 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
84 segcounts[1] * vp9_cost_one(probs[3]);
86 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
87 segcounts[3] * vp9_cost_one(probs[4]);
91 cost += c45 * vp9_cost_zero(probs[
[all...]
/external/lzma/Java/Tukaani/src/org/tukaani/xz/rangecoder/
H A DRangeDecoder.java22 public int decodeBit(short[] probs, int index) throws IOException { argument
25 int prob = probs[index];
32 probs[index] = (short)(
38 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
45 public int decodeBitTree(short[] probs) throws IOException { argument
49 symbol = (symbol << 1) | decodeBit(probs, symbol);
50 } while (symbol < probs.length);
52 return symbol - probs.length;
55 public int decodeReverseBitTree(short[] probs) throws IOException { argument
61 int bit = decodeBit(probs, symbo
[all...]
H A DRangeCoder.java23 public static final void initProbs(short[] probs) { argument
24 Arrays.fill(probs, PROB_INIT);
H A DRangeEncoder.java104 public void encodeBit(short[] probs, int index, int bit) { argument
105 int prob = probs[index];
111 probs[index] = (short)(
116 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
132 public void encodeBitTree(short[] probs, int symbol) { argument
134 int mask = probs.length;
139 encodeBit(probs, index, bit);
148 public static int getBitTreePrice(short[] probs, int symbol) { argument
150 symbol |= probs.length;
155 price += getBitPrice(probs[symbo
161 encodeReverseBitTree(short[] probs, int symbol) argument
173 getReverseBitTreePrice(short[] probs, int symbol) argument
[all...]
/external/libvpx/libvpx/vpx_dsp/
H A Dprob.c30 vpx_prob *probs) {
34 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs);
38 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs);
40 probs[i >> 1] = mode_mv_merge_probs(pre_probs[i >> 1], ct);
45 const unsigned int *counts, vpx_prob *probs) {
46 tree_merge_probs_impl(0, tree, pre_probs, counts, probs);
26 tree_merge_probs_impl(unsigned int i, const vpx_tree_index *tree, const vpx_prob *pre_probs, const unsigned int *counts, vpx_prob *probs) argument
44 vpx_tree_merge_probs(const vpx_tree_index *tree, const vpx_prob *pre_probs, const unsigned int *counts, vpx_prob *probs) argument
H A Dbitreader.h122 const vpx_prob *probs) {
125 while ((i = tree[i + vpx_read(r, probs[i >> 1])]) > 0) continue;
121 vpx_read_tree(vpx_reader *r, const vpx_tree_index *tree, const vpx_prob *probs) argument
H A Dprob.h98 const unsigned int *counts, vpx_prob *probs);
/external/lzma/Java/SevenZip/Compression/RangeCoder/
H A DDecoder.java54 public int DecodeBit(short []probs, int index) throws IOException argument
56 int prob = probs[index];
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
83 public static void InitBitModels(short []probs) argument
85 for (int i = 0; i < probs.length; i++)
86 probs[i] = (kBitModelTotal >>> 1);
H A DEncoder.java96 public static void InitBitModels(short []probs) argument
98 for (int i = 0; i < probs.length; i++)
99 probs[i] = (kBitModelTotal >>> 1);
102 public void Encode(short []probs, int index, int symbol) throws IOException argument
104 int prob = probs[index];
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
/external/lzma/C/
H A DLzmaDec.c29 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
30 #define TREE_DECODE(probs, limit, i) \
31 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
36 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
38 #define TREE_6_DECODE(probs, i) \
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i); \
42 TREE_GET_BIT(probs,
142 CLzmaProb *probs = p->probs; local
525 CLzmaProb *probs = p->probs; local
744 CLzmaProb *probs = p->probs; local
[all...]
H A DLzmaDec.h13 but memory usage for CLzmaDec::probs will be doubled in that case */
51 CLzmaProb *probs; member in struct:__anon14019
69 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
H A DLzmaEnc.c585 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol) argument
590 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);
596 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte) argument
603 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);
646 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices) argument
652 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);
659 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices) argument
667 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);
676 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol) argument
685 RangeEnc_EncodeBit(rc, probs
690 RcTree_ReverseEncode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol) argument
703 RcTree_GetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices) argument
715 RcTree_ReverseGetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices) argument
1025 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1238 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1795 CLzmaProb *probs; local
1991 CLzmaProb *probs = p->posSlotEncoder[i]; local
[all...]
/external/libvpx/libvpx/vp8/common/
H A Dtreecoder.h64 vp8_prob probs[/* n-1 */],
69 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
73 vp8_prob probs[/* n-1 */],
H A Dtreecoder.c79 vp8_prob probs[/* n-1 */],
96 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for now */
98 probs[t] = vp8_prob_half;
/external/deqp/modules/gles2/stress/
H A Des2sLongRunningTests.cpp79 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_) {}
123 contexts, cases[caseNdx].probs,
151 const Probs probs; member in struct:deqp::gles2::Stress::Case
152 Case (const char* const name_, const char* const desc_, int numTextures_, const Probs& probs_ = Probs()) : name(name_), desc(desc_), numTextures(numTextures_), probs(probs_) {}
191 contexts, cases[caseNdx].probs,
208 const Probs probs; member in struct:deqp::gles2::Stress::Case
210 : name(name_), desc(desc_), drawCallsPerIteration(calls), numTrisPerDrawCall(tris), probs(probs_) {}
241 contexts, cases[caseNdx].probs,
257 const Probs probs; member in struct:deqp::gles2::Stress::Case
[all...]
/external/deqp/modules/gles3/stress/
H A Des3sLongRunningTests.cpp79 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_) {}
123 contexts, cases[caseNdx].probs,
151 const Probs probs; member in struct:deqp::gles3::Stress::Case
152 Case (const char* const name_, const char* const desc_, int numTextures_, const Probs& probs_ = Probs()) : name(name_), desc(desc_), numTextures(numTextures_), probs(probs_) {}
191 contexts, cases[caseNdx].probs,
208 const Probs probs; member in struct:deqp::gles3::Stress::Case
210 : name(name_), desc(desc_), drawCallsPerIteration(calls), numTrisPerDrawCall(tris), probs(probs_) {}
241 contexts, cases[caseNdx].probs,
257 const Probs probs; member in struct:deqp::gles3::Stress::Case
[all...]
/external/libvpx/libvpx/vp9/common/
H A Dvp9_entropy.c1028 static void extend_to_full_distribution(vpx_prob *probs, vpx_prob p) { argument
1030 memcpy(probs, vp9_pareto8_full[p - 1], MODEL_NODES * sizeof(vpx_prob));
1057 vp9_coeff_probs_model *const probs = cm->fc->coef_probs[tx_size]; local
1076 probs[i][j][k][l][m] =
/external/lzma/xz-embedded/
H A Dxz_dec_lzma2.c520 uint16_t *probs, uint32_t limit)
525 if (rc_bit(rc, &probs[symbol]))
536 uint16_t *probs,
543 if (rc_bit(rc, &probs[symbol])) {
583 uint16_t *probs; local
590 probs = lzma_literal_probs(s);
593 symbol = rc_bittree(&s->rc, probs, 0x100);
604 if (rc_bit(&s->rc, &probs[i])) {
622 uint16_t *probs; local
626 probs
519 rc_bittree(struct rc_dec *rc, uint16_t *probs, uint32_t limit) argument
535 rc_bittree_reverse(struct rc_dec *rc, uint16_t *probs, uint32_t *dest, uint32_t limit) argument
648 uint16_t *probs; local
769 uint16_t *probs; local
[all...]
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/
H A DLZMACoder.java109 final short[] probs = new short[0x300]; field in class:LZMACoder.LiteralCoder.LiteralSubcoder
112 RangeCoder.initProbs(probs);
H A DLZMADecoder.java161 symbol = (symbol << 1) | rc.decodeBit(probs, symbol);
173 bit = rc.decodeBit(probs, offset + matchBit + symbol);
/external/opencv/ml/src/
H A Dml_inner_functions.cpp184 where Pr{xi = k} == probs[k], 0 < k < len - 1. */
185 CV_IMPL void cvRandSeries( float probs[], int len, int sample[], int amount ) argument
195 knots[0] = probs[0];
197 knots[i] = knots[i - 1] + probs[i];
1415 const CvMat* probs, CvMat* dst_probs,
1492 if( dst_probs && (!probs || probs->data.ptr != dst_probs->data.ptr) )
1494 if( !probs )
1495 CV_ERROR( CV_StsNullPtr, "NULL probs" );
1497 if( probs
1413 cvWritebackLabels( const CvMat* labels, CvMat* dst_labels, const CvMat* centers, CvMat* dst_centers, const CvMat* probs, CvMat* dst_probs, const CvMat* sample_idx, int samples_all, const CvMat* comp_idx, int dims_all ) argument
1888 icvFindClusterLabels( const CvMat* probs, float outlier_thresh, float r, const CvMat* labels ) argument
[all...]
H A Dmlem.cpp74 means = weights = probs = inv_eigen_values = log_weight_div_det = 0;
81 means = weights = probs = inv_eigen_values = log_weight_div_det = 0;
100 cvReleaseMat( &probs );
138 if( !params.probs )
154 if( params.probs )
342 CV_CALL( probs = cvCreateMat( nsamples, nclusters, CV_64FC1 ));
376 prob.data.ptr = probs->data.ptr + probs->step*i;
415 cvGetRow( params.probs, &prob, i );
509 cvSetIdentity( probs );
[all...]

Completed in 2736 milliseconds

12