topology.c 8.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13
/*
 * arch/arm/kernel/topology.c
 *
 * Copyright (C) 2011 Linaro Limited.
 * Written by: Vincent Guittot
 *
 * based on arch/sh/kernel/topology.c
 *
 * This file is subject to the terms and conditions of the GNU General Public
 * License.  See the file "COPYING" in the main directory of this archive
 * for more details.
 */

14
#include <linux/arch_topology.h>
15
#include <linux/cpu.h>
16
#include <linux/cpufreq.h>
17
#include <linux/cpumask.h>
18
#include <linux/export.h>
19 20 21 22
#include <linux/init.h>
#include <linux/percpu.h>
#include <linux/node.h>
#include <linux/nodemask.h>
23
#include <linux/of.h>
24
#include <linux/sched.h>
25
#include <linux/sched/topology.h>
26
#include <linux/slab.h>
27
#include <linux/string.h>
28

29
#include <asm/cpu.h>
30 31 32
#include <asm/cputype.h>
#include <asm/topology.h>

33
/*
34
 * cpu capacity scale management
35 36 37
 */

/*
38
 * cpu capacity table
39 40
 * This per cpu data structure describes the relative capacity of each core.
 * On a heteregenous system, cores don't have the same computation capacity
41 42 43 44 45 46
 * and we reflect that difference in the cpu_capacity field so the scheduler
 * can take this difference into account during load balance. A per cpu
 * structure is preferred because each CPU updates its own cpu_capacity field
 * during the load balance except for idle cores. One idle core is selected
 * to run the rebalance_domains for all idle cores and the cpu_capacity can be
 * updated during this sequence.
47 48
 */

49 50 51 52 53 54 55 56 57 58
#ifdef CONFIG_OF
struct cpu_efficiency {
	const char *compatible;
	unsigned long efficiency;
};

/*
 * Table of relative efficiency of each processors
 * The efficiency value must fit in 20bit and the final
 * cpu_scale value must be in the range
59
 *   0 < cpu_scale < 3*SCHED_CAPACITY_SCALE/2
60 61 62
 * in order to return at most 1 when DIV_ROUND_CLOSEST
 * is used to compute the capacity of a CPU.
 * Processors that are not defined in the table,
63
 * use the default SCHED_CAPACITY_SCALE value for cpu_scale.
64
 */
65
static const struct cpu_efficiency table_efficiency[] = {
66 67 68 69 70
	{"arm,cortex-a15", 3891},
	{"arm,cortex-a7",  2048},
	{NULL, },
};

71
static unsigned long *__cpu_capacity;
72
#define cpu_capacity(cpu)	__cpu_capacity[cpu]
73

74
static unsigned long middle_capacity = 1;
75
static bool cap_from_dt = true;
76 77 78 79 80

/*
 * Iterate all CPUs' descriptor in DT and compute the efficiency
 * (as per table_efficiency). Also calculate a middle efficiency
 * as close as possible to  (max{eff_i} - min{eff_i}) / 2
81 82 83
 * This is later used to scale the cpu_capacity field such that an
 * 'average' CPU is of middle capacity. Also see the comments near
 * table_efficiency[] and update_cpu_capacity().
84 85 86
 */
