[deliverable/linux.git] / arch / arm / kernel / topology.c

/*
 * 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.
 */

#include <linux/cpu.h>
#include <linux/cpumask.h>
#include <linux/export.h>
#include <linux/init.h>
#include <linux/percpu.h>
#include <linux/node.h>
#include <linux/nodemask.h>
#include <linux/of.h>
#include <linux/sched.h>
#include <linux/slab.h>

#include <asm/cputype.h>
#include <asm/topology.h>

/*
 * cpu power scale management
 */

/*
 * cpu power table
 * This per cpu data structure describes the relative capacity of each core.
 * On a heteregenous system, cores don't have the same computation capacity
 * and we reflect that difference in the cpu_power 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_power 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_power can be updated
 * during this sequence.
 */
static DEFINE_PER_CPU(unsigned long, cpu_scale);

unsigned long arch_scale_freq_power(struct sched_domain *sd, int cpu)
{
	return per_cpu(cpu_scale, cpu);
}

static void set_power_scale(unsigned int cpu, unsigned long power)
{
	per_cpu(cpu_scale, cpu) = power;
}

#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
 *   0 < cpu_scale < 3*SCHED_POWER_SCALE/2
 * 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,
 * use the default SCHED_POWER_SCALE value for cpu_scale.
 */
static const struct cpu_efficiency table_efficiency[] = {
	{"arm,cortex-a15", 3891},
	{"arm,cortex-a7",  2048},
	{NULL, },
};

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

static unsigned long middle_capacity = 1;

/*
 * 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
 * This is later used to scale the cpu_power field such that an
 * 'average' CPU is of middle power. Also see the comments near
 * table_efficiency[] and update_cpu_power().
 */
static void __init parse_dt_topology(void)
{
	const struct cpu_efficiency *cpu_eff;
	struct device_node *cn = NULL;
	unsigned long min_capacity = (unsigned long)(-1);
	unsigned long max_capacity = 0;
	unsigned long capacity = 0;
	int alloc_size, cpu = 0;

	alloc_size = nr_cpu_ids * sizeof(*__cpu_capacity);
	__cpu_capacity = kzalloc(alloc_size, GFP_NOWAIT);

	for_each_possible_cpu(cpu) {
		const u32 *rate;
		int len;

		/* 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;
		}

		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;

		cpu_capacity(cpu) = capacity;
	}

	/* 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
	 * SCHED_POWER_SCALE, which is the default value, but with the
	 * constraint explained near table_efficiency[].
	 */
	if (4*max_capacity < (3*(max_capacity + min_capacity)))
		middle_capacity = (min_capacity + max_capacity)
				>> (SCHED_POWER_SHIFT+1);
	else
		middle_capacity = ((max_capacity / 3)
				>> (SCHED_POWER_SHIFT-1)) + 1;

}

/*
 * 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.
 */
static void update_cpu_power(unsigned int cpu)
{
	if (!cpu_capacity(cpu))
		return;

	set_power_scale(cpu, cpu_capacity(cpu) / middle_capacity);

	printk(KERN_INFO "CPU%u: update cpu_power %lu\n",
		cpu, arch_scale_freq_power(NULL, cpu));
}

#else
static inline void parse_dt_topology(void) {}
static inline void update_cpu_power(unsigned int cpuid) {}
#endif

 /*
 * cpu topology table
 */
struct cputopo_arm cpu_topology[NR_CPUS];
EXPORT_SYMBOL_GPL(cpu_topology);

const struct cpumask *cpu_coregroup_mask(int cpu)
{
	return &cpu_topology[cpu].core_sibling;
}

static void update_siblings_masks(unsigned int cpuid)
{
	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();
}

/*
 * 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 */
			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);
		} else {
			/* largely independent cores */
			cpuid_topo->thread_id = -1;
			cpuid_topo->core_id = MPIDR_AFFINITY_LEVEL(mpidr, 0);
			cpuid_topo->socket_id = MPIDR_AFFINITY_LEVEL(mpidr, 1);
		}
	} 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;
	}

	update_siblings_masks(cpuid);

	update_cpu_power(cpuid);

	printk(KERN_INFO "CPU%u: thread %d, cpu %d, socket %d, mpidr %x\n",
		cpuid, cpu_topology[cpuid].thread_id,
		cpu_topology[cpuid].core_id,
		cpu_topology[cpuid].socket_id, mpidr);
}

