297   UInt32 numAvail;  member
839   p->numAvail = p->matchFinder.GetNumAvailableBytes(p->matchFinderObj);  in ReadMatchDistances()
857       UInt32 numAvail = p->numAvail;  in ReadMatchDistances()  local
858       if (numAvail > LZMA_MATCH_LEN_MAX)  in ReadMatchDistances()
859         numAvail = LZMA_MATCH_LEN_MAX;  in ReadMatchDistances()
862         for (; lenRes < numAvail && pby[lenRes] == pby2[lenRes]; lenRes++);  in ReadMatchDistances()
951   UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur;  in GetOptimum()  local
975   numAvail = p->numAvail;  in GetOptimum()
976   if (numAvail < 2)  in GetOptimum()
981   if (numAvail > LZMA_MATCH_LEN_MAX)  in GetOptimum()
982     numAvail = LZMA_MATCH_LEN_MAX;  in GetOptimum()
997     for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
1276     numAvailFull = p->numAvail;  in GetOptimum()
1285     numAvail = (numAvailFull <= p->numFastBytes ? numAvailFull : p->numFastBytes);  in GetOptimum()
1338       for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
1410     if (newLen > numAvail)  in GetOptimum()
1412       newLen = numAvail;  in GetOptimum()
1511   UInt32 numAvail, mainLen, mainDist, numPairs, repIndex, repLen, i;  in GetOptimumFast()  local
1523   numAvail = p->numAvail;  in GetOptimumFast()
1525   if (numAvail < 2)  in GetOptimumFast()
1527   if (numAvail > LZMA_MATCH_LEN_MAX)  in GetOptimumFast()
1528     numAvail = LZMA_MATCH_LEN_MAX;  in GetOptimumFast()
1538     for (len = 2; len < numAvail && data[len] == data2[len]; len++);  in GetOptimumFast()
1586   if (mainLen < 2 || numAvail <= 2)  in GetOptimumFast()