2133    Int32 unLo, unHi, ltLo, gtHi, n, m;  in fallbackQSort3()  local
2167       unLo = ltLo = lo;  in fallbackQSort3()
2172             if (unLo > unHi) break;  in fallbackQSort3()
2173             n = (Int32)eclass[fmap[unLo]] - (Int32)med;  in fallbackQSort3()
2175                fswap(fmap[unLo], fmap[ltLo]);   in fallbackQSort3()
2176                ltLo++; unLo++;   in fallbackQSort3()
2180             unLo++;  in fallbackQSort3()
2183             if (unLo > unHi) break;  in fallbackQSort3()
2193          if (unLo > unHi) break;  in fallbackQSort3()
2194          fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;  in fallbackQSort3()
2197       AssertD ( unHi == unLo-1, "fallbackQSort3(2)" );  in fallbackQSort3()
2201       n = fmin(ltLo-lo, unLo-ltLo); fvswap(lo, unLo-n, n);  in fallbackQSort3()
2202       m = fmin(hi-gtHi, gtHi-unHi); fvswap(unLo, hi-m+1, m);  in fallbackQSort3()
2204       n = lo + unLo - ltLo - 1;  in fallbackQSort3()
2665    Int32 unLo, unHi, ltLo, gtHi, n, m, med;  in mainQSort3()  local
2696       unLo = ltLo = lo;  in mainQSort3()
2701             if (unLo > unHi) break;  in mainQSort3()
2702             n = ((Int32)block[ptr[unLo]+d]) - med;  in mainQSort3()
2704                mswap(ptr[unLo], ptr[ltLo]);   in mainQSort3()
2705                ltLo++; unLo++; continue;   in mainQSort3()
2708             unLo++;  in mainQSort3()
2711             if (unLo > unHi) break;  in mainQSort3()
2720          if (unLo > unHi) break;  in mainQSort3()
2721          mswap(ptr[unLo], ptr[unHi]); unLo++; unHi--;  in mainQSort3()
2724       AssertD ( unHi == unLo-1, "mainQSort3(2)" );  in mainQSort3()
2731       n = mmin(ltLo-lo, unLo-ltLo); mvswap(lo, unLo-n, n);  in mainQSort3()
2732       m = mmin(hi-gtHi, gtHi-unHi); mvswap(unLo, hi-m+1, m);  in mainQSort3()
2734       n = lo + unLo - ltLo - 1;  in mainQSort3()