Searched refs:BITS_PER_LONG (Results 1 – 9 of 9) sorted by relevance
149 #if BITS_PER_LONG == 64 in __ffs()180 unsigned long result = offset & ~(BITS_PER_LONG-1); in find_next_bit()186 offset %= BITS_PER_LONG; in find_next_bit()190 if (size < BITS_PER_LONG) in find_next_bit()194 size -= BITS_PER_LONG; in find_next_bit()195 result += BITS_PER_LONG; in find_next_bit()197 while (size & ~(BITS_PER_LONG-1)) { in find_next_bit()200 result += BITS_PER_LONG; in find_next_bit()201 size -= BITS_PER_LONG; in find_next_bit()208 tmp &= (~0UL >> (BITS_PER_LONG - size)); in find_next_bit()
21 #if BITS_PER_LONG == 3224 #elif BITS_PER_LONG == 6437 #if BITS_PER_LONG == 64 in __hash_long()63 return __hash_long(val) >> (BITS_PER_LONG - bits); in hash_long()
25 #if BITS_PER_LONG == 6458 #if BITS_PER_LONG == 64 in crc32c_intel()
50 static unsigned long index_bits_to_maxindex[BITS_PER_LONG];231 mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_insert()319 iter->mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_left()361 iter->mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_right()
8 #if BITS_PER_LONG == 64 in __ffs()
27 #if BITS_PER_LONG == 6429 #elif BITS_PER_LONG == 32204 #if BITS_PER_LONG == 64
23 #if BITS_PER_LONG == 32 in hweight64()
302 #define BITS_PER_LONG (sizeof(long) * 8) macro303 #define NBITS(x) ((((x)-1)/BITS_PER_LONG)+1)304 #define OFF(x) ((x)%BITS_PER_LONG)306 #define LONG(x) ((x)/BITS_PER_LONG)
257 #define BITS_PER_LONG 64 macro259 #define BITS_PER_LONG 32 macro262 #define BIT_MASK(nr) (1 << (nr % BITS_PER_LONG))263 #define BIT_WORD(nr) (nr / BITS_PER_LONG)