blob: 9d7ce96e5a5ccb00274cb63fa0a26e1771b9a632 [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 Kleen429b2b32009-07-18 08:56:57 +020082 for (i = 0; i < MAX_NUMNODES; i++) {
83 nodes[i].start = nodes[i].end = 0;
84 nodes_add[i].start = nodes_add[i].end = 0;
85 }
Mel Gorman5cb248a2006-09-27 01:49:52 -070086 remove_all_active_ranges();
Linus Torvalds1da177e2005-04-16 15:20:36 -070087}
88
89static __init inline int srat_disabled(void)
90{
91 return numa_off || acpi_numa < 0;
92}
93
94/* Callback for SLIT parsing */
95void __init acpi_numa_slit_init(struct acpi_table_slit *slit)
96{
Yinghai Luf302a5bb2008-07-10 20:36:37 -070097 unsigned length;
98 unsigned long phys;
99
100 length = slit->header.length;
101 phys = find_e820_area(0, max_pfn_mapped<<PAGE_SHIFT, length,
102 PAGE_SIZE);
103
104 if (phys == -1L)
105 panic(" Can not save slit!\n");
106
107 acpi_slit = __va(phys);
108 memcpy(acpi_slit, slit, length);
109 reserve_early(phys, phys + length, "ACPI SLIT");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110}
111
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800112/* Callback for Proximity Domain -> x2APIC mapping */
113void __init
114acpi_numa_x2apic_affinity_init(struct acpi_srat_x2apic_cpu_affinity *pa)
115{
116 int pxm, node;
117 int apic_id;
118
119 if (srat_disabled())
120 return;
121 if (pa->header.length < sizeof(struct acpi_srat_x2apic_cpu_affinity)) {
122 bad_srat();
123 return;
124 }
125 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
126 return;
127 pxm = pa->proximity_domain;
128 node = setup_node(pxm);
129 if (node < 0) {
130 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
131 bad_srat();
132 return;
133 }
134
135 apic_id = pa->apic_id;
136 apicid_to_node[apic_id] = node;
Jack Steinerdc098552009-04-17 09:22:42 -0500137 node_set(node, cpu_nodes_parsed);
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800138 acpi_numa = 1;
Yinghai Lu163d3862009-11-21 00:23:37 -0800139 printk(KERN_INFO "SRAT: PXM %u -> APIC 0x%04x -> Node %u\n",
Suresh Siddha7237d3d2009-03-30 13:55:30 -0800140 pxm, apic_id, node);
141}
142
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143/* Callback for Proximity Domain -> LAPIC mapping */
144void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300145acpi_numa_processor_affinity_init(struct acpi_srat_cpu_affinity *pa)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146{
147 int pxm, node;
travis@sgi.comef970012008-01-30 13:33:10 +0100148 int apic_id;
149
Andi Kleend22fe802006-02-03 21:51:26 +0100150 if (srat_disabled())
151 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300152 if (pa->header.length != sizeof(struct acpi_srat_cpu_affinity)) {
Andi Kleenfad79062006-05-15 18:19:44 +0200153 bad_srat();
Andi Kleend22fe802006-02-03 21:51:26 +0100154 return;
155 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300156 if ((pa->flags & ACPI_SRAT_CPU_ENABLED) == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300158 pxm = pa->proximity_domain_lo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159 node = setup_node(pxm);
160 if (node < 0) {
161 printk(KERN_ERR "SRAT: Too many proximity domains %x\n", pxm);
162 bad_srat();
163 return;
164 }
Yinghai Lubeafe912008-02-16 23:00:22 -0800165
Jack Steiner2e420602008-09-23 15:37:13 -0500166 if (get_uv_system_type() >= UV_X2APIC)
Jack Steinera65d1d62008-03-28 14:12:08 -0500167 apic_id = (pa->apic_id << 8) | pa->local_sapic_eid;
168 else
169 apic_id = pa->apic_id;
travis@sgi.comef970012008-01-30 13:33:10 +0100170 apicid_to_node[apic_id] = node;
Jack Steinerdc098552009-04-17 09:22:42 -0500171 node_set(node, cpu_nodes_parsed);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 acpi_numa = 1;
Yinghai Lu163d3862009-11-21 00:23:37 -0800173 printk(KERN_INFO "SRAT: PXM %u -> APIC 0x%02x -> Node %u\n",
travis@sgi.comef970012008-01-30 13:33:10 +0100174 pxm, apic_id, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175}
176
Keith Mannthey71efa8f2006-09-30 23:27:05 -0700177#ifdef CONFIG_MEMORY_HOTPLUG_SPARSE
178static inline int save_add_info(void) {return 1;}
179#else
180static inline int save_add_info(void) {return 0;}
181#endif
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200182/*
Yinghai Lu888a5892009-05-15 13:59:37 -0700183 * Update nodes_add[]
184 * This code supports one contiguous hot add area per node
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200185 */
Yinghai Lu888a5892009-05-15 13:59:37 -0700186static void __init
187update_nodes_add(int node, unsigned long start, unsigned long end)
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200188{
189 unsigned long s_pfn = start >> PAGE_SHIFT;
190 unsigned long e_pfn = end >> PAGE_SHIFT;
Yinghai Lu888a5892009-05-15 13:59:37 -0700191 int changed = 0;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200192 struct bootnode *nd = &nodes_add[node];
193
194 /* I had some trouble with strange memory hotadd regions breaking
195 the boot. Be very strict here and reject anything unexpected.
196 If you want working memory hotadd write correct SRATs.
197
198 The node size check is a basic sanity check to guard against
199 mistakes */
200 if ((signed long)(end - start) < NODE_MIN_SIZE) {
201 printk(KERN_ERR "SRAT: Hotplug area too small\n");
Yinghai Lu888a5892009-05-15 13:59:37 -0700202 return;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200203 }
204
205 /* This check might be a bit too strict, but I'm keeping it for now. */
Mel Gorman5cb248a2006-09-27 01:49:52 -0700206 if (absent_pages_in_range(s_pfn, e_pfn) != e_pfn - s_pfn) {
Mel Gorman9c7cd682006-09-27 01:49:58 -0700207 printk(KERN_ERR
208 "SRAT: Hotplug area %lu -> %lu has existing memory\n",
209 s_pfn, e_pfn);
Yinghai Lu888a5892009-05-15 13:59:37 -0700210 return;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200211 }
212
213 /* Looks good */
214
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200215 if (nd->start == nd->end) {
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300216 nd->start = start;
217 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200218 changed = 1;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300219 } else {
220 if (nd->start == end) {
221 nd->start = start;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200222 changed = 1;
223 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300224 if (nd->end == start) {
225 nd->end = end;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200226 changed = 1;
227 }
228 if (!changed)
229 printk(KERN_ERR "SRAT: Hotplug zone not continuous. Partly ignored\n");
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300230 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200231
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200232 if (changed)
Yinghai Lu888a5892009-05-15 13:59:37 -0700233 printk(KERN_INFO "SRAT: hot plug zone found %Lx - %Lx\n",
234 nd->start, nd->end);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200235}
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200236
Linus Torvalds1da177e2005-04-16 15:20:36 -0700237/* Callback for parsing of the Proximity Domain <-> Memory Area mappings */
238void __init
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300239acpi_numa_memory_affinity_init(struct acpi_srat_mem_affinity *ma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240{
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200241 struct bootnode *nd, oldnode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242 unsigned long start, end;
243 int node, pxm;
244 int i;
245
Andi Kleend22fe802006-02-03 21:51:26 +0100246 if (srat_disabled())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300248 if (ma->header.length != sizeof(struct acpi_srat_mem_affinity)) {
Andi Kleend22fe802006-02-03 21:51:26 +0100249 bad_srat();
250 return;
251 }
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300252 if ((ma->flags & ACPI_SRAT_MEM_ENABLED) == 0)
Andi Kleend22fe802006-02-03 21:51:26 +0100253 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300254
255 if ((ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) && !save_add_info())
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200256 return;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300257 start = ma->base_address;
258 end = start + ma->length;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 pxm = ma->proximity_domain;
260 node = setup_node(pxm);
261 if (node < 0) {
262 printk(KERN_ERR "SRAT: Too many proximity domains.\n");
263 bad_srat();
264 return;
265 }
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700266 i = conflicting_memblks(start, end);
Andi Kleen05d1fa42005-09-12 18:49:24 +0200267 if (i == node) {
268 printk(KERN_WARNING
269 "SRAT: Warning: PXM %d (%lx-%lx) overlaps with itself (%Lx-%Lx)\n",
270 pxm, start, end, nodes[i].start, nodes[i].end);
271 } else if (i >= 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 printk(KERN_ERR
Andi Kleen05d1fa42005-09-12 18:49:24 +0200273 "SRAT: PXM %d (%lx-%lx) overlaps with PXM %d (%Lx-%Lx)\n",
274 pxm, start, end, node_to_pxm(i),
275 nodes[i].start, nodes[i].end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276 bad_srat();
277 return;
278 }
279 nd = &nodes[node];
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200280 oldnode = *nd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 if (!node_test_and_set(node, nodes_parsed)) {
282 nd->start = start;
283 nd->end = end;
284 } else {
285 if (start < nd->start)
286 nd->start = start;
287 if (nd->end < end)
288 nd->end = end;
289 }
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200290
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700291 printk(KERN_INFO "SRAT: Node %u PXM %u %lx-%lx\n", node, pxm,
292 start, end);
293 e820_register_active_regions(node, start >> PAGE_SHIFT,
294 end >> PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200295
Yinghai Lu888a5892009-05-15 13:59:37 -0700296 if (ma->flags & ACPI_SRAT_MEM_HOT_PLUGGABLE) {
297 update_nodes_add(node, start, end);
298 /* restore nodes[node] */
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200299 *nd = oldnode;
300 if ((nd->start | nd->end) == 0)
301 node_clear(node, nodes_parsed);
302 }
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700303
304 node_memblk_range[num_node_memblks].start = start;
305 node_memblk_range[num_node_memblks].end = end;
306 memblk_nodeid[num_node_memblks] = node;
307 num_node_memblks++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308}
309
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100310/* Sanity check to catch more bad SRATs (they are amazingly common).
311 Make sure the PXMs cover all memory. */
David Rientjes3484d792007-07-21 17:10:32 +0200312static int __init nodes_cover_memory(const struct bootnode *nodes)
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100313{
314 int i;
315 unsigned long pxmram, e820ram;
316
317 pxmram = 0;
318 for_each_node_mask(i, nodes_parsed) {
319 unsigned long s = nodes[i].start >> PAGE_SHIFT;
320 unsigned long e = nodes[i].end >> PAGE_SHIFT;
321 pxmram += e - s;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700322 pxmram -= absent_pages_in_range(s, e);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200323 if ((long)pxmram < 0)
324 pxmram = 0;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100325 }
326
Yinghai Lub37ab912009-05-08 00:36:44 -0700327 e820ram = max_pfn - (e820_hole_size(0, max_pfn<<PAGE_SHIFT)>>PAGE_SHIFT);
Yinghai Lu0964b052009-05-08 00:37:34 -0700328 /* We seem to lose 3 pages somewhere. Allow 1M of slack. */
329 if ((long)(e820ram - pxmram) >= (1<<(20 - PAGE_SHIFT))) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100330 printk(KERN_ERR
331 "SRAT: PXMs only cover %luMB of your %luMB e820 RAM. Not used.\n",
332 (pxmram << PAGE_SHIFT) >> 20,
333 (e820ram << PAGE_SHIFT) >> 20);
334 return 0;
335 }
336 return 1;
337}
338
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339void __init acpi_numa_arch_fixup(void) {}
340
341/* Use the information discovered above to actually set up the nodes. */
342int __init acpi_scan_nodes(unsigned long start, unsigned long end)
343{
344 int i;
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100345
David Rientjesae2c6dc2007-07-21 17:09:56 +0200346 if (acpi_numa <= 0)
347 return -1;
348
Andi Kleen9391a3f2006-02-03 21:51:17 +0100349 /* First clean up the node list */
Yinghai Lu7c437692009-05-15 13:59:37 -0700350 for (i = 0; i < MAX_NUMNODES; i++)
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300351 cutoff_node(i, start, end);
Andi Kleen9391a3f2006-02-03 21:51:17 +0100352
David Rientjes3484d792007-07-21 17:10:32 +0200353 if (!nodes_cover_memory(nodes)) {
Andi Kleen8a6fdd32006-01-11 22:44:39 +0100354 bad_srat();
355 return -1;
356 }
357
Suresh Siddha6ec6e0d2008-03-25 10:14:35 -0700358 memnode_shift = compute_hash_shift(node_memblk_range, num_node_memblks,
359 memblk_nodeid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360 if (memnode_shift < 0) {
361 printk(KERN_ERR
362 "SRAT: No NUMA node hash function found. Contact maintainer\n");
363 bad_srat();
364 return -1;
365 }
Andi Kleene58e0d02005-09-12 18:49:25 +0200366
Jack Steinerdc098552009-04-17 09:22:42 -0500367 /* Account for nodes with cpus and no memory */
368 nodes_or(node_possible_map, nodes_parsed, cpu_nodes_parsed);
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200369
Andi Kleene58e0d02005-09-12 18:49:25 +0200370 /* Finally register nodes */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200371 for_each_node_mask(i, node_possible_map)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700372 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Andi Kleena8062232006-04-07 19:49:21 +0200373 /* Try again in case setup_node_bootmem missed one due
374 to missing bootmem */
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200375 for_each_node_mask(i, node_possible_map)
Andi Kleena8062232006-04-07 19:49:21 +0200376 if (!node_online(i))
377 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
378
Mike Travis168ef542008-12-16 17:34:01 -0800379 for (i = 0; i < nr_cpu_ids; i++) {
Mike Travis0164fe12008-01-30 13:33:21 +0100380 int node = early_cpu_to_node(i);
381
travis@sgi.com834beda12008-01-30 13:33:21 +0100382 if (node == NUMA_NO_NODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383 continue;
Yinghai Lu7c437692009-05-15 13:59:37 -0700384 if (!node_online(node))
Mike Travis23ca4bb2008-05-12 21:21:12 +0200385 numa_clear_node(i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386 }
387 numa_init_array();
388 return 0;
389}
390
David Rientjes3484d792007-07-21 17:10:32 +0200391#ifdef CONFIG_NUMA_EMU
travis@sgi.comef970012008-01-30 13:33:10 +0100392static int fake_node_to_pxm_map[MAX_NUMNODES] __initdata = {
393 [0 ... MAX_NUMNODES-1] = PXM_INVAL
394};
travis@sgi.com602a54a2008-01-30 13:33:21 +0100395static s16 fake_apicid_to_node[MAX_LOCAL_APIC] __initdata = {
travis@sgi.comef970012008-01-30 13:33:10 +0100396 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
397};
David Rientjes3484d792007-07-21 17:10:32 +0200398static int __init find_node_by_addr(unsigned long addr)
399{
400 int ret = NUMA_NO_NODE;
401 int i;
402
403 for_each_node_mask(i, nodes_parsed) {
404 /*
405 * Find the real node that this emulated node appears on. For
406 * the sake of simplicity, we only use a real node's starting
407 * address to determine which emulated node it appears on.
408 */
409 if (addr >= nodes[i].start && addr < nodes[i].end) {
410 ret = i;
411 break;
412 }
413 }
Minoru Usui9a1b62f2008-01-30 13:33:35 +0100414 return ret;
David Rientjes3484d792007-07-21 17:10:32 +0200415}
416
417/*
418 * In NUMA emulation, we need to setup proximity domain (_PXM) to node ID
419 * mappings that respect the real ACPI topology but reflect our emulated
420 * environment. For each emulated node, we find which real node it appears on
421 * and create PXM to NID mappings for those fake nodes which mirror that
422 * locality. SLIT will now represent the correct distances between emulated
423 * nodes as a result of the real topology.
424 */
425void __init acpi_fake_nodes(const struct bootnode *fake_nodes, int num_nodes)
426{
David Rientjes08705b82007-07-21 17:10:33 +0200427 int i, j;
David Rientjes3484d792007-07-21 17:10:32 +0200428
429 printk(KERN_INFO "Faking PXM affinity for fake nodes on real "
430 "topology.\n");
431 for (i = 0; i < num_nodes; i++) {
432 int nid, pxm;
433
434 nid = find_node_by_addr(fake_nodes[i].start);
435 if (nid == NUMA_NO_NODE)
436 continue;
437 pxm = node_to_pxm(nid);
438 if (pxm == PXM_INVAL)
439 continue;
440 fake_node_to_pxm_map[i] = pxm;
David Rientjes08705b82007-07-21 17:10:33 +0200441 /*
442 * For each apicid_to_node mapping that exists for this real
443 * node, it must now point to the fake node ID.
444 */
445 for (j = 0; j < MAX_LOCAL_APIC; j++)
446 if (apicid_to_node[j] == nid)
447 fake_apicid_to_node[j] = i;
David Rientjes3484d792007-07-21 17:10:32 +0200448 }
449 for (i = 0; i < num_nodes; i++)
450 __acpi_map_pxm_to_node(fake_node_to_pxm_map[i], i);
David Rientjes08705b82007-07-21 17:10:33 +0200451 memcpy(apicid_to_node, fake_apicid_to_node, sizeof(apicid_to_node));
David Rientjes3484d792007-07-21 17:10:32 +0200452
453 nodes_clear(nodes_parsed);
454 for (i = 0; i < num_nodes; i++)
455 if (fake_nodes[i].start != fake_nodes[i].end)
456 node_set(i, nodes_parsed);
457 WARN_ON(!nodes_cover_memory(fake_nodes));
458}
459
460static int null_slit_node_compare(int a, int b)
461{
462 return node_to_pxm(a) == node_to_pxm(b);
463}
464#else
465static int null_slit_node_compare(int a, int b)
466{
467 return a == b;
468}
469#endif /* CONFIG_NUMA_EMU */
470
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471int __node_distance(int a, int b)
472{
473 int index;
474
475 if (!acpi_slit)
David Rientjes3484d792007-07-21 17:10:32 +0200476 return null_slit_node_compare(a, b) ? LOCAL_DISTANCE :
477 REMOTE_DISTANCE;
Alexey Starikovskiy15a58ed2007-02-02 19:48:22 +0300478 index = acpi_slit->locality_count * node_to_pxm(a);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479 return acpi_slit->entry[index + node_to_pxm(b)];
480}
481
482EXPORT_SYMBOL(__node_distance);
Keith Mannthey4942e992006-09-30 23:27:06 -0700483
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200484#if defined(CONFIG_MEMORY_HOTPLUG_SPARSE) || defined(CONFIG_ACPI_HOTPLUG_MEMORY)
Keith Mannthey4942e992006-09-30 23:27:06 -0700485int memory_add_physaddr_to_nid(u64 start)
486{
487 int i, ret = 0;
488
489 for_each_node(i)
490 if (nodes_add[i].start <= start && nodes_add[i].end > start)
491 ret = i;
492
493 return ret;
494}
Keith Mannthey8c2676a2006-09-30 23:27:07 -0700495EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
Thomas Gleixner6a1673a2008-05-12 15:43:38 +0200496#endif