]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blame - arch/powerpc/mm/numa.c
[PATCH] powerpc numa: Consolidate handling of Power4 special case
[mirror_ubuntu-zesty-kernel.git] / arch / powerpc / mm / numa.c
CommitLineData
1da177e4
LT
1/*
2 * pSeries NUMA support
3 *
4 * Copyright (C) 2002 Anton Blanchard <anton@au.ibm.com>, IBM
5 *
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.
10 */
11#include <linux/threads.h>
12#include <linux/bootmem.h>
13#include <linux/init.h>
14#include <linux/mm.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>
45fb6cea 20#include <asm/sparsemem.h>
1da177e4 21#include <asm/lmb.h>
cf00a8d1 22#include <asm/system.h>
2249ca9d 23#include <asm/smp.h>
1da177e4
LT
24
25static int numa_enabled = 1;
26
27static int numa_debug;
28#define dbg(args...) if (numa_debug) { printk(KERN_INFO args); }
29
45fb6cea 30int numa_cpu_lookup_table[NR_CPUS];
1da177e4 31cpumask_t numa_cpumask_lookup_table[MAX_NUMNODES];
1da177e4 32struct pglist_data *node_data[MAX_NUMNODES];
45fb6cea
AB
33
34EXPORT_SYMBOL(numa_cpu_lookup_table);
35EXPORT_SYMBOL(numa_cpumask_lookup_table);
36EXPORT_SYMBOL(node_data);
37
38static bootmem_data_t __initdata plat_node_bdata[MAX_NUMNODES];
1da177e4 39static int min_common_depth;
237a0989 40static int n_mem_addr_cells, n_mem_size_cells;
1da177e4
LT
41
42/*
45fb6cea 43 * We need somewhere to store start/end/node for each region until we have
1da177e4
LT
44 * allocated the real node_data structures.
45 */
45fb6cea 46#define MAX_REGIONS (MAX_LMB_REGIONS*2)
1da177e4 47static struct {
45fb6cea
AB
48 unsigned long start_pfn;
49 unsigned long end_pfn;
50 int nid;
51} init_node_data[MAX_REGIONS] __initdata;
1da177e4 52
45fb6cea
AB
53int __init early_pfn_to_nid(unsigned long pfn)
54{
55 unsigned int i;
56
57 for (i = 0; init_node_data[i].end_pfn; i++) {
58 unsigned long start_pfn = init_node_data[i].start_pfn;
59 unsigned long end_pfn = init_node_data[i].end_pfn;
60
61 if ((start_pfn <= pfn) && (pfn < end_pfn))
62 return init_node_data[i].nid;
63 }
64
65 return -1;
66}
67
68void __init add_region(unsigned int nid, unsigned long start_pfn,
69 unsigned long pages)
70{
71 unsigned int i;
72
73 dbg("add_region nid %d start_pfn 0x%lx pages 0x%lx\n",
74 nid, start_pfn, pages);
75
76 for (i = 0; init_node_data[i].end_pfn; i++) {
77 if (init_node_data[i].nid != nid)
78 continue;
79 if (init_node_data[i].end_pfn == start_pfn) {
80 init_node_data[i].end_pfn += pages;
81 return;
82 }
83 if (init_node_data[i].start_pfn == (start_pfn + pages)) {
84 init_node_data[i].start_pfn -= pages;
85 return;
86 }
87 }
88
89 /*
90 * Leave last entry NULL so we dont iterate off the end (we use
91 * entry.end_pfn to terminate the walk).
92 */
93 if (i >= (MAX_REGIONS - 1)) {
94 printk(KERN_ERR "WARNING: too many memory regions in "
95 "numa code, truncating\n");
96 return;
97 }
98
99 init_node_data[i].start_pfn = start_pfn;
100 init_node_data[i].end_pfn = start_pfn + pages;
101 init_node_data[i].nid = nid;
102}
103
104/* We assume init_node_data has no overlapping regions */
105void __init get_region(unsigned int nid, unsigned long *start_pfn,
106 unsigned long *end_pfn, unsigned long *pages_present)
107{
108 unsigned int i;
109
110 *start_pfn = -1UL;
111 *end_pfn = *pages_present = 0;
112
113 for (i = 0; init_node_data[i].end_pfn; i++) {
114 if (init_node_data[i].nid != nid)
115 continue;
116
117 *pages_present += init_node_data[i].end_pfn -
118 init_node_data[i].start_pfn;
119
120 if (init_node_data[i].start_pfn < *start_pfn)
121 *start_pfn = init_node_data[i].start_pfn;
122
123 if (init_node_data[i].end_pfn > *end_pfn)
124 *end_pfn = init_node_data[i].end_pfn;
125 }
126
127 /* We didnt find a matching region, return start/end as 0 */
128 if (*start_pfn == -1UL)
6d91bb93 129 *start_pfn = 0;
45fb6cea 130}
1da177e4 131
2e5ce39d 132static void __cpuinit map_cpu_to_node(int cpu, int node)
1da177e4
LT
133{
134 numa_cpu_lookup_table[cpu] = node;
45fb6cea 135
bf4b85b0
NL
136 dbg("adding cpu %d to node %d\n", cpu, node);
137
45fb6cea 138 if (!(cpu_isset(cpu, numa_cpumask_lookup_table[node])))
1da177e4 139 cpu_set(cpu, numa_cpumask_lookup_table[node]);
1da177e4
LT
140}
141
142#ifdef CONFIG_HOTPLUG_CPU
143static void unmap_cpu_from_node(unsigned long cpu)
144{
145 int node = numa_cpu_lookup_table[cpu];
146
147 dbg("removing cpu %lu from node %d\n", cpu, node);
148
149 if (cpu_isset(cpu, numa_cpumask_lookup_table[node])) {
150 cpu_clear(cpu, numa_cpumask_lookup_table[node]);
1da177e4
LT
151 } else {
152 printk(KERN_ERR "WARNING: cpu %lu not found in node %d\n",
153 cpu, node);
154 }
155}
156#endif /* CONFIG_HOTPLUG_CPU */
157
2e5ce39d 158static struct device_node * __cpuinit find_cpu_node(unsigned int cpu)
1da177e4
LT
159{
160 unsigned int hw_cpuid = get_hard_smp_processor_id(cpu);
161 struct device_node *cpu_node = NULL;
162 unsigned int *interrupt_server, *reg;
163 int len;
164
165 while ((cpu_node = of_find_node_by_type(cpu_node, "cpu")) != NULL) {
166 /* Try interrupt server first */
167 interrupt_server = (unsigned int *)get_property(cpu_node,
168 "ibm,ppc-interrupt-server#s", &len);
169
170 len = len / sizeof(u32);
171
172 if (interrupt_server && (len > 0)) {
173 while (len--) {
174 if (interrupt_server[len] == hw_cpuid)
175 return cpu_node;
176 }
177 } else {
178 reg = (unsigned int *)get_property(cpu_node,
179 "reg", &len);
180 if (reg && (len > 0) && (reg[0] == hw_cpuid))
181 return cpu_node;
182 }
183 }
184
185 return NULL;
186}
187
188/* must hold reference to node during call */
189static int *of_get_associativity(struct device_node *dev)
190{
191 return (unsigned int *)get_property(dev, "ibm,associativity", NULL);
192}
193
cf950b7a 194static int of_node_to_nid(struct device_node *device)
1da177e4 195{
cf950b7a 196 int nid;
1da177e4
LT
197 unsigned int *tmp;
198
199 if (min_common_depth == -1)
200 return 0;
201
202 tmp = of_get_associativity(device);
203 if (tmp && (tmp[0] >= min_common_depth)) {
cf950b7a 204 nid = tmp[min_common_depth];
1da177e4
LT
205 } else {
206 dbg("WARNING: no NUMA information for %s\n",
207 device->full_name);
cf950b7a 208 nid = 0;
1da177e4 209 }
bc16a759
NL
210
211 /* POWER4 LPAR uses 0xffff as invalid node */
212 if (nid == 0xffff)
213 nid = 0;
214
cf950b7a 215 return nid;
1da177e4
LT
216}
217
218/*
219 * In theory, the "ibm,associativity" property may contain multiple
220 * associativity lists because a resource may be multiply connected
221 * into the machine. This resource then has different associativity
222 * characteristics relative to its multiple connections. We ignore
223 * this for now. We also assume that all cpu and memory sets have
224 * their distances represented at a common level. This won't be
225 * true for heirarchical NUMA.
226 *
227 * In any case the ibm,associativity-reference-points should give
228 * the correct depth for a normal NUMA system.
229 *
230 * - Dave Hansen <haveblue@us.ibm.com>
231 */
232static int __init find_min_common_depth(void)
233{
234 int depth;
235 unsigned int *ref_points;
236 struct device_node *rtas_root;
237 unsigned int len;
238
239 rtas_root = of_find_node_by_path("/rtas");
240
241 if (!rtas_root)
242 return -1;
243
244 /*
245 * this property is 2 32-bit integers, each representing a level of
246 * depth in the associativity nodes. The first is for an SMP
247 * configuration (should be all 0's) and the second is for a normal
248 * NUMA configuration.
249 */
250 ref_points = (unsigned int *)get_property(rtas_root,
251 "ibm,associativity-reference-points", &len);
252
253 if ((len >= 1) && ref_points) {
254 depth = ref_points[1];
255 } else {
bf4b85b0 256 dbg("NUMA: ibm,associativity-reference-points not found.\n");
1da177e4
LT
257 depth = -1;
258 }
259 of_node_put(rtas_root);
260
261 return depth;
262}
263
84c9fdd1 264static void __init get_n_mem_cells(int *n_addr_cells, int *n_size_cells)
1da177e4
LT
265{
266 struct device_node *memory = NULL;
1da177e4
LT
267
268 memory = of_find_node_by_type(memory, "memory");
54c23310 269 if (!memory)
84c9fdd1 270 panic("numa.c: No memory nodes found!");
54c23310 271
84c9fdd1
MK
272 *n_addr_cells = prom_n_addr_cells(memory);
273 *n_size_cells = prom_n_size_cells(memory);
274 of_node_put(memory);
1da177e4
LT
275}
276
237a0989 277static unsigned long __devinit read_n_cells(int n, unsigned int **buf)
1da177e4
LT
278{
279 unsigned long result = 0;
280
281 while (n--) {
282 result = (result << 32) | **buf;
283 (*buf)++;
284 }
285 return result;
286}
287
288/*
289 * Figure out to which domain a cpu belongs and stick it there.
290 * Return the id of the domain used.
291 */
2e5ce39d 292static int __cpuinit numa_setup_cpu(unsigned long lcpu)
1da177e4 293{
cf950b7a 294 int nid = 0;
1da177e4
LT
295 struct device_node *cpu = find_cpu_node(lcpu);
296
297 if (!cpu) {
298 WARN_ON(1);
299 goto out;
300 }
301
cf950b7a 302 nid = of_node_to_nid(cpu);
1da177e4 303
cf950b7a 304 if (nid >= num_online_nodes()) {
bc16a759
NL
305 printk(KERN_ERR "WARNING: cpu %ld "
306 "maps to invalid NUMA node %d\n",
307 lcpu, nid);
cf950b7a 308 nid = 0;
1da177e4
LT
309 }
310out:
cf950b7a 311 node_set_online(nid);
1da177e4 312
cf950b7a 313 map_cpu_to_node(lcpu, nid);
1da177e4
LT
314
315 of_node_put(cpu);
316
cf950b7a 317 return nid;
1da177e4
LT
318}
319
320static int cpu_numa_callback(struct notifier_block *nfb,
321 unsigned long action,
322 void *hcpu)
323{
324 unsigned long lcpu = (unsigned long)hcpu;
325 int ret = NOTIFY_DONE;
326
327 switch (action) {
328 case CPU_UP_PREPARE:
329 if (min_common_depth == -1 || !numa_enabled)
330 map_cpu_to_node(lcpu, 0);
331 else
332 numa_setup_cpu(lcpu);
333 ret = NOTIFY_OK;
334 break;
335#ifdef CONFIG_HOTPLUG_CPU
336 case CPU_DEAD:
337 case CPU_UP_CANCELED:
338 unmap_cpu_from_node(lcpu);
339 break;
340 ret = NOTIFY_OK;
341#endif
342 }
343 return ret;
344}
345
346/*
347 * Check and possibly modify a memory region to enforce the memory limit.
348 *
349 * Returns the size the region should have to enforce the memory limit.
350 * This will either be the original value of size, a truncated value,
351 * or zero. If the returned value of size is 0 the region should be
352 * discarded as it lies wholy above the memory limit.
353 */
45fb6cea
AB
354static unsigned long __init numa_enforce_memory_limit(unsigned long start,
355 unsigned long size)
1da177e4
LT
356{
357 /*
358 * We use lmb_end_of_DRAM() in here instead of memory_limit because
359 * we've already adjusted it for the limit and it takes care of
360 * having memory holes below the limit.
361 */
1da177e4
LT
362
363 if (! memory_limit)
364 return size;
365
366 if (start + size <= lmb_end_of_DRAM())
367 return size;
368
369 if (start >= lmb_end_of_DRAM())
370 return 0;
371
372 return lmb_end_of_DRAM() - start;
373}
374
375static int __init parse_numa_properties(void)
376{
377 struct device_node *cpu = NULL;
378 struct device_node *memory = NULL;
c08888cf 379 int max_domain = 0;
1da177e4
LT
380 unsigned long i;
381
382 if (numa_enabled == 0) {
383 printk(KERN_WARNING "NUMA disabled by user\n");
384 return -1;
385 }
386
1da177e4
LT
387 min_common_depth = find_min_common_depth();
388
1da177e4
LT
389 if (min_common_depth < 0)
390 return min_common_depth;
391
bf4b85b0
NL
392 dbg("NUMA associativity depth for CPU/Memory: %d\n", min_common_depth);
393
1da177e4
LT
394 /*
395 * Even though we connect cpus to numa domains later in SMP init,
396 * we need to know the maximum node id now. This is because each
397 * node id must have NODE_DATA etc backing it.
398 * As a result of hotplug we could still have cpus appear later on
399 * with larger node ids. In that case we force the cpu into node 0.
400 */
401 for_each_cpu(i) {
cf950b7a 402 int nid;
1da177e4
LT
403
404 cpu = find_cpu_node(i);
405
406 if (cpu) {
cf950b7a 407 nid = of_node_to_nid(cpu);
1da177e4
LT
408 of_node_put(cpu);
409
cf950b7a
NL
410 if (nid < MAX_NUMNODES &&
411 max_domain < nid)
412 max_domain = nid;
1da177e4
LT
413 }
414 }
415
237a0989 416 get_n_mem_cells(&n_mem_addr_cells, &n_mem_size_cells);
1da177e4
LT
417 memory = NULL;
418 while ((memory = of_find_node_by_type(memory, "memory")) != NULL) {
419 unsigned long start;
420 unsigned long size;
cf950b7a 421 int nid;
1da177e4
LT
422 int ranges;
423 unsigned int *memcell_buf;
424 unsigned int len;
425
ba759485
ME
426 memcell_buf = (unsigned int *)get_property(memory,
427 "linux,usable-memory", &len);
428 if (!memcell_buf || len <= 0)
429 memcell_buf =
430 (unsigned int *)get_property(memory, "reg",
431 &len);
1da177e4
LT
432 if (!memcell_buf || len <= 0)
433 continue;
434
cc5d0189
BH
435 /* ranges in cell */
436 ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells);
1da177e4
LT
437new_range:
438 /* these are order-sensitive, and modify the buffer pointer */
237a0989
MK
439 start = read_n_cells(n_mem_addr_cells, &memcell_buf);
440 size = read_n_cells(n_mem_size_cells, &memcell_buf);
1da177e4 441
cf950b7a 442 nid = of_node_to_nid(memory);
1da177e4 443
cf950b7a 444 if (nid >= MAX_NUMNODES) {
bc16a759
NL
445 printk(KERN_ERR "WARNING: memory at %lx maps "
446 "to invalid NUMA node %d\n", start,
447 nid);
cf950b7a 448 nid = 0;
1da177e4
LT
449 }
450
cf950b7a
NL
451 if (max_domain < nid)
452 max_domain = nid;
1da177e4 453
45fb6cea 454 if (!(size = numa_enforce_memory_limit(start, size))) {
1da177e4
LT
455 if (--ranges)
456 goto new_range;
457 else
458 continue;
459 }
460
cf950b7a 461 add_region(nid, start >> PAGE_SHIFT,
45fb6cea 462 size >> PAGE_SHIFT);
1da177e4
LT
463
464 if (--ranges)
465 goto new_range;
466 }
467
468 for (i = 0; i <= max_domain; i++)
469 node_set_online(i);
470
c08888cf
NL
471 max_domain = numa_setup_cpu(boot_cpuid);
472
1da177e4
LT
473 return 0;
474}
475
476static void __init setup_nonnuma(void)
477{
478 unsigned long top_of_ram = lmb_end_of_DRAM();
479 unsigned long total_ram = lmb_phys_mem_size();
fb6d73d3 480 unsigned int i;
1da177e4
LT
481
482 printk(KERN_INFO "Top of RAM: 0x%lx, Total RAM: 0x%lx\n",
483 top_of_ram, total_ram);
484 printk(KERN_INFO "Memory hole size: %ldMB\n",
485 (top_of_ram - total_ram) >> 20);
486
1da177e4 487 map_cpu_to_node(boot_cpuid, 0);
fb6d73d3
PM
488 for (i = 0; i < lmb.memory.cnt; ++i)
489 add_region(0, lmb.memory.region[i].base >> PAGE_SHIFT,
490 lmb_size_pages(&lmb.memory, i));
1da177e4 491 node_set_online(0);
1da177e4
LT
492}
493
4b703a23
AB
494void __init dump_numa_cpu_topology(void)
495{
496 unsigned int node;
497 unsigned int cpu, count;
498
499 if (min_common_depth == -1 || !numa_enabled)
500 return;
501
502 for_each_online_node(node) {
503 printk(KERN_INFO "Node %d CPUs:", node);
504
505 count = 0;
506 /*
507 * If we used a CPU iterator here we would miss printing
508 * the holes in the cpumap.
509 */
510 for (cpu = 0; cpu < NR_CPUS; cpu++) {
511 if (cpu_isset(cpu, numa_cpumask_lookup_table[node])) {
512 if (count == 0)
513 printk(" %u", cpu);
514 ++count;
515 } else {
516 if (count > 1)
517 printk("-%u", cpu - 1);
518 count = 0;
519 }
520 }
521
522 if (count > 1)
523 printk("-%u", NR_CPUS - 1);
524 printk("\n");
525 }
526}
527
528static void __init dump_numa_memory_topology(void)
1da177e4
LT
529{
530 unsigned int node;
531 unsigned int count;
532
533 if (min_common_depth == -1 || !numa_enabled)
534 return;
535
536 for_each_online_node(node) {
537 unsigned long i;
538
539 printk(KERN_INFO "Node %d Memory:", node);
540
541 count = 0;
542
45fb6cea
AB
543 for (i = 0; i < lmb_end_of_DRAM();
544 i += (1 << SECTION_SIZE_BITS)) {
545 if (early_pfn_to_nid(i >> PAGE_SHIFT) == node) {
1da177e4
LT
546 if (count == 0)
547 printk(" 0x%lx", i);
548 ++count;
549 } else {
550 if (count > 0)
551 printk("-0x%lx", i);
552 count = 0;
553 }
554 }
555
556 if (count > 0)
557 printk("-0x%lx", i);
558 printk("\n");
559 }
1da177e4
LT
560}
561
562/*
563 * Allocate some memory, satisfying the lmb or bootmem allocator where
564 * required. nid is the preferred node and end is the physical address of
565 * the highest address in the node.
566 *
567 * Returns the physical address of the memory.
568 */
45fb6cea
AB
569static void __init *careful_allocation(int nid, unsigned long size,
570 unsigned long align,
571 unsigned long end_pfn)
1da177e4 572{
45fb6cea 573 int new_nid;
d7a5b2ff 574 unsigned long ret = __lmb_alloc_base(size, align, end_pfn << PAGE_SHIFT);
1da177e4
LT
575
576 /* retry over all memory */
577 if (!ret)
d7a5b2ff 578 ret = __lmb_alloc_base(size, align, lmb_end_of_DRAM());
1da177e4
LT
579
580 if (!ret)
581 panic("numa.c: cannot allocate %lu bytes on node %d",
582 size, nid);
583
584 /*
585 * If the memory came from a previously allocated node, we must
586 * retry with the bootmem allocator.
587 */
45fb6cea
AB
588 new_nid = early_pfn_to_nid(ret >> PAGE_SHIFT);
589 if (new_nid < nid) {
590 ret = (unsigned long)__alloc_bootmem_node(NODE_DATA(new_nid),
1da177e4
LT
591 size, align, 0);
592
593 if (!ret)
594 panic("numa.c: cannot allocate %lu bytes on node %d",
45fb6cea 595 size, new_nid);
1da177e4 596
45fb6cea 597 ret = __pa(ret);
1da177e4
LT
598
599 dbg("alloc_bootmem %lx %lx\n", ret, size);
600 }
601
45fb6cea 602 return (void *)ret;
1da177e4
LT
603}
604
605void __init do_init_bootmem(void)
606{
607 int nid;
45fb6cea 608 unsigned int i;
1da177e4
LT
609 static struct notifier_block ppc64_numa_nb = {
610 .notifier_call = cpu_numa_callback,
611 .priority = 1 /* Must run before sched domains notifier. */
612 };
613
614 min_low_pfn = 0;
615 max_low_pfn = lmb_end_of_DRAM() >> PAGE_SHIFT;
616 max_pfn = max_low_pfn;
617
618 if (parse_numa_properties())
619 setup_nonnuma();
620 else
4b703a23 621 dump_numa_memory_topology();
1da177e4
LT
622
623 register_cpu_notifier(&ppc64_numa_nb);
624
625 for_each_online_node(nid) {
45fb6cea 626 unsigned long start_pfn, end_pfn, pages_present;
1da177e4
LT
627 unsigned long bootmem_paddr;
628 unsigned long bootmap_pages;
629
45fb6cea 630 get_region(nid, &start_pfn, &end_pfn, &pages_present);
1da177e4
LT
631
632 /* Allocate the node structure node local if possible */
45fb6cea 633 NODE_DATA(nid) = careful_allocation(nid,
1da177e4 634 sizeof(struct pglist_data),
45fb6cea
AB
635 SMP_CACHE_BYTES, end_pfn);
636 NODE_DATA(nid) = __va(NODE_DATA(nid));
1da177e4
LT
637 memset(NODE_DATA(nid), 0, sizeof(struct pglist_data));
638
639 dbg("node %d\n", nid);
640 dbg("NODE_DATA() = %p\n", NODE_DATA(nid));
641
642 NODE_DATA(nid)->bdata = &plat_node_bdata[nid];
45fb6cea
AB
643 NODE_DATA(nid)->node_start_pfn = start_pfn;
644 NODE_DATA(nid)->node_spanned_pages = end_pfn - start_pfn;
1da177e4
LT
645
646 if (NODE_DATA(nid)->node_spanned_pages == 0)
647 continue;
648
45fb6cea
AB
649 dbg("start_paddr = %lx\n", start_pfn << PAGE_SHIFT);
650 dbg("end_paddr = %lx\n", end_pfn << PAGE_SHIFT);
1da177e4 651
45fb6cea
AB
652 bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
653 bootmem_paddr = (unsigned long)careful_allocation(nid,
654 bootmap_pages << PAGE_SHIFT,
655 PAGE_SIZE, end_pfn);
656 memset(__va(bootmem_paddr), 0, bootmap_pages << PAGE_SHIFT);
1da177e4 657
1da177e4
LT
658 dbg("bootmap_paddr = %lx\n", bootmem_paddr);
659
660 init_bootmem_node(NODE_DATA(nid), bootmem_paddr >> PAGE_SHIFT,
45fb6cea 661 start_pfn, end_pfn);
1da177e4 662
45fb6cea
AB
663 /* Add free regions on this node */
664 for (i = 0; init_node_data[i].end_pfn; i++) {
665 unsigned long start, end;
1da177e4 666
45fb6cea 667 if (init_node_data[i].nid != nid)
1da177e4
LT
668 continue;
669
45fb6cea
AB
670 start = init_node_data[i].start_pfn << PAGE_SHIFT;
671 end = init_node_data[i].end_pfn << PAGE_SHIFT;
1da177e4 672
45fb6cea
AB
673 dbg("free_bootmem %lx %lx\n", start, end - start);
674 free_bootmem_node(NODE_DATA(nid), start, end - start);
1da177e4
LT
675 }
676
45fb6cea 677 /* Mark reserved regions on this node */
1da177e4 678 for (i = 0; i < lmb.reserved.cnt; i++) {
180379dc 679 unsigned long physbase = lmb.reserved.region[i].base;
1da177e4 680 unsigned long size = lmb.reserved.region[i].size;
45fb6cea
AB
681 unsigned long start_paddr = start_pfn << PAGE_SHIFT;
682 unsigned long end_paddr = end_pfn << PAGE_SHIFT;
1da177e4 683
45fb6cea
AB
684 if (early_pfn_to_nid(physbase >> PAGE_SHIFT) != nid &&
685 early_pfn_to_nid((physbase+size-1) >> PAGE_SHIFT) != nid)
1da177e4
LT
686 continue;
687
688 if (physbase < end_paddr &&
689 (physbase+size) > start_paddr) {
690 /* overlaps */
691 if (physbase < start_paddr) {
692 size -= start_paddr - physbase;
693 physbase = start_paddr;
694 }
695
696 if (size > end_paddr - physbase)
697 size = end_paddr - physbase;
698
699 dbg("reserve_bootmem %lx %lx\n", physbase,
700 size);
701 reserve_bootmem_node(NODE_DATA(nid), physbase,
702 size);
703 }
704 }
802f192e 705
45fb6cea
AB
706 /* Add regions into sparsemem */
707 for (i = 0; init_node_data[i].end_pfn; i++) {
708 unsigned long start, end;
709
710 if (init_node_data[i].nid != nid)
802f192e
BP
711 continue;
712
45fb6cea
AB
713 start = init_node_data[i].start_pfn;
714 end = init_node_data[i].end_pfn;
802f192e 715
45fb6cea 716 memory_present(nid, start, end);
802f192e 717 }
1da177e4
LT
718 }
719}
720
721void __init paging_init(void)
722{
723 unsigned long zones_size[MAX_NR_ZONES];
724 unsigned long zholes_size[MAX_NR_ZONES];
725 int nid;
726
727 memset(zones_size, 0, sizeof(zones_size));
728 memset(zholes_size, 0, sizeof(zholes_size));
729
730 for_each_online_node(nid) {
45fb6cea 731 unsigned long start_pfn, end_pfn, pages_present;
1da177e4 732
45fb6cea 733 get_region(nid, &start_pfn, &end_pfn, &pages_present);
1da177e4
LT
734
735 zones_size[ZONE_DMA] = end_pfn - start_pfn;
45fb6cea 736 zholes_size[ZONE_DMA] = zones_size[ZONE_DMA] - pages_present;
1da177e4
LT
737
738 dbg("free_area_init node %d %lx %lx (hole: %lx)\n", nid,
739 zones_size[ZONE_DMA], start_pfn, zholes_size[ZONE_DMA]);
740
45fb6cea
AB
741 free_area_init_node(nid, NODE_DATA(nid), zones_size, start_pfn,
742 zholes_size);
1da177e4
LT
743 }
744}
745
746static int __init early_numa(char *p)
747{
748 if (!p)
749 return 0;
750
751 if (strstr(p, "off"))
752 numa_enabled = 0;
753
754 if (strstr(p, "debug"))
755 numa_debug = 1;
756
757 return 0;
758}
759early_param("numa", early_numa);
237a0989
MK
760
761#ifdef CONFIG_MEMORY_HOTPLUG
762/*
763 * Find the node associated with a hot added memory section. Section
764 * corresponds to a SPARSEMEM section, not an LMB. It is assumed that
765 * sections are fully contained within a single LMB.
766 */
767int hot_add_scn_to_nid(unsigned long scn_addr)
768{
769 struct device_node *memory = NULL;
b226e462 770 nodemask_t nodes;
cf950b7a 771 int nid = 0;
237a0989
MK
772
773 if (!numa_enabled || (min_common_depth < 0))
cf950b7a 774 return nid;
237a0989
MK
775
776 while ((memory = of_find_node_by_type(memory, "memory")) != NULL) {
777 unsigned long start, size;
b226e462 778 int ranges;
237a0989
MK
779 unsigned int *memcell_buf;
780 unsigned int len;
781
782 memcell_buf = (unsigned int *)get_property(memory, "reg", &len);
783 if (!memcell_buf || len <= 0)
784 continue;
785
cc5d0189
BH
786 /* ranges in cell */
787 ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells);
237a0989
MK
788ha_new_range:
789 start = read_n_cells(n_mem_addr_cells, &memcell_buf);
790 size = read_n_cells(n_mem_size_cells, &memcell_buf);
cf950b7a 791 nid = of_node_to_nid(memory);
237a0989
MK
792
793 /* Domains not present at boot default to 0 */
cf950b7a
NL
794 if (!node_online(nid))
795 nid = any_online_node(NODE_MASK_ALL);
237a0989
MK
796
797 if ((scn_addr >= start) && (scn_addr < (start + size))) {
798 of_node_put(memory);
cf950b7a 799 goto got_nid;
237a0989
MK
800 }
801
802 if (--ranges) /* process all ranges in cell */
803 goto ha_new_range;
804 }
237a0989 805 BUG(); /* section address should be found above */
b226e462
MK
806
807 /* Temporary code to ensure that returned node is not empty */
cf950b7a 808got_nid:
b226e462 809 nodes_setall(nodes);
cf950b7a
NL
810 while (NODE_DATA(nid)->node_spanned_pages == 0) {
811 node_clear(nid, nodes);
812 nid = any_online_node(nodes);
b226e462 813 }
cf950b7a 814 return nid;
237a0989
MK
815}
816#endif /* CONFIG_MEMORY_HOTPLUG */