static void __init parse_dt_topology(void)
{
87
	const struct cpu_efficiency *cpu_eff;
88
	struct device_node *cn = NULL;
89
	unsigned long min_capacity = ULONG_MAX;
90 91
	unsigned long max_capacity = 0;
	unsigned long capacity = 0;
92
	int cpu = 0;
93

94 95
	__cpu_capacity = kcalloc(nr_cpu_ids, sizeof(*__cpu_capacity),
				 GFP_NOWAIT);
96

97 98 99 100 101 102
	cn = of_find_node_by_path("/cpus");
	if (!cn) {
		pr_err("No CPU information found in DT\n");
		return;
	}

103 104
	for_each_possible_cpu(cpu) {
		const u32 *rate;
105 106
		int len;

107 108 109 110 111 112
		/* too early to use cpu->of_node */
		cn = of_get_cpu_node(cpu, NULL);
		if (!cn) {
			pr_err("missing device node for CPU %d\n", cpu);
			continue;
		}
113

114 115 116 117 118 119 120
		if (parse_cpu_capacity(cn, cpu)) {
			of_node_put(cn);
			continue;
		}

		cap_from_dt = false;

121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144
		for (cpu_eff = table_efficiency; cpu_eff->compatible; cpu_eff++)
			if (of_device_is_compatible(cn, cpu_eff->compatible))
				break;

		if (cpu_eff->compatible == NULL)
			continue;

		rate = of_get_property(cn, "clock-frequency", &len);
		if (!rate || len != 4) {
			pr_err("%s missing clock-frequency property\n",
				cn->full_name);
			continue;
		}

		capacity = ((be32_to_cpup(rate)) >> 20) * cpu_eff->efficiency;

		/* Save min capacity of the system */
		if (capacity < min_capacity)
			min_capacity = capacity;

		/* Save max capacity of the system */
		if (capacity > max_capacity)
			max_capacity = capacity;

145
		cpu_capacity(cpu) = capacity;
146 147 148 149 150 151
	}

	/* If min and max capacities are equals, we bypass the update of the
	 * cpu_scale because all CPUs have the same capacity. Otherwise, we
	 * compute a middle_capacity factor that will ensure that the capacity
	 * of an 'average' CPU of the system will be as close as possible to
152
	 * SCHED_CAPACITY_SCALE, which is the default value, but with the
153 154
	 * constraint explained near table_efficiency[].
	 */
155
	if (4*max_capacity < (3*(max_capacity + min_capacity)))
156
		middle_capacity = (min_capacity + max_capacity)
157
				>> (SCHED_CAPACITY_SHIFT+1);
158 159
	else
		middle_capacity = ((max_capacity / 3)
160
				>> (SCHED_CAPACITY_SHIFT-1)) + 1;
161

162
	if (cap_from_dt)
163
		normalize_cpu_capacity();
164 165 166 167 168 169 170
}

/*
 * Look for a customed capacity of a CPU in the cpu_capacity table during the
 * boot. The update of all CPUs is in O(n^2) for heteregeneous system but the
 * function returns directly for SMP system.
 */
171
static void update_cpu_capacity(unsigned int cpu)
172
{
173
	if (!cpu_capacity(cpu) || cap_from_dt)
174 175
		return;

176
	set_capacity_scale(cpu, cpu_capacity(cpu) / middle_capacity);
177

R
Russell King 已提交
178
	pr_info("CPU%u: update cpu_capacity %lu\n",
179
		cpu, arch_scale_cpu_capacity(NULL, cpu));
180 181 182 183
}

#else
static inline void parse_dt_topology(void) {}
184
static inline void update_cpu_capacity(unsigned int cpuid) {}
185 186
#endif

187
 /*
188 189
 * cpu topology table
 */
190
struct cputopo_arm cpu_topology[NR_CPUS];
191
EXPORT_SYMBOL_GPL(cpu_topology);
192

193
const struct cpumask *cpu_coregroup_mask(int cpu)
194 195 196 197
{
	return &cpu_topology[cpu].core_sibling;
}

198 199 200 201 202 203 204 205 206
/*
 * The current assumption is that we can power gate each core independently.
 * This will be superseded by DT binding once available.
 */
const struct cpumask *cpu_corepower_mask(int cpu)
{
	return &cpu_topology[cpu].thread_sibling;
}

207
static void update_siblings_masks(unsigned int cpuid)
208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232
{
	struct cputopo_arm *cpu_topo, *cpuid_topo = &cpu_topology[cpuid];
	int cpu;

	/* update core and thread sibling masks */
	for_each_possible_cpu(cpu) {
		cpu_topo = &cpu_topology[cpu];

		if (cpuid_topo->socket_id != cpu_topo->socket_id)
			continue;

		cpumask_set_cpu(cpuid, &cpu_topo->core_sibling);
		if (cpu != cpuid)
			cpumask_set_cpu(cpu, &cpuid_topo->core_sibling);

		if (cpuid_topo->core_id != cpu_topo->core_id)
			continue;

		cpumask_set_cpu(cpuid, &cpu_topo->thread_sibling);
		if (cpu != cpuid)
			cpumask_set_cpu(cpu, &cpuid_topo->thread_sibling);
	}
	smp_wmb();
}

