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>
7 #include <linux/string.h>
8 #include <linux/init.h>
9 #include <linux/memblock.h>
10 #include <linux/mmzone.h>
11 #include <linux/ctype.h>
12 #include <linux/nodemask.h>
13 #include <linux/sched.h>
14 #include <linux/topology.h>
15 #include <linux/sort.h>
17 #include <asm/e820/api.h>
18 #include <asm/proto.h>
20 #include <asm/amd_nb.h>
22 #include "numa_internal.h"
25 nodemask_t numa_nodes_parsed __initdata;
27 struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
28 EXPORT_SYMBOL(node_data);
30 static struct numa_meminfo numa_meminfo __initdata_or_meminfo;
31 static struct numa_meminfo numa_reserved_meminfo __initdata_or_meminfo;
33 static int numa_distance_cnt;
34 static u8 *numa_distance;
36 static __init int numa_setup(char *opt)
40 if (!strncmp(opt, "off", 3))
42 if (!strncmp(opt, "fake=", 5))
43 return numa_emu_cmdline(opt + 5);
44 if (!strncmp(opt, "noacpi", 6))
46 if (!strncmp(opt, "nohmat", 6))
50 early_param("numa", numa_setup);
53 * apicid, cpu, node mappings
55 s16 __apicid_to_node[MAX_LOCAL_APIC] = {
56 [0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
59 int numa_cpu_node(int cpu)
61 u32 apicid = early_per_cpu(x86_cpu_to_apicid, cpu);
63 if (apicid != BAD_APICID)
64 return __apicid_to_node[apicid];
68 cpumask_var_t node_to_cpumask_map[MAX_NUMNODES];
69 EXPORT_SYMBOL(node_to_cpumask_map);
72 * Map cpu index to node index
74 DEFINE_EARLY_PER_CPU(int, x86_cpu_to_node_map, NUMA_NO_NODE);
75 EXPORT_EARLY_PER_CPU_SYMBOL(x86_cpu_to_node_map);
77 void numa_set_node(int cpu, int node)
79 int *cpu_to_node_map = early_per_cpu_ptr(x86_cpu_to_node_map);
81 /* early setting, no percpu area yet */
82 if (cpu_to_node_map) {
83 cpu_to_node_map[cpu] = node;
87 #ifdef CONFIG_DEBUG_PER_CPU_MAPS
88 if (cpu >= nr_cpu_ids || !cpu_possible(cpu)) {
89 printk(KERN_ERR "numa_set_node: invalid cpu# (%d)\n", cpu);
94 per_cpu(x86_cpu_to_node_map, cpu) = node;
96 set_cpu_numa_node(cpu, node);
99 void numa_clear_node(int cpu)
101 numa_set_node(cpu, NUMA_NO_NODE);
105 * Allocate node_to_cpumask_map based on number of available nodes
106 * Requires node_possible_map to be valid.
108 * Note: cpumask_of_node() is not valid until after this is done.
109 * (Use CONFIG_DEBUG_PER_CPU_MAPS to check this.)
111 void __init setup_node_to_cpumask_map(void)
115 /* setup nr_node_ids if not done yet */
116 if (nr_node_ids == MAX_NUMNODES)
119 /* allocate the map */
120 for (node = 0; node < nr_node_ids; node++)
121 alloc_bootmem_cpumask_var(&node_to_cpumask_map[node]);
123 /* cpumask_of_node() will now work */
124 pr_debug("Node to cpumask map for %u nodes\n", nr_node_ids);
127 static int __init numa_add_memblk_to(int nid, u64 start, u64 end,
128 struct numa_meminfo *mi)
130 /* ignore zero length blks */
134 /* whine about and ignore invalid blks */
135 if (start > end || nid < 0 || nid >= MAX_NUMNODES) {
136 pr_warn("Warning: invalid memblk node %d [mem %#010Lx-%#010Lx]\n",
137 nid, start, end - 1);
141 if (mi->nr_blks >= NR_NODE_MEMBLKS) {
142 pr_err("too many memblk ranges\n");
146 mi->blk[mi->nr_blks].start = start;
147 mi->blk[mi->nr_blks].end = end;
148 mi->blk[mi->nr_blks].nid = nid;
154 * numa_remove_memblk_from - Remove one numa_memblk from a numa_meminfo
155 * @idx: Index of memblk to remove
156 * @mi: numa_meminfo to remove memblk from
158 * Remove @idx'th numa_memblk from @mi by shifting @mi->blk[] and
159 * decrementing @mi->nr_blks.
161 void __init numa_remove_memblk_from(int idx, struct numa_meminfo *mi)
164 memmove(&mi->blk[idx], &mi->blk[idx + 1],
165 (mi->nr_blks - idx) * sizeof(mi->blk[0]));
169 * numa_move_tail_memblk - Move a numa_memblk from one numa_meminfo to another
170 * @dst: numa_meminfo to append block to
171 * @idx: Index of memblk to remove
172 * @src: numa_meminfo to remove memblk from
174 static void __init numa_move_tail_memblk(struct numa_meminfo *dst, int idx,
175 struct numa_meminfo *src)
177 dst->blk[dst->nr_blks++] = src->blk[idx];
178 numa_remove_memblk_from(idx, src);
182 * numa_add_memblk - Add one numa_memblk to numa_meminfo
183 * @nid: NUMA node ID of the new memblk
184 * @start: Start address of the new memblk
185 * @end: End address of the new memblk
187 * Add a new memblk to the default numa_meminfo.
190 * 0 on success, -errno on failure.
192 int __init numa_add_memblk(int nid, u64 start, u64 end)
194 return numa_add_memblk_to(nid, start, end, &numa_meminfo);
197 /* Allocate NODE_DATA for a node on the local memory */
198 static void __init alloc_node_data(int nid)
200 const size_t nd_size = roundup(sizeof(pg_data_t), PAGE_SIZE);
206 * Allocate node data. Try node-local memory and then any node.
207 * Never allocate in DMA zone.
209 nd_pa = memblock_phys_alloc_try_nid(nd_size, SMP_CACHE_BYTES, nid);
211 pr_err("Cannot find %zu bytes in any node (initial node: %d)\n",
217 /* report and initialize */
218 printk(KERN_INFO "NODE_DATA(%d) allocated [mem %#010Lx-%#010Lx]\n", nid,
219 nd_pa, nd_pa + nd_size - 1);
220 tnid = early_pfn_to_nid(nd_pa >> PAGE_SHIFT);
222 printk(KERN_INFO " NODE_DATA(%d) on node %d\n", nid, tnid);
225 memset(NODE_DATA(nid), 0, sizeof(pg_data_t));
227 node_set_online(nid);
231 * numa_cleanup_meminfo - Cleanup a numa_meminfo
232 * @mi: numa_meminfo to clean up
234 * Sanitize @mi by merging and removing unnecessary memblks. Also check for
235 * conflicts and clear unused memblks.
238 * 0 on success, -errno on failure.
240 int __init numa_cleanup_meminfo(struct numa_meminfo *mi)
243 const u64 high = PFN_PHYS(max_pfn);
246 /* first, trim all entries */
247 for (i = 0; i < mi->nr_blks; i++) {
248 struct numa_memblk *bi = &mi->blk[i];
250 /* move / save reserved memory ranges */
251 if (!memblock_overlaps_region(&memblock.memory,
252 bi->start, bi->end - bi->start)) {
253 numa_move_tail_memblk(&numa_reserved_meminfo, i--, mi);
257 /* make sure all non-reserved blocks are inside the limits */
258 bi->start = max(bi->start, low);
260 /* preserve info for non-RAM areas above 'max_pfn': */
261 if (bi->end > high) {
262 numa_add_memblk_to(bi->nid, high, bi->end,
263 &numa_reserved_meminfo);
267 /* and there's no empty block */
268 if (bi->start >= bi->end)
269 numa_remove_memblk_from(i--, mi);
272 /* merge neighboring / overlapping entries */
273 for (i = 0; i < mi->nr_blks; i++) {
274 struct numa_memblk *bi = &mi->blk[i];
276 for (j = i + 1; j < mi->nr_blks; j++) {
277 struct numa_memblk *bj = &mi->blk[j];
281 * See whether there are overlapping blocks. Whine
282 * about but allow overlaps of the same nid. They
283 * will be merged below.
285 if (bi->end > bj->start && bi->start < bj->end) {
286 if (bi->nid != bj->nid) {
287 pr_err("node %d [mem %#010Lx-%#010Lx] overlaps with node %d [mem %#010Lx-%#010Lx]\n",
288 bi->nid, bi->start, bi->end - 1,
289 bj->nid, bj->start, bj->end - 1);
292 pr_warn("Warning: node %d [mem %#010Lx-%#010Lx] overlaps with itself [mem %#010Lx-%#010Lx]\n",
293 bi->nid, bi->start, bi->end - 1,
294 bj->start, bj->end - 1);
298 * Join together blocks on the same node, holes
299 * between which don't overlap with memory on other
302 if (bi->nid != bj->nid)
304 start = min(bi->start, bj->start);
305 end = max(bi->end, bj->end);
306 for (k = 0; k < mi->nr_blks; k++) {
307 struct numa_memblk *bk = &mi->blk[k];
309 if (bi->nid == bk->nid)
311 if (start < bk->end && end > bk->start)
316 printk(KERN_INFO "NUMA: Node %d [mem %#010Lx-%#010Lx] + [mem %#010Lx-%#010Lx] -> [mem %#010Lx-%#010Lx]\n",
317 bi->nid, bi->start, bi->end - 1, bj->start,
318 bj->end - 1, start, end - 1);
321 numa_remove_memblk_from(j--, mi);
325 /* clear unused ones */
326 for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {
327 mi->blk[i].start = mi->blk[i].end = 0;
328 mi->blk[i].nid = NUMA_NO_NODE;
335 * Set nodes, which have memory in @mi, in *@nodemask.
337 static void __init numa_nodemask_from_meminfo(nodemask_t *nodemask,
338 const struct numa_meminfo *mi)
342 for (i = 0; i < ARRAY_SIZE(mi->blk); i++)
343 if (mi->blk[i].start != mi->blk[i].end &&
344 mi->blk[i].nid != NUMA_NO_NODE)
345 node_set(mi->blk[i].nid, *nodemask);
349 * numa_reset_distance - Reset NUMA distance table
351 * The current table is freed. The next numa_set_distance() call will
354 void __init numa_reset_distance(void)
356 size_t size = numa_distance_cnt * numa_distance_cnt * sizeof(numa_distance[0]);
358 /* numa_distance could be 1LU marking allocation failure, test cnt */
359 if (numa_distance_cnt)
360 memblock_free(numa_distance, size);
361 numa_distance_cnt = 0;
362 numa_distance = NULL; /* enable table creation */
365 static int __init numa_alloc_distance(void)
367 nodemask_t nodes_parsed;
372 /* size the new table and allocate it */
373 nodes_parsed = numa_nodes_parsed;
374 numa_nodemask_from_meminfo(&nodes_parsed, &numa_meminfo);
376 for_each_node_mask(i, nodes_parsed)
379 size = cnt * cnt * sizeof(numa_distance[0]);
381 phys = memblock_phys_alloc_range(size, PAGE_SIZE, 0,
382 PFN_PHYS(max_pfn_mapped));
384 pr_warn("Warning: can't allocate distance table!\n");
385 /* don't retry until explicitly reset */
386 numa_distance = (void *)1LU;
390 numa_distance = __va(phys);
391 numa_distance_cnt = cnt;
393 /* fill with the default distances */
394 for (i = 0; i < cnt; i++)
395 for (j = 0; j < cnt; j++)
396 numa_distance[i * cnt + j] = i == j ?
397 LOCAL_DISTANCE : REMOTE_DISTANCE;
398 printk(KERN_DEBUG "NUMA: Initialized distance table, cnt=%d\n", cnt);
404 * numa_set_distance - Set NUMA distance from one NUMA to another
405 * @from: the 'from' node to set distance
406 * @to: the 'to' node to set distance
407 * @distance: NUMA distance
409 * Set the distance from node @from to @to to @distance. If distance table
410 * doesn't exist, one which is large enough to accommodate all the currently
411 * known nodes will be created.
413 * If such table cannot be allocated, a warning is printed and further
414 * calls are ignored until the distance table is reset with
415 * numa_reset_distance().
417 * If @from or @to is higher than the highest known node or lower than zero
418 * at the time of table creation or @distance doesn't make sense, the call
420 * This is to allow simplification of specific NUMA config implementations.
422 void __init numa_set_distance(int from, int to, int distance)
424 if (!numa_distance && numa_alloc_distance() < 0)
427 if (from >= numa_distance_cnt || to >= numa_distance_cnt ||
428 from < 0 || to < 0) {
429 pr_warn_once("Warning: node ids are out of bound, from=%d to=%d distance=%d\n",
434 if ((u8)distance != distance ||
435 (from == to && distance != LOCAL_DISTANCE)) {
436 pr_warn_once("Warning: invalid distance parameter, from=%d to=%d distance=%d\n",
441 numa_distance[from * numa_distance_cnt + to] = distance;
444 int __node_distance(int from, int to)
446 if (from >= numa_distance_cnt || to >= numa_distance_cnt)
447 return from == to ? LOCAL_DISTANCE : REMOTE_DISTANCE;
448 return numa_distance[from * numa_distance_cnt + to];
450 EXPORT_SYMBOL(__node_distance);
453 * Sanity check to catch more bad NUMA configurations (they are amazingly
454 * common). Make sure the nodes cover all memory.
456 static bool __init numa_meminfo_cover_memory(const struct numa_meminfo *mi)
458 u64 numaram, e820ram;
462 for (i = 0; i < mi->nr_blks; i++) {
463 u64 s = mi->blk[i].start >> PAGE_SHIFT;
464 u64 e = mi->blk[i].end >> PAGE_SHIFT;
466 numaram -= __absent_pages_in_range(mi->blk[i].nid, s, e);
467 if ((s64)numaram < 0)
471 e820ram = max_pfn - absent_pages_in_range(0, max_pfn);
473 /* We seem to lose 3 pages somewhere. Allow 1M of slack. */
474 if ((s64)(e820ram - numaram) >= (1 << (20 - PAGE_SHIFT))) {
475 printk(KERN_ERR "NUMA: nodes only cover %LuMB of your %LuMB e820 RAM. Not used.\n",
476 (numaram << PAGE_SHIFT) >> 20,
477 (e820ram << PAGE_SHIFT) >> 20);
484 * Mark all currently memblock-reserved physical memory (which covers the
485 * kernel's own memory ranges) as hot-unswappable.
487 static void __init numa_clear_kernel_node_hotplug(void)
489 nodemask_t reserved_nodemask = NODE_MASK_NONE;
490 struct memblock_region *mb_region;
494 * We have to do some preprocessing of memblock regions, to
495 * make them suitable for reservation.
497 * At this time, all memory regions reserved by memblock are
498 * used by the kernel, but those regions are not split up
499 * along node boundaries yet, and don't necessarily have their
500 * node ID set yet either.
502 * So iterate over all memory known to the x86 architecture,
503 * and use those ranges to set the nid in memblock.reserved.
504 * This will split up the memblock regions along node
505 * boundaries and will set the node IDs as well.
507 for (i = 0; i < numa_meminfo.nr_blks; i++) {
508 struct numa_memblk *mb = numa_meminfo.blk + i;
511 ret = memblock_set_node(mb->start, mb->end - mb->start, &memblock.reserved, mb->nid);
516 * Now go over all reserved memblock regions, to construct a
517 * node mask of all kernel reserved memory areas.
519 * [ Note, when booting with mem=nn[kMG] or in a kdump kernel,
520 * numa_meminfo might not include all memblock.reserved
521 * memory ranges, because quirks such as trim_snb_memory()
522 * reserve specific pages for Sandy Bridge graphics. ]
524 for_each_reserved_mem_region(mb_region) {
525 int nid = memblock_get_region_node(mb_region);
527 if (nid != MAX_NUMNODES)
528 node_set(nid, reserved_nodemask);
532 * Finally, clear the MEMBLOCK_HOTPLUG flag for all memory
533 * belonging to the reserved node mask.
535 * Note that this will include memory regions that reside
536 * on nodes that contain kernel memory - entire nodes
537 * become hot-unpluggable:
539 for (i = 0; i < numa_meminfo.nr_blks; i++) {
540 struct numa_memblk *mb = numa_meminfo.blk + i;
542 if (!node_isset(mb->nid, reserved_nodemask))
545 memblock_clear_hotplug(mb->start, mb->end - mb->start);
549 static int __init numa_register_memblks(struct numa_meminfo *mi)
553 /* Account for nodes with cpus and no memory */
554 node_possible_map = numa_nodes_parsed;
555 numa_nodemask_from_meminfo(&node_possible_map, mi);
556 if (WARN_ON(nodes_empty(node_possible_map)))
559 for (i = 0; i < mi->nr_blks; i++) {
560 struct numa_memblk *mb = &mi->blk[i];
561 memblock_set_node(mb->start, mb->end - mb->start,
562 &memblock.memory, mb->nid);
566 * At very early time, the kernel have to use some memory such as
567 * loading the kernel image. We cannot prevent this anyway. So any
568 * node the kernel resides in should be un-hotpluggable.
570 * And when we come here, alloc node data won't fail.
572 numa_clear_kernel_node_hotplug();
575 * If sections array is gonna be used for pfn -> nid mapping, check
576 * whether its granularity is fine enough.
578 if (IS_ENABLED(NODE_NOT_IN_PAGE_FLAGS)) {
579 unsigned long pfn_align = node_map_pfn_alignment();
581 if (pfn_align && pfn_align < PAGES_PER_SECTION) {
582 pr_warn("Node alignment %LuMB < min %LuMB, rejecting NUMA config\n",
583 PFN_PHYS(pfn_align) >> 20,
584 PFN_PHYS(PAGES_PER_SECTION) >> 20);
588 if (!numa_meminfo_cover_memory(mi))
591 /* Finally register nodes. */
592 for_each_node_mask(nid, node_possible_map) {
593 u64 start = PFN_PHYS(max_pfn);
596 for (i = 0; i < mi->nr_blks; i++) {
597 if (nid != mi->blk[i].nid)
599 start = min(mi->blk[i].start, start);
600 end = max(mi->blk[i].end, end);
606 alloc_node_data(nid);
609 /* Dump memblock with node info and return. */
615 * There are unfortunately some poorly designed mainboards around that
616 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
617 * mapping. To avoid this fill in the mapping for all possible CPUs,
618 * as the number of CPUs is not known yet. We round robin the existing
621 static void __init numa_init_array(void)
625 rr = first_node(node_online_map);
626 for (i = 0; i < nr_cpu_ids; i++) {
627 if (early_cpu_to_node(i) != NUMA_NO_NODE)
629 numa_set_node(i, rr);
630 rr = next_node_in(rr, node_online_map);
634 static int __init numa_init(int (*init_func)(void))
639 for (i = 0; i < MAX_LOCAL_APIC; i++)
640 set_apicid_to_node(i, NUMA_NO_NODE);
642 nodes_clear(numa_nodes_parsed);
643 nodes_clear(node_possible_map);
644 nodes_clear(node_online_map);
645 memset(&numa_meminfo, 0, sizeof(numa_meminfo));
646 WARN_ON(memblock_set_node(0, ULLONG_MAX, &memblock.memory,
648 WARN_ON(memblock_set_node(0, ULLONG_MAX, &memblock.reserved,
650 /* In case that parsing SRAT failed. */
651 WARN_ON(memblock_clear_hotplug(0, ULLONG_MAX));
652 numa_reset_distance();
659 * We reset memblock back to the top-down direction
660 * here because if we configured ACPI_NUMA, we have
661 * parsed SRAT in init_func(). It is ok to have the
662 * reset here even if we did't configure ACPI_NUMA
663 * or acpi numa init fails and fallbacks to dummy
666 memblock_set_bottom_up(false);
668 ret = numa_cleanup_meminfo(&numa_meminfo);
672 numa_emulation(&numa_meminfo, numa_distance_cnt);
674 ret = numa_register_memblks(&numa_meminfo);
678 for (i = 0; i < nr_cpu_ids; i++) {
679 int nid = early_cpu_to_node(i);
681 if (nid == NUMA_NO_NODE)
683 if (!node_online(nid))
692 * dummy_numa_init - Fallback dummy NUMA init
694 * Used if there's no underlying NUMA architecture, NUMA initialization
695 * fails, or NUMA is disabled on the command line.
697 * Must online at least one node and add memory blocks that cover all
698 * allowed memory. This function must not fail.
700 static int __init dummy_numa_init(void)
702 printk(KERN_INFO "%s\n",
703 numa_off ? "NUMA turned off" : "No NUMA configuration found");
704 printk(KERN_INFO "Faking a node at [mem %#018Lx-%#018Lx]\n",
705 0LLU, PFN_PHYS(max_pfn) - 1);
707 node_set(0, numa_nodes_parsed);
708 numa_add_memblk(0, 0, PFN_PHYS(max_pfn));
714 * x86_numa_init - Initialize NUMA
716 * Try each configured NUMA initialization method until one succeeds. The
717 * last fallback is dummy single node config encompassing whole memory and
720 void __init x86_numa_init(void)
723 #ifdef CONFIG_ACPI_NUMA
724 if (!numa_init(x86_acpi_numa_init))
727 #ifdef CONFIG_AMD_NUMA
728 if (!numa_init(amd_numa_init))
731 if (acpi_disabled && !numa_init(of_numa_init))
735 numa_init(dummy_numa_init);
740 * A node may exist which has one or more Generic Initiators but no CPUs and no
743 * This function must be called after init_cpu_to_node(), to ensure that any
744 * memoryless CPU nodes have already been brought online, and before the
745 * node_data[nid] is needed for zone list setup in build_all_zonelists().
747 * When this function is called, any nodes containing either memory and/or CPUs
748 * will already be online and there is no need to do anything extra, even if
749 * they also contain one or more Generic Initiators.
751 void __init init_gi_nodes(void)
756 * Exclude this node from
757 * bringup_nonboot_cpus
761 * because node_subsys is not initialized yet.
762 * TODO remove dependency on node_online
764 for_each_node_state(nid, N_GENERIC_INITIATOR)
765 if (!node_online(nid))
766 node_set_online(nid);
770 * Setup early cpu_to_node.
772 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
773 * and apicid_to_node[] tables have valid entries for a CPU.
774 * This means we skip cpu_to_node[] initialisation for NUMA
775 * emulation and faking node case (when running a kernel compiled
776 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
777 * is already initialized in a round robin manner at numa_init_array,
778 * prior to this call, and this initialization is good enough
779 * for the fake NUMA cases.
781 * Called before the per_cpu areas are setup.
783 void __init init_cpu_to_node(void)
786 u32 *cpu_to_apicid = early_per_cpu_ptr(x86_cpu_to_apicid);
788 BUG_ON(cpu_to_apicid == NULL);
790 for_each_possible_cpu(cpu) {
791 int node = numa_cpu_node(cpu);
793 if (node == NUMA_NO_NODE)
797 * Exclude this node from
798 * bringup_nonboot_cpus
802 * because node_subsys is not initialized yet.
803 * TODO remove dependency on node_online
805 if (!node_online(node))
806 node_set_online(node);
808 numa_set_node(cpu, node);
812 #ifndef CONFIG_DEBUG_PER_CPU_MAPS
814 # ifndef CONFIG_NUMA_EMU
815 void numa_add_cpu(int cpu)
817 cpumask_set_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
820 void numa_remove_cpu(int cpu)
822 cpumask_clear_cpu(cpu, node_to_cpumask_map[early_cpu_to_node(cpu)]);
824 # endif /* !CONFIG_NUMA_EMU */
826 #else /* !CONFIG_DEBUG_PER_CPU_MAPS */
828 int __cpu_to_node(int cpu)
830 if (early_per_cpu_ptr(x86_cpu_to_node_map)) {
832 "cpu_to_node(%d): usage too early!\n", cpu);
834 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
836 return per_cpu(x86_cpu_to_node_map, cpu);
838 EXPORT_SYMBOL(__cpu_to_node);
841 * Same function as cpu_to_node() but used if called before the
842 * per_cpu areas are setup.
844 int early_cpu_to_node(int cpu)
846 if (early_per_cpu_ptr(x86_cpu_to_node_map))
847 return early_per_cpu_ptr(x86_cpu_to_node_map)[cpu];
849 if (!cpu_possible(cpu)) {
851 "early_cpu_to_node(%d): no per_cpu area!\n", cpu);
855 return per_cpu(x86_cpu_to_node_map, cpu);
858 void debug_cpumask_set_cpu(int cpu, int node, bool enable)
860 struct cpumask *mask;
862 if (node == NUMA_NO_NODE) {
863 /* early_cpu_to_node() already emits a warning and trace */
866 mask = node_to_cpumask_map[node];
867 if (!cpumask_available(mask)) {
868 pr_err("node_to_cpumask_map[%i] NULL\n", node);
874 cpumask_set_cpu(cpu, mask);
876 cpumask_clear_cpu(cpu, mask);
878 printk(KERN_DEBUG "%s cpu %d node %d: mask now %*pbl\n",
879 enable ? "numa_add_cpu" : "numa_remove_cpu",
880 cpu, node, cpumask_pr_args(mask));
884 # ifndef CONFIG_NUMA_EMU
885 static void numa_set_cpumask(int cpu, bool enable)
887 debug_cpumask_set_cpu(cpu, early_cpu_to_node(cpu), enable);
890 void numa_add_cpu(int cpu)
892 numa_set_cpumask(cpu, true);
895 void numa_remove_cpu(int cpu)
897 numa_set_cpumask(cpu, false);
899 # endif /* !CONFIG_NUMA_EMU */
902 * Returns a pointer to the bitmask of CPUs on Node 'node'.
904 const struct cpumask *cpumask_of_node(int node)
906 if ((unsigned)node >= nr_node_ids) {
908 "cpumask_of_node(%d): (unsigned)node >= nr_node_ids(%u)\n",
911 return cpu_none_mask;
913 if (!cpumask_available(node_to_cpumask_map[node])) {
915 "cpumask_of_node(%d): no node_to_cpumask_map!\n",
918 return cpu_online_mask;
920 return node_to_cpumask_map[node];
922 EXPORT_SYMBOL(cpumask_of_node);
924 #endif /* !CONFIG_DEBUG_PER_CPU_MAPS */
926 #ifdef CONFIG_NUMA_KEEP_MEMINFO
927 static int meminfo_to_nid(struct numa_meminfo *mi, u64 start)
931 for (i = 0; i < mi->nr_blks; i++)
932 if (mi->blk[i].start <= start && mi->blk[i].end > start)
933 return mi->blk[i].nid;
937 int phys_to_target_node(phys_addr_t start)
939 int nid = meminfo_to_nid(&numa_meminfo, start);
942 * Prefer online nodes, but if reserved memory might be
943 * hot-added continue the search with reserved ranges.
945 if (nid != NUMA_NO_NODE)
948 return meminfo_to_nid(&numa_reserved_meminfo, start);
950 EXPORT_SYMBOL_GPL(phys_to_target_node);
952 int memory_add_physaddr_to_nid(u64 start)
954 int nid = meminfo_to_nid(&numa_meminfo, start);
956 if (nid == NUMA_NO_NODE)
957 nid = numa_meminfo.blk[0].nid;
960 EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
962 static int __init cmp_memblk(const void *a, const void *b)
964 const struct numa_memblk *ma = *(const struct numa_memblk **)a;
965 const struct numa_memblk *mb = *(const struct numa_memblk **)b;
967 return (ma->start > mb->start) - (ma->start < mb->start);
970 static struct numa_memblk *numa_memblk_list[NR_NODE_MEMBLKS] __initdata;
973 * numa_fill_memblks - Fill gaps in numa_meminfo memblks
974 * @start: address to begin fill
975 * @end: address to end fill
977 * Find and extend numa_meminfo memblks to cover the physical
978 * address range @start-@end
982 * NUMA_NO_MEMBLK : No memblks exist in address range @start-@end
985 int __init numa_fill_memblks(u64 start, u64 end)
987 struct numa_memblk **blk = &numa_memblk_list[0];
988 struct numa_meminfo *mi = &numa_meminfo;
993 * Create a list of pointers to numa_meminfo memblks that
994 * overlap start, end. The list is used to make in-place
995 * changes that fill out the numa_meminfo memblks.
997 for (int i = 0; i < mi->nr_blks; i++) {
998 struct numa_memblk *bi = &mi->blk[i];
1000 if (memblock_addrs_overlap(start, end - start, bi->start,
1001 bi->end - bi->start)) {
1002 blk[count] = &mi->blk[i];
1007 return NUMA_NO_MEMBLK;
1009 /* Sort the list of pointers in memblk->start order */
1010 sort(&blk[0], count, sizeof(blk[0]), cmp_memblk, NULL);
1012 /* Make sure the first/last memblks include start/end */
1013 blk[0]->start = min(blk[0]->start, start);
1014 blk[count - 1]->end = max(blk[count - 1]->end, end);
1017 * Fill any gaps by tracking the previous memblks
1018 * end address and backfilling to it if needed.
1020 prev_end = blk[0]->end;
1021 for (int i = 1; i < count; i++) {
1022 struct numa_memblk *curr = blk[i];
1024 if (prev_end >= curr->start) {
1025 if (prev_end < curr->end)
1026 prev_end = curr->end;
1028 curr->start = prev_end;
1029 prev_end = curr->end;