Lines Matching refs:numAvail
309 UInt32 numAvail; member
987 p->numAvail = p->matchFinder.GetNumAvailableBytes(p->matchFinderObj); in ReadMatchDistances()
1008 UInt32 numAvail = p->numAvail; in ReadMatchDistances() local
1009 if (numAvail > LZMA_MATCH_LEN_MAX) in ReadMatchDistances()
1010 numAvail = LZMA_MATCH_LEN_MAX; in ReadMatchDistances()
1015 const Byte *lim = p1 + numAvail; in ReadMatchDistances()
1126 UInt32 numAvail; in GetOptimum() local
1142 numAvail = p->numAvail; in GetOptimum()
1143 if (numAvail < 2) in GetOptimum()
1148 if (numAvail > LZMA_MATCH_LEN_MAX) in GetOptimum()
1149 numAvail = LZMA_MATCH_LEN_MAX; in GetOptimum()
1165 for (len = 2; len < numAvail && data[len] == data2[len]; len++) in GetOptimum()
1339 unsigned numAvail; in GetOptimum() local
1524 numAvailFull = p->numAvail; in GetOptimum()
1558 numAvail = (numAvailFull <= p->numFastBytes ? numAvailFull : p->numFastBytes); in GetOptimum()
1627 for (len = 2; len < numAvail && data[len] == data2[len]; len++) in GetOptimum()
1727 if (newLen > numAvail) in GetOptimum()
1729 newLen = numAvail; in GetOptimum()
1867 UInt32 numAvail, mainDist; in GetOptimumFast() local
1879 numAvail = p->numAvail; in GetOptimumFast()
1881 if (numAvail < 2) in GetOptimumFast()
1884 if (numAvail > LZMA_MATCH_LEN_MAX) in GetOptimumFast()
1885 numAvail = LZMA_MATCH_LEN_MAX; in GetOptimumFast()
1895 for (len = 2; len < numAvail && data[len] == data2[len]; len++) in GetOptimumFast()
1948 if (mainLen < 2 || numAvail <= 2) in GetOptimumFast()