Lines Matching defs:shift
44 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,
50 if (shift < 0) {
51 shift = ilog2(BITS_PER_LONG);
59 while ((4U << shift) > depth)
60 shift--;
63 bits_per_word = 1U << shift;
67 sb->shift = shift;
91 unsigned int bits_per_word = 1U << sb->shift;
178 nr += index << sb->shift;
206 nr += index << sb->shift;
215 alloc_hint = index << sb->shift;
269 seq_printf(m, "bits_per_word=%u\n", 1U << sb->shift);
340 * bits_per_word = 1 << shift
341 * depth / bits_per_word = depth >> shift
342 * depth % bits_per_word = depth & ((1 << shift) - 1)
346 shallow_depth = min(1U << sbq->sb.shift, sbq->min_shallow_depth);
347 depth = ((depth >> sbq->sb.shift) * shallow_depth +
348 min(depth & ((1U << sbq->sb.shift) - 1), shallow_depth));
356 int shift, bool round_robin, gfp_t flags, int node)
361 ret = sbitmap_init_node(&sbq->sb, depth, shift, flags, node);