Searched refs:nRemaining (Results 1 – 2 of 2) sorted by relevance
182 int nRemaining = hi - lo; in sort() local183 if (nRemaining < 2) in sort()187 if (nRemaining < MIN_MERGE) { in sort()199 int minRun = minRunLength(nRemaining); in sort()206 int force = nRemaining <= minRun ? nRemaining : minRun; in sort()217 nRemaining -= runLen; in sort()218 } while (nRemaining != 0); in sort()
214 int nRemaining = hi - lo; in sort() local215 if (nRemaining < 2) in sort()219 if (nRemaining < MIN_MERGE) { in sort()231 int minRun = minRunLength(nRemaining); in sort()238 int force = nRemaining <= minRun ? nRemaining : minRun; in sort()249 nRemaining -= runLen; in sort()250 } while (nRemaining != 0); in sort()