77 static __inline__ void fallbackSimpleSort(UInt32* fmap, UInt32* eclass, Int32 lo, Int32 hi) {  in fallbackSimpleSort()  argument
81     if (lo == hi)  in fallbackSimpleSort()
84     if (hi - lo > 3) {  in fallbackSimpleSort()
85         for (i = hi - 4; i >= lo; i--) {  in fallbackSimpleSort()
88             for (j = i + 4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4)  in fallbackSimpleSort()
94     for (i = hi - 1; i >= lo; i--) {  in fallbackSimpleSort()
97         for (j = i + 1; j <= hi && ec_tmp > eclass[fmap[j]]; j++)  in fallbackSimpleSort()
145     Int32 sp, lo, hi;  in fallbackQSort3()  local
158         fpop(lo, hi);  in fallbackQSort3()
159         if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) {  in fallbackQSort3()
160             fallbackSimpleSort(fmap, eclass, lo, hi);  in fallbackQSort3()
176             med = eclass[fmap[(lo + hi) >> 1]];  in fallbackQSort3()
178             med = eclass[fmap[hi]];  in fallbackQSort3()
181         unHi = gtHi = hi;  in fallbackQSort3()
226         m = fmin(hi - gtHi, gtHi - unHi);  in fallbackQSort3()
227         fvswap(unLo, hi - m + 1, m);  in fallbackQSort3()
230         m = hi - (gtHi - unHi) + 1;  in fallbackQSort3()
232         if (n - lo > hi - m) {  in fallbackQSort3()
234             fpush(m, hi);  in fallbackQSort3()
237             fpush(m, hi);  in fallbackQSort3()
633                            Int32 hi,  in mainSimpleSort()  argument
639     bigN = hi - lo + 1;  in mainSimpleSort()
654             if (i > hi)  in mainSimpleSort()
668             if (i > hi)  in mainSimpleSort()
682             if (i > hi)  in mainSimpleSort()
792     Int32 sp, lo, hi, d;  in mainQSort3()  local
808         mpop(lo, hi, d);  in mainQSort3()
809         if (hi - lo < MAIN_QSORT_SMALL_THRESH || d > MAIN_QSORT_DEPTH_THRESH) {  in mainQSort3()
810             mainSimpleSort(ptr, block, quadrant, nblock, lo, hi, d, budget);  in mainQSort3()
816         med = (Int32)mmed3(block[ptr[lo] + d], block[ptr[hi] + d], block[ptr[(lo + hi) >> 1] + d]);  in mainQSort3()
819         unHi = gtHi = hi;  in mainQSort3()
860             mpush(lo, hi, d + 1);  in mainQSort3()
866         m = mmin(hi - gtHi, gtHi - unHi);  in mainQSort3()
867         mvswap(unLo, hi - m + 1, m);  in mainQSort3()
870         m = hi - (gtHi - unHi) + 1;  in mainQSort3()
876         nextHi[1] = hi;  in mainQSort3()
1073                     Int32 hi = (ftab[sb + 1] & CLEARMASK) - 1;  in mainSort()  local
1074                     if (hi > lo) {  in mainSort()
1081                                      hi - lo + 1);  in mainSort()
1082                         mainQSort3(ptr, block, quadrant, nblock, lo, hi, BZ_N_RADIX, budget);  in mainSort()
1083                         numQSorted += (hi - lo + 1);  in mainSort()