Lines Matching full:fmap
2078 void fallbackSimpleSort ( UInt32* fmap,
2090 tmp = fmap[i];
2092 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
2093 fmap[j-4] = fmap[j];
2094 fmap[j-4] = tmp;
2099 tmp = fmap[i];
2101 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
2102 fmap[j-1] = fmap[j];
2103 fmap[j-1] = tmp;
2118 fswap(fmap[yyp1], fmap[yyp2]); \
2139 void fallbackQSort3 ( UInt32* fmap,
2161 fallbackSimpleSort ( fmap, eclass, lo, hi );
2174 if (r3 == 0) med = eclass[fmap[lo]]; else
2175 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
2176 med = eclass[fmap[hi]];
2184 n = (Int32)eclass[fmap[unLo]] - (Int32)med;
2186 fswap(fmap[unLo], fmap[ltLo]);
2195 n = (Int32)eclass[fmap[unHi]] - (Int32)med;
2197 fswap(fmap[unHi], fmap[gtHi]);
2205 fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;
2247 fmap [0 .. nblock-1] holds sorted order
2258 void fallbackSort ( UInt32* fmap,
2273 initial fmap and initial BH bits.
2286 fmap[k] = i;
2315 k = fmap[i] - H; if (k < 0) k += nblock;
2343 fallbackQSort3 ( fmap, eclass, l, r );
2348 cc1 = eclass[fmap[i]];
2372 eclass8[fmap[i]] = (UChar)j;
