round_robin       437 block/blk-mq-tag.c 		    bool round_robin, int node)
round_robin       439 block/blk-mq-tag.c 	return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL,
round_robin       447 block/blk-mq-tag.c 	bool round_robin = alloc_policy == BLK_TAG_ALLOC_RR;
round_robin       449 block/blk-mq-tag.c 	if (bt_alloc(&tags->bitmap_tags, depth, round_robin, node))
round_robin       451 block/blk-mq-tag.c 	if (bt_alloc(&tags->breserved_tags, tags->nr_reserved_tags, round_robin,
round_robin       135 include/linux/sbitmap.h 	bool round_robin;
round_robin       190 include/linux/sbitmap.h int sbitmap_get(struct sbitmap *sb, unsigned int alloc_hint, bool round_robin);
round_robin       376 include/linux/sbitmap.h 			    int shift, bool round_robin, gfp_t flags, int node);
round_robin       140 lib/sbitmap.c  				     unsigned int alloc_hint, bool round_robin)
round_robin       147 lib/sbitmap.c  					!round_robin);
round_robin       157 lib/sbitmap.c  int sbitmap_get(struct sbitmap *sb, unsigned int alloc_hint, bool round_robin)
round_robin       169 lib/sbitmap.c  	if (round_robin)
round_robin       176 lib/sbitmap.c  						round_robin);
round_robin       370 lib/sbitmap.c  			    int shift, bool round_robin, gfp_t flags, int node)
round_robin       385 lib/sbitmap.c  	if (depth && !round_robin) {
round_robin       407 lib/sbitmap.c  	sbq->round_robin = round_robin;
round_robin       449 lib/sbitmap.c  	nr = sbitmap_get(&sbq->sb, hint, sbq->round_robin);
round_robin       454 lib/sbitmap.c  	} else if (nr == hint || unlikely(sbq->round_robin)) {
round_robin       485 lib/sbitmap.c  	} else if (nr == hint || unlikely(sbq->round_robin)) {
round_robin       601 lib/sbitmap.c  	if (likely(!sbq->round_robin && nr < sbq->sb.depth))
round_robin       658 lib/sbitmap.c  	seq_printf(m, "round_robin=%d\n", sbq->round_robin);