233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257
/*
 * store_cpu_topology is called at boot when only one cpu is running
 * and with the mutex cpu_hotplug.lock locked, when several cpus have booted,
 * which prevents simultaneous write access to cpu_topology array
 */
void store_cpu_topology(unsigned int cpuid)
{
	struct cputopo_arm *cpuid_topo = &cpu_topology[cpuid];
	unsigned int mpidr;

	/* If the cpu topology has been already set, just return */
	if (cpuid_topo->core_id != -1)
		return;

	mpidr = read_cpuid_mpidr();

	/* create cpu topology mapping */
	if ((mpidr & MPIDR_SMP_BITMASK) == MPIDR_SMP_VALUE) {
		/*
		 * This is a multiprocessor system
		 * multiprocessor format & multiprocessor mode field are set
		 */

		if (mpidr & MPIDR_MT_BITMASK) {
			/* core performance interdependency */
258 259 260
			cpuid_topo->thread_id = MPIDR_AFFINITY_LEVEL(mpidr, 0);
			cpuid_topo->core_id = MPIDR_AFFINITY_LEVEL(mpidr, 1);
			cpuid_topo->socket_id = MPIDR_AFFINITY_LEVEL(mpidr, 2);
261 262 263
		} else {
			/* largely independent cores */
			cpuid_topo->thread_id = -1;
264 265
			cpuid_topo->core_id = MPIDR_AFFINITY_LEVEL(mpidr, 0);
			cpuid_topo->socket_id = MPIDR_AFFINITY_LEVEL(mpidr, 1);
266 267 268 269 270 271 272 273 274 275 276 277
		}
	} else {
		/*
		 * This is an uniprocessor system
		 * we are in multiprocessor format but uniprocessor system
		 * or in the old uniprocessor format
		 */
		cpuid_topo->thread_id = -1;
		cpuid_topo->core_id = 0;
		cpuid_topo->socket_id = -1;
	}

278
	update_siblings_masks(cpuid);
279

280
	update_cpu_capacity(cpuid);
281

R
Russell King 已提交
282
	pr_info("CPU%u: thread %d, cpu %d, socket %d, mpidr %x\n",
283 284 285 286 287
		cpuid, cpu_topology[cpuid].thread_id,
		cpu_topology[cpuid].core_id,
		cpu_topology[cpuid].socket_id, mpidr);
}

G
Guenter Roeck 已提交
288
static inline int cpu_corepower_flags(void)
289 290 291 292 293 294 295 296 297 298 299 300 301
{
	return SD_SHARE_PKG_RESOURCES  | SD_SHARE_POWERDOMAIN;
}

static struct sched_domain_topology_level arm_topology[] = {
#ifdef CONFIG_SCHED_MC
	{ cpu_corepower_mask, cpu_corepower_flags, SD_INIT_NAME(GMC) },
	{ cpu_coregroup_mask, cpu_core_flags, SD_INIT_NAME(MC) },
#endif
	{ cpu_cpu_mask, SD_INIT_NAME(DIE) },
	{ NULL, },
};

302 303 304 305
/*
 * init_cpu_topology is called at boot when only one cpu is running
 * which prevent simultaneous write access to cpu_topology array
 */
306
void __init init_cpu_topology(void)
307 308 309
{
	unsigned int cpu;

310
	/* init core mask and capacity */
311 312 313 314 315 316 317 318 319 320
	for_each_possible_cpu(cpu) {
		struct cputopo_arm *cpu_topo = &(cpu_topology[cpu]);

		cpu_topo->thread_id = -1;
		cpu_topo->core_id =  -1;
		cpu_topo->socket_id = -1;
		cpumask_clear(&cpu_topo->core_sibling);
		cpumask_clear(&cpu_topo->thread_sibling);
	}
	smp_wmb();
321 322

	parse_dt_topology();
323 324 325

	/* Set scheduler topology descriptor */
	set_sched_topology(arm_topology);
326
}