numa.c 8.7 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
/*
 *  acpi_numa.c - ACPI NUMA support
 *
 *  Copyright (C) 2002 Takayoshi Kochi <t-kochi@bq.jp.nec.com>
 *
 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 */
#include <linux/module.h>
#include <linux/init.h>
#include <linux/kernel.h>
#include <linux/types.h>
#include <linux/errno.h>
#include <linux/acpi.h>
D
David Rientjes 已提交
31
#include <linux/numa.h>
L
Linus Torvalds 已提交
32 33
#include <acpi/acpi_bus.h>

34 35
#define PREFIX "ACPI: "

L
Linus Torvalds 已提交
36 37
#define ACPI_NUMA	0x80000000
#define _COMPONENT	ACPI_NUMA
38
ACPI_MODULE_NAME("numa");
L
Linus Torvalds 已提交
39

40 41 42
static nodemask_t nodes_found_map = NODE_MASK_NONE;

/* maps to convert between proximity domain and logical node ID */
J
Jan Beulich 已提交
43
static int pxm_to_node_map[MAX_PXM_DOMAINS]
D
David Rientjes 已提交
44
			= { [0 ... MAX_PXM_DOMAINS - 1] = NUMA_NO_NODE };
J
Jan Beulich 已提交
45
static int node_to_pxm_map[MAX_NUMNODES]
D
David Rientjes 已提交
46
			= { [0 ... MAX_NUMNODES - 1] = PXM_INVAL };
47

K
Kurt Garloff 已提交
48 49
unsigned char acpi_srat_revision __initdata;

50
int pxm_to_node(int pxm)
51 52
{
	if (pxm < 0)
D
David Rientjes 已提交
53
		return NUMA_NO_NODE;
54 55 56
	return pxm_to_node_map[pxm];
}

57
int node_to_pxm(int node)
58 59 60 61 62 63
{
	if (node < 0)
		return PXM_INVAL;
	return node_to_pxm_map[node];
}

64 65
void __acpi_map_pxm_to_node(int pxm, int node)
{
66 67 68 69
	if (pxm_to_node_map[pxm] == NUMA_NO_NODE || node < pxm_to_node_map[pxm])
		pxm_to_node_map[pxm] = node;
	if (node_to_pxm_map[node] == PXM_INVAL || pxm < node_to_pxm_map[node])
		node_to_pxm_map[node] = pxm;
70 71
}

72
int acpi_map_pxm_to_node(int pxm)
73 74 75
{
	int node = pxm_to_node_map[pxm];

D
David Rientjes 已提交
76
	if (node < 0) {
77
		if (nodes_weight(nodes_found_map) >= MAX_NUMNODES)
D
David Rientjes 已提交
78
			return NUMA_NO_NODE;
79
		node = first_unset_node(nodes_found_map);
80
		__acpi_map_pxm_to_node(pxm, node);
81 82 83 84 85 86
		node_set(node, nodes_found_map);
	}

	return node;
}

