290   UInt32 numAvail;  member
830   p->numAvail = p->matchFinder.GetNumAvailableBytes(p->matchFinderObj);  in ReadMatchDistances()
850       UInt32 numAvail = p->numAvail;  in ReadMatchDistances()  local
851       if (numAvail > LZMA_MATCH_LEN_MAX)  in ReadMatchDistances()
852         numAvail = LZMA_MATCH_LEN_MAX;  in ReadMatchDistances()
855         for (; lenRes < numAvail && pby[lenRes] == pby2[lenRes]; lenRes++);  in ReadMatchDistances()
944   UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur;  in GetOptimum()  local
968   numAvail = p->numAvail;  in GetOptimum()
969   if (numAvail < 2)  in GetOptimum()
974   if (numAvail > LZMA_MATCH_LEN_MAX)  in GetOptimum()
975     numAvail = LZMA_MATCH_LEN_MAX;  in GetOptimum()
990     for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
1269     numAvailFull = p->numAvail;  in GetOptimum()
1278     numAvail = (numAvailFull <= p->numFastBytes ? numAvailFull : p->numFastBytes);  in GetOptimum()
1331       for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
1403     if (newLen > numAvail)  in GetOptimum()
1405       newLen = numAvail;  in GetOptimum()
1504   UInt32 numAvail, mainLen, mainDist, numPairs, repIndex, repLen, i;  in GetOptimumFast()  local
1516   numAvail = p->numAvail;  in GetOptimumFast()
1518   if (numAvail < 2)  in GetOptimumFast()
1520   if (numAvail > LZMA_MATCH_LEN_MAX)  in GetOptimumFast()
1521     numAvail = LZMA_MATCH_LEN_MAX;  in GetOptimumFast()
1531     for (len = 2; len < numAvail && data[len] == data2[len]; len++);  in GetOptimumFast()
1579   if (mainLen < 2 || numAvail <= 2)  in GetOptimumFast()