83 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,  in sbitmap_init_node()  argument
89 	if (shift < 0)  in sbitmap_init_node()
90 		shift = sbitmap_calculate_shift(depth);  in sbitmap_init_node()
92 	bits_per_word = 1U << shift;  in sbitmap_init_node()
96 	sb->shift = shift;  in sbitmap_init_node()
125 	unsigned int bits_per_word = 1U << sb->shift;  in sbitmap_resize()
208 			nr += index << sb->shift;  in __sbitmap_get()
255 			nr += index << sb->shift;  in __sbitmap_get_shallow()
264 		alloc_hint = index << sb->shift;  in __sbitmap_get_shallow()
336 	seq_printf(m, "bits_per_word=%u\n", 1U << sb->shift);  in sbitmap_show()
413 	shallow_depth = min(1U << sbq->sb.shift, sbq->min_shallow_depth);  in sbq_calc_wake_batch()
414 	depth = ((depth >> sbq->sb.shift) * shallow_depth +  in sbq_calc_wake_batch()
415 		 min(depth & ((1U << sbq->sb.shift) - 1), shallow_depth));  in sbq_calc_wake_batch()
423 			    int shift, bool round_robin, gfp_t flags, int node)  in sbitmap_queue_init_node()  argument
428 	ret = sbitmap_init_node(&sbq->sb, depth, shift, flags, node,  in sbitmap_queue_init_node()
526 				*offset = nr + (index << sb->shift);  in __sbitmap_queue_get_batch()