Searched refs:bhtab (Results 1 – 7 of 7) sorted by relevance
205 #define SET_BH(zz) bhtab[(zz) >> 5] |= (1 << ((zz) & 31))206 #define CLEAR_BH(zz) bhtab[(zz) >> 5] &= ~(1 << ((zz) & 31))207 #define ISSET_BH(zz) (bhtab[(zz) >> 5] & (1 << ((zz) & 31)))208 #define WORD_BH(zz) bhtab[(zz) >> 5]214 UInt32* bhtab, in fallbackSort() argument244 for (i = 0; i < nBhtab; i++) bhtab[i] = 0; in fallbackSort()
2062 UInt32* bhtab, in fallbackSort() argument2092 for (i = 0; i < nBhtab; i++) bhtab[i] = 0; in fallbackSort()2093 for (i = 0; i < 256; i++) bhtab[(ftab[i]) >> 5] |= (1 << ((ftab[i]) & 31)); in fallbackSort()2096 bhtab[(nblock + 2*i) >> 5] |= (1 << ((nblock + 2*i) & 31)); in fallbackSort()2097 bhtab[(nblock + 2*i + 1) >> 5] &= ~(1 << ((nblock + 2*i + 1) & 31)); in fallbackSort()2109 if ((bhtab[(i) >> 5] & (1 << ((i) & 31)))) j = i; in fallbackSort()2120 while ((bhtab[(k) >> 5] & (1 << ((k) & 31))) && ((k) & 0x01f)) k++; in fallbackSort()2121 if ((bhtab[(k) >> 5] & (1 << ((k) & 31)))) { in fallbackSort()2122 while (bhtab[(k) >> 5] == 0xffffffff) k += 32; in fallbackSort()2123 while ((bhtab[(k) >> 5] & (1 << ((k) & 31)))) k++; in fallbackSort()[all …]
2242 #define SET_BH(zz) bhtab[(zz) >> 5] |= (1 << ((zz) & 31))2243 #define CLEAR_BH(zz) bhtab[(zz) >> 5] &= ~(1 << ((zz) & 31))2244 #define ISSET_BH(zz) (bhtab[(zz) >> 5] & (1 << ((zz) & 31)))2245 #define WORD_BH(zz) bhtab[(zz) >> 5]2251 UInt32* bhtab, in fallbackSort() argument2281 for (i = 0; i < nBhtab; i++) bhtab[i] = 0; in fallbackSort()
2227 #define SET_BH(zz) bhtab[(zz) >> 5] |= (1 << ((zz) & 31))2228 #define CLEAR_BH(zz) bhtab[(zz) >> 5] &= ~(1 << ((zz) & 31))2229 #define ISSET_BH(zz) (bhtab[(zz) >> 5] & (1 << ((zz) & 31)))2230 #define WORD_BH(zz) bhtab[(zz) >> 5]2236 UInt32* bhtab, in fallbackSort() argument2266 for (i = 0; i < nBhtab; i++) bhtab[i] = 0; in fallbackSort()
2280 #define SET_BH(zz) bhtab[(zz) >> 5] |= (1 << ((zz) & 31))2281 #define CLEAR_BH(zz) bhtab[(zz) >> 5] &= ~(1 << ((zz) & 31))2282 #define ISSET_BH(zz) (bhtab[(zz) >> 5] & (1 << ((zz) & 31)))2283 #define WORD_BH(zz) bhtab[(zz) >> 5]2289 UInt32* bhtab, in fallbackSort() argument2319 for (i = 0; i < nBhtab; i++) bhtab[i] = 0; in fallbackSort()
2251 #define SET_BH(zz) bhtab[(zz) >> 5] |= (1 << ((zz) & 31))2252 #define CLEAR_BH(zz) bhtab[(zz) >> 5] &= ~(1 << ((zz) & 31))2253 #define ISSET_BH(zz) (bhtab[(zz) >> 5] & (1 << ((zz) & 31)))2254 #define WORD_BH(zz) bhtab[(zz) >> 5]2260 UInt32* bhtab, in fallbackSort() argument2290 for (i = 0; i < nBhtab; i++) bhtab[i] = 0; in fallbackSort()