Lines Matching refs:kNumRepDistances
55 int[] _repDistances = new int[Base.kNumRepDistances];
61 for (int i = 0; i < Base.kNumRepDistances; i++) in BaseInit()
535 int[] reps = new int[Base.kNumRepDistances];
536 int[] repLens = new int[Base.kNumRepDistances];
573 for (i = 0; i < Base.kNumRepDistances; i++) in GetOptimum()
590 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances; in GetOptimum()
645 for (i = 0; i < Base.kNumRepDistances; i++) in GetOptimum()
683 optimum.BackPrev = distance + Base.kNumRepDistances; in GetOptimum()
720 if (_optimum[cur].BackPrev2 < Base.kNumRepDistances) in GetOptimum()
750 if (pos < Base.kNumRepDistances) in GetOptimum()
756 if (pos < Base.kNumRepDistances) in GetOptimum()
789 reps[0] = (pos - Base.kNumRepDistances); in GetOptimum()
881 for (int repIndex = 0; repIndex < Base.kNumRepDistances; repIndex++) in GetOptimum()
977 optimum.BackPrev = curBack + Base.kNumRepDistances; in GetOptimum()
1017 optimum.BackPrev2 = curBack + Base.kNumRepDistances; in GetOptimum()
1131 if (pos < Base.kNumRepDistances) in CodeOneBlock()
1173 pos -= Base.kNumRepDistances; in CodeOneBlock()
1195 for (int i = Base.kNumRepDistances - 1; i >= 1; i--) in CodeOneBlock()