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/*
 2 * CPU <-> hardware queue mapping helpers
 3 *
 4 * Copyright (C) 2013-2014 Jens Axboe
 5 */
 6#include <linux/kernel.h>
 7#include <linux/threads.h>
 8#include <linux/module.h>
 9#include <linux/mm.h>
10#include <linux/smp.h>
11#include <linux/cpu.h>
12
13#include <linux/blk-mq.h>
14#include "blk.h"
15#include "blk-mq.h"
16
17static int cpu_to_queue_index(unsigned int nr_queues, const int cpu)
 
18{
19	return cpu % nr_queues;
20}
21
22static int get_first_sibling(unsigned int cpu)
23{
24	unsigned int ret;
25
26	ret = cpumask_first(topology_sibling_cpumask(cpu));
27	if (ret < nr_cpu_ids)
28		return ret;
29
30	return cpu;
31}
32
33int blk_mq_map_queues(struct blk_mq_tag_set *set)
34{
35	unsigned int *map = set->mq_map;
36	unsigned int nr_queues = set->nr_hw_queues;
37	unsigned int cpu, first_sibling;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
38
39	for_each_possible_cpu(cpu) {
40		/*
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.
45		 */
46		if (cpu < nr_queues) {
47			map[cpu] = cpu_to_queue_index(nr_queues, cpu);
48		} else {
49			first_sibling = get_first_sibling(cpu);
50			if (first_sibling == cpu)
51				map[cpu] = cpu_to_queue_index(nr_queues, cpu);
52			else
53				map[cpu] = map[first_sibling];
54		}
 
 
 
 
 
 
 
 
 
 
 
 
 
55	}
56
 
57	return 0;
58}
59EXPORT_SYMBOL_GPL(blk_mq_map_queues);
60
61/*
62 * We have no quick way of doing reverse lookups. This is only used at
63 * queue init time, so runtime isn't important.
64 */
65int blk_mq_hw_queue_to_node(unsigned int *mq_map, unsigned int index)
66{
67	int i;
68
69	for_each_possible_cpu(i) {
70		if (index == mq_map[i])
71			return local_memory_node(cpu_to_node(i));
72	}
 
 
 
 
73
74	return NUMA_NO_NODE;
 
75}