Home
last modified time | relevance | path

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

/linux/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()
102 gfp_t flags, int node, bool round_robin, in sbitmap_init_node() argument
118 sb->round_robin = round_robin; in sbitmap_init_node()
252 if (sb->round_robin) in __sbitmap_get()
258 !sb->round_robin); in __sbitmap_get()
433 int shift, bool round_robin, gfp_t flags, int node) in sbitmap_queue_init_node() argument
439 round_robin, true); in sbitmap_queue_init_node()
507 if (unlikely(sb->round_robin)) in __sbitmap_queue_get_batch()
622 if (likely(!sb->round_robin && tag < sb->depth)) in sbitmap_update_cpu_hint()
[all …]
/linux/drivers/md/dm-vdo/
H A Dfunnel-workqueue.c502 struct round_robin_work_queue *round_robin = as_round_robin_work_queue(queue); in vdo_dump_work_queue() local
505 for (i = 0; i < round_robin->num_service_queues; i++) in vdo_dump_work_queue()
506 dump_simple_work_queue(round_robin->service_queues[i]); in vdo_dump_work_queue()
568 struct round_robin_work_queue *round_robin = as_round_robin_work_queue(queue); in vdo_enqueue_work_queue() local
578 unsigned int index = rotor % round_robin->num_service_queues; in vdo_enqueue_work_queue()
580 simple_queue = round_robin->service_queues[index]; in vdo_enqueue_work_queue()
/linux/include/linux/
H A Dsbitmap.h71 bool round_robin; member
171 gfp_t flags, int node, bool round_robin, bool alloc_hint);
349 if (likely(sb->alloc_hint && !sb->round_robin && bitnr < sb->depth)) in sbitmap_put()
419 int shift, bool round_robin, gfp_t flags, int node);