Orange Pi5 kernel

Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards

3 Commits   0 Branches   0 Tags
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  1) // SPDX-License-Identifier: GPL-2.0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  2) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  3)  * CPU <-> hardware queue mapping helpers
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  4)  *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  5)  * Copyright (C) 2013-2014 Jens Axboe
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  6)  */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  7) #include <linux/kernel.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  8) #include <linux/threads.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300  9) #include <linux/module.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) #include <linux/mm.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) #include <linux/smp.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) #include <linux/cpu.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include <linux/blk-mq.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include "blk.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include "blk-mq.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) static int queue_index(struct blk_mq_queue_map *qmap,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) 		       unsigned int nr_queues, const int q)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) 	return qmap->queue_offset + (q % nr_queues);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) static int get_first_sibling(unsigned int cpu)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) 	unsigned int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) 	ret = cpumask_first(topology_sibling_cpumask(cpu));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) 	if (ret < nr_cpu_ids)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) 		return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) 	return cpu;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) int blk_mq_map_queues(struct blk_mq_queue_map *qmap)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) 	unsigned int *map = qmap->mq_map;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) 	unsigned int nr_queues = qmap->nr_queues;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) 	unsigned int cpu, first_sibling, q = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) 	for_each_possible_cpu(cpu)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) 		map[cpu] = -1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) 	/*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) 	 * Spread queues among present CPUs first for minimizing
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) 	 * count of dead queues which are mapped by all un-present CPUs
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) 	 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) 	for_each_present_cpu(cpu) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) 		if (q >= nr_queues)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) 			break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) 		map[cpu] = queue_index(qmap, nr_queues, q++);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) 	for_each_possible_cpu(cpu) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) 		if (map[cpu] != -1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) 			continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) 		/*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) 		 * First do sequential mapping between CPUs and queues.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) 		 * In case we still have CPUs to map, and we have some number of
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) 		 * threads per cores then map sibling threads to the same queue
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) 		 * for performance optimizations.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) 		 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) 		if (q < nr_queues) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) 			map[cpu] = queue_index(qmap, nr_queues, q++);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) 		} else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) 			first_sibling = get_first_sibling(cpu);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) 			if (first_sibling == cpu)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) 				map[cpu] = queue_index(qmap, nr_queues, q++);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) 			else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) 				map[cpu] = map[first_sibling];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) 		}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) 	return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) EXPORT_SYMBOL_GPL(blk_mq_map_queues);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79)  * blk_mq_hw_queue_to_node - Look up the memory node for a hardware queue index
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80)  * @qmap: CPU to hardware queue map.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81)  * @index: hardware queue index.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82)  *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83)  * We have no quick way of doing reverse lookups. This is only used at
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84)  * queue init time, so runtime isn't important.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85)  */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) int blk_mq_hw_queue_to_node(struct blk_mq_queue_map *qmap, unsigned int index)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) 	int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) 	for_each_possible_cpu(i) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) 		if (index == qmap->mq_map[i])
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) 			return cpu_to_node(i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) 	}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) 
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) 	return NUMA_NO_NODE;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) }