[mirror_ubuntu-bionic-kernel.git] / arch / x86_64 / mm / srat.c

/*
 * ACPI 3.0 based NUMA setup
 * Copyright 2004 Andi Kleen, SuSE Labs.
 *
 * Reads the ACPI SRAT table to figure out what memory belongs to which CPUs.
 *
 * Called from acpi_numa_init while reading the SRAT and SLIT tables.
 * Assumes all memory regions belonging to a single proximity domain
 * are in one chunk. Holes between them will be included in the node.
 */

#include <linux/kernel.h>
#include <linux/acpi.h>
#include <linux/mmzone.h>
#include <linux/bitmap.h>
#include <linux/module.h>
#include <linux/topology.h>
#include <asm/proto.h>
#include <asm/numa.h>

static struct acpi_table_slit *acpi_slit;

static nodemask_t nodes_parsed __initdata;
static nodemask_t nodes_found __initdata;
static struct node nodes[MAX_NUMNODES] __initdata;
static __u8  pxm2node[256] = { [0 ... 255] = 0xff };

static int node_to_pxm(int n);

int pxm_to_node(int pxm)
{
	if ((unsigned)pxm >= 256)
		return 0;
	return pxm2node[pxm];
}

static __init int setup_node(int pxm)
{
	unsigned node = pxm2node[pxm];
	if (node == 0xff) {
		if (nodes_weight(nodes_found) >= MAX_NUMNODES)
			return -1;
		node = first_unset_node(nodes_found); 
		node_set(node, nodes_found);
		pxm2node[pxm] = node;
	}
	return pxm2node[pxm];
}

static __init int conflicting_nodes(unsigned long start, unsigned long end)
{
	int i;
	for_each_online_node(i) {
		struct node *nd = &nodes[i];
		if (nd->start == nd->end)
			continue;
		if (nd->end > start && nd->start < end)
			return i;
		if (nd->end == end && nd->start == start)
			return i;
	}
	return -1;
}

static __init void cutoff_node(int i, unsigned long start, unsigned long end)
{
	struct node *nd = &nodes[i];
	if (nd->start < start) {
		nd->start = start;
		if (nd->end < nd->start)
			nd->start = nd->end;
	}
	if (nd->end > end) {
		if (!(end & 0xfff))
			end--;
		nd->end = end;
		if (nd->start > nd->end)
			nd->start = nd->end;
	}
}

static __init void bad_srat(void)
{
	printk(KERN_ERR "SRAT: SRAT not used.\n");
	acpi_numa = -1;
}

static __init inline int srat_disabled(void)
{
	return numa_off || acpi_numa < 0;
}

/* Callback for SLIT parsing */
void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
{
	acpi_slit = slit;
}

/* Callback for Proximity Domain -> LAPIC mapping */
void __init
acpi_numa_processor_affinity_init(struct acpi_table_processor_affinity *pa)
{
	int pxm, node;
	if (srat_disabled() || pa->flags.enabled == 0)
		return;
	pxm = pa->proximity_domain;
	node = setup_node(pxm);
	if (node < 0) {
		printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
		bad_srat();
		return;
	}
	apicid_to_node[pa->apic_id] = node;
	acpi_numa = 1;
	printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
	       pxm, pa->apic_id, node);
}

