Searched refs:BITS_PER_LONG (Results 1 – 12 of 12) sorted by relevance
23 #define BITS_PER_LONG (8 * sizeof(long)) macro27 array[node / BITS_PER_LONG] |= 1UL << (node % BITS_PER_LONG); in set_node()34 for (i = 0; i < MAXNODES / BITS_PER_LONG; i++) in clean_node()
3 #define BITS_PER_LONG (sizeof(long)*8) macro4 #define DECLARE_BITMAP(x,y) unsigned long x[((y) + BITS_PER_LONG - 1) / BITS_PER_LONG];
38 #define BITS_PER_LONG (sizeof(unsigned long) * 8) macro39 #define NBITS(x) ((((x)-1)/BITS_PER_LONG)+1)40 #define OFF(x) ((x)%BITS_PER_LONG)42 #define LONG(x) ((x)/BITS_PER_LONG)135 log_debug(text, i * BITS_PER_LONG, bitmask[i]); in get_cap_mask()281 for (i = 0; i < BTN_MISC/BITS_PER_LONG; ++i) { in test_key()283 …st_key: checking bit block %lu for any keys; found=%i", (unsigned long)i*BITS_PER_LONG, found > 0); in test_key()
280 #define BITS_PER_LONG (sizeof(unsigned long) * 8) macro281 #define NBITS(x) ((((x)-1)/BITS_PER_LONG)+1)282 #define OFF(x) ((x)%BITS_PER_LONG)284 #define LONG(x) ((x)/BITS_PER_LONG)
23 #define BITS_PER_LONG (sizeof(long) * CHAR_BIT) macro26 #define BITOP_LE_SWIZZLE ((BITS_PER_LONG - 1) & ~0x7)31 #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))32 #define BIT_WORD(nr) ((nr) / 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()
53 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in test_cpuset()
447 #define BITS_PER_LONG 64 macro449 #define BITS_PER_LONG 32 macro452 #define BIT_MASK(nr) (1 << (nr % BITS_PER_LONG))453 #define BIT_WORD(nr) (nr / BITS_PER_LONG)
173 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in set_global_mempolicy()531 unsigned long nmask[MAXNODES / BITS_PER_LONG] = { 0 }; in test_ksm_merge_across_nodes()
1234 …//github.com/nodejs/node/commit/ce2471673f)] - **src**: remove unused BITS_PER_LONG macro (Ben Noo…
2244 …//github.com/nodejs/node/commit/5e1976e37c)] - **src**: remove unused BITS_PER_LONG macro (Ben Noo…