Loading...
1// SPDX-License-Identifier: GPL-2.0-only
2/* Common code for 32 and 64-bit NUMA */
3#include <linux/acpi.h>
4#include <linux/kernel.h>
5#include <linux/mm.h>
6#include <linux/string.h>
7#include <linux/init.h>
8#include <linux/memblock.h>
9#include <linux/mmzone.h>
10#include <linux/ctype.h>
11#include <linux/nodemask.h>
12#include <linux/sched.h>
13#include <linux/topology.h>
14
15#include <asm/e820/api.h>
16#include <asm/proto.h>
17#include <asm/dma.h>
18#include <asm/amd_nb.h>
19
20#include "numa_internal.h"
21
22int numa_off;
23nodemask_t numa_nodes_parsed __initdata;
24
25struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
26EXPORT_SYMBOL(node_data);
27
28static struct numa_meminfo numa_meminfo __initdata_or_meminfo;
29static struct numa_meminfo numa_reserved_meminfo __initdata_or_meminfo;
30
31static int numa_distance_cnt;
32static u8 *numa_distance;
33
34static __init int numa_setup(char *opt)
35{
36 if (!opt)
37 return -EINVAL;
38 if (!strncmp(opt, "off", 3))
39 numa_off = 1;
40 if (!strncmp(opt, "fake=", 5))
41 return numa_emu_cmdline(opt + 5);
42 if (!strncmp(opt, "noacpi", 6))
43 disable_srat();
44 if (!strncmp(opt, "nohmat", 6))
45 disable_hmat();
46 return 0;
47}
48early_param("numa", numa_setup);
49
50/*
51 * apicid, cpu, node mappings
52 */
53s16 __apicid_to_node[MAX_LOCAL_APIC] = {
54 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
55};
56
57int numa_cpu_node(int cpu)
58{
59 int apicid = early_per_cpu(x86_cpu_to_apicid, cpu);
60
61 if (apicid != BAD_APICID)
62 return __apicid_to_node[apicid];
63 return NUMA_NO_NODE;
64}
65
66cpumask_var_t node_to_cpumask_map[MAX_NUMNODES];
67EXPORT_SYMBOL(node_to_cpumask_map);
68
69/*
70 * Map cpu index to node index
71 */
72DEFINE_EARLY_PER_CPU(int, x86_cpu_to_node_map, NUMA_NO_NODE);
73EXPORT_EARLY_PER_CPU_SYMBOL(x86_cpu_to_node_map);
74
75void numa_set_node(int cpu, int node)
76{
77 int *cpu_to_node_map = early_per_cpu_ptr(x86_cpu_to_node_map);
78
79 /* early setting, no percpu area yet */
80 if (cpu_to_node_map) {
81 cpu_to_node_map[cpu] = node;
82 return;
83 }
84
85#ifdef CONFIG_DEBUG_PER_CPU_MAPS
86 if (cpu >= nr_cpu_ids || !cpu_possible(cpu)) {
87 printk(KERN_ERR "numa_set_node: invalid cpu# (%d)\n", cpu);
88 dump_stack();
89 return;
90 }
91#endif
92 per_cpu(x86_cpu_to_node_map, cpu) = node;
93
94 set_cpu_numa_node(cpu, node);
95}
96
97void numa_clear_node(int cpu)
98{
99 numa_set_node(cpu, NUMA_NO_NODE);
100}
101
102/*
103 * Allocate node_to_cpumask_map based on number of available nodes
104 * Requires node_possible_map to be valid.
105 *
106 * Note: cpumask_of_node() is not valid until after this is done.
107 * (Use CONFIG_DEBUG_PER_CPU_MAPS to check this.)
108 */
109void __init setup_node_to_cpumask_map(void)
110{
111 unsigned int node;
112
113 /* setup nr_node_ids if not done yet */
114 if (nr_node_ids == MAX_NUMNODES)
115 setup_nr_node_ids();
116
117 /* allocate the map */
118 for (node = 0; node < nr_node_ids; node++)
119 alloc_bootmem_cpumask_var(&node_to_cpumask_map[node]);
120
121 /* cpumask_of_node() will now work */
122 pr_debug("Node to cpumask map for %u nodes\n", nr_node_ids);
123}
124
125static int __init numa_add_memblk_to(int nid, u64 start, u64 end,
126 struct numa_meminfo *mi)
127{
128 /* ignore zero length blks */
129 if (start == end)
130 return 0;
131
132 /* whine about and ignore invalid blks */
133 if (start > end || nid < 0 || nid >= MAX_NUMNODES) {
134 pr_warn("Warning: invalid memblk node %d [mem %#010Lx-%#010Lx]\n",
135 nid, start, end - 1);
136 return 0;
137 }
138
139 if (mi->nr_blks >= NR_NODE_MEMBLKS) {
140 pr_err("too many memblk ranges\n");
141 return -EINVAL;
142 }
143
144 mi->blk[mi->nr_blks].start = start;
145 mi->blk[mi->nr_blks].end = end;
146 mi->blk[mi->nr_blks].nid = nid;
147 mi->nr_blks++;
148 return 0;
149}
150
151/**
152 * numa_remove_memblk_from - Remove one numa_memblk from a numa_meminfo
153 * @idx: Index of memblk to remove
154 * @mi: numa_meminfo to remove memblk from
155 *
156 * Remove @idx'th numa_memblk from @mi by shifting @mi->blk[] and
157 * decrementing @mi->nr_blks.
158 */
159void __init numa_remove_memblk_from(int idx, struct numa_meminfo *mi)
160{
161 mi->nr_blks--;
162 memmove(&mi->blk[idx], &mi->blk[idx + 1],
163 (mi->nr_blks - idx) * sizeof(mi->blk[0]));
164}
165
166/**
167 * numa_move_tail_memblk - Move a numa_memblk from one numa_meminfo to another
168 * @dst: numa_meminfo to append block to
169 * @idx: Index of memblk to remove
170 * @src: numa_meminfo to remove memblk from
171 */
172static void __init numa_move_tail_memblk(struct numa_meminfo *dst, int idx,
173 struct numa_meminfo *src)
174{
175 dst->blk[dst->nr_blks++] = src->blk[idx];
176 numa_remove_memblk_from(idx, src);
177}
178
179/**
180 * numa_add_memblk - Add one numa_memblk to numa_meminfo
181 * @nid: NUMA node ID of the new memblk
182 * @start: Start address of the new memblk
183 * @end: End address of the new memblk
184 *
185 * Add a new memblk to the default numa_meminfo.
186 *
187 * RETURNS:
188 * 0 on success, -errno on failure.
189 */
190int __init numa_add_memblk(int nid, u64 start, u64 end)
191{
192 return numa_add_memblk_to(nid, start, end, &numa_meminfo);
193}
194
195/* Allocate NODE_DATA for a node on the local memory */
196static void __init alloc_node_data(int nid)
197{
198 const size_t nd_size = roundup(sizeof(pg_data_t), PAGE_SIZE);
199 u64 nd_pa;
200 void *nd;
201 int tnid;
202
203 /*
204 * Allocate node data. Try node-local memory and then any node.
205 * Never allocate in DMA zone.
206 */
207 nd_pa = memblock_phys_alloc_try_nid(nd_size, SMP_CACHE_BYTES, nid);
208 if (!nd_pa) {
209 pr_err("Cannot find %zu bytes in any node (initial node: %d)\n",
210 nd_size, nid);
211 return;
212 }
213 nd = __va(nd_pa);
214
215 /* report and initialize */
216 printk(KERN_INFO "NODE_DATA(%d) allocated [mem %#010Lx-%#010Lx]\n", nid,
217 nd_pa, nd_pa + nd_size - 1);
218 tnid = early_pfn_to_nid(nd_pa >> PAGE_SHIFT);
219 if (tnid != nid)
220 printk(KERN_INFO " NODE_DATA(%d) on node %d\n", nid, tnid);
221
222 node_data[nid] = nd;
223 memset(NODE_DATA(nid), 0, sizeof(pg_data_t));
224
225 node_set_online(nid);
226}
227
228/**
229 * numa_cleanup_meminfo - Cleanup a numa_meminfo
230 * @mi: numa_meminfo to clean up
231 *
232 * Sanitize @mi by merging and removing unnecessary memblks. Also check for
233 * conflicts and clear unused memblks.
234 *
235 * RETURNS:
236 * 0 on success, -errno on failure.
237 */
238int __init numa_cleanup_meminfo(struct numa_meminfo *mi)
239{
240 const u64 low = 0;
241 const u64 high = PFN_PHYS(max_pfn);
242 int i, j, k;
243
244 /* first, trim all entries */
245 for (i = 0; i < mi->nr_blks; i++) {
246 struct numa_memblk *bi = &mi->blk[i];
247
248 /* move / save reserved memory ranges */
249 if (!memblock_overlaps_region(&memblock.memory,
250 bi->start, bi->end - bi->start)) {
251 numa_move_tail_memblk(&numa_reserved_meminfo, i--, mi);
252 continue;
253 }
254
255 /* make sure all non-reserved blocks are inside the limits */
256 bi->start = max(bi->start, low);
257
258 /* preserve info for non-RAM areas above 'max_pfn': */
259 if (bi->end > high) {
260 numa_add_memblk_to(bi->nid, high, bi->end,
261 &numa_reserved_meminfo);
262 bi->end = high;
263 }
264
265 /* and there's no empty block */
266 if (bi->start >= bi->end)
267 numa_remove_memblk_from(i--, mi);
268 }
269
270 /* merge neighboring / overlapping entries */
271 for (i = 0; i < mi->nr_blks; i++) {
272 struct numa_memblk *bi = &mi->blk[i];
273
274 for (j = i + 1; j < mi->nr_blks; j++) {
275 struct numa_memblk *bj = &mi->blk[j];
276 u64 start, end;
277
278 /*
279 * See whether there are overlapping blocks. Whine
280 * about but allow overlaps of the same nid. They
281 * will be merged below.
282 */
283 if (bi->end > bj->start && bi->start < bj->end) {
284 if (bi->nid != bj->nid) {
285 pr_err("node %d [mem %#010Lx-%#010Lx] overlaps with node %d [mem %#010Lx-%#010Lx]\n",
286 bi->nid, bi->start, bi->end - 1,
287 bj->nid, bj->start, bj->end - 1);
288 return -EINVAL;
289 }
290 pr_warn("Warning: node %d [mem %#010Lx-%#010Lx] overlaps with itself [mem %#010Lx-%#010Lx]\n",
291 bi->nid, bi->start, bi->end - 1,
292 bj->start, bj->end - 1);
293 }
294
295 /*
296 * Join together blocks on the same node, holes
297 * between which don't overlap with memory on other
298 * nodes.
299 */
300 if (bi->nid != bj->nid)
301 continue;
302 start = min(bi->start, bj->start);
303 end = max(bi->end, bj->end);
304 for (k = 0; k < mi->nr_blks; k++) {
305 struct numa_memblk *bk = &mi->blk[k];
306
307 if (bi->nid == bk->nid)
308 continue;
309 if (start < bk->end && end > bk->start)
310 break;
311 }
312 if (k < mi->nr_blks)
313 continue;
314 printk(KERN_INFO "NUMA: Node %d [mem %#010Lx-%#010Lx] + [mem %#010Lx-%#010Lx] -> [mem %#010Lx-%#010Lx]\n",
315 bi->nid, bi->start, bi->end - 1, bj->start,
316 bj->end - 1, start, end - 1);
317 bi->start = start;
318 bi->end = end;
319 numa_remove_memblk_from(j--, mi);
320 }
321 }
322
323 /* clear unused ones */
324 for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {
325 mi->blk[i].start = mi->blk[i].end = 0;
326 mi->blk[i].nid = NUMA_NO_NODE;
327 }
328
329 return 0;
330}
331
332/*
333 * Set nodes, which have memory in @mi, in *@nodemask.
334 */
335static void __init numa_nodemask_from_meminfo(nodemask_t *nodemask,
336 const struct numa_meminfo *mi)
337{
338 int i;
339
340 for (i = 0; i < ARRAY_SIZE(mi->blk); i++)
341 if (mi->blk[i].start != mi->blk[i].end &&
342 mi->blk[i].nid != NUMA_NO_NODE)
343 node_set(mi->blk[i].nid, *nodemask);
344}
345
346/**
347 * numa_reset_distance - Reset NUMA distance table
348 *
349 * The current table is freed. The next numa_set_distance() call will
350 * create a new one.
351 */
352void __init numa_reset_distance(void)
353{
354 size_t size = numa_distance_cnt * numa_distance_cnt * sizeof(numa_distance[0]);
355
356 /* numa_distance could be 1LU marking allocation failure, test cnt */
357 if (numa_distance_cnt)
358 memblock_free(numa_distance, size);
359 numa_distance_cnt = 0;
360 numa_distance = NULL; /* enable table creation */
361}
362
363static int __init numa_alloc_distance(void)
364{
365 nodemask_t nodes_parsed;
366 size_t size;
367 int i, j, cnt = 0;
368 u64 phys;
369
370 /* size the new table and allocate it */
371 nodes_parsed = numa_nodes_parsed;
372 numa_nodemask_from_meminfo(&nodes_parsed, &numa_meminfo);
373
374 for_each_node_mask(i, nodes_parsed)
375 cnt = i;
376 cnt++;
377 size = cnt * cnt * sizeof(numa_distance[0]);
378
379 phys = memblock_phys_alloc_range(size, PAGE_SIZE, 0,
380 PFN_PHYS(max_pfn_mapped));
381 if (!phys) {
382 pr_warn("Warning: can't allocate distance table!\n");
383 /* don't retry until explicitly reset */
384 numa_distance = (void *)1LU;
385 return -ENOMEM;
386 }
387
388 numa_distance = __va(phys);
389 numa_distance_cnt = cnt;
390
391 /* fill with the default distances */
392 for (i = 0; i < cnt; i++)
393 for (j = 0; j < cnt; j++)
394 numa_distance[i * cnt + j] = i == j ?
395 LOCAL_DISTANCE : REMOTE_DISTANCE;
396 printk(KERN_DEBUG "NUMA: Initialized distance table, cnt=%d\n", cnt);
397
398 return 0;
399}
400
401/**
402 * numa_set_distance - Set NUMA distance from one NUMA to another
403 * @from: the 'from' node to set distance
404 * @to: the 'to' node to set distance
405 * @distance: NUMA distance
406 *
407 * Set the distance from node @from to @to to @distance. If distance table
408 * doesn't exist, one which is large enough to accommodate all the currently
409 * known nodes will be created.
410 *
411 * If such table cannot be allocated, a warning is printed and further
412 * calls are ignored until the distance table is reset with
413 * numa_reset_distance().
414 *
415 * If @from or @to is higher than the highest known node or lower than zero
416 * at the time of table creation or @distance doesn't make sense, the call
417 * is ignored.
418 * This is to allow simplification of specific NUMA config implementations.
419 */
420void __init numa_set_distance(int from, int to, int distance)
421{
422 if (!numa_distance && numa_alloc_distance() < 0)
423 return;
424
425 if (from >= numa_distance_cnt || to >= numa_distance_cnt ||
426 from < 0 || to < 0) {
427 pr_warn_once("Warning: node ids are out of bound, from=%d to=%d distance=%d\n",
428 from, to, distance);
429 return;
430 }
431
432 if ((u8)distance != distance ||
433 (from == to && distance != LOCAL_DISTANCE)) {
434 pr_warn_once("Warning: invalid distance parameter, from=%d to=%d distance=%d\n",
435 from, to, distance);
436 return;
437 }
438
439 numa_distance[from * numa_distance_cnt + to] = distance;
440}
441
442int __node_distance(int from, int to)
443{
444 if (from >= numa_distance_cnt || to >= numa_distance_cnt)
445 return from == to ? LOCAL_DISTANCE : REMOTE_DISTANCE;
446 return numa_distance[from * numa_distance_cnt + to];
447}
448EXPORT_SYMBOL(__node_distance);
449
450/*
451 * Sanity check to catch more bad NUMA configurations (they are amazingly
452 * common). Make sure the nodes cover all memory.
453 */
454static bool __init numa_meminfo_cover_memory(const struct numa_meminfo *mi)
455{
456 u64 numaram, e820ram;
457 int i;
458
459 numaram = 0;
460 for (i = 0; i < mi->nr_blks; i++) {
461 u64 s = mi->blk[i].start >> PAGE_SHIFT;
462 u64 e = mi->blk[i].end >> PAGE_SHIFT;
463 numaram += e - s;
464 numaram -= __absent_pages_in_range(mi->blk[i].nid, s, e);
465 if ((s64)numaram < 0)
466 numaram = 0;
467 }
468
469 e820ram = max_pfn - absent_pages_in_range(0, max_pfn);
470
471 /* We seem to lose 3 pages somewhere. Allow 1M of slack. */
472 if ((s64)(e820ram - numaram) >= (1 << (20 - PAGE_SHIFT))) {
473 printk(KERN_ERR "NUMA: nodes only cover %LuMB of your %LuMB e820 RAM. Not used.\n",
474 (numaram << PAGE_SHIFT) >> 20,
475 (e820ram << PAGE_SHIFT) >> 20);
476 return false;
477 }
478 return true;
479}
480
481/*
482 * Mark all currently memblock-reserved physical memory (which covers the
483 * kernel's own memory ranges) as hot-unswappable.
484 */
485static void __init numa_clear_kernel_node_hotplug(void)
486{
487 nodemask_t reserved_nodemask = NODE_MASK_NONE;
488 struct memblock_region *mb_region;
489 int i;
490
491 /*
492 * We have to do some preprocessing of memblock regions, to
493 * make them suitable for reservation.
494 *
495 * At this time, all memory regions reserved by memblock are
496 * used by the kernel, but those regions are not split up
497 * along node boundaries yet, and don't necessarily have their
498 * node ID set yet either.
499 *
500 * So iterate over all memory known to the x86 architecture,
501 * and use those ranges to set the nid in memblock.reserved.
502 * This will split up the memblock regions along node
503 * boundaries and will set the node IDs as well.
504 */
505 for (i = 0; i < numa_meminfo.nr_blks; i++) {
506 struct numa_memblk *mb = numa_meminfo.blk + i;
507 int ret;
508
509 ret = memblock_set_node(mb->start, mb->end - mb->start, &memblock.reserved, mb->nid);
510 WARN_ON_ONCE(ret);
511 }
512
513 /*
514 * Now go over all reserved memblock regions, to construct a
515 * node mask of all kernel reserved memory areas.
516 *
517 * [ Note, when booting with mem=nn[kMG] or in a kdump kernel,
518 * numa_meminfo might not include all memblock.reserved
519 * memory ranges, because quirks such as trim_snb_memory()
520 * reserve specific pages for Sandy Bridge graphics. ]
521 */
522 for_each_reserved_mem_region(mb_region) {
523 int nid = memblock_get_region_node(mb_region);
524
525 if (nid != MAX_NUMNODES)
526 node_set(nid, reserved_nodemask);
527 }
528
529 /*
530 * Finally, clear the MEMBLOCK_HOTPLUG flag for all memory
531 * belonging to the reserved node mask.
532 *
533 * Note that this will include memory regions that reside
534 * on nodes that contain kernel memory - entire nodes
535 * become hot-unpluggable:
536 */
537 for (i = 0; i < numa_meminfo.nr_blks; i++) {
538 struct numa_memblk *mb = numa_meminfo.blk + i;
539
540 if (!node_isset(mb->nid, reserved_nodemask))
541 continue;
542
543 memblock_clear_hotplug(mb->start, mb->end - mb->start);
544 }
545}
546
547static int __init numa_register_memblks(struct numa_meminfo *mi)
548{
549 int i, nid;
550
551 /* Account for nodes with cpus and no memory */
552 node_possible_map = numa_nodes_parsed;
553 numa_nodemask_from_meminfo(&node_possible_map, mi);
554 if (WARN_ON(nodes_empty(node_possible_map)))
555 return -EINVAL;
556
557 for (i = 0; i < mi->nr_blks; i++) {
558 struct numa_memblk *mb = &mi->blk[i];
559 memblock_set_node(mb->start, mb->end - mb->start,
560 &memblock.memory, mb->nid);
561 }
562
563 /*
564 * At very early time, the kernel have to use some memory such as
565 * loading the kernel image. We cannot prevent this anyway. So any
566 * node the kernel resides in should be un-hotpluggable.
567 *
568 * And when we come here, alloc node data won't fail.
569 */
570 numa_clear_kernel_node_hotplug();
571
572 /*
573 * If sections array is gonna be used for pfn -> nid mapping, check
574 * whether its granularity is fine enough.
575 */
576 if (IS_ENABLED(NODE_NOT_IN_PAGE_FLAGS)) {
577 unsigned long pfn_align = node_map_pfn_alignment();
578
579 if (pfn_align && pfn_align < PAGES_PER_SECTION) {
580 pr_warn("Node alignment %LuMB < min %LuMB, rejecting NUMA config\n",
581 PFN_PHYS(pfn_align) >> 20,
582 PFN_PHYS(PAGES_PER_SECTION) >> 20);
583 return -EINVAL;
584 }
585 }
586 if (!numa_meminfo_cover_memory(mi))
587 return -EINVAL;
588
589 /* Finally register nodes. */
590 for_each_node_mask(nid, node_possible_map) {
591 u64 start = PFN_PHYS(max_pfn);
592 u64 end = 0;
593
594 for (i = 0; i < mi->nr_blks; i++) {
595 if (nid != mi->blk[i].nid)
596 continue;
597 start = min(mi->blk[i].start, start);
598 end = max(mi->blk[i].end, end);
599 }
600
601 if (start >= end)
602 continue;
603
604 /*
605 * Don't confuse VM with a node that doesn't have the
606 * minimum amount of memory:
607 */
608 if (end && (end - start) < NODE_MIN_SIZE)
609 continue;
610
611 alloc_node_data(nid);
612 }
613
614 /* Dump memblock with node info and return. */
615 memblock_dump_all();
616 return 0;
617}
618
619/*
620 * There are unfortunately some poorly designed mainboards around that
621 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
622 * mapping. To avoid this fill in the mapping for all possible CPUs,
623 * as the number of CPUs is not known yet. We round robin the existing
624 * nodes.
625 */
626static void __init numa_init_array(void)
627{
628 int rr, i;
629
630 rr = first_node(node_online_map);
631 for (i = 0; i < nr_cpu_ids; i++) {
632 if (early_cpu_to_node(i) != NUMA_NO_NODE)
633 continue;
634 numa_set_node(i, rr);
635 rr = next_node_in(rr, node_online_map);
636 }
637}
638
639static int __init numa_init(int (*init_func)(void))
640{
641 int i;
642 int ret;
643
644 for (i = 0; i < MAX_LOCAL_APIC; i++)
645 set_apicid_to_node(i, NUMA_NO_NODE);
646
647 nodes_clear(numa_nodes_parsed);
648 nodes_clear(node_possible_map);
649 nodes_clear(node_online_map);
650 memset(&numa_meminfo, 0, sizeof(numa_meminfo));
651 WARN_ON(memblock_set_node(0, ULLONG_MAX, &memblock.memory,
652 MAX_NUMNODES));
653 WARN_ON(memblock_set_node(0, ULLONG_MAX, &memblock.reserved,
654 MAX_NUMNODES));
655 /* In case that parsing SRAT failed. */
656 WARN_ON(memblock_clear_hotplug(0, ULLONG_MAX));
657 numa_reset_distance();
658
659 ret = init_func();
660 if (ret < 0)
661 return ret;
662
663 /*
664 * We reset memblock back to the top-down direction
665 * here because if we configured ACPI_NUMA, we have
666 * parsed SRAT in init_func(). It is ok to have the
667 * reset here even if we did't configure ACPI_NUMA
668 * or acpi numa init fails and fallbacks to dummy
669 * numa init.
670 */
671 memblock_set_bottom_up(false);
672
673 ret = numa_cleanup_meminfo(&numa_meminfo);
674 if (ret < 0)
675 return ret;
676
677 numa_emulation(&numa_meminfo, numa_distance_cnt);
678
679 ret = numa_register_memblks(&numa_meminfo);
680 if (ret < 0)
681 return ret;
682
683 for (i = 0; i < nr_cpu_ids; i++) {
684 int nid = early_cpu_to_node(i);
685
686 if (nid == NUMA_NO_NODE)
687 continue;
688 if (!node_online(nid))
689 numa_clear_node(i);
690 }
691 numa_init_array();
692
693 return 0;
694}
695
696/**
697 * dummy_numa_init - Fallback dummy NUMA init
698 *
699 * Used if there's no underlying NUMA architecture, NUMA initialization
700 * fails, or NUMA is disabled on the command line.
701 *
702 * Must online at least one node and add memory blocks that cover all
703 * allowed memory. This function must not fail.
704 */
705static int __init dummy_numa_init(void)
706{
707 printk(KERN_INFO "%s\n",
708 numa_off ? "NUMA turned off" : "No NUMA configuration found");
709 printk(KERN_INFO "Faking a node at [mem %#018Lx-%#018Lx]\n",
710 0LLU, PFN_PHYS(max_pfn) - 1);
711
712 node_set(0, numa_nodes_parsed);
713 numa_add_memblk(0, 0, PFN_PHYS(max_pfn));
714
715 return 0;
716}
717
718/**
719 * x86_numa_init - Initialize NUMA
720 *
721 * Try each configured NUMA initialization method until one succeeds. The
722 * last fallback is dummy single node config encompassing whole memory and
723 * never fails.
724 */
725void __init x86_numa_init(void)
726{
727 if (!numa_off) {
728#ifdef CONFIG_ACPI_NUMA
729 if (!numa_init(x86_acpi_numa_init))
730 return;
731#endif
732#ifdef CONFIG_AMD_NUMA
733 if (!numa_init(amd_numa_init))
734 return;
735#endif
736 }
737
738 numa_init(dummy_numa_init);
739}
740
741
742/*
743 * A node may exist which has one or more Generic Initiators but no CPUs and no
744 * memory.
745 *
746 * This function must be called after init_cpu_to_node(), to ensure that any
747 * memoryless CPU nodes have already been brought online, and before the
748 * node_data[nid] is needed for zone list setup in build_all_zonelists().
749 *
750 * When this function is called, any nodes containing either memory and/or CPUs
751 * will already be online and there is no need to do anything extra, even if
752 * they also contain one or more Generic Initiators.
753 */
754void __init init_gi_nodes(void)
755{
756 int nid;
757
758 /*
759 * Exclude this node from
760 * bringup_nonboot_cpus
761 * cpu_up
762 * __try_online_node
763 * register_one_node
764 * because node_subsys is not initialized yet.
765 * TODO remove dependency on node_online
766 */
767 for_each_node_state(nid, N_GENERIC_INITIATOR)
768 if (!node_online(nid))
769 node_set_online(nid);
770}
771
772/*
773 * Setup early cpu_to_node.
774 *
775 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
776 * and apicid_to_node[] tables have valid entries for a CPU.
777 * This means we skip cpu_to_node[] initialisation for NUMA
778 * emulation and faking node case (when running a kernel compiled
779 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
780 * is already initialized in a round robin manner at numa_init_array,
781 * prior to this call, and this initialization is good enough
782 * for the fake NUMA cases.
783 *
784 * Called before the per_cpu areas are setup.
785 */
786void __init init_cpu_to_node(void)
787{
788 int cpu;
789 u16 *cpu_to_apicid = early_per_cpu_ptr(x86_cpu_to_apicid);
790
791 BUG_ON(cpu_to_apicid == NULL);
792
793 for_each_possible_cpu(cpu) {
794 int node = numa_cpu_node(cpu);
795
796 if (node == NUMA_NO_NODE)
797 continue;
798
799 /*
800 * Exclude this node from
801 * bringup_nonboot_cpus
802 * cpu_up
803 * __try_online_node
804 * register_one_node
805 * because node_subsys is not initialized yet.
806 * TODO remove dependency on node_online
807 */
808 if (!node_online(node))
809 node_set_online(node);
810
811 numa_set_node(cpu, node);
812 }
813}
814
815#ifndef CONFIG_DEBUG_PER_CPU_MAPS
816
817# ifndef CONFIG_NUMA_EMU
818void numa_add_cpu(int cpu)
819{
820 cpumask_set_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
821}
822
823void numa_remove_cpu(int cpu)
824{
825 cpumask_clear_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
826}
827# endif /* !CONFIG_NUMA_EMU */
828
829#else /* !CONFIG_DEBUG_PER_CPU_MAPS */
830
831int __cpu_to_node(int cpu)
832{
833 if (early_per_cpu_ptr(x86_cpu_to_node_map)) {
834 printk(KERN_WARNING
835 "cpu_to_node(%d): usage too early!\n", cpu);
836 dump_stack();
837 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
838 }
839 return per_cpu(x86_cpu_to_node_map, cpu);
840}
841EXPORT_SYMBOL(__cpu_to_node);
842
843/*
844 * Same function as cpu_to_node() but used if called before the
845 * per_cpu areas are setup.
846 */
847int early_cpu_to_node(int cpu)
848{
849 if (early_per_cpu_ptr(x86_cpu_to_node_map))
850 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
851
852 if (!cpu_possible(cpu)) {
853 printk(KERN_WARNING
854 "early_cpu_to_node(%d): no per_cpu area!\n", cpu);
855 dump_stack();
856 return NUMA_NO_NODE;
857 }
858 return per_cpu(x86_cpu_to_node_map, cpu);
859}
860
861void debug_cpumask_set_cpu(int cpu, int node, bool enable)
862{
863 struct cpumask *mask;
864
865 if (node == NUMA_NO_NODE) {
866 /* early_cpu_to_node() already emits a warning and trace */
867 return;
868 }
869 mask = node_to_cpumask_map[node];
870 if (!cpumask_available(mask)) {
871 pr_err("node_to_cpumask_map[%i] NULL\n", node);
872 dump_stack();
873 return;
874 }
875
876 if (enable)
877 cpumask_set_cpu(cpu, mask);
878 else
879 cpumask_clear_cpu(cpu, mask);
880
881 printk(KERN_DEBUG "%s cpu %d node %d: mask now %*pbl\n",
882 enable ? "numa_add_cpu" : "numa_remove_cpu",
883 cpu, node, cpumask_pr_args(mask));
884 return;
885}
886
887# ifndef CONFIG_NUMA_EMU
888static void numa_set_cpumask(int cpu, bool enable)
889{
890 debug_cpumask_set_cpu(cpu, early_cpu_to_node(cpu), enable);
891}
892
893void numa_add_cpu(int cpu)
894{
895 numa_set_cpumask(cpu, true);
896}
897
898void numa_remove_cpu(int cpu)
899{
900 numa_set_cpumask(cpu, false);
901}
902# endif /* !CONFIG_NUMA_EMU */
903
904/*
905 * Returns a pointer to the bitmask of CPUs on Node 'node'.
906 */
907const struct cpumask *cpumask_of_node(int node)
908{
909 if ((unsigned)node >= nr_node_ids) {
910 printk(KERN_WARNING
911 "cpumask_of_node(%d): (unsigned)node >= nr_node_ids(%u)\n",
912 node, nr_node_ids);
913 dump_stack();
914 return cpu_none_mask;
915 }
916 if (!cpumask_available(node_to_cpumask_map[node])) {
917 printk(KERN_WARNING
918 "cpumask_of_node(%d): no node_to_cpumask_map!\n",
919 node);
920 dump_stack();
921 return cpu_online_mask;
922 }
923 return node_to_cpumask_map[node];
924}
925EXPORT_SYMBOL(cpumask_of_node);
926
927#endif /* !CONFIG_DEBUG_PER_CPU_MAPS */
928
929#ifdef CONFIG_NUMA_KEEP_MEMINFO
930static int meminfo_to_nid(struct numa_meminfo *mi, u64 start)
931{
932 int i;
933
934 for (i = 0; i < mi->nr_blks; i++)
935 if (mi->blk[i].start <= start && mi->blk[i].end > start)
936 return mi->blk[i].nid;
937 return NUMA_NO_NODE;
938}
939
940int phys_to_target_node(phys_addr_t start)
941{
942 int nid = meminfo_to_nid(&numa_meminfo, start);
943
944 /*
945 * Prefer online nodes, but if reserved memory might be
946 * hot-added continue the search with reserved ranges.
947 */
948 if (nid != NUMA_NO_NODE)
949 return nid;
950
951 return meminfo_to_nid(&numa_reserved_meminfo, start);
952}
953EXPORT_SYMBOL_GPL(phys_to_target_node);
954
955int memory_add_physaddr_to_nid(u64 start)
956{
957 int nid = meminfo_to_nid(&numa_meminfo, start);
958
959 if (nid == NUMA_NO_NODE)
960 nid = numa_meminfo.blk[0].nid;
961 return nid;
962}
963EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
964#endif
1/* Common code for 32 and 64-bit NUMA */
2#include <linux/acpi.h>
3#include <linux/kernel.h>
4#include <linux/mm.h>
5#include <linux/string.h>
6#include <linux/init.h>
7#include <linux/bootmem.h>
8#include <linux/memblock.h>
9#include <linux/mmzone.h>
10#include <linux/ctype.h>
11#include <linux/nodemask.h>
12#include <linux/sched.h>
13#include <linux/topology.h>
14
15#include <asm/e820/api.h>
16#include <asm/proto.h>
17#include <asm/dma.h>
18#include <asm/amd_nb.h>
19
20#include "numa_internal.h"
21
22int numa_off;
23nodemask_t numa_nodes_parsed __initdata;
24
25struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
26EXPORT_SYMBOL(node_data);
27
28static struct numa_meminfo numa_meminfo
29#ifndef CONFIG_MEMORY_HOTPLUG
30__initdata
31#endif
32;
33
34static int numa_distance_cnt;
35static u8 *numa_distance;
36
37static __init int numa_setup(char *opt)
38{
39 if (!opt)
40 return -EINVAL;
41 if (!strncmp(opt, "off", 3))
42 numa_off = 1;
43#ifdef CONFIG_NUMA_EMU
44 if (!strncmp(opt, "fake=", 5))
45 numa_emu_cmdline(opt + 5);
46#endif
47#ifdef CONFIG_ACPI_NUMA
48 if (!strncmp(opt, "noacpi", 6))
49 acpi_numa = -1;
50#endif
51 return 0;
52}
53early_param("numa", numa_setup);
54
55/*
56 * apicid, cpu, node mappings
57 */
58s16 __apicid_to_node[MAX_LOCAL_APIC] = {
59 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
60};
61
62int numa_cpu_node(int cpu)
63{
64 int apicid = early_per_cpu(x86_cpu_to_apicid, cpu);
65
66 if (apicid != BAD_APICID)
67 return __apicid_to_node[apicid];
68 return NUMA_NO_NODE;
69}
70
71cpumask_var_t node_to_cpumask_map[MAX_NUMNODES];
72EXPORT_SYMBOL(node_to_cpumask_map);
73
74/*
75 * Map cpu index to node index
76 */
77DEFINE_EARLY_PER_CPU(int, x86_cpu_to_node_map, NUMA_NO_NODE);
78EXPORT_EARLY_PER_CPU_SYMBOL(x86_cpu_to_node_map);
79
80void numa_set_node(int cpu, int node)
81{
82 int *cpu_to_node_map = early_per_cpu_ptr(x86_cpu_to_node_map);
83
84 /* early setting, no percpu area yet */
85 if (cpu_to_node_map) {
86 cpu_to_node_map[cpu] = node;
87 return;
88 }
89
90#ifdef CONFIG_DEBUG_PER_CPU_MAPS
91 if (cpu >= nr_cpu_ids || !cpu_possible(cpu)) {
92 printk(KERN_ERR "numa_set_node: invalid cpu# (%d)\n", cpu);
93 dump_stack();
94 return;
95 }
96#endif
97 per_cpu(x86_cpu_to_node_map, cpu) = node;
98
99 set_cpu_numa_node(cpu, node);
100}
101
102void numa_clear_node(int cpu)
103{
104 numa_set_node(cpu, NUMA_NO_NODE);
105}
106
107/*
108 * Allocate node_to_cpumask_map based on number of available nodes
109 * Requires node_possible_map to be valid.
110 *
111 * Note: cpumask_of_node() is not valid until after this is done.
112 * (Use CONFIG_DEBUG_PER_CPU_MAPS to check this.)
113 */
114void __init setup_node_to_cpumask_map(void)
115{
116 unsigned int node;
117
118 /* setup nr_node_ids if not done yet */
119 if (nr_node_ids == MAX_NUMNODES)
120 setup_nr_node_ids();
121
122 /* allocate the map */
123 for (node = 0; node < nr_node_ids; node++)
124 alloc_bootmem_cpumask_var(&node_to_cpumask_map[node]);
125
126 /* cpumask_of_node() will now work */
127 pr_debug("Node to cpumask map for %d nodes\n", nr_node_ids);
128}
129
130static int __init numa_add_memblk_to(int nid, u64 start, u64 end,
131 struct numa_meminfo *mi)
132{
133 /* ignore zero length blks */
134 if (start == end)
135 return 0;
136
137 /* whine about and ignore invalid blks */
138 if (start > end || nid < 0 || nid >= MAX_NUMNODES) {
139 pr_warning("NUMA: Warning: invalid memblk node %d [mem %#010Lx-%#010Lx]\n",
140 nid, start, end - 1);
141 return 0;
142 }
143
144 if (mi->nr_blks >= NR_NODE_MEMBLKS) {
145 pr_err("NUMA: too many memblk ranges\n");
146 return -EINVAL;
147 }
148
149 mi->blk[mi->nr_blks].start = start;
150 mi->blk[mi->nr_blks].end = end;
151 mi->blk[mi->nr_blks].nid = nid;
152 mi->nr_blks++;
153 return 0;
154}
155
156/**
157 * numa_remove_memblk_from - Remove one numa_memblk from a numa_meminfo
158 * @idx: Index of memblk to remove
159 * @mi: numa_meminfo to remove memblk from
160 *
161 * Remove @idx'th numa_memblk from @mi by shifting @mi->blk[] and
162 * decrementing @mi->nr_blks.
163 */
164void __init numa_remove_memblk_from(int idx, struct numa_meminfo *mi)
165{
166 mi->nr_blks--;
167 memmove(&mi->blk[idx], &mi->blk[idx + 1],
168 (mi->nr_blks - idx) * sizeof(mi->blk[0]));
169}
170
171/**
172 * numa_add_memblk - Add one numa_memblk to numa_meminfo
173 * @nid: NUMA node ID of the new memblk
174 * @start: Start address of the new memblk
175 * @end: End address of the new memblk
176 *
177 * Add a new memblk to the default numa_meminfo.
178 *
179 * RETURNS:
180 * 0 on success, -errno on failure.
181 */
182int __init numa_add_memblk(int nid, u64 start, u64 end)
183{
184 return numa_add_memblk_to(nid, start, end, &numa_meminfo);
185}
186
187/* Allocate NODE_DATA for a node on the local memory */
188static void __init alloc_node_data(int nid)
189{
190 const size_t nd_size = roundup(sizeof(pg_data_t), PAGE_SIZE);
191 u64 nd_pa;
192 void *nd;
193 int tnid;
194
195 /*
196 * Allocate node data. Try node-local memory and then any node.
197 * Never allocate in DMA zone.
198 */
199 nd_pa = memblock_alloc_nid(nd_size, SMP_CACHE_BYTES, nid);
200 if (!nd_pa) {
201 nd_pa = __memblock_alloc_base(nd_size, SMP_CACHE_BYTES,
202 MEMBLOCK_ALLOC_ACCESSIBLE);
203 if (!nd_pa) {
204 pr_err("Cannot find %zu bytes in any node (initial node: %d)\n",
205 nd_size, nid);
206 return;
207 }
208 }
209 nd = __va(nd_pa);
210
211 /* report and initialize */
212 printk(KERN_INFO "NODE_DATA(%d) allocated [mem %#010Lx-%#010Lx]\n", nid,
213 nd_pa, nd_pa + nd_size - 1);
214 tnid = early_pfn_to_nid(nd_pa >> PAGE_SHIFT);
215 if (tnid != nid)
216 printk(KERN_INFO " NODE_DATA(%d) on node %d\n", nid, tnid);
217
218 node_data[nid] = nd;
219 memset(NODE_DATA(nid), 0, sizeof(pg_data_t));
220
221 node_set_online(nid);
222}
223
224/**
225 * numa_cleanup_meminfo - Cleanup a numa_meminfo
226 * @mi: numa_meminfo to clean up
227 *
228 * Sanitize @mi by merging and removing unnecessary memblks. Also check for
229 * conflicts and clear unused memblks.
230 *
231 * RETURNS:
232 * 0 on success, -errno on failure.
233 */
234int __init numa_cleanup_meminfo(struct numa_meminfo *mi)
235{
236 const u64 low = 0;
237 const u64 high = PFN_PHYS(max_pfn);
238 int i, j, k;
239
240 /* first, trim all entries */
241 for (i = 0; i < mi->nr_blks; i++) {
242 struct numa_memblk *bi = &mi->blk[i];
243
244 /* make sure all blocks are inside the limits */
245 bi->start = max(bi->start, low);
246 bi->end = min(bi->end, high);
247
248 /* and there's no empty or non-exist block */
249 if (bi->start >= bi->end ||
250 !memblock_overlaps_region(&memblock.memory,
251 bi->start, bi->end - bi->start))
252 numa_remove_memblk_from(i--, mi);
253 }
254
255 /* merge neighboring / overlapping entries */
256 for (i = 0; i < mi->nr_blks; i++) {
257 struct numa_memblk *bi = &mi->blk[i];
258
259 for (j = i + 1; j < mi->nr_blks; j++) {
260 struct numa_memblk *bj = &mi->blk[j];
261 u64 start, end;
262
263 /*
264 * See whether there are overlapping blocks. Whine
265 * about but allow overlaps of the same nid. They
266 * will be merged below.
267 */
268 if (bi->end > bj->start && bi->start < bj->end) {
269 if (bi->nid != bj->nid) {
270 pr_err("NUMA: node %d [mem %#010Lx-%#010Lx] overlaps with node %d [mem %#010Lx-%#010Lx]\n",
271 bi->nid, bi->start, bi->end - 1,
272 bj->nid, bj->start, bj->end - 1);
273 return -EINVAL;
274 }
275 pr_warning("NUMA: Warning: node %d [mem %#010Lx-%#010Lx] overlaps with itself [mem %#010Lx-%#010Lx]\n",
276 bi->nid, bi->start, bi->end - 1,
277 bj->start, bj->end - 1);
278 }
279
280 /*
281 * Join together blocks on the same node, holes
282 * between which don't overlap with memory on other
283 * nodes.
284 */
285 if (bi->nid != bj->nid)
286 continue;
287 start = min(bi->start, bj->start);
288 end = max(bi->end, bj->end);
289 for (k = 0; k < mi->nr_blks; k++) {
290 struct numa_memblk *bk = &mi->blk[k];
291
292 if (bi->nid == bk->nid)
293 continue;
294 if (start < bk->end && end > bk->start)
295 break;
296 }
297 if (k < mi->nr_blks)
298 continue;
299 printk(KERN_INFO "NUMA: Node %d [mem %#010Lx-%#010Lx] + [mem %#010Lx-%#010Lx] -> [mem %#010Lx-%#010Lx]\n",
300 bi->nid, bi->start, bi->end - 1, bj->start,
301 bj->end - 1, start, end - 1);
302 bi->start = start;
303 bi->end = end;
304 numa_remove_memblk_from(j--, mi);
305 }
306 }
307
308 /* clear unused ones */
309 for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {
310 mi->blk[i].start = mi->blk[i].end = 0;
311 mi->blk[i].nid = NUMA_NO_NODE;
312 }
313
314 return 0;
315}
316
317/*
318 * Set nodes, which have memory in @mi, in *@nodemask.
319 */
320static void __init numa_nodemask_from_meminfo(nodemask_t *nodemask,
321 const struct numa_meminfo *mi)
322{
323 int i;
324
325 for (i = 0; i < ARRAY_SIZE(mi->blk); i++)
326 if (mi->blk[i].start != mi->blk[i].end &&
327 mi->blk[i].nid != NUMA_NO_NODE)
328 node_set(mi->blk[i].nid, *nodemask);
329}
330
331/**
332 * numa_reset_distance - Reset NUMA distance table
333 *
334 * The current table is freed. The next numa_set_distance() call will
335 * create a new one.
336 */
337void __init numa_reset_distance(void)
338{
339 size_t size = numa_distance_cnt * numa_distance_cnt * sizeof(numa_distance[0]);
340
341 /* numa_distance could be 1LU marking allocation failure, test cnt */
342 if (numa_distance_cnt)
343 memblock_free(__pa(numa_distance), size);
344 numa_distance_cnt = 0;
345 numa_distance = NULL; /* enable table creation */
346}
347
348static int __init numa_alloc_distance(void)
349{
350 nodemask_t nodes_parsed;
351 size_t size;
352 int i, j, cnt = 0;
353 u64 phys;
354
355 /* size the new table and allocate it */
356 nodes_parsed = numa_nodes_parsed;
357 numa_nodemask_from_meminfo(&nodes_parsed, &numa_meminfo);
358
359 for_each_node_mask(i, nodes_parsed)
360 cnt = i;
361 cnt++;
362 size = cnt * cnt * sizeof(numa_distance[0]);
363
364 phys = memblock_find_in_range(0, PFN_PHYS(max_pfn_mapped),
365 size, PAGE_SIZE);
366 if (!phys) {
367 pr_warning("NUMA: Warning: can't allocate distance table!\n");
368 /* don't retry until explicitly reset */
369 numa_distance = (void *)1LU;
370 return -ENOMEM;
371 }
372 memblock_reserve(phys, size);
373
374 numa_distance = __va(phys);
375 numa_distance_cnt = cnt;
376
377 /* fill with the default distances */
378 for (i = 0; i < cnt; i++)
379 for (j = 0; j < cnt; j++)
380 numa_distance[i * cnt + j] = i == j ?
381 LOCAL_DISTANCE : REMOTE_DISTANCE;
382 printk(KERN_DEBUG "NUMA: Initialized distance table, cnt=%d\n", cnt);
383
384 return 0;
385}
386
387/**
388 * numa_set_distance - Set NUMA distance from one NUMA to another
389 * @from: the 'from' node to set distance
390 * @to: the 'to' node to set distance
391 * @distance: NUMA distance
392 *
393 * Set the distance from node @from to @to to @distance. If distance table
394 * doesn't exist, one which is large enough to accommodate all the currently
395 * known nodes will be created.
396 *
397 * If such table cannot be allocated, a warning is printed and further
398 * calls are ignored until the distance table is reset with
399 * numa_reset_distance().
400 *
401 * If @from or @to is higher than the highest known node or lower than zero
402 * at the time of table creation or @distance doesn't make sense, the call
403 * is ignored.
404 * This is to allow simplification of specific NUMA config implementations.
405 */
406void __init numa_set_distance(int from, int to, int distance)
407{
408 if (!numa_distance && numa_alloc_distance() < 0)
409 return;
410
411 if (from >= numa_distance_cnt || to >= numa_distance_cnt ||
412 from < 0 || to < 0) {
413 pr_warn_once("NUMA: Warning: node ids are out of bound, from=%d to=%d distance=%d\n",
414 from, to, distance);
415 return;
416 }
417
418 if ((u8)distance != distance ||
419 (from == to && distance != LOCAL_DISTANCE)) {
420 pr_warn_once("NUMA: Warning: invalid distance parameter, from=%d to=%d distance=%d\n",
421 from, to, distance);
422 return;
423 }
424
425 numa_distance[from * numa_distance_cnt + to] = distance;
426}
427
428int __node_distance(int from, int to)
429{
430 if (from >= numa_distance_cnt || to >= numa_distance_cnt)
431 return from == to ? LOCAL_DISTANCE : REMOTE_DISTANCE;
432 return numa_distance[from * numa_distance_cnt + to];
433}
434EXPORT_SYMBOL(__node_distance);
435
436/*
437 * Sanity check to catch more bad NUMA configurations (they are amazingly
438 * common). Make sure the nodes cover all memory.
439 */
440static bool __init numa_meminfo_cover_memory(const struct numa_meminfo *mi)
441{
442 u64 numaram, e820ram;
443 int i;
444
445 numaram = 0;
446 for (i = 0; i < mi->nr_blks; i++) {
447 u64 s = mi->blk[i].start >> PAGE_SHIFT;
448 u64 e = mi->blk[i].end >> PAGE_SHIFT;
449 numaram += e - s;
450 numaram -= __absent_pages_in_range(mi->blk[i].nid, s, e);
451 if ((s64)numaram < 0)
452 numaram = 0;
453 }
454
455 e820ram = max_pfn - absent_pages_in_range(0, max_pfn);
456
457 /* We seem to lose 3 pages somewhere. Allow 1M of slack. */
458 if ((s64)(e820ram - numaram) >= (1 << (20 - PAGE_SHIFT))) {
459 printk(KERN_ERR "NUMA: nodes only cover %LuMB of your %LuMB e820 RAM. Not used.\n",
460 (numaram << PAGE_SHIFT) >> 20,
461 (e820ram << PAGE_SHIFT) >> 20);
462 return false;
463 }
464 return true;
465}
466
467/*
468 * Mark all currently memblock-reserved physical memory (which covers the
469 * kernel's own memory ranges) as hot-unswappable.
470 */
471static void __init numa_clear_kernel_node_hotplug(void)
472{
473 nodemask_t reserved_nodemask = NODE_MASK_NONE;
474 struct memblock_region *mb_region;
475 int i;
476
477 /*
478 * We have to do some preprocessing of memblock regions, to
479 * make them suitable for reservation.
480 *
481 * At this time, all memory regions reserved by memblock are
482 * used by the kernel, but those regions are not split up
483 * along node boundaries yet, and don't necessarily have their
484 * node ID set yet either.
485 *
486 * So iterate over all memory known to the x86 architecture,
487 * and use those ranges to set the nid in memblock.reserved.
488 * This will split up the memblock regions along node
489 * boundaries and will set the node IDs as well.
490 */
491 for (i = 0; i < numa_meminfo.nr_blks; i++) {
492 struct numa_memblk *mb = numa_meminfo.blk + i;
493 int ret;
494
495 ret = memblock_set_node(mb->start, mb->end - mb->start, &memblock.reserved, mb->nid);
496 WARN_ON_ONCE(ret);
497 }
498
499 /*
500 * Now go over all reserved memblock regions, to construct a
501 * node mask of all kernel reserved memory areas.
502 *
503 * [ Note, when booting with mem=nn[kMG] or in a kdump kernel,
504 * numa_meminfo might not include all memblock.reserved
505 * memory ranges, because quirks such as trim_snb_memory()
506 * reserve specific pages for Sandy Bridge graphics. ]
507 */
508 for_each_memblock(reserved, mb_region) {
509 if (mb_region->nid != MAX_NUMNODES)
510 node_set(mb_region->nid, reserved_nodemask);
511 }
512
513 /*
514 * Finally, clear the MEMBLOCK_HOTPLUG flag for all memory
515 * belonging to the reserved node mask.
516 *
517 * Note that this will include memory regions that reside
518 * on nodes that contain kernel memory - entire nodes
519 * become hot-unpluggable:
520 */
521 for (i = 0; i < numa_meminfo.nr_blks; i++) {
522 struct numa_memblk *mb = numa_meminfo.blk + i;
523
524 if (!node_isset(mb->nid, reserved_nodemask))
525 continue;
526
527 memblock_clear_hotplug(mb->start, mb->end - mb->start);
528 }
529}
530
531static int __init numa_register_memblks(struct numa_meminfo *mi)
532{
533 unsigned long uninitialized_var(pfn_align);
534 int i, nid;
535
536 /* Account for nodes with cpus and no memory */
537 node_possible_map = numa_nodes_parsed;
538 numa_nodemask_from_meminfo(&node_possible_map, mi);
539 if (WARN_ON(nodes_empty(node_possible_map)))
540 return -EINVAL;
541
542 for (i = 0; i < mi->nr_blks; i++) {
543 struct numa_memblk *mb = &mi->blk[i];
544 memblock_set_node(mb->start, mb->end - mb->start,
545 &memblock.memory, mb->nid);
546 }
547
548 /*
549 * At very early time, the kernel have to use some memory such as
550 * loading the kernel image. We cannot prevent this anyway. So any
551 * node the kernel resides in should be un-hotpluggable.
552 *
553 * And when we come here, alloc node data won't fail.
554 */
555 numa_clear_kernel_node_hotplug();
556
557 /*
558 * If sections array is gonna be used for pfn -> nid mapping, check
559 * whether its granularity is fine enough.
560 */
561#ifdef NODE_NOT_IN_PAGE_FLAGS
562 pfn_align = node_map_pfn_alignment();
563 if (pfn_align && pfn_align < PAGES_PER_SECTION) {
564 printk(KERN_WARNING "Node alignment %LuMB < min %LuMB, rejecting NUMA config\n",
565 PFN_PHYS(pfn_align) >> 20,
566 PFN_PHYS(PAGES_PER_SECTION) >> 20);
567 return -EINVAL;
568 }
569#endif
570 if (!numa_meminfo_cover_memory(mi))
571 return -EINVAL;
572
573 /* Finally register nodes. */
574 for_each_node_mask(nid, node_possible_map) {
575 u64 start = PFN_PHYS(max_pfn);
576 u64 end = 0;
577
578 for (i = 0; i < mi->nr_blks; i++) {
579 if (nid != mi->blk[i].nid)
580 continue;
581 start = min(mi->blk[i].start, start);
582 end = max(mi->blk[i].end, end);
583 }
584
585 if (start >= end)
586 continue;
587
588 /*
589 * Don't confuse VM with a node that doesn't have the
590 * minimum amount of memory:
591 */
592 if (end && (end - start) < NODE_MIN_SIZE)
593 continue;
594
595 alloc_node_data(nid);
596 }
597
598 /* Dump memblock with node info and return. */
599 memblock_dump_all();
600 return 0;
601}
602
603/*
604 * There are unfortunately some poorly designed mainboards around that
605 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
606 * mapping. To avoid this fill in the mapping for all possible CPUs,
607 * as the number of CPUs is not known yet. We round robin the existing
608 * nodes.
609 */
610static void __init numa_init_array(void)
611{
612 int rr, i;
613
614 rr = first_node(node_online_map);
615 for (i = 0; i < nr_cpu_ids; i++) {
616 if (early_cpu_to_node(i) != NUMA_NO_NODE)
617 continue;
618 numa_set_node(i, rr);
619 rr = next_node_in(rr, node_online_map);
620 }
621}
622
623static int __init numa_init(int (*init_func)(void))
624{
625 int i;
626 int ret;
627
628 for (i = 0; i < MAX_LOCAL_APIC; i++)
629 set_apicid_to_node(i, NUMA_NO_NODE);
630
631 nodes_clear(numa_nodes_parsed);
632 nodes_clear(node_possible_map);
633 nodes_clear(node_online_map);
634 memset(&numa_meminfo, 0, sizeof(numa_meminfo));
635 WARN_ON(memblock_set_node(0, ULLONG_MAX, &memblock.memory,
636 MAX_NUMNODES));
637 WARN_ON(memblock_set_node(0, ULLONG_MAX, &memblock.reserved,
638 MAX_NUMNODES));
639 /* In case that parsing SRAT failed. */
640 WARN_ON(memblock_clear_hotplug(0, ULLONG_MAX));
641 numa_reset_distance();
642
643 ret = init_func();
644 if (ret < 0)
645 return ret;
646
647 /*
648 * We reset memblock back to the top-down direction
649 * here because if we configured ACPI_NUMA, we have
650 * parsed SRAT in init_func(). It is ok to have the
651 * reset here even if we did't configure ACPI_NUMA
652 * or acpi numa init fails and fallbacks to dummy
653 * numa init.
654 */
655 memblock_set_bottom_up(false);
656
657 ret = numa_cleanup_meminfo(&numa_meminfo);
658 if (ret < 0)
659 return ret;
660
661 numa_emulation(&numa_meminfo, numa_distance_cnt);
662
663 ret = numa_register_memblks(&numa_meminfo);
664 if (ret < 0)
665 return ret;
666
667 for (i = 0; i < nr_cpu_ids; i++) {
668 int nid = early_cpu_to_node(i);
669
670 if (nid == NUMA_NO_NODE)
671 continue;
672 if (!node_online(nid))
673 numa_clear_node(i);
674 }
675 numa_init_array();
676
677 return 0;
678}
679
680/**
681 * dummy_numa_init - Fallback dummy NUMA init
682 *
683 * Used if there's no underlying NUMA architecture, NUMA initialization
684 * fails, or NUMA is disabled on the command line.
685 *
686 * Must online at least one node and add memory blocks that cover all
687 * allowed memory. This function must not fail.
688 */
689static int __init dummy_numa_init(void)
690{
691 printk(KERN_INFO "%s\n",
692 numa_off ? "NUMA turned off" : "No NUMA configuration found");
693 printk(KERN_INFO "Faking a node at [mem %#018Lx-%#018Lx]\n",
694 0LLU, PFN_PHYS(max_pfn) - 1);
695
696 node_set(0, numa_nodes_parsed);
697 numa_add_memblk(0, 0, PFN_PHYS(max_pfn));
698
699 return 0;
700}
701
702/**
703 * x86_numa_init - Initialize NUMA
704 *
705 * Try each configured NUMA initialization method until one succeeds. The
706 * last fallback is dummy single node config encomapssing whole memory and
707 * never fails.
708 */
709void __init x86_numa_init(void)
710{
711 if (!numa_off) {
712#ifdef CONFIG_ACPI_NUMA
713 if (!numa_init(x86_acpi_numa_init))
714 return;
715#endif
716#ifdef CONFIG_AMD_NUMA
717 if (!numa_init(amd_numa_init))
718 return;
719#endif
720 }
721
722 numa_init(dummy_numa_init);
723}
724
725static void __init init_memory_less_node(int nid)
726{
727 unsigned long zones_size[MAX_NR_ZONES] = {0};
728 unsigned long zholes_size[MAX_NR_ZONES] = {0};
729
730 /* Allocate and initialize node data. Memory-less node is now online.*/
731 alloc_node_data(nid);
732 free_area_init_node(nid, zones_size, 0, zholes_size);
733
734 /*
735 * All zonelists will be built later in start_kernel() after per cpu
736 * areas are initialized.
737 */
738}
739
740/*
741 * Setup early cpu_to_node.
742 *
743 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
744 * and apicid_to_node[] tables have valid entries for a CPU.
745 * This means we skip cpu_to_node[] initialisation for NUMA
746 * emulation and faking node case (when running a kernel compiled
747 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
748 * is already initialized in a round robin manner at numa_init_array,
749 * prior to this call, and this initialization is good enough
750 * for the fake NUMA cases.
751 *
752 * Called before the per_cpu areas are setup.
753 */
754void __init init_cpu_to_node(void)
755{
756 int cpu;
757 u16 *cpu_to_apicid = early_per_cpu_ptr(x86_cpu_to_apicid);
758
759 BUG_ON(cpu_to_apicid == NULL);
760
761 for_each_possible_cpu(cpu) {
762 int node = numa_cpu_node(cpu);
763
764 if (node == NUMA_NO_NODE)
765 continue;
766
767 if (!node_online(node))
768 init_memory_less_node(node);
769
770 numa_set_node(cpu, node);
771 }
772}
773
774#ifndef CONFIG_DEBUG_PER_CPU_MAPS
775
776# ifndef CONFIG_NUMA_EMU
777void numa_add_cpu(int cpu)
778{
779 cpumask_set_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
780}
781
782void numa_remove_cpu(int cpu)
783{
784 cpumask_clear_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
785}
786# endif /* !CONFIG_NUMA_EMU */
787
788#else /* !CONFIG_DEBUG_PER_CPU_MAPS */
789
790int __cpu_to_node(int cpu)
791{
792 if (early_per_cpu_ptr(x86_cpu_to_node_map)) {
793 printk(KERN_WARNING
794 "cpu_to_node(%d): usage too early!\n", cpu);
795 dump_stack();
796 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
797 }
798 return per_cpu(x86_cpu_to_node_map, cpu);
799}
800EXPORT_SYMBOL(__cpu_to_node);
801
802/*
803 * Same function as cpu_to_node() but used if called before the
804 * per_cpu areas are setup.
805 */
806int early_cpu_to_node(int cpu)
807{
808 if (early_per_cpu_ptr(x86_cpu_to_node_map))
809 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
810
811 if (!cpu_possible(cpu)) {
812 printk(KERN_WARNING
813 "early_cpu_to_node(%d): no per_cpu area!\n", cpu);
814 dump_stack();
815 return NUMA_NO_NODE;
816 }
817 return per_cpu(x86_cpu_to_node_map, cpu);
818}
819
820void debug_cpumask_set_cpu(int cpu, int node, bool enable)
821{
822 struct cpumask *mask;
823
824 if (node == NUMA_NO_NODE) {
825 /* early_cpu_to_node() already emits a warning and trace */
826 return;
827 }
828 mask = node_to_cpumask_map[node];
829 if (!mask) {
830 pr_err("node_to_cpumask_map[%i] NULL\n", node);
831 dump_stack();
832 return;
833 }
834
835 if (enable)
836 cpumask_set_cpu(cpu, mask);
837 else
838 cpumask_clear_cpu(cpu, mask);
839
840 printk(KERN_DEBUG "%s cpu %d node %d: mask now %*pbl\n",
841 enable ? "numa_add_cpu" : "numa_remove_cpu",
842 cpu, node, cpumask_pr_args(mask));
843 return;
844}
845
846# ifndef CONFIG_NUMA_EMU
847static void numa_set_cpumask(int cpu, bool enable)
848{
849 debug_cpumask_set_cpu(cpu, early_cpu_to_node(cpu), enable);
850}
851
852void numa_add_cpu(int cpu)
853{
854 numa_set_cpumask(cpu, true);
855}
856
857void numa_remove_cpu(int cpu)
858{
859 numa_set_cpumask(cpu, false);
860}
861# endif /* !CONFIG_NUMA_EMU */
862
863/*
864 * Returns a pointer to the bitmask of CPUs on Node 'node'.
865 */
866const struct cpumask *cpumask_of_node(int node)
867{
868 if (node >= nr_node_ids) {
869 printk(KERN_WARNING
870 "cpumask_of_node(%d): node > nr_node_ids(%d)\n",
871 node, nr_node_ids);
872 dump_stack();
873 return cpu_none_mask;
874 }
875 if (node_to_cpumask_map[node] == NULL) {
876 printk(KERN_WARNING
877 "cpumask_of_node(%d): no node_to_cpumask_map!\n",
878 node);
879 dump_stack();
880 return cpu_online_mask;
881 }
882 return node_to_cpumask_map[node];
883}
884EXPORT_SYMBOL(cpumask_of_node);
885
886#endif /* !CONFIG_DEBUG_PER_CPU_MAPS */
887
888#ifdef CONFIG_MEMORY_HOTPLUG
889int memory_add_physaddr_to_nid(u64 start)
890{
891 struct numa_meminfo *mi = &numa_meminfo;
892 int nid = mi->blk[0].nid;
893 int i;
894
895 for (i = 0; i < mi->nr_blks; i++)
896 if (mi->blk[i].start <= start && mi->blk[i].end > start)
897 nid = mi->blk[i].nid;
898 return nid;
899}
900EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
901#endif