/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
void __init
acpi_numa_memory_affinity_init(struct acpi_table_memory_affinity *ma)
{
	struct node *nd;
	unsigned long start, end;
	int node, pxm;
	int i;

	if (srat_disabled() || ma->flags.enabled == 0)
		return;
	pxm = ma->proximity_domain;
	node = setup_node(pxm);
	if (node < 0) {
		printk(KERN_ERR "SRAT: Too many proximity domains.\n");
		bad_srat();
		return;
	}
	start = ma->base_addr_lo | ((u64)ma->base_addr_hi << 32);
	end = start + (ma->length_lo | ((u64)ma->length_hi << 32));
	/* It is fine to add this area to the nodes data it will be used later*/
	if (ma->flags.hot_pluggable == 1)
		printk(KERN_INFO "SRAT: hot plug zone found %lx - %lx \n",
				start, end);
	i = conflicting_nodes(start, end);
	if (i == node) {
		printk(KERN_WARNING
		"SRAT: Warning: PXM %d (%lx-%lx) overlaps with itself (%Lx-%Lx)\n",
			pxm, start, end, nodes[i].start, nodes[i].end);
	} else if (i >= 0) {
		printk(KERN_ERR
		       "SRAT: PXM %d (%lx-%lx) overlaps with PXM %d (%Lx-%Lx)\n",
		       pxm, start, end, node_to_pxm(i),
			nodes[i].start, nodes[i].end);
		bad_srat();
		return;
	}
	nd = &nodes[node];
	if (!node_test_and_set(node, nodes_parsed)) {
		nd->start = start;
		nd->end = end;
	} else {
		if (start < nd->start)
			nd->start = start;
		if (nd->end < end)
			nd->end = end;
	}
	if (!(nd->end & 0xfff))
		nd->end--;
	printk(KERN_INFO "SRAT: Node %u PXM %u %Lx-%Lx\n", node, pxm,
	       nd->start, nd->end);
}

void __init acpi_numa_arch_fixup(void) {}

/* Use the information discovered above to actually set up the nodes. */
int __init acpi_scan_nodes(unsigned long start, unsigned long end)
{
	int i;
	if (acpi_numa <= 0)
		return -1;
	memnode_shift = compute_hash_shift(nodes, nodes_weight(nodes_parsed));
	if (memnode_shift < 0) {
		printk(KERN_ERR
		     "SRAT: No NUMA node hash function found. Contact maintainer\n");
		bad_srat();
		return -1;
	}
	for (i = 0; i < MAX_NUMNODES; i++) {
		if (!node_isset(i, nodes_parsed))
			continue;
		cutoff_node(i, start, end);
		if (nodes[i].start == nodes[i].end) { 
			node_clear(i, nodes_parsed);
			continue;
		}
		setup_node_bootmem(i, nodes[i].start, nodes[i].end);
	}
	for (i = 0; i < NR_CPUS; i++) { 
		if (cpu_to_node[i] == NUMA_NO_NODE)
			continue;
		if (!node_isset(cpu_to_node[i], nodes_parsed))
			cpu_to_node[i] = NUMA_NO_NODE; 
	}
	numa_init_array();
	return 0;
}

static int node_to_pxm(int n)
{
       int i;
       if (pxm2node[n] == n)
               return n;
       for (i = 0; i < 256; i++)
               if (pxm2node[i] == n)
                       return i;
       return 0;
}

int __node_distance(int a, int b)
{
	int index;

	if (!acpi_slit)
		return a == b ? 10 : 20;
	index = acpi_slit->localities * node_to_pxm(a);
	return acpi_slit->entry[index + node_to_pxm(b)];
}

EXPORT_SYMBOL(__node_distance);
Commit	Line	Data
1da177e4 LT	1	/*
	2	* ACPI 3.0 based NUMA setup
	3	* Copyright 2004 Andi Kleen, SuSE Labs.
	4	*
	5	* Reads the ACPI SRAT table to figure out what memory belongs to which CPUs.
	6	*
	7	* Called from acpi_numa_init while reading the SRAT and SLIT tables.
	8	* Assumes all memory regions belonging to a single proximity domain
	9	* are in one chunk. Holes between them will be included in the node.
	10	*/
	11
	12	#include <linux/kernel.h>
	13	#include <linux/acpi.h>
	14	#include <linux/mmzone.h>
	15	#include <linux/bitmap.h>
	16	#include <linux/module.h>
	17	#include <linux/topology.h>
	18	#include <asm/proto.h>
	19	#include <asm/numa.h>
	20
	21	static struct acpi_table_slit *acpi_slit;
	22
	23	static nodemask_t nodes_parsed __initdata;
	24	static nodemask_t nodes_found __initdata;
	25	static struct node nodes[MAX_NUMNODES] __initdata;
	26	static __u8 pxm2node[256] = { [0 ... 255] = 0xff };
	27
