]>
Commit | Line | Data |
---|---|---|
e3cfe529 | 1 | /* |
1da177e4 LT |
2 | * Generic VM initialization for x86-64 NUMA setups. |
3 | * Copyright 2002,2003 Andi Kleen, SuSE Labs. | |
e3cfe529 | 4 | */ |
1da177e4 LT |
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> | |
3cc87e3f | 14 | #include <linux/sched.h> |
1da177e4 LT |
15 | |
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> | |
c9ff0342 | 21 | #include <asm/k8.h> |
1da177e4 | 22 | |
6c231b7b | 23 | struct pglist_data *node_data[MAX_NUMNODES] __read_mostly; |
e3cfe529 TG |
24 | EXPORT_SYMBOL(node_data); |
25 | ||
dcf36bfa | 26 | struct memnode memnode; |
1da177e4 | 27 | |
43238382 | 28 | s16 apicid_to_node[MAX_LOCAL_APIC] __cpuinitdata = { |
e3cfe529 | 29 | [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE |
3f098c26 | 30 | }; |
e3cfe529 | 31 | |
1da177e4 | 32 | int numa_off __initdata; |
864fc31e TG |
33 | static unsigned long __initdata nodemap_addr; |
34 | static unsigned long __initdata nodemap_size; | |
1da177e4 | 35 | |
6470aff6 BG |
36 | DEFINE_PER_CPU(int, node_number) = 0; |
37 | EXPORT_PER_CPU_SYMBOL(node_number); | |
38 | ||
39 | /* | |
40 | * Map cpu index to node index | |
41 | */ | |
42 | DEFINE_EARLY_PER_CPU(int, x86_cpu_to_node_map, NUMA_NO_NODE); | |
43 | EXPORT_EARLY_PER_CPU_SYMBOL(x86_cpu_to_node_map); | |
44 | ||
529a3404 ED |
45 | /* |
46 | * Given a shift value, try to populate memnodemap[] | |
47 | * Returns : | |
48 | * 1 if OK | |
49 | * 0 if memnodmap[] too small (of shift too small) | |
50 | * -1 if node overlap or lost ram (shift too big) | |
51 | */ | |
e3cfe529 | 52 | static int __init populate_memnodemap(const struct bootnode *nodes, |
6ec6e0d9 | 53 | int numnodes, int shift, int *nodeids) |
1da177e4 | 54 | { |
529a3404 | 55 | unsigned long addr, end; |
e3cfe529 | 56 | int i, res = -1; |
b684664f | 57 | |
43238382 | 58 | memset(memnodemap, 0xff, sizeof(s16)*memnodemapsize); |
b684664f | 59 | for (i = 0; i < numnodes; i++) { |
529a3404 ED |
60 | addr = nodes[i].start; |
61 | end = nodes[i].end; | |
62 | if (addr >= end) | |
b684664f | 63 | continue; |
076422d2 | 64 | if ((end >> shift) >= memnodemapsize) |
529a3404 ED |
65 | return 0; |
66 | do { | |
43238382 | 67 | if (memnodemap[addr >> shift] != NUMA_NO_NODE) |
b684664f | 68 | return -1; |
6ec6e0d9 SS |
69 | |
70 | if (!nodeids) | |
71 | memnodemap[addr >> shift] = i; | |
72 | else | |
73 | memnodemap[addr >> shift] = nodeids[i]; | |
74 | ||
076422d2 | 75 | addr += (1UL << shift); |
529a3404 ED |
76 | } while (addr < end); |
77 | res = 1; | |
e3cfe529 | 78 | } |
529a3404 ED |
79 | return res; |
80 | } | |
81 | ||
076422d2 AS |
82 | static int __init allocate_cachealigned_memnodemap(void) |
83 | { | |
24a5da73 | 84 | unsigned long addr; |
076422d2 AS |
85 | |
86 | memnodemap = memnode.embedded_map; | |
316390b0 | 87 | if (memnodemapsize <= ARRAY_SIZE(memnode.embedded_map)) |
076422d2 | 88 | return 0; |
076422d2 | 89 | |
24a5da73 | 90 | addr = 0x8000; |
be3e89ee | 91 | nodemap_size = roundup(sizeof(s16) * memnodemapsize, L1_CACHE_BYTES); |
c987d12f | 92 | nodemap_addr = find_e820_area(addr, max_pfn<<PAGE_SHIFT, |
24a5da73 | 93 | nodemap_size, L1_CACHE_BYTES); |
076422d2 AS |
94 | if (nodemap_addr == -1UL) { |
95 | printk(KERN_ERR | |
96 | "NUMA: Unable to allocate Memory to Node hash map\n"); | |
97 | nodemap_addr = nodemap_size = 0; | |
98 | return -1; | |
99 | } | |
24a5da73 | 100 | memnodemap = phys_to_virt(nodemap_addr); |
25eff8d4 | 101 | reserve_early(nodemap_addr, nodemap_addr + nodemap_size, "MEMNODEMAP"); |
076422d2 AS |
102 | |
103 | printk(KERN_DEBUG "NUMA: Allocated memnodemap from %lx - %lx\n", | |
104 | nodemap_addr, nodemap_addr + nodemap_size); | |
105 | return 0; | |
106 | } | |
107 | ||
108 | /* | |
109 | * The LSB of all start and end addresses in the node map is the value of the | |
110 | * maximum possible shift. | |
111 | */ | |
e3cfe529 TG |
112 | static int __init extract_lsb_from_nodes(const struct bootnode *nodes, |
113 | int numnodes) | |
529a3404 | 114 | { |
54413927 | 115 | int i, nodes_used = 0; |
076422d2 AS |
116 | unsigned long start, end; |
117 | unsigned long bitfield = 0, memtop = 0; | |
118 | ||
119 | for (i = 0; i < numnodes; i++) { | |
120 | start = nodes[i].start; | |
121 | end = nodes[i].end; | |
122 | if (start >= end) | |
123 | continue; | |
54413927 AS |
124 | bitfield |= start; |
125 | nodes_used++; | |
076422d2 AS |
126 | if (end > memtop) |
127 | memtop = end; | |
128 | } | |
54413927 AS |
129 | if (nodes_used <= 1) |
130 | i = 63; | |
131 | else | |
132 | i = find_first_bit(&bitfield, sizeof(unsigned long)*8); | |
076422d2 AS |
133 | memnodemapsize = (memtop >> i)+1; |
134 | return i; | |
135 | } | |
529a3404 | 136 | |
6ec6e0d9 SS |
137 | int __init compute_hash_shift(struct bootnode *nodes, int numnodes, |
138 | int *nodeids) | |
076422d2 AS |
139 | { |
140 | int shift; | |
529a3404 | 141 | |
076422d2 AS |
142 | shift = extract_lsb_from_nodes(nodes, numnodes); |
143 | if (allocate_cachealigned_memnodemap()) | |
144 | return -1; | |
6b050f80 | 145 | printk(KERN_DEBUG "NUMA: Using %d for the hash shift.\n", |
529a3404 ED |
146 | shift); |
147 | ||
6ec6e0d9 | 148 | if (populate_memnodemap(nodes, numnodes, shift, nodeids) != 1) { |
e3cfe529 TG |
149 | printk(KERN_INFO "Your memory is not aligned you need to " |
150 | "rebuild your kernel with a bigger NODEMAPSIZE " | |
151 | "shift=%d\n", shift); | |
529a3404 ED |
152 | return -1; |
153 | } | |
b684664f | 154 | return shift; |
1da177e4 LT |
155 | } |
156 | ||
f2dbcfa7 | 157 | int __meminit __early_pfn_to_nid(unsigned long pfn) |
bbfceef4 MT |
158 | { |
159 | return phys_to_nid(pfn << PAGE_SHIFT); | |
160 | } | |
bbfceef4 | 161 | |
e3cfe529 | 162 | static void * __init early_node_mem(int nodeid, unsigned long start, |
24a5da73 YL |
163 | unsigned long end, unsigned long size, |
164 | unsigned long align) | |
a8062231 | 165 | { |
24a5da73 | 166 | unsigned long mem = find_e820_area(start, end, size, align); |
e3cfe529 | 167 | |
9347e0b0 | 168 | if (mem != -1L) |
a8062231 | 169 | return __va(mem); |
9347e0b0 | 170 | |
1842f90c YL |
171 | |
172 | start = __pa(MAX_DMA_ADDRESS); | |
173 | end = max_low_pfn_mapped << PAGE_SHIFT; | |
174 | mem = find_e820_area(start, end, size, align); | |
175 | if (mem != -1L) | |
176 | return __va(mem); | |
177 | ||
178 | printk(KERN_ERR "Cannot find %lu bytes in node %d\n", | |
e3cfe529 | 179 | size, nodeid); |
1842f90c YL |
180 | |
181 | return NULL; | |
a8062231 AK |
182 | } |
183 | ||
1da177e4 | 184 | /* Initialize bootmem allocator for a node */ |
7c43769a YL |
185 | void __init |
186 | setup_node_bootmem(int nodeid, unsigned long start, unsigned long end) | |
e3cfe529 | 187 | { |
886533a3 | 188 | unsigned long start_pfn, last_pfn, bootmap_pages, bootmap_size; |
7c43769a | 189 | const int pgdat_size = roundup(sizeof(pg_data_t), PAGE_SIZE); |
e3cfe529 | 190 | unsigned long bootmap_start, nodedata_phys; |
a8062231 | 191 | void *bootmap; |
1a27fc0a | 192 | int nid; |
1da177e4 | 193 | |
4c31e92b YL |
194 | if (!end) |
195 | return; | |
196 | ||
7c43769a YL |
197 | /* |
198 | * Don't confuse VM with a node that doesn't have the | |
199 | * minimum amount of memory: | |
200 | */ | |
201 | if (end && (end - start) < NODE_MIN_SIZE) | |
202 | return; | |
203 | ||
be3e89ee | 204 | start = roundup(start, ZONE_ALIGN); |
1da177e4 | 205 | |
e3cfe529 TG |
206 | printk(KERN_INFO "Bootmem setup node %d %016lx-%016lx\n", nodeid, |
207 | start, end); | |
1da177e4 LT |
208 | |
209 | start_pfn = start >> PAGE_SHIFT; | |
886533a3 | 210 | last_pfn = end >> PAGE_SHIFT; |
1da177e4 | 211 | |
24a5da73 YL |
212 | node_data[nodeid] = early_node_mem(nodeid, start, end, pgdat_size, |
213 | SMP_CACHE_BYTES); | |
a8062231 AK |
214 | if (node_data[nodeid] == NULL) |
215 | return; | |
216 | nodedata_phys = __pa(node_data[nodeid]); | |
1842f90c | 217 | reserve_early(nodedata_phys, nodedata_phys + pgdat_size, "NODE_DATA"); |
6118f76f YL |
218 | printk(KERN_INFO " NODE_DATA [%016lx - %016lx]\n", nodedata_phys, |
219 | nodedata_phys + pgdat_size - 1); | |
1842f90c YL |
220 | nid = phys_to_nid(nodedata_phys); |
221 | if (nid != nodeid) | |
222 | printk(KERN_INFO " NODE_DATA(%d) on node %d\n", nodeid, nid); | |
1da177e4 | 223 | |
1da177e4 | 224 | memset(NODE_DATA(nodeid), 0, sizeof(pg_data_t)); |
b61bfa3c | 225 | NODE_DATA(nodeid)->bdata = &bootmem_node_data[nodeid]; |
1da177e4 | 226 | NODE_DATA(nodeid)->node_start_pfn = start_pfn; |
886533a3 | 227 | NODE_DATA(nodeid)->node_spanned_pages = last_pfn - start_pfn; |
1da177e4 | 228 | |
1a27fc0a YL |
229 | /* |
230 | * Find a place for the bootmem map | |
231 | * nodedata_phys could be on other nodes by alloc_bootmem, | |
232 | * so need to sure bootmap_start not to be small, otherwise | |
233 | * early_node_mem will get that with find_e820_area instead | |
234 | * of alloc_bootmem, that could clash with reserved range | |
235 | */ | |
886533a3 | 236 | bootmap_pages = bootmem_bootmap_pages(last_pfn - start_pfn); |
1842f90c | 237 | bootmap_start = roundup(nodedata_phys + pgdat_size, PAGE_SIZE); |
24a5da73 | 238 | /* |
e9197bf0 | 239 | * SMP_CACHE_BYTES could be enough, but init_bootmem_node like |
24a5da73 YL |
240 | * to use that to align to PAGE_SIZE |
241 | */ | |
a8062231 | 242 | bootmap = early_node_mem(nodeid, bootmap_start, end, |
24a5da73 | 243 | bootmap_pages<<PAGE_SHIFT, PAGE_SIZE); |
a8062231 | 244 | if (bootmap == NULL) { |
1842f90c | 245 | free_early(nodedata_phys, nodedata_phys + pgdat_size); |
a8062231 AK |
246 | node_data[nodeid] = NULL; |
247 | return; | |
248 | } | |
249 | bootmap_start = __pa(bootmap); | |
1842f90c YL |
250 | reserve_early(bootmap_start, bootmap_start+(bootmap_pages<<PAGE_SHIFT), |
251 | "BOOTMAP"); | |
e3cfe529 | 252 | |
1da177e4 | 253 | bootmap_size = init_bootmem_node(NODE_DATA(nodeid), |
e3cfe529 | 254 | bootmap_start >> PAGE_SHIFT, |
886533a3 | 255 | start_pfn, last_pfn); |
1da177e4 | 256 | |
6118f76f YL |
257 | printk(KERN_INFO " bootmap [%016lx - %016lx] pages %lx\n", |
258 | bootmap_start, bootmap_start + bootmap_size - 1, | |
259 | bootmap_pages); | |
1a27fc0a YL |
260 | nid = phys_to_nid(bootmap_start); |
261 | if (nid != nodeid) | |
262 | printk(KERN_INFO " bootmap(%d) on node %d\n", nodeid, nid); | |
1842f90c YL |
263 | |
264 | free_bootmem_with_active_regions(nodeid, end); | |
1a27fc0a | 265 | |
1da177e4 | 266 | node_set_online(nodeid); |
e3cfe529 | 267 | } |
1da177e4 | 268 | |
e3cfe529 TG |
269 | /* |
270 | * There are unfortunately some poorly designed mainboards around that | |
271 | * only connect memory to a single CPU. This breaks the 1:1 cpu->node | |
272 | * mapping. To avoid this fill in the mapping for all possible CPUs, | |
273 | * as the number of CPUs is not known yet. We round robin the existing | |
274 | * nodes. | |
275 | */ | |
1da177e4 LT |
276 | void __init numa_init_array(void) |
277 | { | |
278 | int rr, i; | |
e3cfe529 | 279 | |
85cc5135 | 280 | rr = first_node(node_online_map); |
168ef543 | 281 | for (i = 0; i < nr_cpu_ids; i++) { |
1ce35712 | 282 | if (early_cpu_to_node(i) != NUMA_NO_NODE) |
1da177e4 | 283 | continue; |
e3cfe529 | 284 | numa_set_node(i, rr); |
1da177e4 LT |
285 | rr = next_node(rr, node_online_map); |
286 | if (rr == MAX_NUMNODES) | |
287 | rr = first_node(node_online_map); | |
1da177e4 | 288 | } |
1da177e4 LT |
289 | } |
290 | ||
291 | #ifdef CONFIG_NUMA_EMU | |
53fee04f | 292 | /* Numa emulation */ |
adc19389 DR |
293 | static struct bootnode nodes[MAX_NUMNODES] __initdata; |
294 | static struct bootnode physnodes[MAX_NUMNODES] __initdata; | |
864fc31e | 295 | static char *cmdline __initdata; |
1da177e4 | 296 | |
adc19389 DR |
297 | static int __init setup_physnodes(unsigned long start, unsigned long end, |
298 | int acpi, int k8) | |
299 | { | |
300 | int nr_nodes = 0; | |
301 | int ret = 0; | |
302 | int i; | |
303 | ||
304 | #ifdef CONFIG_ACPI_NUMA | |
305 | if (acpi) | |
306 | nr_nodes = acpi_get_nodes(physnodes); | |
307 | #endif | |
308 | #ifdef CONFIG_K8_NUMA | |
309 | if (k8) | |
310 | nr_nodes = k8_get_nodes(physnodes); | |
311 | #endif | |
312 | /* | |
313 | * Basic sanity checking on the physical node map: there may be errors | |
314 | * if the SRAT or K8 incorrectly reported the topology or the mem= | |
315 | * kernel parameter is used. | |
316 | */ | |
317 | for (i = 0; i < nr_nodes; i++) { | |
318 | if (physnodes[i].start == physnodes[i].end) | |
319 | continue; | |
320 | if (physnodes[i].start > end) { | |
321 | physnodes[i].end = physnodes[i].start; | |
322 | continue; | |
323 | } | |
324 | if (physnodes[i].end < start) { | |
325 | physnodes[i].start = physnodes[i].end; | |
326 | continue; | |
327 | } | |
328 | if (physnodes[i].start < start) | |
329 | physnodes[i].start = start; | |
330 | if (physnodes[i].end > end) | |
331 | physnodes[i].end = end; | |
332 | } | |
333 | ||
334 | /* | |
335 | * Remove all nodes that have no memory or were truncated because of the | |
336 | * limited address range. | |
337 | */ | |
338 | for (i = 0; i < nr_nodes; i++) { | |
339 | if (physnodes[i].start == physnodes[i].end) | |
340 | continue; | |
341 | physnodes[ret].start = physnodes[i].start; | |
342 | physnodes[ret].end = physnodes[i].end; | |
343 | ret++; | |
344 | } | |
345 | ||
346 | /* | |
347 | * If no physical topology was detected, a single node is faked to cover | |
348 | * the entire address space. | |
349 | */ | |
350 | if (!ret) { | |
351 | physnodes[ret].start = start; | |
352 | physnodes[ret].end = end; | |
353 | ret = 1; | |
354 | } | |
355 | return ret; | |
356 | } | |
357 | ||
53fee04f | 358 | /* |
e3cfe529 TG |
359 | * Setups up nid to range from addr to addr + size. If the end |
360 | * boundary is greater than max_addr, then max_addr is used instead. | |
361 | * The return value is 0 if there is additional memory left for | |
362 | * allocation past addr and -1 otherwise. addr is adjusted to be at | |
363 | * the end of the node. | |
53fee04f | 364 | */ |
adc19389 | 365 | static int __init setup_node_range(int nid, u64 *addr, u64 size, u64 max_addr) |
53fee04f | 366 | { |
8b8ca80e DR |
367 | int ret = 0; |
368 | nodes[nid].start = *addr; | |
369 | *addr += size; | |
370 | if (*addr >= max_addr) { | |
371 | *addr = max_addr; | |
372 | ret = -1; | |
373 | } | |
374 | nodes[nid].end = *addr; | |
e3f1caee | 375 | node_set(nid, node_possible_map); |
8b8ca80e DR |
376 | printk(KERN_INFO "Faking node %d at %016Lx-%016Lx (%LuMB)\n", nid, |
377 | nodes[nid].start, nodes[nid].end, | |
378 | (nodes[nid].end - nodes[nid].start) >> 20); | |
379 | return ret; | |
53fee04f RS |
380 | } |
381 | ||
adc19389 DR |
382 | /* |
383 | * Sets up nr_nodes fake nodes interleaved over physical nodes ranging from addr | |
384 | * to max_addr. The return value is the number of nodes allocated. | |
385 | */ | |
386 | static int __init split_nodes_interleave(u64 addr, u64 max_addr, | |
387 | int nr_phys_nodes, int nr_nodes) | |
388 | { | |
389 | nodemask_t physnode_mask = NODE_MASK_NONE; | |
390 | u64 size; | |
391 | int big; | |
392 | int ret = 0; | |
393 | int i; | |
394 | ||
395 | if (nr_nodes <= 0) | |
396 | return -1; | |
397 | if (nr_nodes > MAX_NUMNODES) { | |
398 | pr_info("numa=fake=%d too large, reducing to %d\n", | |
399 | nr_nodes, MAX_NUMNODES); | |
400 | nr_nodes = MAX_NUMNODES; | |
401 | } | |
402 | ||
403 | size = (max_addr - addr - e820_hole_size(addr, max_addr)) / nr_nodes; | |
404 | /* | |
405 | * Calculate the number of big nodes that can be allocated as a result | |
406 | * of consolidating the remainder. | |
407 | */ | |
408 | big = ((size & ~FAKE_NODE_MIN_HASH_MASK) & nr_nodes) / | |
409 | FAKE_NODE_MIN_SIZE; | |
410 | ||
411 | size &= FAKE_NODE_MIN_HASH_MASK; | |
412 | if (!size) { | |
413 | pr_err("Not enough memory for each node. " | |
414 | "NUMA emulation disabled.\n"); | |
415 | return -1; | |
416 | } | |
417 | ||
418 | for (i = 0; i < nr_phys_nodes; i++) | |
419 | if (physnodes[i].start != physnodes[i].end) | |
420 | node_set(i, physnode_mask); | |
421 | ||
422 | /* | |
423 | * Continue to fill physical nodes with fake nodes until there is no | |
424 | * memory left on any of them. | |
425 | */ | |
426 | while (nodes_weight(physnode_mask)) { | |
427 | for_each_node_mask(i, physnode_mask) { | |
428 | u64 end = physnodes[i].start + size; | |
429 | u64 dma32_end = PFN_PHYS(MAX_DMA32_PFN); | |
430 | ||
431 | if (ret < big) | |
432 | end += FAKE_NODE_MIN_SIZE; | |
433 | ||
434 | /* | |
435 | * Continue to add memory to this fake node if its | |
436 | * non-reserved memory is less than the per-node size. | |
437 | */ | |
438 | while (end - physnodes[i].start - | |
439 | e820_hole_size(physnodes[i].start, end) < size) { | |
440 | end += FAKE_NODE_MIN_SIZE; | |
441 | if (end > physnodes[i].end) { | |
442 | end = physnodes[i].end; | |
443 | break; | |
444 | } | |
445 | } | |
446 | ||
447 | /* | |
448 | * If there won't be at least FAKE_NODE_MIN_SIZE of | |
449 | * non-reserved memory in ZONE_DMA32 for the next node, | |
450 | * this one must extend to the boundary. | |
451 | */ | |
452 | if (end < dma32_end && dma32_end - end - | |
453 | e820_hole_size(end, dma32_end) < FAKE_NODE_MIN_SIZE) | |
454 | end = dma32_end; | |
455 | ||
456 | /* | |
457 | * If there won't be enough non-reserved memory for the | |
458 | * next node, this one must extend to the end of the | |
459 | * physical node. | |
460 | */ | |
461 | if (physnodes[i].end - end - | |
462 | e820_hole_size(end, physnodes[i].end) < size) | |
463 | end = physnodes[i].end; | |
464 | ||
465 | /* | |
466 | * Avoid allocating more nodes than requested, which can | |
467 | * happen as a result of rounding down each node's size | |
468 | * to FAKE_NODE_MIN_SIZE. | |
469 | */ | |
470 | if (nodes_weight(physnode_mask) + ret >= nr_nodes) | |
471 | end = physnodes[i].end; | |
472 | ||
473 | if (setup_node_range(ret++, &physnodes[i].start, | |
474 | end - physnodes[i].start, | |
475 | physnodes[i].end) < 0) | |
476 | node_clear(i, physnode_mask); | |
477 | } | |
478 | } | |
479 | return ret; | |
480 | } | |
481 | ||
8b8ca80e DR |
482 | /* |
483 | * Splits num_nodes nodes up equally starting at node_start. The return value | |
484 | * is the number of nodes split up and addr is adjusted to be at the end of the | |
485 | * last node allocated. | |
486 | */ | |
adc19389 | 487 | static int __init split_nodes_equally(u64 *addr, u64 max_addr, int node_start, |
8b8ca80e | 488 | int num_nodes) |
1da177e4 | 489 | { |
8b8ca80e DR |
490 | unsigned int big; |
491 | u64 size; | |
492 | int i; | |
53fee04f | 493 | |
8b8ca80e DR |
494 | if (num_nodes <= 0) |
495 | return -1; | |
496 | if (num_nodes > MAX_NUMNODES) | |
497 | num_nodes = MAX_NUMNODES; | |
a7e96629 | 498 | size = (max_addr - *addr - e820_hole_size(*addr, max_addr)) / |
8b8ca80e | 499 | num_nodes; |
53fee04f | 500 | /* |
8b8ca80e DR |
501 | * Calculate the number of big nodes that can be allocated as a result |
502 | * of consolidating the leftovers. | |
53fee04f | 503 | */ |
8b8ca80e DR |
504 | big = ((size & ~FAKE_NODE_MIN_HASH_MASK) * num_nodes) / |
505 | FAKE_NODE_MIN_SIZE; | |
506 | ||
507 | /* Round down to nearest FAKE_NODE_MIN_SIZE. */ | |
508 | size &= FAKE_NODE_MIN_HASH_MASK; | |
509 | if (!size) { | |
510 | printk(KERN_ERR "Not enough memory for each node. " | |
511 | "NUMA emulation disabled.\n"); | |
512 | return -1; | |
53fee04f | 513 | } |
8b8ca80e DR |
514 | |
515 | for (i = node_start; i < num_nodes + node_start; i++) { | |
516 | u64 end = *addr + size; | |
e3cfe529 | 517 | |
53fee04f RS |
518 | if (i < big) |
519 | end += FAKE_NODE_MIN_SIZE; | |
520 | /* | |
8b8ca80e DR |
521 | * The final node can have the remaining system RAM. Other |
522 | * nodes receive roughly the same amount of available pages. | |
53fee04f | 523 | */ |
8b8ca80e DR |
524 | if (i == num_nodes + node_start - 1) |
525 | end = max_addr; | |
526 | else | |
a7e96629 | 527 | while (end - *addr - e820_hole_size(*addr, end) < |
8b8ca80e DR |
528 | size) { |
529 | end += FAKE_NODE_MIN_SIZE; | |
530 | if (end > max_addr) { | |
531 | end = max_addr; | |
532 | break; | |
533 | } | |
534 | } | |
adc19389 | 535 | if (setup_node_range(i, addr, end - *addr, max_addr) < 0) |
8b8ca80e DR |
536 | break; |
537 | } | |
538 | return i - node_start + 1; | |
539 | } | |
540 | ||
382591d5 DR |
541 | /* |
542 | * Splits the remaining system RAM into chunks of size. The remaining memory is | |
543 | * always assigned to a final node and can be asymmetric. Returns the number of | |
544 | * nodes split. | |
545 | */ | |
adc19389 DR |
546 | static int __init split_nodes_by_size(u64 *addr, u64 max_addr, int node_start, |
547 | u64 size) | |
382591d5 DR |
548 | { |
549 | int i = node_start; | |
550 | size = (size << 20) & FAKE_NODE_MIN_HASH_MASK; | |
adc19389 | 551 | while (!setup_node_range(i++, addr, size, max_addr)) |
382591d5 DR |
552 | ; |
553 | return i - node_start; | |
554 | } | |
555 | ||
8b8ca80e | 556 | /* |
886533a3 | 557 | * Sets up the system RAM area from start_pfn to last_pfn according to the |
8b8ca80e DR |
558 | * numa=fake command-line option. |
559 | */ | |
adc19389 DR |
560 | static int __init numa_emulation(unsigned long start_pfn, |
561 | unsigned long last_pfn, int acpi, int k8) | |
8b8ca80e | 562 | { |
e3cfe529 | 563 | u64 size, addr = start_pfn << PAGE_SHIFT; |
886533a3 | 564 | u64 max_addr = last_pfn << PAGE_SHIFT; |
e3cfe529 | 565 | int num_nodes = 0, num = 0, coeff_flag, coeff = -1, i; |
adc19389 | 566 | int num_phys_nodes; |
8b8ca80e | 567 | |
adc19389 | 568 | num_phys_nodes = setup_physnodes(addr, max_addr, acpi, k8); |
8b8ca80e DR |
569 | /* |
570 | * If the numa=fake command-line is just a single number N, split the | |
571 | * system RAM into N fake nodes. | |
572 | */ | |
573 | if (!strchr(cmdline, '*') && !strchr(cmdline, ',')) { | |
e3cfe529 TG |
574 | long n = simple_strtol(cmdline, NULL, 0); |
575 | ||
adc19389 DR |
576 | num_nodes = split_nodes_interleave(addr, max_addr, |
577 | num_phys_nodes, n); | |
8b8ca80e DR |
578 | if (num_nodes < 0) |
579 | return num_nodes; | |
580 | goto out; | |
581 | } | |
582 | ||
583 | /* Parse the command line. */ | |
382591d5 | 584 | for (coeff_flag = 0; ; cmdline++) { |
8b8ca80e DR |
585 | if (*cmdline && isdigit(*cmdline)) { |
586 | num = num * 10 + *cmdline - '0'; | |
587 | continue; | |
53fee04f | 588 | } |
382591d5 DR |
589 | if (*cmdline == '*') { |
590 | if (num > 0) | |
591 | coeff = num; | |
592 | coeff_flag = 1; | |
593 | } | |
8b8ca80e | 594 | if (!*cmdline || *cmdline == ',') { |
382591d5 DR |
595 | if (!coeff_flag) |
596 | coeff = 1; | |
8b8ca80e DR |
597 | /* |
598 | * Round down to the nearest FAKE_NODE_MIN_SIZE. | |
599 | * Command-line coefficients are in megabytes. | |
600 | */ | |
601 | size = ((u64)num << 20) & FAKE_NODE_MIN_HASH_MASK; | |
382591d5 | 602 | if (size) |
8b8ca80e | 603 | for (i = 0; i < coeff; i++, num_nodes++) |
adc19389 DR |
604 | if (setup_node_range(num_nodes, &addr, |
605 | size, max_addr) < 0) | |
8b8ca80e | 606 | goto done; |
382591d5 DR |
607 | if (!*cmdline) |
608 | break; | |
609 | coeff_flag = 0; | |
610 | coeff = -1; | |
53fee04f | 611 | } |
8b8ca80e DR |
612 | num = 0; |
613 | } | |
614 | done: | |
615 | if (!num_nodes) | |
616 | return -1; | |
14694d73 | 617 | /* Fill remainder of system RAM, if appropriate. */ |
8b8ca80e | 618 | if (addr < max_addr) { |
382591d5 DR |
619 | if (coeff_flag && coeff < 0) { |
620 | /* Split remaining nodes into num-sized chunks */ | |
adc19389 | 621 | num_nodes += split_nodes_by_size(&addr, max_addr, |
382591d5 DR |
622 | num_nodes, num); |
623 | goto out; | |
624 | } | |
14694d73 DR |
625 | switch (*(cmdline - 1)) { |
626 | case '*': | |
627 | /* Split remaining nodes into coeff chunks */ | |
628 | if (coeff <= 0) | |
629 | break; | |
adc19389 | 630 | num_nodes += split_nodes_equally(&addr, max_addr, |
14694d73 DR |
631 | num_nodes, coeff); |
632 | break; | |
633 | case ',': | |
634 | /* Do not allocate remaining system RAM */ | |
635 | break; | |
636 | default: | |
637 | /* Give one final node */ | |
adc19389 DR |
638 | setup_node_range(num_nodes, &addr, max_addr - addr, |
639 | max_addr); | |
14694d73 DR |
640 | num_nodes++; |
641 | } | |
8b8ca80e DR |
642 | } |
643 | out: | |
6ec6e0d9 | 644 | memnode_shift = compute_hash_shift(nodes, num_nodes, NULL); |
8b8ca80e DR |
645 | if (memnode_shift < 0) { |
646 | memnode_shift = 0; | |
647 | printk(KERN_ERR "No NUMA hash function found. NUMA emulation " | |
648 | "disabled.\n"); | |
649 | return -1; | |
650 | } | |
651 | ||
652 | /* | |
adc19389 DR |
653 | * We need to vacate all active ranges that may have been registered for |
654 | * the e820 memory map. | |
8b8ca80e DR |
655 | */ |
656 | remove_all_active_ranges(); | |
e3f1caee | 657 | for_each_node_mask(i, node_possible_map) { |
5cb248ab MG |
658 | e820_register_active_regions(i, nodes[i].start >> PAGE_SHIFT, |
659 | nodes[i].end >> PAGE_SHIFT); | |
e3cfe529 | 660 | setup_node_bootmem(i, nodes[i].start, nodes[i].end); |
5cb248ab | 661 | } |
3484d798 | 662 | acpi_fake_nodes(nodes, num_nodes); |
e3cfe529 TG |
663 | numa_init_array(); |
664 | return 0; | |
1da177e4 | 665 | } |
8b8ca80e | 666 | #endif /* CONFIG_NUMA_EMU */ |
1da177e4 | 667 | |
8ee2debc DR |
668 | void __init initmem_init(unsigned long start_pfn, unsigned long last_pfn, |
669 | int acpi, int k8) | |
e3cfe529 | 670 | { |
1da177e4 LT |
671 | int i; |
672 | ||
e3f1caee | 673 | nodes_clear(node_possible_map); |
b7ad149d | 674 | nodes_clear(node_online_map); |
e3f1caee | 675 | |
1da177e4 | 676 | #ifdef CONFIG_NUMA_EMU |
adc19389 | 677 | if (cmdline && !numa_emulation(start_pfn, last_pfn, acpi, k8)) |
e3cfe529 | 678 | return; |
e3f1caee | 679 | nodes_clear(node_possible_map); |
b7ad149d | 680 | nodes_clear(node_online_map); |
1da177e4 LT |
681 | #endif |
682 | ||
683 | #ifdef CONFIG_ACPI_NUMA | |
8716273c DR |
684 | if (!numa_off && acpi && !acpi_scan_nodes(start_pfn << PAGE_SHIFT, |
685 | last_pfn << PAGE_SHIFT)) | |
e3cfe529 | 686 | return; |
e3f1caee | 687 | nodes_clear(node_possible_map); |
b7ad149d | 688 | nodes_clear(node_online_map); |
1da177e4 LT |
689 | #endif |
690 | ||
691 | #ifdef CONFIG_K8_NUMA | |
8ee2debc | 692 | if (!numa_off && k8 && !k8_scan_nodes()) |
1da177e4 | 693 | return; |
e3f1caee | 694 | nodes_clear(node_possible_map); |
b7ad149d | 695 | nodes_clear(node_online_map); |
1da177e4 LT |
696 | #endif |
697 | printk(KERN_INFO "%s\n", | |
698 | numa_off ? "NUMA turned off" : "No NUMA configuration found"); | |
699 | ||
e3cfe529 | 700 | printk(KERN_INFO "Faking a node at %016lx-%016lx\n", |
1da177e4 | 701 | start_pfn << PAGE_SHIFT, |
886533a3 | 702 | last_pfn << PAGE_SHIFT); |
e3cfe529 TG |
703 | /* setup dummy node covering all memory */ |
704 | memnode_shift = 63; | |
076422d2 | 705 | memnodemap = memnode.embedded_map; |
1da177e4 | 706 | memnodemap[0] = 0; |
1da177e4 | 707 | node_set_online(0); |
e3f1caee | 708 | node_set(0, node_possible_map); |
168ef543 | 709 | for (i = 0; i < nr_cpu_ids; i++) |
69d81fcd | 710 | numa_set_node(i, 0); |
886533a3 TG |
711 | e820_register_active_regions(0, start_pfn, last_pfn); |
712 | setup_node_bootmem(0, start_pfn << PAGE_SHIFT, last_pfn << PAGE_SHIFT); | |
69d81fcd AK |
713 | } |
714 | ||
e3cfe529 TG |
715 | unsigned long __init numa_free_all_bootmem(void) |
716 | { | |
1da177e4 | 717 | unsigned long pages = 0; |
e3cfe529 TG |
718 | int i; |
719 | ||
720 | for_each_online_node(i) | |
1da177e4 | 721 | pages += free_all_bootmem_node(NODE_DATA(i)); |
e3cfe529 | 722 | |
1da177e4 | 723 | return pages; |
e3cfe529 | 724 | } |
1da177e4 | 725 | |
2c8c0e6b | 726 | static __init int numa_setup(char *opt) |
e3cfe529 | 727 | { |
2c8c0e6b AK |
728 | if (!opt) |
729 | return -EINVAL; | |
e3cfe529 | 730 | if (!strncmp(opt, "off", 3)) |
1da177e4 LT |
731 | numa_off = 1; |
732 | #ifdef CONFIG_NUMA_EMU | |
8b8ca80e DR |
733 | if (!strncmp(opt, "fake=", 5)) |
734 | cmdline = opt + 5; | |
1da177e4 LT |
735 | #endif |
736 | #ifdef CONFIG_ACPI_NUMA | |
e3cfe529 TG |
737 | if (!strncmp(opt, "noacpi", 6)) |
738 | acpi_numa = -1; | |
1da177e4 | 739 | #endif |
2c8c0e6b | 740 | return 0; |
e3cfe529 | 741 | } |
2c8c0e6b AK |
742 | early_param("numa", numa_setup); |
743 | ||
23ca4bba | 744 | #ifdef CONFIG_NUMA |
d9c2d5ac YL |
745 | |
746 | static __init int find_near_online_node(int node) | |
747 | { | |
748 | int n, val; | |
749 | int min_val = INT_MAX; | |
750 | int best_node = -1; | |
751 | ||
752 | for_each_online_node(n) { | |
753 | val = node_distance(node, n); | |
754 | ||
755 | if (val < min_val) { | |
756 | min_val = val; | |
757 | best_node = n; | |
758 | } | |
759 | } | |
760 | ||
761 | return best_node; | |
762 | } | |
763 | ||
05b3cbd8 RT |
764 | /* |
765 | * Setup early cpu_to_node. | |
766 | * | |
767 | * Populate cpu_to_node[] only if x86_cpu_to_apicid[], | |
768 | * and apicid_to_node[] tables have valid entries for a CPU. | |
769 | * This means we skip cpu_to_node[] initialisation for NUMA | |
770 | * emulation and faking node case (when running a kernel compiled | |
771 | * for NUMA on a non NUMA box), which is OK as cpu_to_node[] | |
772 | * is already initialized in a round robin manner at numa_init_array, | |
773 | * prior to this call, and this initialization is good enough | |
774 | * for the fake NUMA cases. | |
23ca4bba MT |
775 | * |
776 | * Called before the per_cpu areas are setup. | |
05b3cbd8 RT |
777 | */ |
778 | void __init init_cpu_to_node(void) | |
779 | { | |
23ca4bba MT |
780 | int cpu; |
781 | u16 *cpu_to_apicid = early_per_cpu_ptr(x86_cpu_to_apicid); | |
e3cfe529 | 782 | |
23ca4bba MT |
783 | BUG_ON(cpu_to_apicid == NULL); |
784 | ||
785 | for_each_possible_cpu(cpu) { | |
7c9e92b6 | 786 | int node; |
23ca4bba | 787 | u16 apicid = cpu_to_apicid[cpu]; |
e3cfe529 | 788 | |
05b3cbd8 RT |
789 | if (apicid == BAD_APICID) |
790 | continue; | |
7c9e92b6 YL |
791 | node = apicid_to_node[apicid]; |
792 | if (node == NUMA_NO_NODE) | |
05b3cbd8 | 793 | continue; |
7c9e92b6 | 794 | if (!node_online(node)) |
d9c2d5ac | 795 | node = find_near_online_node(node); |
23ca4bba | 796 | numa_set_node(cpu, node); |
05b3cbd8 RT |
797 | } |
798 | } | |
23ca4bba | 799 | #endif |
05b3cbd8 | 800 | |
cf050132 | 801 | |
6470aff6 BG |
802 | void __cpuinit numa_set_node(int cpu, int node) |
803 | { | |
804 | int *cpu_to_node_map = early_per_cpu_ptr(x86_cpu_to_node_map); | |
805 | ||
806 | /* early setting, no percpu area yet */ | |
807 | if (cpu_to_node_map) { | |
808 | cpu_to_node_map[cpu] = node; | |
809 | return; | |
810 | } | |
811 | ||
812 | #ifdef CONFIG_DEBUG_PER_CPU_MAPS | |
44581a28 | 813 | if (cpu >= nr_cpu_ids || !cpu_possible(cpu)) { |
6470aff6 BG |
814 | printk(KERN_ERR "numa_set_node: invalid cpu# (%d)\n", cpu); |
815 | dump_stack(); | |
816 | return; | |
817 | } | |
818 | #endif | |
819 | per_cpu(x86_cpu_to_node_map, cpu) = node; | |
820 | ||
821 | if (node != NUMA_NO_NODE) | |
822 | per_cpu(node_number, cpu) = node; | |
823 | } | |
824 | ||
825 | void __cpuinit numa_clear_node(int cpu) | |
826 | { | |
827 | numa_set_node(cpu, NUMA_NO_NODE); | |
828 | } | |
829 | ||
830 | #ifndef CONFIG_DEBUG_PER_CPU_MAPS | |
831 | ||
832 | void __cpuinit numa_add_cpu(int cpu) | |
833 | { | |
c032ef60 | 834 | cpumask_set_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]); |
6470aff6 BG |
835 | } |
836 | ||
837 | void __cpuinit numa_remove_cpu(int cpu) | |
838 | { | |
c032ef60 | 839 | cpumask_clear_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]); |
6470aff6 BG |
840 | } |
841 | ||
842 | #else /* CONFIG_DEBUG_PER_CPU_MAPS */ | |
843 | ||
844 | /* | |
845 | * --------- debug versions of the numa functions --------- | |
846 | */ | |
847 | static void __cpuinit numa_set_cpumask(int cpu, int enable) | |
848 | { | |
849 | int node = early_cpu_to_node(cpu); | |
73e907de | 850 | struct cpumask *mask; |
6470aff6 BG |
851 | char buf[64]; |
852 | ||
c032ef60 RR |
853 | mask = node_to_cpumask_map[node]; |
854 | if (mask == NULL) { | |
855 | printk(KERN_ERR "node_to_cpumask_map[%i] NULL\n", node); | |
6470aff6 BG |
856 | dump_stack(); |
857 | return; | |
858 | } | |
859 | ||
6470aff6 | 860 | if (enable) |
c032ef60 | 861 | cpumask_set_cpu(cpu, mask); |
6470aff6 | 862 | else |
c032ef60 | 863 | cpumask_clear_cpu(cpu, mask); |
6470aff6 BG |
864 | |
865 | cpulist_scnprintf(buf, sizeof(buf), mask); | |
866 | printk(KERN_DEBUG "%s cpu %d node %d: mask now %s\n", | |
867 | enable ? "numa_add_cpu" : "numa_remove_cpu", cpu, node, buf); | |
868 | } | |
869 | ||
870 | void __cpuinit numa_add_cpu(int cpu) | |
871 | { | |
872 | numa_set_cpumask(cpu, 1); | |
873 | } | |
874 | ||
875 | void __cpuinit numa_remove_cpu(int cpu) | |
876 | { | |
877 | numa_set_cpumask(cpu, 0); | |
878 | } | |
879 | ||
880 | int cpu_to_node(int cpu) | |
881 | { | |
882 | if (early_per_cpu_ptr(x86_cpu_to_node_map)) { | |
883 | printk(KERN_WARNING | |
884 | "cpu_to_node(%d): usage too early!\n", cpu); | |
885 | dump_stack(); | |
886 | return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu]; | |
887 | } | |
888 | return per_cpu(x86_cpu_to_node_map, cpu); | |
889 | } | |
890 | EXPORT_SYMBOL(cpu_to_node); | |
891 | ||
892 | /* | |
893 | * Same function as cpu_to_node() but used if called before the | |
894 | * per_cpu areas are setup. | |
895 | */ | |
896 | int early_cpu_to_node(int cpu) | |
897 | { | |
898 | if (early_per_cpu_ptr(x86_cpu_to_node_map)) | |
899 | return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu]; | |
900 | ||
44581a28 | 901 | if (!cpu_possible(cpu)) { |
6470aff6 BG |
902 | printk(KERN_WARNING |
903 | "early_cpu_to_node(%d): no per_cpu area!\n", cpu); | |
904 | dump_stack(); | |
905 | return NUMA_NO_NODE; | |
906 | } | |
907 | return per_cpu(x86_cpu_to_node_map, cpu); | |
908 | } | |
909 | ||
6470aff6 BG |
910 | /* |
911 | * --------- end of debug versions of the numa functions --------- | |
912 | */ | |
913 | ||
914 | #endif /* CONFIG_DEBUG_PER_CPU_MAPS */ |