blob: 40c99deb691b4202b3be43bcd34d11f59da1d6c6 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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>
Anton Blanchard45fb6ce2005-11-11 14:22:35 +110020#include <asm/sparsemem.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <asm/lmb.h>
Paul Mackerrascf00a8d2005-10-31 13:07:02 +110022#include <asm/system.h>
Paul Mackerras2249ca92005-11-07 13:18:13 +110023#include <asm/smp.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024
25static int numa_enabled = 1;
26
27static int numa_debug;
28#define dbg(args...) if (numa_debug) { printk(KERN_INFO args); }
29
Anton Blanchard45fb6ce2005-11-11 14:22:35 +110030int numa_cpu_lookup_table[NR_CPUS];
Linus Torvalds1da177e2005-04-16 15:20:36 -070031cpumask_t numa_cpumask_lookup_table[MAX_NUMNODES];
Linus Torvalds1da177e2005-04-16 15:20:36 -070032struct pglist_data *node_data[MAX_NUMNODES];
Anton Blanchard45fb6ce2005-11-11 14:22:35 +110033
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];
Linus Torvalds1da177e2005-04-16 15:20:36 -070039static int min_common_depth;
Mike Kravetz237a0982005-12-05 12:06:42 -080040static int n_mem_addr_cells, n_mem_size_cells;
Linus Torvalds1da177e2005-04-16 15:20:36 -070041
42/*
Anton Blanchard45fb6ce2005-11-11 14:22:35 +110043 * We need somewhere to store start/end/node for each region until we have
Linus Torvalds1da177e2005-04-16 15:20:36 -070044 * allocated the real node_data structures.
45 */
Anton Blanchard45fb6ce2005-11-11 14:22:35 +110046#define MAX_REGIONS (MAX_LMB_REGIONS*2)
Linus Torvalds1da177e2005-04-16 15:20:36 -070047static struct {
Anton Blanchard45fb6ce2005-11-11 14:22:35 +110048 unsigned long start_pfn;
49 unsigned long end_pfn;
50 int nid;
51} init_node_data[MAX_REGIONS] __initdata;
Linus Torvalds1da177e2005-04-16 15:20:36 -070052
Anton Blanchard45fb6ce2005-11-11 14:22:35 +110053int __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)
Mike Kravetz6d91bb92005-12-07 13:07:23 -0800129 *start_pfn = 0;
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100130}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131
132static inline void map_cpu_to_node(int cpu, int node)
133{
134 numa_cpu_lookup_table[cpu] = node;
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100135
136 if (!(cpu_isset(cpu, numa_cpumask_lookup_table[node])))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137 cpu_set(cpu, numa_cpumask_lookup_table[node]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138}
139
140#ifdef CONFIG_HOTPLUG_CPU
141static void unmap_cpu_from_node(unsigned long cpu)
142{
143 int node = numa_cpu_lookup_table[cpu];
144
145 dbg("removing cpu %lu from node %d\n", cpu, node);
146
147 if (cpu_isset(cpu, numa_cpumask_lookup_table[node])) {
148 cpu_clear(cpu, numa_cpumask_lookup_table[node]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149 } else {
150 printk(KERN_ERR "WARNING: cpu %lu not found in node %d\n",
151 cpu, node);
152 }
153}
154#endif /* CONFIG_HOTPLUG_CPU */
155
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100156static struct device_node *find_cpu_node(unsigned int cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157{
158 unsigned int hw_cpuid = get_hard_smp_processor_id(cpu);
159 struct device_node *cpu_node = NULL;
160 unsigned int *interrupt_server, *reg;
161 int len;
162
163 while ((cpu_node = of_find_node_by_type(cpu_node, "cpu")) != NULL) {
164 /* Try interrupt server first */
165 interrupt_server = (unsigned int *)get_property(cpu_node,
166 "ibm,ppc-interrupt-server#s", &len);
167
168 len = len / sizeof(u32);
169
170 if (interrupt_server && (len > 0)) {
171 while (len--) {
172 if (interrupt_server[len] == hw_cpuid)
173 return cpu_node;
174 }
175 } else {
176 reg = (unsigned int *)get_property(cpu_node,
177 "reg", &len);
178 if (reg && (len > 0) && (reg[0] == hw_cpuid))
179 return cpu_node;
180 }
181 }
182
183 return NULL;
184}
185
186/* must hold reference to node during call */
187static int *of_get_associativity(struct device_node *dev)
188{
189 return (unsigned int *)get_property(dev, "ibm,associativity", NULL);
190}
191
192static int of_node_numa_domain(struct device_node *device)
193{
194 int numa_domain;
195 unsigned int *tmp;
196
197 if (min_common_depth == -1)
198 return 0;
199
200 tmp = of_get_associativity(device);
201 if (tmp && (tmp[0] >= min_common_depth)) {
202 numa_domain = tmp[min_common_depth];
203 } else {
204 dbg("WARNING: no NUMA information for %s\n",
205 device->full_name);
206 numa_domain = 0;
207 }
208 return numa_domain;
209}
210
211/*
212 * In theory, the "ibm,associativity" property may contain multiple
213 * associativity lists because a resource may be multiply connected
214 * into the machine. This resource then has different associativity
215 * characteristics relative to its multiple connections. We ignore
216 * this for now. We also assume that all cpu and memory sets have
217 * their distances represented at a common level. This won't be
218 * true for heirarchical NUMA.
219 *
220 * In any case the ibm,associativity-reference-points should give
221 * the correct depth for a normal NUMA system.
222 *
223 * - Dave Hansen <haveblue@us.ibm.com>
224 */
225static int __init find_min_common_depth(void)
226{
227 int depth;
228 unsigned int *ref_points;
229 struct device_node *rtas_root;
230 unsigned int len;
231
232 rtas_root = of_find_node_by_path("/rtas");
233
234 if (!rtas_root)
235 return -1;
236
237 /*
238 * this property is 2 32-bit integers, each representing a level of
239 * depth in the associativity nodes. The first is for an SMP
240 * configuration (should be all 0's) and the second is for a normal
241 * NUMA configuration.
242 */
243 ref_points = (unsigned int *)get_property(rtas_root,
244 "ibm,associativity-reference-points", &len);
245
246 if ((len >= 1) && ref_points) {
247 depth = ref_points[1];
248 } else {
249 dbg("WARNING: could not find NUMA "
250 "associativity reference point\n");
251 depth = -1;
252 }
253 of_node_put(rtas_root);
254
255 return depth;
256}
257
Mike Kravetz84c9fdd2005-11-30 13:47:23 -0800258static void __init get_n_mem_cells(int *n_addr_cells, int *n_size_cells)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259{
260 struct device_node *memory = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261
262 memory = of_find_node_by_type(memory, "memory");
Paul Mackerras54c23312005-12-05 15:50:39 +1100263 if (!memory)
Mike Kravetz84c9fdd2005-11-30 13:47:23 -0800264 panic("numa.c: No memory nodes found!");
Paul Mackerras54c23312005-12-05 15:50:39 +1100265
Mike Kravetz84c9fdd2005-11-30 13:47:23 -0800266 *n_addr_cells = prom_n_addr_cells(memory);
267 *n_size_cells = prom_n_size_cells(memory);
268 of_node_put(memory);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269}
270
Mike Kravetz237a0982005-12-05 12:06:42 -0800271static unsigned long __devinit read_n_cells(int n, unsigned int **buf)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272{
273 unsigned long result = 0;
274
275 while (n--) {
276 result = (result << 32) | **buf;
277 (*buf)++;
278 }
279 return result;
280}
281
282/*
283 * Figure out to which domain a cpu belongs and stick it there.
284 * Return the id of the domain used.
285 */
286static int numa_setup_cpu(unsigned long lcpu)
287{
288 int numa_domain = 0;
289 struct device_node *cpu = find_cpu_node(lcpu);
290
291 if (!cpu) {
292 WARN_ON(1);
293 goto out;
294 }
295
296 numa_domain = of_node_numa_domain(cpu);
297
298 if (numa_domain >= num_online_nodes()) {
299 /*
300 * POWER4 LPAR uses 0xffff as invalid node,
301 * dont warn in this case.
302 */
303 if (numa_domain != 0xffff)
304 printk(KERN_ERR "WARNING: cpu %ld "
305 "maps to invalid NUMA node %d\n",
306 lcpu, numa_domain);
307 numa_domain = 0;
308 }
309out:
310 node_set_online(numa_domain);
311
312 map_cpu_to_node(lcpu, numa_domain);
313
314 of_node_put(cpu);
315
316 return numa_domain;
317}
318
319static int cpu_numa_callback(struct notifier_block *nfb,
320 unsigned long action,
321 void *hcpu)
322{
323 unsigned long lcpu = (unsigned long)hcpu;
324 int ret = NOTIFY_DONE;
325
326 switch (action) {
327 case CPU_UP_PREPARE:
328 if (min_common_depth == -1 || !numa_enabled)
329 map_cpu_to_node(lcpu, 0);
330 else
331 numa_setup_cpu(lcpu);
332 ret = NOTIFY_OK;
333 break;
334#ifdef CONFIG_HOTPLUG_CPU
335 case CPU_DEAD:
336 case CPU_UP_CANCELED:
337 unmap_cpu_from_node(lcpu);
338 break;
339 ret = NOTIFY_OK;
340#endif
341 }
342 return ret;
343}
344
345/*
346 * Check and possibly modify a memory region to enforce the memory limit.
347 *
348 * Returns the size the region should have to enforce the memory limit.
349 * This will either be the original value of size, a truncated value,
350 * or zero. If the returned value of size is 0 the region should be
351 * discarded as it lies wholy above the memory limit.
352 */
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100353static unsigned long __init numa_enforce_memory_limit(unsigned long start,
354 unsigned long size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355{
356 /*
357 * We use lmb_end_of_DRAM() in here instead of memory_limit because
358 * we've already adjusted it for the limit and it takes care of
359 * having memory holes below the limit.
360 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361
362 if (! memory_limit)
363 return size;
364
365 if (start + size <= lmb_end_of_DRAM())
366 return size;
367
368 if (start >= lmb_end_of_DRAM())
369 return 0;
370
371 return lmb_end_of_DRAM() - start;
372}
373
374static int __init parse_numa_properties(void)
375{
376 struct device_node *cpu = NULL;
377 struct device_node *memory = NULL;
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100378 int max_domain;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379 unsigned long i;
380
381 if (numa_enabled == 0) {
382 printk(KERN_WARNING "NUMA disabled by user\n");
383 return -1;
384 }
385
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386 min_common_depth = find_min_common_depth();
387
388 dbg("NUMA associativity depth for CPU/Memory: %d\n", min_common_depth);
389 if (min_common_depth < 0)
390 return min_common_depth;
391
392 max_domain = numa_setup_cpu(boot_cpuid);
393
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) {
402 int numa_domain;
403
404 cpu = find_cpu_node(i);
405
406 if (cpu) {
407 numa_domain = of_node_numa_domain(cpu);
408 of_node_put(cpu);
409
410 if (numa_domain < MAX_NUMNODES &&
411 max_domain < numa_domain)
412 max_domain = numa_domain;
413 }
414 }
415
Mike Kravetz237a0982005-12-05 12:06:42 -0800416 get_n_mem_cells(&n_mem_addr_cells, &n_mem_size_cells);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417 memory = NULL;
418 while ((memory = of_find_node_by_type(memory, "memory")) != NULL) {
419 unsigned long start;
420 unsigned long size;
421 int numa_domain;
422 int ranges;
423 unsigned int *memcell_buf;
424 unsigned int len;
425
426 memcell_buf = (unsigned int *)get_property(memory, "reg", &len);
427 if (!memcell_buf || len <= 0)
428 continue;
429
430 ranges = memory->n_addrs;
431new_range:
432 /* these are order-sensitive, and modify the buffer pointer */
Mike Kravetz237a0982005-12-05 12:06:42 -0800433 start = read_n_cells(n_mem_addr_cells, &memcell_buf);
434 size = read_n_cells(n_mem_size_cells, &memcell_buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436 numa_domain = of_node_numa_domain(memory);
437
438 if (numa_domain >= MAX_NUMNODES) {
439 if (numa_domain != 0xffff)
440 printk(KERN_ERR "WARNING: memory at %lx maps "
441 "to invalid NUMA node %d\n", start,
442 numa_domain);
443 numa_domain = 0;
444 }
445
446 if (max_domain < numa_domain)
447 max_domain = numa_domain;
448
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100449 if (!(size = numa_enforce_memory_limit(start, size))) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450 if (--ranges)
451 goto new_range;
452 else
453 continue;
454 }
455
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100456 add_region(numa_domain, start >> PAGE_SHIFT,
457 size >> PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458
459 if (--ranges)
460 goto new_range;
461 }
462
463 for (i = 0; i <= max_domain; i++)
464 node_set_online(i);
465
466 return 0;
467}
468
469static void __init setup_nonnuma(void)
470{
471 unsigned long top_of_ram = lmb_end_of_DRAM();
472 unsigned long total_ram = lmb_phys_mem_size();
Paul Mackerrasfb6d73d2005-11-16 11:43:26 +1100473 unsigned int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474
475 printk(KERN_INFO "Top of RAM: 0x%lx, Total RAM: 0x%lx\n",
476 top_of_ram, total_ram);
477 printk(KERN_INFO "Memory hole size: %ldMB\n",
478 (top_of_ram - total_ram) >> 20);
479
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480 map_cpu_to_node(boot_cpuid, 0);
Paul Mackerrasfb6d73d2005-11-16 11:43:26 +1100481 for (i = 0; i < lmb.memory.cnt; ++i)
482 add_region(0, lmb.memory.region[i].base >> PAGE_SHIFT,
483 lmb_size_pages(&lmb.memory, i));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484 node_set_online(0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700485}
486
487static void __init dump_numa_topology(void)
488{
489 unsigned int node;
490 unsigned int count;
491
492 if (min_common_depth == -1 || !numa_enabled)
493 return;
494
495 for_each_online_node(node) {
496 unsigned long i;
497
498 printk(KERN_INFO "Node %d Memory:", node);
499
500 count = 0;
501
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100502 for (i = 0; i < lmb_end_of_DRAM();
503 i += (1 << SECTION_SIZE_BITS)) {
504 if (early_pfn_to_nid(i >> PAGE_SHIFT) == node) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505 if (count == 0)
506 printk(" 0x%lx", i);
507 ++count;
508 } else {
509 if (count > 0)
510 printk("-0x%lx", i);
511 count = 0;
512 }
513 }
514
515 if (count > 0)
516 printk("-0x%lx", i);
517 printk("\n");
518 }
519 return;
520}
521
522/*
523 * Allocate some memory, satisfying the lmb or bootmem allocator where
524 * required. nid is the preferred node and end is the physical address of
525 * the highest address in the node.
526 *
527 * Returns the physical address of the memory.
528 */
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100529static void __init *careful_allocation(int nid, unsigned long size,
530 unsigned long align,
531 unsigned long end_pfn)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532{
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100533 int new_nid;
534 unsigned long ret = lmb_alloc_base(size, align, end_pfn << PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700535
536 /* retry over all memory */
537 if (!ret)
538 ret = lmb_alloc_base(size, align, lmb_end_of_DRAM());
539
540 if (!ret)
541 panic("numa.c: cannot allocate %lu bytes on node %d",
542 size, nid);
543
544 /*
545 * If the memory came from a previously allocated node, we must
546 * retry with the bootmem allocator.
547 */
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100548 new_nid = early_pfn_to_nid(ret >> PAGE_SHIFT);
549 if (new_nid < nid) {
550 ret = (unsigned long)__alloc_bootmem_node(NODE_DATA(new_nid),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700551 size, align, 0);
552
553 if (!ret)
554 panic("numa.c: cannot allocate %lu bytes on node %d",
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100555 size, new_nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700556
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100557 ret = __pa(ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700558
559 dbg("alloc_bootmem %lx %lx\n", ret, size);
560 }
561
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100562 return (void *)ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563}
564
565void __init do_init_bootmem(void)
566{
567 int nid;
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100568 unsigned int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569 static struct notifier_block ppc64_numa_nb = {
570 .notifier_call = cpu_numa_callback,
571 .priority = 1 /* Must run before sched domains notifier. */
572 };
573
574 min_low_pfn = 0;
575 max_low_pfn = lmb_end_of_DRAM() >> PAGE_SHIFT;
576 max_pfn = max_low_pfn;
577
578 if (parse_numa_properties())
579 setup_nonnuma();
580 else
581 dump_numa_topology();
582
583 register_cpu_notifier(&ppc64_numa_nb);
584
585 for_each_online_node(nid) {
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100586 unsigned long start_pfn, end_pfn, pages_present;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587 unsigned long bootmem_paddr;
588 unsigned long bootmap_pages;
589
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100590 get_region(nid, &start_pfn, &end_pfn, &pages_present);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591
592 /* Allocate the node structure node local if possible */
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100593 NODE_DATA(nid) = careful_allocation(nid,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594 sizeof(struct pglist_data),
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100595 SMP_CACHE_BYTES, end_pfn);
596 NODE_DATA(nid) = __va(NODE_DATA(nid));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700597 memset(NODE_DATA(nid), 0, sizeof(struct pglist_data));
598
599 dbg("node %d\n", nid);
600 dbg("NODE_DATA() = %p\n", NODE_DATA(nid));
601
602 NODE_DATA(nid)->bdata = &plat_node_bdata[nid];
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100603 NODE_DATA(nid)->node_start_pfn = start_pfn;
604 NODE_DATA(nid)->node_spanned_pages = end_pfn - start_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605
606 if (NODE_DATA(nid)->node_spanned_pages == 0)
607 continue;
608
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100609 dbg("start_paddr = %lx\n", start_pfn << PAGE_SHIFT);
610 dbg("end_paddr = %lx\n", end_pfn << PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100612 bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
613 bootmem_paddr = (unsigned long)careful_allocation(nid,
614 bootmap_pages << PAGE_SHIFT,
615 PAGE_SIZE, end_pfn);
616 memset(__va(bootmem_paddr), 0, bootmap_pages << PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700617
Linus Torvalds1da177e2005-04-16 15:20:36 -0700618 dbg("bootmap_paddr = %lx\n", bootmem_paddr);
619
620 init_bootmem_node(NODE_DATA(nid), bootmem_paddr >> PAGE_SHIFT,
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100621 start_pfn, end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700622
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100623 /* Add free regions on this node */
624 for (i = 0; init_node_data[i].end_pfn; i++) {
625 unsigned long start, end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700626
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100627 if (init_node_data[i].nid != nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700628 continue;
629
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100630 start = init_node_data[i].start_pfn << PAGE_SHIFT;
631 end = init_node_data[i].end_pfn << PAGE_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100633 dbg("free_bootmem %lx %lx\n", start, end - start);
634 free_bootmem_node(NODE_DATA(nid), start, end - start);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700635 }
636
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100637 /* Mark reserved regions on this node */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700638 for (i = 0; i < lmb.reserved.cnt; i++) {
Michael Ellerman180379d2005-08-03 20:21:26 +1000639 unsigned long physbase = lmb.reserved.region[i].base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640 unsigned long size = lmb.reserved.region[i].size;
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100641 unsigned long start_paddr = start_pfn << PAGE_SHIFT;
642 unsigned long end_paddr = end_pfn << PAGE_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100644 if (early_pfn_to_nid(physbase >> PAGE_SHIFT) != nid &&
645 early_pfn_to_nid((physbase+size-1) >> PAGE_SHIFT) != nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646 continue;
647
648 if (physbase < end_paddr &&
649 (physbase+size) > start_paddr) {
650 /* overlaps */
651 if (physbase < start_paddr) {
652 size -= start_paddr - physbase;
653 physbase = start_paddr;
654 }
655
656 if (size > end_paddr - physbase)
657 size = end_paddr - physbase;
658
659 dbg("reserve_bootmem %lx %lx\n", physbase,
660 size);
661 reserve_bootmem_node(NODE_DATA(nid), physbase,
662 size);
663 }
664 }
Bob Picco802f1922005-09-03 15:54:26 -0700665
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100666 /* Add regions into sparsemem */
667 for (i = 0; init_node_data[i].end_pfn; i++) {
668 unsigned long start, end;
669
670 if (init_node_data[i].nid != nid)
Bob Picco802f1922005-09-03 15:54:26 -0700671 continue;
672
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100673 start = init_node_data[i].start_pfn;
674 end = init_node_data[i].end_pfn;
Bob Picco802f1922005-09-03 15:54:26 -0700675
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100676 memory_present(nid, start, end);
Bob Picco802f1922005-09-03 15:54:26 -0700677 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700678 }
679}
680
681void __init paging_init(void)
682{
683 unsigned long zones_size[MAX_NR_ZONES];
684 unsigned long zholes_size[MAX_NR_ZONES];
685 int nid;
686
687 memset(zones_size, 0, sizeof(zones_size));
688 memset(zholes_size, 0, sizeof(zholes_size));
689
690 for_each_online_node(nid) {
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100691 unsigned long start_pfn, end_pfn, pages_present;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700692
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100693 get_region(nid, &start_pfn, &end_pfn, &pages_present);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700694
695 zones_size[ZONE_DMA] = end_pfn - start_pfn;
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100696 zholes_size[ZONE_DMA] = zones_size[ZONE_DMA] - pages_present;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700697
698 dbg("free_area_init node %d %lx %lx (hole: %lx)\n", nid,
699 zones_size[ZONE_DMA], start_pfn, zholes_size[ZONE_DMA]);
700
Anton Blanchard45fb6ce2005-11-11 14:22:35 +1100701 free_area_init_node(nid, NODE_DATA(nid), zones_size, start_pfn,
702 zholes_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700703 }
704}
705
706static int __init early_numa(char *p)
707{
708 if (!p)
709 return 0;
710
711 if (strstr(p, "off"))
712 numa_enabled = 0;
713
714 if (strstr(p, "debug"))
715 numa_debug = 1;
716
717 return 0;
718}
719early_param("numa", early_numa);
Mike Kravetz237a0982005-12-05 12:06:42 -0800720
721#ifdef CONFIG_MEMORY_HOTPLUG
722/*
723 * Find the node associated with a hot added memory section. Section
724 * corresponds to a SPARSEMEM section, not an LMB. It is assumed that
725 * sections are fully contained within a single LMB.
726 */
727int hot_add_scn_to_nid(unsigned long scn_addr)
728{
729 struct device_node *memory = NULL;
730
731 if (!numa_enabled || (min_common_depth < 0))
732 return 0;
733
734 while ((memory = of_find_node_by_type(memory, "memory")) != NULL) {
735 unsigned long start, size;
736 int numa_domain, ranges;
737 unsigned int *memcell_buf;
738 unsigned int len;
739
740 memcell_buf = (unsigned int *)get_property(memory, "reg", &len);
741 if (!memcell_buf || len <= 0)
742 continue;
743
744 ranges = memory->n_addrs; /* ranges in cell */
745ha_new_range:
746 start = read_n_cells(n_mem_addr_cells, &memcell_buf);
747 size = read_n_cells(n_mem_size_cells, &memcell_buf);
748 numa_domain = of_node_numa_domain(memory);
749
750 /* Domains not present at boot default to 0 */
751 if (!node_online(numa_domain))
752 numa_domain = any_online_node(NODE_MASK_ALL);
753
754 if ((scn_addr >= start) && (scn_addr < (start + size))) {
755 of_node_put(memory);
756 return numa_domain;
757 }
758
759 if (--ranges) /* process all ranges in cell */
760 goto ha_new_range;
761 }
762
763 BUG(); /* section address should be found above */
764 return 0;
765}
766#endif /* CONFIG_MEMORY_HOTPLUG */