blob: 01765955baaf66922ad70a959c9875f60fcad56e [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];
Andi Kleen68a3a7f2006-04-07 19:49:18 +020034static int found_add_area __initdata;
Andi Kleenfad79062006-05-15 18:19:44 +020035int hotadd_percent __initdata = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070036
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070037static int num_node_memblks __initdata;
38static struct bootnode node_memblk_range[NR_NODE_MEMBLKS] __initdata;
39static int memblk_nodeid[NR_NODE_MEMBLKS] __initdata;
40
Andi Kleen9391a3f2006-02-03 21:51:17 +010041/* Too small nodes confuse the VM badly. Usually they result
42 from BIOS bugs. */
43#define NODE_MIN_SIZE (4*1024*1024)
44
Linus Torvalds1da177e2005-04-16 15:20:36 -070045static __init int setup_node(int pxm)
46{
Yasunori Goto762834e2006-06-23 02:03:19 -070047 return acpi_map_pxm_to_node(pxm);
Linus Torvalds1da177e2005-04-16 15:20:36 -070048}
49
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070050static __init int conflicting_memblks(unsigned long start, unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -070051{
52 int i;
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070053 for (i = 0; i < num_node_memblks; i++) {
54 struct bootnode *nd = &node_memblk_range[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070055 if (nd->start == nd->end)
56 continue;
57 if (nd->end > start && nd->start < end)
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070058 return memblk_nodeid[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 if (nd->end == end && nd->start == start)
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -070060 return memblk_nodeid[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070061 }
62 return -1;
63}
64
65static __init void cutoff_node(int i, unsigned long start, unsigned long end)
66{
Andi Kleenabe059e2006-03-25 16:29:12 +010067 struct bootnode *nd = &nodes[i];
Andi Kleen68a3a7f2006-04-07 19:49:18 +020068
69 if (found_add_area)
70 return;
71
Linus Torvalds1da177e2005-04-16 15:20:36 -070072 if (nd->start < start) {
73 nd->start = start;
74 if (nd->end < nd->start)
75 nd->start = nd->end;
76 }
77 if (nd->end > end) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 nd->end = end;
79 if (nd->start > nd->end)
80 nd->start = nd->end;
81 }
82}
83
84static __init void bad_srat(void)
85{
Andi Kleen2bce2b52005-09-12 18:49:25 +020086 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 printk(KERN_ERR "SRAT: SRAT not used.\n");
88 acpi_numa = -1;
Andi Kleenfad79062006-05-15 18:19:44 +020089 found_add_area = 0;
Andi Kleen2bce2b52005-09-12 18:49:25 +020090 for (i = 0; i < MAX_LOCAL_APIC; i++)
91 apicid_to_node[i] = NUMA_NO_NODE;
Andi Kleen68a3a7f2006-04-07 19:49:18 +020092 for (i = 0; i < MAX_NUMNODES; i++)
93 nodes_add[i].start = nodes[i].end = 0;
Mel Gorman5cb248a2006-09-27 01:49:52 -070094 remove_all_active_ranges();
Linus Torvalds1da177e2005-04-16 15:20:36 -070095}
96
97static __init inline int srat_disabled(void)
98{
99 return numa_off || acpi_numa < 0;
100}
101
102/* Callback for SLIT parsing */
103void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
104{
Yinghai Luf302a5bb2008-07-10 20:36:37 -0700105 unsigned length;
106 unsigned long phys;
107
108 length = slit->header.length;
109 phys = find_e820_area(0, max_pfn_mapped<<PAGE_SHIFT, length,
110 PAGE_SIZE);
111
112 if (phys == -1L)
113 panic(" Can not save slit!\n");
114
115 acpi_slit = __va(phys);
116 memcpy(acpi_slit, slit, length);
117 reserve_early(phys, phys + length, "ACPI SLIT");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118}
119
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800120/* Callback for Proximity Domain -> x2APIC mapping */
121void __init
122acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
123{
124 int pxm, node;
125 int apic_id;
126
127 if (srat_disabled())
128 return;
129 if (pa->header.length < sizeof(struct acpi_srat_x2apic_cpu_affinity)) {
130 bad_srat();
131 return;
132 }
133 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
134 return;
135 pxm = pa->proximity_domain;
136 node = setup_node(pxm);
137 if (node < 0) {
138 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
139 bad_srat();
140 return;
141 }
142
143 apic_id = pa->apic_id;
144 apicid_to_node[apic_id] = node;
Jack Steinerdc098552009-04-17 09:22:42 -0500145 node_set(node, cpu_nodes_parsed);
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800146 acpi_numa = 1;
147 printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
148 pxm, apic_id, node);
149}
150
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151/* Callback for Proximity Domain -> LAPIC mapping */
152void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300153acpi_numa_processor_affinity_init(struct acpi_srat_cpu_affinity *pa)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154{
155 int pxm, node;
travis@sgi.comef970012008-01-30 13:33:10 +0100156 int apic_id;
157
Andi Kleend22fe802006-02-03 21:51:26 +0100158 if (srat_disabled())
159 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300160 if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
Andi Kleenfad79062006-05-15 18:19:44 +0200161 bad_srat();
Andi Kleend22fe802006-02-03 21:51:26 +0100162 return;
163 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300164 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300166 pxm = pa->proximity_domain_lo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 node = setup_node(pxm);
168 if (node < 0) {
169 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
170 bad_srat();
171 return;
172 }
Yinghai Lubeafe912008-02-16 23:00:22 -0800173
Jack Steiner2e420602008-09-23 15:37:13 -0500174 if (get_uv_system_type() >= UV_X2APIC)
Jack Steinera65d1d62008-03-28 14:12:08 -0500175 apic_id = (pa->apic_id << 8) | pa->local_sapic_eid;
176 else
177 apic_id = pa->apic_id;
travis@sgi.comef970012008-01-30 13:33:10 +0100178 apicid_to_node[apic_id] = node;
Jack Steinerdc098552009-04-17 09:22:42 -0500179 node_set(node, cpu_nodes_parsed);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180 acpi_numa = 1;
Andi Kleen0b07e982005-09-12 18:49:24 +0200181 printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
travis@sgi.comef970012008-01-30 13:33:10 +0100182 pxm, apic_id, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183}
184
Ingo Molnara4928cf2008-04-23 13:20:56 +0200185static int update_end_of_memory(unsigned long end) {return -1;}
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700186static int hotadd_enough_memory(struct bootnode *nd) {return 1;}
187#ifdef CONFIG_MEMORY_HOTPLUG_SPARSE
188static inline int save_add_info(void) {return 1;}
189#else
190static inline int save_add_info(void) {return 0;}
191#endif
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200192/*
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700193 * Update nodes_add and decide if to include add are in the zone.
Joe Perchesab4a5742008-01-30 13:31:42 +0100194 * Both SPARSE and RESERVE need nodes_add information.
Simon Arlott676b1852007-10-20 01:25:36 +0200195 * This code supports one contiguous hot add area per node.
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200196 */
Sam Ravnborgd01b9ad2008-02-17 13:22:58 +0100197static int __init
198reserve_hotadd(int node, unsigned long start, unsigned long end)
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200199{
200 unsigned long s_pfn = start >> PAGE_SHIFT;
201 unsigned long e_pfn = end >> PAGE_SHIFT;
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700202 int ret = 0, changed = 0;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200203 struct bootnode *nd = &nodes_add[node];
204
205 /* I had some trouble with strange memory hotadd regions breaking
206 the boot. Be very strict here and reject anything unexpected.
207 If you want working memory hotadd write correct SRATs.
208
209 The node size check is a basic sanity check to guard against
210 mistakes */
211 if ((signed long)(end - start) < NODE_MIN_SIZE) {
212 printk(KERN_ERR "SRAT: Hotplug area too small\n");
213 return -1;
214 }
215
216 /* This check might be a bit too strict, but I'm keeping it for now. */
Mel Gorman5cb248a2006-09-27 01:49:52 -0700217 if (absent_pages_in_range(s_pfn, e_pfn) != e_pfn - s_pfn) {
Mel Gorman9c7cd682006-09-27 01:49:58 -0700218 printk(KERN_ERR
219 "SRAT: Hotplug area %lu -> %lu has existing memory\n",
220 s_pfn, e_pfn);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200221 return -1;
222 }
223
224 if (!hotadd_enough_memory(&nodes_add[node])) {
225 printk(KERN_ERR "SRAT: Hotplug area too large\n");
226 return -1;
227 }
228
229 /* Looks good */
230
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200231 if (nd->start == nd->end) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300232 nd->start = start;
233 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200234 changed = 1;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300235 } else {
236 if (nd->start == end) {
237 nd->start = start;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200238 changed = 1;
239 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300240 if (nd->end == start) {
241 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200242 changed = 1;
243 }
244 if (!changed)
245 printk(KERN_ERR "SRAT: Hotplug zone not continuous. Partly ignored\n");
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300246 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200247
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700248 ret = update_end_of_memory(nd->end);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200249
250 if (changed)
251 printk(KERN_INFO "SRAT: hot plug zone found %Lx - %Lx\n", nd->start, nd->end);
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700252 return ret;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200253}
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200254
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
256void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300257acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *ma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258{
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200259 struct bootnode *nd, oldnode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 unsigned long start, end;
261 int node, pxm;
262 int i;
263
Andi Kleend22fe802006-02-03 21:51:26 +0100264 if (srat_disabled())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300266 if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
Andi Kleend22fe802006-02-03 21:51:26 +0100267 bad_srat();
268 return;
269 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300270 if ((ma->flags & ACPI_SRAT_MEM_ENABLED) == 0)
Andi Kleend22fe802006-02-03 21:51:26 +0100271 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300272
273 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) && !save_add_info())
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200274 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300275 start = ma->base_address;
276 end = start + ma->length;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700277 pxm = ma->proximity_domain;
278 node = setup_node(pxm);
279 if (node < 0) {
280 printk(KERN_ERR "SRAT: Too many proximity domains.\n");
281 bad_srat();
282 return;
283 }
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700284 i = conflicting_memblks(start, end);
Andi Kleen05d1fa42005-09-12 18:49:24 +0200285 if (i == node) {
286 printk(KERN_WARNING
287 "SRAT: Warning: PXM %d (%lx-%lx) overlaps with itself (%Lx-%Lx)\n",
288 pxm, start, end, nodes[i].start, nodes[i].end);
289 } else if (i >= 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290 printk(KERN_ERR
Andi Kleen05d1fa42005-09-12 18:49:24 +0200291 "SRAT: PXM %d (%lx-%lx) overlaps with PXM %d (%Lx-%Lx)\n",
292 pxm, start, end, node_to_pxm(i),
293 nodes[i].start, nodes[i].end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294 bad_srat();
295 return;
296 }
297 nd = &nodes[node];
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200298 oldnode = *nd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299 if (!node_test_and_set(node, nodes_parsed)) {
300 nd->start = start;
301 nd->end = end;
302 } else {
303 if (start < nd->start)
304 nd->start = start;
305 if (nd->end < end)
306 nd->end = end;
307 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200308
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700309 printk(KERN_INFO "SRAT: Node %u PXM %u %lx-%lx\n", node, pxm,
310 start, end);
311 e820_register_active_regions(node, start >> PAGE_SHIFT,
312 end >> PAGE_SHIFT);
Mel Gormanfb014392006-09-27 01:49:59 -0700313 push_node_boundaries(node, nd->start >> PAGE_SHIFT,
314 nd->end >> PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200315
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300316 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) &&
317 (reserve_hotadd(node, start, end) < 0)) {
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200318 /* Ignore hotadd region. Undo damage */
319 printk(KERN_NOTICE "SRAT: Hotplug region ignored\n");
320 *nd = oldnode;
321 if ((nd->start | nd->end) == 0)
322 node_clear(node, nodes_parsed);
323 }
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700324
325 node_memblk_range[num_node_memblks].start = start;
326 node_memblk_range[num_node_memblks].end = end;
327 memblk_nodeid[num_node_memblks] = node;
328 num_node_memblks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329}
330
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100331/* Sanity check to catch more bad SRATs (they are amazingly common).
332 Make sure the PXMs cover all memory. */
David Rientjes3484d792007-07-21 17:10:32 +0200333static int __init nodes_cover_memory(const struct bootnode *nodes)
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100334{
335 int i;
336 unsigned long pxmram, e820ram;
337
338 pxmram = 0;
339 for_each_node_mask(i, nodes_parsed) {
340 unsigned long s = nodes[i].start >> PAGE_SHIFT;
341 unsigned long e = nodes[i].end >> PAGE_SHIFT;
342 pxmram += e - s;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700343 pxmram -= absent_pages_in_range(s, e);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200344 if ((long)pxmram < 0)
345 pxmram = 0;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100346 }
347
Yinghai Luc987d122008-06-24 22:14:09 -0700348 e820ram = max_pfn - absent_pages_in_range(0, max_pfn);
Andi Kleenfdb9df92006-02-16 23:42:13 +0100349 /* We seem to lose 3 pages somewhere. Allow a bit of slack. */
350 if ((long)(e820ram - pxmram) >= 1*1024*1024) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100351 printk(KERN_ERR
352 "SRAT: PXMs only cover %luMB of your %luMB e820 RAM. Not used.\n",
353 (pxmram << PAGE_SHIFT) >> 20,
354 (e820ram << PAGE_SHIFT) >> 20);
355 return 0;
356 }
357 return 1;
358}
359
Sam Ravnborg1e296f52008-01-30 13:33:37 +0100360static void __init unparse_node(int node)
Andi Kleen9391a3f2006-02-03 21:51:17 +0100361{
362 int i;
363 node_clear(node, nodes_parsed);
David Rientjes7eccf7b2009-05-05 12:50:02 -0700364 node_clear(node, cpu_nodes_parsed);
Andi Kleen9391a3f2006-02-03 21:51:17 +0100365 for (i = 0; i < MAX_LOCAL_APIC; i++) {
366 if (apicid_to_node[i] == node)
367 apicid_to_node[i] = NUMA_NO_NODE;
368 }
369}
370
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371void __init acpi_numa_arch_fixup(void) {}
372
373/* Use the information discovered above to actually set up the nodes. */
374int __init acpi_scan_nodes(unsigned long start, unsigned long end)
375{
376 int i;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100377
David Rientjesae2c6dc2007-07-21 17:09:56 +0200378 if (acpi_numa <= 0)
379 return -1;
380
Andi Kleen9391a3f2006-02-03 21:51:17 +0100381 /* First clean up the node list */
382 for (i = 0; i < MAX_NUMNODES; i++) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300383 cutoff_node(i, start, end);
Mike Travis693e3c52008-01-30 13:33:14 +0100384 /*
385 * don't confuse VM with a node that doesn't have the
386 * minimum memory.
387 */
388 if (nodes[i].end &&
389 (nodes[i].end - nodes[i].start) < NODE_MIN_SIZE) {
Andi Kleen9391a3f2006-02-03 21:51:17 +0100390 unparse_node(i);
Daniel Yeisley0d015322006-05-30 22:47:57 +0200391 node_set_offline(i);
392 }
Andi Kleen9391a3f2006-02-03 21:51:17 +0100393 }
394
David Rientjes3484d792007-07-21 17:10:32 +0200395 if (!nodes_cover_memory(nodes)) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100396 bad_srat();
397 return -1;
398 }
399
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700400 memnode_shift = compute_hash_shift(node_memblk_range, num_node_memblks,
401 memblk_nodeid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402 if (memnode_shift < 0) {
403 printk(KERN_ERR
404 "SRAT: No NUMA node hash function found. Contact maintainer\n");
405 bad_srat();
406 return -1;
407 }
Andi Kleene58e0d02005-09-12 18:49:25 +0200408
Jack Steinerdc098552009-04-17 09:22:42 -0500409 /* Account for nodes with cpus and no memory */
410 nodes_or(node_possible_map, nodes_parsed, cpu_nodes_parsed);
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200411
Andi Kleene58e0d02005-09-12 18:49:25 +0200412 /* Finally register nodes */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200413 for_each_node_mask(i, node_possible_map)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Andi Kleena8062232006-04-07 19:49:21 +0200415 /* Try again in case setup_node_bootmem missed one due
416 to missing bootmem */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200417 for_each_node_mask(i, node_possible_map)
Andi Kleena8062232006-04-07 19:49:21 +0200418 if (!node_online(i))
419 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
420
Mike Travis168ef542008-12-16 17:34:01 -0800421 for (i = 0; i < nr_cpu_ids; i++) {
Mike Travis0164fe12008-01-30 13:33:21 +0100422 int node = early_cpu_to_node(i);
423
travis@sgi.com834beda12008-01-30 13:33:21 +0100424 if (node == NUMA_NO_NODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425 continue;
travis@sgi.com834beda12008-01-30 13:33:21 +0100426 if (!node_isset(node, node_possible_map))
Mike Travis23ca4bb2008-05-12 21:21:12 +0200427 numa_clear_node(i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428 }
429 numa_init_array();
430 return 0;
431}
432
David Rientjes3484d792007-07-21 17:10:32 +0200433#ifdef CONFIG_NUMA_EMU
travis@sgi.comef970012008-01-30 13:33:10 +0100434static int fake_node_to_pxm_map[MAX_NUMNODES] __initdata = {
435 [0 ... MAX_NUMNODES-1] = PXM_INVAL
436};
travis@sgi.com602a54a2008-01-30 13:33:21 +0100437static s16 fake_apicid_to_node[MAX_LOCAL_APIC] __initdata = {
travis@sgi.comef970012008-01-30 13:33:10 +0100438 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
439};
David Rientjes3484d792007-07-21 17:10:32 +0200440static int __init find_node_by_addr(unsigned long addr)
441{
442 int ret = NUMA_NO_NODE;
443 int i;
444
445 for_each_node_mask(i, nodes_parsed) {
446 /*
447 * Find the real node that this emulated node appears on. For
448 * the sake of simplicity, we only use a real node's starting
449 * address to determine which emulated node it appears on.
450 */
451 if (addr >= nodes[i].start && addr < nodes[i].end) {
452 ret = i;
453 break;
454 }
455 }
Minoru Usui9a1b62f2008-01-30 13:33:35 +0100456 return ret;
David Rientjes3484d792007-07-21 17:10:32 +0200457}
458
459/*
460 * In NUMA emulation, we need to setup proximity domain (_PXM) to node ID
461 * mappings that respect the real ACPI topology but reflect our emulated
462 * environment. For each emulated node, we find which real node it appears on
463 * and create PXM to NID mappings for those fake nodes which mirror that
464 * locality. SLIT will now represent the correct distances between emulated
465 * nodes as a result of the real topology.
466 */
467void __init acpi_fake_nodes(const struct bootnode *fake_nodes, int num_nodes)
468{
David Rientjes08705b82007-07-21 17:10:33 +0200469 int i, j;
David Rientjes3484d792007-07-21 17:10:32 +0200470
471 printk(KERN_INFO "Faking PXM affinity for fake nodes on real "
472 "topology.\n");
473 for (i = 0; i < num_nodes; i++) {
474 int nid, pxm;
475
476 nid = find_node_by_addr(fake_nodes[i].start);
477 if (nid == NUMA_NO_NODE)
478 continue;
479 pxm = node_to_pxm(nid);
480 if (pxm == PXM_INVAL)
481 continue;
482 fake_node_to_pxm_map[i] = pxm;
David Rientjes08705b82007-07-21 17:10:33 +0200483 /*
484 * For each apicid_to_node mapping that exists for this real
485 * node, it must now point to the fake node ID.
486 */
487 for (j = 0; j < MAX_LOCAL_APIC; j++)
488 if (apicid_to_node[j] == nid)
489 fake_apicid_to_node[j] = i;
David Rientjes3484d792007-07-21 17:10:32 +0200490 }
491 for (i = 0; i < num_nodes; i++)
492 __acpi_map_pxm_to_node(fake_node_to_pxm_map[i], i);
David Rientjes08705b82007-07-21 17:10:33 +0200493 memcpy(apicid_to_node, fake_apicid_to_node, sizeof(apicid_to_node));
David Rientjes3484d792007-07-21 17:10:32 +0200494
495 nodes_clear(nodes_parsed);
496 for (i = 0; i < num_nodes; i++)
497 if (fake_nodes[i].start != fake_nodes[i].end)
498 node_set(i, nodes_parsed);
499 WARN_ON(!nodes_cover_memory(fake_nodes));
500}
501
502static int null_slit_node_compare(int a, int b)
503{
504 return node_to_pxm(a) == node_to_pxm(b);
505}
506#else
507static int null_slit_node_compare(int a, int b)
508{
509 return a == b;
510}
511#endif /* CONFIG_NUMA_EMU */
512
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200513void __init srat_reserve_add_area(int nodeid)
514{
515 if (found_add_area && nodes_add[nodeid].end) {
516 u64 total_mb;
517
518 printk(KERN_INFO "SRAT: Reserving hot-add memory space "
519 "for node %d at %Lx-%Lx\n",
520 nodeid, nodes_add[nodeid].start, nodes_add[nodeid].end);
521 total_mb = (nodes_add[nodeid].end - nodes_add[nodeid].start)
522 >> PAGE_SHIFT;
523 total_mb *= sizeof(struct page);
524 total_mb >>= 20;
525 printk(KERN_INFO "SRAT: This will cost you %Lu MB of "
526 "pre-allocated memory.\n", (unsigned long long)total_mb);
527 reserve_bootmem_node(NODE_DATA(nodeid), nodes_add[nodeid].start,
Bernhard Walle72a7fe32008-02-07 00:15:17 -0800528 nodes_add[nodeid].end - nodes_add[nodeid].start,
529 BOOTMEM_DEFAULT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200530 }
531}
532
Linus Torvalds1da177e2005-04-16 15:20:36 -0700533int __node_distance(int a, int b)
534{
535 int index;
536
537 if (!acpi_slit)
David Rientjes3484d792007-07-21 17:10:32 +0200538 return null_slit_node_compare(a, b) ? LOCAL_DISTANCE :
539 REMOTE_DISTANCE;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300540 index = acpi_slit->locality_count * node_to_pxm(a);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541 return acpi_slit->entry[index + node_to_pxm(b)];
542}
543
544EXPORT_SYMBOL(__node_distance);
Keith Mannthey4942e992006-09-30 23:27:06 -0700545
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200546#if defined(CONFIG_MEMORY_HOTPLUG_SPARSE) || defined(CONFIG_ACPI_HOTPLUG_MEMORY)
Keith Mannthey4942e992006-09-30 23:27:06 -0700547int memory_add_physaddr_to_nid(u64 start)
548{
549 int i, ret = 0;
550
551 for_each_node(i)
552 if (nodes_add[i].start <= start && nodes_add[i].end > start)
553 ret = i;
554
555 return ret;
556}
Keith Mannthey8c2676a2006-09-30 23:27:07 -0700557EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200558#endif