Searched refs:nRemaining (Results 1 – 3 of 3) sorted by relevance
438 int nRemaining = (seed[BYTES_OFFSET] + 3) >> 2; // converting bytes in words446 intData = new int[only_hash + nRemaining];448 System.arraycopy(seed, 0, intData, 0, nRemaining);449 System.arraycopy(seed, HASH_OFFSET, intData, nRemaining,460 intData = new int[hashes_and_frame + nRemaining];464 intData = new int[hashes_and_frame_extra + nRemaining];477 offset, nRemaining);478 offset += nRemaining;506 int nRemaining = (seed[BYTES_OFFSET] + 3) >> 2; // converting bytes in words local510 for (int i = 0; i < nRemaining; i++) {[all …]
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()