Searched refs:TREEBIN_SHIFT (Results 1 – 2 of 2) sorted by relevance
2531 #define TREEBIN_SHIFT (8U) macro2532 #define MIN_LARGE_SIZE (SIZE_T_ONE << TREEBIN_SHIFT)2786 unsigned int X = S >> TREEBIN_SHIFT;\2794 I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\2801 size_t X = S >> TREEBIN_SHIFT;\2808 I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\2815 size_t X = S >> TREEBIN_SHIFT;\2823 I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\2830 size_t X = S >> TREEBIN_SHIFT;\2842 I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\[all …]
2021 #define TREEBIN_SHIFT (8U) macro2022 #define MIN_LARGE_SIZE (SIZE_T_ONE << TREEBIN_SHIFT)2254 size_t X = S >> TREEBIN_SHIFT;\2262 I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\2268 size_t X = S >> TREEBIN_SHIFT;\2280 I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\2287 (i == NTREEBINS-1)? (SIZE_T_BITSIZE-1) : (((i) >> 1) + TREEBIN_SHIFT - 2)2292 ((SIZE_T_BITSIZE-SIZE_T_ONE) - (((i) >> 1) + TREEBIN_SHIFT - 2)))2296 ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) | \2297 (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1)))