Home
last modified time | relevance | path

Searched refs:round_robin (Results 1 – 3 of 3) sorted by relevance

/Linux-v4.19/lib/
Dsbitmap.c114 int sbitmap_get(struct sbitmap *sb, unsigned int alloc_hint, bool round_robin) in sbitmap_get() argument
125 !round_robin); in sbitmap_get()
305 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node() argument
320 if (depth && !round_robin) { in sbitmap_queue_init_node()
341 sbq->round_robin = round_robin; in sbitmap_queue_init_node()
383 nr = sbitmap_get(&sbq->sb, hint, sbq->round_robin); in __sbitmap_queue_get()
388 } else if (nr == hint || unlikely(sbq->round_robin)) { in __sbitmap_queue_get()
419 } else if (nr == hint || unlikely(sbq->round_robin)) { in __sbitmap_queue_get_shallow()
522 if (likely(!sbq->round_robin && nr < sbq->sb.depth)) in sbitmap_queue_clear()
578 seq_printf(m, "round_robin=%d\n", sbq->round_robin); in sbitmap_queue_show()
/Linux-v4.19/include/linux/
Dsbitmap.h131 bool round_robin; member
186 int sbitmap_get(struct sbitmap *sb, unsigned int alloc_hint, bool round_robin);
359 int shift, bool round_robin, gfp_t flags, int node);
/Linux-v4.19/block/
Dblk-mq-tag.c349 bool round_robin, int node) in bt_alloc() argument
351 return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL, in bt_alloc()
359 bool round_robin = alloc_policy == BLK_TAG_ALLOC_RR; in blk_mq_init_bitmap_tags() local
361 if (bt_alloc(&tags->bitmap_tags, depth, round_robin, node)) in blk_mq_init_bitmap_tags()
363 if (bt_alloc(&tags->breserved_tags, tags->nr_reserved_tags, round_robin, in blk_mq_init_bitmap_tags()