Lines Matching refs:fmap
72 void fallbackSimpleSort ( UInt32* fmap, in fallbackSimpleSort() argument
84 tmp = fmap[i]; in fallbackSimpleSort()
86 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
87 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
88 fmap[j-4] = tmp; in fallbackSimpleSort()
93 tmp = fmap[i]; in fallbackSimpleSort()
95 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
96 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
97 fmap[j-1] = tmp; in fallbackSimpleSort()
112 fswap(fmap[yyp1], fmap[yyp2]); \
133 void fallbackQSort3 ( UInt32* fmap, in fallbackQSort3() argument
155 fallbackSimpleSort ( fmap, eclass, lo, hi ); in fallbackQSort3()
168 if (r3 == 0) med = eclass[fmap[lo]]; else in fallbackQSort3()
169 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else in fallbackQSort3()
170 med = eclass[fmap[hi]]; in fallbackQSort3()
178 n = (Int32)eclass[fmap[unLo]] - (Int32)med; in fallbackQSort3()
180 fswap(fmap[unLo], fmap[ltLo]); in fallbackQSort3()
189 n = (Int32)eclass[fmap[unHi]] - (Int32)med; in fallbackQSort3()
191 fswap(fmap[unHi], fmap[gtHi]); in fallbackQSort3()
199 fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--; in fallbackQSort3()
252 void fallbackSort ( UInt32* fmap, in fallbackSort() argument
280 fmap[k] = i; in fallbackSort()
309 k = fmap[i] - H; if (k < 0) k += nblock; in fallbackSort()
337 fallbackQSort3 ( fmap, eclass, l, r ); in fallbackSort()
342 cc1 = eclass[fmap[i]]; in fallbackSort()
366 eclass8[fmap[i]] = (UChar)j; in fallbackSort()