Home
last modified time | relevance | path

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

/linux-6.3-rc2/lib/
A Dsbitmap.c20 if (depth && !sb->round_robin) { in init_alloc_hint()
51 } else if (nr == hint || unlikely(sb->round_robin)) { in update_alloc_hint_after_get()
84 gfp_t flags, int node, bool round_robin, in sbitmap_init_node() argument
99 sb->round_robin = round_robin; in sbitmap_init_node()
230 if (sb->round_robin) in __sbitmap_get()
236 !sb->round_robin); in __sbitmap_get()
416 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node() argument
422 round_robin, true); in sbitmap_queue_init_node()
490 if (unlikely(sb->round_robin)) in __sbitmap_queue_get_batch()
606 if (likely(!sb->round_robin && tag < sb->depth)) in sbitmap_update_cpu_hint()
[all …]
/linux-6.3-rc2/include/linux/
A Dsbitmap.h66 bool round_robin; member
166 gfp_t flags, int node, bool round_robin, bool alloc_hint);
344 if (likely(sb->alloc_hint && !sb->round_robin && bitnr < sb->depth)) in sbitmap_put()
414 int shift, bool round_robin, gfp_t flags, int node);
/linux-6.3-rc2/block/
A Dblk-mq-tag.c533 bool round_robin, int node) in bt_alloc() argument
535 return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL, in bt_alloc()
545 bool round_robin = alloc_policy == BLK_TAG_ALLOC_RR; in blk_mq_init_bitmaps() local
547 if (bt_alloc(bitmap_tags, depth, round_robin, node)) in blk_mq_init_bitmaps()
549 if (bt_alloc(breserved_tags, reserved, round_robin, node)) in blk_mq_init_bitmaps()

Completed in 10 milliseconds