05d1fa4b AK	28	static int node_to_pxm(int n);
05d1fa4b AK	29
69e1a33f AK	30	int pxm_to_node(int pxm)
	31	{
	32	if ((unsigned)pxm >= 256)
	33	return 0;
	34	return pxm2node[pxm];
	35	}
	36
1da177e4 LT	37	static __init int setup_node(int pxm)
	38	{
	39	unsigned node = pxm2node[pxm];
	40	if (node == 0xff) {
	41	if (nodes_weight(nodes_found) >= MAX_NUMNODES)
	42	return -1;
	43	node = first_unset_node(nodes_found);
	44	node_set(node, nodes_found);
	45	pxm2node[pxm] = node;
	46	}
	47	return pxm2node[pxm];
	48	}
	49
	50	static __init int conflicting_nodes(unsigned long start, unsigned long end)
	51	{
	52	int i;
	53	for_each_online_node(i) {
	54	struct node *nd = &nodes[i];
	55	if (nd->start == nd->end)
	56	continue;
	57	if (nd->end > start && nd->start < end)
05d1fa4b	58	return i;
1da177e4	59	if (nd->end == end && nd->start == start)
05d1fa4b	60	return i;
1da177e4 LT	61	}
	62	return -1;
	63	}
	64
	65	static __init void cutoff_node(int i, unsigned long start, unsigned long end)
	66	{
	67	struct node *nd = &nodes[i];
	68	if (nd->start < start) {
	69	nd->start = start;
	70	if (nd->end < nd->start)
	71	nd->start = nd->end;
	72	}
	73	if (nd->end > end) {
	74	if (!(end & 0xfff))
	75	end--;
	76	nd->end = end;
	77	if (nd->start > nd->end)
	78	nd->start = nd->end;
	79	}
	80	}
	81
	82	static __init void bad_srat(void)
	83	{
	84	printk(KERN_ERR "SRAT: SRAT not used.\n");
	85	acpi_numa = -1;
	86	}
	87
	88	static __init inline int srat_disabled(void)
	89	{
	90	return numa_off \|\| acpi_numa < 0;
	91	}
	92
	93	/* Callback for SLIT parsing */
	94	void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
	95	{
	96	acpi_slit = slit;
	97	}
	98
	99	/* Callback for Proximity Domain -> LAPIC mapping */
	100	void __init
	101	acpi_numa_processor_affinity_init(struct acpi_table_processor_affinity *pa)
	102	{
	103	int pxm, node;
	104	if (srat_disabled() \|\| pa->flags.enabled == 0)
	105	return;
	106	pxm = pa->proximity_domain;
	107	node = setup_node(pxm);
	108	if (node < 0) {
	109	printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
	110	bad_srat();
	111	return;
	112	}
0b07e984	113	apicid_to_node[pa->apic_id] = node;
1da177e4	114	acpi_numa = 1;
0b07e984 AK	115	printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
0b07e984 AK	116	pxm, pa->apic_id, node);
1da177e4 LT	117	}
	118
	119	/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
	120	void __init
	121	acpi_numa_memory_affinity_init(struct acpi_table_memory_affinity *ma)
	122	{
	123	struct node *nd;
	124	unsigned long start, end;
	125	int node, pxm;
	126	int i;
	127
	128	if (srat_disabled() \|\| ma->flags.enabled == 0)
	129	return;
1da177e4 LT	130	pxm = ma->proximity_domain;
	131	node = setup_node(pxm);
	132	if (node < 0) {
	133	printk(KERN_ERR "SRAT: Too many proximity domains.\n");
	134	bad_srat();
	135	return;
	136	}
	137	start = ma->base_addr_lo \| ((u64)ma->base_addr_hi << 32);
	138	end = start + (ma->length_lo \| ((u64)ma->length_hi << 32));
69cb62eb AK	139	/* It is fine to add this area to the nodes data it will be used later*/
	140	if (ma->flags.hot_pluggable == 1)
	141	printk(KERN_INFO "SRAT: hot plug zone found %lx - %lx \n",
	142	start, end);
1da177e4	143	i = conflicting_nodes(start, end);
05d1fa4b AK	144	if (i == node) {
	145	printk(KERN_WARNING
	146	"SRAT: Warning: PXM %d (%lx-%lx) overlaps with itself (%Lx-%Lx)\n",
	147	pxm, start, end, nodes[i].start, nodes[i].end);
	148	} else if (i >= 0) {
1da177e4	149	printk(KERN_ERR
05d1fa4b AK	150	"SRAT: PXM %d (%lx-%lx) overlaps with PXM %d (%Lx-%Lx)\n",
	151	pxm, start, end, node_to_pxm(i),
	152	nodes[i].start, nodes[i].end);
1da177e4 LT	153	bad_srat();
	154	return;
	155	}
	156	nd = &nodes[node];
	157	if (!node_test_and_set(node, nodes_parsed)) {
	158	nd->start = start;
	159	nd->end = end;
	160	} else {
	161	if (start < nd->start)
	162	nd->start = start;
	163	if (nd->end < end)
	164	nd->end = end;
	165	}
	166	if (!(nd->end & 0xfff))
	167	nd->end--;
	168	printk(KERN_INFO "SRAT: Node %u PXM %u %Lx-%Lx\n", node, pxm,
	169	nd->start, nd->end);
	170	}
	171
	172	void __init acpi_numa_arch_fixup(void) {}
	173
	174	/* Use the information discovered above to actually set up the nodes. */
	175	int __init acpi_scan_nodes(unsigned long start, unsigned long end)
	176	{
	177	int i;
	178	if (acpi_numa <= 0)
	179	return -1;
	180	memnode_shift = compute_hash_shift(nodes, nodes_weight(nodes_parsed));
	181	if (memnode_shift < 0) {
	182	printk(KERN_ERR
	183	"SRAT: No NUMA node hash function found. Contact maintainer\n");
	184	bad_srat();
	185	return -1;
	186	}
	187	for (i = 0; i < MAX_NUMNODES; i++) {
	188	if (!node_isset(i, nodes_parsed))
	189	continue;
	190	cutoff_node(i, start, end);
	191	if (nodes[i].start == nodes[i].end) {
	192	node_clear(i, nodes_parsed);
	193	continue;
	194	}
	195	setup_node_bootmem(i, nodes[i].start, nodes[i].end);
	196	}
	197	for (i = 0; i < NR_CPUS; i++) {
	198	if (cpu_to_node[i] == NUMA_NO_NODE)
	199	continue;
	200	if (!node_isset(cpu_to_node[i], nodes_parsed))
	201	cpu_to_node[i] = NUMA_NO_NODE;
	202	}
	203	numa_init_array();
	204	return 0;
	205	}
	206
05d1fa4b	207	static int node_to_pxm(int n)
1da177e4 LT	208	{
	209	int i;
	210	if (pxm2node[n] == n)
	211	return n;
	212	for (i = 0; i < 256; i++)
	213	if (pxm2node[i] == n)
	214	return i;
	215	return 0;
	216	}
	217
	218	int __node_distance(int a, int b)
	219	{
	220	int index;
	221
	222	if (!acpi_slit)
	223	return a == b ? 10 : 20;
	224	index = acpi_slit->localities * node_to_pxm(a);
	225	return acpi_slit->entry[index + node_to_pxm(b)];
	226	}
	227
	228	EXPORT_SYMBOL(__node_distance);