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()
94     for (i = hi - 1; i >= lo; i--) {  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()
174             med = eclass[fmap[lo]];  in fallbackQSort3()
176             med = eclass[fmap[(lo + hi) >> 1]];  in fallbackQSort3()
180         unLo = ltLo = lo;  in fallbackQSort3()
224         n = fmin(ltLo - lo, unLo - ltLo);  in fallbackQSort3()
225         fvswap(lo, unLo - n, n);  in fallbackQSort3()
229         n = lo + unLo - ltLo - 1;  in fallbackQSort3()
232         if (n - lo > hi - m) {  in fallbackQSort3()
233             fpush(lo, n);  in fallbackQSort3()
238             fpush(lo, n);  in fallbackQSort3()
632                            Int32 lo,  in mainSimpleSort()  argument
639     bigN = hi - lo + 1;  in mainSimpleSort()
651         i = lo + h;  in mainSimpleSort()
661                 if (j <= (lo + h - 1))  in mainSimpleSort()
675                 if (j <= (lo + h - 1))  in mainSimpleSort()
689                 if (j <= (lo + h - 1))  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()
818         unLo = ltLo = lo;  in mainQSort3()
860             mpush(lo, hi, d + 1);  in mainQSort3()
864         n = mmin(ltLo - lo, unLo - ltLo);  in mainQSort3()
865         mvswap(lo, unLo - n, n);  in mainQSort3()
869         n = lo + unLo - ltLo - 1;  in mainQSort3()
872         nextLo[0] = lo;  in mainQSort3()
1072                     Int32 lo = ftab[sb] & CLEARMASK;  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()