Home
last modified time | relevance | path

Searched refs:kBitModelTotal (Results 1 – 7 of 7) 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/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/lzma/C/
DBcj2.c13 #define kBitModelTotal (1 << kNumModelBits) macro
17 #define _UPDATE_0 p->range = bound; *prob = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));
30 p->probs[i] = kBitModelTotal >> 1; in Bcj2Dec_Init()
DBcj2Enc.c25 #define kBitModelTotal (1 << kNumModelBits) macro
53 p->probs[i] = kBitModelTotal >> 1; in Bcj2Enc_Init()
197 *prob = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); in Bcj2Enc_Encode_2()
DLzmaEnc.c42 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
44 #define kProbInitValue (kBitModelTotal >> 1)
357 UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
609 ttt += (kBitModelTotal - ttt) >> kNumMoveBits; in RangeEnc_EncodeBit()
653 for (i = (1 << kNumMoveReducingBits) / 2; i < kBitModelTotal; i += (1 << kNumMoveReducingBits)) in LzmaEnc_InitPriceTables()
675 p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
678 ProbPrices[((prob) ^ ((-((int)(symbol))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];
681 #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
684 #define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
DLzmaDec.c14 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
22 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits…
797 probs[i] = kBitModelTotal >> 1; in LzmaDec_InitStateReal()