/*
 * init_cpu_topology is called at boot when only one cpu is running
 * which prevent simultaneous write access to cpu_topology array
 */
void __init init_cpu_topology(void)
{
	unsigned int cpu;

	/* init core mask and power*/
	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);

		set_power_scale(cpu, SCHED_POWER_SCALE);
	}
	smp_wmb();

	parse_dt_topology();
}
Commit	Line	Data
c9018aab VG	1	/*
	2	* arch/arm/kernel/topology.c
	3	*
	4	* Copyright (C) 2011 Linaro Limited.
	5	* Written by: Vincent Guittot
	6	*
	7	* based on arch/sh/kernel/topology.c
	8	*
	9	* This file is subject to the terms and conditions of the GNU General Public
	10	* License. See the file "COPYING" in the main directory of this archive
	11	* for more details.
	12	*/
	13
	14	#include <linux/cpu.h>
	15	#include <linux/cpumask.h>
92bdd3f5	16	#include <linux/export.h>
c9018aab VG	17	#include <linux/init.h>
	18	#include <linux/percpu.h>
	19	#include <linux/node.h>
	20	#include <linux/nodemask.h>
339ca09d	21	#include <linux/of.h>
c9018aab	22	#include <linux/sched.h>
339ca09d	23	#include <linux/slab.h>
c9018aab VG	24
	25	#include <asm/cputype.h>
	26	#include <asm/topology.h>
	27
130d9aab VG	28	/*
	29	* cpu power scale management
	30	*/
	31
	32	/*
	33	* cpu power table
	34	* This per cpu data structure describes the relative capacity of each core.
	35	* On a heteregenous system, cores don't have the same computation capacity
	36	* and we reflect that difference in the cpu_power field so the scheduler can
	37	* take this difference into account during load balance. A per cpu structure
	38	* is preferred because each CPU updates its own cpu_power field during the
	39	* load balance except for idle cores. One idle core is selected to run the
	40	* rebalance_domains for all idle cores and the cpu_power can be updated
	41	* during this sequence.
	42	*/
	43	static DEFINE_PER_CPU(unsigned long, cpu_scale);
	44
	45	unsigned long arch_scale_freq_power(struct sched_domain *sd, int cpu)
	46	{
	47	return per_cpu(cpu_scale, cpu);
	48	}
	49
	50	static void set_power_scale(unsigned int cpu, unsigned long power)
	51	{
	52	per_cpu(cpu_scale, cpu) = power;
	53	}
	54
339ca09d VG	55	#ifdef CONFIG_OF
	56	struct cpu_efficiency {
	57	const char *compatible;
	58	unsigned long efficiency;
	59	};
	60
	61	/*
	62	* Table of relative efficiency of each processors
	63	* The efficiency value must fit in 20bit and the final
	64	* cpu_scale value must be in the range
	65	* 0 < cpu_scale < 3*SCHED_POWER_SCALE/2
	66	* in order to return at most 1 when DIV_ROUND_CLOSEST
	67	* is used to compute the capacity of a CPU.
	68	* Processors that are not defined in the table,
	69	* use the default SCHED_POWER_SCALE value for cpu_scale.
	70	*/
145bc292	71	static const struct cpu_efficiency table_efficiency[] = {
339ca09d VG	72	{"arm,cortex-a15", 3891},
	73	{"arm,cortex-a7", 2048},
	74	{NULL, },
	75	};
	76
