Lines Matching defs:bits_per_word
47 unsigned int bits_per_word;
63 bits_per_word = 1U << shift;
64 if (bits_per_word > BITS_PER_LONG)
69 sb->map_nr = DIV_ROUND_UP(sb->depth, bits_per_word);
81 sb->map[i].depth = min(depth, bits_per_word);
91 unsigned int bits_per_word = 1U << sb->shift;
98 sb->map_nr = DIV_ROUND_UP(sb->depth, bits_per_word);
101 sb->map[i].depth = min(depth, bits_per_word);
269 seq_printf(m, "bits_per_word=%u\n", 1U << sb->shift);
336 * Each full word of the bitmap has bits_per_word bits, and there might
337 * be a partial word. There are depth / bits_per_word full words and
338 * depth % bits_per_word bits left over. In bitwise arithmetic:
340 * bits_per_word = 1 << shift
341 * depth / bits_per_word = depth >> shift
342 * depth % bits_per_word = depth & ((1 << shift) - 1)