Lines Matching refs:BITS_PER_LONG
19 * BITS_PER_LONG.
43 int k, lim = bits/BITS_PER_LONG;
48 if (bits % BITS_PER_LONG)
58 int k, lim = bits/BITS_PER_LONG;
63 if (bits % BITS_PER_LONG)
74 int k, lim = bits/BITS_PER_LONG;
79 if (bits % BITS_PER_LONG)
89 int k, lim = bits/BITS_PER_LONG;
93 if (bits % BITS_PER_LONG)
112 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG;
113 int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG;
132 dst[k] = upper << (BITS_PER_LONG - rem) | lower >> rem;
157 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG;
158 int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG;
173 dst[k + off] = lower >> (BITS_PER_LONG - rem) | upper << rem;
233 int k, lim = bits/BITS_PER_LONG;
238 if (bits % BITS_PER_LONG)
248 int k, lim = bits/BITS_PER_LONG;
253 if (bits % BITS_PER_LONG)
262 int k, w = 0, lim = bits/BITS_PER_LONG;
267 if (bits % BITS_PER_LONG)
274 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
280 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
286 bits_to_set = BITS_PER_LONG;
301 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
307 bits_to_clear = BITS_PER_LONG;
391 word = i / BITS_PER_LONG;
392 bit = i % BITS_PER_LONG;
979 index = pos / BITS_PER_LONG;
980 offset = pos - (index * BITS_PER_LONG);
982 nbitsinlong = min(nbits_reg, BITS_PER_LONG);
986 * overflows if nbitsinlong == BITS_PER_LONG.
1086 * Require nbits % BITS_PER_LONG == 0.
1093 for (i = 0; i < nbits/BITS_PER_LONG; i++) {
1094 if (BITS_PER_LONG == 64)