1127     unsigned numPairs, mainLen, repMaxIndex, i, posState;  in GetOptimum()  local
1135       mainLen = ReadMatchDistances(p, &numPairs);  in GetOptimum()
1138       mainLen = p->longestMatchLen;  in GetOptimum()
1183     if (mainLen >= p->numFastBytes)  in GetOptimum()
1186       MOVE_POS(p, mainLen - 1)  in GetOptimum()
1187       return mainLen;  in GetOptimum()
1194     if (last <= mainLen)  in GetOptimum()
1195       last = mainLen;  in GetOptimum()
1271       if (len <= mainLen)  in GetOptimum()
1868   unsigned mainLen, numPairs, repIndex, repLen, i;  in GetOptimumFast()  local
1872     mainLen = ReadMatchDistances(p, &numPairs);  in GetOptimumFast()
1875     mainLen = p->longestMatchLen;  in GetOptimumFast()
1910   if (mainLen >= p->numFastBytes)  in GetOptimumFast()
1913     MOVE_POS(p, mainLen - 1)  in GetOptimumFast()
1914     return mainLen;  in GetOptimumFast()
1919   if (mainLen >= 2)  in GetOptimumFast()
1925       if (mainLen != p->matches[(size_t)numPairs - 4] + 1)  in GetOptimumFast()
1931       mainLen--;  in GetOptimumFast()
1934     if (mainLen == 2 && mainDist >= 0x80)  in GetOptimumFast()
1935       mainLen = 1;  in GetOptimumFast()
1939     if (    repLen + 1 >= mainLen  in GetOptimumFast()
1940         || (repLen + 2 >= mainLen && mainDist >= (1 << 9))  in GetOptimumFast()
1941         || (repLen + 3 >= mainLen && mainDist >= (1 << 15)))  in GetOptimumFast()
1948   if (mainLen < 2 || numAvail <= 2)  in GetOptimumFast()
1958       if (   (len1 >= mainLen && newDist < mainDist)  in GetOptimumFast()
1959           || (len1 == mainLen + 1 && !ChangePair(mainDist, newDist))  in GetOptimumFast()
1960           || (len1 >  mainLen + 1)  in GetOptimumFast()
1961           || (len1 + 1 >= mainLen && mainLen >= 3 && ChangePair(newDist, mainDist)))  in GetOptimumFast()
1974     limit = mainLen - 1;  in GetOptimumFast()
1985   if (mainLen != 2)  in GetOptimumFast()
1987     MOVE_POS(p, mainLen - 2)  in GetOptimumFast()
1989   return mainLen;  in GetOptimumFast()