Lines Matching defs:fmap
32 void fallbackSimpleSort ( UInt32* fmap,
44 tmp = fmap[i];
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
47 fmap[j-4] = fmap[j];
48 fmap[j-4] = tmp;
53 tmp = fmap[i];
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
56 fmap[j-1] = fmap[j];
57 fmap[j-1] = tmp;
72 fswap(fmap[yyp1], fmap[yyp2]); \
93 void fallbackQSort3 ( UInt32* fmap,
115 fallbackSimpleSort ( fmap, eclass, lo, hi );
128 if (r3 == 0) med = eclass[fmap[lo]]; else
129 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
130 med = eclass[fmap[hi]];
138 n = (Int32)eclass[fmap[unLo]] - (Int32)med;
140 fswap(fmap[unLo], fmap[ltLo]);
149 n = (Int32)eclass[fmap[unHi]] - (Int32)med;
151 fswap(fmap[unHi], fmap[gtHi]);
159 fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;
201 fmap [0 .. nblock-1] holds sorted order
212 void fallbackSort ( UInt32* fmap,
227 initial fmap and initial BH bits.
240 fmap[k] = i;
269 k = fmap[i] - H; if (k < 0) k += nblock;
297 fallbackQSort3 ( fmap, eclass, l, r );
302 cc1 = eclass[fmap[i]];
326 eclass8[fmap[i]] = (UChar)j;