| /external/chromium_org/third_party/lzma_sdk/ |
| LzmaDec.h | 15 but memory usage for CLzmaDec::probs will be doubled in that case */
53 CLzmaProb *probs; member in struct:__anon18058
71 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| 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...] |
| 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.h | 16 but memory usage for CLzmaDec::probs will be doubled in that case */
54 CLzmaProb *probs; member in struct:__anon19382
72 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| 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...] |
| 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/deqp/modules/gles2/stress/ |
| es2sLongRunningTests.cpp | 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
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_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles2::Stress::Case
208 const Probs probs; member in struct:deqp::gles2::Stress::Case
257 const Probs probs; member in struct:deqp::gles2::Stress::Case
[all...] |
| /external/deqp/modules/gles3/stress/ |
| es3sLongRunningTests.cpp | 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
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_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles3::Stress::Case
208 const Probs probs; member in struct:deqp::gles3::Stress::Case
257 const Probs probs; member in struct:deqp::gles3::Stress::Case
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_entropy.c | 711 static void extend_to_full_distribution(vp9_prob *probs, vp9_prob p) {
712 vpx_memcpy(probs, vp9_pareto8_full[p = 0 ? 0 : p - 1],
740 vp9_coeff_probs_model *const probs = cm->fc.coef_probs[tx_size]; local
[all...] |
| /external/lzma/C/ |
| LzmaDec.h | 15 but memory usage for CLzmaDec::probs will be doubled in that case */
53 CLzmaProb *probs;
member in struct:__anon6258
71 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| 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...] |
| 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.h | 85 uint8 probs[8]; member in struct:cld::__anon16340
[all...] |
| 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...] |
| compact_lang_det_impl.cc | 82 // Three packed language probs, subscripted by Encoding
168 // Three packed language probs, subscripted by (anchor) language
343 uint32 probs; member in struct:__anon16341
347 // Massaged TLD, followed by three packed language probs
1792 uint32 probs = kTLDHintProbs[n].probs; local
1814 uint32 probs = kEncodingHintProbs[encoding_hint]; local
1835 uint32 probs = kLanguageHintProbs[language_hint]; local
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
| vp9_entropy.c | 739 static void extend_to_full_distribution(vp9_prob *probs, vp9_prob p) {
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
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_rd.c | 84 vp9_prob probs[ENTROPY_NODES]; local
85 vp9_model_to_full_probs(p[t][i][j][k][l], probs);
86 vp9_cost_tokens((int *)c[t][i][j][k][0][l], probs,
88 vp9_cost_tokens_skip((int *)c[t][i][j][k][1][l], probs,
|
| vp9_bitstream.c | 50 const vp9_prob *probs) {
51 vp9_write_token(w, vp9_intra_mode_tree, probs, &intra_mode_encodings[mode]);
55 const vp9_prob *probs) {
57 vp9_write_token(w, vp9_inter_mode_tree, probs,
67 vp9_prob probs[/*n - 1*/],
78 vp9_cond_prob_diff_update(w, &probs[i], branch_ct[i]);
398 const vp9_prob *const probs = get_partition_probs(cm, ctx); local
403 vp9_write_token(w, vp9_partition_tree, probs, &partition_encodings[p]);
406 vp9_write(w, p == PARTITION_SPLIT, probs[1]);
409 vp9_write(w, p == PARTITION_SPLIT, probs[2])
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/decoder/ |
| vp9_decodeframe.c | 392 const vp9_prob *const probs = get_partition_probs(cm, ctx); local
398 p = (PARTITION_TYPE)vp9_read_tree(r, vp9_partition_tree, probs);
400 p = vp9_read(r, probs[1]) ? PARTITION_SPLIT : PARTITION_HORZ;
402 p = vp9_read(r, probs[2]) ? PARTITION_SPLIT : PARTITION_VERT;
[all...] |
| /external/libvpx/libvpx/vp9/decoder/ |
| vp9_decodeframe.c | 383 const vp9_prob *const probs = get_partition_probs(cm, ctx); local
389 p = (PARTITION_TYPE)vp9_read_tree(r, vp9_partition_tree, probs);
391 p = vp9_read(r, probs[1]) ? PARTITION_SPLIT : PARTITION_HORZ;
393 p = vp9_read(r, probs[2]) ? PARTITION_SPLIT : PARTITION_VERT;
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_bitstream.c | 51 const vp9_prob *probs) {
52 vp9_write_token(w, vp9_intra_mode_tree, probs, &intra_mode_encodings[mode]);
56 const vp9_prob *probs) {
58 vp9_write_token(w, vp9_inter_mode_tree, probs,
68 vp9_prob probs[/*n - 1*/],
79 vp9_cond_prob_diff_update(w, &probs[i], branch_ct[i]);
399 const vp9_prob *const probs = get_partition_probs(cm, ctx); local
404 vp9_write_token(w, vp9_partition_tree, probs, &partition_encodings[p]);
407 vp9_write(w, p == PARTITION_SPLIT, probs[1]);
410 vp9_write(w, p == PARTITION_SPLIT, probs[2])
[all...] |
| vp9_rdopt.c | 184 vp9_prob probs[ENTROPY_NODES]; local
185 vp9_model_to_full_probs(p[t][i][j][k][l], probs);
186 vp9_cost_tokens((int *)c[t][i][j][k][0][l], probs,
188 vp9_cost_tokens_skip((int *)c[t][i][j][k][1][l], probs,
[all...] |
| /external/lzma/xz-embedded/ |
| xz_dec_lzma2.c | 520 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 = l->low[pos_state]
648 uint16_t *probs; local
769 uint16_t *probs; local
[all...] |
| /external/opencv/ml/include/ |
| ml.h | 562 start_step(0/*CvEM::START_AUTO_STEP*/), probs(0), weights(0), means(0), covs(0)
572 probs(_probs), weights(_weights), means(_means), covs(_covs), term_crit(_term_crit)
578 const CvMat* probs; member in struct:CvEMParams
604 virtual float predict( const CvMat* sample, CvMat* probs ) const;
631 CvMat* probs; member in class:CvEM
[all...] |
