56 	unsigned int depth;  member
170 int sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift,
177 		return sb->depth - (index << sb->shift);  in __map_depth()
200 void sbitmap_resize(struct sbitmap *sb, unsigned int depth);
260 	if (start >= sb->depth)  in __sbitmap_for_each_set()
265 	while (scanned < sb->depth) {  in __sbitmap_for_each_set()
267 		unsigned int depth = min_t(unsigned int,  in __sbitmap_for_each_set()  local
269 					   sb->depth - scanned);  in __sbitmap_for_each_set()
271 		scanned += depth;  in __sbitmap_for_each_set()
281 		depth += nr;  in __sbitmap_for_each_set()
283 			nr = find_next_bit(&word, depth, nr);  in __sbitmap_for_each_set()
284 			if (nr >= depth)  in __sbitmap_for_each_set()
349 	if (likely(sb->alloc_hint && !sb->round_robin && bitnr < sb->depth))  in sbitmap_put()
358 static inline int sbitmap_calculate_shift(unsigned int depth)  in sbitmap_calculate_shift()  argument
368 	if (depth >= 4) {  in sbitmap_calculate_shift()
369 		while ((4U << shift) > depth)  in sbitmap_calculate_shift()
418 int sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth,
452 void sbitmap_queue_resize(struct sbitmap_queue *sbq, unsigned int depth);