Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/lib/
Dsbitmap.c140 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()
356 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node() argument
371 if (depth && !round_robin) { in sbitmap_queue_init_node()
393 sbq->round_robin = round_robin; in sbitmap_queue_init_node()
435 nr = sbitmap_get(&sbq->sb, hint, sbq->round_robin); in __sbitmap_queue_get()
440 } else if (nr == hint || unlikely(sbq->round_robin)) { in __sbitmap_queue_get()
[all …]
/kernel/linux/linux-5.10/block/
Dblk-mq-tag.c468 bool round_robin, int node) in bt_alloc() argument
470 return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL, in bt_alloc()
478 bool round_robin = alloc_policy == BLK_TAG_ALLOC_RR; in blk_mq_init_bitmap_tags() local
480 if (bt_alloc(&tags->__bitmap_tags, depth, round_robin, node)) in blk_mq_init_bitmap_tags()
483 round_robin, node)) in blk_mq_init_bitmap_tags()
499 bool round_robin = alloc_policy == BLK_TAG_ALLOC_RR; in blk_mq_init_shared_sbitmap() local
502 if (bt_alloc(&set->__bitmap_tags, depth, round_robin, node)) in blk_mq_init_shared_sbitmap()
505 round_robin, node)) in blk_mq_init_shared_sbitmap()
/kernel/linux/linux-5.10/include/linux/
Dsbitmap.h135 bool round_robin; member
190 int sbitmap_get(struct sbitmap *sb, unsigned int alloc_hint, bool round_robin);
367 int shift, bool round_robin, gfp_t flags, int node);