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