74                           Int32   lo,   in fallbackSimpleSort()  argument
80    if (lo == hi) return;  in fallbackSimpleSort()
82    if (hi - lo > 3) {  in fallbackSimpleSort()
83       for ( i = hi-4; i >= lo; i-- ) {  in fallbackSimpleSort()
92    for ( i = hi-1; i >= lo; i-- ) {  in fallbackSimpleSort()
139    Int32 sp, lo, hi;  in fallbackQSort3()  local
153       fpop ( lo, hi );  in fallbackQSort3()
154       if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) {  in fallbackQSort3()
155          fallbackSimpleSort ( fmap, eclass, lo, hi );  in fallbackQSort3()
168       if (r3 == 0) med = eclass[fmap[lo]]; else  in fallbackQSort3()
169       if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else  in fallbackQSort3()
172       unLo = ltLo = lo;  in fallbackQSort3()
206       n = fmin(ltLo-lo, unLo-ltLo); fvswap(lo, unLo-n, n);  in fallbackQSort3()
209       n = lo + unLo - ltLo - 1;  in fallbackQSort3()
212       if (n - lo > hi - m) {  in fallbackQSort3()
213          fpush ( lo, n );  in fallbackQSort3()
217          fpush ( lo, n );  in fallbackQSort3()
529                       Int32   lo,   in mainSimpleSort()  argument
537    bigN = hi - lo + 1;  in mainSimpleSort()
547       i = lo + h;  in mainSimpleSort()
559             if (j <= (lo + h - 1)) break;  in mainSimpleSort()
573             if (j <= (lo + h - 1)) break;  in mainSimpleSort()
587             if (j <= (lo + h - 1)) break;  in mainSimpleSort()
671    Int32 sp, lo, hi, d;  in mainQSort3()  local
688       mpop ( lo, hi, d );  in mainQSort3()
689       if (hi - lo < MAIN_QSORT_SMALL_THRESH ||   in mainQSort3()
691          mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );  in mainQSort3()
697             mmed3 ( block[ptr[ lo         ]+d],  in mainQSort3()
699                     block[ptr[ (lo+hi)>>1 ]+d] );  in mainQSort3()
701       unLo = ltLo = lo;  in mainQSort3()
732          mpush(lo, hi, d+1 );  in mainQSort3()
736       n = mmin(ltLo-lo, unLo-ltLo); mvswap(lo, unLo-n, n);  in mainQSort3()
739       n = lo + unLo - ltLo - 1;  in mainQSort3()
742       nextLo[0] = lo;  nextHi[0] = n;   nextD[0] = d;  in mainQSort3()
930                Int32 lo = ftab[sb]   & CLEARMASK;  in mainSort()  local
932                if (hi > lo) {  in mainSort()
936                                 ss, j, numQSorted, hi - lo + 1 );  in mainSort()
939                      lo, hi, BZ_N_RADIX, budget   in mainSort()
941                   numQSorted += (hi - lo + 1);  in mainSort()