Lines Matching refs:hi
35 Int32 hi )
40 if (lo == hi) return;
42 if (hi - lo > 3) {
43 for ( i = hi-4; i >= lo; i-- ) {
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
52 for ( i = hi-1; i >= lo; i-- ) {
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
99 Int32 sp, lo, hi;
113 fpop ( lo, hi );
114 if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) {
115 fallbackSimpleSort ( fmap, eclass, lo, hi );
129 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
130 med = eclass[fmap[hi]];
133 unHi = gtHi = hi;
167 m = fmin(hi-gtHi, gtHi-unHi); fvswap(unLo, hi-m+1, m);
170 m = hi - (gtHi - unHi) + 1;
172 if (n - lo > hi - m) {
174 fpush ( m, hi );
176 fpush ( m, hi );
490 Int32 hi,
497 bigN = hi - lo + 1;
511 if (i > hi) break;
525 if (i > hi) break;
539 if (i > hi) break;
631 Int32 sp, lo, hi, d;
648 mpop ( lo, hi, d );
649 if (hi - lo < MAIN_QSORT_SMALL_THRESH ||
651 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
658 block[ptr[ hi ]+d],
659 block[ptr[ (lo+hi)>>1 ]+d] );
662 unHi = gtHi = hi;
692 mpush(lo, hi, d+1 );
697 m = mmin(hi-gtHi, gtHi-unHi); mvswap(unLo, hi-m+1, m);
700 m = hi - (gtHi - unHi) + 1;
703 nextLo[1] = m; nextHi[1] = hi; nextD[1] = d;
891 Int32 hi = (ftab[sb+1] & CLEARMASK) - 1;
892 if (hi > lo) {
896 ss, j, numQSorted, hi - lo + 1 );
899 lo, hi, BZ_N_RADIX, budget
901 numQSorted += (hi - lo + 1);
