Merge tag 'locking-urgent-2020-08-15' of git://git.kernel.org/pub/scm/linux/kernel...
[linux/fpc-iii.git] / arch / powerpc / mm / numa.c
blob1f61fa2148b52cbe0db783c35c33c4c5654f2d0c
1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /*
3 * pSeries NUMA support
5 * Copyright (C) 2002 Anton Blanchard <anton@au.ibm.com>, IBM
6 */
7 #define pr_fmt(fmt) "numa: " fmt
9 #include <linux/threads.h>
10 #include <linux/memblock.h>
11 #include <linux/init.h>
12 #include <linux/mm.h>
13 #include <linux/mmzone.h>
14 #include <linux/export.h>
15 #include <linux/nodemask.h>
16 #include <linux/cpu.h>
17 #include <linux/notifier.h>
18 #include <linux/of.h>
19 #include <linux/pfn.h>
20 #include <linux/cpuset.h>
21 #include <linux/node.h>
22 #include <linux/stop_machine.h>
23 #include <linux/proc_fs.h>
24 #include <linux/seq_file.h>
25 #include <linux/uaccess.h>
26 #include <linux/slab.h>
27 #include <asm/cputhreads.h>
28 #include <asm/sparsemem.h>
29 #include <asm/prom.h>
30 #include <asm/smp.h>
31 #include <asm/topology.h>
32 #include <asm/firmware.h>
33 #include <asm/paca.h>
34 #include <asm/hvcall.h>
35 #include <asm/setup.h>
36 #include <asm/vdso.h>
37 #include <asm/drmem.h>
39 static int numa_enabled = 1;
41 static char *cmdline __initdata;
43 static int numa_debug;
44 #define dbg(args...) if (numa_debug) { printk(KERN_INFO args); }
46 int numa_cpu_lookup_table[NR_CPUS];
47 cpumask_var_t node_to_cpumask_map[MAX_NUMNODES];
48 struct pglist_data *node_data[MAX_NUMNODES];
50 EXPORT_SYMBOL(numa_cpu_lookup_table);
51 EXPORT_SYMBOL(node_to_cpumask_map);
52 EXPORT_SYMBOL(node_data);
54 static int min_common_depth;
55 static int n_mem_addr_cells, n_mem_size_cells;
56 static int form1_affinity;
58 #define MAX_DISTANCE_REF_POINTS 4
59 static int distance_ref_points_depth;
60 static const __be32 *distance_ref_points;
61 static int distance_lookup_table[MAX_NUMNODES][MAX_DISTANCE_REF_POINTS];
64 * Allocate node_to_cpumask_map based on number of available nodes
65 * Requires node_possible_map to be valid.
67 * Note: cpumask_of_node() is not valid until after this is done.
69 static void __init setup_node_to_cpumask_map(void)
71 unsigned int node;
73 /* setup nr_node_ids if not done yet */
74 if (nr_node_ids == MAX_NUMNODES)
75 setup_nr_node_ids();
77 /* allocate the map */
78 for_each_node(node)
79 alloc_bootmem_cpumask_var(&node_to_cpumask_map[node]);
81 /* cpumask_of_node() will now work */
82 dbg("Node to cpumask map for %u nodes\n", nr_node_ids);
85 static int __init fake_numa_create_new_node(unsigned long end_pfn,
86 unsigned int *nid)
88 unsigned long long mem;
89 char *p = cmdline;
90 static unsigned int fake_nid;
91 static unsigned long long curr_boundary;
94 * Modify node id, iff we started creating NUMA nodes
95 * We want to continue from where we left of the last time
97 if (fake_nid)
98 *nid = fake_nid;
100 * In case there are no more arguments to parse, the
101 * node_id should be the same as the last fake node id
102 * (we've handled this above).
104 if (!p)
105 return 0;
107 mem = memparse(p, &p);
108 if (!mem)
109 return 0;
111 if (mem < curr_boundary)
112 return 0;
114 curr_boundary = mem;
116 if ((end_pfn << PAGE_SHIFT) > mem) {
118 * Skip commas and spaces
120 while (*p == ',' || *p == ' ' || *p == '\t')
121 p++;
123 cmdline = p;
124 fake_nid++;
125 *nid = fake_nid;
126 dbg("created new fake_node with id %d\n", fake_nid);
127 return 1;
129 return 0;
132 static void reset_numa_cpu_lookup_table(void)
134 unsigned int cpu;
136 for_each_possible_cpu(cpu)
137 numa_cpu_lookup_table[cpu] = -1;
140 static void map_cpu_to_node(int cpu, int node)
142 update_numa_cpu_lookup_table(cpu, node);
144 dbg("adding cpu %d to node %d\n", cpu, node);
146 if (!(cpumask_test_cpu(cpu, node_to_cpumask_map[node])))
147 cpumask_set_cpu(cpu, node_to_cpumask_map[node]);
150 #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_PPC_SPLPAR)
151 static void unmap_cpu_from_node(unsigned long cpu)
153 int node = numa_cpu_lookup_table[cpu];
155 dbg("removing cpu %lu from node %d\n", cpu, node);
157 if (cpumask_test_cpu(cpu, node_to_cpumask_map[node])) {
158 cpumask_clear_cpu(cpu, node_to_cpumask_map[node]);
159 } else {
160 printk(KERN_ERR "WARNING: cpu %lu not found in node %d\n",
161 cpu, node);
164 #endif /* CONFIG_HOTPLUG_CPU || CONFIG_PPC_SPLPAR */
166 int cpu_distance(__be32 *cpu1_assoc, __be32 *cpu2_assoc)
168 int dist = 0;
170 int i, index;
172 for (i = 0; i < distance_ref_points_depth; i++) {
173 index = be32_to_cpu(distance_ref_points[i]);
174 if (cpu1_assoc[index] == cpu2_assoc[index])
175 break;
176 dist++;
179 return dist;
182 /* must hold reference to node during call */
183 static const __be32 *of_get_associativity(struct device_node *dev)
185 return of_get_property(dev, "ibm,associativity", NULL);
188 int __node_distance(int a, int b)
190 int i;
191 int distance = LOCAL_DISTANCE;
193 if (!form1_affinity)
194 return ((a == b) ? LOCAL_DISTANCE : REMOTE_DISTANCE);
196 for (i = 0; i < distance_ref_points_depth; i++) {
197 if (distance_lookup_table[a][i] == distance_lookup_table[b][i])
198 break;
200 /* Double the distance for each NUMA level */
201 distance *= 2;
204 return distance;
206 EXPORT_SYMBOL(__node_distance);
208 static void initialize_distance_lookup_table(int nid,
209 const __be32 *associativity)
211 int i;
213 if (!form1_affinity)
214 return;
216 for (i = 0; i < distance_ref_points_depth; i++) {
217 const __be32 *entry;
219 entry = &associativity[be32_to_cpu(distance_ref_points[i]) - 1];
220 distance_lookup_table[nid][i] = of_read_number(entry, 1);
225 * Returns nid in the range [0..nr_node_ids], or -1 if no useful NUMA
226 * info is found.
228 static int associativity_to_nid(const __be32 *associativity)
230 int nid = NUMA_NO_NODE;
232 if (!numa_enabled)
233 goto out;
235 if (of_read_number(associativity, 1) >= min_common_depth)
236 nid = of_read_number(&associativity[min_common_depth], 1);
238 /* POWER4 LPAR uses 0xffff as invalid node */
239 if (nid == 0xffff || nid >= nr_node_ids)
240 nid = NUMA_NO_NODE;
242 if (nid > 0 &&
243 of_read_number(associativity, 1) >= distance_ref_points_depth) {
245 * Skip the length field and send start of associativity array
247 initialize_distance_lookup_table(nid, associativity + 1);
250 out:
251 return nid;
254 /* Returns the nid associated with the given device tree node,
255 * or -1 if not found.
257 static int of_node_to_nid_single(struct device_node *device)
259 int nid = NUMA_NO_NODE;
260 const __be32 *tmp;
262 tmp = of_get_associativity(device);
263 if (tmp)
264 nid = associativity_to_nid(tmp);
265 return nid;
268 /* Walk the device tree upwards, looking for an associativity id */
269 int of_node_to_nid(struct device_node *device)
271 int nid = NUMA_NO_NODE;
273 of_node_get(device);
274 while (device) {
275 nid = of_node_to_nid_single(device);
276 if (nid != -1)
277 break;
279 device = of_get_next_parent(device);
281 of_node_put(device);
283 return nid;
285 EXPORT_SYMBOL(of_node_to_nid);
287 static int __init find_min_common_depth(void)
289 int depth;
290 struct device_node *root;
292 if (firmware_has_feature(FW_FEATURE_OPAL))
293 root = of_find_node_by_path("/ibm,opal");
294 else
295 root = of_find_node_by_path("/rtas");
296 if (!root)
297 root = of_find_node_by_path("/");
300 * This property is a set of 32-bit integers, each representing
301 * an index into the ibm,associativity nodes.
303 * With form 0 affinity the first integer is for an SMP configuration
304 * (should be all 0's) and the second is for a normal NUMA
305 * configuration. We have only one level of NUMA.
307 * With form 1 affinity the first integer is the most significant
308 * NUMA boundary and the following are progressively less significant
309 * boundaries. There can be more than one level of NUMA.
311 distance_ref_points = of_get_property(root,
312 "ibm,associativity-reference-points",
313 &distance_ref_points_depth);
315 if (!distance_ref_points) {
316 dbg("NUMA: ibm,associativity-reference-points not found.\n");
317 goto err;
320 distance_ref_points_depth /= sizeof(int);
322 if (firmware_has_feature(FW_FEATURE_OPAL) ||
323 firmware_has_feature(FW_FEATURE_TYPE1_AFFINITY)) {
324 dbg("Using form 1 affinity\n");
325 form1_affinity = 1;
328 if (form1_affinity) {
329 depth = of_read_number(distance_ref_points, 1);
330 } else {
331 if (distance_ref_points_depth < 2) {
332 printk(KERN_WARNING "NUMA: "
333 "short ibm,associativity-reference-points\n");
334 goto err;
337 depth = of_read_number(&distance_ref_points[1], 1);
341 * Warn and cap if the hardware supports more than
342 * MAX_DISTANCE_REF_POINTS domains.
344 if (distance_ref_points_depth > MAX_DISTANCE_REF_POINTS) {
345 printk(KERN_WARNING "NUMA: distance array capped at "
346 "%d entries\n", MAX_DISTANCE_REF_POINTS);
347 distance_ref_points_depth = MAX_DISTANCE_REF_POINTS;
350 of_node_put(root);
351 return depth;
353 err:
354 of_node_put(root);
355 return -1;
358 static void __init get_n_mem_cells(int *n_addr_cells, int *n_size_cells)
360 struct device_node *memory = NULL;
362 memory = of_find_node_by_type(memory, "memory");
363 if (!memory)
364 panic("numa.c: No memory nodes found!");
366 *n_addr_cells = of_n_addr_cells(memory);
367 *n_size_cells = of_n_size_cells(memory);
368 of_node_put(memory);
371 static unsigned long read_n_cells(int n, const __be32 **buf)
373 unsigned long result = 0;
375 while (n--) {
376 result = (result << 32) | of_read_number(*buf, 1);
377 (*buf)++;
379 return result;
382 struct assoc_arrays {
383 u32 n_arrays;
384 u32 array_sz;
385 const __be32 *arrays;
389 * Retrieve and validate the list of associativity arrays for drconf
390 * memory from the ibm,associativity-lookup-arrays property of the
391 * device tree..
393 * The layout of the ibm,associativity-lookup-arrays property is a number N
394 * indicating the number of associativity arrays, followed by a number M
395 * indicating the size of each associativity array, followed by a list
396 * of N associativity arrays.
398 static int of_get_assoc_arrays(struct assoc_arrays *aa)
400 struct device_node *memory;
401 const __be32 *prop;
402 u32 len;
404 memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory");
405 if (!memory)
406 return -1;
408 prop = of_get_property(memory, "ibm,associativity-lookup-arrays", &len);
409 if (!prop || len < 2 * sizeof(unsigned int)) {
410 of_node_put(memory);
411 return -1;
414 aa->n_arrays = of_read_number(prop++, 1);
415 aa->array_sz = of_read_number(prop++, 1);
417 of_node_put(memory);
419 /* Now that we know the number of arrays and size of each array,
420 * revalidate the size of the property read in.
422 if (len < (aa->n_arrays * aa->array_sz + 2) * sizeof(unsigned int))
423 return -1;
425 aa->arrays = prop;
426 return 0;
430 * This is like of_node_to_nid_single() for memory represented in the
431 * ibm,dynamic-reconfiguration-memory node.
433 static int of_drconf_to_nid_single(struct drmem_lmb *lmb)
435 struct assoc_arrays aa = { .arrays = NULL };
436 int default_nid = NUMA_NO_NODE;
437 int nid = default_nid;
438 int rc, index;
440 if ((min_common_depth < 0) || !numa_enabled)
441 return default_nid;
443 rc = of_get_assoc_arrays(&aa);
444 if (rc)
445 return default_nid;
447 if (min_common_depth <= aa.array_sz &&
448 !(lmb->flags & DRCONF_MEM_AI_INVALID) && lmb->aa_index < aa.n_arrays) {
449 index = lmb->aa_index * aa.array_sz + min_common_depth - 1;
450 nid = of_read_number(&aa.arrays[index], 1);
452 if (nid == 0xffff || nid >= nr_node_ids)
453 nid = default_nid;
455 if (nid > 0) {
456 index = lmb->aa_index * aa.array_sz;
457 initialize_distance_lookup_table(nid,
458 &aa.arrays[index]);
462 return nid;
465 #ifdef CONFIG_PPC_SPLPAR
466 static int vphn_get_nid(long lcpu)
468 __be32 associativity[VPHN_ASSOC_BUFSIZE] = {0};
469 long rc, hwid;
472 * On a shared lpar, device tree will not have node associativity.
473 * At this time lppaca, or its __old_status field may not be
474 * updated. Hence kernel cannot detect if its on a shared lpar. So
475 * request an explicit associativity irrespective of whether the
476 * lpar is shared or dedicated. Use the device tree property as a
477 * fallback. cpu_to_phys_id is only valid between
478 * smp_setup_cpu_maps() and smp_setup_pacas().
480 if (firmware_has_feature(FW_FEATURE_VPHN)) {
481 if (cpu_to_phys_id)
482 hwid = cpu_to_phys_id[lcpu];
483 else
484 hwid = get_hard_smp_processor_id(lcpu);
486 rc = hcall_vphn(hwid, VPHN_FLAG_VCPU, associativity);
487 if (rc == H_SUCCESS)
488 return associativity_to_nid(associativity);
491 return NUMA_NO_NODE;
493 #else
494 static int vphn_get_nid(long unused)
496 return NUMA_NO_NODE;
498 #endif /* CONFIG_PPC_SPLPAR */
501 * Figure out to which domain a cpu belongs and stick it there.
502 * Return the id of the domain used.
504 static int numa_setup_cpu(unsigned long lcpu)
506 struct device_node *cpu;
507 int fcpu = cpu_first_thread_sibling(lcpu);
508 int nid = NUMA_NO_NODE;
511 * If a valid cpu-to-node mapping is already available, use it
512 * directly instead of querying the firmware, since it represents
513 * the most recent mapping notified to us by the platform (eg: VPHN).
514 * Since cpu_to_node binding remains the same for all threads in the
515 * core. If a valid cpu-to-node mapping is already available, for
516 * the first thread in the core, use it.
518 nid = numa_cpu_lookup_table[fcpu];
519 if (nid >= 0) {
520 map_cpu_to_node(lcpu, nid);
521 return nid;
524 nid = vphn_get_nid(lcpu);
525 if (nid != NUMA_NO_NODE)
526 goto out_present;
528 cpu = of_get_cpu_node(lcpu, NULL);
530 if (!cpu) {
531 WARN_ON(1);
532 if (cpu_present(lcpu))
533 goto out_present;
534 else
535 goto out;
538 nid = of_node_to_nid_single(cpu);
539 of_node_put(cpu);
541 out_present:
542 if (nid < 0 || !node_possible(nid))
543 nid = first_online_node;
546 * Update for the first thread of the core. All threads of a core
547 * have to be part of the same node. This not only avoids querying
548 * for every other thread in the core, but always avoids a case
549 * where virtual node associativity change causes subsequent threads
550 * of a core to be associated with different nid. However if first
551 * thread is already online, expect it to have a valid mapping.
553 if (fcpu != lcpu) {
554 WARN_ON(cpu_online(fcpu));
555 map_cpu_to_node(fcpu, nid);
558 map_cpu_to_node(lcpu, nid);
559 out:
560 return nid;
563 static void verify_cpu_node_mapping(int cpu, int node)
565 int base, sibling, i;
567 /* Verify that all the threads in the core belong to the same node */
568 base = cpu_first_thread_sibling(cpu);
570 for (i = 0; i < threads_per_core; i++) {
571 sibling = base + i;
573 if (sibling == cpu || cpu_is_offline(sibling))
574 continue;
576 if (cpu_to_node(sibling) != node) {
577 WARN(1, "CPU thread siblings %d and %d don't belong"
578 " to the same node!\n", cpu, sibling);
579 break;
584 /* Must run before sched domains notifier. */
585 static int ppc_numa_cpu_prepare(unsigned int cpu)
587 int nid;
589 nid = numa_setup_cpu(cpu);
590 verify_cpu_node_mapping(cpu, nid);
591 return 0;
594 static int ppc_numa_cpu_dead(unsigned int cpu)
596 #ifdef CONFIG_HOTPLUG_CPU
597 unmap_cpu_from_node(cpu);
598 #endif
599 return 0;
603 * Check and possibly modify a memory region to enforce the memory limit.
605 * Returns the size the region should have to enforce the memory limit.
606 * This will either be the original value of size, a truncated value,
607 * or zero. If the returned value of size is 0 the region should be
608 * discarded as it lies wholly above the memory limit.
610 static unsigned long __init numa_enforce_memory_limit(unsigned long start,
611 unsigned long size)
614 * We use memblock_end_of_DRAM() in here instead of memory_limit because
615 * we've already adjusted it for the limit and it takes care of
616 * having memory holes below the limit. Also, in the case of
617 * iommu_is_off, memory_limit is not set but is implicitly enforced.
620 if (start + size <= memblock_end_of_DRAM())
621 return size;
623 if (start >= memblock_end_of_DRAM())
624 return 0;
626 return memblock_end_of_DRAM() - start;
630 * Reads the counter for a given entry in
631 * linux,drconf-usable-memory property
633 static inline int __init read_usm_ranges(const __be32 **usm)
636 * For each lmb in ibm,dynamic-memory a corresponding
637 * entry in linux,drconf-usable-memory property contains
638 * a counter followed by that many (base, size) duple.
639 * read the counter from linux,drconf-usable-memory
641 return read_n_cells(n_mem_size_cells, usm);
645 * Extract NUMA information from the ibm,dynamic-reconfiguration-memory
646 * node. This assumes n_mem_{addr,size}_cells have been set.
648 static int __init numa_setup_drmem_lmb(struct drmem_lmb *lmb,
649 const __be32 **usm,
650 void *data)
652 unsigned int ranges, is_kexec_kdump = 0;
653 unsigned long base, size, sz;
654 int nid;
657 * Skip this block if the reserved bit is set in flags (0x80)
658 * or if the block is not assigned to this partition (0x8)
660 if ((lmb->flags & DRCONF_MEM_RESERVED)
661 || !(lmb->flags & DRCONF_MEM_ASSIGNED))
662 return 0;
664 if (*usm)
665 is_kexec_kdump = 1;
667 base = lmb->base_addr;
668 size = drmem_lmb_size();
669 ranges = 1;
671 if (is_kexec_kdump) {
672 ranges = read_usm_ranges(usm);
673 if (!ranges) /* there are no (base, size) duple */
674 return 0;
677 do {
678 if (is_kexec_kdump) {
679 base = read_n_cells(n_mem_addr_cells, usm);
680 size = read_n_cells(n_mem_size_cells, usm);
683 nid = of_drconf_to_nid_single(lmb);
684 fake_numa_create_new_node(((base + size) >> PAGE_SHIFT),
685 &nid);
686 node_set_online(nid);
687 sz = numa_enforce_memory_limit(base, size);
688 if (sz)
689 memblock_set_node(base, sz, &memblock.memory, nid);
690 } while (--ranges);
692 return 0;
695 static int __init parse_numa_properties(void)
697 struct device_node *memory;
698 int default_nid = 0;
699 unsigned long i;
701 if (numa_enabled == 0) {
702 printk(KERN_WARNING "NUMA disabled by user\n");
703 return -1;
706 min_common_depth = find_min_common_depth();
708 if (min_common_depth < 0) {
710 * if we fail to parse min_common_depth from device tree
711 * mark the numa disabled, boot with numa disabled.
713 numa_enabled = false;
714 return min_common_depth;
717 dbg("NUMA associativity depth for CPU/Memory: %d\n", min_common_depth);
720 * Even though we connect cpus to numa domains later in SMP
721 * init, we need to know the node ids now. This is because
722 * each node to be onlined must have NODE_DATA etc backing it.
724 for_each_present_cpu(i) {
725 struct device_node *cpu;
726 int nid;
728 cpu = of_get_cpu_node(i, NULL);
729 BUG_ON(!cpu);
730 nid = of_node_to_nid_single(cpu);
731 of_node_put(cpu);
734 * Don't fall back to default_nid yet -- we will plug
735 * cpus into nodes once the memory scan has discovered
736 * the topology.
738 if (nid < 0)
739 continue;
740 node_set_online(nid);
743 get_n_mem_cells(&n_mem_addr_cells, &n_mem_size_cells);
745 for_each_node_by_type(memory, "memory") {
746 unsigned long start;
747 unsigned long size;
748 int nid;
749 int ranges;
750 const __be32 *memcell_buf;
751 unsigned int len;
753 memcell_buf = of_get_property(memory,
754 "linux,usable-memory", &len);
755 if (!memcell_buf || len <= 0)
756 memcell_buf = of_get_property(memory, "reg", &len);
757 if (!memcell_buf || len <= 0)
758 continue;
760 /* ranges in cell */
761 ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells);
762 new_range:
763 /* these are order-sensitive, and modify the buffer pointer */
764 start = read_n_cells(n_mem_addr_cells, &memcell_buf);
765 size = read_n_cells(n_mem_size_cells, &memcell_buf);
768 * Assumption: either all memory nodes or none will
769 * have associativity properties. If none, then
770 * everything goes to default_nid.
772 nid = of_node_to_nid_single(memory);
773 if (nid < 0)
774 nid = default_nid;
776 fake_numa_create_new_node(((start + size) >> PAGE_SHIFT), &nid);
777 node_set_online(nid);
779 size = numa_enforce_memory_limit(start, size);
780 if (size)
781 memblock_set_node(start, size, &memblock.memory, nid);
783 if (--ranges)
784 goto new_range;
788 * Now do the same thing for each MEMBLOCK listed in the
789 * ibm,dynamic-memory property in the
790 * ibm,dynamic-reconfiguration-memory node.
792 memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory");
793 if (memory) {
794 walk_drmem_lmbs(memory, NULL, numa_setup_drmem_lmb);
795 of_node_put(memory);
798 return 0;
801 static void __init setup_nonnuma(void)
803 unsigned long top_of_ram = memblock_end_of_DRAM();
804 unsigned long total_ram = memblock_phys_mem_size();
805 unsigned long start_pfn, end_pfn;
806 unsigned int nid = 0;
807 struct memblock_region *reg;
809 printk(KERN_DEBUG "Top of RAM: 0x%lx, Total RAM: 0x%lx\n",
810 top_of_ram, total_ram);
811 printk(KERN_DEBUG "Memory hole size: %ldMB\n",
812 (top_of_ram - total_ram) >> 20);
814 for_each_memblock(memory, reg) {
815 start_pfn = memblock_region_memory_base_pfn(reg);
816 end_pfn = memblock_region_memory_end_pfn(reg);
818 fake_numa_create_new_node(end_pfn, &nid);
819 memblock_set_node(PFN_PHYS(start_pfn),
820 PFN_PHYS(end_pfn - start_pfn),
821 &memblock.memory, nid);
822 node_set_online(nid);
826 void __init dump_numa_cpu_topology(void)
828 unsigned int node;
829 unsigned int cpu, count;
831 if (!numa_enabled)
832 return;
834 for_each_online_node(node) {
835 pr_info("Node %d CPUs:", node);
837 count = 0;
839 * If we used a CPU iterator here we would miss printing
840 * the holes in the cpumap.
842 for (cpu = 0; cpu < nr_cpu_ids; cpu++) {
843 if (cpumask_test_cpu(cpu,
844 node_to_cpumask_map[node])) {
845 if (count == 0)
846 pr_cont(" %u", cpu);
847 ++count;
848 } else {
849 if (count > 1)
850 pr_cont("-%u", cpu - 1);
851 count = 0;
855 if (count > 1)
856 pr_cont("-%u", nr_cpu_ids - 1);
857 pr_cont("\n");
861 /* Initialize NODE_DATA for a node on the local memory */
862 static void __init setup_node_data(int nid, u64 start_pfn, u64 end_pfn)
864 u64 spanned_pages = end_pfn - start_pfn;
865 const size_t nd_size = roundup(sizeof(pg_data_t), SMP_CACHE_BYTES);
866 u64 nd_pa;
867 void *nd;
868 int tnid;
870 nd_pa = memblock_phys_alloc_try_nid(nd_size, SMP_CACHE_BYTES, nid);
871 if (!nd_pa)
872 panic("Cannot allocate %zu bytes for node %d data\n",
873 nd_size, nid);
875 nd = __va(nd_pa);
877 /* report and initialize */
878 pr_info(" NODE_DATA [mem %#010Lx-%#010Lx]\n",
879 nd_pa, nd_pa + nd_size - 1);
880 tnid = early_pfn_to_nid(nd_pa >> PAGE_SHIFT);
881 if (tnid != nid)
882 pr_info(" NODE_DATA(%d) on node %d\n", nid, tnid);
884 node_data[nid] = nd;
885 memset(NODE_DATA(nid), 0, sizeof(pg_data_t));
886 NODE_DATA(nid)->node_id = nid;
887 NODE_DATA(nid)->node_start_pfn = start_pfn;
888 NODE_DATA(nid)->node_spanned_pages = spanned_pages;
891 static void __init find_possible_nodes(void)
893 struct device_node *rtas;
894 u32 numnodes, i;
896 if (!numa_enabled)
897 return;
899 rtas = of_find_node_by_path("/rtas");
900 if (!rtas)
901 return;
903 if (of_property_read_u32_index(rtas,
904 "ibm,max-associativity-domains",
905 min_common_depth, &numnodes))
906 goto out;
908 for (i = 0; i < numnodes; i++) {
909 if (!node_possible(i))
910 node_set(i, node_possible_map);
913 out:
914 of_node_put(rtas);
917 void __init mem_topology_setup(void)
919 int cpu;
921 if (parse_numa_properties())
922 setup_nonnuma();
925 * Modify the set of possible NUMA nodes to reflect information
926 * available about the set of online nodes, and the set of nodes
927 * that we expect to make use of for this platform's affinity
928 * calculations.
930 nodes_and(node_possible_map, node_possible_map, node_online_map);
932 find_possible_nodes();
934 setup_node_to_cpumask_map();
936 reset_numa_cpu_lookup_table();
938 for_each_present_cpu(cpu)
939 numa_setup_cpu(cpu);
942 void __init initmem_init(void)
944 int nid;
946 max_low_pfn = memblock_end_of_DRAM() >> PAGE_SHIFT;
947 max_pfn = max_low_pfn;
949 memblock_dump_all();
951 for_each_online_node(nid) {
952 unsigned long start_pfn, end_pfn;
954 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
955 setup_node_data(nid, start_pfn, end_pfn);
958 sparse_init();
961 * We need the numa_cpu_lookup_table to be accurate for all CPUs,
962 * even before we online them, so that we can use cpu_to_{node,mem}
963 * early in boot, cf. smp_prepare_cpus().
964 * _nocalls() + manual invocation is used because cpuhp is not yet
965 * initialized for the boot CPU.
967 cpuhp_setup_state_nocalls(CPUHP_POWER_NUMA_PREPARE, "powerpc/numa:prepare",
968 ppc_numa_cpu_prepare, ppc_numa_cpu_dead);
971 static int __init early_numa(char *p)
973 if (!p)
974 return 0;
976 if (strstr(p, "off"))
977 numa_enabled = 0;
979 if (strstr(p, "debug"))
980 numa_debug = 1;
982 p = strstr(p, "fake=");
983 if (p)
984 cmdline = p + strlen("fake=");
986 return 0;
988 early_param("numa", early_numa);
990 #ifdef CONFIG_MEMORY_HOTPLUG
992 * Find the node associated with a hot added memory section for
993 * memory represented in the device tree by the property
994 * ibm,dynamic-reconfiguration-memory/ibm,dynamic-memory.
996 static int hot_add_drconf_scn_to_nid(unsigned long scn_addr)
998 struct drmem_lmb *lmb;
999 unsigned long lmb_size;
1000 int nid = NUMA_NO_NODE;
1002 lmb_size = drmem_lmb_size();
1004 for_each_drmem_lmb(lmb) {
1005 /* skip this block if it is reserved or not assigned to
1006 * this partition */
1007 if ((lmb->flags & DRCONF_MEM_RESERVED)
1008 || !(lmb->flags & DRCONF_MEM_ASSIGNED))
1009 continue;
1011 if ((scn_addr < lmb->base_addr)
1012 || (scn_addr >= (lmb->base_addr + lmb_size)))
1013 continue;
1015 nid = of_drconf_to_nid_single(lmb);
1016 break;
1019 return nid;
1023 * Find the node associated with a hot added memory section for memory
1024 * represented in the device tree as a node (i.e. memory@XXXX) for
1025 * each memblock.
1027 static int hot_add_node_scn_to_nid(unsigned long scn_addr)
1029 struct device_node *memory;
1030 int nid = NUMA_NO_NODE;
1032 for_each_node_by_type(memory, "memory") {
1033 unsigned long start, size;
1034 int ranges;
1035 const __be32 *memcell_buf;
1036 unsigned int len;
1038 memcell_buf = of_get_property(memory, "reg", &len);
1039 if (!memcell_buf || len <= 0)
1040 continue;
1042 /* ranges in cell */
1043 ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells);
1045 while (ranges--) {
1046 start = read_n_cells(n_mem_addr_cells, &memcell_buf);
1047 size = read_n_cells(n_mem_size_cells, &memcell_buf);
1049 if ((scn_addr < start) || (scn_addr >= (start + size)))
1050 continue;
1052 nid = of_node_to_nid_single(memory);
1053 break;
1056 if (nid >= 0)
1057 break;
1060 of_node_put(memory);
1062 return nid;
1066 * Find the node associated with a hot added memory section. Section
1067 * corresponds to a SPARSEMEM section, not an MEMBLOCK. It is assumed that
1068 * sections are fully contained within a single MEMBLOCK.
1070 int hot_add_scn_to_nid(unsigned long scn_addr)
1072 struct device_node *memory = NULL;
1073 int nid;
1075 if (!numa_enabled)
1076 return first_online_node;
1078 memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory");
1079 if (memory) {
1080 nid = hot_add_drconf_scn_to_nid(scn_addr);
1081 of_node_put(memory);
1082 } else {
1083 nid = hot_add_node_scn_to_nid(scn_addr);
1086 if (nid < 0 || !node_possible(nid))
1087 nid = first_online_node;
1089 return nid;
1092 static u64 hot_add_drconf_memory_max(void)
1094 struct device_node *memory = NULL;
1095 struct device_node *dn = NULL;
1096 const __be64 *lrdr = NULL;
1098 dn = of_find_node_by_path("/rtas");
1099 if (dn) {
1100 lrdr = of_get_property(dn, "ibm,lrdr-capacity", NULL);
1101 of_node_put(dn);
1102 if (lrdr)
1103 return be64_to_cpup(lrdr);
1106 memory = of_find_node_by_path("/ibm,dynamic-reconfiguration-memory");
1107 if (memory) {
1108 of_node_put(memory);
1109 return drmem_lmb_memory_max();
1111 return 0;
1115 * memory_hotplug_max - return max address of memory that may be added
1117 * This is currently only used on systems that support drconfig memory
1118 * hotplug.
1120 u64 memory_hotplug_max(void)
1122 return max(hot_add_drconf_memory_max(), memblock_end_of_DRAM());
1124 #endif /* CONFIG_MEMORY_HOTPLUG */
1126 /* Virtual Processor Home Node (VPHN) support */
1127 #ifdef CONFIG_PPC_SPLPAR
1128 static int topology_inited;
1131 * Retrieve the new associativity information for a virtual processor's
1132 * home node.
1134 static long vphn_get_associativity(unsigned long cpu,
1135 __be32 *associativity)
1137 long rc;
1139 rc = hcall_vphn(get_hard_smp_processor_id(cpu),
1140 VPHN_FLAG_VCPU, associativity);
1142 switch (rc) {
1143 case H_SUCCESS:
1144 dbg("VPHN hcall succeeded. Reset polling...\n");
1145 goto out;
1147 case H_FUNCTION:
1148 pr_err_ratelimited("VPHN unsupported. Disabling polling...\n");
1149 break;
1150 case H_HARDWARE:
1151 pr_err_ratelimited("hcall_vphn() experienced a hardware fault "
1152 "preventing VPHN. Disabling polling...\n");
1153 break;
1154 case H_PARAMETER:
1155 pr_err_ratelimited("hcall_vphn() was passed an invalid parameter. "
1156 "Disabling polling...\n");
1157 break;
1158 default:
1159 pr_err_ratelimited("hcall_vphn() returned %ld. Disabling polling...\n"
1160 , rc);
1161 break;
1163 out:
1164 return rc;
1167 int find_and_online_cpu_nid(int cpu)
1169 __be32 associativity[VPHN_ASSOC_BUFSIZE] = {0};
1170 int new_nid;
1172 /* Use associativity from first thread for all siblings */
1173 if (vphn_get_associativity(cpu, associativity))
1174 return cpu_to_node(cpu);
1176 new_nid = associativity_to_nid(associativity);
1177 if (new_nid < 0 || !node_possible(new_nid))
1178 new_nid = first_online_node;
1180 if (NODE_DATA(new_nid) == NULL) {
1181 #ifdef CONFIG_MEMORY_HOTPLUG
1183 * Need to ensure that NODE_DATA is initialized for a node from
1184 * available memory (see memblock_alloc_try_nid). If unable to
1185 * init the node, then default to nearest node that has memory
1186 * installed. Skip onlining a node if the subsystems are not
1187 * yet initialized.
1189 if (!topology_inited || try_online_node(new_nid))
1190 new_nid = first_online_node;
1191 #else
1193 * Default to using the nearest node that has memory installed.
1194 * Otherwise, it would be necessary to patch the kernel MM code
1195 * to deal with more memoryless-node error conditions.
1197 new_nid = first_online_node;
1198 #endif
1201 pr_debug("%s:%d cpu %d nid %d\n", __FUNCTION__, __LINE__,
1202 cpu, new_nid);
1203 return new_nid;
1206 static int topology_update_init(void)
1208 topology_inited = 1;
1209 return 0;
1211 device_initcall(topology_update_init);
1212 #endif /* CONFIG_PPC_SPLPAR */