Home
last modified time | relevance | path

Searched refs:kBitModelTotal (Results 1 – 13 of 13) sorted by relevance

/external/lzma/CS/7zip/Compress/RangeCoder/
DRangeCoderBit.cs8 public const uint kBitModelTotal = (1 << kNumBitModelTotalBits); field
15 public void Init() { Prob = kBitModelTotal >> 1; } in Init()
20 Prob += (kBitModelTotal - Prob) >> kNumMoveBits; in UpdateModel()
33 Prob += (kBitModelTotal - Prob) >> kNumMoveBits; in Encode()
48 private static UInt32[] ProbPrices = new UInt32[kBitModelTotal >> kNumMoveReducingBits];
65 …return ProbPrices[(((Prob - symbol) ^ ((-(int)symbol))) & (kBitModelTotal - 1)) >> kNumMoveReducin… in GetPrice()
68 public uint GetPrice1() { return ProbPrices[(kBitModelTotal - Prob) >> kNumMoveReducingBits]; } in GetPrice1()
74 public const uint kBitModelTotal = (1 << kNumBitModelTotalBits); field
82 Prob += (kBitModelTotal - Prob) >> numMoveBits; in UpdateModel()
87 public void Init() { Prob = kBitModelTotal >> 1; } in Init()
[all …]
/external/lzma/CPP/7zip/Compress/
DRangeCoderBit.h13 const UInt32 kBitModelTotal = (1 << kNumBitModelTotalBits); variable
20 extern UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
34 Prob += (kBitModelTotal - Prob) >> numMoveBits; in UpdateModel()
39 void Init() { Prob = kBitModelTotal / 2; } in Init()
56 this->Prob += (kBitModelTotal - this->Prob) >> numMoveBits; in Encode()
72 … return ProbPrices[(this->Prob ^ ((-(int)symbol)) & (kBitModelTotal - 1)) >> kNumMoveReducingBits]; in GetPrice()
75 …UInt32 GetPrice1() const { return ProbPrices[(this->Prob ^ (kBitModelTotal - 1)) >> kNumMoveReduci… in GetPrice1()
89 this->Prob += (kBitModelTotal - this->Prob) >> numMoveBits; in Decode()
/external/lzma/Java/SevenZip/Compression/RangeCoder/
DEncoder.java9 static final int kBitModelTotal = (1 << kNumBitModelTotalBits); field in Encoder
99 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in Encode()
124 private static int[] ProbPrices = new int[kBitModelTotal >>> kNumMoveReducingBits];
141 …return ProbPrices[(((Prob - symbol) ^ ((-symbol))) & (kBitModelTotal - 1)) >>> kNumMoveReducingBit… in GetPrice()
149 return ProbPrices[(kBitModelTotal - Prob) >>> kNumMoveReducingBits]; in GetPrice1()
DDecoder.java9 static final int kBitModelTotal = (1 << kNumBitModelTotalBits); field in Decoder
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in DecodeBit()
86 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
/external/chromium_org/third_party/lzma_sdk/
DBcj2.c19 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
30 #define UPDATE_0(p) range = bound; *(p) = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); …
49 p[i] = kBitModelTotal >> 1; in Bcj2_Decode()
DLzmaEnc.c37 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
39 #define kProbInitValue (kBitModelTotal >> 1)
285 UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
559 ttt += (kBitModelTotal - ttt) >> kNumMoveBits; in RangeEnc_EncodeBit()
603 for (i = (1 << kNumMoveReducingBits) / 2; i < kBitModelTotal; i += (1 << kNumMoveReducingBits)) in LzmaEnc_InitPriceTables()
625 p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
628 ProbPrices[((prob) ^ ((-((int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
631 #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
634 #define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
DLzmaDec.c12 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
20 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits…
713 probs[i] = kBitModelTotal >> 1; in LzmaDec_InitStateReal()
/external/lzma/C/
DBcj2.c19 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
30 #define UPDATE_0(p) range = bound; *(p) = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); …
49 p[i] = kBitModelTotal >> 1; in Bcj2_Decode()
DLzmaEnc.c37 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
39 #define kProbInitValue (kBitModelTotal >> 1)
285 UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
559 ttt += (kBitModelTotal - ttt) >> kNumMoveBits; in RangeEnc_EncodeBit()
603 for (i = (1 << kNumMoveReducingBits) / 2; i < kBitModelTotal; i += (1 << kNumMoveReducingBits)) in LzmaEnc_InitPriceTables()
625 p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
628 ProbPrices[((prob) ^ ((-((int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
631 #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
634 #define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
DLzmaDec.c12 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
20 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits…
713 probs[i] = kBitModelTotal >> 1; in LzmaDec_InitStateReal()
/external/chromium_org/third_party/ots/third_party/lzma_sdk/
DLzmaEnc.c38 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
40 #define kProbInitValue (kBitModelTotal >> 1)
286 UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
560 ttt += (kBitModelTotal - ttt) >> kNumMoveBits; in RangeEnc_EncodeBit()
604 for (i = (1 << kNumMoveReducingBits) / 2; i < kBitModelTotal; i += (1 << kNumMoveReducingBits)) in LzmaEnc_InitPriceTables()
626 p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
629 ProbPrices[((prob) ^ ((-((int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
632 #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
635 #define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
DLzmaDec.c13 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
21 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits…
714 probs[i] = kBitModelTotal >> 1; in LzmaDec_InitStateReal()
/external/chromium_org/third_party/brotli/src/
Dots-lzma.patch836 +#define kBitModelTotal (1 << kNumBitModelTotalBits)
844 +#define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBit…
1537 + probs[i] = kBitModelTotal >> 1;
2942 +#define kBitModelTotal (1 << kNumBitModelTotalBits)
2944 +#define kProbInitValue (kBitModelTotal >> 1)
3190 + UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
3464 + ttt += (kBitModelTotal - ttt) >> kNumMoveBits;
3508 + for (i = (1 << kNumMoveReducingBits) / 2; i < kBitModelTotal; i += (1 << kNumMoveReducingBits))
3530 + p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
3533 + ProbPrices[((prob) ^ ((-((int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
[all …]