2 * CPU <-> hardware queue mapping helpers
4 * Copyright (C) 2013-2014 Jens Axboe
6 #include <linux/kernel.h>
7 #include <linux/threads.h>
8 #include <linux/module.h>
10 #include <linux/smp.h>
11 #include <linux/cpu.h>
13 #include <linux/blk-mq.h>
17 static int cpu_to_queue_index(unsigned int nr_queues
, const int cpu
)
19 return cpu
% nr_queues
;
22 static int get_first_sibling(unsigned int cpu
)
26 ret
= cpumask_first(topology_sibling_cpumask(cpu
));
33 int blk_mq_map_queues(struct blk_mq_tag_set
*set
)
35 unsigned int *map
= set
->mq_map
;
36 unsigned int nr_queues
= set
->nr_hw_queues
;
37 unsigned int cpu
, first_sibling
;
39 for_each_possible_cpu(cpu
) {
41 * First do sequential mapping between CPUs and queues.
42 * In case we still have CPUs to map, and we have some number of
43 * threads per cores then map sibling threads to the same queue for
44 * performace optimizations.
46 if (cpu
< nr_queues
) {
47 map
[cpu
] = cpu_to_queue_index(nr_queues
, cpu
);
49 first_sibling
= get_first_sibling(cpu
);
50 if (first_sibling
== cpu
)
51 map
[cpu
] = cpu_to_queue_index(nr_queues
, cpu
);
53 map
[cpu
] = map
[first_sibling
];
59 EXPORT_SYMBOL_GPL(blk_mq_map_queues
);
62 * We have no quick way of doing reverse lookups. This is only used at
63 * queue init time, so runtime isn't important.
65 int blk_mq_hw_queue_to_node(unsigned int *mq_map
, unsigned int index
)
69 for_each_possible_cpu(i
) {
70 if (index
== mq_map
[i
])
71 return local_memory_node(cpu_to_node(i
));