blob: cc02573a327170f80cbf5fa64c99c3d25aad9eef [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Generic VM initialization for x86-64 NUMA setups.
3 * Copyright 2002,2003 Andi Kleen, SuSE Labs.
4 */
5#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>
14
15#include <asm/e820.h>
16#include <asm/proto.h>
17#include <asm/dma.h>
18#include <asm/numa.h>
19#include <asm/acpi.h>
20
21#ifndef Dprintk
22#define Dprintk(x...)
23#endif
24
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070025struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070026bootmem_data_t plat_node_bdata[MAX_NUMNODES];
27
Eric Dumazetdcf36bf2006-03-25 16:31:46 +010028struct memnode memnode;
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
Andi Kleen3f098c22005-09-12 18:49:24 +020030unsigned char cpu_to_node[NR_CPUS] __read_mostly = {
31 [0 ... NR_CPUS-1] = NUMA_NO_NODE
Andi Kleen0b07e982005-09-12 18:49:24 +020032};
Andi Kleen3f098c22005-09-12 18:49:24 +020033unsigned char apicid_to_node[MAX_LOCAL_APIC] __cpuinitdata = {
34 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
35};
36cpumask_t node_to_cpumask[MAX_NUMNODES] __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070037
38int numa_off __initdata;
39
Eric Dumazet529a3402005-11-05 17:25:54 +010040
41/*
42 * Given a shift value, try to populate memnodemap[]
43 * Returns :
44 * 1 if OK
45 * 0 if memnodmap[] too small (of shift too small)
46 * -1 if node overlap or lost ram (shift too big)
47 */
Andi Kleend18ff472006-01-11 22:44:30 +010048static int __init
Andi Kleenabe059e2006-03-25 16:29:12 +010049populate_memnodemap(const struct bootnode *nodes, int numnodes, int shift)
Linus Torvalds1da177e2005-04-16 15:20:36 -070050{
51 int i;
Eric Dumazet529a3402005-11-05 17:25:54 +010052 int res = -1;
53 unsigned long addr, end;
Keith Manntheyb6846642005-07-28 21:15:38 -070054
Eric Dumazet8309cf62005-12-12 22:17:14 -080055 if (shift >= 64)
56 return -1;
Eric Dumazet529a3402005-11-05 17:25:54 +010057 memset(memnodemap, 0xff, sizeof(memnodemap));
58 for (i = 0; i < numnodes; i++) {
59 addr = nodes[i].start;
60 end = nodes[i].end;
61 if (addr >= end)
62 continue;
63 if ((end >> shift) >= NODEMAPSIZE)
64 return 0;
65 do {
66 if (memnodemap[addr >> shift] != 0xff)
67 return -1;
68 memnodemap[addr >> shift] = i;
Eric Dumazet8309cf62005-12-12 22:17:14 -080069 addr += (1UL << shift);
Eric Dumazet529a3402005-11-05 17:25:54 +010070 } while (addr < end);
71 res = 1;
72 }
73 return res;
74}
75
Andi Kleenabe059e2006-03-25 16:29:12 +010076int __init compute_hash_shift(struct bootnode *nodes, int numnodes)
Eric Dumazet529a3402005-11-05 17:25:54 +010077{
78 int shift = 20;
79
80 while (populate_memnodemap(nodes, numnodes, shift + 1) >= 0)
Keith Manntheyb6846642005-07-28 21:15:38 -070081 shift++;
82
Andi Kleen6b050f82006-01-11 22:44:33 +010083 printk(KERN_DEBUG "NUMA: Using %d for the hash shift.\n",
Eric Dumazet529a3402005-11-05 17:25:54 +010084 shift);
85
86 if (populate_memnodemap(nodes, numnodes, shift) != 1) {
87 printk(KERN_INFO
Keith Manntheyb6846642005-07-28 21:15:38 -070088 "Your memory is not aligned you need to rebuild your kernel "
Eric Dumazet529a3402005-11-05 17:25:54 +010089 "with a bigger NODEMAPSIZE shift=%d\n",
90 shift);
91 return -1;
92 }
Keith Manntheyb6846642005-07-28 21:15:38 -070093 return shift;
Linus Torvalds1da177e2005-04-16 15:20:36 -070094}
95
Matt Tolentinobbfceef2005-06-23 00:08:07 -070096#ifdef CONFIG_SPARSEMEM
97int early_pfn_to_nid(unsigned long pfn)
98{
99 return phys_to_nid(pfn << PAGE_SHIFT);
100}
101#endif
102
Andi Kleena8062232006-04-07 19:49:21 +0200103static void * __init
104early_node_mem(int nodeid, unsigned long start, unsigned long end,
105 unsigned long size)
106{
107 unsigned long mem = find_e820_area(start, end, size);
108 void *ptr;
109 if (mem != -1L)
110 return __va(mem);
111 ptr = __alloc_bootmem_nopanic(size,
112 SMP_CACHE_BYTES, __pa(MAX_DMA_ADDRESS));
113 if (ptr == 0) {
114 printk(KERN_ERR "Cannot find %lu bytes in node %d\n",
115 size, nodeid);
116 return NULL;
117 }
118 return ptr;
119}
120
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121/* Initialize bootmem allocator for a node */
122void __init setup_node_bootmem(int nodeid, unsigned long start, unsigned long end)
123{
124 unsigned long start_pfn, end_pfn, bootmap_pages, bootmap_size, bootmap_start;
125 unsigned long nodedata_phys;
Andi Kleena8062232006-04-07 19:49:21 +0200126 void *bootmap;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 const int pgdat_size = round_up(sizeof(pg_data_t), PAGE_SIZE);
128
129 start = round_up(start, ZONE_ALIGN);
130
Andi Kleen6b050f82006-01-11 22:44:33 +0100131 printk(KERN_INFO "Bootmem setup node %d %016lx-%016lx\n", nodeid, start, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132
133 start_pfn = start >> PAGE_SHIFT;
134 end_pfn = end >> PAGE_SHIFT;
135
Andi Kleena8062232006-04-07 19:49:21 +0200136 node_data[nodeid] = early_node_mem(nodeid, start, end, pgdat_size);
137 if (node_data[nodeid] == NULL)
138 return;
139 nodedata_phys = __pa(node_data[nodeid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141 memset(NODE_DATA(nodeid), 0, sizeof(pg_data_t));
142 NODE_DATA(nodeid)->bdata = &plat_node_bdata[nodeid];
143 NODE_DATA(nodeid)->node_start_pfn = start_pfn;
144 NODE_DATA(nodeid)->node_spanned_pages = end_pfn - start_pfn;
145
146 /* Find a place for the bootmem map */
147 bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
148 bootmap_start = round_up(nodedata_phys + pgdat_size, PAGE_SIZE);
Andi Kleena8062232006-04-07 19:49:21 +0200149 bootmap = early_node_mem(nodeid, bootmap_start, end,
150 bootmap_pages<<PAGE_SHIFT);
151 if (bootmap == NULL) {
152 if (nodedata_phys < start || nodedata_phys >= end)
153 free_bootmem((unsigned long)node_data[nodeid],pgdat_size);
154 node_data[nodeid] = NULL;
155 return;
156 }
157 bootmap_start = __pa(bootmap);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158 Dprintk("bootmap start %lu pages %lu\n", bootmap_start, bootmap_pages);
159
160 bootmap_size = init_bootmem_node(NODE_DATA(nodeid),
161 bootmap_start >> PAGE_SHIFT,
162 start_pfn, end_pfn);
163
164 e820_bootmem_free(NODE_DATA(nodeid), start, end);
165
166 reserve_bootmem_node(NODE_DATA(nodeid), nodedata_phys, pgdat_size);
167 reserve_bootmem_node(NODE_DATA(nodeid), bootmap_start, bootmap_pages<<PAGE_SHIFT);
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200168#ifdef CONFIG_ACPI_NUMA
169 srat_reserve_add_area(nodeid);
170#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 node_set_online(nodeid);
172}
173
174/* Initialize final allocator for a zone */
175void __init setup_node_zones(int nodeid)
176{
Andi Kleen267b4802006-03-25 16:31:10 +0100177 unsigned long start_pfn, end_pfn, memmapsize, limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 unsigned long zones[MAX_NR_ZONES];
Andi Kleen485761b2005-08-26 18:34:10 -0700179 unsigned long holes[MAX_NR_ZONES];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180
Andi Kleena2f1b422005-11-05 17:25:53 +0100181 start_pfn = node_start_pfn(nodeid);
182 end_pfn = node_end_pfn(nodeid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183
Andi Kleen6b050f82006-01-11 22:44:33 +0100184 Dprintk(KERN_INFO "Setting up node %d %lx-%lx\n",
Andi Kleena2f1b422005-11-05 17:25:53 +0100185 nodeid, start_pfn, end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186
Andi Kleen267b4802006-03-25 16:31:10 +0100187 /* Try to allocate mem_map at end to not fill up precious <4GB
188 memory. */
189 memmapsize = sizeof(struct page) * (end_pfn-start_pfn);
190 limit = end_pfn << PAGE_SHIFT;
191 NODE_DATA(nodeid)->node_mem_map =
192 __alloc_bootmem_core(NODE_DATA(nodeid)->bdata,
193 memmapsize, SMP_CACHE_BYTES,
194 round_down(limit - memmapsize, PAGE_SIZE),
195 limit);
196
Andi Kleena2f1b422005-11-05 17:25:53 +0100197 size_zones(zones, holes, start_pfn, end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198 free_area_init_node(nodeid, NODE_DATA(nodeid), zones,
Andi Kleen485761b2005-08-26 18:34:10 -0700199 start_pfn, holes);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200}
201
202void __init numa_init_array(void)
203{
204 int rr, i;
205 /* There are unfortunately some poorly designed mainboards around
206 that only connect memory to a single CPU. This breaks the 1:1 cpu->node
207 mapping. To avoid this fill in the mapping for all possible
208 CPUs, as the number of CPUs is not known yet.
209 We round robin the existing nodes. */
Ravikiran G Thirumalai85cc5132005-09-30 11:59:22 -0700210 rr = first_node(node_online_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211 for (i = 0; i < NR_CPUS; i++) {
212 if (cpu_to_node[i] != NUMA_NO_NODE)
213 continue;
Andi Kleen69d81fc2005-11-05 17:25:53 +0100214 numa_set_node(i, rr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 rr = next_node(rr, node_online_map);
216 if (rr == MAX_NUMNODES)
217 rr = first_node(node_online_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 }
219
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220}
221
222#ifdef CONFIG_NUMA_EMU
223int numa_fake __initdata = 0;
224
225/* Numa emulation */
226static int numa_emulation(unsigned long start_pfn, unsigned long end_pfn)
227{
228 int i;
Andi Kleenabe059e2006-03-25 16:29:12 +0100229 struct bootnode nodes[MAX_NUMNODES];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230 unsigned long sz = ((end_pfn - start_pfn)<<PAGE_SHIFT) / numa_fake;
231
232 /* Kludge needed for the hash function */
233 if (hweight64(sz) > 1) {
234 unsigned long x = 1;
235 while ((x << 1) < sz)
236 x <<= 1;
237 if (x < sz/2)
Andi Kleen6b050f82006-01-11 22:44:33 +0100238 printk(KERN_ERR "Numa emulation unbalanced. Complain to maintainer\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700239 sz = x;
240 }
241
242 memset(&nodes,0,sizeof(nodes));
243 for (i = 0; i < numa_fake; i++) {
244 nodes[i].start = (start_pfn<<PAGE_SHIFT) + i*sz;
245 if (i == numa_fake-1)
246 sz = (end_pfn<<PAGE_SHIFT) - nodes[i].start;
247 nodes[i].end = nodes[i].start + sz;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248 printk(KERN_INFO "Faking node %d at %016Lx-%016Lx (%LuMB)\n",
249 i,
250 nodes[i].start, nodes[i].end,
251 (nodes[i].end - nodes[i].start) >> 20);
252 node_set_online(i);
253 }
254 memnode_shift = compute_hash_shift(nodes, numa_fake);
255 if (memnode_shift < 0) {
256 memnode_shift = 0;
257 printk(KERN_ERR "No NUMA hash function found. Emulation disabled.\n");
258 return -1;
259 }
260 for_each_online_node(i)
261 setup_node_bootmem(i, nodes[i].start, nodes[i].end);
262 numa_init_array();
263 return 0;
264}
265#endif
266
267void __init numa_initmem_init(unsigned long start_pfn, unsigned long end_pfn)
268{
269 int i;
270
271#ifdef CONFIG_NUMA_EMU
272 if (numa_fake && !numa_emulation(start_pfn, end_pfn))
273 return;
274#endif
275
276#ifdef CONFIG_ACPI_NUMA
277 if (!numa_off && !acpi_scan_nodes(start_pfn << PAGE_SHIFT,
278 end_pfn << PAGE_SHIFT))
279 return;
280#endif
281
282#ifdef CONFIG_K8_NUMA
283 if (!numa_off && !k8_scan_nodes(start_pfn<<PAGE_SHIFT, end_pfn<<PAGE_SHIFT))
284 return;
285#endif
286 printk(KERN_INFO "%s\n",
287 numa_off ? "NUMA turned off" : "No NUMA configuration found");
288
289 printk(KERN_INFO "Faking a node at %016lx-%016lx\n",
290 start_pfn << PAGE_SHIFT,
291 end_pfn << PAGE_SHIFT);
292 /* setup dummy node covering all memory */
293 memnode_shift = 63;
294 memnodemap[0] = 0;
295 nodes_clear(node_online_map);
296 node_set_online(0);
297 for (i = 0; i < NR_CPUS; i++)
Andi Kleen69d81fc2005-11-05 17:25:53 +0100298 numa_set_node(i, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299 node_to_cpumask[0] = cpumask_of_cpu(0);
300 setup_node_bootmem(0, start_pfn << PAGE_SHIFT, end_pfn << PAGE_SHIFT);
301}
302
Ashok Raje6982c62005-06-25 14:54:58 -0700303__cpuinit void numa_add_cpu(int cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304{
Ravikiran G Thirumalaie6a045a2005-09-30 11:59:21 -0700305 set_bit(cpu, &node_to_cpumask[cpu_to_node(cpu)]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306}
307
Andi Kleen69d81fc2005-11-05 17:25:53 +0100308void __cpuinit numa_set_node(int cpu, int node)
309{
Ravikiran G Thirumalaidf79efd2006-01-11 22:45:39 +0100310 cpu_pda(cpu)->nodenumber = node;
Andi Kleen69d81fc2005-11-05 17:25:53 +0100311 cpu_to_node[cpu] = node;
312}
313
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314unsigned long __init numa_free_all_bootmem(void)
315{
316 int i;
317 unsigned long pages = 0;
318 for_each_online_node(i) {
319 pages += free_all_bootmem_node(NODE_DATA(i));
320 }
321 return pages;
322}
323
Bob Piccod3ee8712005-11-05 17:25:54 +0100324#ifdef CONFIG_SPARSEMEM
325static void __init arch_sparse_init(void)
326{
327 int i;
328
329 for_each_online_node(i)
330 memory_present(i, node_start_pfn(i), node_end_pfn(i));
331
332 sparse_init();
333}
334#else
335#define arch_sparse_init() do {} while (0)
336#endif
337
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338void __init paging_init(void)
339{
340 int i;
Bob Piccod3ee8712005-11-05 17:25:54 +0100341
342 arch_sparse_init();
343
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344 for_each_online_node(i) {
345 setup_node_zones(i);
346 }
347}
348
349/* [numa=off] */
350__init int numa_setup(char *opt)
351{
352 if (!strncmp(opt,"off",3))
353 numa_off = 1;
354#ifdef CONFIG_NUMA_EMU
355 if(!strncmp(opt, "fake=", 5)) {
356 numa_fake = simple_strtoul(opt+5,NULL,0); ;
357 if (numa_fake >= MAX_NUMNODES)
358 numa_fake = MAX_NUMNODES;
359 }
360#endif
361#ifdef CONFIG_ACPI_NUMA
362 if (!strncmp(opt,"noacpi",6))
363 acpi_numa = -1;
Andi Kleen68a3a7f2006-04-07 19:49:18 +0200364 if (!strncmp(opt,"hotadd=", 7))
365 hotadd_percent = simple_strtoul(opt+7, NULL, 10);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366#endif
367 return 1;
368}
369
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100370/*
371 * Setup early cpu_to_node.
372 *
373 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
374 * and apicid_to_node[] tables have valid entries for a CPU.
375 * This means we skip cpu_to_node[] initialisation for NUMA
376 * emulation and faking node case (when running a kernel compiled
377 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
378 * is already initialized in a round robin manner at numa_init_array,
379 * prior to this call, and this initialization is good enough
380 * for the fake NUMA cases.
381 */
382void __init init_cpu_to_node(void)
383{
384 int i;
385 for (i = 0; i < NR_CPUS; i++) {
386 u8 apicid = x86_cpu_to_apicid[i];
387 if (apicid == BAD_APICID)
388 continue;
389 if (apicid_to_node[apicid] == NUMA_NO_NODE)
390 continue;
Daniel Yeisleyd1db4ec2006-02-15 15:17:41 -0800391 numa_set_node(i,apicid_to_node[apicid]);
Ravikiran Thirumalai05b3cbd2006-01-11 22:45:36 +0100392 }
393}
394
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395EXPORT_SYMBOL(cpu_to_node);
396EXPORT_SYMBOL(node_to_cpumask);
Eric Dumazetdcf36bf2006-03-25 16:31:46 +0100397EXPORT_SYMBOL(memnode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398EXPORT_SYMBOL(node_data);
Andi Kleencf050132006-01-11 22:46:27 +0100399
400#ifdef CONFIG_DISCONTIGMEM
401/*
402 * Functions to convert PFNs from/to per node page addresses.
403 * These are out of line because they are quite big.
404 * They could be all tuned by pre caching more state.
405 * Should do that.
406 */
407
Andi Kleencf050132006-01-11 22:46:27 +0100408int pfn_valid(unsigned long pfn)
409{
410 unsigned nid;
411 if (pfn >= num_physpages)
412 return 0;
413 nid = pfn_to_nid(pfn);
414 if (nid == 0xff)
415 return 0;
416 return pfn >= node_start_pfn(nid) && (pfn) < node_end_pfn(nid);
417}
418EXPORT_SYMBOL(pfn_valid);
419#endif