Lines Matching refs:BITS_PER_LONG
43 #define BITS_PER_LONG 64
45 #define BITS_PER_LONG 32
50 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
51 #define BITMAP_LAST_WORD_MASK(n) (~0UL >> (BITS_PER_LONG - (n)))
52 #define BITS_TO_LONGS(n) howmany((n), BITS_PER_LONG)
53 #define BIT_MASK(nr) (1UL << ((nr) & (BITS_PER_LONG - 1)))
54 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
55 #define GENMASK(h, l) (((~0UL) >> (BITS_PER_LONG - (h) - 1)) & ((~0UL) << (l)))
120 for (bit = 0; size >= BITS_PER_LONG;
121 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
142 for (bit = 0; size >= BITS_PER_LONG;
143 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
166 pos = size / BITS_PER_LONG;
167 offs = size % BITS_PER_LONG;
168 bit = BITS_PER_LONG * pos;
177 bit -= BITS_PER_LONG;
194 pos = offset / BITS_PER_LONG;
195 offs = offset % BITS_PER_LONG;
196 bit = BITS_PER_LONG * pos;
202 if (size - bit <= BITS_PER_LONG)
204 bit += BITS_PER_LONG;
207 for (size -= bit; size >= BITS_PER_LONG;
208 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
234 pos = offset / BITS_PER_LONG;
235 offs = offset % BITS_PER_LONG;
236 bit = BITS_PER_LONG * pos;
242 if (size - bit <= BITS_PER_LONG)
244 bit += BITS_PER_LONG;
247 for (size -= bit; size >= BITS_PER_LONG;
248 size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
287 bit %= BITS_PER_LONG;
302 bit %= BITS_PER_LONG;
317 bit %= BITS_PER_LONG;
332 bit %= BITS_PER_LONG;
360 index = pos / BITS_PER_LONG;
361 offset = pos - (index * BITS_PER_LONG);
363 nbitsinlong = MIN(nbits_reg, BITS_PER_LONG);