4 * Copyright (C) 2002 Anton Blanchard <anton@au.ibm.com>, IBM
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
11 #include <linux/threads.h>
12 #include <linux/bootmem.h>
13 #include <linux/init.h>
15 #include <linux/mmzone.h>
16 #include <linux/module.h>
17 #include <linux/nodemask.h>
18 #include <linux/cpu.h>
19 #include <linux/notifier.h>
20 #include <asm/sparsemem.h>
22 #include <asm/system.h>
25 static int numa_enabled
= 1;
27 static char *cmdline __initdata
;
29 static int numa_debug
;
30 #define dbg(args...) if (numa_debug) { printk(KERN_INFO args); }
32 int numa_cpu_lookup_table
[NR_CPUS
];
33 cpumask_t numa_cpumask_lookup_table
[MAX_NUMNODES
];
34 struct pglist_data
*node_data
[MAX_NUMNODES
];
36 EXPORT_SYMBOL(numa_cpu_lookup_table
);
37 EXPORT_SYMBOL(numa_cpumask_lookup_table
);
38 EXPORT_SYMBOL(node_data
);
40 static bootmem_data_t __initdata plat_node_bdata
[MAX_NUMNODES
];
41 static int min_common_depth
;
42 static int n_mem_addr_cells
, n_mem_size_cells
;
44 static int __cpuinit
fake_numa_create_new_node(unsigned long end_pfn
,
47 unsigned long long mem
;
49 static unsigned int fake_nid
;
50 static unsigned long long curr_boundary
;
53 * Modify node id, iff we started creating NUMA nodes
54 * We want to continue from where we left of the last time
59 * In case there are no more arguments to parse, the
60 * node_id should be the same as the last fake node id
61 * (we've handled this above).
66 mem
= memparse(p
, &p
);
70 if (mem
< curr_boundary
)
75 if ((end_pfn
<< PAGE_SHIFT
) > mem
) {
77 * Skip commas and spaces
79 while (*p
== ',' || *p
== ' ' || *p
== '\t')
85 dbg("created new fake_node with id %d\n", fake_nid
);
91 static void __cpuinit
map_cpu_to_node(int cpu
, int node
)
93 numa_cpu_lookup_table
[cpu
] = node
;
95 dbg("adding cpu %d to node %d\n", cpu
, node
);
97 if (!(cpu_isset(cpu
, numa_cpumask_lookup_table
[node
])))
98 cpu_set(cpu
, numa_cpumask_lookup_table
[node
]);
101 #ifdef CONFIG_HOTPLUG_CPU
102 static void unmap_cpu_from_node(unsigned long cpu
)
104 int node
= numa_cpu_lookup_table
[cpu
];
106 dbg("removing cpu %lu from node %d\n", cpu
, node
);
108 if (cpu_isset(cpu
, numa_cpumask_lookup_table
[node
])) {
109 cpu_clear(cpu
, numa_cpumask_lookup_table
[node
]);
111 printk(KERN_ERR
"WARNING: cpu %lu not found in node %d\n",
115 #endif /* CONFIG_HOTPLUG_CPU */
117 static struct device_node
* __cpuinit
find_cpu_node(unsigned int cpu
)
119 unsigned int hw_cpuid
= get_hard_smp_processor_id(cpu
);
120 struct device_node
*cpu_node
= NULL
;
121 const unsigned int *interrupt_server
, *reg
;
124 while ((cpu_node
= of_find_node_by_type(cpu_node
, "cpu")) != NULL
) {
125 /* Try interrupt server first */
126 interrupt_server
= of_get_property(cpu_node
,
127 "ibm,ppc-interrupt-server#s", &len
);
129 len
= len
/ sizeof(u32
);
131 if (interrupt_server
&& (len
> 0)) {
133 if (interrupt_server
[len
] == hw_cpuid
)
137 reg
= of_get_property(cpu_node
, "reg", &len
);
138 if (reg
&& (len
> 0) && (reg
[0] == hw_cpuid
))
146 /* must hold reference to node during call */
147 static const int *of_get_associativity(struct device_node
*dev
)
149 return of_get_property(dev
, "ibm,associativity", NULL
);
152 /* Returns nid in the range [0..MAX_NUMNODES-1], or -1 if no useful numa
155 static int of_node_to_nid_single(struct device_node
*device
)
158 const unsigned int *tmp
;
160 if (min_common_depth
== -1)
163 tmp
= of_get_associativity(device
);
167 if (tmp
[0] >= min_common_depth
)
168 nid
= tmp
[min_common_depth
];
170 /* POWER4 LPAR uses 0xffff as invalid node */
171 if (nid
== 0xffff || nid
>= MAX_NUMNODES
)
177 /* Walk the device tree upwards, looking for an associativity id */
178 int of_node_to_nid(struct device_node
*device
)
180 struct device_node
*tmp
;
185 nid
= of_node_to_nid_single(device
);
190 device
= of_get_parent(tmp
);
197 EXPORT_SYMBOL_GPL(of_node_to_nid
);
200 * In theory, the "ibm,associativity" property may contain multiple
201 * associativity lists because a resource may be multiply connected
202 * into the machine. This resource then has different associativity
203 * characteristics relative to its multiple connections. We ignore
204 * this for now. We also assume that all cpu and memory sets have
205 * their distances represented at a common level. This won't be
206 * true for hierarchical NUMA.
208 * In any case the ibm,associativity-reference-points should give
209 * the correct depth for a normal NUMA system.
211 * - Dave Hansen <haveblue@us.ibm.com>
213 static int __init
find_min_common_depth(void)
216 const unsigned int *ref_points
;
217 struct device_node
*rtas_root
;
220 rtas_root
= of_find_node_by_path("/rtas");
226 * this property is 2 32-bit integers, each representing a level of
227 * depth in the associativity nodes. The first is for an SMP
228 * configuration (should be all 0's) and the second is for a normal
229 * NUMA configuration.
231 ref_points
= of_get_property(rtas_root
,
232 "ibm,associativity-reference-points", &len
);
234 if ((len
>= 1) && ref_points
) {
235 depth
= ref_points
[1];
237 dbg("NUMA: ibm,associativity-reference-points not found.\n");
240 of_node_put(rtas_root
);
245 static void __init
get_n_mem_cells(int *n_addr_cells
, int *n_size_cells
)
247 struct device_node
*memory
= NULL
;
249 memory
= of_find_node_by_type(memory
, "memory");
251 panic("numa.c: No memory nodes found!");
253 *n_addr_cells
= of_n_addr_cells(memory
);
254 *n_size_cells
= of_n_size_cells(memory
);
258 static unsigned long __devinit
read_n_cells(int n
, const unsigned int **buf
)
260 unsigned long result
= 0;
263 result
= (result
<< 32) | **buf
;
270 * Figure out to which domain a cpu belongs and stick it there.
271 * Return the id of the domain used.
273 static int __cpuinit
numa_setup_cpu(unsigned long lcpu
)
276 struct device_node
*cpu
= find_cpu_node(lcpu
);
283 nid
= of_node_to_nid_single(cpu
);
285 if (nid
< 0 || !node_online(nid
))
286 nid
= any_online_node(NODE_MASK_ALL
);
288 map_cpu_to_node(lcpu
, nid
);
295 static int __cpuinit
cpu_numa_callback(struct notifier_block
*nfb
,
296 unsigned long action
,
299 unsigned long lcpu
= (unsigned long)hcpu
;
300 int ret
= NOTIFY_DONE
;
304 case CPU_UP_PREPARE_FROZEN
:
305 numa_setup_cpu(lcpu
);
308 #ifdef CONFIG_HOTPLUG_CPU
310 case CPU_DEAD_FROZEN
:
311 case CPU_UP_CANCELED
:
312 case CPU_UP_CANCELED_FROZEN
:
313 unmap_cpu_from_node(lcpu
);
322 * Check and possibly modify a memory region to enforce the memory limit.
324 * Returns the size the region should have to enforce the memory limit.
325 * This will either be the original value of size, a truncated value,
326 * or zero. If the returned value of size is 0 the region should be
327 * discarded as it lies wholy above the memory limit.
329 static unsigned long __init
numa_enforce_memory_limit(unsigned long start
,
333 * We use lmb_end_of_DRAM() in here instead of memory_limit because
334 * we've already adjusted it for the limit and it takes care of
335 * having memory holes below the limit.
341 if (start
+ size
<= lmb_end_of_DRAM())
344 if (start
>= lmb_end_of_DRAM())
347 return lmb_end_of_DRAM() - start
;
351 * Extract NUMA information from the ibm,dynamic-reconfiguration-memory
352 * node. This assumes n_mem_{addr,size}_cells have been set.
354 static void __init
parse_drconf_memory(struct device_node
*memory
)
356 const unsigned int *lm
, *dm
, *aa
;
357 unsigned int ls
, ld
, la
;
358 unsigned int n
, aam
, aalen
;
359 unsigned long lmb_size
, size
, start
;
360 int nid
, default_nid
= 0;
361 unsigned int ai
, flags
;
363 lm
= of_get_property(memory
, "ibm,lmb-size", &ls
);
364 dm
= of_get_property(memory
, "ibm,dynamic-memory", &ld
);
365 aa
= of_get_property(memory
, "ibm,associativity-lookup-arrays", &la
);
366 if (!lm
|| !dm
|| !aa
||
367 ls
< sizeof(unsigned int) || ld
< sizeof(unsigned int) ||
368 la
< 2 * sizeof(unsigned int))
371 lmb_size
= read_n_cells(n_mem_size_cells
, &lm
);
372 n
= *dm
++; /* number of LMBs */
373 aam
= *aa
++; /* number of associativity lists */
374 aalen
= *aa
++; /* length of each associativity list */
375 if (ld
< (n
* (n_mem_addr_cells
+ 4) + 1) * sizeof(unsigned int) ||
376 la
< (aam
* aalen
+ 2) * sizeof(unsigned int))
379 for (; n
!= 0; --n
) {
380 start
= read_n_cells(n_mem_addr_cells
, &dm
);
384 /* 0x80 == reserved, 0x8 = assigned to us */
385 if ((flags
& 0x80) || !(flags
& 0x8))
388 /* flags & 0x40 means associativity index is invalid */
389 if (min_common_depth
> 0 && min_common_depth
<= aalen
&&
390 (flags
& 0x40) == 0 && ai
< aam
) {
391 /* this is like of_node_to_nid_single */
392 nid
= aa
[ai
* aalen
+ min_common_depth
- 1];
393 if (nid
== 0xffff || nid
>= MAX_NUMNODES
)
397 fake_numa_create_new_node(((start
+ lmb_size
) >> PAGE_SHIFT
),
399 node_set_online(nid
);
401 size
= numa_enforce_memory_limit(start
, lmb_size
);
405 add_active_range(nid
, start
>> PAGE_SHIFT
,
406 (start
>> PAGE_SHIFT
) + (size
>> PAGE_SHIFT
));
410 static int __init
parse_numa_properties(void)
412 struct device_node
*cpu
= NULL
;
413 struct device_node
*memory
= NULL
;
417 if (numa_enabled
== 0) {
418 printk(KERN_WARNING
"NUMA disabled by user\n");
422 min_common_depth
= find_min_common_depth();
424 if (min_common_depth
< 0)
425 return min_common_depth
;
427 dbg("NUMA associativity depth for CPU/Memory: %d\n", min_common_depth
);
430 * Even though we connect cpus to numa domains later in SMP
431 * init, we need to know the node ids now. This is because
432 * each node to be onlined must have NODE_DATA etc backing it.
434 for_each_present_cpu(i
) {
437 cpu
= find_cpu_node(i
);
439 nid
= of_node_to_nid_single(cpu
);
443 * Don't fall back to default_nid yet -- we will plug
444 * cpus into nodes once the memory scan has discovered
449 node_set_online(nid
);
452 get_n_mem_cells(&n_mem_addr_cells
, &n_mem_size_cells
);
454 while ((memory
= of_find_node_by_type(memory
, "memory")) != NULL
) {
459 const unsigned int *memcell_buf
;
462 memcell_buf
= of_get_property(memory
,
463 "linux,usable-memory", &len
);
464 if (!memcell_buf
|| len
<= 0)
465 memcell_buf
= of_get_property(memory
, "reg", &len
);
466 if (!memcell_buf
|| len
<= 0)
470 ranges
= (len
>> 2) / (n_mem_addr_cells
+ n_mem_size_cells
);
472 /* these are order-sensitive, and modify the buffer pointer */
473 start
= read_n_cells(n_mem_addr_cells
, &memcell_buf
);
474 size
= read_n_cells(n_mem_size_cells
, &memcell_buf
);
477 * Assumption: either all memory nodes or none will
478 * have associativity properties. If none, then
479 * everything goes to default_nid.
481 nid
= of_node_to_nid_single(memory
);
485 fake_numa_create_new_node(((start
+ size
) >> PAGE_SHIFT
), &nid
);
486 node_set_online(nid
);
488 if (!(size
= numa_enforce_memory_limit(start
, size
))) {
495 add_active_range(nid
, start
>> PAGE_SHIFT
,
496 (start
>> PAGE_SHIFT
) + (size
>> PAGE_SHIFT
));
503 * Now do the same thing for each LMB listed in the ibm,dynamic-memory
504 * property in the ibm,dynamic-reconfiguration-memory node.
506 memory
= of_find_node_by_path("/ibm,dynamic-reconfiguration-memory");
508 parse_drconf_memory(memory
);
513 static void __init
setup_nonnuma(void)
515 unsigned long top_of_ram
= lmb_end_of_DRAM();
516 unsigned long total_ram
= lmb_phys_mem_size();
517 unsigned long start_pfn
, end_pfn
;
518 unsigned int i
, nid
= 0;
520 printk(KERN_DEBUG
"Top of RAM: 0x%lx, Total RAM: 0x%lx\n",
521 top_of_ram
, total_ram
);
522 printk(KERN_DEBUG
"Memory hole size: %ldMB\n",
523 (top_of_ram
- total_ram
) >> 20);
525 for (i
= 0; i
< lmb
.memory
.cnt
; ++i
) {
526 start_pfn
= lmb
.memory
.region
[i
].base
>> PAGE_SHIFT
;
527 end_pfn
= start_pfn
+ lmb_size_pages(&lmb
.memory
, i
);
529 fake_numa_create_new_node(end_pfn
, &nid
);
530 add_active_range(nid
, start_pfn
, end_pfn
);
531 node_set_online(nid
);
535 void __init
dump_numa_cpu_topology(void)
538 unsigned int cpu
, count
;
540 if (min_common_depth
== -1 || !numa_enabled
)
543 for_each_online_node(node
) {
544 printk(KERN_DEBUG
"Node %d CPUs:", node
);
548 * If we used a CPU iterator here we would miss printing
549 * the holes in the cpumap.
551 for (cpu
= 0; cpu
< NR_CPUS
; cpu
++) {
552 if (cpu_isset(cpu
, numa_cpumask_lookup_table
[node
])) {
558 printk("-%u", cpu
- 1);
564 printk("-%u", NR_CPUS
- 1);
569 static void __init
dump_numa_memory_topology(void)
574 if (min_common_depth
== -1 || !numa_enabled
)
577 for_each_online_node(node
) {
580 printk(KERN_DEBUG
"Node %d Memory:", node
);
584 for (i
= 0; i
< lmb_end_of_DRAM();
585 i
+= (1 << SECTION_SIZE_BITS
)) {
586 if (early_pfn_to_nid(i
>> PAGE_SHIFT
) == node
) {
604 * Allocate some memory, satisfying the lmb or bootmem allocator where
605 * required. nid is the preferred node and end is the physical address of
606 * the highest address in the node.
608 * Returns the physical address of the memory.
610 static void __init
*careful_allocation(int nid
, unsigned long size
,
612 unsigned long end_pfn
)
615 unsigned long ret
= __lmb_alloc_base(size
, align
, end_pfn
<< PAGE_SHIFT
);
617 /* retry over all memory */
619 ret
= __lmb_alloc_base(size
, align
, lmb_end_of_DRAM());
622 panic("numa.c: cannot allocate %lu bytes on node %d",
626 * If the memory came from a previously allocated node, we must
627 * retry with the bootmem allocator.
629 new_nid
= early_pfn_to_nid(ret
>> PAGE_SHIFT
);
631 ret
= (unsigned long)__alloc_bootmem_node(NODE_DATA(new_nid
),
635 panic("numa.c: cannot allocate %lu bytes on node %d",
640 dbg("alloc_bootmem %lx %lx\n", ret
, size
);
646 static struct notifier_block __cpuinitdata ppc64_numa_nb
= {
647 .notifier_call
= cpu_numa_callback
,
648 .priority
= 1 /* Must run before sched domains notifier. */
651 void __init
do_init_bootmem(void)
657 max_low_pfn
= lmb_end_of_DRAM() >> PAGE_SHIFT
;
658 max_pfn
= max_low_pfn
;
660 if (parse_numa_properties())
663 dump_numa_memory_topology();
665 register_cpu_notifier(&ppc64_numa_nb
);
666 cpu_numa_callback(&ppc64_numa_nb
, CPU_UP_PREPARE
,
667 (void *)(unsigned long)boot_cpuid
);
669 for_each_online_node(nid
) {
670 unsigned long start_pfn
, end_pfn
;
671 unsigned long bootmem_paddr
;
672 unsigned long bootmap_pages
;
674 get_pfn_range_for_nid(nid
, &start_pfn
, &end_pfn
);
676 /* Allocate the node structure node local if possible */
677 NODE_DATA(nid
) = careful_allocation(nid
,
678 sizeof(struct pglist_data
),
679 SMP_CACHE_BYTES
, end_pfn
);
680 NODE_DATA(nid
) = __va(NODE_DATA(nid
));
681 memset(NODE_DATA(nid
), 0, sizeof(struct pglist_data
));
683 dbg("node %d\n", nid
);
684 dbg("NODE_DATA() = %p\n", NODE_DATA(nid
));
686 NODE_DATA(nid
)->bdata
= &plat_node_bdata
[nid
];
687 NODE_DATA(nid
)->node_start_pfn
= start_pfn
;
688 NODE_DATA(nid
)->node_spanned_pages
= end_pfn
- start_pfn
;
690 if (NODE_DATA(nid
)->node_spanned_pages
== 0)
693 dbg("start_paddr = %lx\n", start_pfn
<< PAGE_SHIFT
);
694 dbg("end_paddr = %lx\n", end_pfn
<< PAGE_SHIFT
);
696 bootmap_pages
= bootmem_bootmap_pages(end_pfn
- start_pfn
);
697 bootmem_paddr
= (unsigned long)careful_allocation(nid
,
698 bootmap_pages
<< PAGE_SHIFT
,
700 memset(__va(bootmem_paddr
), 0, bootmap_pages
<< PAGE_SHIFT
);
702 dbg("bootmap_paddr = %lx\n", bootmem_paddr
);
704 init_bootmem_node(NODE_DATA(nid
), bootmem_paddr
>> PAGE_SHIFT
,
707 free_bootmem_with_active_regions(nid
, end_pfn
);
709 /* Mark reserved regions on this node */
710 for (i
= 0; i
< lmb
.reserved
.cnt
; i
++) {
711 unsigned long physbase
= lmb
.reserved
.region
[i
].base
;
712 unsigned long size
= lmb
.reserved
.region
[i
].size
;
713 unsigned long start_paddr
= start_pfn
<< PAGE_SHIFT
;
714 unsigned long end_paddr
= end_pfn
<< PAGE_SHIFT
;
716 if (early_pfn_to_nid(physbase
>> PAGE_SHIFT
) != nid
&&
717 early_pfn_to_nid((physbase
+size
-1) >> PAGE_SHIFT
) != nid
)
720 if (physbase
< end_paddr
&&
721 (physbase
+size
) > start_paddr
) {
723 if (physbase
< start_paddr
) {
724 size
-= start_paddr
- physbase
;
725 physbase
= start_paddr
;
728 if (size
> end_paddr
- physbase
)
729 size
= end_paddr
- physbase
;
731 dbg("reserve_bootmem %lx %lx\n", physbase
,
733 reserve_bootmem_node(NODE_DATA(nid
), physbase
,
734 size
, BOOTMEM_DEFAULT
);
738 sparse_memory_present_with_active_regions(nid
);
742 void __init
paging_init(void)
744 unsigned long max_zone_pfns
[MAX_NR_ZONES
];
745 memset(max_zone_pfns
, 0, sizeof(max_zone_pfns
));
746 max_zone_pfns
[ZONE_DMA
] = lmb_end_of_DRAM() >> PAGE_SHIFT
;
747 free_area_init_nodes(max_zone_pfns
);
750 static int __init
early_numa(char *p
)
755 if (strstr(p
, "off"))
758 if (strstr(p
, "debug"))
761 p
= strstr(p
, "fake=");
763 cmdline
= p
+ strlen("fake=");
767 early_param("numa", early_numa
);
769 #ifdef CONFIG_MEMORY_HOTPLUG
771 * Find the node associated with a hot added memory section. Section
772 * corresponds to a SPARSEMEM section, not an LMB. It is assumed that
773 * sections are fully contained within a single LMB.
775 int hot_add_scn_to_nid(unsigned long scn_addr
)
777 struct device_node
*memory
= NULL
;
779 int default_nid
= any_online_node(NODE_MASK_ALL
);
782 if (!numa_enabled
|| (min_common_depth
< 0))
785 while ((memory
= of_find_node_by_type(memory
, "memory")) != NULL
) {
786 unsigned long start
, size
;
788 const unsigned int *memcell_buf
;
791 memcell_buf
= of_get_property(memory
, "reg", &len
);
792 if (!memcell_buf
|| len
<= 0)
796 ranges
= (len
>> 2) / (n_mem_addr_cells
+ n_mem_size_cells
);
798 start
= read_n_cells(n_mem_addr_cells
, &memcell_buf
);
799 size
= read_n_cells(n_mem_size_cells
, &memcell_buf
);
800 nid
= of_node_to_nid_single(memory
);
802 /* Domains not present at boot default to 0 */
803 if (nid
< 0 || !node_online(nid
))
806 if ((scn_addr
>= start
) && (scn_addr
< (start
+ size
))) {
811 if (--ranges
) /* process all ranges in cell */
814 BUG(); /* section address should be found above */
817 /* Temporary code to ensure that returned node is not empty */
820 while (NODE_DATA(nid
)->node_spanned_pages
== 0) {
821 node_clear(nid
, nodes
);
822 nid
= any_online_node(nodes
);
826 #endif /* CONFIG_MEMORY_HOTPLUG */