2069 void fallbackSimpleSort ( UInt32* fmap,   in fallbackSimpleSort()  argument
2081          tmp = fmap[i];  in fallbackSimpleSort()
2083          for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )  in fallbackSimpleSort()
2084             fmap[j-4] = fmap[j];  in fallbackSimpleSort()
2085          fmap[j-4] = tmp;  in fallbackSimpleSort()
2090       tmp = fmap[i];  in fallbackSimpleSort()
2092       for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )  in fallbackSimpleSort()
2093          fmap[j-1] = fmap[j];  in fallbackSimpleSort()
2094       fmap[j-1] = tmp;  in fallbackSimpleSort()
2109       fswap(fmap[yyp1], fmap[yyp2]);  \
2130 void fallbackQSort3 ( UInt32* fmap,   in fallbackQSort3()  argument
2152          fallbackSimpleSort ( fmap, eclass, lo, hi );  in fallbackQSort3()
2165       if (r3 == 0) med = eclass[fmap[lo]]; else  in fallbackQSort3()
2166       if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else  in fallbackQSort3()
2167                    med = eclass[fmap[hi]];  in fallbackQSort3()
2175             n = (Int32)eclass[fmap[unLo]] - (Int32)med;  in fallbackQSort3()
2177                fswap(fmap[unLo], fmap[ltLo]);   in fallbackQSort3()
2186             n = (Int32)eclass[fmap[unHi]] - (Int32)med;  in fallbackQSort3()
2188                fswap(fmap[unHi], fmap[gtHi]);   in fallbackQSort3()
2196          fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;  in fallbackQSort3()
2249 void fallbackSort ( UInt32* fmap,   in fallbackSort()  argument
2277       fmap[k] = i;  in fallbackSort()
2306          k = fmap[i] - H; if (k < 0) k += nblock;  in fallbackSort()
2334             fallbackQSort3 ( fmap, eclass, l, r );  in fallbackSort()
2339                cc1 = eclass[fmap[i]];  in fallbackSort()
2363       eclass8[fmap[i]] = (UChar)j;  in fallbackSort()