1 // SPDX-License-Identifier: GPL-2.0 1 // SPDX-License-Identifier: GPL-2.0 2 /* 2 /* 3 * CPU <-> hardware queue mapping helpers 3 * CPU <-> hardware queue mapping helpers 4 * 4 * 5 * Copyright (C) 2013-2014 Jens Axboe 5 * Copyright (C) 2013-2014 Jens Axboe 6 */ 6 */ 7 #include <linux/kernel.h> 7 #include <linux/kernel.h> 8 #include <linux/threads.h> 8 #include <linux/threads.h> 9 #include <linux/module.h> 9 #include <linux/module.h> 10 #include <linux/mm.h> 10 #include <linux/mm.h> 11 #include <linux/smp.h> 11 #include <linux/smp.h> 12 #include <linux/cpu.h> 12 #include <linux/cpu.h> 13 #include <linux/group_cpus.h> << 14 13 >> 14 #include <linux/blk-mq.h> 15 #include "blk.h" 15 #include "blk.h" 16 #include "blk-mq.h" 16 #include "blk-mq.h" 17 17 18 void blk_mq_map_queues(struct blk_mq_queue_map !! 18 static int cpu_to_queue_index(struct blk_mq_queue_map *qmap, >> 19 unsigned int nr_queues, const int cpu) 19 { 20 { 20 const struct cpumask *masks; !! 21 return qmap->queue_offset + (cpu % nr_queues); 21 unsigned int queue, cpu; !! 22 } 22 23 23 masks = group_cpus_evenly(qmap->nr_que !! 24 static int get_first_sibling(unsigned int cpu) 24 if (!masks) { !! 25 { 25 for_each_possible_cpu(cpu) !! 26 unsigned int ret; 26 qmap->mq_map[cpu] = qm !! 27 27 return; !! 28 ret = cpumask_first(topology_sibling_cpumask(cpu)); 28 } !! 29 if (ret < nr_cpu_ids) >> 30 return ret; 29 31 30 for (queue = 0; queue < qmap->nr_queue !! 32 return cpu; 31 for_each_cpu(cpu, &masks[queue !! 33 } 32 qmap->mq_map[cpu] = qm !! 34 >> 35 int blk_mq_map_queues(struct blk_mq_queue_map *qmap) >> 36 { >> 37 unsigned int *map = qmap->mq_map; >> 38 unsigned int nr_queues = qmap->nr_queues; >> 39 unsigned int cpu, first_sibling; >> 40 >> 41 for_each_possible_cpu(cpu) { >> 42 /* >> 43 * First do sequential mapping between CPUs and queues. >> 44 * In case we still have CPUs to map, and we have some number of >> 45 * threads per cores then map sibling threads to the same queue >> 46 * for performance optimizations. >> 47 */ >> 48 if (cpu < nr_queues) { >> 49 map[cpu] = cpu_to_queue_index(qmap, nr_queues, cpu); >> 50 } else { >> 51 first_sibling = get_first_sibling(cpu); >> 52 if (first_sibling == cpu) >> 53 map[cpu] = cpu_to_queue_index(qmap, nr_queues, cpu); >> 54 else >> 55 map[cpu] = map[first_sibling]; >> 56 } 33 } 57 } 34 kfree(masks); !! 58 >> 59 return 0; 35 } 60 } 36 EXPORT_SYMBOL_GPL(blk_mq_map_queues); 61 EXPORT_SYMBOL_GPL(blk_mq_map_queues); 37 62 38 /** 63 /** 39 * blk_mq_hw_queue_to_node - Look up the memor 64 * blk_mq_hw_queue_to_node - Look up the memory node for a hardware queue index 40 * @qmap: CPU to hardware queue map. 65 * @qmap: CPU to hardware queue map. 41 * @index: hardware queue index. 66 * @index: hardware queue index. 42 * 67 * 43 * We have no quick way of doing reverse looku 68 * We have no quick way of doing reverse lookups. This is only used at 44 * queue init time, so runtime isn't important 69 * queue init time, so runtime isn't important. 45 */ 70 */ 46 int blk_mq_hw_queue_to_node(struct blk_mq_queu 71 int blk_mq_hw_queue_to_node(struct blk_mq_queue_map *qmap, unsigned int index) 47 { 72 { 48 int i; 73 int i; 49 74 50 for_each_possible_cpu(i) { 75 for_each_possible_cpu(i) { 51 if (index == qmap->mq_map[i]) 76 if (index == qmap->mq_map[i]) 52 return cpu_to_node(i); !! 77 return local_memory_node(cpu_to_node(i)); 53 } 78 } 54 79 55 return NUMA_NO_NODE; 80 return NUMA_NO_NODE; 56 } 81 } 57 82
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.