87 88
static void __init
acpi_table_print_srat_entry(struct acpi_subtable_header *header)
L
Linus Torvalds 已提交
89 90
{

L
Len Brown 已提交
91
	ACPI_FUNCTION_NAME("acpi_table_print_srat_entry");
L
Linus Torvalds 已提交
92 93 94 95 96 97

	if (!header)
		return;

	switch (header->type) {

98
	case ACPI_SRAT_TYPE_CPU_AFFINITY:
L
Linus Torvalds 已提交
99
#ifdef ACPI_DEBUG_OUTPUT
L
Len Brown 已提交
100
		{
101 102
			struct acpi_srat_cpu_affinity *p =
			    (struct acpi_srat_cpu_affinity *)header;
L
Len Brown 已提交
103 104
			ACPI_DEBUG_PRINT((ACPI_DB_INFO,
					  "SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n",
105 106 107 108
					  p->apic_id, p->local_sapic_eid,
					  p->proximity_domain_lo,
					  (p->flags & ACPI_SRAT_CPU_ENABLED)?
					  "enabled" : "disabled"));
L
Len Brown 已提交
109 110
		}
#endif				/* ACPI_DEBUG_OUTPUT */
L
Linus Torvalds 已提交
111 112
		break;

113
	case ACPI_SRAT_TYPE_MEMORY_AFFINITY:
L
Linus Torvalds 已提交
114
#ifdef ACPI_DEBUG_OUTPUT
L
Len Brown 已提交
115
		{
116 117
			struct acpi_srat_mem_affinity *p =
			    (struct acpi_srat_mem_affinity *)header;
L
Len Brown 已提交
118
			ACPI_DEBUG_PRINT((ACPI_DB_INFO,
119
					  "SRAT Memory (0x%lx length 0x%lx) in proximity domain %d %s%s%s\n",
120 121
					  (unsigned long)p->base_address,
					  (unsigned long)p->length,
122
					  p->proximity_domain,
123 124 125
					  (p->flags & ACPI_SRAT_MEM_ENABLED)?
					  "enabled" : "disabled",
					  (p->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)?
126 127 128
					  " hot-pluggable" : "",
					  (p->flags & ACPI_SRAT_MEM_NON_VOLATILE)?
					  " non-volatile" : ""));
L
Len Brown 已提交
129 130
		}
#endif				/* ACPI_DEBUG_OUTPUT */
L
Linus Torvalds 已提交
131 132
		break;

133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
	case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY:
#ifdef ACPI_DEBUG_OUTPUT
		{
			struct acpi_srat_x2apic_cpu_affinity *p =
			    (struct acpi_srat_x2apic_cpu_affinity *)header;
			ACPI_DEBUG_PRINT((ACPI_DB_INFO,
					  "SRAT Processor (x2apicid[0x%08x]) in"
					  " proximity domain %d %s\n",
					  p->apic_id,
					  p->proximity_domain,
					  (p->flags & ACPI_SRAT_CPU_ENABLED) ?
					  "enabled" : "disabled"));
		}
#endif				/* ACPI_DEBUG_OUTPUT */
		break;
L
Linus Torvalds 已提交
148
	default:
L
Len Brown 已提交
149 150 151
		printk(KERN_WARNING PREFIX
		       "Found unsupported SRAT entry (type = 0x%x)\n",
		       header->type);
L
Linus Torvalds 已提交
152 153 154 155
		break;
	}
}

156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178
/*
 * A lot of BIOS fill in 10 (= no distance) everywhere. This messes
 * up the NUMA heuristics which wants the local node to have a smaller
 * distance than the others.
 * Do some quick checks here and only use the SLIT if it passes.
 */
static __init int slit_valid(struct acpi_table_slit *slit)
{
	int i, j;
	int d = slit->locality_count;
	for (i = 0; i < d; i++) {
		for (j = 0; j < d; j++)  {
			u8 val = slit->entry[d*i + j];
			if (i == j) {
				if (val != LOCAL_DISTANCE)
					return 0;
			} else if (val <= LOCAL_DISTANCE)
				return 0;
		}
	}
	return 1;
}

179
static int __init acpi_parse_slit(struct acpi_table_header *table)
L
Linus Torvalds 已提交
180
{
L
Len Brown 已提交
181
	struct acpi_table_slit *slit;
L
Linus Torvalds 已提交
182

183
	if (!table)
L
Linus Torvalds 已提交
184 185
		return -EINVAL;

186
	slit = (struct acpi_table_slit *)table;
L
Linus Torvalds 已提交
187

188 189 190 191
	if (!slit_valid(slit)) {
		printk(KERN_INFO "ACPI: SLIT table looks invalid. Not used.\n");
		return -EINVAL;
	}
L
Linus Torvalds 已提交
192 193 194 195 196
	acpi_numa_slit_init(slit);

	return 0;
}

197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223
void __init __attribute__ ((weak))
acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
{
	printk(KERN_WARNING PREFIX
	       "Found unsupported x2apic [0x%08x] SRAT entry\n", pa->apic_id);
	return;
}


static int __init
acpi_parse_x2apic_affinity(struct acpi_subtable_header *header,
			   const unsigned long end)
{
	struct acpi_srat_x2apic_cpu_affinity *processor_affinity;

	processor_affinity = (struct acpi_srat_x2apic_cpu_affinity *)header;
	if (!processor_affinity)
		return -EINVAL;

	acpi_table_print_srat_entry(header);

	/* let architecture-dependent part to do it */
	acpi_numa_x2apic_affinity_init(processor_affinity);

	return 0;
}

L
Linus Torvalds 已提交
224
static int __init
225
acpi_parse_processor_affinity(struct acpi_subtable_header *header,
L
Len Brown 已提交
226
			      const unsigned long end)
L
Linus Torvalds 已提交
227
{
228
	struct acpi_srat_cpu_affinity *processor_affinity;
L
Linus Torvalds 已提交
229

230
	processor_affinity = (struct acpi_srat_cpu_affinity *)header;
L
Linus Torvalds 已提交
231 232 233 234 235 236 237 238 239 240 241
	if (!processor_affinity)
		return -EINVAL;

	acpi_table_print_srat_entry(header);

	/* let architecture-dependent part to do it */
	acpi_numa_processor_affinity_init(processor_affinity);

	return 0;
}

