Lines Matching defs:lo
75 Int32 lo,
81 if (lo == hi) return;
83 if (hi - lo > 3) {
84 for ( i = hi-4; i >= lo; i-- ) {
93 for ( i = hi-1; i >= lo; i-- ) {
140 Int32 sp, lo, hi;
154 fpop ( lo, hi );
155 if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) {
156 fallbackSimpleSort ( fmap, eclass, lo, hi );
169 if (r3 == 0) med = eclass[fmap[lo]]; else
170 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
173 unLo = ltLo = lo;
207 n = fmin(ltLo-lo, unLo-ltLo); fvswap(lo, unLo-n, n);
210 n = lo + unLo - ltLo - 1;
213 if (n - lo > hi - m) {
214 fpush ( lo, n );
218 fpush ( lo, n );
530 Int32 lo,
538 bigN = hi - lo + 1;
548 i = lo + h;
560 if (j <= (lo + h - 1)) break;
574 if (j <= (lo + h - 1)) break;
588 if (j <= (lo + h - 1)) break;
672 Int32 sp, lo, hi, d;
689 mpop ( lo, hi, d );
690 if (hi - lo < MAIN_QSORT_SMALL_THRESH ||
692 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
698 mmed3 ( block[ptr[ lo ]+d],
700 block[ptr[ (lo+hi)>>1 ]+d] );
702 unLo = ltLo = lo;
733 mpush(lo, hi, d+1 );
737 n = mmin(ltLo-lo, unLo-ltLo); mvswap(lo, unLo-n, n);
740 n = lo + unLo - ltLo - 1;
743 nextLo[0] = lo; nextHi[0] = n; nextD[0] = d;
931 Int32 lo = ftab[sb] & CLEARMASK;
933 if (hi > lo) {
937 ss, j, numQSorted, hi - lo + 1 );
940 lo, hi, BZ_N_RADIX, budget
942 numQSorted += (hi - lo + 1);