Lines Matching defs:bits
32 * Now clear the masked bits in our free word
53 * If the bitmap is small, shrink the number of bits per word so
55 * bits, just forget about it, it's not going to work optimally
301 unsigned int bits = min(8 - byte_bits, word_bits);
303 byte |= (word & (BIT(bits) - 1)) << byte_bits;
304 byte_bits += bits;
311 word >>= bits;
312 word_bits -= bits;
336 * Each full word of the bitmap has bits_per_word bits, and there might
338 * depth % bits_per_word bits left over. In bitwise arithmetic:
344 * Each word can be limited to sbq->min_shallow_depth bits.