51 	unsigned int depth;  member
165 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,
172 		return sb->depth - (index << sb->shift);  in __map_depth()
195 void sbitmap_resize(struct sbitmap *sb, unsigned int depth);
255 	if (start >= sb->depth)  in __sbitmap_for_each_set()
260 	while (scanned < sb->depth) {  in __sbitmap_for_each_set()
262 		unsigned int depth = min_t(unsigned int,  in __sbitmap_for_each_set()  local
264 					   sb->depth - scanned);  in __sbitmap_for_each_set()
266 		scanned += depth;  in __sbitmap_for_each_set()
276 		depth += nr;  in __sbitmap_for_each_set()
278 			nr = find_next_bit(&word, depth, nr);  in __sbitmap_for_each_set()
279 			if (nr >= depth)  in __sbitmap_for_each_set()
344 	if (likely(sb->alloc_hint && !sb->round_robin && bitnr < sb->depth))  in sbitmap_put()
353 static inline int sbitmap_calculate_shift(unsigned int depth)  in sbitmap_calculate_shift()  argument
363 	if (depth >= 4) {  in sbitmap_calculate_shift()
364 		while ((4U << shift) > depth)  in sbitmap_calculate_shift()
413 int sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth,
447 void sbitmap_queue_resize(struct sbitmap_queue *sbq, unsigned int depth);