Searched refs:BITS_PER_LONG (Results 1 – 17 of 17) sorted by relevance
39 #define BITS_PER_LONG (sizeof(long)*BITS_PER_CHAR) macro41 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))42 #define BITMAP_LAST_WORD_MASK(nbits) (~0UL >> (-(nbits) & (BITS_PER_LONG - 1)))64 return 1UL << (nr % BITS_PER_LONG); in __bit__()69 addr[nr / BITS_PER_LONG] |= __bit__(nr); in set_bit()74 addr[nr / BITS_PER_LONG] &= ~__bit__(nr); in clear_bit()79 return addr[nr / BITS_PER_LONG] & __bit__(nr); in test_bit()92 tmp = addr[start / BITS_PER_LONG] ^ invert; in __find_next_bit()96 start = round_down(start, BITS_PER_LONG); in __find_next_bit()99 start += BITS_PER_LONG; in __find_next_bit()[all …]
17 #define BITS_PER_LONG (8 * sizeof(long)) macro21 array[node / BITS_PER_LONG] |= 1UL << (node % BITS_PER_LONG); in set_node()28 for (i = 0; i < MAXNODES / BITS_PER_LONG; i++) in clean_node()
82 #define BITS_PER_LONG (BITS_PER_BYTE * sizeof(long)) macro84 #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_LONG)88 addr[nr / BITS_PER_LONG] |= 1UL << (nr % BITS_PER_LONG); in set_bit()93 addr[nr / BITS_PER_LONG] &= ~(1UL << (nr % BITS_PER_LONG)); in clear_bit()98 return !!((1UL << (nr % BITS_PER_LONG)) & in test_bit()99 (((unsigned long *)addr)[nr / BITS_PER_LONG])); in test_bit()
437 slot_num = loc / BITS_PER_LONG; in rmgr_find_empty_slot()448 if (!~(rmgr->slot[slot_num] | (~1UL << rmgr->size % BITS_PER_LONG))) { in rmgr_find_empty_slot()449 loc -= 1 + (loc % BITS_PER_LONG); in rmgr_find_empty_slot()458 loc -= BITS_PER_LONG; in rmgr_find_empty_slot()
19 #ifndef BITS_PER_LONG20 #define BITS_PER_LONG (BITS_PER_BYTE * sizeof(long)) macro24 #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_LONG)
148 #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))149 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)156 #define BITS_PER_LONG (__CHAR_BIT__ * __SIZEOF_LONG__) macro158 #define BITS_PER_LONG __WORDSIZE macro
27 #if BITS_PER_LONG == 3230 #elif BITS_PER_LONG == 64258 #if BITS_PER_LONG == 64 in hash_64()
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)
66 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in verify_ksm()
67 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in verify_ksm()
151 #define BITS_PER_LONG (sizeof(long) * BITS_PER_BYTE) macro152 #define NBITS(x) ((((x)-1) / BITS_PER_LONG) + 1)153 #define OFF(x) ((x) % BITS_PER_LONG)155 #define LONG(x) ((x) / BITS_PER_LONG)
29 #define BITS_PER_LONG (sizeof(long) * BITS_PER_BYTE) macro30 #define NBITS(x) ((((x)-1) / BITS_PER_LONG) + 1)31 #define OFF(x) ((x) % BITS_PER_LONG)33 #define LONG(x) ((x) / BITS_PER_LONG)
51 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in test_cpuset()
545 #define BITS_PER_LONG 64 macro547 #define BITS_PER_LONG 32 macro550 #define BIT_MASK(nr) (1 << (nr % BITS_PER_LONG))551 #define BIT_WORD(nr) (nr / BITS_PER_LONG)
41 # define BITOP_LE_SWIZZLE ((BITS_PER_LONG-1) & ~0x7)
170 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in set_global_mempolicy()535 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in test_ksm_merge_across_nodes()
127 #if BITS_PER_LONG == 64 in xxhash()