BITS_PER_LONG
bits_to_set = BITS_PER_LONG;
int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
bits_to_clear = BITS_PER_LONG;
const unsigned int tail = size & (BITS_PER_LONG - 1);
const unsigned int tail = size & (BITS_PER_LONG - 1);
const unsigned tail = size & (BITS_PER_LONG - 1);
const unsigned tail = size & (BITS_PER_LONG - 1);
const unsigned int tail = size & (BITS_PER_LONG - 1);
if ((size % BITS_PER_LONG) != 0)
const unsigned int tail = size & (BITS_PER_LONG - 1);
const unsigned int rem = shift & (BITS_PER_LONG - 1);
const unsigned int tail = size & (BITS_PER_LONG - 1);
left <<= (BITS_PER_LONG - rem);
const unsigned int tail = size & (BITS_PER_LONG - 1);
const unsigned int tail = size & (BITS_PER_LONG - 1);
int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
for (bit = 0; size >= BITS_PER_LONG;
size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
for (bit = 0; size >= BITS_PER_LONG;
size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
pos = size / BITS_PER_LONG;
offs = size % BITS_PER_LONG;
bit = BITS_PER_LONG * pos;
bit -= BITS_PER_LONG;
pos = offset / BITS_PER_LONG;
offs = offset % BITS_PER_LONG;
bit = BITS_PER_LONG * pos;
if (size - bit <= BITS_PER_LONG)
bit += BITS_PER_LONG;
for (size -= bit; size >= BITS_PER_LONG;
size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
pos = offset / BITS_PER_LONG;
offs = offset % BITS_PER_LONG;
bit = BITS_PER_LONG * pos;
if (size - bit <= BITS_PER_LONG)
bit += BITS_PER_LONG;
for (size -= bit; size >= BITS_PER_LONG;
size -= BITS_PER_LONG, bit += BITS_PER_LONG, addr++) {
bit %= BITS_PER_LONG;
bit %= BITS_PER_LONG;
bit %= BITS_PER_LONG;
bit %= BITS_PER_LONG;
index = pos / BITS_PER_LONG;
offset = pos - (index * BITS_PER_LONG);
nbitsinlong = MIN(nbits_reg, BITS_PER_LONG);
#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
#define BITMAP_LAST_WORD_MASK(n) (~0UL >> (BITS_PER_LONG - (n)))
#define BITS_TO_LONGS(n) howmany((n), BITS_PER_LONG)
#define BIT_MASK(nr) (1UL << ((nr) & (BITS_PER_LONG - 1)))
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
#define GENMASK(h, l) (((~0UL) >> (BITS_PER_LONG - (h) - 1)) & ((~0UL) << (l)))
#if BITS_PER_LONG == 64
if (BITS_PER_LONG == 32)
#if BITS_PER_LONG == 64
#if defined(CONFIG_DCACHE_WORD_ACCESS) && BITS_PER_LONG == 64
#if BITS_PER_LONG == 64
#if defined(CONFIG_DCACHE_WORD_ACCESS) && BITS_PER_LONG == 64
#if defined(CONFIG_DCACHE_WORD_ACCESS) && BITS_PER_LONG == 64
#if defined(CONFIG_DCACHE_WORD_ACCESS) && BITS_PER_LONG == 64
#if defined(CONFIG_DCACHE_WORD_ACCESS) && BITS_PER_LONG == 64
#define BITS_TO_LONGS(n) howmany((n), BITS_PER_LONG)
#define BITMAP_LAST_WORD_MASK(n) (~0UL >> (BITS_PER_LONG - (n)))
#if (BITS_PER_LONG == 64)
#if (BITS_PER_LONG == 64)
#elif (BITS_PER_LONG == 32)
#if BITS_PER_LONG == 64
#define BIT_MASK(nr) (1UL << ((nr) & (BITS_PER_LONG - 1)))
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
#ifndef BITS_PER_LONG
(((~0UL) << (l)) & (~0UL >> (BITS_PER_LONG - 1 - (h))))
int n = howmany(res_avail, BITS_PER_LONG);
int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
bits_to_set = BITS_PER_LONG;
int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
bits_to_clear = BITS_PER_LONG;
for (i = 0; i < max / BITS_PER_LONG + 1; i++) {
return (i * BITS_PER_LONG + ffsl(n) - 1);
#define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
#define BITMAP_LAST_WORD_MASK(n) (~0UL >> (BITS_PER_LONG - (n)))
#define BITS_TO_LONGS(n) howmany((n), BITS_PER_LONG)
#define BIT_MASK(nr) (1UL << ((nr) & (BITS_PER_LONG - 1)))
#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
if (BITS_PER_LONG == 64 || buf->nbufs == 1)
#if BITS_PER_LONG == 64
if (BITS_PER_LONG == 64) {
if (BITS_PER_LONG == 64)
#if BITS_PER_LONG == 64
#elif BITS_PER_LONG == 32
if (BITS_PER_LONG == 64 || buf->nbufs == 1)
qp->sq_signal_bits && BITS_PER_LONG == 64 &&
#if BITS_PER_LONG == 64
m = find_first_bit(&tmp, BITS_PER_LONG);
m = find_first_bit(&tmp, BITS_PER_LONG);
#if BITS_PER_LONG == 64
if (mthca_is_memfree(dev) || BITS_PER_LONG == 64)
#if (BITS_PER_LONG > 32)
#if (BITS_PER_LONG == 64)
#if (BITS_PER_LONG == 64)
bit %= BITS_PER_LONG;
BITS_PER_LONG,
BITS_PER_LONG);