242 243
static int __initdata parsed_numa_memblks;

L
Linus Torvalds 已提交
244
static int __init
245
acpi_parse_memory_affinity(struct acpi_subtable_header * header,
L
Len Brown 已提交
246
			   const unsigned long end)
L
Linus Torvalds 已提交
247
{
248
	struct acpi_srat_mem_affinity *memory_affinity;
L
Linus Torvalds 已提交
249

250
	memory_affinity = (struct acpi_srat_mem_affinity *)header;
L
Linus Torvalds 已提交
251 252 253 254 255 256
	if (!memory_affinity)
		return -EINVAL;

	acpi_table_print_srat_entry(header);

	/* let architecture-dependent part to do it */
257 258
	if (!acpi_numa_memory_affinity_init(memory_affinity))
		parsed_numa_memblks++;
L
Linus Torvalds 已提交
259 260 261
	return 0;
}

262
static int __init acpi_parse_srat(struct acpi_table_header *table)
L
Linus Torvalds 已提交
263
{
K
Kurt Garloff 已提交
264
	struct acpi_table_srat *srat;
265
	if (!table)
L
Linus Torvalds 已提交
266 267
		return -EINVAL;

K
Kurt Garloff 已提交
268 269 270
	srat = (struct acpi_table_srat *)table;
	acpi_srat_revision = srat->header.revision;

271
	/* Real work done in acpi_table_parse_srat below. */
L
Linus Torvalds 已提交
272 273 274 275

	return 0;
}

276
static int __init
277
acpi_table_parse_srat(enum acpi_srat_type id,
278
		      acpi_tbl_entry_handler handler, unsigned int max_entries)
L
Linus Torvalds 已提交
279
{
280
	return acpi_table_parse_entries(ACPI_SIG_SRAT,
L
Len Brown 已提交
281 282
					    sizeof(struct acpi_table_srat), id,
					    handler, max_entries);
L
Linus Torvalds 已提交
283 284
}

285
static int srat_mem_cnt;
286

287 288
void __init early_parse_srat(void)
{
289 290 291 292 293
	/*
	 * Should not limit number with cpu num that is from NR_CPUS or nr_cpus=
	 * SRAT cpu entries could have different order with that in MADT.
	 * So go over all cpu entries in SRAT to get apicid to node mapping.
	 */
294

L
Linus Torvalds 已提交
295
	/* SRAT: Static Resource Affinity Table */
296
	if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) {
297
		acpi_table_parse_srat(ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY,
298
				      acpi_parse_x2apic_affinity, 0);
299
		acpi_table_parse_srat(ACPI_SRAT_TYPE_CPU_AFFINITY,
300 301 302 303
				      acpi_parse_processor_affinity, 0);
		srat_mem_cnt = acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY,
						     acpi_parse_memory_affinity,
						     NR_NODE_MEMBLKS);
L
Linus Torvalds 已提交
304
	}
305
}
L
Linus Torvalds 已提交
306

307 308
int __init acpi_numa_init(void)
{
L
Linus Torvalds 已提交
309
	/* SLIT: System Locality Information Table */
310
	acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit);
L
Linus Torvalds 已提交
311 312

	acpi_numa_arch_fixup();
313

314 315
	if (srat_mem_cnt < 0)
		return srat_mem_cnt;
316
	else if (!parsed_numa_memblks)
317
		return -ENOENT;
318
	return 0;
L
Linus Torvalds 已提交
319 320
}

Y
Yasunori Goto 已提交
321
int acpi_get_pxm(acpi_handle h)
L
Linus Torvalds 已提交
322
{
323
	unsigned long long pxm;
L
Linus Torvalds 已提交
324 325 326 327 328 329 330 331
	acpi_status status;
	acpi_handle handle;
	acpi_handle phandle = h;

	do {
		handle = phandle;
		status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm);
		if (ACPI_SUCCESS(status))
332
			return pxm;
L
Linus Torvalds 已提交
333
		status = acpi_get_parent(handle, &phandle);
L
Len Brown 已提交
334
	} while (ACPI_SUCCESS(status));
L
Linus Torvalds 已提交
335 336
	return -1;
}
337

Y
Yasunori Goto 已提交
338
int acpi_get_node(acpi_handle *handle)
339 340 341 342
{
	int pxm, node = -1;

	pxm = acpi_get_pxm(handle);
343
	if (pxm >= 0 && pxm < MAX_PXM_DOMAINS)
344 345
		node = acpi_map_pxm_to_node(pxm);

346
	return node;
347 348
}
EXPORT_SYMBOL(acpi_get_node);