Lines Matching refs:state2
854 Base.State state2 = state; in GetOptimum()
855 state2.UpdateChar(); in GetOptimum()
858 _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice1() + in GetOptimum()
859 _isRep[state2.Index].GetPrice1(); in GetOptimum()
865 0, lenTest2, state2, posStateNext); in GetOptimum()
914 Base.State state2 = state; in GetOptimum()
915 state2.UpdateRep(); in GetOptimum()
919 _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice0() + in GetOptimum()
924 state2.UpdateChar(); in GetOptimum()
926 …UInt32 nextMatchPrice = curAndLenCharPrice + _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) … in GetOptimum()
927 UInt32 nextRepMatchPrice = nextMatchPrice + _isRep[state2.Index].GetPrice1(); in GetOptimum()
934 UInt32 curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()
989 Base.State state2 = state; in GetOptimum()
990 state2.UpdateMatch(); in GetOptimum()
993 _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice0() + in GetOptimum()
999 state2.UpdateChar(); in GetOptimum()
1001 …UInt32 nextMatchPrice = curAndLenCharPrice + _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) … in GetOptimum()
1002 UInt32 nextRepMatchPrice = nextMatchPrice + _isRep[state2.Index].GetPrice1(); in GetOptimum()
1007 curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()