140 				     unsigned int alloc_hint, bool round_robin)  in sbitmap_find_bit_in_index()  argument
147 					!round_robin);  in sbitmap_find_bit_in_index()
157 int sbitmap_get(struct sbitmap *sb, unsigned int alloc_hint, bool round_robin)  in sbitmap_get()  argument
169 	if (round_robin)  in sbitmap_get()
176 						round_robin);  in sbitmap_get()
370 			    int shift, bool round_robin, gfp_t flags, int node)  in sbitmap_queue_init_node()  argument
385 	if (depth && !round_robin) {  in sbitmap_queue_init_node()
407 	sbq->round_robin = round_robin;  in sbitmap_queue_init_node()
449 	nr = sbitmap_get(&sbq->sb, hint, sbq->round_robin);  in __sbitmap_queue_get()
454 	} else if (nr == hint || unlikely(sbq->round_robin)) {  in __sbitmap_queue_get()
485 	} else if (nr == hint || unlikely(sbq->round_robin)) {  in __sbitmap_queue_get_shallow()
601 	if (likely(!sbq->round_robin && nr < sbq->sb.depth))  in sbitmap_queue_clear()
658 	seq_printf(m, "round_robin=%d\n", sbq->round_robin);  in sbitmap_queue_show()