| /device/linaro/bootloader/edk2/BaseTools/Source/C/LzmaCompress/Sdk/C/ |
| LzmaDec.h | 11 but memory usage for CLzmaDec::probs will be doubled in that case */
49 CLzmaProb *probs;
member in struct:__anon6424
67 #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); \
139 CLzmaProb *probs = p->probs; local
500 CLzmaProb *probs = p->probs; local
719 CLzmaProb *probs = p->probs; local
[all...] |
| LzmaEnc.c | 609 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol)
614 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);
620 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte)
627 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);
670 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices)
676 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);
683 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices)
691 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);
700 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)
709 RangeEnc_EncodeBit(rc, probs + m, bit);
1046 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1259 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1817 CLzmaProb *probs; local
2017 CLzmaProb *probs = p->posSlotEncoder[i]; local
[all...] |
| /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/ |
| LzmaDec.h | 11 but memory usage for CLzmaDec::probs will be doubled in that case */
49 CLzmaProb *probs;
member in struct:__anon8071
67 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| LzmaDec.c | 46 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
47 #define TREE_DECODE(probs, limit, i) \
48 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
53 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
55 #define TREE_6_DECODE(probs, i) \
57 TREE_GET_BIT(probs, i); \
58 TREE_GET_BIT(probs, i); \
59 TREE_GET_BIT(probs, i); \
158 CLzmaProb *probs = p->probs; local
519 CLzmaProb *probs = p->probs; local
737 CLzmaProb *probs = p->probs; local
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/ |
| LzmaDec.h | 11 but memory usage for CLzmaDec::probs will be doubled in that case */
49 CLzmaProb *probs;
member in struct:__anon8988
67 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| LzmaDec.c | 46 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
47 #define TREE_DECODE(probs, limit, i) \
48 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
53 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
55 #define TREE_6_DECODE(probs, i) \
57 TREE_GET_BIT(probs, i); \
58 TREE_GET_BIT(probs, i); \
59 TREE_GET_BIT(probs, i); \
158 CLzmaProb *probs = p->probs; local
519 CLzmaProb *probs = p->probs; local
737 CLzmaProb *probs = p->probs; 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/lzma/C/ |
| LzmaDec.h | 13 but memory usage for CLzmaDec::probs will be doubled in that case */
51 CLzmaProb *probs;
member in struct:__anon26868
69 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| Bcj2.h | 75 UInt16 probs[2 + 256];
member in struct:__anon26856
128 UInt16 probs[2 + 256];
member in struct:__anon26858
|
| LzmaDec.c | 29 #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, i); \
142 CLzmaProb *probs = p->probs; local
583 const CLzmaProb *probs = p->probs; local
795 CLzmaProb *probs = p->probs; local
[all...] |
| LzmaEnc.c | 625 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol)
630 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);
636 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte)
643 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);
686 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, const UInt32 *ProbPrices)
692 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);
699 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, const UInt32 *ProbPrices)
707 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);
716 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol)
725 RangeEnc_EncodeBit(rc, probs + m, bit);
1072 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1288 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1848 CLzmaProb *probs; local
2039 CLzmaProb *probs = p->litProbs; local
2047 CLzmaProb *probs = p->posSlotEncoder[i]; local
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_entropy.c | 1057 vp9_coeff_probs_model *const probs = cm->fc->coef_probs[tx_size]; local
[all...] |
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
| LZMACoder.java | 109 final short[] probs = new short[0x300]; field in class:LZMACoder.LiteralCoder.LiteralSubcoder
112 RangeCoder.initProbs(probs);
|
| /frameworks/base/packages/EasterEgg/src/com/android/egg/neko/ |
| NekoService.java | 96 final int[] probs = getResources().getIntArray(R.array.food_new_cat_prob); local
97 final float new_cat_prob = (float)((food < probs.length) ? probs[food] : 50) / 100f;
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_rd.c | 99 vpx_prob probs[ENTROPY_NODES]; local
100 vp9_model_to_full_probs(p[t][i][j][k][l], probs);
101 vp9_cost_tokens((int *)c[t][i][j][k][0][l], probs, vp9_coef_tree);
102 vp9_cost_tokens_skip((int *)c[t][i][j][k][1][l], probs,
|
| vp9_bitstream.c | 52 const vpx_prob *probs) {
53 vp9_write_token(w, vp9_intra_mode_tree, probs, &intra_mode_encodings[mode]);
57 const vpx_prob *probs) {
59 vp9_write_token(w, vp9_inter_mode_tree, probs,
69 vpx_prob probs[/*n - 1*/],
80 vp9_cond_prob_diff_update(w, &probs[i], branch_ct[i]);
402 const vpx_prob *const probs = xd->partition_probs[ctx]; local
407 vp9_write_token(w, vp9_partition_tree, probs, &partition_encodings[p]);
410 vpx_write(w, p == PARTITION_SPLIT, probs[1]);
413 vpx_write(w, p == PARTITION_SPLIT, probs[2])
[all...] |
| /external/lzma/CPP/7zip/Bundles/LzmaSpec/ |
| LzmaSpec.cpp | 223 unsigned BitTreeReverseDecode(CProb *probs, unsigned numBits, CRangeDecoder *rc)
229 unsigned bit = rc->DecodeBit(&probs[m]);
240 CProb Probs[(unsigned)1 << NumBits];
246 INIT_PROBS(Probs);
253 m = (m << 1) + rc->DecodeBit(&Probs[m]);
259 return BitTreeReverseDecode(Probs, NumBits, rc);
380 CProb *probs = &LitProbs[(UInt32)0x300 * litState];
local
389 unsigned bit = RangeDec.DecodeBit(&probs[((1 + matchBit) << 8) + symbol]);
397 symbol = (symbol << 1) | RangeDec.DecodeBit(&probs[symbol]);
|
| /external/xz-embedded/linux/lib/xz/ |
| 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/libvpx/libvpx/vp9/decoder/ |
| vp9_decodeframe.c | 893 const vpx_prob *const probs = twd->xd.partition_probs[ctx]; 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...] |
| /external/toybox/toys/pending/ |
| xzcat.c | 1725 uint16_t *probs; local
1764 uint16_t *probs; local
1790 uint16_t *probs; local
1911 uint16_t *probs; local
[all...] |
| /cts/apps/CtsVerifier/libs/ |
| opencv3-android.jar | |
