include/linux/sbitmap.h

49 	 * @depth: Number of bits used in the whole bitmap.
51 	unsigned int depth;
132 	 * @min_shallow_depth: The minimum shallow depth which may be passed to
152  * @depth: Number of bits to allocate.
165 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,
172 		return sb->depth - (index << sb->shift);
190  * @depth: New number of bits to resize to.
193  * depth doesn't exceed the depth that the sb was initialized with.
195 void sbitmap_resize(struct sbitmap *sb, unsigned int depth);
209  * limiting the depth used from each word.
255 	if (start >= sb->depth)
260 	while (scanned < sb->depth) {
262 		unsigned int depth = min_t(unsigned int,
264 					   sb->depth - scanned);
266 		scanned += depth;
276 		depth += nr;
278 			nr = find_next_bit(&word, depth, nr);
279 			if (nr >= depth)
344 	if (likely(sb->alloc_hint && !sb->round_robin && bitnr < sb->depth))
353 static inline int sbitmap_calculate_shift(unsigned int depth)
363 	if (depth >= 4) {
364 		while ((4U << shift) > depth)
405  * @depth: See sbitmap_init_node().
413 int sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth,
433  * by depth. This interface is for HCTX shared tags or queue shared tags.
441  * @depth: New number of bits to resize to.
447 void sbitmap_queue_resize(struct sbitmap_queue *sbq, unsigned int depth);
473  * sbitmap_queue, limiting the depth used from each word, with preemption
509  * minimum shallow depth that will be used.
511  * @min_shallow_depth: The minimum shallow depth that will be passed to
515  * depends on the depth of the bitmap. Since the shallow allocation functions
516  * effectively operate with a different depth, the shallow depth must be taken
518  * with the minimum shallow depth that will be used. Failure to do so can result