blob: 37308d6bb5d9544a03efa75505836cf5dedaa7c6 [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) {
David Rientjesa2e212d2007-07-21 17:09:55 +0200109 if (val != LOCAL_DISTANCE)
Andi Kleen1584b892006-01-11 22:43:42 +0100110 return 0;
David Rientjesa2e212d2007-07-21 17:09:55 +0200111 } else if (val <= LOCAL_DISTANCE)
Andi Kleen1584b892006-01-11 22:43:42 +0100112 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;
travis@sgi.comef970012008-01-30 13:33:10 +0100133 int apic_id;
134
135 apic_id = pa->apic_id;
Andi Kleend22fe802006-02-03 21:51:26 +0100136 if (srat_disabled())
137 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300138 if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
Andi Kleenfad79062006-05-15 18:19:44 +0200139 bad_srat();
Andi Kleend22fe802006-02-03 21:51:26 +0100140 return;
141 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300142 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300144 pxm = pa->proximity_domain_lo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 node = setup_node(pxm);
146 if (node < 0) {
147 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
148 bad_srat();
149 return;
150 }
travis@sgi.comef970012008-01-30 13:33:10 +0100151 apicid_to_node[apic_id] = node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 acpi_numa = 1;
Andi Kleen0b07e982005-09-12 18:49:24 +0200153 printk(KERN_INFO "SRAT: PXM %u -> APIC %u -> Node %u\n",
travis@sgi.comef970012008-01-30 13:33:10 +0100154 pxm, apic_id, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155}
156
keith mannthey926fafe2006-10-21 18:37:01 +0200157int update_end_of_memory(unsigned long end) {return -1;}
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700158static int hotadd_enough_memory(struct bootnode *nd) {return 1;}
159#ifdef CONFIG_MEMORY_HOTPLUG_SPARSE
160static inline int save_add_info(void) {return 1;}
161#else
162static inline int save_add_info(void) {return 0;}
163#endif
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200164/*
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700165 * Update nodes_add and decide if to include add are in the zone.
Joe Perchesab4a5742008-01-30 13:31:42 +0100166 * Both SPARSE and RESERVE need nodes_add information.
Simon Arlott676b1852007-10-20 01:25:36 +0200167 * This code supports one contiguous hot add area per node.
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200168 */
169static int reserve_hotadd(int node, unsigned long start, unsigned long end)
170{
171 unsigned long s_pfn = start >> PAGE_SHIFT;
172 unsigned long e_pfn = end >> PAGE_SHIFT;
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700173 int ret = 0, changed = 0;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200174 struct bootnode *nd = &nodes_add[node];
175
176 /* I had some trouble with strange memory hotadd regions breaking
177 the boot. Be very strict here and reject anything unexpected.
178 If you want working memory hotadd write correct SRATs.
179
180 The node size check is a basic sanity check to guard against
181 mistakes */
182 if ((signed long)(end - start) < NODE_MIN_SIZE) {
183 printk(KERN_ERR "SRAT: Hotplug area too small\n");
184 return -1;
185 }
186
187 /* This check might be a bit too strict, but I'm keeping it for now. */
Mel Gorman5cb248a2006-09-27 01:49:52 -0700188 if (absent_pages_in_range(s_pfn, e_pfn) != e_pfn - s_pfn) {
Mel Gorman9c7cd682006-09-27 01:49:58 -0700189 printk(KERN_ERR
190 "SRAT: Hotplug area %lu -> %lu has existing memory\n",
191 s_pfn, e_pfn);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200192 return -1;
193 }
194
195 if (!hotadd_enough_memory(&nodes_add[node])) {
196 printk(KERN_ERR "SRAT: Hotplug area too large\n");
197 return -1;
198 }
199
200 /* Looks good */
201
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200202 if (nd->start == nd->end) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300203 nd->start = start;
204 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200205 changed = 1;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300206 } else {
207 if (nd->start == end) {
208 nd->start = start;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200209 changed = 1;
210 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300211 if (nd->end == start) {
212 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200213 changed = 1;
214 }
215 if (!changed)
216 printk(KERN_ERR "SRAT: Hotplug zone not continuous. Partly ignored\n");
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300217 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200218
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700219 ret = update_end_of_memory(nd->end);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200220
221 if (changed)
222 printk(KERN_INFO "SRAT: hot plug zone found %Lx - %Lx\n", nd->start, nd->end);
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700223 return ret;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200224}
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200225
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
227void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300228acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *ma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229{
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200230 struct bootnode *nd, oldnode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231 unsigned long start, end;
232 int node, pxm;
233 int i;
234
Andi Kleend22fe802006-02-03 21:51:26 +0100235 if (srat_disabled())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300237 if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
Andi Kleend22fe802006-02-03 21:51:26 +0100238 bad_srat();
239 return;
240 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300241 if ((ma->flags & ACPI_SRAT_MEM_ENABLED) == 0)
Andi Kleend22fe802006-02-03 21:51:26 +0100242 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300243
244 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) && !save_add_info())
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200245 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300246 start = ma->base_address;
247 end = start + ma->length;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248 pxm = ma->proximity_domain;
249 node = setup_node(pxm);
250 if (node < 0) {
251 printk(KERN_ERR "SRAT: Too many proximity domains.\n");
252 bad_srat();
253 return;
254 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255 i = conflicting_nodes(start, end);
Andi Kleen05d1fa42005-09-12 18:49:24 +0200256 if (i == node) {
257 printk(KERN_WARNING
258 "SRAT: Warning: PXM %d (%lx-%lx) overlaps with itself (%Lx-%Lx)\n",
259 pxm, start, end, nodes[i].start, nodes[i].end);
260 } else if (i >= 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261 printk(KERN_ERR
Andi Kleen05d1fa42005-09-12 18:49:24 +0200262 "SRAT: PXM %d (%lx-%lx) overlaps with PXM %d (%Lx-%Lx)\n",
263 pxm, start, end, node_to_pxm(i),
264 nodes[i].start, nodes[i].end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 bad_srat();
266 return;
267 }
268 nd = &nodes[node];
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200269 oldnode = *nd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 if (!node_test_and_set(node, nodes_parsed)) {
271 nd->start = start;
272 nd->end = end;
273 } else {
274 if (start < nd->start)
275 nd->start = start;
276 if (nd->end < end)
277 nd->end = end;
278 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200279
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 printk(KERN_INFO "SRAT: Node %u PXM %u %Lx-%Lx\n", node, pxm,
281 nd->start, nd->end);
Mel Gorman5cb248a2006-09-27 01:49:52 -0700282 e820_register_active_regions(node, nd->start >> PAGE_SHIFT,
283 nd->end >> PAGE_SHIFT);
Mel Gormanfb014392006-09-27 01:49:59 -0700284 push_node_boundaries(node, nd->start >> PAGE_SHIFT,
285 nd->end >> PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200286
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300287 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) &&
288 (reserve_hotadd(node, start, end) < 0)) {
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200289 /* Ignore hotadd region. Undo damage */
290 printk(KERN_NOTICE "SRAT: Hotplug region ignored\n");
291 *nd = oldnode;
292 if ((nd->start | nd->end) == 0)
293 node_clear(node, nodes_parsed);
294 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295}
296
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100297/* Sanity check to catch more bad SRATs (they are amazingly common).
298 Make sure the PXMs cover all memory. */
David Rientjes3484d792007-07-21 17:10:32 +0200299static int __init nodes_cover_memory(const struct bootnode *nodes)
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100300{
301 int i;
302 unsigned long pxmram, e820ram;
303
304 pxmram = 0;
305 for_each_node_mask(i, nodes_parsed) {
306 unsigned long s = nodes[i].start >> PAGE_SHIFT;
307 unsigned long e = nodes[i].end >> PAGE_SHIFT;
308 pxmram += e - s;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700309 pxmram -= absent_pages_in_range(s, e);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200310 if ((long)pxmram < 0)
311 pxmram = 0;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100312 }
313
Mel Gorman5cb248a2006-09-27 01:49:52 -0700314 e820ram = end_pfn - absent_pages_in_range(0, end_pfn);
Andi Kleenfdb9df92006-02-16 23:42:13 +0100315 /* We seem to lose 3 pages somewhere. Allow a bit of slack. */
316 if ((long)(e820ram - pxmram) >= 1*1024*1024) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100317 printk(KERN_ERR
318 "SRAT: PXMs only cover %luMB of your %luMB e820 RAM. Not used.\n",
319 (pxmram << PAGE_SHIFT) >> 20,
320 (e820ram << PAGE_SHIFT) >> 20);
321 return 0;
322 }
323 return 1;
324}
325
Andi Kleen9391a3f2006-02-03 21:51:17 +0100326static void unparse_node(int node)
327{
328 int i;
329 node_clear(node, nodes_parsed);
330 for (i = 0; i < MAX_LOCAL_APIC; i++) {
331 if (apicid_to_node[i] == node)
332 apicid_to_node[i] = NUMA_NO_NODE;
333 }
334}
335
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336void __init acpi_numa_arch_fixup(void) {}
337
338/* Use the information discovered above to actually set up the nodes. */
339int __init acpi_scan_nodes(unsigned long start, unsigned long end)
340{
341 int i;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100342
David Rientjesae2c6dc2007-07-21 17:09:56 +0200343 if (acpi_numa <= 0)
344 return -1;
345
Andi Kleen9391a3f2006-02-03 21:51:17 +0100346 /* First clean up the node list */
347 for (i = 0; i < MAX_NUMNODES; i++) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300348 cutoff_node(i, start, end);
Mike Travis693e3c52008-01-30 13:33:14 +0100349 /*
350 * don't confuse VM with a node that doesn't have the
351 * minimum memory.
352 */
353 if (nodes[i].end &&
354 (nodes[i].end - nodes[i].start) < NODE_MIN_SIZE) {
Andi Kleen9391a3f2006-02-03 21:51:17 +0100355 unparse_node(i);
Daniel Yeisley0d015322006-05-30 22:47:57 +0200356 node_set_offline(i);
357 }
Andi Kleen9391a3f2006-02-03 21:51:17 +0100358 }
359
David Rientjes3484d792007-07-21 17:10:32 +0200360 if (!nodes_cover_memory(nodes)) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100361 bad_srat();
362 return -1;
363 }
364
Andi Kleen2aed7112006-02-16 23:42:16 +0100365 memnode_shift = compute_hash_shift(nodes, MAX_NUMNODES);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366 if (memnode_shift < 0) {
367 printk(KERN_ERR
368 "SRAT: No NUMA node hash function found. Contact maintainer\n");
369 bad_srat();
370 return -1;
371 }
Andi Kleene58e0d02005-09-12 18:49:25 +0200372
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200373 node_possible_map = nodes_parsed;
374
Andi Kleene58e0d02005-09-12 18:49:25 +0200375 /* Finally register nodes */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200376 for_each_node_mask(i, node_possible_map)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700377 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Andi Kleena8062232006-04-07 19:49:21 +0200378 /* Try again in case setup_node_bootmem missed one due
379 to missing bootmem */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200380 for_each_node_mask(i, node_possible_map)
Andi Kleena8062232006-04-07 19:49:21 +0200381 if (!node_online(i))
382 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
383
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300384 for (i = 0; i < NR_CPUS; i++) {
Mike Travis0164fe12008-01-30 13:33:21 +0100385 int node = early_cpu_to_node(i);
386
travis@sgi.com834beda2008-01-30 13:33:21 +0100387 if (node == NUMA_NO_NODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388 continue;
travis@sgi.com834beda2008-01-30 13:33:21 +0100389 if (!node_isset(node, node_possible_map))
Andi Kleen69d81fc2005-11-05 17:25:53 +0100390 numa_set_node(i, NUMA_NO_NODE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391 }
392 numa_init_array();
393 return 0;
394}
395
David Rientjes3484d792007-07-21 17:10:32 +0200396#ifdef CONFIG_NUMA_EMU
travis@sgi.comef970012008-01-30 13:33:10 +0100397static int fake_node_to_pxm_map[MAX_NUMNODES] __initdata = {
398 [0 ... MAX_NUMNODES-1] = PXM_INVAL
399};
travis@sgi.com602a54a2008-01-30 13:33:21 +0100400static s16 fake_apicid_to_node[MAX_LOCAL_APIC] __initdata = {
travis@sgi.comef970012008-01-30 13:33:10 +0100401 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
402};
David Rientjes3484d792007-07-21 17:10:32 +0200403static int __init find_node_by_addr(unsigned long addr)
404{
405 int ret = NUMA_NO_NODE;
406 int i;
407
408 for_each_node_mask(i, nodes_parsed) {
409 /*
410 * Find the real node that this emulated node appears on. For
411 * the sake of simplicity, we only use a real node's starting
412 * address to determine which emulated node it appears on.
413 */
414 if (addr >= nodes[i].start && addr < nodes[i].end) {
415 ret = i;
416 break;
417 }
418 }
Minoru Usui9a1b62f2008-01-30 13:33:35 +0100419 return ret;
David Rientjes3484d792007-07-21 17:10:32 +0200420}
421
422/*
423 * In NUMA emulation, we need to setup proximity domain (_PXM) to node ID
424 * mappings that respect the real ACPI topology but reflect our emulated
425 * environment. For each emulated node, we find which real node it appears on
426 * and create PXM to NID mappings for those fake nodes which mirror that
427 * locality. SLIT will now represent the correct distances between emulated
428 * nodes as a result of the real topology.
429 */
430void __init acpi_fake_nodes(const struct bootnode *fake_nodes, int num_nodes)
431{
David Rientjes08705b82007-07-21 17:10:33 +0200432 int i, j;
David Rientjes3484d792007-07-21 17:10:32 +0200433
434 printk(KERN_INFO "Faking PXM affinity for fake nodes on real "
435 "topology.\n");
436 for (i = 0; i < num_nodes; i++) {
437 int nid, pxm;
438
439 nid = find_node_by_addr(fake_nodes[i].start);
440 if (nid == NUMA_NO_NODE)
441 continue;
442 pxm = node_to_pxm(nid);
443 if (pxm == PXM_INVAL)
444 continue;
445 fake_node_to_pxm_map[i] = pxm;
David Rientjes08705b82007-07-21 17:10:33 +0200446 /*
447 * For each apicid_to_node mapping that exists for this real
448 * node, it must now point to the fake node ID.
449 */
450 for (j = 0; j < MAX_LOCAL_APIC; j++)
451 if (apicid_to_node[j] == nid)
452 fake_apicid_to_node[j] = i;
David Rientjes3484d792007-07-21 17:10:32 +0200453 }
454 for (i = 0; i < num_nodes; i++)
455 __acpi_map_pxm_to_node(fake_node_to_pxm_map[i], i);
David Rientjes08705b82007-07-21 17:10:33 +0200456 memcpy(apicid_to_node, fake_apicid_to_node, sizeof(apicid_to_node));
David Rientjes3484d792007-07-21 17:10:32 +0200457
458 nodes_clear(nodes_parsed);
459 for (i = 0; i < num_nodes; i++)
460 if (fake_nodes[i].start != fake_nodes[i].end)
461 node_set(i, nodes_parsed);
462 WARN_ON(!nodes_cover_memory(fake_nodes));
463}
464
465static int null_slit_node_compare(int a, int b)
466{
467 return node_to_pxm(a) == node_to_pxm(b);
468}
469#else
470static int null_slit_node_compare(int a, int b)
471{
472 return a == b;
473}
474#endif /* CONFIG_NUMA_EMU */
475
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200476void __init srat_reserve_add_area(int nodeid)
477{
478 if (found_add_area && nodes_add[nodeid].end) {
479 u64 total_mb;
480
481 printk(KERN_INFO "SRAT: Reserving hot-add memory space "
482 "for node %d at %Lx-%Lx\n",
483 nodeid, nodes_add[nodeid].start, nodes_add[nodeid].end);
484 total_mb = (nodes_add[nodeid].end - nodes_add[nodeid].start)
485 >> PAGE_SHIFT;
486 total_mb *= sizeof(struct page);
487 total_mb >>= 20;
488 printk(KERN_INFO "SRAT: This will cost you %Lu MB of "
489 "pre-allocated memory.\n", (unsigned long long)total_mb);
490 reserve_bootmem_node(NODE_DATA(nodeid), nodes_add[nodeid].start,
491 nodes_add[nodeid].end - nodes_add[nodeid].start);
492 }
493}
494
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495int __node_distance(int a, int b)
496{
497 int index;
498
499 if (!acpi_slit)
David Rientjes3484d792007-07-21 17:10:32 +0200500 return null_slit_node_compare(a, b) ? LOCAL_DISTANCE :
501 REMOTE_DISTANCE;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300502 index = acpi_slit->locality_count * node_to_pxm(a);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503 return acpi_slit->entry[index + node_to_pxm(b)];
504}
505
506EXPORT_SYMBOL(__node_distance);
Keith Mannthey4942e992006-09-30 23:27:06 -0700507
508int memory_add_physaddr_to_nid(u64 start)
509{
510 int i, ret = 0;
511
512 for_each_node(i)
513 if (nodes_add[i].start <= start && nodes_add[i].end > start)
514 ret = i;
515
516 return ret;
517}
Keith Mannthey8c2676a2006-09-30 23:27:07 -0700518EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
519