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