/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, argument 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) { argument 54 cost(costs, tree, probs, 0, 0); 57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) { argument 60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); 61 cost(costs, tree, probs, 2, 0);
|
H A D | vp9_cost.h | 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs, argument 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);
|
H A D | 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); 31 vp9_write_tree(vp9_writer *w, const vp9_tree_index *tree, const vp9_prob *probs, int bits, int len, vp9_tree_index i) argument 41 vp9_write_token(vp9_writer *w, const vp9_tree_index *tree, const vp9_prob *probs, const struct vp9_token *token) argument
|
H A D | vp9_segmentation.c | 73 static int cost_segmap(int *segcounts, vp9_prob *probs) { argument 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[ [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, argument 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) { argument 54 cost(costs, tree, probs, 0, 0); 57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) { argument 60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); 61 cost(costs, tree, probs, 2, 0);
|
H A D | vp9_cost.h | 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs, argument 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);
|
H A D | 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); 31 vp9_write_tree(vp9_writer *w, const vp9_tree_index *tree, const vp9_prob *probs, int bits, int len, vp9_tree_index i) argument 41 vp9_write_token(vp9_writer *w, const vp9_tree_index *tree, const vp9_prob *probs, const struct vp9_token *token) argument
|
H A D | vp9_segmentation.c | 83 static int cost_segmap(int *segcounts, vp9_prob *probs) { argument 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[ [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
H A D | 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); 33 tree_merge_probs_impl(unsigned int i, const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update, vp9_prob *probs) argument 56 vp9_tree_merge_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update_factor, vp9_prob *probs) argument
|
H A D | vp9_entropy.c | 739 static void extend_to_full_distribution(vp9_prob *probs, vp9_prob p) { argument 740 vpx_memcpy(probs, vp9_pareto8_full[p = 0 ? 0 : p - 1], 768 vp9_coeff_probs_model *const probs = cm->fc.coef_probs[tx_size]; local 789 probs[i][j][k][l][m] = merge_probs(pre_probs[i][j][k][l][m],
|
/external/libvpx/libvpx/vp9/common/ |
H A D | 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); 33 tree_merge_probs_impl(unsigned int i, const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update, vp9_prob *probs) argument 56 vp9_tree_merge_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, const unsigned int *counts, unsigned int count_sat, unsigned int max_update_factor, vp9_prob *probs) argument
|
/external/lzma/Java/SevenZip/Compression/RangeCoder/ |
H A D | Decoder.java | 54 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 D | Encoder.java | 96 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/chromium_org/third_party/cld/encodings/compact_lang_det/ |
H A D | 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,
|
H A D | cldutil_dbg_empty.cc | 42 void DbgScoreRecord(const char* src, uint32 probs, int len) {}; argument 64 void DbgProbsToStderr(uint32 probs) {}; argument 67 void DbgBiTermToStderr(uint32 bihash, uint32 probs, argument 69 void DbgQuadTermToStderr(uint32 quadhash, uint32 probs, argument 71 void DbgWordTermToStderr(uint64 wordhash, uint32 probs, argument
|
H A D | cldutil.cc | 46 // Routines to access a hash table of <key:wordhash, value:probs> pairs 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[ 401 ProcessProbV25Tote(uint32 probs, Tote* tote) argument 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/ |
H A D | 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, 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/ |
H A D | 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, 134 CLzmaProb *probs = p->probs; local 493 CLzmaProb *probs = p->probs; local 712 CLzmaProb *probs = p->probs; local [all...] |
/external/lzma/C/ |
H A D | 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, 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/ |
H A D | 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 */ ],
|
H A D | 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;
|
/external/libvpx/libvpx/vp8/common/ |
H A D | 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 */ ],
|
H A D | 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;
|
/external/deqp/modules/gles2/stress/ |
H A D | es2sLongRunningTests.cpp | 79 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 D | es3sLongRunningTests.cpp | 79 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...] |