blob: d33954866085320bf3b5a13873c05e5018ad8e03 [file] [log] [blame]
Thomas Gleixnere3cfe522008-01-30 13:30:37 +01001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * Generic VM initialization for x86-64 NUMA setups.
3 * Copyright 2002,2003 Andi Kleen, SuSE Labs.
Thomas Gleixnere3cfe522008-01-30 13:30:37 +01004 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07005#include <linux/kernel.h>
6#include <linux/mm.h>
7#include <linux/string.h>
8#include <linux/init.h>
9#include <linux/bootmem.h>
10#include <linux/mmzone.h>
11#include <linux/ctype.h>
12#include <linux/module.h>
13#include <linux/nodemask.h>
travis@sgi.com3cc87e32008-01-30 13:33:11 +010014#include <linux/sched.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015
16#include <asm/e820.h>
17#include <asm/proto.h>
18#include <asm/dma.h>
19#include <asm/numa.h>
20#include <asm/acpi.h>
Thomas Gleixnerc9ff0342008-01-30 13:30:16 +010021#include <asm/k8.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022
23#ifndef Dprintk
24#define Dprintk(x...)
25#endif
26
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070027struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +010028EXPORT_SYMBOL(node_data);
29
Linus Torvalds1da177e2005-04-16 15:20:36 -070030bootmem_data_t plat_node_bdata[MAX_NUMNODES];
31
Eric Dumazetdcf36bf2006-03-25 16:31:46 +010032struct memnode memnode;
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
travis@sgi.com43238382008-01-30 13:33:25 +010034int x86_cpu_to_node_map_init[NR_CPUS] = {
Andi Kleen3f098c22005-09-12 18:49:24 +020035 [0 ... NR_CPUS-1] = NUMA_NO_NODE
Andi Kleen0b07e982005-09-12 18:49:24 +020036};
travis@sgi.comdf3825c2008-01-30 13:33:11 +010037void *x86_cpu_to_node_map_early_ptr;
travis@sgi.com43238382008-01-30 13:33:25 +010038DEFINE_PER_CPU(int, x86_cpu_to_node_map) = NUMA_NO_NODE;
travis@sgi.comdf3825c2008-01-30 13:33:11 +010039EXPORT_PER_CPU_SYMBOL(x86_cpu_to_node_map);
travis@sgi.comc49a4952008-01-30 13:33:22 +010040EXPORT_SYMBOL(x86_cpu_to_node_map_early_ptr);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +010041
travis@sgi.com43238382008-01-30 13:33:25 +010042s16 apicid_to_node[MAX_LOCAL_APIC] __cpuinitdata = {
Thomas Gleixnere3cfe522008-01-30 13:30:37 +010043 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
Andi Kleen3f098c22005-09-12 18:49:24 +020044};
Thomas Gleixnere3cfe522008-01-30 13:30:37 +010045
Thomas Gleixner74628942008-01-30 13:30:38 +010046cpumask_t node_to_cpumask_map[MAX_NUMNODES] __read_mostly;
47EXPORT_SYMBOL(node_to_cpumask_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -070048
49int numa_off __initdata;
Amul Shah076422d2007-02-13 13:26:19 +010050unsigned long __initdata nodemap_addr;
51unsigned long __initdata nodemap_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -070052
Eric Dumazet529a3402005-11-05 17:25:54 +010053/*
54 * Given a shift value, try to populate memnodemap[]
55 * Returns :
56 * 1 if OK
57 * 0 if memnodmap[] too small (of shift too small)
58 * -1 if node overlap or lost ram (shift too big)
59 */
Thomas Gleixnere3cfe522008-01-30 13:30:37 +010060static int __init populate_memnodemap(const struct bootnode *nodes,
61 int numnodes, int shift)
Linus Torvalds1da177e2005-04-16 15:20:36 -070062{
Eric Dumazet529a3402005-11-05 17:25:54 +010063 unsigned long addr, end;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +010064 int i, res = -1;
Keith Manntheyb6846642005-07-28 21:15:38 -070065
travis@sgi.com43238382008-01-30 13:33:25 +010066 memset(memnodemap, 0xff, sizeof(s16)*memnodemapsize);
Eric Dumazet529a3402005-11-05 17:25:54 +010067 for (i = 0; i < numnodes; i++) {
68 addr = nodes[i].start;
69 end = nodes[i].end;
70 if (addr >= end)
71 continue;
Amul Shah076422d2007-02-13 13:26:19 +010072 if ((end >> shift) >= memnodemapsize)
Eric Dumazet529a3402005-11-05 17:25:54 +010073 return 0;
74 do {
travis@sgi.com43238382008-01-30 13:33:25 +010075 if (memnodemap[addr >> shift] != NUMA_NO_NODE)
Eric Dumazet529a3402005-11-05 17:25:54 +010076 return -1;
77 memnodemap[addr >> shift] = i;
Amul Shah076422d2007-02-13 13:26:19 +010078 addr += (1UL << shift);
Eric Dumazet529a3402005-11-05 17:25:54 +010079 } while (addr < end);
80 res = 1;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +010081 }
Eric Dumazet529a3402005-11-05 17:25:54 +010082 return res;
83}
84
Amul Shah076422d2007-02-13 13:26:19 +010085static int __init allocate_cachealigned_memnodemap(void)
86{
87 unsigned long pad, pad_addr;
88
89 memnodemap = memnode.embedded_map;
travis@sgi.com316390b2008-01-30 13:33:15 +010090 if (memnodemapsize <= ARRAY_SIZE(memnode.embedded_map))
Amul Shah076422d2007-02-13 13:26:19 +010091 return 0;
Amul Shah076422d2007-02-13 13:26:19 +010092
93 pad = L1_CACHE_BYTES - 1;
94 pad_addr = 0x8000;
Yinghai Luafadcd72008-01-30 13:34:12 +010095 nodemap_size = pad + sizeof(s16) * memnodemapsize;
Amul Shah076422d2007-02-13 13:26:19 +010096 nodemap_addr = find_e820_area(pad_addr, end_pfn<<PAGE_SHIFT,
97 nodemap_size);
98 if (nodemap_addr == -1UL) {
99 printk(KERN_ERR
100 "NUMA: Unable to allocate Memory to Node hash map\n");
101 nodemap_addr = nodemap_size = 0;
102 return -1;
103 }
104 pad_addr = (nodemap_addr + pad) & ~pad;
105 memnodemap = phys_to_virt(pad_addr);
Yinghai Lu25eff8d2008-02-01 17:49:41 +0100106 reserve_early(nodemap_addr, nodemap_addr + nodemap_size, "MEMNODEMAP");
Amul Shah076422d2007-02-13 13:26:19 +0100107
108 printk(KERN_DEBUG "NUMA: Allocated memnodemap from %lx - %lx\n",
109 nodemap_addr, nodemap_addr + nodemap_size);
110 return 0;
111}
112
113/*
114 * The LSB of all start and end addresses in the node map is the value of the
115 * maximum possible shift.
116 */
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100117static int __init extract_lsb_from_nodes(const struct bootnode *nodes,
118 int numnodes)
Amul Shah076422d2007-02-13 13:26:19 +0100119{
Amul Shah54413922007-02-13 13:26:20 +0100120 int i, nodes_used = 0;
Amul Shah076422d2007-02-13 13:26:19 +0100121 unsigned long start, end;
122 unsigned long bitfield = 0, memtop = 0;
123
124 for (i = 0; i < numnodes; i++) {
125 start = nodes[i].start;
126 end = nodes[i].end;
127 if (start >= end)
128 continue;
Amul Shah54413922007-02-13 13:26:20 +0100129 bitfield |= start;
130 nodes_used++;
Amul Shah076422d2007-02-13 13:26:19 +0100131 if (end > memtop)
132 memtop = end;
133 }
Amul Shah54413922007-02-13 13:26:20 +0100134 if (nodes_used <= 1)
135 i = 63;
136 else
137 i = find_first_bit(&bitfield, sizeof(unsigned long)*8);
Amul Shah076422d2007-02-13 13:26:19 +0100138 memnodemapsize = (memtop >> i)+1;
139 return i;
140}
141
Andi Kleenabe059e2006-03-25 16:29:12 +0100142int __init compute_hash_shift(struct bootnode *nodes, int numnodes)
Eric Dumazet529a3402005-11-05 17:25:54 +0100143{
Amul Shah076422d2007-02-13 13:26:19 +0100144 int shift;
Eric Dumazet529a3402005-11-05 17:25:54 +0100145
Amul Shah076422d2007-02-13 13:26:19 +0100146 shift = extract_lsb_from_nodes(nodes, numnodes);
147 if (allocate_cachealigned_memnodemap())
148 return -1;
Andi Kleen6b050f82006-01-11 22:44:33 +0100149 printk(KERN_DEBUG "NUMA: Using %d for the hash shift.\n",
Eric Dumazet529a3402005-11-05 17:25:54 +0100150 shift);
151
152 if (populate_memnodemap(nodes, numnodes, shift) != 1) {
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100153 printk(KERN_INFO "Your memory is not aligned you need to "
154 "rebuild your kernel with a bigger NODEMAPSIZE "
155 "shift=%d\n", shift);
Eric Dumazet529a3402005-11-05 17:25:54 +0100156 return -1;
157 }
Keith Manntheyb6846642005-07-28 21:15:38 -0700158 return shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159}
160
Matt Tolentinobbfceef2005-06-23 00:08:07 -0700161int early_pfn_to_nid(unsigned long pfn)
162{
163 return phys_to_nid(pfn << PAGE_SHIFT);
164}
Matt Tolentinobbfceef2005-06-23 00:08:07 -0700165
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100166static void * __init early_node_mem(int nodeid, unsigned long start,
167 unsigned long end, unsigned long size)
Andi Kleena8062232006-04-07 19:49:21 +0200168{
169 unsigned long mem = find_e820_area(start, end, size);
170 void *ptr;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100171
Andi Kleena8062232006-04-07 19:49:21 +0200172 if (mem != -1L)
173 return __va(mem);
174 ptr = __alloc_bootmem_nopanic(size,
175 SMP_CACHE_BYTES, __pa(MAX_DMA_ADDRESS));
Yoann Padioleau83e83d52007-10-17 18:04:35 +0200176 if (ptr == NULL) {
Andi Kleena8062232006-04-07 19:49:21 +0200177 printk(KERN_ERR "Cannot find %lu bytes in node %d\n",
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100178 size, nodeid);
Andi Kleena8062232006-04-07 19:49:21 +0200179 return NULL;
180 }
181 return ptr;
182}
183
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184/* Initialize bootmem allocator for a node */
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100185void __init setup_node_bootmem(int nodeid, unsigned long start,
186 unsigned long end)
187{
188 unsigned long start_pfn, end_pfn, bootmap_pages, bootmap_size;
189 unsigned long bootmap_start, nodedata_phys;
Andi Kleena8062232006-04-07 19:49:21 +0200190 void *bootmap;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191 const int pgdat_size = round_up(sizeof(pg_data_t), PAGE_SIZE);
192
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100193 start = round_up(start, ZONE_ALIGN);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100195 printk(KERN_INFO "Bootmem setup node %d %016lx-%016lx\n", nodeid,
196 start, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197
198 start_pfn = start >> PAGE_SHIFT;
199 end_pfn = end >> PAGE_SHIFT;
200
Andi Kleena8062232006-04-07 19:49:21 +0200201 node_data[nodeid] = early_node_mem(nodeid, start, end, pgdat_size);
202 if (node_data[nodeid] == NULL)
203 return;
204 nodedata_phys = __pa(node_data[nodeid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206 memset(NODE_DATA(nodeid), 0, sizeof(pg_data_t));
207 NODE_DATA(nodeid)->bdata = &plat_node_bdata[nodeid];
208 NODE_DATA(nodeid)->node_start_pfn = start_pfn;
209 NODE_DATA(nodeid)->node_spanned_pages = end_pfn - start_pfn;
210
211 /* Find a place for the bootmem map */
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100212 bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 bootmap_start = round_up(nodedata_phys + pgdat_size, PAGE_SIZE);
Andi Kleena8062232006-04-07 19:49:21 +0200214 bootmap = early_node_mem(nodeid, bootmap_start, end,
215 bootmap_pages<<PAGE_SHIFT);
216 if (bootmap == NULL) {
217 if (nodedata_phys < start || nodedata_phys >= end)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100218 free_bootmem((unsigned long)node_data[nodeid],
219 pgdat_size);
Andi Kleena8062232006-04-07 19:49:21 +0200220 node_data[nodeid] = NULL;
221 return;
222 }
223 bootmap_start = __pa(bootmap);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100224 Dprintk("bootmap start %lu pages %lu\n", bootmap_start, bootmap_pages);
225
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 bootmap_size = init_bootmem_node(NODE_DATA(nodeid),
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100227 bootmap_start >> PAGE_SHIFT,
228 start_pfn, end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229
Mel Gorman5cb248a2006-09-27 01:49:52 -0700230 free_bootmem_with_active_regions(nodeid, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100232 reserve_bootmem_node(NODE_DATA(nodeid), nodedata_phys, pgdat_size);
233 reserve_bootmem_node(NODE_DATA(nodeid), bootmap_start,
234 bootmap_pages<<PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200235#ifdef CONFIG_ACPI_NUMA
236 srat_reserve_add_area(nodeid);
237#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238 node_set_online(nodeid);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100239}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100241/*
242 * There are unfortunately some poorly designed mainboards around that
243 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
244 * mapping. To avoid this fill in the mapping for all possible CPUs,
245 * as the number of CPUs is not known yet. We round robin the existing
246 * nodes.
247 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248void __init numa_init_array(void)
249{
250 int rr, i;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100251
Ravikiran G Thirumalai85cc5132005-09-30 11:59:22 -0700252 rr = first_node(node_online_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253 for (i = 0; i < NR_CPUS; i++) {
travis@sgi.com1ce35712008-01-30 13:33:33 +0100254 if (early_cpu_to_node(i) != NUMA_NO_NODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255 continue;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100256 numa_set_node(i, rr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 rr = next_node(rr, node_online_map);
258 if (rr == MAX_NUMNODES)
259 rr = first_node(node_online_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261}
262
263#ifdef CONFIG_NUMA_EMU
Rohit Seth53fee042007-02-13 13:26:22 +0100264/* Numa emulation */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200265char *cmdline __initdata;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266
Rohit Seth53fee042007-02-13 13:26:22 +0100267/*
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100268 * Setups up nid to range from addr to addr + size. If the end
269 * boundary is greater than max_addr, then max_addr is used instead.
270 * The return value is 0 if there is additional memory left for
271 * allocation past addr and -1 otherwise. addr is adjusted to be at
272 * the end of the node.
Rohit Seth53fee042007-02-13 13:26:22 +0100273 */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200274static int __init setup_node_range(int nid, struct bootnode *nodes, u64 *addr,
275 u64 size, u64 max_addr)
Rohit Seth53fee042007-02-13 13:26:22 +0100276{
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200277 int ret = 0;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100278
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200279 nodes[nid].start = *addr;
280 *addr += size;
281 if (*addr >= max_addr) {
282 *addr = max_addr;
283 ret = -1;
284 }
285 nodes[nid].end = *addr;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200286 node_set(nid, node_possible_map);
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200287 printk(KERN_INFO "Faking node %d at %016Lx-%016Lx (%LuMB)\n", nid,
288 nodes[nid].start, nodes[nid].end,
289 (nodes[nid].end - nodes[nid].start) >> 20);
290 return ret;
Rohit Seth53fee042007-02-13 13:26:22 +0100291}
292
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200293/*
294 * Splits num_nodes nodes up equally starting at node_start. The return value
295 * is the number of nodes split up and addr is adjusted to be at the end of the
296 * last node allocated.
297 */
298static int __init split_nodes_equally(struct bootnode *nodes, u64 *addr,
299 u64 max_addr, int node_start,
300 int num_nodes)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301{
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200302 unsigned int big;
303 u64 size;
304 int i;
Rohit Seth53fee042007-02-13 13:26:22 +0100305
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200306 if (num_nodes <= 0)
307 return -1;
308 if (num_nodes > MAX_NUMNODES)
309 num_nodes = MAX_NUMNODES;
David Rientjesa7e96622007-07-21 17:11:29 +0200310 size = (max_addr - *addr - e820_hole_size(*addr, max_addr)) /
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200311 num_nodes;
Rohit Seth53fee042007-02-13 13:26:22 +0100312 /*
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200313 * Calculate the number of big nodes that can be allocated as a result
314 * of consolidating the leftovers.
Rohit Seth53fee042007-02-13 13:26:22 +0100315 */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200316 big = ((size & ~FAKE_NODE_MIN_HASH_MASK) * num_nodes) /
317 FAKE_NODE_MIN_SIZE;
Rohit Seth53fee042007-02-13 13:26:22 +0100318
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200319 /* Round down to nearest FAKE_NODE_MIN_SIZE. */
320 size &= FAKE_NODE_MIN_HASH_MASK;
321 if (!size) {
322 printk(KERN_ERR "Not enough memory for each node. "
323 "NUMA emulation disabled.\n");
324 return -1;
Rohit Seth53fee042007-02-13 13:26:22 +0100325 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200326
327 for (i = node_start; i < num_nodes + node_start; i++) {
328 u64 end = *addr + size;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100329
Rohit Seth53fee042007-02-13 13:26:22 +0100330 if (i < big)
331 end += FAKE_NODE_MIN_SIZE;
332 /*
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200333 * The final node can have the remaining system RAM. Other
334 * nodes receive roughly the same amount of available pages.
Rohit Seth53fee042007-02-13 13:26:22 +0100335 */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200336 if (i == num_nodes + node_start - 1)
Rohit Seth53fee042007-02-13 13:26:22 +0100337 end = max_addr;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200338 else
David Rientjesa7e96622007-07-21 17:11:29 +0200339 while (end - *addr - e820_hole_size(*addr, end) <
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200340 size) {
341 end += FAKE_NODE_MIN_SIZE;
342 if (end > max_addr) {
343 end = max_addr;
344 break;
345 }
346 }
347 if (setup_node_range(i, nodes, addr, end - *addr, max_addr) < 0)
348 break;
349 }
350 return i - node_start + 1;
351}
352
353/*
David Rientjes382591d2007-05-02 19:27:09 +0200354 * Splits the remaining system RAM into chunks of size. The remaining memory is
355 * always assigned to a final node and can be asymmetric. Returns the number of
356 * nodes split.
357 */
358static int __init split_nodes_by_size(struct bootnode *nodes, u64 *addr,
359 u64 max_addr, int node_start, u64 size)
360{
361 int i = node_start;
362 size = (size << 20) & FAKE_NODE_MIN_HASH_MASK;
363 while (!setup_node_range(i++, nodes, addr, size, max_addr))
364 ;
365 return i - node_start;
366}
367
368/*
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200369 * Sets up the system RAM area from start_pfn to end_pfn according to the
370 * numa=fake command-line option.
371 */
372static int __init numa_emulation(unsigned long start_pfn, unsigned long end_pfn)
373{
374 struct bootnode nodes[MAX_NUMNODES];
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100375 u64 size, addr = start_pfn << PAGE_SHIFT;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200376 u64 max_addr = end_pfn << PAGE_SHIFT;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100377 int num_nodes = 0, num = 0, coeff_flag, coeff = -1, i;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200378
379 memset(&nodes, 0, sizeof(nodes));
380 /*
381 * If the numa=fake command-line is just a single number N, split the
382 * system RAM into N fake nodes.
383 */
384 if (!strchr(cmdline, '*') && !strchr(cmdline, ',')) {
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100385 long n = simple_strtol(cmdline, NULL, 0);
386
387 num_nodes = split_nodes_equally(nodes, &addr, max_addr, 0, n);
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200388 if (num_nodes < 0)
389 return num_nodes;
390 goto out;
391 }
392
393 /* Parse the command line. */
David Rientjes382591d2007-05-02 19:27:09 +0200394 for (coeff_flag = 0; ; cmdline++) {
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200395 if (*cmdline && isdigit(*cmdline)) {
396 num = num * 10 + *cmdline - '0';
397 continue;
398 }
David Rientjes382591d2007-05-02 19:27:09 +0200399 if (*cmdline == '*') {
400 if (num > 0)
401 coeff = num;
402 coeff_flag = 1;
403 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200404 if (!*cmdline || *cmdline == ',') {
David Rientjes382591d2007-05-02 19:27:09 +0200405 if (!coeff_flag)
406 coeff = 1;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200407 /*
408 * Round down to the nearest FAKE_NODE_MIN_SIZE.
409 * Command-line coefficients are in megabytes.
410 */
411 size = ((u64)num << 20) & FAKE_NODE_MIN_HASH_MASK;
David Rientjes382591d2007-05-02 19:27:09 +0200412 if (size)
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200413 for (i = 0; i < coeff; i++, num_nodes++)
414 if (setup_node_range(num_nodes, nodes,
415 &addr, size, max_addr) < 0)
416 goto done;
David Rientjes382591d2007-05-02 19:27:09 +0200417 if (!*cmdline)
418 break;
419 coeff_flag = 0;
420 coeff = -1;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200421 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200422 num = 0;
423 }
424done:
425 if (!num_nodes)
426 return -1;
David Rientjes14694d72007-05-02 19:27:09 +0200427 /* Fill remainder of system RAM, if appropriate. */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200428 if (addr < max_addr) {
David Rientjes382591d2007-05-02 19:27:09 +0200429 if (coeff_flag && coeff < 0) {
430 /* Split remaining nodes into num-sized chunks */
431 num_nodes += split_nodes_by_size(nodes, &addr, max_addr,
432 num_nodes, num);
433 goto out;
434 }
David Rientjes14694d72007-05-02 19:27:09 +0200435 switch (*(cmdline - 1)) {
436 case '*':
437 /* Split remaining nodes into coeff chunks */
438 if (coeff <= 0)
439 break;
440 num_nodes += split_nodes_equally(nodes, &addr, max_addr,
441 num_nodes, coeff);
442 break;
443 case ',':
444 /* Do not allocate remaining system RAM */
445 break;
446 default:
447 /* Give one final node */
448 setup_node_range(num_nodes, nodes, &addr,
449 max_addr - addr, max_addr);
450 num_nodes++;
451 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200452 }
453out:
454 memnode_shift = compute_hash_shift(nodes, num_nodes);
455 if (memnode_shift < 0) {
456 memnode_shift = 0;
457 printk(KERN_ERR "No NUMA hash function found. NUMA emulation "
458 "disabled.\n");
459 return -1;
460 }
461
462 /*
463 * We need to vacate all active ranges that may have been registered by
David Rientjes1c05f092007-07-21 17:11:30 +0200464 * SRAT and set acpi_numa to -1 so that srat_disabled() always returns
465 * true. NUMA emulation has succeeded so we will not scan ACPI nodes.
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200466 */
467 remove_all_active_ranges();
David Rientjes1c05f092007-07-21 17:11:30 +0200468#ifdef CONFIG_ACPI_NUMA
469 acpi_numa = -1;
470#endif
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200471 for_each_node_mask(i, node_possible_map) {
Mel Gorman5cb248a2006-09-27 01:49:52 -0700472 e820_register_active_regions(i, nodes[i].start >> PAGE_SHIFT,
473 nodes[i].end >> PAGE_SHIFT);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100474 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Mel Gorman5cb248a2006-09-27 01:49:52 -0700475 }
David Rientjes3484d792007-07-21 17:10:32 +0200476 acpi_fake_nodes(nodes, num_nodes);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100477 numa_init_array();
478 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479}
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200480#endif /* CONFIG_NUMA_EMU */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481
482void __init numa_initmem_init(unsigned long start_pfn, unsigned long end_pfn)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100483{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484 int i;
485
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200486 nodes_clear(node_possible_map);
487
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488#ifdef CONFIG_NUMA_EMU
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200489 if (cmdline && !numa_emulation(start_pfn, end_pfn))
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100490 return;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200491 nodes_clear(node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700492#endif
493
494#ifdef CONFIG_ACPI_NUMA
495 if (!numa_off && !acpi_scan_nodes(start_pfn << PAGE_SHIFT,
496 end_pfn << PAGE_SHIFT))
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100497 return;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200498 nodes_clear(node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499#endif
500
501#ifdef CONFIG_K8_NUMA
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100502 if (!numa_off && !k8_scan_nodes(start_pfn<<PAGE_SHIFT,
503 end_pfn<<PAGE_SHIFT))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504 return;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200505 nodes_clear(node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700506#endif
507 printk(KERN_INFO "%s\n",
508 numa_off ? "NUMA turned off" : "No NUMA configuration found");
509
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100510 printk(KERN_INFO "Faking a node at %016lx-%016lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 start_pfn << PAGE_SHIFT,
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100512 end_pfn << PAGE_SHIFT);
513 /* setup dummy node covering all memory */
514 memnode_shift = 63;
Amul Shah076422d2007-02-13 13:26:19 +0100515 memnodemap = memnode.embedded_map;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516 memnodemap[0] = 0;
517 nodes_clear(node_online_map);
518 node_set_online(0);
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200519 node_set(0, node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 for (i = 0; i < NR_CPUS; i++)
Andi Kleen69d81fc2005-11-05 17:25:53 +0100521 numa_set_node(i, 0);
travis@sgi.comdf3825c2008-01-30 13:33:11 +0100522 /* cpumask_of_cpu() may not be available during early startup */
travis@sgi.com3cc87e32008-01-30 13:33:11 +0100523 memset(&node_to_cpumask_map[0], 0, sizeof(node_to_cpumask_map[0]));
524 cpu_set(0, node_to_cpumask_map[0]);
Mel Gorman5cb248a2006-09-27 01:49:52 -0700525 e820_register_active_regions(0, start_pfn, end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526 setup_node_bootmem(0, start_pfn << PAGE_SHIFT, end_pfn << PAGE_SHIFT);
527}
528
Ashok Raje6982c62005-06-25 14:54:58 -0700529__cpuinit void numa_add_cpu(int cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530{
travis@sgi.com1ce35712008-01-30 13:33:33 +0100531 set_bit(cpu,
532 (unsigned long *)&node_to_cpumask_map[early_cpu_to_node(cpu)]);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100533}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534
Andi Kleen69d81fc2005-11-05 17:25:53 +0100535void __cpuinit numa_set_node(int cpu, int node)
536{
travis@sgi.com43238382008-01-30 13:33:25 +0100537 int *cpu_to_node_map = x86_cpu_to_node_map_early_ptr;
travis@sgi.comdf3825c2008-01-30 13:33:11 +0100538
Ravikiran G Thirumalaidf79efd2006-01-11 22:45:39 +0100539 cpu_pda(cpu)->nodenumber = node;
travis@sgi.comdf3825c2008-01-30 13:33:11 +0100540
541 if(cpu_to_node_map)
542 cpu_to_node_map[cpu] = node;
543 else if(per_cpu_offset(cpu))
544 per_cpu(x86_cpu_to_node_map, cpu) = node;
545 else
546 Dprintk(KERN_INFO "Setting node for non-present cpu %d\n", cpu);
Andi Kleen69d81fc2005-11-05 17:25:53 +0100547}
548
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100549unsigned long __init numa_free_all_bootmem(void)
550{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700551 unsigned long pages = 0;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100552 int i;
553
554 for_each_online_node(i)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700555 pages += free_all_bootmem_node(NODE_DATA(i));
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100556
Linus Torvalds1da177e2005-04-16 15:20:36 -0700557 return pages;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100558}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559
560void __init paging_init(void)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100561{
Mel Gorman6391af12006-10-11 01:20:39 -0700562 unsigned long max_zone_pfns[MAX_NR_ZONES];
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100563
Mel Gorman6391af12006-10-11 01:20:39 -0700564 memset(max_zone_pfns, 0, sizeof(max_zone_pfns));
565 max_zone_pfns[ZONE_DMA] = MAX_DMA_PFN;
566 max_zone_pfns[ZONE_DMA32] = MAX_DMA32_PFN;
567 max_zone_pfns[ZONE_NORMAL] = end_pfn;
Bob Piccod3ee8712005-11-05 17:25:54 +0100568
Bob Piccof0a5a582007-02-13 13:26:25 +0100569 sparse_memory_present_with_active_regions(MAX_NUMNODES);
570 sparse_init();
Bob Piccod3ee8712005-11-05 17:25:54 +0100571
Mel Gorman5cb248a2006-09-27 01:49:52 -0700572 free_area_init_nodes(max_zone_pfns);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100573}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200575static __init int numa_setup(char *opt)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100576{
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200577 if (!opt)
578 return -EINVAL;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100579 if (!strncmp(opt, "off", 3))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700580 numa_off = 1;
581#ifdef CONFIG_NUMA_EMU
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200582 if (!strncmp(opt, "fake=", 5))
583 cmdline = opt + 5;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584#endif
585#ifdef CONFIG_ACPI_NUMA
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100586 if (!strncmp(opt, "noacpi", 6))
587 acpi_numa = -1;
588 if (!strncmp(opt, "hotadd=", 7))
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200589 hotadd_percent = simple_strtoul(opt+7, NULL, 10);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700590#endif
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200591 return 0;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100592}
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200593early_param("numa", numa_setup);
594
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100595/*
596 * Setup early cpu_to_node.
597 *
598 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
599 * and apicid_to_node[] tables have valid entries for a CPU.
600 * This means we skip cpu_to_node[] initialisation for NUMA
601 * emulation and faking node case (when running a kernel compiled
602 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
603 * is already initialized in a round robin manner at numa_init_array,
604 * prior to this call, and this initialization is good enough
605 * for the fake NUMA cases.
606 */
607void __init init_cpu_to_node(void)
608{
609 int i;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100610
611 for (i = 0; i < NR_CPUS; i++) {
travis@sgi.comef970012008-01-30 13:33:10 +0100612 u16 apicid = x86_cpu_to_apicid_init[i];
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100613
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100614 if (apicid == BAD_APICID)
615 continue;
616 if (apicid_to_node[apicid] == NUMA_NO_NODE)
617 continue;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100618 numa_set_node(i, apicid_to_node[apicid]);
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100619 }
620}
621
Andi Kleencf050132006-01-11 22:46:27 +0100622