Home
last modified time | relevance | path

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

/third_party/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 …]
/third_party/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()
/third_party/lzma/C/
DBcj2.c11 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
25 p->probs[i] = kBitModelTotal >> 1; in Bcj2Dec_Init()
227 *prob = (CBcj2Prob)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); in Bcj2Dec_Decode()
289 #undef kBitModelTotal
DBcj2Enc.c19 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
41 p->probs[i] = kBitModelTotal >> 1; in Bcj2Enc_Init()
324 *prob = (CBcj2Prob)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); in Bcj2Enc_Encode_2()
505 #undef kBitModelTotal
DLzmaEnc.c47 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
49 #define kProbInitValue (kBitModelTotal >> 1)
448 CProbPrice ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
736 if (bit == 0) { range = newBound; ttt += (kBitModelTotal - ttt) >> kNumMoveBits; } \
754 mask &= (kBitModelTotal - ((1 << kNumMoveBits) - 1)); \
767 range = newBound; *(prob) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));
833 for (i = 0; i < (kBitModelTotal >> kNumMoveReducingBits); i++) in LzmaEnc_InitPriceTables()
856 …p->ProbPrices[((prob) ^ (unsigned)(((-(int)(bit))) & (kBitModelTotal - 1))) >> kNumMoveReducingBit…
859 … ProbPrices[((prob) ^ (unsigned)((-((int)(bit))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits]
862 #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits]
[all …]
DLzmaDec.c15 #define kBitModelTotal (1 << kNumBitModelTotalBits) macro
25 #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits…
993 probs[i] = kBitModelTotal >> 1; in LzmaDec_DecodeToDic()
/third_party/lzma/Asm/x86/
DLzmaDecOpt.asm146 kBitModelTotal equ (1 SHL kNumBitModelTotalBits) define
424 ; mov t1, kBitModelTotal
684 mov kBitModelTotal_reg, kBitModelTotal
/third_party/lzma/Asm/arm64/
DLzmaDecOpt.S191 .equ kBitModelTotal , (1 << kNumBitModelTotalBits) define
193 .equ kBitModelOffset , (kBitModelTotal - (1 << kNumMoveBits) + 1)