blob: 1e76bb0a727726134317e9b085dba3d229a43e30 [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>
Linus Torvalds1da177e2005-04-16 15:20:36 -070023
Andi Kleenc31fbb12006-09-26 10:52:33 +020024int acpi_numa __initdata;
25
Linus Torvalds1da177e2005-04-16 15:20:36 -070026static struct acpi_table_slit *acpi_slit;
27
28static nodemask_t nodes_parsed __initdata;
Andi Kleenabe059e2006-03-25 16:29:12 +010029static struct bootnode nodes[MAX_NUMNODES] __initdata;
Keith Mannthey4942e992006-09-30 23:27:06 -070030static struct bootnode nodes_add[MAX_NUMNODES];
Andi Kleen68a3a7f2006-04-07 19:49:18 +020031static int found_add_area __initdata;
Andi Kleenfad79062006-05-15 18:19:44 +020032int hotadd_percent __initdata = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
Andi Kleen9391a3f2006-02-03 21:51:17 +010034/* Too small nodes confuse the VM badly. Usually they result
35 from BIOS bugs. */
36#define NODE_MIN_SIZE (4*1024*1024)
37
Linus Torvalds1da177e2005-04-16 15:20:36 -070038static __init int setup_node(int pxm)
39{
Yasunori Goto762834e2006-06-23 02:03:19 -070040 return acpi_map_pxm_to_node(pxm);
Linus Torvalds1da177e2005-04-16 15:20:36 -070041}
42
43static __init int conflicting_nodes(unsigned long start, unsigned long end)
44{
45 int i;
Andi Kleen4b6a4552005-09-12 18:49:25 +020046 for_each_node_mask(i, nodes_parsed) {
Andi Kleenabe059e2006-03-25 16:29:12 +010047 struct bootnode *nd = &nodes[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070048 if (nd->start == nd->end)
49 continue;
50 if (nd->end > start && nd->start < end)
Andi Kleen05d1fa42005-09-12 18:49:24 +020051 return i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070052 if (nd->end == end && nd->start == start)
Andi Kleen05d1fa42005-09-12 18:49:24 +020053 return i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 }
55 return -1;
56}
57
58static __init void cutoff_node(int i, unsigned long start, unsigned long end)
59{
Andi Kleenabe059e2006-03-25 16:29:12 +010060 struct bootnode *nd = &nodes[i];
Andi Kleen68a3a7f2006-04-07 19:49:18 +020061
62 if (found_add_area)
63 return;
64
Linus Torvalds1da177e2005-04-16 15:20:36 -070065 if (nd->start < start) {
66 nd->start = start;
67 if (nd->end < nd->start)
68 nd->start = nd->end;
69 }
70 if (nd->end > end) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070071 nd->end = end;
72 if (nd->start > nd->end)
73 nd->start = nd->end;
74 }
75}
76
77static __init void bad_srat(void)
78{
Andi Kleen2bce2b52005-09-12 18:49:25 +020079 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070080 printk(KERN_ERR "SRAT: SRAT not used.\n");
81 acpi_numa = -1;
Andi Kleenfad79062006-05-15 18:19:44 +020082 found_add_area = 0;
Andi Kleen2bce2b52005-09-12 18:49:25 +020083 for (i = 0; i < MAX_LOCAL_APIC; i++)
84 apicid_to_node[i] = NUMA_NO_NODE;
Andi Kleen68a3a7f2006-04-07 19:49:18 +020085 for (i = 0; i < MAX_NUMNODES; i++)
86 nodes_add[i].start = nodes[i].end = 0;
Mel Gorman5cb248a2006-09-27 01:49:52 -070087 remove_all_active_ranges();
Linus Torvalds1da177e2005-04-16 15:20:36 -070088}
89
90static __init inline int srat_disabled(void)
91{
92 return numa_off || acpi_numa < 0;
93}
94
Andi Kleen1584b892006-01-11 22:43:42 +010095/*
96 * A lot of BIOS fill in 10 (= no distance) everywhere. This messes
97 * up the NUMA heuristics which wants the local node to have a smaller
98 * distance than the others.
99 * Do some quick checks here and only use the SLIT if it passes.
100 */
101static __init int slit_valid(struct acpi_table_slit *slit)
102{
103 int i, j;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300104 int d = slit->locality_count;
Andi Kleen1584b892006-01-11 22:43:42 +0100105 for (i = 0; i < d; i++) {
106 for (j = 0; j < d; j++) {
107 u8 val = slit->entry[d*i + j];
108 if (i == j) {
109 if (val != 10)
110 return 0;
111 } else if (val <= 10)
112 return 0;
113 }
114 }
115 return 1;
116}
117
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118/* Callback for SLIT parsing */
119void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
120{
Andi Kleen1584b892006-01-11 22:43:42 +0100121 if (!slit_valid(slit)) {
122 printk(KERN_INFO "ACPI: SLIT table looks invalid. Not used.\n");
123 return;
124 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125 acpi_slit = slit;
126}
127
128/* Callback for Proximity Domain -> LAPIC mapping */
129void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300130acpi_numa_processor_affinity_init(struct acpi_srat_cpu_affinity *pa)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131{
132 int pxm, node;
Andi Kleend22fe802006-02-03 21:51:26 +0100133 if (srat_disabled())
134 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300135 if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
Andi Kleenfad79062006-05-15 18:19:44 +0200136 bad_srat();
Andi Kleend22fe802006-02-03 21:51:26 +0100137 return;
138 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300139 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300141 pxm = pa->proximity_domain_lo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 node = setup_node(pxm);
143 if (node < 0) {
144 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
145 bad_srat();
146 return;
147 }
Andi Kleen0b07e982005-09-12 18:49:24 +0200148 apicid_to_node[pa->apic_id] = node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149 acpi_numa = 1;
Andi Kleen0b07e982005-09-12 18:49:24 +0200150 printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
151 pxm, pa->apic_id, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152}
153
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700154#ifdef CONFIG_MEMORY_HOTPLUG_RESERVE
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200155/*
156 * Protect against too large hotadd areas that would fill up memory.
157 */
158static int hotadd_enough_memory(struct bootnode *nd)
159{
160 static unsigned long allocated;
161 static unsigned long last_area_end;
162 unsigned long pages = (nd->end - nd->start) >> PAGE_SHIFT;
163 long mem = pages * sizeof(struct page);
164 unsigned long addr;
165 unsigned long allowed;
166 unsigned long oldpages = pages;
167
168 if (mem < 0)
169 return 0;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700170 allowed = (end_pfn - absent_pages_in_range(0, end_pfn)) * PAGE_SIZE;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200171 allowed = (allowed / 100) * hotadd_percent;
172 if (allocated + mem > allowed) {
Andi Kleenfad79062006-05-15 18:19:44 +0200173 unsigned long range;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200174 /* Give them at least part of their hotadd memory upto hotadd_percent
175 It would be better to spread the limit out
176 over multiple hotplug areas, but that is too complicated
177 right now */
178 if (allocated >= allowed)
179 return 0;
Andi Kleenfad79062006-05-15 18:19:44 +0200180 range = allowed - allocated;
181 pages = (range / PAGE_SIZE);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200182 mem = pages * sizeof(struct page);
Andi Kleenfad79062006-05-15 18:19:44 +0200183 nd->end = nd->start + range;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200184 }
185 /* Not completely fool proof, but a good sanity check */
186 addr = find_e820_area(last_area_end, end_pfn<<PAGE_SHIFT, mem);
187 if (addr == -1UL)
188 return 0;
189 if (pages != oldpages)
190 printk(KERN_NOTICE "SRAT: Hotadd area limited to %lu bytes\n",
191 pages << PAGE_SHIFT);
192 last_area_end = addr + mem;
193 allocated += mem;
194 return 1;
195}
196
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700197static int update_end_of_memory(unsigned long end)
198{
199 found_add_area = 1;
200 if ((end >> PAGE_SHIFT) > end_pfn)
201 end_pfn = end >> PAGE_SHIFT;
202 return 1;
203}
204
205static inline int save_add_info(void)
206{
207 return hotadd_percent > 0;
208}
209#else
keith mannthey926fafe2006-10-21 18:37:01 +0200210int update_end_of_memory(unsigned long end) {return -1;}
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700211static int hotadd_enough_memory(struct bootnode *nd) {return 1;}
212#ifdef CONFIG_MEMORY_HOTPLUG_SPARSE
213static inline int save_add_info(void) {return 1;}
214#else
215static inline int save_add_info(void) {return 0;}
216#endif
217#endif
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200218/*
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700219 * Update nodes_add and decide if to include add are in the zone.
220 * Both SPARSE and RESERVE need nodes_add infomation.
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200221 * This code supports one contigious hot add area per node.
222 */
223static int reserve_hotadd(int node, unsigned long start, unsigned long end)
224{
225 unsigned long s_pfn = start >> PAGE_SHIFT;
226 unsigned long e_pfn = end >> PAGE_SHIFT;
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700227 int ret = 0, changed = 0;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200228 struct bootnode *nd = &nodes_add[node];
229
230 /* I had some trouble with strange memory hotadd regions breaking
231 the boot. Be very strict here and reject anything unexpected.
232 If you want working memory hotadd write correct SRATs.
233
234 The node size check is a basic sanity check to guard against
235 mistakes */
236 if ((signed long)(end - start) < NODE_MIN_SIZE) {
237 printk(KERN_ERR "SRAT: Hotplug area too small\n");
238 return -1;
239 }
240
241 /* This check might be a bit too strict, but I'm keeping it for now. */
Mel Gorman5cb248a2006-09-27 01:49:52 -0700242 if (absent_pages_in_range(s_pfn, e_pfn) != e_pfn - s_pfn) {
Mel Gorman9c7cd682006-09-27 01:49:58 -0700243 printk(KERN_ERR
244 "SRAT: Hotplug area %lu -> %lu has existing memory\n",
245 s_pfn, e_pfn);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200246 return -1;
247 }
248
249 if (!hotadd_enough_memory(&nodes_add[node])) {
250 printk(KERN_ERR "SRAT: Hotplug area too large\n");
251 return -1;
252 }
253
254 /* Looks good */
255
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200256 if (nd->start == nd->end) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300257 nd->start = start;
258 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200259 changed = 1;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300260 } else {
261 if (nd->start == end) {
262 nd->start = start;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200263 changed = 1;
264 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300265 if (nd->end == start) {
266 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200267 changed = 1;
268 }
269 if (!changed)
270 printk(KERN_ERR "SRAT: Hotplug zone not continuous. Partly ignored\n");
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300271 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200272
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700273 ret = update_end_of_memory(nd->end);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200274
275 if (changed)
276 printk(KERN_INFO "SRAT: hot plug zone found %Lx - %Lx\n", nd->start, nd->end);
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700277 return ret;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200278}
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200279
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
281void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300282acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *ma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283{
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200284 struct bootnode *nd, oldnode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 unsigned long start, end;
286 int node, pxm;
287 int i;
288
Andi Kleend22fe802006-02-03 21:51:26 +0100289 if (srat_disabled())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300291 if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
Andi Kleend22fe802006-02-03 21:51:26 +0100292 bad_srat();
293 return;
294 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300295 if ((ma->flags & ACPI_SRAT_MEM_ENABLED) == 0)
Andi Kleend22fe802006-02-03 21:51:26 +0100296 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300297
298 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) && !save_add_info())
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200299 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300300 start = ma->base_address;
301 end = start + ma->length;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700302 pxm = ma->proximity_domain;
303 node = setup_node(pxm);
304 if (node < 0) {
305 printk(KERN_ERR "SRAT: Too many proximity domains.\n");
306 bad_srat();
307 return;
308 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309 i = conflicting_nodes(start, end);
Andi Kleen05d1fa42005-09-12 18:49:24 +0200310 if (i == node) {
311 printk(KERN_WARNING
312 "SRAT: Warning: PXM %d (%lx-%lx) overlaps with itself (%Lx-%Lx)\n",
313 pxm, start, end, nodes[i].start, nodes[i].end);
314 } else if (i >= 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315 printk(KERN_ERR
Andi Kleen05d1fa42005-09-12 18:49:24 +0200316 "SRAT: PXM %d (%lx-%lx) overlaps with PXM %d (%Lx-%Lx)\n",
317 pxm, start, end, node_to_pxm(i),
318 nodes[i].start, nodes[i].end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319 bad_srat();
320 return;
321 }
322 nd = &nodes[node];
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200323 oldnode = *nd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 if (!node_test_and_set(node, nodes_parsed)) {
325 nd->start = start;
326 nd->end = end;
327 } else {
328 if (start < nd->start)
329 nd->start = start;
330 if (nd->end < end)
331 nd->end = end;
332 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200333
Linus Torvalds1da177e2005-04-16 15:20:36 -0700334 printk(KERN_INFO "SRAT: Node %u PXM %u %Lx-%Lx\n", node, pxm,
335 nd->start, nd->end);
Mel Gorman5cb248a2006-09-27 01:49:52 -0700336 e820_register_active_regions(node, nd->start >> PAGE_SHIFT,
337 nd->end >> PAGE_SHIFT);
Mel Gormanfb014392006-09-27 01:49:59 -0700338 push_node_boundaries(node, nd->start >> PAGE_SHIFT,
339 nd->end >> PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200340
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300341 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) &&
342 (reserve_hotadd(node, start, end) < 0)) {
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200343 /* Ignore hotadd region. Undo damage */
344 printk(KERN_NOTICE "SRAT: Hotplug region ignored\n");
345 *nd = oldnode;
346 if ((nd->start | nd->end) == 0)
347 node_clear(node, nodes_parsed);
348 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349}
350
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100351/* Sanity check to catch more bad SRATs (they are amazingly common).
352 Make sure the PXMs cover all memory. */
353static int nodes_cover_memory(void)
354{
355 int i;
356 unsigned long pxmram, e820ram;
357
358 pxmram = 0;
359 for_each_node_mask(i, nodes_parsed) {
360 unsigned long s = nodes[i].start >> PAGE_SHIFT;
361 unsigned long e = nodes[i].end >> PAGE_SHIFT;
362 pxmram += e - s;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700363 pxmram -= absent_pages_in_range(s, e);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200364 if ((long)pxmram < 0)
365 pxmram = 0;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100366 }
367
Mel Gorman5cb248a2006-09-27 01:49:52 -0700368 e820ram = end_pfn - absent_pages_in_range(0, end_pfn);
Andi Kleenfdb9df92006-02-16 23:42:13 +0100369 /* We seem to lose 3 pages somewhere. Allow a bit of slack. */
370 if ((long)(e820ram - pxmram) >= 1*1024*1024) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100371 printk(KERN_ERR
372 "SRAT: PXMs only cover %luMB of your %luMB e820 RAM. Not used.\n",
373 (pxmram << PAGE_SHIFT) >> 20,
374 (e820ram << PAGE_SHIFT) >> 20);
375 return 0;
376 }
377 return 1;
378}
379
Andi Kleen9391a3f2006-02-03 21:51:17 +0100380static void unparse_node(int node)
381{
382 int i;
383 node_clear(node, nodes_parsed);
384 for (i = 0; i < MAX_LOCAL_APIC; i++) {
385 if (apicid_to_node[i] == node)
386 apicid_to_node[i] = NUMA_NO_NODE;
387 }
388}
389
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390void __init acpi_numa_arch_fixup(void) {}
391
392/* Use the information discovered above to actually set up the nodes. */
393int __init acpi_scan_nodes(unsigned long start, unsigned long end)
394{
395 int i;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100396
Andi Kleen9391a3f2006-02-03 21:51:17 +0100397 /* First clean up the node list */
398 for (i = 0; i < MAX_NUMNODES; i++) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300399 cutoff_node(i, start, end);
Daniel Yeisley0d015322006-05-30 22:47:57 +0200400 if ((nodes[i].end - nodes[i].start) < NODE_MIN_SIZE) {
Andi Kleen9391a3f2006-02-03 21:51:17 +0100401 unparse_node(i);
Daniel Yeisley0d015322006-05-30 22:47:57 +0200402 node_set_offline(i);
403 }
Andi Kleen9391a3f2006-02-03 21:51:17 +0100404 }
405
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406 if (acpi_numa <= 0)
407 return -1;
Andi Kleene58e0d02005-09-12 18:49:25 +0200408
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100409 if (!nodes_cover_memory()) {
410 bad_srat();
411 return -1;
412 }
413
Andi Kleen2aed7112006-02-16 23:42:16 +0100414 memnode_shift = compute_hash_shift(nodes, MAX_NUMNODES);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 if (memnode_shift < 0) {
416 printk(KERN_ERR
417 "SRAT: No NUMA node hash function found. Contact maintainer\n");
418 bad_srat();
419 return -1;
420 }
Andi Kleene58e0d02005-09-12 18:49:25 +0200421
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200422 node_possible_map = nodes_parsed;
423
Andi Kleene58e0d02005-09-12 18:49:25 +0200424 /* Finally register nodes */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200425 for_each_node_mask(i, node_possible_map)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Andi Kleena8062232006-04-07 19:49:21 +0200427 /* Try again in case setup_node_bootmem missed one due
428 to missing bootmem */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200429 for_each_node_mask(i, node_possible_map)
Andi Kleena8062232006-04-07 19:49:21 +0200430 if (!node_online(i))
431 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
432
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300433 for (i = 0; i < NR_CPUS; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700434 if (cpu_to_node[i] == NUMA_NO_NODE)
435 continue;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200436 if (!node_isset(cpu_to_node[i], node_possible_map))
Andi Kleen69d81fc2005-11-05 17:25:53 +0100437 numa_set_node(i, NUMA_NO_NODE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 }
439 numa_init_array();
440 return 0;
441}
442
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200443void __init srat_reserve_add_area(int nodeid)
444{
445 if (found_add_area && nodes_add[nodeid].end) {
446 u64 total_mb;
447
448 printk(KERN_INFO "SRAT: Reserving hot-add memory space "
449 "for node %d at %Lx-%Lx\n",
450 nodeid, nodes_add[nodeid].start, nodes_add[nodeid].end);
451 total_mb = (nodes_add[nodeid].end - nodes_add[nodeid].start)
452 >> PAGE_SHIFT;
453 total_mb *= sizeof(struct page);
454 total_mb >>= 20;
455 printk(KERN_INFO "SRAT: This will cost you %Lu MB of "
456 "pre-allocated memory.\n", (unsigned long long)total_mb);
457 reserve_bootmem_node(NODE_DATA(nodeid), nodes_add[nodeid].start,
458 nodes_add[nodeid].end - nodes_add[nodeid].start);
459 }
460}
461
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462int __node_distance(int a, int b)
463{
464 int index;
465
466 if (!acpi_slit)
467 return a == b ? 10 : 20;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300468 index = acpi_slit->locality_count * node_to_pxm(a);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469 return acpi_slit->entry[index + node_to_pxm(b)];
470}
471
472EXPORT_SYMBOL(__node_distance);
Keith Mannthey4942e992006-09-30 23:27:06 -0700473
474int memory_add_physaddr_to_nid(u64 start)
475{
476 int i, ret = 0;
477
478 for_each_node(i)
479 if (nodes_add[i].start <= start && nodes_add[i].end > start)
480 ret = i;
481
482 return ret;
483}
Keith Mannthey8c2676a2006-09-30 23:27:07 -0700484EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
485