Searched refs:kNumPosBitsMax (Results 1 – 4 of 4) sorted by relevance
263 #define kNumPosBitsMax 4 macro277 CBitTreeDecoder<3> LowCoder[1 << kNumPosBitsMax];278 CBitTreeDecoder<3> MidCoder[1 << kNumPosBitsMax];288 for (unsigned i = 0; i < (1 << kNumPosBitsMax); i++) in Init()435 CProb IsMatch[kNumStates << kNumPosBitsMax];440 CProb IsRep0Long[kNumStates << kNumPosBitsMax];485 if (RangeDec.DecodeBit(&IsMatch[(state << kNumPosBitsMax) + posState]) == 0) in Decode()505 if (RangeDec.DecodeBit(&IsRep0Long[(state << kNumPosBitsMax) + posState]) == 0) in Decode()
451 kNumPosBitsMax equ 4 define452 kNumPosStatesMax equ (1 SHL kNumPosBitsMax)485 RepLenCoder equ (IsRep0Long + (kNumStates2 SHL kNumPosBitsMax))488 kAlign equ (IsMatch + (kNumStates2 SHL kNumPosBitsMax))582 ; prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
85 #define kNumPosBitsMax 4 macro86 #define kNumPosStatesMax (1 << kNumPosBitsMax)135 #define RepLenCoder (IsRep0Long + (kNumStates2 << kNumPosBitsMax))138 #define Align (IsMatch + (kNumStates2 << kNumPosBitsMax))
686 CBitTreeDecoder<3> LowCoder[1 << kNumPosBitsMax];687 CBitTreeDecoder<3> MidCoder[1 << kNumPosBitsMax];697 for (unsigned i = 0; i < (1 << kNumPosBitsMax); i++)932 #define kNumPosBitsMax 4934 CProb IsMatch[kNumStates << kNumPosBitsMax];939 CProb IsRep0Long[kNumStates << kNumPosBitsMax];965 unsigned state2 = (state << kNumPosBitsMax) + posState;