| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
39 const vp9_prob prob = probs[i / 2];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs,
41 cost += vp9_cost_bit(probs[i >> 1], bit);
48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
| vp9_treewriter.h | 32 const vp9_prob *probs, int bits, int len,
36 vp9_write(w, bit, probs[i >> 1]);
42 const vp9_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
|
| vp9_segmentation.c | 73 static int cost_segmap(int *segcounts, vp9_prob *probs) {
82 int cost = c0123 * vp9_cost_zero(probs[0]) +
83 c4567 * vp9_cost_one(probs[0]);
87 cost += c01 * vp9_cost_zero(probs[1]) +
88 c23 * vp9_cost_one(probs[1]);
91 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
92 segcounts[1] * vp9_cost_one(probs[3]);
94 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
95 segcounts[3] * vp9_cost_one(probs[4]);
99 cost += c45 * vp9_cost_zero(probs[2])
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
39 const vp9_prob prob = probs[i / 2];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs,
41 cost += vp9_cost_bit(probs[i >> 1], bit);
48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
| vp9_treewriter.h | 32 const vp9_prob *probs, int bits, int len,
36 vp9_write(w, bit, probs[i >> 1]);
42 const vp9_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
|
| vp9_segmentation.c | 83 static int cost_segmap(int *segcounts, vp9_prob *probs) {
92 int cost = c0123 * vp9_cost_zero(probs[0]) +
93 c4567 * vp9_cost_one(probs[0]);
97 cost += c01 * vp9_cost_zero(probs[1]) +
98 c23 * vp9_cost_one(probs[1]);
101 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
102 segcounts[1] * vp9_cost_one(probs[3]);
104 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
105 segcounts[3] * vp9_cost_one(probs[4]);
109 cost += c45 * vp9_cost_zero(probs[2])
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
39 const vp9_prob prob = probs[i / 2];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs,
41 cost += vp9_cost_bit(probs[i >> 1], bit);
48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
|
| vp9_treewriter.h | 32 const vp9_prob *probs, int bits, int len,
36 vp9_write(w, bit, probs[i >> 1]);
42 const vp9_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
| vp9_prob.c | 39 vp9_prob *probs) {
44 count_sat, max_update, probs);
49 count_sat, max_update, probs);
51 probs[i >> 1] = merge_probs(pre_probs[i >> 1], ct,
58 unsigned int max_update_factor, vp9_prob *probs) {
60 max_update_factor, probs);
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_prob.c | 39 vp9_prob *probs) {
44 count_sat, max_update, probs);
49 count_sat, max_update, probs);
51 probs[i >> 1] = merge_probs(pre_probs[i >> 1], ct,
58 unsigned int max_update_factor, vp9_prob *probs) {
60 max_update_factor, probs);
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_prob.c | 39 vp9_prob *probs) {
44 count_sat, max_update, probs);
49 count_sat, max_update, probs);
51 probs[i >> 1] = merge_probs(pre_probs[i >> 1], ct,
58 unsigned int max_update_factor, vp9_prob *probs) {
60 max_update_factor, probs);
|
| /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/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/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...] |
| /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...] |
| /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...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
| treecoder.h | 74 vp8_prob probs [ /* n-1 */ ],
81 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
87 vp8_prob probs [ /* n-1 */ ],
|
| /external/libvpx/libvpx/vp8/common/ |
| treecoder.h | 74 vp8_prob probs [ /* n-1 */ ],
81 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
87 vp8_prob probs [ /* n-1 */ ],
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/ |
| treecoder.h | 74 vp8_prob probs [ /* n-1 */ ],
81 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
87 vp8_prob probs [ /* n-1 */ ],
|
