Home
last modified time | relevance | path

Searched refs:round_robin (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/lib/
H A Dsbitmap.c140 unsigned int alloc_hint, bool round_robin) in sbitmap_find_bit_in_index()
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()
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()
139 sbitmap_find_bit_in_index(struct sbitmap *sb, int index, unsigned int alloc_hint, bool round_robin) sbitmap_find_bit_in_index() argument
355 sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth, int shift, bool round_robin, gfp_t flags, int node) sbitmap_queue_init_node() argument
[all...]
/kernel/linux/linux-6.6/lib/
H 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()
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()
422 round_robin, true); in sbitmap_queue_init_node()
490 if (unlikely(sb->round_robin)) in __sbitmap_queue_get_batch()
83 sbitmap_init_node(struct sbitmap *sb, unsigned int depth, int shift, gfp_t flags, int node, bool round_robin, bool alloc_hint) sbitmap_init_node() argument
415 sbitmap_queue_init_node(struct sbitmap_queue *sbq, unsigned int depth, int shift, bool round_robin, gfp_t flags, int node) sbitmap_queue_init_node() argument
[all...]
/kernel/linux/linux-5.10/block/
H A Dblk-mq-tag.c468 bool round_robin, int node) in bt_alloc()
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()
467 bt_alloc(struct sbitmap_queue *bt, unsigned int depth, bool round_robin, int node) bt_alloc() argument
/kernel/linux/linux-6.6/include/linux/
H A Dsbitmap.h64 * @round_robin: Allocate bits in strict round-robin order.
66 bool round_robin; member
157 * @round_robin: If true, be stricter about allocation order; always allocate
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()
407 * @round_robin: See sbitmap_get().
414 int shift, bool round_robin, gfp_t flags, int node);
/kernel/linux/linux-5.10/include/linux/
H A Dsbitmap.h133 * @round_robin: Allocate bits in strict round-robin order.
135 bool round_robin; member
182 * @round_robin: If true, be stricter about allocation order; always allocate
190 int sbitmap_get(struct sbitmap *sb, unsigned int alloc_hint, bool round_robin);
360 * @round_robin: See sbitmap_get().
367 int shift, bool round_robin, gfp_t flags, int node);
/kernel/linux/linux-6.6/block/
H A Dblk-mq-tag.c540 bool round_robin, int node) in bt_alloc()
542 return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL, in bt_alloc()
552 bool round_robin = alloc_policy == BLK_TAG_ALLOC_RR; in blk_mq_init_bitmaps() local
554 if (bt_alloc(bitmap_tags, depth, round_robin, node)) in blk_mq_init_bitmaps()
556 if (bt_alloc(breserved_tags, reserved, round_robin, node)) in blk_mq_init_bitmaps()
539 bt_alloc(struct sbitmap_queue *bt, unsigned int depth, bool round_robin, int node) bt_alloc() argument

Completed in 6 milliseconds