Lines Matching refs:lo

34                           Int32   lo,  in fallbackSimpleSort()  argument
40 if (lo == hi) return; in fallbackSimpleSort()
42 if (hi - lo > 3) { in fallbackSimpleSort()
43 for ( i = hi-4; i >= lo; i-- ) { in fallbackSimpleSort()
52 for ( i = hi-1; i >= lo; i-- ) { in fallbackSimpleSort()
99 Int32 sp, lo, hi; in fallbackQSort3() local
113 fpop ( lo, hi ); in fallbackQSort3()
114 if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) { in fallbackQSort3()
115 fallbackSimpleSort ( fmap, eclass, lo, hi ); in fallbackQSort3()
128 if (r3 == 0) med = eclass[fmap[lo]]; else in fallbackQSort3()
129 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else in fallbackQSort3()
132 unLo = ltLo = lo; in fallbackQSort3()
166 n = fmin(ltLo-lo, unLo-ltLo); fvswap(lo, unLo-n, n); in fallbackQSort3()
169 n = lo + unLo - ltLo - 1; in fallbackQSort3()
172 if (n - lo > hi - m) { in fallbackQSort3()
173 fpush ( lo, n ); in fallbackQSort3()
177 fpush ( lo, n ); in fallbackQSort3()
489 Int32 lo, in mainSimpleSort() argument
497 bigN = hi - lo + 1; in mainSimpleSort()
507 i = lo + h; in mainSimpleSort()
519 if (j <= (lo + h - 1)) break; in mainSimpleSort()
533 if (j <= (lo + h - 1)) break; in mainSimpleSort()
547 if (j <= (lo + h - 1)) break; in mainSimpleSort()
631 Int32 sp, lo, hi, d; in mainQSort3() local
648 mpop ( lo, hi, d ); in mainQSort3()
649 if (hi - lo < MAIN_QSORT_SMALL_THRESH || in mainQSort3()
651 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget ); in mainQSort3()
657 mmed3 ( block[ptr[ lo ]+d], in mainQSort3()
659 block[ptr[ (lo+hi)>>1 ]+d] ); in mainQSort3()
661 unLo = ltLo = lo; in mainQSort3()
692 mpush(lo, hi, d+1 ); in mainQSort3()
696 n = mmin(ltLo-lo, unLo-ltLo); mvswap(lo, unLo-n, n); in mainQSort3()
699 n = lo + unLo - ltLo - 1; in mainQSort3()
702 nextLo[0] = lo; nextHi[0] = n; nextD[0] = d; in mainQSort3()
890 Int32 lo = ftab[sb] & CLEARMASK; in mainSort() local
892 if (hi > lo) { in mainSort()
896 ss, j, numQSorted, hi - lo + 1 ); in mainSort()
899 lo, hi, BZ_N_RADIX, budget in mainSort()
901 numQSorted += (hi - lo + 1); in mainSort()