22 	 * @depth: Number of bits being used in @word/@cleared
24 	unsigned long depth;  member
50 	 * @depth: Number of bits used in the whole bitmap.
52 	unsigned int depth;  member
138 	 * @min_shallow_depth: The minimum shallow depth which may be passed to
147  * @depth: Number of bits to allocate.
155 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,
171  * @depth: New number of bits to resize to.
174  * depth doesn't exceed the depth that the sb was initialized with.
176 void sbitmap_resize(struct sbitmap *sb, unsigned int depth);
194  * limiting the depth used from each word.
242 	if (start >= sb->depth)  in __sbitmap_for_each_set()
247 	while (scanned < sb->depth) {  in __sbitmap_for_each_set()
249 		unsigned int depth = min_t(unsigned int,  in __sbitmap_for_each_set()  local
250 					   sb->map[index].depth - nr,  in __sbitmap_for_each_set()
251 					   sb->depth - scanned);  in __sbitmap_for_each_set()
253 		scanned += depth;  in __sbitmap_for_each_set()
263 		depth += nr;  in __sbitmap_for_each_set()
265 			nr = find_next_bit(&word, depth, nr);  in __sbitmap_for_each_set()
266 			if (nr >= depth)  in __sbitmap_for_each_set()
358  * @depth: See sbitmap_init_node().
366 int sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth,
384  * @depth: New number of bits to resize to.
390 void sbitmap_queue_resize(struct sbitmap_queue *sbq, unsigned int depth);
403  * sbitmap_queue, limiting the depth used from each word, with preemption
439  * sbitmap_queue, limiting the depth used from each word.
465  * minimum shallow depth that will be used.
467  * @min_shallow_depth: The minimum shallow depth that will be passed to
471  * depends on the depth of the bitmap. Since the shallow allocation functions
472  * effectively operate with a different depth, the shallow depth must be taken
474  * with the minimum shallow depth that will be used. Failure to do so can result