2118    Int32 unLo, unHi, ltLo, gtHi, n, m;  in fallbackQSort3()  local
2152       unLo = ltLo = lo;  in fallbackQSort3()
2157             if (unLo > unHi) break;  in fallbackQSort3()
2158             n = (Int32)eclass[fmap[unLo]] - (Int32)med;  in fallbackQSort3()
2160                fswap(fmap[unLo], fmap[ltLo]);   in fallbackQSort3()
2161                ltLo++; unLo++;   in fallbackQSort3()
2165             unLo++;  in fallbackQSort3()
2168             if (unLo > unHi) break;  in fallbackQSort3()
2178          if (unLo > unHi) break;  in fallbackQSort3()
2179          fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;  in fallbackQSort3()
2182       AssertD ( unHi == unLo-1, "fallbackQSort3(2)" );  in fallbackQSort3()
2186       n = fmin(ltLo-lo, unLo-ltLo); fvswap(lo, unLo-n, n);  in fallbackQSort3()
2187       m = fmin(hi-gtHi, gtHi-unHi); fvswap(unLo, hi-m+1, m);  in fallbackQSort3()
2189       n = lo + unLo - ltLo - 1;  in fallbackQSort3()
2650    Int32 unLo, unHi, ltLo, gtHi, n, m, med;  in mainQSort3()  local
2681       unLo = ltLo = lo;  in mainQSort3()
2686             if (unLo > unHi) break;  in mainQSort3()
2687             n = ((Int32)block[ptr[unLo]+d]) - med;  in mainQSort3()
2689                mswap(ptr[unLo], ptr[ltLo]);   in mainQSort3()
2690                ltLo++; unLo++; continue;   in mainQSort3()
2693             unLo++;  in mainQSort3()
2696             if (unLo > unHi) break;  in mainQSort3()
2705          if (unLo > unHi) break;  in mainQSort3()
2706          mswap(ptr[unLo], ptr[unHi]); unLo++; unHi--;  in mainQSort3()
2709       AssertD ( unHi == unLo-1, "mainQSort3(2)" );  in mainQSort3()
2716       n = mmin(ltLo-lo, unLo-ltLo); mvswap(lo, unLo-n, n);  in mainQSort3()
2717       m = mmin(hi-gtHi, gtHi-unHi); mvswap(unLo, hi-m+1, m);  in mainQSort3()
2719       n = lo + unLo - ltLo - 1;  in mainQSort3()