35                           Int32   hi )  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()
46          for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )  in fallbackSimpleSort()
52    for ( i = hi-1; i >= lo; i-- ) {  in fallbackSimpleSort()
55       for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )  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()
129       if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else  in fallbackQSort3()
130                    med = eclass[fmap[hi]];  in fallbackQSort3()
133       unHi = gtHi = hi;  in fallbackQSort3()
167       m = fmin(hi-gtHi, gtHi-unHi); fvswap(unLo, hi-m+1, m);  in fallbackQSort3()
170       m = hi - (gtHi - unHi) + 1;  in fallbackQSort3()
172       if (n - lo > hi - m) {  in fallbackQSort3()
174          fpush ( m, hi );  in fallbackQSort3()
176          fpush ( m, hi );  in fallbackQSort3()
490                       Int32   hi,  in mainSimpleSort()  argument
497    bigN = hi - lo + 1;  in mainSimpleSort()
511          if (i > hi) break;  in mainSimpleSort()
525          if (i > hi) break;  in mainSimpleSort()
539          if (i > hi) 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()
658                     block[ptr[ hi         ]+d],  in mainQSort3()
659                     block[ptr[ (lo+hi)>>1 ]+d] );  in mainQSort3()
662       unHi = gtHi = hi;  in mainQSort3()
692          mpush(lo, hi, d+1 );  in mainQSort3()
697       m = mmin(hi-gtHi, gtHi-unHi); mvswap(unLo, hi-m+1, m);  in mainQSort3()
700       m = hi - (gtHi - unHi) + 1;  in mainQSort3()
703       nextLo[1] = m;   nextHi[1] = hi;  nextD[1] = d;  in mainQSort3()
891                Int32 hi = (ftab[sb+1] & CLEARMASK) - 1;  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()