Searched refs:kBitModelTotal (Results 1 – 9 of 9) sorted by relevance
8 public const uint kBitModelTotal = (1 << kNumBitModelTotalBits); field15 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); field82 Prob += (kBitModelTotal - Prob) >> numMoveBits; in UpdateModel()87 public void Init() { Prob = kBitModelTotal >> 1; } in Init()[all …]
9 static final int kBitModelTotal = (1 << kNumBitModelTotalBits); field in Encoder99 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()
9 static final int kBitModelTotal = (1 << kNumBitModelTotalBits); field in Decoder61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in DecodeBit()86 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
13 #define kBitModelTotal (1 << kNumModelBits) macro17 #define _UPDATE_0 p->range = bound; *prob = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));30 p->probs[i] = kBitModelTotal >> 1; in Bcj2Dec_Init()
24 #define kBitModelTotal (1 << kNumModelBits) macro52 p->probs[i] = kBitModelTotal >> 1; in Bcj2Enc_Init()196 *prob = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); in Bcj2Enc_Encode_2()
33 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro35 #define kProbInitValue (kBitModelTotal >> 1)356 CProbPrice ProbPrices[kBitModelTotal >> kNumMoveReducingBits];639 if (bit == 0) { range = newBound; ttt += (kBitModelTotal - ttt) >> kNumMoveBits; } \657 mask &= (kBitModelTotal - ((1 << kNumMoveBits) - 1)); \670 range = newBound; *(prob) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));736 for (i = 0; i < (kBitModelTotal >> kNumMoveReducingBits); i++) in LzmaEnc_InitPriceTables()759 …p->ProbPrices[((prob) ^ (unsigned)(((-(int)(bit))) & (kBitModelTotal - 1))) >> kNumMoveReducingBit…762 … ProbPrices[((prob) ^ (unsigned)((-((int)(bit))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits];765 #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits][all …]
15 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro23 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits…908 probs[i] = kBitModelTotal >> 1; in LzmaDec_DecodeToDic()
15 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro23 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits…739 probs[i] = kBitModelTotal >> 1; in LzmaDec_InitStateReal()
145 kBitModelTotal equ (1 SHL kNumBitModelTotalBits) define423 ; mov t1, kBitModelTotal683 mov kBitModelTotal_reg, kBitModelTotal