14 	unsigned depth = sb->depth;  in init_alloc_hint()  local
20 	if (depth && !sb->round_robin) {  in init_alloc_hint()
24 			*per_cpu_ptr(sb->alloc_hint, i) = prandom_u32_max(depth);  in init_alloc_hint()
30 						    unsigned int depth)  in update_alloc_hint_before_get()  argument
35 	if (unlikely(hint >= depth)) {  in update_alloc_hint_before_get()
36 		hint = depth ? prandom_u32_max(depth) : 0;  in update_alloc_hint_before_get()
44 					       unsigned int depth,  in update_alloc_hint_after_get()  argument
54 		if (hint >= depth - 1)  in update_alloc_hint_after_get()
83 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,  in sbitmap_init_node()  argument
90 		shift = sbitmap_calculate_shift(depth);  in sbitmap_init_node()
97 	sb->depth = depth;  in sbitmap_init_node()
98 	sb->map_nr = DIV_ROUND_UP(sb->depth, bits_per_word);  in sbitmap_init_node()
101 	if (depth == 0) {  in sbitmap_init_node()
123 void sbitmap_resize(struct sbitmap *sb, unsigned int depth)  in sbitmap_resize()  argument
131 	sb->depth = depth;  in sbitmap_resize()
132 	sb->map_nr = DIV_ROUND_UP(sb->depth, bits_per_word);  in sbitmap_resize()
136 static int __sbitmap_get_word(unsigned long *word, unsigned long depth,  in __sbitmap_get_word()  argument
145 		nr = find_next_zero_bit(word, depth, hint);  in __sbitmap_get_word()
146 		if (unlikely(nr >= depth)) {  in __sbitmap_get_word()
163 		if (hint >= depth - 1)  in __sbitmap_get_word()
224 	unsigned int hint, depth;  in sbitmap_get()  local
229 	depth = READ_ONCE(sb->depth);  in sbitmap_get()
230 	hint = update_alloc_hint_before_get(sb, depth);  in sbitmap_get()
232 	update_alloc_hint_after_get(sb, depth, hint, nr);  in sbitmap_get()
278 	unsigned int hint, depth;  in sbitmap_get_shallow()  local
283 	depth = READ_ONCE(sb->depth);  in sbitmap_get_shallow()
284 	hint = update_alloc_hint_before_get(sb, depth);  in sbitmap_get_shallow()
286 	update_alloc_hint_after_get(sb, depth, hint, nr);  in sbitmap_get_shallow()
333 	seq_printf(m, "depth=%u\n", sb->depth);  in sbitmap_show()
392 					unsigned int depth)  in sbq_calc_wake_batch()  argument
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()
416 	wake_batch = clamp_t(unsigned int, depth / SBQ_WAIT_QUEUES, 1,  in sbq_calc_wake_batch()
422 int sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth,  in sbitmap_queue_init_node()  argument
428 	ret = sbitmap_init_node(&sbq->sb, depth, shift, flags, node,  in sbitmap_queue_init_node()
434 	sbq->wake_batch = sbq_calc_wake_batch(sbq, depth);  in sbitmap_queue_init_node()
472 					    unsigned int depth)  in sbitmap_queue_update_wake_batch()  argument
476 	wake_batch = sbq_calc_wake_batch(sbq, depth);  in sbitmap_queue_update_wake_batch()
485 	unsigned int depth = (sbq->sb.depth + users - 1) / users;  in sbitmap_queue_recalculate_wake_batch()  local
487 	min_batch = sbq->sb.depth >= (4 * SBQ_WAIT_QUEUES) ? 4 : 1;  in sbitmap_queue_recalculate_wake_batch()
489 	wake_batch = clamp_val(depth / SBQ_WAIT_QUEUES,  in sbitmap_queue_recalculate_wake_batch()
495 void sbitmap_queue_resize(struct sbitmap_queue *sbq, unsigned int depth)  in sbitmap_queue_resize()  argument
497 	sbitmap_queue_update_wake_batch(sbq, depth);  in sbitmap_queue_resize()
498 	sbitmap_resize(&sbq->sb, depth);  in sbitmap_queue_resize()
512 	unsigned int hint, depth;  in __sbitmap_queue_get_batch()  local
519 	depth = READ_ONCE(sb->depth);  in __sbitmap_queue_get_batch()
520 	hint = update_alloc_hint_before_get(sb, depth);  in __sbitmap_queue_get_batch()
548 				update_alloc_hint_after_get(sb, depth, hint,  in __sbitmap_queue_get_batch()
575 	sbitmap_queue_update_wake_batch(sbq, sbq->sb.depth);  in sbitmap_queue_min_shallow_depth()
684 	if (likely(!sb->round_robin && tag < sb->depth))  in sbitmap_update_cpu_hint()