Searched refs:kNumStates (Results 1 – 11 of 11) sorted by relevance
138 BitDecoder[] m_IsMatchDecoders = new BitDecoder[Base.kNumStates << Base.kNumPosStatesBitsMax];139 BitDecoder[] m_IsRepDecoders = new BitDecoder[Base.kNumStates];140 BitDecoder[] m_IsRepG0Decoders = new BitDecoder[Base.kNumStates];141 BitDecoder[] m_IsRepG1Decoders = new BitDecoder[Base.kNumStates];142 BitDecoder[] m_IsRepG2Decoders = new BitDecoder[Base.kNumStates];143 BitDecoder[] m_IsRep0LongDecoders = new BitDecoder[Base.kNumStates << Base.kNumPosStatesBitsMax];204 for (i = 0; i < Base.kNumStates; i++) in Init()
8 public const uint kNumStates = 12; field in SevenZip.Compression.LZMA.Base
307 …RangeCoder.BitEncoder[] _isMatch = new RangeCoder.BitEncoder[Base.kNumStates << Base.kNumPosStates…308 RangeCoder.BitEncoder[] _isRep = new RangeCoder.BitEncoder[Base.kNumStates];309 RangeCoder.BitEncoder[] _isRepG0 = new RangeCoder.BitEncoder[Base.kNumStates];310 RangeCoder.BitEncoder[] _isRepG1 = new RangeCoder.BitEncoder[Base.kNumStates];311 RangeCoder.BitEncoder[] _isRepG2 = new RangeCoder.BitEncoder[Base.kNumStates];312 …RangeCoder.BitEncoder[] _isRep0Long = new RangeCoder.BitEncoder[Base.kNumStates << Base.kNumPosSta…401 for (i = 0; i < Base.kNumStates; i++) in Init()
126 short[] m_IsMatchDecoders = new short[Base.kNumStates << Base.kNumPosStatesBitsMax];127 short[] m_IsRepDecoders = new short[Base.kNumStates];128 short[] m_IsRepG0Decoders = new short[Base.kNumStates];129 short[] m_IsRepG1Decoders = new short[Base.kNumStates];130 short[] m_IsRepG2Decoders = new short[Base.kNumStates];131 short[] m_IsRep0LongDecoders = new short[Base.kNumStates << Base.kNumPosStatesBitsMax];
8 public static final int kNumStates = 12; field in Base
307 short[] _isMatch = new short[Base.kNumStates<<Base.kNumPosStatesBitsMax];308 short[] _isRep = new short[Base.kNumStates];309 short[] _isRepG0 = new short[Base.kNumStates];310 short[] _isRepG1 = new short[Base.kNumStates];311 short[] _isRepG2 = new short[Base.kNumStates];312 short[] _isRep0Long = new short[Base.kNumStates<<Base.kNumPosStatesBitsMax];
265 #define kNumStates 12 macro435 CProb IsMatch[kNumStates << kNumPosBitsMax];436 CProb IsRep[kNumStates];437 CProb IsRepG0[kNumStates];438 CProb IsRepG1[kNumStates];439 CProb IsRepG2[kNumStates];440 CProb IsRep0Long[kNumStates << kNumPosBitsMax];
100 #define kNumStates 12 macro140 #define IsRepG0 (IsRep + kNumStates)141 #define IsRepG1 (IsRepG0 + kNumStates)142 #define IsRepG2 (IsRepG1 + kNumStates)143 #define PosSlot (IsRepG2 + kNumStates)313 state += kNumStates; in LZMA_DECODE_REAL()444 if (state >= kNumStates) in LZMA_DECODE_REAL()508 state -= kNumStates; in LZMA_DECODE_REAL()518 state = (state < kNumStates + kNumLitStates) ? kNumLitStates : kNumLitStates + 3; in LZMA_DECODE_REAL()768 state = kNumStates; in LzmaDec_TryDummy()
231 #define kNumStates 12 macro280 CLzmaProb isRep[kNumStates];281 CLzmaProb isRepG0[kNumStates];282 CLzmaProb isRepG1[kNumStates];283 CLzmaProb isRepG2[kNumStates];284 CLzmaProb isMatch[kNumStates][LZMA_NUM_PB_STATES_MAX];285 CLzmaProb isRep0Long[kNumStates][LZMA_NUM_PB_STATES_MAX];365 CLzmaProb isRep[kNumStates];366 CLzmaProb isRepG0[kNumStates];367 CLzmaProb isRepG1[kNumStates];[all …]
465 kNumStates equ 12 define490 IsRepG0 equ (IsRep + kNumStates)491 IsRepG1 equ (IsRepG0 + kNumStates)492 IsRepG2 equ (IsRepG1 + kNumStates)493 PosSlot equ (IsRepG2 + kNumStates)757 add state, kNumStates * PMULT791 cmp state, kNumStates * PMULT915 ; state = (state < kNumStates + kNumLitStates) ? kNumLitStates : kNumLitStates + 3;916 cmp state, (kNumStates + kNumLitStates) * PMULT
931 #define kNumStates 12934 CProb IsMatch[kNumStates << kNumPosBitsMax];935 CProb IsRep[kNumStates];936 CProb IsRepG0[kNumStates];937 CProb IsRepG1[kNumStates];938 CProb IsRepG2[kNumStates];939 CProb IsRep0Long[kNumStates << kNumPosBitsMax];