145bc292	77	static unsigned long *__cpu_capacity;
816a8de0	78	#define cpu_capacity(cpu) __cpu_capacity[cpu]
339ca09d	79
145bc292	80	static unsigned long middle_capacity = 1;
339ca09d VG	81
	82	/*
	83	* Iterate all CPUs' descriptor in DT and compute the efficiency
	84	* (as per table_efficiency). Also calculate a middle efficiency
	85	* as close as possible to (max{eff_i} - min{eff_i}) / 2
	86	* This is later used to scale the cpu_power field such that an
	87	* 'average' CPU is of middle power. Also see the comments near
	88	* table_efficiency[] and update_cpu_power().
	89	*/
	90	static void __init parse_dt_topology(void)
	91	{
145bc292	92	const struct cpu_efficiency *cpu_eff;
339ca09d VG	93	struct device_node *cn = NULL;
	94	unsigned long min_capacity = (unsigned long)(-1);
	95	unsigned long max_capacity = 0;
	96	unsigned long capacity = 0;
	97	int alloc_size, cpu = 0;
	98
816a8de0 SK	99	alloc_size = nr_cpu_ids * sizeof(*__cpu_capacity);
816a8de0 SK	100	__cpu_capacity = kzalloc(alloc_size, GFP_NOWAIT);
339ca09d	101
816a8de0 SK	102	for_each_possible_cpu(cpu) {
816a8de0 SK	103	const u32 *rate;
339ca09d VG	104	int len;
339ca09d VG	105
816a8de0 SK	106	/* too early to use cpu->of_node */
	107	cn = of_get_cpu_node(cpu, NULL);
	108	if (!cn) {
	109	pr_err("missing device node for CPU %d\n", cpu);
	110	continue;
	111	}
339ca09d VG	112
	113	for (cpu_eff = table_efficiency; cpu_eff->compatible; cpu_eff++)
	114	if (of_device_is_compatible(cn, cpu_eff->compatible))
	115	break;
	116
	117	if (cpu_eff->compatible == NULL)
	118	continue;
	119
	120	rate = of_get_property(cn, "clock-frequency", &len);
	121	if (!rate \|\| len != 4) {
	122	pr_err("%s missing clock-frequency property\n",
	123	cn->full_name);
	124	continue;
	125	}
	126
339ca09d VG	127	capacity = ((be32_to_cpup(rate)) >> 20) * cpu_eff->efficiency;
	128
	129	/* Save min capacity of the system */
	130	if (capacity < min_capacity)
	131	min_capacity = capacity;
	132
	133	/* Save max capacity of the system */
	134	if (capacity > max_capacity)
	135	max_capacity = capacity;
	136
816a8de0	137	cpu_capacity(cpu) = capacity;
339ca09d VG	138	}
339ca09d VG	139
339ca09d VG	140	/* If min and max capacities are equals, we bypass the update of the
	141	* cpu_scale because all CPUs have the same capacity. Otherwise, we
	142	* compute a middle_capacity factor that will ensure that the capacity
	143	* of an 'average' CPU of the system will be as close as possible to
	144	* SCHED_POWER_SCALE, which is the default value, but with the
	145	* constraint explained near table_efficiency[].
	146	*/
816a8de0	147	if (4max_capacity < (3(max_capacity + min_capacity)))
339ca09d VG	148	middle_capacity = (min_capacity + max_capacity)
	149	>> (SCHED_POWER_SHIFT+1);
	150	else
	151	middle_capacity = ((max_capacity / 3)
	152	>> (SCHED_POWER_SHIFT-1)) + 1;
	153
	154	}
	155
	156	/*
	157	* Look for a customed capacity of a CPU in the cpu_capacity table during the
	158	* boot. The update of all CPUs is in O(n^2) for heteregeneous system but the
	159	* function returns directly for SMP system.
	160	*/
145bc292	161	static void update_cpu_power(unsigned int cpu)
339ca09d	162	{
816a8de0	163	if (!cpu_capacity(cpu))
339ca09d VG	164	return;
339ca09d VG	165
816a8de0	166	set_power_scale(cpu, cpu_capacity(cpu) / middle_capacity);
339ca09d VG	167
	168	printk(KERN_INFO "CPU%u: update cpu_power %lu\n",
	169	cpu, arch_scale_freq_power(NULL, cpu));
	170	}
	171
	172	#else
	173	static inline void parse_dt_topology(void) {}
816a8de0	174	static inline void update_cpu_power(unsigned int cpuid) {}
339ca09d VG	175	#endif
339ca09d VG	176
dca463da	177	/*
130d9aab VG	178	* cpu topology table
130d9aab VG	179	*/
c9018aab	180	struct cputopo_arm cpu_topology[NR_CPUS];
92bdd3f5	181	EXPORT_SYMBOL_GPL(cpu_topology);
c9018aab	182
4cbd6b16	183	const struct cpumask *cpu_coregroup_mask(int cpu)
c9018aab VG	184	{
	185	return &cpu_topology[cpu].core_sibling;
	186	}
	187
