| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_treewriter.c | 13 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
15 const vp9_prob prob = probs[i / 2];
25 cost(costs, tree, probs, ii, cc);
29 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
30 cost(costs, tree, probs, 0, 0);
33 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
36 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
37 cost(costs, tree, probs, 2, 0);
|
| vp9_treewriter.h | 48 vp9_tree tree, const vp9_prob *probs,
54 vp9_write(w, bit, probs[i >> 1]);
60 const vp9_prob *probs,
62 treed_write(w, tree, probs, token->value, token->len);
65 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs,
72 cost += vp9_cost_bit(probs[i >> 1], bit);
79 static INLINE int cost_token(vp9_tree tree, const vp9_prob *probs,
81 return treed_cost(tree, probs, token->value, token->len);
84 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
85 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree)
[all...] |
| vp9_segmentation.c | 80 static int cost_segmap(int *segcounts, vp9_prob *probs) {
89 int cost = c0123 * vp9_cost_zero(probs[0]) +
90 c4567 * vp9_cost_one(probs[0]);
94 cost += c01 * vp9_cost_zero(probs[1]) +
95 c23 * vp9_cost_one(probs[1]);
98 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
99 segcounts[1] * vp9_cost_one(probs[3]);
101 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
102 segcounts[3] * vp9_cost_one(probs[4]);
106 cost += c45 * vp9_cost_zero(probs[2])
[all...] |
| /external/lzma/Java/SevenZip/Compression/RangeCoder/ |
| Decoder.java | 54 public int DecodeBit(short []probs, int index) throws IOException
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)
85 for (int i = 0; i < probs.length; i++)
86 probs[i] = (kBitModelTotal >>> 1);
|
| Encoder.java | 96 public static void InitBitModels(short []probs)
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
104 int prob = probs[index];
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_treecoder.c | 44 vp9_prob probs[],
53 left = convert_distribution(tree[i], tree, probs, branch_ct,
59 right = convert_distribution(tree[i + 1], tree, probs, branch_ct,
62 probs[i>>1] = get_binary_prob(left, right);
70 vp9_prob probs [ /* n-1 */ ],
74 convert_distribution(0, tree, probs, branch_ct, num_events, tok0_offset);
|
| /external/chromium_org/third_party/lzma_sdk/ |
| LzmaDec.c | 27 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
28 #define TREE_DECODE(probs, limit, i) \
29 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
34 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
36 #define TREE_6_DECODE(probs, i) \
38 TREE_GET_BIT(probs, i); \
39 TREE_GET_BIT(probs, i); \
40 TREE_GET_BIT(probs, i);
133 CLzmaProb *probs = p->probs; local
492 CLzmaProb *probs = p->probs; local
711 CLzmaProb *probs = p->probs; local
[all...] |
| LzmaDec.h | 15 but memory usage for CLzmaDec::probs will be doubled in that case */
53 CLzmaProb *probs; member in struct:__anon14160
71 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| LzmaEnc.c | 575 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol)
580 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);
586 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte)
593 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);
636 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices)
642 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);
649 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices)
657 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);
666 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)
675 RangeEnc_EncodeBit(rc, probs + m, bit)
1012 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1225 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1782 CLzmaProb *probs; local
1980 CLzmaProb *probs = p->posSlotEncoder[i]; local
[all...] |
| /external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
| LzmaDec.c | 28 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
29 #define TREE_DECODE(probs, limit, i) \
30 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
35 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
37 #define TREE_6_DECODE(probs, i) \
39 TREE_GET_BIT(probs, i); \
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i);
134 CLzmaProb *probs = p->probs; local
493 CLzmaProb *probs = p->probs; local
712 CLzmaProb *probs = p->probs; local
[all...] |
| LzmaDec.h | 16 but memory usage for CLzmaDec::probs will be doubled in that case */
54 CLzmaProb *probs; member in struct:__anon15728
72 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| LzmaEnc.c | 576 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol)
581 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);
587 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte)
594 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);
637 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices)
643 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);
650 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices)
658 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);
667 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)
676 RangeEnc_EncodeBit(rc, probs + m, bit)
1013 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1226 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1783 CLzmaProb *probs; local
1981 CLzmaProb *probs = p->posSlotEncoder[i]; local
[all...] |
| /external/lzma/C/ |
| LzmaDec.c | 27 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
28 #define TREE_DECODE(probs, limit, i) \
29 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
34 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
36 #define TREE_6_DECODE(probs, i) \
38 TREE_GET_BIT(probs, i); \
39 TREE_GET_BIT(probs, i); \
40 TREE_GET_BIT(probs, i); \
133 CLzmaProb *probs = p->probs; local
492 CLzmaProb *probs = p->probs; local
711 CLzmaProb *probs = p->probs; local
[all...] |
| LzmaDec.h | 15 but memory usage for CLzmaDec::probs will be doubled in that case */
53 CLzmaProb *probs;
member in struct:__anon24368
71 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| LzmaEnc.c | 575 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol)
580 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);
586 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte)
593 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);
636 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices)
642 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);
649 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices)
657 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);
666 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)
675 RangeEnc_EncodeBit(rc, probs + m, bit);
1012 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1225 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1782 CLzmaProb *probs; local
1980 CLzmaProb *probs = p->posSlotEncoder[i]; local
[all...] |
| /external/chromium_org/third_party/cld/encodings/compact_lang_det/ |
| cldutil_dbg.h | 41 void DbgScoreRecord(const char* src, uint32 probs, int len);
63 void DbgProbsToStderr(uint32 probs);
66 void DbgBiTermToStderr(uint32 bihash, uint32 probs,
68 void DbgQuadTermToStderr(uint32 quadhash, uint32 probs,
70 void DbgWordTermToStderr(uint64 wordhash, uint32 probs,
|
| cldutil_dbg_empty.cc | 42 void DbgScoreRecord(const char* src, uint32 probs, int len) {};
64 void DbgProbsToStderr(uint32 probs) {};
67 void DbgBiTermToStderr(uint32 bihash, uint32 probs,
69 void DbgQuadTermToStderr(uint32 quadhash, uint32 probs,
71 void DbgWordTermToStderr(uint64 wordhash, uint32 probs,
|
| cldutil.cc | 46 // Routines to access a hash table of <key:wordhash, value:probs> pairs
50 // Probs is a packed: three languages plus a subscript for probability table
383 // Input: 1-byte entry of subscript into unigram probs, plus
389 if (pa->probs[0] > 0) {tote->Add(cld::PackLanguage(CHINESE), pa->probs[0]);}
390 if (pa->probs[1] > 0) {tote->Add(cld::PackLanguage(CHINESE_T), pa->probs[1]);}
391 if (pa->probs[2] > 0) {tote->Add(cld::PackLanguage(JAPANESE), pa->probs[2]);}
392 if (pa->probs[3] > 0) {tote->Add(cld::PackLanguage(KOREAN), pa->probs[3]);
523 uint32 probs = QuadHashV3Lookup4(bigram_obj, bihash); local
590 uint32 probs = QuadHashV3Lookup4(quadgram_obj, quadhash); local
701 uint32 probs = OctaHashV3Lookup4(octagram_obj, wordhash40); local
[all...] |
| /external/libvpx/libvpx/vp8/common/ |
| treecoder.c | 113 vp8_prob probs [ /* n-1 */ ],
137 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for now */
140 probs[t] = vp8_prob_half;
|
| treecoder.h | 70 vp8_prob probs [ /* n-1 */ ],
77 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
83 vp8_prob probs [ /* n-1 */ ],
|
| entropymode.h | 70 /* Key frame default mode probs */
|
| /external/opencv/ml/src/ |
| mlem.cpp | 74 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...] |
| ml_inner_functions.cpp | 184 where Pr{xi = k} == probs[k], 0 < k < len - 1. */
185 CV_IMPL void cvRandSeries( float probs[], int len, int sample[], int amount )
195 knots[0] = probs[0];
197 knots[i] = knots[i - 1] + probs[i];
[all...] |
| _ml.h | 261 /* Fills the <labels> using <probs> by choosing the maximal probability. Outliers are
266 void icvFindClusterLabels( const CvMat* probs, float outlier_thresh, float r,
318 (labels and/or centers and/or probs) back to the output arrays */
322 const CvMat* probs, CvMat* dst_probs,
|
| mlcnn.cpp | 51 CvMat* probs CV_DEFAULT(0) );
316 CvMat* probs )
345 cvPreparePredictData( _image, img_size, 0, nclasses, probs, &img_data );
362 probs_data = probs ? probs->data.fl : 0;
372 if( probs )
376 if( probs )
378 cvExp( probs, probs );
379 CvScalar sum = cvSum( probs );
[all...] |
