23 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,  in sbitmap_init_node()  argument
37 		if (depth >= 4) {  in sbitmap_init_node()
38 			while ((4U << shift) > depth)  in sbitmap_init_node()
47 	sb->depth = depth;  in sbitmap_init_node()
48 	sb->map_nr = DIV_ROUND_UP(sb->depth, bits_per_word);  in sbitmap_init_node()
50 	if (depth == 0) {  in sbitmap_init_node()
60 		sb->map[i].depth = min(depth, bits_per_word);  in sbitmap_init_node()
61 		depth -= sb->map[i].depth;  in sbitmap_init_node()
67 void sbitmap_resize(struct sbitmap *sb, unsigned int depth)  in sbitmap_resize()  argument
72 	sb->depth = depth;  in sbitmap_resize()
73 	sb->map_nr = DIV_ROUND_UP(sb->depth, bits_per_word);  in sbitmap_resize()
76 		sb->map[i].depth = min(depth, bits_per_word);  in sbitmap_resize()
77 		depth -= sb->map[i].depth;  in sbitmap_resize()
82 static int __sbitmap_get_word(unsigned long *word, unsigned long depth,  in __sbitmap_get_word()  argument
89 		nr = find_next_zero_bit(word, depth, hint);  in __sbitmap_get_word()
90 		if (unlikely(nr >= depth)) {  in __sbitmap_get_word()
107 		if (hint >= depth - 1)  in __sbitmap_get_word()
123 					sb->map[index].depth,  in sbitmap_get()
155 					min(sb->map[index].depth, shallow_depth),  in sbitmap_get_shallow()
196 		ret = find_first_zero_bit(&word->word, word->depth);  in sbitmap_any_bit_clear()
197 		if (ret < word->depth)  in sbitmap_any_bit_clear()
211 		weight += bitmap_weight(&word->word, word->depth);  in sbitmap_weight()
219 	seq_printf(m, "depth=%u\n", sb->depth);  in sbitmap_show()
247 		unsigned int word_bits = READ_ONCE(sb->map[i].depth);  in sbitmap_bitmap_show()
274 					unsigned int depth)  in sbq_calc_wake_batch()  argument
281 	 * batch size is small enough that the full depth of the bitmap,  in sbq_calc_wake_batch()
282 	 * potentially limited by a shallow depth, is enough to wake up all of  in sbq_calc_wake_batch()
286 	 * be a partial word. There are depth / bits_per_word full words and  in sbq_calc_wake_batch()
287 	 * depth % bits_per_word bits left over. In bitwise arithmetic:  in sbq_calc_wake_batch()
290 	 * depth / bits_per_word = depth >> shift  in sbq_calc_wake_batch()
291 	 * depth % bits_per_word = depth & ((1 << shift) - 1)  in sbq_calc_wake_batch()
296 	depth = ((depth >> sbq->sb.shift) * shallow_depth +  in sbq_calc_wake_batch()
297 		 min(depth & ((1U << sbq->sb.shift) - 1), shallow_depth));  in sbq_calc_wake_batch()
298 	wake_batch = clamp_t(unsigned int, depth / SBQ_WAIT_QUEUES, 1,  in sbq_calc_wake_batch()
304 int sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth,  in sbitmap_queue_init_node()  argument
310 	ret = sbitmap_init_node(&sbq->sb, depth, shift, flags, node);  in sbitmap_queue_init_node()
320 	if (depth && !round_robin) {  in sbitmap_queue_init_node()
322 			*per_cpu_ptr(sbq->alloc_hint, i) = prandom_u32() % depth;  in sbitmap_queue_init_node()
326 	sbq->wake_batch = sbq_calc_wake_batch(sbq, depth);  in sbitmap_queue_init_node()
347 					    unsigned int depth)  in sbitmap_queue_update_wake_batch()  argument
349 	unsigned int wake_batch = sbq_calc_wake_batch(sbq, depth);  in sbitmap_queue_update_wake_batch()
365 void sbitmap_queue_resize(struct sbitmap_queue *sbq, unsigned int depth)  in sbitmap_queue_resize()  argument
367 	sbitmap_queue_update_wake_batch(sbq, depth);  in sbitmap_queue_resize()
368 	sbitmap_resize(&sbq->sb, depth);  in sbitmap_queue_resize()
374 	unsigned int hint, depth;  in __sbitmap_queue_get()  local
378 	depth = READ_ONCE(sbq->sb.depth);  in __sbitmap_queue_get()
379 	if (unlikely(hint >= depth)) {  in __sbitmap_queue_get()
380 		hint = depth ? prandom_u32() % depth : 0;  in __sbitmap_queue_get()
391 		if (hint >= depth - 1)  in __sbitmap_queue_get()
403 	unsigned int hint, depth;  in __sbitmap_queue_get_shallow()  local
409 	depth = READ_ONCE(sbq->sb.depth);  in __sbitmap_queue_get_shallow()
410 	if (unlikely(hint >= depth)) {  in __sbitmap_queue_get_shallow()
411 		hint = depth ? prandom_u32() % depth : 0;  in __sbitmap_queue_get_shallow()
422 		if (hint >= depth - 1)  in __sbitmap_queue_get_shallow()
435 	sbitmap_queue_update_wake_batch(sbq, sbq->sb.depth);  in sbitmap_queue_min_shallow_depth()
522 	if (likely(!sbq->round_robin && nr < sbq->sb.depth))  in sbitmap_queue_clear()