blob: af0c8d5c845b9e6d805f33890f7ab12416a4aa76 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * acpi_numa.c - ACPI NUMA support
3 *
4 * Copyright (C) 2002 Takayoshi Kochi <t-kochi@bq.jp.nec.com>
5 *
6 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070018 * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
19 *
20 */
Hanjun Guoac906a62016-05-24 15:35:31 -070021
22#define pr_fmt(fmt) "ACPI: " fmt
23
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <linux/module.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070025#include <linux/init.h>
26#include <linux/kernel.h>
27#include <linux/types.h>
28#include <linux/errno.h>
29#include <linux/acpi.h>
David Rientjesb552a8c2009-11-17 14:27:32 -080030#include <linux/numa.h>
Toshi Kani99759862015-06-19 17:14:15 -060031#include <linux/nodemask.h>
32#include <linux/topology.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
Yasunori Goto762834e2006-06-23 02:03:19 -070034static nodemask_t nodes_found_map = NODE_MASK_NONE;
Yasunori Goto762834e2006-06-23 02:03:19 -070035
36/* maps to convert between proximity domain and logical node ID */
Jan Beulichffada892007-12-13 08:32:26 +000037static int pxm_to_node_map[MAX_PXM_DOMAINS]
David Rientjesb552a8c2009-11-17 14:27:32 -080038 = { [0 ... MAX_PXM_DOMAINS - 1] = NUMA_NO_NODE };
Jan Beulichffada892007-12-13 08:32:26 +000039static int node_to_pxm_map[MAX_NUMNODES]
David Rientjesb552a8c2009-11-17 14:27:32 -080040 = { [0 ... MAX_NUMNODES - 1] = PXM_INVAL };
Yasunori Goto762834e2006-06-23 02:03:19 -070041
Kurt Garloff8df0eb7c2012-01-17 04:18:02 -050042unsigned char acpi_srat_revision __initdata;
David Daneye84025e2016-05-24 15:35:39 -070043int acpi_numa __initdata;
Kurt Garloff8df0eb7c2012-01-17 04:18:02 -050044
Aaron Durbinf363d162007-05-16 22:11:06 -070045int pxm_to_node(int pxm)
Yasunori Goto762834e2006-06-23 02:03:19 -070046{
47 if (pxm < 0)
David Rientjesb552a8c2009-11-17 14:27:32 -080048 return NUMA_NO_NODE;
Yasunori Goto762834e2006-06-23 02:03:19 -070049 return pxm_to_node_map[pxm];
50}
51
Aaron Durbinf363d162007-05-16 22:11:06 -070052int node_to_pxm(int node)
Yasunori Goto762834e2006-06-23 02:03:19 -070053{
54 if (node < 0)
55 return PXM_INVAL;
56 return node_to_pxm_map[node];
57}
58
Bjorn Helgaasd79ed242014-01-24 15:48:01 -070059static void __acpi_map_pxm_to_node(int pxm, int node)
David Rientjes3484d792007-07-21 17:10:32 +020060{
David Rientjes0f9b75e2010-03-25 16:33:04 -070061 if (pxm_to_node_map[pxm] == NUMA_NO_NODE || node < pxm_to_node_map[pxm])
62 pxm_to_node_map[pxm] = node;
63 if (node_to_pxm_map[node] == PXM_INVAL || pxm < node_to_pxm_map[node])
64 node_to_pxm_map[node] = pxm;
David Rientjes3484d792007-07-21 17:10:32 +020065}
66
Luck, Tony8ff6f482007-05-24 13:57:40 -070067int acpi_map_pxm_to_node(int pxm)
Yasunori Goto762834e2006-06-23 02:03:19 -070068{
Toshi Kani99759862015-06-19 17:14:15 -060069 int node;
70
71 if (pxm < 0 || pxm >= MAX_PXM_DOMAINS)
72 return NUMA_NO_NODE;
73
74 node = pxm_to_node_map[pxm];
Yasunori Goto762834e2006-06-23 02:03:19 -070075
Jianguo Wu1bb25df2013-08-30 09:25:40 +080076 if (node == NUMA_NO_NODE) {
Yasunori Goto762834e2006-06-23 02:03:19 -070077 if (nodes_weight(nodes_found_map) >= MAX_NUMNODES)
David Rientjesb552a8c2009-11-17 14:27:32 -080078 return NUMA_NO_NODE;
Yasunori Goto762834e2006-06-23 02:03:19 -070079 node = first_unset_node(nodes_found_map);
David Rientjes3484d792007-07-21 17:10:32 +020080 __acpi_map_pxm_to_node(pxm, node);
Yasunori Goto762834e2006-06-23 02:03:19 -070081 node_set(node, nodes_found_map);
82 }
83
84 return node;
85}
86
Toshi Kani99759862015-06-19 17:14:15 -060087/**
88 * acpi_map_pxm_to_online_node - Map proximity ID to online node
89 * @pxm: ACPI proximity ID
90 *
91 * This is similar to acpi_map_pxm_to_node(), but always returns an online
92 * node. When the mapped node from a given proximity ID is offline, it
93 * looks up the node distance table and returns the nearest online node.
94 *
95 * ACPI device drivers, which are called after the NUMA initialization has
96 * completed in the kernel, can call this interface to obtain their device
97 * NUMA topology from ACPI tables. Such drivers do not have to deal with
98 * offline nodes. A node may be offline when a device proximity ID is
99 * unique, SRAT memory entry does not exist, or NUMA is disabled, ex.
100 * "numa=off" on x86.
101 */
102int acpi_map_pxm_to_online_node(int pxm)
103{
104 int node, n, dist, min_dist;
105
106 node = acpi_map_pxm_to_node(pxm);
107
108 if (node == NUMA_NO_NODE)
109 node = 0;
110
111 if (!node_online(node)) {
112 min_dist = INT_MAX;
113 for_each_online_node(n) {
114 dist = node_distance(node, n);
115 if (dist < min_dist) {
116 min_dist = dist;
117 node = n;
118 }
119 }
120 }
121
122 return node;
123}
124EXPORT_SYMBOL(acpi_map_pxm_to_online_node);
125
David Rientjesae2c6dc2007-07-21 17:09:56 +0200126static void __init
127acpi_table_print_srat_entry(struct acpi_subtable_header *header)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129 switch (header->type) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300130 case ACPI_SRAT_TYPE_CPU_AFFINITY:
Len Brown4be44fc2005-08-05 00:44:28 -0400131 {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300132 struct acpi_srat_cpu_affinity *p =
133 (struct acpi_srat_cpu_affinity *)header;
Hanjun Guo3dda4482016-05-24 15:35:32 -0700134 pr_debug("SRAT Processor (id[0x%02x] eid[0x%02x]) in proximity domain %d %s\n",
135 p->apic_id, p->local_sapic_eid,
136 p->proximity_domain_lo,
137 (p->flags & ACPI_SRAT_CPU_ENABLED) ?
138 "enabled" : "disabled");
Len Brown4be44fc2005-08-05 00:44:28 -0400139 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 break;
141
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300142 case ACPI_SRAT_TYPE_MEMORY_AFFINITY:
Len Brown4be44fc2005-08-05 00:44:28 -0400143 {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300144 struct acpi_srat_mem_affinity *p =
145 (struct acpi_srat_mem_affinity *)header;
Hanjun Guo3dda4482016-05-24 15:35:32 -0700146 pr_debug("SRAT Memory (0x%lx length 0x%lx) in proximity domain %d %s%s%s\n",
147 (unsigned long)p->base_address,
148 (unsigned long)p->length,
149 p->proximity_domain,
150 (p->flags & ACPI_SRAT_MEM_ENABLED) ?
151 "enabled" : "disabled",
152 (p->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) ?
153 " hot-pluggable" : "",
154 (p->flags & ACPI_SRAT_MEM_NON_VOLATILE) ?
155 " non-volatile" : "");
Len Brown4be44fc2005-08-05 00:44:28 -0400156 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 break;
158
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800159 case ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY:
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800160 {
161 struct acpi_srat_x2apic_cpu_affinity *p =
162 (struct acpi_srat_x2apic_cpu_affinity *)header;
Hanjun Guo3dda4482016-05-24 15:35:32 -0700163 pr_debug("SRAT Processor (x2apicid[0x%08x]) in proximity domain %d %s\n",
164 p->apic_id,
165 p->proximity_domain,
166 (p->flags & ACPI_SRAT_CPU_ENABLED) ?
167 "enabled" : "disabled");
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800168 }
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800169 break;
Hanjun Guo3dda4482016-05-24 15:35:32 -0700170
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 default:
Hanjun Guoac906a62016-05-24 15:35:31 -0700172 pr_warn("Found unsupported SRAT entry (type = 0x%x)\n",
173 header->type);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 break;
175 }
176}
177
Fenghua Yu39b89312008-06-09 16:48:18 -0700178/*
179 * A lot of BIOS fill in 10 (= no distance) everywhere. This messes
180 * up the NUMA heuristics which wants the local node to have a smaller
181 * distance than the others.
182 * Do some quick checks here and only use the SLIT if it passes.
183 */
Hanjun Guo40e31852013-08-13 18:31:14 +0800184static int __init slit_valid(struct acpi_table_slit *slit)
Fenghua Yu39b89312008-06-09 16:48:18 -0700185{
186 int i, j;
187 int d = slit->locality_count;
188 for (i = 0; i < d; i++) {
189 for (j = 0; j < d; j++) {
190 u8 val = slit->entry[d*i + j];
191 if (i == j) {
192 if (val != LOCAL_DISTANCE)
193 return 0;
194 } else if (val <= LOCAL_DISTANCE)
195 return 0;
196 }
197 }
198 return 1;
199}
200
David Daneye84025e2016-05-24 15:35:39 -0700201void __init bad_srat(void)
202{
203 pr_err("SRAT: SRAT not used.\n");
204 acpi_numa = -1;
205}
206
207int __init srat_disabled(void)
208{
209 return acpi_numa < 0;
210}
211
Hanjun Guo6525afd2016-05-24 15:35:35 -0700212#if defined(CONFIG_X86) || defined(CONFIG_ARM64)
213/*
214 * Callback for SLIT parsing. pxm_to_node() returns NUMA_NO_NODE for
215 * I/O localities since SRAT does not list them. I/O localities are
216 * not supported at this point.
217 */
218void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
219{
220 int i, j;
221
222 for (i = 0; i < slit->locality_count; i++) {
223 const int from_node = pxm_to_node(i);
224
225 if (from_node == NUMA_NO_NODE)
226 continue;
227
228 for (j = 0; j < slit->locality_count; j++) {
229 const int to_node = pxm_to_node(j);
230
231 if (to_node == NUMA_NO_NODE)
232 continue;
233
234 numa_set_distance(from_node, to_node,
235 slit->entry[slit->locality_count * i + j]);
236 }
237 }
238}
239#endif /* defined(CONFIG_X86) || defined (CONFIG_ARM64) */
240
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300241static int __init acpi_parse_slit(struct acpi_table_header *table)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242{
Hanjun Guo2fad9302015-02-05 17:33:14 +0800243 struct acpi_table_slit *slit = (struct acpi_table_slit *)table;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244
Fenghua Yu39b89312008-06-09 16:48:18 -0700245 if (!slit_valid(slit)) {
Hanjun Guoac906a62016-05-24 15:35:31 -0700246 pr_info("SLIT table looks invalid. Not used.\n");
Fenghua Yu39b89312008-06-09 16:48:18 -0700247 return -EINVAL;
248 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 acpi_numa_slit_init(slit);
250
251 return 0;
252}
253
Bjorn Helgaasbeffbe52014-01-27 17:19:15 -0700254void __init __weak
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800255acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
256{
Hanjun Guoac906a62016-05-24 15:35:31 -0700257 pr_warn("Found unsupported x2apic [0x%08x] SRAT entry\n", pa->apic_id);
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800258}
259
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260static int __init
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800261acpi_parse_x2apic_affinity(struct acpi_subtable_header *header,
262 const unsigned long end)
263{
264 struct acpi_srat_x2apic_cpu_affinity *processor_affinity;
265
266 processor_affinity = (struct acpi_srat_x2apic_cpu_affinity *)header;
267 if (!processor_affinity)
268 return -EINVAL;
269
270 acpi_table_print_srat_entry(header);
271
272 /* let architecture-dependent part to do it */
273 acpi_numa_x2apic_affinity_init(processor_affinity);
274
275 return 0;
276}
277
278static int __init
279acpi_parse_processor_affinity(struct acpi_subtable_header *header,
Len Brown4be44fc2005-08-05 00:44:28 -0400280 const unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281{
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300282 struct acpi_srat_cpu_affinity *processor_affinity;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300284 processor_affinity = (struct acpi_srat_cpu_affinity *)header;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 if (!processor_affinity)
286 return -EINVAL;
287
288 acpi_table_print_srat_entry(header);
289
290 /* let architecture-dependent part to do it */
291 acpi_numa_processor_affinity_init(processor_affinity);
292
293 return 0;
294}
295
Thomas Renninger095adbb2012-07-31 17:41:09 +0200296static int __initdata parsed_numa_memblks;
297
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298static int __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300299acpi_parse_memory_affinity(struct acpi_subtable_header * header,
Len Brown4be44fc2005-08-05 00:44:28 -0400300 const unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301{
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300302 struct acpi_srat_mem_affinity *memory_affinity;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300304 memory_affinity = (struct acpi_srat_mem_affinity *)header;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305 if (!memory_affinity)
306 return -EINVAL;
307
308 acpi_table_print_srat_entry(header);
309
310 /* let architecture-dependent part to do it */
Thomas Renninger095adbb2012-07-31 17:41:09 +0200311 if (!acpi_numa_memory_affinity_init(memory_affinity))
312 parsed_numa_memblks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313 return 0;
314}
315
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300316static int __init acpi_parse_srat(struct acpi_table_header *table)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317{
Hanjun Guo2fad9302015-02-05 17:33:14 +0800318 struct acpi_table_srat *srat = (struct acpi_table_srat *)table;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319
Kurt Garloff8df0eb7c2012-01-17 04:18:02 -0500320 acpi_srat_revision = srat->header.revision;
321
Andi Kleencfa806f2010-07-20 15:18:36 -0700322 /* Real work done in acpi_table_parse_srat below. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323
324 return 0;
325}
326
David Rientjesae2c6dc2007-07-21 17:09:56 +0200327static int __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300328acpi_table_parse_srat(enum acpi_srat_type id,
Lv Zhengb43e1062013-01-12 15:29:38 +0000329 acpi_tbl_entry_handler handler, unsigned int max_entries)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330{
Len Brown6eb87fe2007-02-10 22:17:07 -0500331 return acpi_table_parse_entries(ACPI_SIG_SRAT,
Len Brown4be44fc2005-08-05 00:44:28 -0400332 sizeof(struct acpi_table_srat), id,
333 handler, max_entries);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700334}
335
Yinghai Lu20e69262013-03-01 14:51:27 -0800336int __init acpi_numa_init(void)
Tang Chene8d19552013-02-22 16:33:44 -0800337{
Yinghai Lu20e69262013-03-01 14:51:27 -0800338 int cnt = 0;
339
Yinghai Lud3bd0582010-12-16 19:09:58 -0800340 /*
341 * Should not limit number with cpu num that is from NR_CPUS or nr_cpus=
342 * SRAT cpu entries could have different order with that in MADT.
343 * So go over all cpu entries in SRAT to get apicid to node mapping.
344 */
David Rientjes87162732009-09-25 15:20:04 -0700345
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346 /* SRAT: Static Resource Affinity Table */
Len Brown7f8f97c2007-02-10 21:28:03 -0500347 if (!acpi_table_parse(ACPI_SIG_SRAT, acpi_parse_srat)) {
Lukasz Anaczkowski702b07f2016-04-21 11:29:00 +0200348 struct acpi_subtable_proc srat_proc[2];
349
350 memset(srat_proc, 0, sizeof(srat_proc));
351 srat_proc[0].id = ACPI_SRAT_TYPE_CPU_AFFINITY;
352 srat_proc[0].handler = acpi_parse_processor_affinity;
353 srat_proc[1].id = ACPI_SRAT_TYPE_X2APIC_CPU_AFFINITY;
354 srat_proc[1].handler = acpi_parse_x2apic_affinity;
355
356 acpi_table_parse_entries_array(ACPI_SIG_SRAT,
357 sizeof(struct acpi_table_srat),
358 srat_proc, ARRAY_SIZE(srat_proc), 0);
359
Yinghai Lu20e69262013-03-01 14:51:27 -0800360 cnt = acpi_table_parse_srat(ACPI_SRAT_TYPE_MEMORY_AFFINITY,
361 acpi_parse_memory_affinity,
362 NR_NODE_MEMBLKS);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363 }
364
365 /* SLIT: System Locality Information Table */
Len Brown7f8f97c2007-02-10 21:28:03 -0500366 acpi_table_parse(ACPI_SIG_SLIT, acpi_parse_slit);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700367
Yinghai Lu20e69262013-03-01 14:51:27 -0800368 if (cnt < 0)
369 return cnt;
Thomas Renninger095adbb2012-07-31 17:41:09 +0200370 else if (!parsed_numa_memblks)
Thomas Renningerf3946fb2012-07-31 17:41:08 +0200371 return -ENOENT;
Tejun Heo940fed22011-02-16 12:13:06 +0100372 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700373}
374
Bjorn Helgaasd79ed242014-01-24 15:48:01 -0700375static int acpi_get_pxm(acpi_handle h)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376{
Matthew Wilcox27663c52008-10-10 02:22:59 -0400377 unsigned long long pxm;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378 acpi_status status;
379 acpi_handle handle;
380 acpi_handle phandle = h;
381
382 do {
383 handle = phandle;
384 status = acpi_evaluate_integer(handle, "_PXM", NULL, &pxm);
385 if (ACPI_SUCCESS(status))
Jan Engelhardt50dd0962006-10-01 00:28:50 +0200386 return pxm;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387 status = acpi_get_parent(handle, &phandle);
Len Brown4be44fc2005-08-05 00:44:28 -0400388 } while (ACPI_SUCCESS(status));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389 return -1;
390}
Yasunori Goto1e3590e2006-06-27 02:53:31 -0700391
Bjorn Helgaas486c79b2014-01-24 15:25:10 -0700392int acpi_get_node(acpi_handle handle)
Yasunori Goto1e3590e2006-06-27 02:53:31 -0700393{
Bjorn Helgaas962fe9c2014-01-24 15:42:17 -0700394 int pxm;
Yasunori Goto1e3590e2006-06-27 02:53:31 -0700395
Yasunori Goto1e3590e2006-06-27 02:53:31 -0700396 pxm = acpi_get_pxm(handle);
Yasunori Goto1e3590e2006-06-27 02:53:31 -0700397
Bjorn Helgaas962fe9c2014-01-24 15:42:17 -0700398 return acpi_map_pxm_to_node(pxm);
Yasunori Goto1e3590e2006-06-27 02:53:31 -0700399}
400EXPORT_SYMBOL(acpi_get_node);