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