Searched refs:numAvailFull (Results 1 – 1 of 1) sorted by relevance
1276 numAvailFull = p->numAvail; in GetOptimum()1279 if (temp < numAvailFull) in GetOptimum()1280 numAvailFull = temp; in GetOptimum()1283 if (numAvailFull < 2) in GetOptimum()1285 numAvail = (numAvailFull <= p->numFastBytes ? numAvailFull : p->numFastBytes); in GetOptimum()1294 if (limit > numAvailFull) in GetOptimum()1295 limit = numAvailFull; in GetOptimum()1366 if (limit > numAvailFull) in GetOptimum()1367 limit = numAvailFull; in GetOptimum()1456 if (limit > numAvailFull) in GetOptimum()[all …]