1#include <linux/kernel.h>
 2#include <linux/threads.h>
 3#include <linux/module.h>
 4#include <linux/mm.h>
 5#include <linux/smp.h>
 6#include <linux/cpu.h>
 7
 8#include <linux/blk-mq.h>
 9#include "blk.h"
10#include "blk-mq.h"
11
12static int cpu_to_queue_index(unsigned int nr_cpus, unsigned int nr_queues,
13			      const int cpu)
14{
15	return cpu / ((nr_cpus + nr_queues - 1) / nr_queues);
16}
17
18static int get_first_sibling(unsigned int cpu)
19{
20	unsigned int ret;
21
22	ret = cpumask_first(topology_thread_cpumask(cpu));
23	if (ret < nr_cpu_ids)
24		return ret;
25
26	return cpu;
27}
28
29int blk_mq_update_queue_map(unsigned int *map, unsigned int nr_queues)
30{
31	unsigned int i, nr_cpus, nr_uniq_cpus, queue, first_sibling;
32	cpumask_var_t cpus;
33
34	if (!alloc_cpumask_var(&cpus, GFP_ATOMIC))
35		return 1;
36
37	cpumask_clear(cpus);
38	nr_cpus = nr_uniq_cpus = 0;
39	for_each_online_cpu(i) {
40		nr_cpus++;
41		first_sibling = get_first_sibling(i);
42		if (!cpumask_test_cpu(first_sibling, cpus))
43			nr_uniq_cpus++;
44		cpumask_set_cpu(i, cpus);
 
45	}
46
47	queue = 0;
48	for_each_possible_cpu(i) {
49		if (!cpu_online(i)) {
50			map[i] = 0;
51			continue;
52		}
53
54		/*
55		 * Easy case - we have equal or more hardware queues. Or
56		 * there are no thread siblings to take into account. Do
57		 * 1:1 if enough, or sequential mapping if less.
 
58		 */
59		if (nr_queues >= nr_cpus || nr_cpus == nr_uniq_cpus) {
60			map[i] = cpu_to_queue_index(nr_cpus, nr_queues, queue);
61			queue++;
62			continue;
 
 
 
 
63		}
64
65		/*
66		 * Less then nr_cpus queues, and we have some number of
67		 * threads per cores. Map sibling threads to the same
68		 * queue.
69		 */
70		first_sibling = get_first_sibling(i);
71		if (first_sibling == i) {
72			map[i] = cpu_to_queue_index(nr_uniq_cpus, nr_queues,
73							queue);
74			queue++;
75		} else
76			map[i] = map[first_sibling];
77	}
78
79	free_cpumask_var(cpus);
80	return 0;
81}
 
82
83unsigned int *blk_mq_make_queue_map(struct blk_mq_reg *reg)
 
 
 
 
 
 
 
 
84{
85	unsigned int *map;
86
87	/* If cpus are offline, map them to first hctx */
88	map = kzalloc_node(sizeof(*map) * num_possible_cpus(), GFP_KERNEL,
89				reg->numa_node);
90	if (!map)
91		return NULL;
92
93	if (!blk_mq_update_queue_map(map, reg->nr_hw_queues))
94		return map;
95
96	kfree(map);
97	return NULL;
98}

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