Lines Matching full:fmap
2054 void fallbackSimpleSort ( UInt32* fmap,
2066 tmp = fmap[i];
2068 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
2069 fmap[j-4] = fmap[j];
2070 fmap[j-4] = tmp;
2075 tmp = fmap[i];
2077 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
2078 fmap[j-1] = fmap[j];
2079 fmap[j-1] = tmp;
2094 fswap(fmap[yyp1], fmap[yyp2]); \
2115 void fallbackQSort3 ( UInt32* fmap,
2137 fallbackSimpleSort ( fmap, eclass, lo, hi );
2150 if (r3 == 0) med = eclass[fmap[lo]]; else
2151 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
2152 med = eclass[fmap[hi]];
2160 n = (Int32)eclass[fmap[unLo]] - (Int32)med;
2162 fswap(fmap[unLo], fmap[ltLo]);
2171 n = (Int32)eclass[fmap[unHi]] - (Int32)med;
2173 fswap(fmap[unHi], fmap[gtHi]);
2181 fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;
2223 fmap [0 .. nblock-1] holds sorted order
2234 void fallbackSort ( UInt32* fmap,
2249 initial fmap and initial BH bits.
2262 fmap[k] = i;
2291 k = fmap[i] - H; if (k < 0) k += nblock;
2319 fallbackQSort3 ( fmap, eclass, l, r );
2324 cc1 = eclass[fmap[i]];
2348 eclass8[fmap[i]] = (UChar)j;
