Searched refs:numAvailFull (Results 1 – 1 of 1) sorted by relevance
1139 UInt32 numAvailFull, newLen, numPairs, posPrev, state, posState, startLen; in GetOptimum() local1269 numAvailFull = p->numAvail; in GetOptimum()1272 if (temp < numAvailFull) in GetOptimum()1273 numAvailFull = temp; in GetOptimum()1276 if (numAvailFull < 2) in GetOptimum()1278 numAvail = (numAvailFull <= p->numFastBytes ? numAvailFull : p->numFastBytes); in GetOptimum()1287 if (limit > numAvailFull) in GetOptimum()1288 limit = numAvailFull; in GetOptimum()1359 if (limit > numAvailFull) in GetOptimum()1360 limit = numAvailFull; in GetOptimum()[all …]