145bc292	188	static void update_siblings_masks(unsigned int cpuid)
cb75dacb VG	189	{
	190	struct cputopo_arm cpu_topo, cpuid_topo = &cpu_topology[cpuid];
	191	int cpu;
	192
	193	/* update core and thread sibling masks */
	194	for_each_possible_cpu(cpu) {
	195	cpu_topo = &cpu_topology[cpu];
	196
	197	if (cpuid_topo->socket_id != cpu_topo->socket_id)
	198	continue;
	199
	200	cpumask_set_cpu(cpuid, &cpu_topo->core_sibling);
	201	if (cpu != cpuid)
	202	cpumask_set_cpu(cpu, &cpuid_topo->core_sibling);
	203
	204	if (cpuid_topo->core_id != cpu_topo->core_id)
	205	continue;
	206
	207	cpumask_set_cpu(cpuid, &cpu_topo->thread_sibling);
	208	if (cpu != cpuid)
	209	cpumask_set_cpu(cpu, &cpuid_topo->thread_sibling);
	210	}
	211	smp_wmb();
	212	}
	213
c9018aab VG	214	/*
	215	* store_cpu_topology is called at boot when only one cpu is running
	216	* and with the mutex cpu_hotplug.lock locked, when several cpus have booted,
	217	* which prevents simultaneous write access to cpu_topology array
	218	*/
	219	void store_cpu_topology(unsigned int cpuid)
	220	{
	221	struct cputopo_arm *cpuid_topo = &cpu_topology[cpuid];
	222	unsigned int mpidr;
c9018aab VG	223
	224	/* If the cpu topology has been already set, just return */
	225	if (cpuid_topo->core_id != -1)
	226	return;
	227
	228	mpidr = read_cpuid_mpidr();
	229
	230	/* create cpu topology mapping */
	231	if ((mpidr & MPIDR_SMP_BITMASK) == MPIDR_SMP_VALUE) {
	232	/*
	233	* This is a multiprocessor system
	234	* multiprocessor format & multiprocessor mode field are set
	235	*/
	236
	237	if (mpidr & MPIDR_MT_BITMASK) {
	238	/* core performance interdependency */
71db5bfe LP	239	cpuid_topo->thread_id = MPIDR_AFFINITY_LEVEL(mpidr, 0);
	240	cpuid_topo->core_id = MPIDR_AFFINITY_LEVEL(mpidr, 1);
	241	cpuid_topo->socket_id = MPIDR_AFFINITY_LEVEL(mpidr, 2);
c9018aab VG	242	} else {
	243	/* largely independent cores */
	244	cpuid_topo->thread_id = -1;
71db5bfe LP	245	cpuid_topo->core_id = MPIDR_AFFINITY_LEVEL(mpidr, 0);
71db5bfe LP	246	cpuid_topo->socket_id = MPIDR_AFFINITY_LEVEL(mpidr, 1);
c9018aab VG	247	}
	248	} else {
	249	/*
	250	* This is an uniprocessor system
	251	* we are in multiprocessor format but uniprocessor system
	252	* or in the old uniprocessor format
	253	*/
	254	cpuid_topo->thread_id = -1;
	255	cpuid_topo->core_id = 0;
	256	cpuid_topo->socket_id = -1;
	257	}
	258
cb75dacb	259	update_siblings_masks(cpuid);
c9018aab	260
816a8de0	261	update_cpu_power(cpuid);
339ca09d	262
c9018aab VG	263	printk(KERN_INFO "CPU%u: thread %d, cpu %d, socket %d, mpidr %x\n",
	264	cpuid, cpu_topology[cpuid].thread_id,
	265	cpu_topology[cpuid].core_id,
	266	cpu_topology[cpuid].socket_id, mpidr);
	267	}
	268
	269	/*
	270	* init_cpu_topology is called at boot when only one cpu is running
	271	* which prevent simultaneous write access to cpu_topology array
	272	*/
f7e416eb	273	void __init init_cpu_topology(void)
c9018aab VG	274	{
	275	unsigned int cpu;
	276
130d9aab	277	/* init core mask and power*/
c9018aab VG	278	for_each_possible_cpu(cpu) {
	279	struct cputopo_arm *cpu_topo = &(cpu_topology[cpu]);
	280
	281	cpu_topo->thread_id = -1;
	282	cpu_topo->core_id = -1;
	283	cpu_topo->socket_id = -1;
	284	cpumask_clear(&cpu_topo->core_sibling);
	285	cpumask_clear(&cpu_topo->thread_sibling);
130d9aab VG	286
130d9aab VG	287	set_power_scale(cpu, SCHED_POWER_SCALE);
c9018aab VG	288	}
c9018aab VG	289	smp_wmb();
339ca09d VG	290
339ca09d VG	291	parse_dt_topology();
c9018aab	292	}