blob: 2dfcbf9df2ae8410228e25fb4f559cd75ed1982e [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>
19#include <linux/mm.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070020#include <asm/proto.h>
21#include <asm/numa.h>
Andi Kleen8a6fdd32006-01-11 22:44:39 +010022#include <asm/e820.h>
Ingo Molnar7b6aa332009-02-17 13:58:15 +010023#include <asm/apic.h>
Ingo Molnar4ec71fa2009-01-21 10:24:27 +010024#include <asm/uv/uv.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070025
Andi Kleenc31fbb12006-09-26 10:52:33 +020026int acpi_numa __initdata;
27
Linus Torvalds1da177e2005-04-16 15:20:36 -070028static struct acpi_table_slit *acpi_slit;
29
30static nodemask_t nodes_parsed __initdata;
Jack Steinerdc098552009-04-17 09:22:42 -050031static nodemask_t cpu_nodes_parsed __initdata;
Andi Kleenabe059e2006-03-25 16:29:12 +010032static struct bootnode nodes[MAX_NUMNODES] __initdata;
Keith Mannthey4942e992006-09-30 23:27:06 -070033static struct bootnode nodes_add[MAX_NUMNODES];
Linus Torvalds1da177e2005-04-16 15:20:36 -070034
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070035static int num_node_memblks __initdata;
36static struct bootnode node_memblk_range[NR_NODE_MEMBLKS] __initdata;
37static int memblk_nodeid[NR_NODE_MEMBLKS] __initdata;
38
Linus Torvalds1da177e2005-04-16 15:20:36 -070039static __init int setup_node(int pxm)
40{
Yasunori Goto762834e2006-06-23 02:03:19 -070041 return acpi_map_pxm_to_node(pxm);
Linus Torvalds1da177e2005-04-16 15:20:36 -070042}
43
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070044static __init int conflicting_memblks(unsigned long start, unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -070045{
46 int i;
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070047 for (i = 0; i < num_node_memblks; i++) {
48 struct bootnode *nd = &node_memblk_range[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 if (nd->start == nd->end)
50 continue;
51 if (nd->end > start && nd->start < end)
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070052 return memblk_nodeid[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070053 if (nd->end == end && nd->start == start)
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070054 return memblk_nodeid[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070055 }
56 return -1;
57}
58
59static __init void cutoff_node(int i, unsigned long start, unsigned long end)
60{
Andi Kleenabe059e2006-03-25 16:29:12 +010061 struct bootnode *nd = &nodes[i];
Andi Kleen68a3a7f2006-04-07 19:49:18 +020062
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 if (nd->start < start) {
64 nd->start = start;
65 if (nd->end < nd->start)
66 nd->start = nd->end;
67 }
68 if (nd->end > end) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070069 nd->end = end;
70 if (nd->start > nd->end)
71 nd->start = nd->end;
72 }
73}
74
75static __init void bad_srat(void)
76{
Andi Kleen2bce2b52005-09-12 18:49:25 +020077 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 printk(KERN_ERR "SRAT: SRAT not used.\n");
79 acpi_numa = -1;
Andi Kleen2bce2b52005-09-12 18:49:25 +020080 for (i = 0; i < MAX_LOCAL_APIC; i++)
81 apicid_to_node[i] = NUMA_NO_NODE;
Andi Kleen68a3a7f2006-04-07 19:49:18 +020082 for (i = 0; i < MAX_NUMNODES; i++)
83 nodes_add[i].start = nodes[i].end = 0;
Mel Gorman5cb248a2006-09-27 01:49:52 -070084 remove_all_active_ranges();
Linus Torvalds1da177e2005-04-16 15:20:36 -070085}
86
87static __init inline int srat_disabled(void)
88{
89 return numa_off || acpi_numa < 0;
90}
91
92/* Callback for SLIT parsing */
93void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
94{
Yinghai Luf302a5b2008-07-10 20:36:37 -070095 unsigned length;
96 unsigned long phys;
97
98 length = slit->header.length;
99 phys = find_e820_area(0, max_pfn_mapped<<PAGE_SHIFT, length,
100 PAGE_SIZE);
101
102 if (phys == -1L)
103 panic(" Can not save slit!\n");
104
105 acpi_slit = __va(phys);
106 memcpy(acpi_slit, slit, length);
107 reserve_early(phys, phys + length, "ACPI SLIT");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108}
109
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800110/* Callback for Proximity Domain -> x2APIC mapping */
111void __init
112acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
113{
114 int pxm, node;
115 int apic_id;
116
117 if (srat_disabled())
118 return;
119 if (pa->header.length < sizeof(struct acpi_srat_x2apic_cpu_affinity)) {
120 bad_srat();
121 return;
122 }
123 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
124 return;
125 pxm = pa->proximity_domain;
126 node = setup_node(pxm);
127 if (node < 0) {
128 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
129 bad_srat();
130 return;
131 }
132
133 apic_id = pa->apic_id;
134 apicid_to_node[apic_id] = node;
Jack Steinerdc098552009-04-17 09:22:42 -0500135 node_set(node, cpu_nodes_parsed);
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800136 acpi_numa = 1;
137 printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
138 pxm, apic_id, node);
139}
140
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141/* Callback for Proximity Domain -> LAPIC mapping */
142void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300143acpi_numa_processor_affinity_init(struct acpi_srat_cpu_affinity *pa)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144{
145 int pxm, node;
travis@sgi.comef970012008-01-30 13:33:10 +0100146 int apic_id;
147
Andi Kleend22fe802006-02-03 21:51:26 +0100148 if (srat_disabled())
149 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300150 if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
Andi Kleenfad79062006-05-15 18:19:44 +0200151 bad_srat();
Andi Kleend22fe802006-02-03 21:51:26 +0100152 return;
153 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300154 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300156 pxm = pa->proximity_domain_lo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 node = setup_node(pxm);
158 if (node < 0) {
159 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
160 bad_srat();
161 return;
162 }
Yinghai Lubeafe912008-02-16 23:00:22 -0800163
Jack Steiner2e420602008-09-23 15:37:13 -0500164 if (get_uv_system_type() >= UV_X2APIC)
Jack Steinera65d1d62008-03-28 14:12:08 -0500165 apic_id = (pa->apic_id << 8) | pa->local_sapic_eid;
166 else
167 apic_id = pa->apic_id;
travis@sgi.comef970012008-01-30 13:33:10 +0100168 apicid_to_node[apic_id] = node;
Jack Steinerdc098552009-04-17 09:22:42 -0500169 node_set(node, cpu_nodes_parsed);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170 acpi_numa = 1;
Andi Kleen0b07e982005-09-12 18:49:24 +0200171 printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
travis@sgi.comef970012008-01-30 13:33:10 +0100172 pxm, apic_id, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173}
174
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700175#ifdef CONFIG_MEMORY_HOTPLUG_SPARSE
176static inline int save_add_info(void) {return 1;}
177#else
178static inline int save_add_info(void) {return 0;}
179#endif
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200180/*
Yinghai Lu888a5892009-05-15 13:59:37 -0700181 * Update nodes_add[]
182 * This code supports one contiguous hot add area per node
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200183 */
Yinghai Lu888a5892009-05-15 13:59:37 -0700184static void __init
185update_nodes_add(int node, unsigned long start, unsigned long end)
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200186{
187 unsigned long s_pfn = start >> PAGE_SHIFT;
188 unsigned long e_pfn = end >> PAGE_SHIFT;
Yinghai Lu888a5892009-05-15 13:59:37 -0700189 int changed = 0;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200190 struct bootnode *nd = &nodes_add[node];
191
192 /* I had some trouble with strange memory hotadd regions breaking
193 the boot. Be very strict here and reject anything unexpected.
194 If you want working memory hotadd write correct SRATs.
195
196 The node size check is a basic sanity check to guard against
197 mistakes */
198 if ((signed long)(end - start) < NODE_MIN_SIZE) {
199 printk(KERN_ERR "SRAT: Hotplug area too small\n");
Yinghai Lu888a5892009-05-15 13:59:37 -0700200 return;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200201 }
202
203 /* This check might be a bit too strict, but I'm keeping it for now. */
Mel Gorman5cb248a2006-09-27 01:49:52 -0700204 if (absent_pages_in_range(s_pfn, e_pfn) != e_pfn - s_pfn) {
Mel Gorman9c7cd682006-09-27 01:49:58 -0700205 printk(KERN_ERR
206 "SRAT: Hotplug area %lu -> %lu has existing memory\n",
207 s_pfn, e_pfn);
Yinghai Lu888a5892009-05-15 13:59:37 -0700208 return;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200209 }
210
211 /* Looks good */
212
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200213 if (nd->start == nd->end) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300214 nd->start = start;
215 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200216 changed = 1;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300217 } else {
218 if (nd->start == end) {
219 nd->start = start;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200220 changed = 1;
221 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300222 if (nd->end == start) {
223 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200224 changed = 1;
225 }
226 if (!changed)
227 printk(KERN_ERR "SRAT: Hotplug zone not continuous. Partly ignored\n");
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300228 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200229
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200230 if (changed)
Yinghai Lu888a5892009-05-15 13:59:37 -0700231 printk(KERN_INFO "SRAT: hot plug zone found %Lx - %Lx\n",
232 nd->start, nd->end);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200233}
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200234
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
236void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300237acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *ma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238{
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200239 struct bootnode *nd, oldnode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240 unsigned long start, end;
241 int node, pxm;
242 int i;
243
Andi Kleend22fe802006-02-03 21:51:26 +0100244 if (srat_disabled())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300246 if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
Andi Kleend22fe802006-02-03 21:51:26 +0100247 bad_srat();
248 return;
249 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300250 if ((ma->flags & ACPI_SRAT_MEM_ENABLED) == 0)
Andi Kleend22fe802006-02-03 21:51:26 +0100251 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300252
253 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) && !save_add_info())
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200254 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300255 start = ma->base_address;
256 end = start + ma->length;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 pxm = ma->proximity_domain;
258 node = setup_node(pxm);
259 if (node < 0) {
260 printk(KERN_ERR "SRAT: Too many proximity domains.\n");
261 bad_srat();
262 return;
263 }
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700264 i = conflicting_memblks(start, end);
Andi Kleen05d1fa42005-09-12 18:49:24 +0200265 if (i == node) {
266 printk(KERN_WARNING
267 "SRAT: Warning: PXM %d (%lx-%lx) overlaps with itself (%Lx-%Lx)\n",
268 pxm, start, end, nodes[i].start, nodes[i].end);
269 } else if (i >= 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 printk(KERN_ERR
Andi Kleen05d1fa42005-09-12 18:49:24 +0200271 "SRAT: PXM %d (%lx-%lx) overlaps with PXM %d (%Lx-%Lx)\n",
272 pxm, start, end, node_to_pxm(i),
273 nodes[i].start, nodes[i].end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 bad_srat();
275 return;
276 }
277 nd = &nodes[node];
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200278 oldnode = *nd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 if (!node_test_and_set(node, nodes_parsed)) {
280 nd->start = start;
281 nd->end = end;
282 } else {
283 if (start < nd->start)
284 nd->start = start;
285 if (nd->end < end)
286 nd->end = end;
287 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200288
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700289 printk(KERN_INFO "SRAT: Node %u PXM %u %lx-%lx\n", node, pxm,
290 start, end);
291 e820_register_active_regions(node, start >> PAGE_SHIFT,
292 end >> PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200293
Yinghai Lu888a5892009-05-15 13:59:37 -0700294 if (ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) {
295 update_nodes_add(node, start, end);
296 /* restore nodes[node] */
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200297 *nd = oldnode;
298 if ((nd->start | nd->end) == 0)
299 node_clear(node, nodes_parsed);
300 }
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700301
302 node_memblk_range[num_node_memblks].start = start;
303 node_memblk_range[num_node_memblks].end = end;
304 memblk_nodeid[num_node_memblks] = node;
305 num_node_memblks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306}
307
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100308/* Sanity check to catch more bad SRATs (they are amazingly common).
309 Make sure the PXMs cover all memory. */
David Rientjes3484d792007-07-21 17:10:32 +0200310static int __init nodes_cover_memory(const struct bootnode *nodes)
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100311{
312 int i;
313 unsigned long pxmram, e820ram;
314
315 pxmram = 0;
316 for_each_node_mask(i, nodes_parsed) {
317 unsigned long s = nodes[i].start >> PAGE_SHIFT;
318 unsigned long e = nodes[i].end >> PAGE_SHIFT;
319 pxmram += e - s;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700320 pxmram -= absent_pages_in_range(s, e);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200321 if ((long)pxmram < 0)
322 pxmram = 0;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100323 }
324
Yinghai Lub37ab912009-05-08 00:36:44 -0700325 e820ram = max_pfn - (e820_hole_size(0, max_pfn<<PAGE_SHIFT)>>PAGE_SHIFT);
Yinghai Lu0964b052009-05-08 00:37:34 -0700326 /* We seem to lose 3 pages somewhere. Allow 1M of slack. */
327 if ((long)(e820ram - pxmram) >= (1<<(20 - PAGE_SHIFT))) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100328 printk(KERN_ERR
329 "SRAT: PXMs only cover %luMB of your %luMB e820 RAM. Not used.\n",
330 (pxmram << PAGE_SHIFT) >> 20,
331 (e820ram << PAGE_SHIFT) >> 20);
332 return 0;
333 }
334 return 1;
335}
336
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337void __init acpi_numa_arch_fixup(void) {}
338
339/* Use the information discovered above to actually set up the nodes. */
340int __init acpi_scan_nodes(unsigned long start, unsigned long end)
341{
342 int i;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100343
David Rientjesae2c6dc2007-07-21 17:09:56 +0200344 if (acpi_numa <= 0)
345 return -1;
346
Andi Kleen9391a3f2006-02-03 21:51:17 +0100347 /* First clean up the node list */
Yinghai Lu7c437692009-05-15 13:59:37 -0700348 for (i = 0; i < MAX_NUMNODES; i++)
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300349 cutoff_node(i, start, end);
Andi Kleen9391a3f2006-02-03 21:51:17 +0100350
David Rientjes3484d792007-07-21 17:10:32 +0200351 if (!nodes_cover_memory(nodes)) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100352 bad_srat();
353 return -1;
354 }
355
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700356 memnode_shift = compute_hash_shift(node_memblk_range, num_node_memblks,
357 memblk_nodeid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358 if (memnode_shift < 0) {
359 printk(KERN_ERR
360 "SRAT: No NUMA node hash function found. Contact maintainer\n");
361 bad_srat();
362 return -1;
363 }
Andi Kleene58e0d02005-09-12 18:49:25 +0200364
Jack Steinerdc098552009-04-17 09:22:42 -0500365 /* Account for nodes with cpus and no memory */
366 nodes_or(node_possible_map, nodes_parsed, cpu_nodes_parsed);
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200367
Andi Kleene58e0d02005-09-12 18:49:25 +0200368 /* Finally register nodes */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200369 for_each_node_mask(i, node_possible_map)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Andi Kleena8062232006-04-07 19:49:21 +0200371 /* Try again in case setup_node_bootmem missed one due
372 to missing bootmem */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200373 for_each_node_mask(i, node_possible_map)
Andi Kleena8062232006-04-07 19:49:21 +0200374 if (!node_online(i))
375 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
376
Mike Travis168ef542008-12-16 17:34:01 -0800377 for (i = 0; i < nr_cpu_ids; i++) {
Mike Travis0164fe12008-01-30 13:33:21 +0100378 int node = early_cpu_to_node(i);
379
travis@sgi.com834beda2008-01-30 13:33:21 +0100380 if (node == NUMA_NO_NODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381 continue;
Yinghai Lu7c437692009-05-15 13:59:37 -0700382 if (!node_online(node))
Mike Travis23ca4bb2008-05-12 21:21:12 +0200383 numa_clear_node(i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384 }
385 numa_init_array();
386 return 0;
387}
388
David Rientjes3484d792007-07-21 17:10:32 +0200389#ifdef CONFIG_NUMA_EMU
travis@sgi.comef970012008-01-30 13:33:10 +0100390static int fake_node_to_pxm_map[MAX_NUMNODES] __initdata = {
391 [0 ... MAX_NUMNODES-1] = PXM_INVAL
392};
travis@sgi.com602a54a2008-01-30 13:33:21 +0100393static s16 fake_apicid_to_node[MAX_LOCAL_APIC] __initdata = {
travis@sgi.comef970012008-01-30 13:33:10 +0100394 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
395};
David Rientjes3484d792007-07-21 17:10:32 +0200396static int __init find_node_by_addr(unsigned long addr)
397{
398 int ret = NUMA_NO_NODE;
399 int i;
400
401 for_each_node_mask(i, nodes_parsed) {
402 /*
403 * Find the real node that this emulated node appears on. For
404 * the sake of simplicity, we only use a real node's starting
405 * address to determine which emulated node it appears on.
406 */
407 if (addr >= nodes[i].start && addr < nodes[i].end) {
408 ret = i;
409 break;
410 }
411 }
Minoru Usui9a1b62f2008-01-30 13:33:35 +0100412 return ret;
David Rientjes3484d792007-07-21 17:10:32 +0200413}
414
415/*
416 * In NUMA emulation, we need to setup proximity domain (_PXM) to node ID
417 * mappings that respect the real ACPI topology but reflect our emulated
418 * environment. For each emulated node, we find which real node it appears on
419 * and create PXM to NID mappings for those fake nodes which mirror that
420 * locality. SLIT will now represent the correct distances between emulated
421 * nodes as a result of the real topology.
422 */
423void __init acpi_fake_nodes(const struct bootnode *fake_nodes, int num_nodes)
424{
David Rientjes08705b82007-07-21 17:10:33 +0200425 int i, j;
David Rientjes3484d792007-07-21 17:10:32 +0200426
427 printk(KERN_INFO "Faking PXM affinity for fake nodes on real "
428 "topology.\n");
429 for (i = 0; i < num_nodes; i++) {
430 int nid, pxm;
431
432 nid = find_node_by_addr(fake_nodes[i].start);
433 if (nid == NUMA_NO_NODE)
434 continue;
435 pxm = node_to_pxm(nid);
436 if (pxm == PXM_INVAL)
437 continue;
438 fake_node_to_pxm_map[i] = pxm;
David Rientjes08705b82007-07-21 17:10:33 +0200439 /*
440 * For each apicid_to_node mapping that exists for this real
441 * node, it must now point to the fake node ID.
442 */
443 for (j = 0; j < MAX_LOCAL_APIC; j++)
444 if (apicid_to_node[j] == nid)
445 fake_apicid_to_node[j] = i;
David Rientjes3484d792007-07-21 17:10:32 +0200446 }
447 for (i = 0; i < num_nodes; i++)
448 __acpi_map_pxm_to_node(fake_node_to_pxm_map[i], i);
David Rientjes08705b82007-07-21 17:10:33 +0200449 memcpy(apicid_to_node, fake_apicid_to_node, sizeof(apicid_to_node));
David Rientjes3484d792007-07-21 17:10:32 +0200450
451 nodes_clear(nodes_parsed);
452 for (i = 0; i < num_nodes; i++)
453 if (fake_nodes[i].start != fake_nodes[i].end)
454 node_set(i, nodes_parsed);
455 WARN_ON(!nodes_cover_memory(fake_nodes));
456}
457
458static int null_slit_node_compare(int a, int b)
459{
460 return node_to_pxm(a) == node_to_pxm(b);
461}
462#else
463static int null_slit_node_compare(int a, int b)
464{
465 return a == b;
466}
467#endif /* CONFIG_NUMA_EMU */
468
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469int __node_distance(int a, int b)
470{
471 int index;
472
473 if (!acpi_slit)
David Rientjes3484d792007-07-21 17:10:32 +0200474 return null_slit_node_compare(a, b) ? LOCAL_DISTANCE :
475 REMOTE_DISTANCE;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300476 index = acpi_slit->locality_count * node_to_pxm(a);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 return acpi_slit->entry[index + node_to_pxm(b)];
478}
479
480EXPORT_SYMBOL(__node_distance);
Keith Mannthey4942e992006-09-30 23:27:06 -0700481
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200482#if defined(CONFIG_MEMORY_HOTPLUG_SPARSE) || defined(CONFIG_ACPI_HOTPLUG_MEMORY)
Keith Mannthey4942e992006-09-30 23:27:06 -0700483int memory_add_physaddr_to_nid(u64 start)
484{
485 int i, ret = 0;
486
487 for_each_node(i)
488 if (nodes_add[i].start <= start && nodes_add[i].end > start)
489 ret = i;
490
491 return ret;
492}
Keith Mannthey8c2676a2006-09-30 23:27:07 -0700493EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200494#endif