1867   UInt32 numAvail, mainDist;  in GetOptimumFast()  local
1917   mainDist = 0; /* for GCC */  in GetOptimumFast()
1921     mainDist = p->matches[(size_t)numPairs - 1];  in GetOptimumFast()
1928       if (!ChangePair(dist2, mainDist))  in GetOptimumFast()
1932       mainDist = dist2;  in GetOptimumFast()
1934     if (mainLen == 2 && mainDist >= 0x80)  in GetOptimumFast()
1940         || (repLen + 2 >= mainLen && mainDist >= (1 << 9))  in GetOptimumFast()
1941         || (repLen + 3 >= mainLen && mainDist >= (1 << 15)))  in GetOptimumFast()
1958       if (   (len1 >= mainLen && newDist < mainDist)  in GetOptimumFast()
1959           || (len1 == mainLen + 1 && !ChangePair(mainDist, newDist))  in GetOptimumFast()
1961           || (len1 + 1 >= mainLen && mainLen >= 3 && ChangePair(newDist, mainDist)))  in GetOptimumFast()
1984   p->backRes = mainDist + LZMA_NUM_REPS;  in GetOptimumFast()