blob: 5a02bf4c91ec7eac8b9c25da1cf1f666bc2b961f [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 Shah076422d22007-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 Shah076422d22007-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 Shah076422d22007-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 Shah076422d22007-02-13 13:26:19 +010085static int __init allocate_cachealigned_memnodemap(void)
86{
Yinghai Lu24a5da72008-02-01 17:49:41 +010087 unsigned long addr;
Amul Shah076422d22007-02-13 13:26:19 +010088
89 memnodemap = memnode.embedded_map;
travis@sgi.com316390b2008-01-30 13:33:15 +010090 if (memnodemapsize <= ARRAY_SIZE(memnode.embedded_map))
Amul Shah076422d22007-02-13 13:26:19 +010091 return 0;
Amul Shah076422d22007-02-13 13:26:19 +010092
Yinghai Lu24a5da72008-02-01 17:49:41 +010093 addr = 0x8000;
94 nodemap_size = round_up(sizeof(s16) * memnodemapsize, L1_CACHE_BYTES);
95 nodemap_addr = find_e820_area(addr, end_pfn<<PAGE_SHIFT,
96 nodemap_size, L1_CACHE_BYTES);
Amul Shah076422d22007-02-13 13:26:19 +010097 if (nodemap_addr == -1UL) {
98 printk(KERN_ERR
99 "NUMA: Unable to allocate Memory to Node hash map\n");
100 nodemap_addr = nodemap_size = 0;
101 return -1;
102 }
Yinghai Lu24a5da72008-02-01 17:49:41 +0100103 memnodemap = phys_to_virt(nodemap_addr);
Yinghai Lu25eff8d2008-02-01 17:49:41 +0100104 reserve_early(nodemap_addr, nodemap_addr + nodemap_size, "MEMNODEMAP");
Amul Shah076422d22007-02-13 13:26:19 +0100105
106 printk(KERN_DEBUG "NUMA: Allocated memnodemap from %lx - %lx\n",
107 nodemap_addr, nodemap_addr + nodemap_size);
108 return 0;
109}
110
111/*
112 * The LSB of all start and end addresses in the node map is the value of the
113 * maximum possible shift.
114 */
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100115static int __init extract_lsb_from_nodes(const struct bootnode *nodes,
116 int numnodes)
Amul Shah076422d22007-02-13 13:26:19 +0100117{
Amul Shah54413922007-02-13 13:26:20 +0100118 int i, nodes_used = 0;
Amul Shah076422d22007-02-13 13:26:19 +0100119 unsigned long start, end;
120 unsigned long bitfield = 0, memtop = 0;
121
122 for (i = 0; i < numnodes; i++) {
123 start = nodes[i].start;
124 end = nodes[i].end;
125 if (start >= end)
126 continue;
Amul Shah54413922007-02-13 13:26:20 +0100127 bitfield |= start;
128 nodes_used++;
Amul Shah076422d22007-02-13 13:26:19 +0100129 if (end > memtop)
130 memtop = end;
131 }
Amul Shah54413922007-02-13 13:26:20 +0100132 if (nodes_used <= 1)
133 i = 63;
134 else
135 i = find_first_bit(&bitfield, sizeof(unsigned long)*8);
Amul Shah076422d22007-02-13 13:26:19 +0100136 memnodemapsize = (memtop >> i)+1;
137 return i;
138}
139
Andi Kleenabe059e2006-03-25 16:29:12 +0100140int __init compute_hash_shift(struct bootnode *nodes, int numnodes)
Eric Dumazet529a3402005-11-05 17:25:54 +0100141{
Amul Shah076422d22007-02-13 13:26:19 +0100142 int shift;
Eric Dumazet529a3402005-11-05 17:25:54 +0100143
Amul Shah076422d22007-02-13 13:26:19 +0100144 shift = extract_lsb_from_nodes(nodes, numnodes);
145 if (allocate_cachealigned_memnodemap())
146 return -1;
Andi Kleen6b050f82006-01-11 22:44:33 +0100147 printk(KERN_DEBUG "NUMA: Using %d for the hash shift.\n",
Eric Dumazet529a3402005-11-05 17:25:54 +0100148 shift);
149
150 if (populate_memnodemap(nodes, numnodes, shift) != 1) {
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100151 printk(KERN_INFO "Your memory is not aligned you need to "
152 "rebuild your kernel with a bigger NODEMAPSIZE "
153 "shift=%d\n", shift);
Eric Dumazet529a3402005-11-05 17:25:54 +0100154 return -1;
155 }
Keith Manntheyb6846642005-07-28 21:15:38 -0700156 return shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157}
158
Matt Tolentinobbfceef2005-06-23 00:08:07 -0700159int early_pfn_to_nid(unsigned long pfn)
160{
161 return phys_to_nid(pfn << PAGE_SHIFT);
162}
Matt Tolentinobbfceef2005-06-23 00:08:07 -0700163
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100164static void * __init early_node_mem(int nodeid, unsigned long start,
Yinghai Lu24a5da72008-02-01 17:49:41 +0100165 unsigned long end, unsigned long size,
166 unsigned long align)
Andi Kleena8062232006-04-07 19:49:21 +0200167{
Yinghai Lu24a5da72008-02-01 17:49:41 +0100168 unsigned long mem = find_e820_area(start, end, size, align);
Andi Kleena8062232006-04-07 19:49:21 +0200169 void *ptr;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100170
Yinghai Lu9347e0b2008-02-01 17:49:42 +0100171 if (mem != -1L)
Andi Kleena8062232006-04-07 19:49:21 +0200172 return __va(mem);
Yinghai Lu9347e0b2008-02-01 17:49:42 +0100173
Yinghai Lu24a5da72008-02-01 17:49:41 +0100174 ptr = __alloc_bootmem_nopanic(size, align, __pa(MAX_DMA_ADDRESS));
Yoann Padioleau83e83d52007-10-17 18:04:35 +0200175 if (ptr == NULL) {
Andi Kleena8062232006-04-07 19:49:21 +0200176 printk(KERN_ERR "Cannot find %lu bytes in node %d\n",
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100177 size, nodeid);
Andi Kleena8062232006-04-07 19:49:21 +0200178 return NULL;
179 }
180 return ptr;
181}
182
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183/* Initialize bootmem allocator for a node */
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100184void __init setup_node_bootmem(int nodeid, unsigned long start,
185 unsigned long end)
186{
187 unsigned long start_pfn, end_pfn, bootmap_pages, bootmap_size;
188 unsigned long bootmap_start, nodedata_phys;
Andi Kleena8062232006-04-07 19:49:21 +0200189 void *bootmap;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 const int pgdat_size = round_up(sizeof(pg_data_t), PAGE_SIZE);
191
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100192 start = round_up(start, ZONE_ALIGN);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100194 printk(KERN_INFO "Bootmem setup node %d %016lx-%016lx\n", nodeid,
195 start, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196
197 start_pfn = start >> PAGE_SHIFT;
198 end_pfn = end >> PAGE_SHIFT;
199
Yinghai Lu24a5da72008-02-01 17:49:41 +0100200 node_data[nodeid] = early_node_mem(nodeid, start, end, pgdat_size,
201 SMP_CACHE_BYTES);
Andi Kleena8062232006-04-07 19:49:21 +0200202 if (node_data[nodeid] == NULL)
203 return;
204 nodedata_phys = __pa(node_data[nodeid]);
Yinghai Lu6118f762008-02-04 16:47:56 +0100205 printk(KERN_INFO " NODE_DATA [%016lx - %016lx]\n", nodedata_phys,
206 nodedata_phys + pgdat_size - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208 memset(NODE_DATA(nodeid), 0, sizeof(pg_data_t));
209 NODE_DATA(nodeid)->bdata = &plat_node_bdata[nodeid];
210 NODE_DATA(nodeid)->node_start_pfn = start_pfn;
211 NODE_DATA(nodeid)->node_spanned_pages = end_pfn - start_pfn;
212
213 /* Find a place for the bootmem map */
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100214 bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 bootmap_start = round_up(nodedata_phys + pgdat_size, PAGE_SIZE);
Yinghai Lu24a5da72008-02-01 17:49:41 +0100216 /*
217 * SMP_CAHCE_BYTES could be enough, but init_bootmem_node like
218 * to use that to align to PAGE_SIZE
219 */
Andi Kleena8062232006-04-07 19:49:21 +0200220 bootmap = early_node_mem(nodeid, bootmap_start, end,
Yinghai Lu24a5da72008-02-01 17:49:41 +0100221 bootmap_pages<<PAGE_SHIFT, PAGE_SIZE);
Andi Kleena8062232006-04-07 19:49:21 +0200222 if (bootmap == NULL) {
223 if (nodedata_phys < start || nodedata_phys >= end)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100224 free_bootmem((unsigned long)node_data[nodeid],
225 pgdat_size);
Andi Kleena8062232006-04-07 19:49:21 +0200226 node_data[nodeid] = NULL;
227 return;
228 }
229 bootmap_start = __pa(bootmap);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100230
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231 bootmap_size = init_bootmem_node(NODE_DATA(nodeid),
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100232 bootmap_start >> PAGE_SHIFT,
233 start_pfn, end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234
Yinghai Lu6118f762008-02-04 16:47:56 +0100235 printk(KERN_INFO " bootmap [%016lx - %016lx] pages %lx\n",
236 bootmap_start, bootmap_start + bootmap_size - 1,
237 bootmap_pages);
238
Mel Gorman5cb248a2006-09-27 01:49:52 -0700239 free_bootmem_with_active_regions(nodeid, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100241 reserve_bootmem_node(NODE_DATA(nodeid), nodedata_phys, pgdat_size);
242 reserve_bootmem_node(NODE_DATA(nodeid), bootmap_start,
243 bootmap_pages<<PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200244#ifdef CONFIG_ACPI_NUMA
245 srat_reserve_add_area(nodeid);
246#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 node_set_online(nodeid);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100248}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100250/*
251 * There are unfortunately some poorly designed mainboards around that
252 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
253 * mapping. To avoid this fill in the mapping for all possible CPUs,
254 * as the number of CPUs is not known yet. We round robin the existing
255 * nodes.
256 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257void __init numa_init_array(void)
258{
259 int rr, i;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100260
Ravikiran G Thirumalai85cc5132005-09-30 11:59:22 -0700261 rr = first_node(node_online_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 for (i = 0; i < NR_CPUS; i++) {
travis@sgi.com1ce35712008-01-30 13:33:33 +0100263 if (early_cpu_to_node(i) != NUMA_NO_NODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 continue;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100265 numa_set_node(i, rr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 rr = next_node(rr, node_online_map);
267 if (rr == MAX_NUMNODES)
268 rr = first_node(node_online_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270}
271
272#ifdef CONFIG_NUMA_EMU
Rohit Seth53fee042007-02-13 13:26:22 +0100273/* Numa emulation */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200274char *cmdline __initdata;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275
Rohit Seth53fee042007-02-13 13:26:22 +0100276/*
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100277 * Setups up nid to range from addr to addr + size. If the end
278 * boundary is greater than max_addr, then max_addr is used instead.
279 * The return value is 0 if there is additional memory left for
280 * allocation past addr and -1 otherwise. addr is adjusted to be at
281 * the end of the node.
Rohit Seth53fee042007-02-13 13:26:22 +0100282 */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200283static int __init setup_node_range(int nid, struct bootnode *nodes, u64 *addr,
284 u64 size, u64 max_addr)
Rohit Seth53fee042007-02-13 13:26:22 +0100285{
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200286 int ret = 0;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100287
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200288 nodes[nid].start = *addr;
289 *addr += size;
290 if (*addr >= max_addr) {
291 *addr = max_addr;
292 ret = -1;
293 }
294 nodes[nid].end = *addr;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200295 node_set(nid, node_possible_map);
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200296 printk(KERN_INFO "Faking node %d at %016Lx-%016Lx (%LuMB)\n", nid,
297 nodes[nid].start, nodes[nid].end,
298 (nodes[nid].end - nodes[nid].start) >> 20);
299 return ret;
Rohit Seth53fee042007-02-13 13:26:22 +0100300}
301
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200302/*
303 * Splits num_nodes nodes up equally starting at node_start. The return value
304 * is the number of nodes split up and addr is adjusted to be at the end of the
305 * last node allocated.
306 */
307static int __init split_nodes_equally(struct bootnode *nodes, u64 *addr,
308 u64 max_addr, int node_start,
309 int num_nodes)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310{
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200311 unsigned int big;
312 u64 size;
313 int i;
Rohit Seth53fee042007-02-13 13:26:22 +0100314
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200315 if (num_nodes <= 0)
316 return -1;
317 if (num_nodes > MAX_NUMNODES)
318 num_nodes = MAX_NUMNODES;
David Rientjesa7e96622007-07-21 17:11:29 +0200319 size = (max_addr - *addr - e820_hole_size(*addr, max_addr)) /
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200320 num_nodes;
Rohit Seth53fee042007-02-13 13:26:22 +0100321 /*
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200322 * Calculate the number of big nodes that can be allocated as a result
323 * of consolidating the leftovers.
Rohit Seth53fee042007-02-13 13:26:22 +0100324 */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200325 big = ((size & ~FAKE_NODE_MIN_HASH_MASK) * num_nodes) /
326 FAKE_NODE_MIN_SIZE;
Rohit Seth53fee042007-02-13 13:26:22 +0100327
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200328 /* Round down to nearest FAKE_NODE_MIN_SIZE. */
329 size &= FAKE_NODE_MIN_HASH_MASK;
330 if (!size) {
331 printk(KERN_ERR "Not enough memory for each node. "
332 "NUMA emulation disabled.\n");
333 return -1;
Rohit Seth53fee042007-02-13 13:26:22 +0100334 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200335
336 for (i = node_start; i < num_nodes + node_start; i++) {
337 u64 end = *addr + size;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100338
Rohit Seth53fee042007-02-13 13:26:22 +0100339 if (i < big)
340 end += FAKE_NODE_MIN_SIZE;
341 /*
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200342 * The final node can have the remaining system RAM. Other
343 * nodes receive roughly the same amount of available pages.
Rohit Seth53fee042007-02-13 13:26:22 +0100344 */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200345 if (i == num_nodes + node_start - 1)
Rohit Seth53fee042007-02-13 13:26:22 +0100346 end = max_addr;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200347 else
David Rientjesa7e96622007-07-21 17:11:29 +0200348 while (end - *addr - e820_hole_size(*addr, end) <
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200349 size) {
350 end += FAKE_NODE_MIN_SIZE;
351 if (end > max_addr) {
352 end = max_addr;
353 break;
354 }
355 }
356 if (setup_node_range(i, nodes, addr, end - *addr, max_addr) < 0)
357 break;
358 }
359 return i - node_start + 1;
360}
361
362/*
David Rientjes382591d2007-05-02 19:27:09 +0200363 * Splits the remaining system RAM into chunks of size. The remaining memory is
364 * always assigned to a final node and can be asymmetric. Returns the number of
365 * nodes split.
366 */
367static int __init split_nodes_by_size(struct bootnode *nodes, u64 *addr,
368 u64 max_addr, int node_start, u64 size)
369{
370 int i = node_start;
371 size = (size << 20) & FAKE_NODE_MIN_HASH_MASK;
372 while (!setup_node_range(i++, nodes, addr, size, max_addr))
373 ;
374 return i - node_start;
375}
376
377/*
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200378 * Sets up the system RAM area from start_pfn to end_pfn according to the
379 * numa=fake command-line option.
380 */
381static int __init numa_emulation(unsigned long start_pfn, unsigned long end_pfn)
382{
383 struct bootnode nodes[MAX_NUMNODES];
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100384 u64 size, addr = start_pfn << PAGE_SHIFT;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200385 u64 max_addr = end_pfn << PAGE_SHIFT;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100386 int num_nodes = 0, num = 0, coeff_flag, coeff = -1, i;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200387
388 memset(&nodes, 0, sizeof(nodes));
389 /*
390 * If the numa=fake command-line is just a single number N, split the
391 * system RAM into N fake nodes.
392 */
393 if (!strchr(cmdline, '*') && !strchr(cmdline, ',')) {
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100394 long n = simple_strtol(cmdline, NULL, 0);
395
396 num_nodes = split_nodes_equally(nodes, &addr, max_addr, 0, n);
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200397 if (num_nodes < 0)
398 return num_nodes;
399 goto out;
400 }
401
402 /* Parse the command line. */
David Rientjes382591d2007-05-02 19:27:09 +0200403 for (coeff_flag = 0; ; cmdline++) {
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200404 if (*cmdline && isdigit(*cmdline)) {
405 num = num * 10 + *cmdline - '0';
406 continue;
407 }
David Rientjes382591d2007-05-02 19:27:09 +0200408 if (*cmdline == '*') {
409 if (num > 0)
410 coeff = num;
411 coeff_flag = 1;
412 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200413 if (!*cmdline || *cmdline == ',') {
David Rientjes382591d2007-05-02 19:27:09 +0200414 if (!coeff_flag)
415 coeff = 1;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200416 /*
417 * Round down to the nearest FAKE_NODE_MIN_SIZE.
418 * Command-line coefficients are in megabytes.
419 */
420 size = ((u64)num << 20) & FAKE_NODE_MIN_HASH_MASK;
David Rientjes382591d2007-05-02 19:27:09 +0200421 if (size)
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200422 for (i = 0; i < coeff; i++, num_nodes++)
423 if (setup_node_range(num_nodes, nodes,
424 &addr, size, max_addr) < 0)
425 goto done;
David Rientjes382591d2007-05-02 19:27:09 +0200426 if (!*cmdline)
427 break;
428 coeff_flag = 0;
429 coeff = -1;
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200430 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200431 num = 0;
432 }
433done:
434 if (!num_nodes)
435 return -1;
David Rientjes14694d72007-05-02 19:27:09 +0200436 /* Fill remainder of system RAM, if appropriate. */
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200437 if (addr < max_addr) {
David Rientjes382591d2007-05-02 19:27:09 +0200438 if (coeff_flag && coeff < 0) {
439 /* Split remaining nodes into num-sized chunks */
440 num_nodes += split_nodes_by_size(nodes, &addr, max_addr,
441 num_nodes, num);
442 goto out;
443 }
David Rientjes14694d72007-05-02 19:27:09 +0200444 switch (*(cmdline - 1)) {
445 case '*':
446 /* Split remaining nodes into coeff chunks */
447 if (coeff <= 0)
448 break;
449 num_nodes += split_nodes_equally(nodes, &addr, max_addr,
450 num_nodes, coeff);
451 break;
452 case ',':
453 /* Do not allocate remaining system RAM */
454 break;
455 default:
456 /* Give one final node */
457 setup_node_range(num_nodes, nodes, &addr,
458 max_addr - addr, max_addr);
459 num_nodes++;
460 }
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200461 }
462out:
463 memnode_shift = compute_hash_shift(nodes, num_nodes);
464 if (memnode_shift < 0) {
465 memnode_shift = 0;
466 printk(KERN_ERR "No NUMA hash function found. NUMA emulation "
467 "disabled.\n");
468 return -1;
469 }
470
471 /*
472 * We need to vacate all active ranges that may have been registered by
David Rientjes1c05f092007-07-21 17:11:30 +0200473 * SRAT and set acpi_numa to -1 so that srat_disabled() always returns
474 * true. NUMA emulation has succeeded so we will not scan ACPI nodes.
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200475 */
476 remove_all_active_ranges();
David Rientjes1c05f092007-07-21 17:11:30 +0200477#ifdef CONFIG_ACPI_NUMA
478 acpi_numa = -1;
479#endif
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200480 for_each_node_mask(i, node_possible_map) {
Mel Gorman5cb248a2006-09-27 01:49:52 -0700481 e820_register_active_regions(i, nodes[i].start >> PAGE_SHIFT,
482 nodes[i].end >> PAGE_SHIFT);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100483 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
Mel Gorman5cb248a2006-09-27 01:49:52 -0700484 }
David Rientjes3484d792007-07-21 17:10:32 +0200485 acpi_fake_nodes(nodes, num_nodes);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100486 numa_init_array();
487 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488}
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200489#endif /* CONFIG_NUMA_EMU */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490
491void __init numa_initmem_init(unsigned long start_pfn, unsigned long end_pfn)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100492{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493 int i;
494
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200495 nodes_clear(node_possible_map);
496
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497#ifdef CONFIG_NUMA_EMU
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200498 if (cmdline && !numa_emulation(start_pfn, end_pfn))
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100499 return;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200500 nodes_clear(node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501#endif
502
503#ifdef CONFIG_ACPI_NUMA
504 if (!numa_off && !acpi_scan_nodes(start_pfn << PAGE_SHIFT,
505 end_pfn << PAGE_SHIFT))
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100506 return;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200507 nodes_clear(node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508#endif
509
510#ifdef CONFIG_K8_NUMA
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100511 if (!numa_off && !k8_scan_nodes(start_pfn<<PAGE_SHIFT,
512 end_pfn<<PAGE_SHIFT))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513 return;
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200514 nodes_clear(node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515#endif
516 printk(KERN_INFO "%s\n",
517 numa_off ? "NUMA turned off" : "No NUMA configuration found");
518
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100519 printk(KERN_INFO "Faking a node at %016lx-%016lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 start_pfn << PAGE_SHIFT,
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100521 end_pfn << PAGE_SHIFT);
522 /* setup dummy node covering all memory */
523 memnode_shift = 63;
Amul Shah076422d22007-02-13 13:26:19 +0100524 memnodemap = memnode.embedded_map;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525 memnodemap[0] = 0;
526 nodes_clear(node_online_map);
527 node_set_online(0);
Suresh Siddhae3f1cae2007-05-02 19:27:20 +0200528 node_set(0, node_possible_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700529 for (i = 0; i < NR_CPUS; i++)
Andi Kleen69d81fc2005-11-05 17:25:53 +0100530 numa_set_node(i, 0);
travis@sgi.comdf3825c2008-01-30 13:33:11 +0100531 /* cpumask_of_cpu() may not be available during early startup */
travis@sgi.com3cc87e32008-01-30 13:33:11 +0100532 memset(&node_to_cpumask_map[0], 0, sizeof(node_to_cpumask_map[0]));
533 cpu_set(0, node_to_cpumask_map[0]);
Mel Gorman5cb248a2006-09-27 01:49:52 -0700534 e820_register_active_regions(0, start_pfn, end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700535 setup_node_bootmem(0, start_pfn << PAGE_SHIFT, end_pfn << PAGE_SHIFT);
536}
537
Ashok Raje6982c62005-06-25 14:54:58 -0700538__cpuinit void numa_add_cpu(int cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539{
travis@sgi.com1ce35712008-01-30 13:33:33 +0100540 set_bit(cpu,
541 (unsigned long *)&node_to_cpumask_map[early_cpu_to_node(cpu)]);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100542}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700543
Andi Kleen69d81fc2005-11-05 17:25:53 +0100544void __cpuinit numa_set_node(int cpu, int node)
545{
travis@sgi.com43238382008-01-30 13:33:25 +0100546 int *cpu_to_node_map = x86_cpu_to_node_map_early_ptr;
travis@sgi.comdf3825c2008-01-30 13:33:11 +0100547
Ravikiran G Thirumalaidf79efd2006-01-11 22:45:39 +0100548 cpu_pda(cpu)->nodenumber = node;
travis@sgi.comdf3825c2008-01-30 13:33:11 +0100549
550 if(cpu_to_node_map)
551 cpu_to_node_map[cpu] = node;
552 else if(per_cpu_offset(cpu))
553 per_cpu(x86_cpu_to_node_map, cpu) = node;
554 else
555 Dprintk(KERN_INFO "Setting node for non-present cpu %d\n", cpu);
Andi Kleen69d81fc2005-11-05 17:25:53 +0100556}
557
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100558unsigned long __init numa_free_all_bootmem(void)
559{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560 unsigned long pages = 0;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100561 int i;
562
563 for_each_online_node(i)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700564 pages += free_all_bootmem_node(NODE_DATA(i));
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100565
Linus Torvalds1da177e2005-04-16 15:20:36 -0700566 return pages;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100567}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700568
569void __init paging_init(void)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100570{
Mel Gorman6391af12006-10-11 01:20:39 -0700571 unsigned long max_zone_pfns[MAX_NR_ZONES];
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100572
Mel Gorman6391af12006-10-11 01:20:39 -0700573 memset(max_zone_pfns, 0, sizeof(max_zone_pfns));
574 max_zone_pfns[ZONE_DMA] = MAX_DMA_PFN;
575 max_zone_pfns[ZONE_DMA32] = MAX_DMA32_PFN;
576 max_zone_pfns[ZONE_NORMAL] = end_pfn;
Bob Piccod3ee8712005-11-05 17:25:54 +0100577
Bob Piccof0a5a582007-02-13 13:26:25 +0100578 sparse_memory_present_with_active_regions(MAX_NUMNODES);
579 sparse_init();
Bob Piccod3ee8712005-11-05 17:25:54 +0100580
Mel Gorman5cb248a2006-09-27 01:49:52 -0700581 free_area_init_nodes(max_zone_pfns);
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100582}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200584static __init int numa_setup(char *opt)
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100585{
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200586 if (!opt)
587 return -EINVAL;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100588 if (!strncmp(opt, "off", 3))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700589 numa_off = 1;
590#ifdef CONFIG_NUMA_EMU
David Rientjes8b8ca80e2007-05-02 19:27:09 +0200591 if (!strncmp(opt, "fake=", 5))
592 cmdline = opt + 5;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700593#endif
594#ifdef CONFIG_ACPI_NUMA
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100595 if (!strncmp(opt, "noacpi", 6))
596 acpi_numa = -1;
597 if (!strncmp(opt, "hotadd=", 7))
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200598 hotadd_percent = simple_strtoul(opt+7, NULL, 10);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599#endif
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200600 return 0;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100601}
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200602early_param("numa", numa_setup);
603
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100604/*
605 * Setup early cpu_to_node.
606 *
607 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
608 * and apicid_to_node[] tables have valid entries for a CPU.
609 * This means we skip cpu_to_node[] initialisation for NUMA
610 * emulation and faking node case (when running a kernel compiled
611 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
612 * is already initialized in a round robin manner at numa_init_array,
613 * prior to this call, and this initialization is good enough
614 * for the fake NUMA cases.
615 */
616void __init init_cpu_to_node(void)
617{
618 int i;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100619
620 for (i = 0; i < NR_CPUS; i++) {
travis@sgi.comef970012008-01-30 13:33:10 +0100621 u16 apicid = x86_cpu_to_apicid_init[i];
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100622
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100623 if (apicid == BAD_APICID)
624 continue;
625 if (apicid_to_node[apicid] == NUMA_NO_NODE)
626 continue;
Thomas Gleixnere3cfe522008-01-30 13:30:37 +0100627 numa_set_node(i, apicid_to_node[apicid]);
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100628 }
629}
630
Andi Kleencf050132006-01-11 22:46:27 +0100631