blob: 341b37193c76bfa1557d399f5789f6a3c6523e71 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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>
Andi Kleen68a3a7f2006-04-07 19:49:18 +020018#include <linux/bootmem.h>
Yinghai Lua9ce6bc2010-08-25 13:39:17 -070019#include <linux/memblock.h>
Andi Kleen68a3a7f2006-04-07 19:49:18 +020020#include <linux/mm.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <asm/proto.h>
22#include <asm/numa.h>
Andi Kleen8a6fdd32006-01-11 22:44:39 +010023#include <asm/e820.h>
Ingo Molnar7b6aa332009-02-17 13:58:15 +010024#include <asm/apic.h>
Ingo Molnar4ec71fa2009-01-21 10:24:27 +010025#include <asm/uv/uv.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070026
Andi Kleenc31fbb12006-09-26 10:52:33 +020027int acpi_numa __initdata;
28
Linus Torvalds1da177e2005-04-16 15:20:36 -070029static struct acpi_table_slit *acpi_slit;
30
Keith Mannthey4942e992006-09-30 23:27:06 -070031static struct bootnode nodes_add[MAX_NUMNODES];
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
33static __init int setup_node(int pxm)
34{
Yasunori Goto762834e2006-06-23 02:03:19 -070035 return acpi_map_pxm_to_node(pxm);
Linus Torvalds1da177e2005-04-16 15:20:36 -070036}
37
Linus Torvalds1da177e2005-04-16 15:20:36 -070038static __init void bad_srat(void)
39{
Andi Kleen2bce2b52005-09-12 18:49:25 +020040 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070041 printk(KERN_ERR "SRAT: SRAT not used.\n");
42 acpi_numa = -1;
Andi Kleen429b2b32009-07-18 08:56:57 +020043 for (i = 0; i < MAX_NUMNODES; i++) {
Tejun Heo206e4202011-02-16 12:13:07 +010044 numa_nodes[i].start = numa_nodes[i].end = 0;
Andi Kleen429b2b32009-07-18 08:56:57 +020045 nodes_add[i].start = nodes_add[i].end = 0;
46 }
Mel Gorman5cb248a2006-09-27 01:49:52 -070047 remove_all_active_ranges();
Linus Torvalds1da177e2005-04-16 15:20:36 -070048}
49
50static __init inline int srat_disabled(void)
51{
Tejun Heoffe77a42011-02-16 12:13:06 +010052 return acpi_numa < 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070053}
54
55/* Callback for SLIT parsing */
56void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
57{
Yinghai Luf302a5bb2008-07-10 20:36:37 -070058 unsigned length;
59 unsigned long phys;
60
61 length = slit->header.length;
Yinghai Lua9ce6bc2010-08-25 13:39:17 -070062 phys = memblock_find_in_range(0, max_pfn_mapped<<PAGE_SHIFT, length,
Yinghai Luf302a5bb2008-07-10 20:36:37 -070063 PAGE_SIZE);
64
Yinghai Lua9ce6bc2010-08-25 13:39:17 -070065 if (phys == MEMBLOCK_ERROR)
Yinghai Luf302a5bb2008-07-10 20:36:37 -070066 panic(" Can not save slit!\n");
67
68 acpi_slit = __va(phys);
69 memcpy(acpi_slit, slit, length);
Yinghai Lua9ce6bc2010-08-25 13:39:17 -070070 memblock_x86_reserve_range(phys, phys + length, "ACPI SLIT");
Linus Torvalds1da177e2005-04-16 15:20:36 -070071}
72
Suresh Siddha7237d3d2009-03-30 13:55:30 -080073/* Callback for Proximity Domain -> x2APIC mapping */
74void __init
75acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
76{
77 int pxm, node;
78 int apic_id;
79
80 if (srat_disabled())
81 return;
82 if (pa->header.length < sizeof(struct acpi_srat_x2apic_cpu_affinity)) {
83 bad_srat();
84 return;
85 }
86 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
87 return;
88 pxm = pa->proximity_domain;
89 node = setup_node(pxm);
90 if (node < 0) {
91 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
92 bad_srat();
93 return;
94 }
95
96 apic_id = pa->apic_id;
Yinghai Lud3bd0582010-12-16 19:09:58 -080097 if (apic_id >= MAX_LOCAL_APIC) {
98 printk(KERN_INFO "SRAT: PXM %u -> APIC 0x%04x -> Node %u skipped apicid that is too big\n", pxm, apic_id, node);
99 return;
100 }
Tejun Heobbc9e2f2011-01-23 14:37:39 +0100101 set_apicid_to_node(apic_id, node);
Jack Steinerdc098552009-04-17 09:22:42 -0500102 node_set(node, cpu_nodes_parsed);
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800103 acpi_numa = 1;
Yinghai Lu163d3862009-11-21 00:23:37 -0800104 printk(KERN_INFO "SRAT: PXM %u -> APIC 0x%04x -> Node %u\n",
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800105 pxm, apic_id, node);
106}
107
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108/* Callback for Proximity Domain -> LAPIC mapping */
109void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300110acpi_numa_processor_affinity_init(struct acpi_srat_cpu_affinity *pa)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111{
112 int pxm, node;
travis@sgi.comef970012008-01-30 13:33:10 +0100113 int apic_id;
114
Andi Kleend22fe802006-02-03 21:51:26 +0100115 if (srat_disabled())
116 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300117 if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
Andi Kleenfad79062006-05-15 18:19:44 +0200118 bad_srat();
Andi Kleend22fe802006-02-03 21:51:26 +0100119 return;
120 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300121 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300123 pxm = pa->proximity_domain_lo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 node = setup_node(pxm);
125 if (node < 0) {
126 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
127 bad_srat();
128 return;
129 }
Yinghai Lubeafe912008-02-16 23:00:22 -0800130
Jack Steiner2e420602008-09-23 15:37:13 -0500131 if (get_uv_system_type() >= UV_X2APIC)
Jack Steinera65d1d62008-03-28 14:12:08 -0500132 apic_id = (pa->apic_id << 8) | pa->local_sapic_eid;
133 else
134 apic_id = pa->apic_id;
Yinghai Lud3bd0582010-12-16 19:09:58 -0800135
136 if (apic_id >= MAX_LOCAL_APIC) {
137 printk(KERN_INFO "SRAT: PXM %u -> APIC 0x%02x -> Node %u skipped apicid that is too big\n", pxm, apic_id, node);
138 return;
139 }
140
Tejun Heobbc9e2f2011-01-23 14:37:39 +0100141 set_apicid_to_node(apic_id, node);
Jack Steinerdc098552009-04-17 09:22:42 -0500142 node_set(node, cpu_nodes_parsed);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143 acpi_numa = 1;
Yinghai Lu163d3862009-11-21 00:23:37 -0800144 printk(KERN_INFO "SRAT: PXM %u -> APIC 0x%02x -> Node %u\n",
travis@sgi.comef970012008-01-30 13:33:10 +0100145 pxm, apic_id, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146}
147
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700148#ifdef CONFIG_MEMORY_HOTPLUG_SPARSE
149static inline int save_add_info(void) {return 1;}
150#else
151static inline int save_add_info(void) {return 0;}
152#endif
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200153/*
Yinghai Lu888a5892009-05-15 13:59:37 -0700154 * Update nodes_add[]
155 * This code supports one contiguous hot add area per node
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200156 */
Yinghai Lu888a5892009-05-15 13:59:37 -0700157static void __init
158update_nodes_add(int node, unsigned long start, unsigned long end)
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200159{
160 unsigned long s_pfn = start >> PAGE_SHIFT;
161 unsigned long e_pfn = end >> PAGE_SHIFT;
Yinghai Lu888a5892009-05-15 13:59:37 -0700162 int changed = 0;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200163 struct bootnode *nd = &nodes_add[node];
164
165 /* I had some trouble with strange memory hotadd regions breaking
166 the boot. Be very strict here and reject anything unexpected.
167 If you want working memory hotadd write correct SRATs.
168
169 The node size check is a basic sanity check to guard against
170 mistakes */
171 if ((signed long)(end - start) < NODE_MIN_SIZE) {
172 printk(KERN_ERR "SRAT: Hotplug area too small\n");
Yinghai Lu888a5892009-05-15 13:59:37 -0700173 return;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200174 }
175
176 /* This check might be a bit too strict, but I'm keeping it for now. */
Mel Gorman5cb248a2006-09-27 01:49:52 -0700177 if (absent_pages_in_range(s_pfn, e_pfn) != e_pfn - s_pfn) {
Mel Gorman9c7cd682006-09-27 01:49:58 -0700178 printk(KERN_ERR
179 "SRAT: Hotplug area %lu -> %lu has existing memory\n",
180 s_pfn, e_pfn);
Yinghai Lu888a5892009-05-15 13:59:37 -0700181 return;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200182 }
183
184 /* Looks good */
185
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200186 if (nd->start == nd->end) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300187 nd->start = start;
188 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200189 changed = 1;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300190 } else {
191 if (nd->start == end) {
192 nd->start = start;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200193 changed = 1;
194 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300195 if (nd->end == start) {
196 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200197 changed = 1;
198 }
199 if (!changed)
200 printk(KERN_ERR "SRAT: Hotplug zone not continuous. Partly ignored\n");
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300201 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200202
David Rientjes3a5fc0e2010-01-20 12:10:47 -0800203 if (changed) {
204 node_set(node, cpu_nodes_parsed);
Yinghai Lu888a5892009-05-15 13:59:37 -0700205 printk(KERN_INFO "SRAT: hot plug zone found %Lx - %Lx\n",
206 nd->start, nd->end);
David Rientjes3a5fc0e2010-01-20 12:10:47 -0800207 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200208}
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200209
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
211void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300212acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *ma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213{
Tejun Heo13081df2011-02-16 12:13:06 +0100214 struct bootnode *nd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 unsigned long start, end;
216 int node, pxm;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217
Andi Kleend22fe802006-02-03 21:51:26 +0100218 if (srat_disabled())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300220 if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
Andi Kleend22fe802006-02-03 21:51:26 +0100221 bad_srat();
222 return;
223 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300224 if ((ma->flags & ACPI_SRAT_MEM_ENABLED) == 0)
Andi Kleend22fe802006-02-03 21:51:26 +0100225 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300226
227 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) && !save_add_info())
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200228 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300229 start = ma->base_address;
230 end = start + ma->length;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231 pxm = ma->proximity_domain;
232 node = setup_node(pxm);
233 if (node < 0) {
234 printk(KERN_ERR "SRAT: Too many proximity domains.\n");
235 bad_srat();
236 return;
237 }
Tejun Heoef396ec2011-02-16 17:11:07 +0100238
239 if (numa_add_memblk(node, start, end) < 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240 bad_srat();
241 return;
242 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200243
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700244 printk(KERN_INFO "SRAT: Node %u PXM %u %lx-%lx\n", node, pxm,
245 start, end);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200246
Tejun Heo13081df2011-02-16 12:13:06 +0100247 if (!(ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE)) {
Tejun Heo206e4202011-02-16 12:13:07 +0100248 nd = &numa_nodes[node];
Tejun Heoec8cf29b2011-02-16 12:13:07 +0100249 if (!node_test_and_set(node, mem_nodes_parsed)) {
Tejun Heo13081df2011-02-16 12:13:06 +0100250 nd->start = start;
251 nd->end = end;
252 } else {
253 if (start < nd->start)
254 nd->start = start;
255 if (nd->end < end)
256 nd->end = end;
257 }
258 } else
Yinghai Lu888a5892009-05-15 13:59:37 -0700259 update_nodes_add(node, start, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260}
261
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100262/* Sanity check to catch more bad SRATs (they are amazingly common).
263 Make sure the PXMs cover all memory. */
David Rientjes3484d792007-07-21 17:10:32 +0200264static int __init nodes_cover_memory(const struct bootnode *nodes)
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100265{
266 int i;
267 unsigned long pxmram, e820ram;
268
269 pxmram = 0;
Tejun Heoec8cf29b2011-02-16 12:13:07 +0100270 for_each_node_mask(i, mem_nodes_parsed) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100271 unsigned long s = nodes[i].start >> PAGE_SHIFT;
272 unsigned long e = nodes[i].end >> PAGE_SHIFT;
273 pxmram += e - s;
Yinghai Lu32996252009-12-15 17:59:02 -0800274 pxmram -= __absent_pages_in_range(i, s, e);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200275 if ((long)pxmram < 0)
276 pxmram = 0;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100277 }
278
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700279 e820ram = max_pfn - (memblock_x86_hole_size(0, max_pfn<<PAGE_SHIFT)>>PAGE_SHIFT);
Yinghai Lu0964b052009-05-08 00:37:34 -0700280 /* We seem to lose 3 pages somewhere. Allow 1M of slack. */
281 if ((long)(e820ram - pxmram) >= (1<<(20 - PAGE_SHIFT))) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100282 printk(KERN_ERR
283 "SRAT: PXMs only cover %luMB of your %luMB e820 RAM. Not used.\n",
284 (pxmram << PAGE_SHIFT) >> 20,
285 (e820ram << PAGE_SHIFT) >> 20);
286 return 0;
287 }
288 return 1;
289}
290
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291void __init acpi_numa_arch_fixup(void) {}
292
Tejun Heoa9aec562011-02-16 12:13:06 +0100293int __init x86_acpi_numa_init(void)
294{
295 int ret;
296
297 ret = acpi_numa_init();
298 if (ret < 0)
299 return ret;
300 return srat_disabled() ? -EINVAL : 0;
301}
302
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303/* Use the information discovered above to actually set up the nodes. */
Tejun Heo940fed22011-02-16 12:13:06 +0100304int __init acpi_scan_nodes(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305{
306 int i;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100307
David Rientjesae2c6dc2007-07-21 17:09:56 +0200308 if (acpi_numa <= 0)
309 return -1;
310
Tejun Heoef396ec2011-02-16 17:11:07 +0100311 if (numa_register_memblks() < 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312 bad_srat();
313 return -1;
314 }
Andi Kleene58e0d02005-09-12 18:49:25 +0200315
Yinghai Lu32996252009-12-15 17:59:02 -0800316 /* for out of order entries in SRAT */
317 sort_node_map();
Tejun Heo206e4202011-02-16 12:13:07 +0100318 if (!nodes_cover_memory(numa_nodes)) {
David Rientjes87162732009-09-25 15:20:04 -0700319 bad_srat();
320 return -1;
321 }
322
Yinghai Lu1411e0e2010-12-27 16:48:17 -0800323 init_memory_mapping_high();
324
Andi Kleene58e0d02005-09-12 18:49:25 +0200325 /* Finally register nodes */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200326 for_each_node_mask(i, node_possible_map)
Tejun Heo206e4202011-02-16 12:13:07 +0100327 setup_node_bootmem(i, numa_nodes[i].start, numa_nodes[i].end);
Andi Kleena8062232006-04-07 19:49:21 +0200328 /* Try again in case setup_node_bootmem missed one due
329 to missing bootmem */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200330 for_each_node_mask(i, node_possible_map)
Andi Kleena8062232006-04-07 19:49:21 +0200331 if (!node_online(i))
Tejun Heo206e4202011-02-16 12:13:07 +0100332 setup_node_bootmem(i, numa_nodes[i].start,
333 numa_nodes[i].end);
Andi Kleena8062232006-04-07 19:49:21 +0200334
Mike Travis168ef542008-12-16 17:34:01 -0800335 for (i = 0; i < nr_cpu_ids; i++) {
Mike Travis0164fe12008-01-30 13:33:21 +0100336 int node = early_cpu_to_node(i);
337
travis@sgi.com834beda12008-01-30 13:33:21 +0100338 if (node == NUMA_NO_NODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339 continue;
Yinghai Lu7c437692009-05-15 13:59:37 -0700340 if (!node_online(node))
Mike Travis23ca4bb2008-05-12 21:21:12 +0200341 numa_clear_node(i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342 }
343 numa_init_array();
344 return 0;
345}
346
David Rientjes3484d792007-07-21 17:10:32 +0200347#ifdef CONFIG_NUMA_EMU
travis@sgi.comef970012008-01-30 13:33:10 +0100348static int fake_node_to_pxm_map[MAX_NUMNODES] __initdata = {
349 [0 ... MAX_NUMNODES-1] = PXM_INVAL
350};
travis@sgi.com602a54a2008-01-30 13:33:21 +0100351static s16 fake_apicid_to_node[MAX_LOCAL_APIC] __initdata = {
travis@sgi.comef970012008-01-30 13:33:10 +0100352 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
353};
David Rientjes3484d792007-07-21 17:10:32 +0200354static int __init find_node_by_addr(unsigned long addr)
355{
356 int ret = NUMA_NO_NODE;
357 int i;
358
Tejun Heoec8cf29b2011-02-16 12:13:07 +0100359 for_each_node_mask(i, mem_nodes_parsed) {
David Rientjes3484d792007-07-21 17:10:32 +0200360 /*
361 * Find the real node that this emulated node appears on. For
362 * the sake of simplicity, we only use a real node's starting
363 * address to determine which emulated node it appears on.
364 */
Tejun Heo206e4202011-02-16 12:13:07 +0100365 if (addr >= numa_nodes[i].start && addr < numa_nodes[i].end) {
David Rientjes3484d792007-07-21 17:10:32 +0200366 ret = i;
367 break;
368 }
369 }
Minoru Usui9a1b62f2008-01-30 13:33:35 +0100370 return ret;
David Rientjes3484d792007-07-21 17:10:32 +0200371}
372
373/*
374 * In NUMA emulation, we need to setup proximity domain (_PXM) to node ID
375 * mappings that respect the real ACPI topology but reflect our emulated
376 * environment. For each emulated node, we find which real node it appears on
377 * and create PXM to NID mappings for those fake nodes which mirror that
378 * locality. SLIT will now represent the correct distances between emulated
379 * nodes as a result of the real topology.
380 */
381void __init acpi_fake_nodes(const struct bootnode *fake_nodes, int num_nodes)
382{
David Rientjes08705b82007-07-21 17:10:33 +0200383 int i, j;
David Rientjes3484d792007-07-21 17:10:32 +0200384
David Rientjes3484d792007-07-21 17:10:32 +0200385 for (i = 0; i < num_nodes; i++) {
386 int nid, pxm;
387
388 nid = find_node_by_addr(fake_nodes[i].start);
389 if (nid == NUMA_NO_NODE)
390 continue;
391 pxm = node_to_pxm(nid);
392 if (pxm == PXM_INVAL)
393 continue;
394 fake_node_to_pxm_map[i] = pxm;
David Rientjes08705b82007-07-21 17:10:33 +0200395 /*
396 * For each apicid_to_node mapping that exists for this real
397 * node, it must now point to the fake node ID.
398 */
399 for (j = 0; j < MAX_LOCAL_APIC; j++)
Tejun Heobbc9e2f2011-01-23 14:37:39 +0100400 if (__apicid_to_node[j] == nid &&
David Rientjesb0c4d952010-05-06 02:24:34 -0700401 fake_apicid_to_node[j] == NUMA_NO_NODE)
David Rientjes08705b82007-07-21 17:10:33 +0200402 fake_apicid_to_node[j] = i;
David Rientjes3484d792007-07-21 17:10:32 +0200403 }
David Rientjesa387e952010-12-22 17:23:56 -0800404
405 /*
406 * If there are apicid-to-node mappings for physical nodes that do not
407 * have a corresponding emulated node, it should default to a guaranteed
408 * value.
409 */
410 for (i = 0; i < MAX_LOCAL_APIC; i++)
Tejun Heobbc9e2f2011-01-23 14:37:39 +0100411 if (__apicid_to_node[i] != NUMA_NO_NODE &&
David Rientjesa387e952010-12-22 17:23:56 -0800412 fake_apicid_to_node[i] == NUMA_NO_NODE)
413 fake_apicid_to_node[i] = 0;
414
David Rientjes3484d792007-07-21 17:10:32 +0200415 for (i = 0; i < num_nodes; i++)
416 __acpi_map_pxm_to_node(fake_node_to_pxm_map[i], i);
Tejun Heobbc9e2f2011-01-23 14:37:39 +0100417 memcpy(__apicid_to_node, fake_apicid_to_node, sizeof(__apicid_to_node));
David Rientjes3484d792007-07-21 17:10:32 +0200418
Tejun Heoec8cf29b2011-02-16 12:13:07 +0100419 nodes_clear(mem_nodes_parsed);
David Rientjes3484d792007-07-21 17:10:32 +0200420 for (i = 0; i < num_nodes; i++)
421 if (fake_nodes[i].start != fake_nodes[i].end)
Tejun Heoec8cf29b2011-02-16 12:13:07 +0100422 node_set(i, mem_nodes_parsed);
David Rientjes3484d792007-07-21 17:10:32 +0200423}
424
425static int null_slit_node_compare(int a, int b)
426{
427 return node_to_pxm(a) == node_to_pxm(b);
428}
429#else
430static int null_slit_node_compare(int a, int b)
431{
432 return a == b;
433}
434#endif /* CONFIG_NUMA_EMU */
435
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436int __node_distance(int a, int b)
437{
438 int index;
439
440 if (!acpi_slit)
David Rientjes3484d792007-07-21 17:10:32 +0200441 return null_slit_node_compare(a, b) ? LOCAL_DISTANCE :
442 REMOTE_DISTANCE;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300443 index = acpi_slit->locality_count * node_to_pxm(a);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444 return acpi_slit->entry[index + node_to_pxm(b)];
445}
446
447EXPORT_SYMBOL(__node_distance);
Keith Mannthey4942e992006-09-30 23:27:06 -0700448
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200449#if defined(CONFIG_MEMORY_HOTPLUG_SPARSE) || defined(CONFIG_ACPI_HOTPLUG_MEMORY)
Keith Mannthey4942e992006-09-30 23:27:06 -0700450int memory_add_physaddr_to_nid(u64 start)
451{
452 int i, ret = 0;
453
454 for_each_node(i)
455 if (nodes_add[i].start <= start && nodes_add[i].end > start)
456 ret = i;
457
458 return ret;
459}
Keith Mannthey8c2676a2006-09-30 23:27:07 -0700460EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200461#endif