numa.c 19.6 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
/*
 * pSeries NUMA support
 *
 * Copyright (C) 2002 Anton Blanchard <anton@au.ibm.com>, IBM
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 */
#include <linux/threads.h>
#include <linux/bootmem.h>
#include <linux/init.h>
#include <linux/mm.h>
#include <linux/mmzone.h>
#include <linux/module.h>
#include <linux/nodemask.h>
#include <linux/cpu.h>
#include <linux/notifier.h>
20
#include <asm/sparsemem.h>
L
Linus Torvalds 已提交
21
#include <asm/lmb.h>
22
#include <asm/system.h>
P
Paul Mackerras 已提交
23
#include <asm/smp.h>
L
Linus Torvalds 已提交
24 25 26 27 28 29

static int numa_enabled = 1;

static int numa_debug;
#define dbg(args...) if (numa_debug) { printk(KERN_INFO args); }

30
int numa_cpu_lookup_table[NR_CPUS];
L
Linus Torvalds 已提交
31 32
cpumask_t numa_cpumask_lookup_table[MAX_NUMNODES];
struct pglist_data *node_data[MAX_NUMNODES];
33 34 35 36 37 38

EXPORT_SYMBOL(numa_cpu_lookup_table);
EXPORT_SYMBOL(numa_cpumask_lookup_table);
EXPORT_SYMBOL(node_data);

static bootmem_data_t __initdata plat_node_bdata[MAX_NUMNODES];
L
Linus Torvalds 已提交
39
static int min_common_depth;
40
static int n_mem_addr_cells, n_mem_size_cells;
L
Linus Torvalds 已提交
41 42

/*
43
 * We need somewhere to store start/end/node for each region until we have
L
Linus Torvalds 已提交
44 45
 * allocated the real node_data structures.
 */
46
#define MAX_REGIONS	(MAX_LMB_REGIONS*2)
L
Linus Torvalds 已提交
47
static struct {
48 49 50 51
	unsigned long start_pfn;
	unsigned long end_pfn;
	int nid;
} init_node_data[MAX_REGIONS] __initdata;
L
Linus Torvalds 已提交
52

53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128
int __init early_pfn_to_nid(unsigned long pfn)
{
	unsigned int i;

	for (i = 0; init_node_data[i].end_pfn; i++) {
		unsigned long start_pfn = init_node_data[i].start_pfn;
		unsigned long end_pfn = init_node_data[i].end_pfn;

		if ((start_pfn <= pfn) && (pfn < end_pfn))
			return init_node_data[i].nid;
	}

	return -1;
}

void __init add_region(unsigned int nid, unsigned long start_pfn,
		       unsigned long pages)
{
	unsigned int i;

	dbg("add_region nid %d start_pfn 0x%lx pages 0x%lx\n",
		nid, start_pfn, pages);

	for (i = 0; init_node_data[i].end_pfn; i++) {
		if (init_node_data[i].nid != nid)
			continue;
		if (init_node_data[i].end_pfn == start_pfn) {
			init_node_data[i].end_pfn += pages;
			return;
		}
		if (init_node_data[i].start_pfn == (start_pfn + pages)) {
			init_node_data[i].start_pfn -= pages;
			return;
		}
	}

	/*
	 * Leave last entry NULL so we dont iterate off the end (we use
	 * entry.end_pfn to terminate the walk).
	 */
	if (i >= (MAX_REGIONS - 1)) {
		printk(KERN_ERR "WARNING: too many memory regions in "
				"numa code, truncating\n");
		return;
	}

	init_node_data[i].start_pfn = start_pfn;
	init_node_data[i].end_pfn = start_pfn + pages;
	init_node_data[i].nid = nid;
}

/* We assume init_node_data has no overlapping regions */
void __init get_region(unsigned int nid, unsigned long *start_pfn,
		       unsigned long *end_pfn, unsigned long *pages_present)
{
	unsigned int i;

	*start_pfn = -1UL;
	*end_pfn = *pages_present = 0;

	for (i = 0; init_node_data[i].end_pfn; i++) {
		if (init_node_data[i].nid != nid)
			continue;

		*pages_present += init_node_data[i].end_pfn -
			init_node_data[i].start_pfn;

		if (init_node_data[i].start_pfn < *start_pfn)
			*start_pfn = init_node_data[i].start_pfn;

		if (init_node_data[i].end_pfn > *end_pfn)
			*end_pfn = init_node_data[i].end_pfn;
	}

	/* We didnt find a matching region, return start/end as 0 */
	if (*start_pfn == -1UL)
129
		*start_pfn = 0;
130
}
L
Linus Torvalds 已提交
131

132
static void __cpuinit map_cpu_to_node(int cpu, int node)
L
Linus Torvalds 已提交
133 134
{
	numa_cpu_lookup_table[cpu] = node;
135

136 137
	dbg("adding cpu %d to node %d\n", cpu, node);

138
	if (!(cpu_isset(cpu, numa_cpumask_lookup_table[node])))
L
Linus Torvalds 已提交
139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157
		cpu_set(cpu, numa_cpumask_lookup_table[node]);
}

#ifdef CONFIG_HOTPLUG_CPU
static void unmap_cpu_from_node(unsigned long cpu)
{
	int node = numa_cpu_lookup_table[cpu];

	dbg("removing cpu %lu from node %d\n", cpu, node);

	if (cpu_isset(cpu, numa_cpumask_lookup_table[node])) {
		cpu_clear(cpu, numa_cpumask_lookup_table[node]);
	} else {
		printk(KERN_ERR "WARNING: cpu %lu not found in node %d\n",
		       cpu, node);
	}
}
#endif /* CONFIG_HOTPLUG_CPU */

158
static struct device_node * __cpuinit find_cpu_node(unsigned int cpu)
L
Linus Torvalds 已提交
159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193
{
	unsigned int hw_cpuid = get_hard_smp_processor_id(cpu);
	struct device_node *cpu_node = NULL;
	unsigned int *interrupt_server, *reg;
	int len;

	while ((cpu_node = of_find_node_by_type(cpu_node, "cpu")) != NULL) {
		/* Try interrupt server first */
		interrupt_server = (unsigned int *)get_property(cpu_node,
					"ibm,ppc-interrupt-server#s", &len);

		len = len / sizeof(u32);

		if (interrupt_server && (len > 0)) {
			while (len--) {
				if (interrupt_server[len] == hw_cpuid)
					return cpu_node;
			}
		} else {
			reg = (unsigned int *)get_property(cpu_node,
							   "reg", &len);
			if (reg && (len > 0) && (reg[0] == hw_cpuid))
				return cpu_node;
		}
	}

	return NULL;
}

/* must hold reference to node during call */
static int *of_get_associativity(struct device_node *dev)
{
	return (unsigned int *)get_property(dev, "ibm,associativity", NULL);
}

194
static int of_node_to_nid(struct device_node *device)
L
Linus Torvalds 已提交
195
{
196
	int nid;
L
Linus Torvalds 已提交
197 198 199 200 201 202 203
	unsigned int *tmp;

	if (min_common_depth == -1)
		return 0;

	tmp = of_get_associativity(device);
	if (tmp && (tmp[0] >= min_common_depth)) {
204
		nid = tmp[min_common_depth];
L
Linus Torvalds 已提交
205 206 207
	} else {
		dbg("WARNING: no NUMA information for %s\n",
		    device->full_name);
208
		nid = 0;
L
Linus Torvalds 已提交
209
	}
210
	return nid;
L
Linus Torvalds 已提交
211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250
}

/*
 * In theory, the "ibm,associativity" property may contain multiple
 * associativity lists because a resource may be multiply connected
 * into the machine.  This resource then has different associativity
 * characteristics relative to its multiple connections.  We ignore
 * this for now.  We also assume that all cpu and memory sets have
 * their distances represented at a common level.  This won't be
 * true for heirarchical NUMA.
 *
 * In any case the ibm,associativity-reference-points should give
 * the correct depth for a normal NUMA system.
 *
 * - Dave Hansen <haveblue@us.ibm.com>
 */
static int __init find_min_common_depth(void)
{
	int depth;
	unsigned int *ref_points;
	struct device_node *rtas_root;
	unsigned int len;

	rtas_root = of_find_node_by_path("/rtas");

	if (!rtas_root)
		return -1;

	/*
	 * this property is 2 32-bit integers, each representing a level of
	 * depth in the associativity nodes.  The first is for an SMP
	 * configuration (should be all 0's) and the second is for a normal
	 * NUMA configuration.
	 */
	ref_points = (unsigned int *)get_property(rtas_root,
			"ibm,associativity-reference-points", &len);

	if ((len >= 1) && ref_points) {
		depth = ref_points[1];
	} else {
251
		dbg("NUMA: ibm,associativity-reference-points not found.\n");
L
Linus Torvalds 已提交
252 253 254 255 256 257 258
		depth = -1;
	}
	of_node_put(rtas_root);

	return depth;
}

259
static void __init get_n_mem_cells(int *n_addr_cells, int *n_size_cells)
L
Linus Torvalds 已提交
260 261 262 263
{
	struct device_node *memory = NULL;

	memory = of_find_node_by_type(memory, "memory");
264
	if (!memory)
265
		panic("numa.c: No memory nodes found!");
266

267 268 269
	*n_addr_cells = prom_n_addr_cells(memory);
	*n_size_cells = prom_n_size_cells(memory);
	of_node_put(memory);
L
Linus Torvalds 已提交
270 271
}

272
static unsigned long __devinit read_n_cells(int n, unsigned int **buf)
L
Linus Torvalds 已提交
273 274 275 276 277 278 279 280 281 282 283 284 285 286
{
	unsigned long result = 0;

	while (n--) {
		result = (result << 32) | **buf;
		(*buf)++;
	}
	return result;
}

/*
 * Figure out to which domain a cpu belongs and stick it there.
 * Return the id of the domain used.
 */
287
static int __cpuinit numa_setup_cpu(unsigned long lcpu)
L
Linus Torvalds 已提交
288
{
289
	int nid = 0;
L
Linus Torvalds 已提交
290 291 292 293 294 295 296
	struct device_node *cpu = find_cpu_node(lcpu);

	if (!cpu) {
		WARN_ON(1);
		goto out;
	}

297
	nid = of_node_to_nid(cpu);
L
Linus Torvalds 已提交
298

299
	if (nid >= num_online_nodes()) {
L
Linus Torvalds 已提交
300 301 302 303
		/*
		 * POWER4 LPAR uses 0xffff as invalid node,
		 * dont warn in this case.
		 */
304
		if (nid != 0xffff)
L
Linus Torvalds 已提交
305 306
			printk(KERN_ERR "WARNING: cpu %ld "
			       "maps to invalid NUMA node %d\n",
307 308
			       lcpu, nid);
		nid = 0;
L
Linus Torvalds 已提交
309 310
	}
out:
311
	node_set_online(nid);
L
Linus Torvalds 已提交
312

313
	map_cpu_to_node(lcpu, nid);
L
Linus Torvalds 已提交
314 315 316

	of_node_put(cpu);

317
	return nid;
L
Linus Torvalds 已提交
318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353
}

static int cpu_numa_callback(struct notifier_block *nfb,
			     unsigned long action,
			     void *hcpu)
{
	unsigned long lcpu = (unsigned long)hcpu;
	int ret = NOTIFY_DONE;

	switch (action) {
	case CPU_UP_PREPARE:
		if (min_common_depth == -1 || !numa_enabled)
			map_cpu_to_node(lcpu, 0);
		else
			numa_setup_cpu(lcpu);
		ret = NOTIFY_OK;
		break;
#ifdef CONFIG_HOTPLUG_CPU
	case CPU_DEAD:
	case CPU_UP_CANCELED:
		unmap_cpu_from_node(lcpu);
		break;
		ret = NOTIFY_OK;
#endif
	}
	return ret;
}

/*
 * Check and possibly modify a memory region to enforce the memory limit.
 *
 * Returns the size the region should have to enforce the memory limit.
 * This will either be the original value of size, a truncated value,
 * or zero. If the returned value of size is 0 the region should be
 * discarded as it lies wholy above the memory limit.
 */
354 355
static unsigned long __init numa_enforce_memory_limit(unsigned long start,
						      unsigned long size)
L
Linus Torvalds 已提交
356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378
{
	/*
	 * We use lmb_end_of_DRAM() in here instead of memory_limit because
	 * we've already adjusted it for the limit and it takes care of
	 * having memory holes below the limit.
	 */

	if (! memory_limit)
		return size;

	if (start + size <= lmb_end_of_DRAM())
		return size;

	if (start >= lmb_end_of_DRAM())
		return 0;

	return lmb_end_of_DRAM() - start;
}

static int __init parse_numa_properties(void)
{
	struct device_node *cpu = NULL;
	struct device_node *memory = NULL;
379
	int max_domain = 0;
L
Linus Torvalds 已提交
380 381 382 383 384 385 386 387 388 389 390 391
	unsigned long i;

	if (numa_enabled == 0) {
		printk(KERN_WARNING "NUMA disabled by user\n");
		return -1;
	}

	min_common_depth = find_min_common_depth();

	if (min_common_depth < 0)
		return min_common_depth;

392 393
	dbg("NUMA associativity depth for CPU/Memory: %d\n", min_common_depth);

L
Linus Torvalds 已提交
394 395 396 397 398 399 400 401
	/*
	 * Even though we connect cpus to numa domains later in SMP init,
	 * we need to know the maximum node id now. This is because each
	 * node id must have NODE_DATA etc backing it.
	 * As a result of hotplug we could still have cpus appear later on
	 * with larger node ids. In that case we force the cpu into node 0.
	 */
	for_each_cpu(i) {
402
		int nid;
L
Linus Torvalds 已提交
403 404 405 406

		cpu = find_cpu_node(i);

		if (cpu) {
407
			nid = of_node_to_nid(cpu);
L
Linus Torvalds 已提交
408 409
			of_node_put(cpu);

410 411 412
			if (nid < MAX_NUMNODES &&
			    max_domain < nid)
				max_domain = nid;
L
Linus Torvalds 已提交
413 414 415
		}
	}

416
	get_n_mem_cells(&n_mem_addr_cells, &n_mem_size_cells);
L
Linus Torvalds 已提交
417 418 419 420
	memory = NULL;
	while ((memory = of_find_node_by_type(memory, "memory")) != NULL) {
		unsigned long start;
		unsigned long size;
421
		int nid;
L
Linus Torvalds 已提交
422 423 424 425
		int ranges;
		unsigned int *memcell_buf;
		unsigned int len;

426 427 428 429 430 431
		memcell_buf = (unsigned int *)get_property(memory,
			"linux,usable-memory", &len);
		if (!memcell_buf || len <= 0)
			memcell_buf =
				(unsigned int *)get_property(memory, "reg",
					&len);
L
Linus Torvalds 已提交
432 433 434
		if (!memcell_buf || len <= 0)
			continue;

435 436
		/* ranges in cell */
		ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells);
L
Linus Torvalds 已提交
437 438
new_range:
		/* these are order-sensitive, and modify the buffer pointer */
439 440
		start = read_n_cells(n_mem_addr_cells, &memcell_buf);
		size = read_n_cells(n_mem_size_cells, &memcell_buf);
L
Linus Torvalds 已提交
441

442
		nid = of_node_to_nid(memory);
L
Linus Torvalds 已提交
443

444 445
		if (nid >= MAX_NUMNODES) {
			if (nid != 0xffff)
L
Linus Torvalds 已提交
446 447
				printk(KERN_ERR "WARNING: memory at %lx maps "
				       "to invalid NUMA node %d\n", start,
448 449
				       nid);
			nid = 0;
L
Linus Torvalds 已提交
450 451
		}

452 453
		if (max_domain < nid)
			max_domain = nid;
L
Linus Torvalds 已提交
454

455
		if (!(size = numa_enforce_memory_limit(start, size))) {
L
Linus Torvalds 已提交
456 457 458 459 460 461
			if (--ranges)
				goto new_range;
			else
				continue;
		}

462
		add_region(nid, start >> PAGE_SHIFT,
463
			   size >> PAGE_SHIFT);
L
Linus Torvalds 已提交
464 465 466 467 468 469 470 471

		if (--ranges)
			goto new_range;
	}

	for (i = 0; i <= max_domain; i++)
		node_set_online(i);

472 473
	max_domain = numa_setup_cpu(boot_cpuid);

L
Linus Torvalds 已提交
474 475 476 477 478 479 480
	return 0;
}

static void __init setup_nonnuma(void)
{
	unsigned long top_of_ram = lmb_end_of_DRAM();
	unsigned long total_ram = lmb_phys_mem_size();
481
	unsigned int i;
L
Linus Torvalds 已提交
482 483 484 485 486 487 488

	printk(KERN_INFO "Top of RAM: 0x%lx, Total RAM: 0x%lx\n",
	       top_of_ram, total_ram);
	printk(KERN_INFO "Memory hole size: %ldMB\n",
	       (top_of_ram - total_ram) >> 20);

	map_cpu_to_node(boot_cpuid, 0);
489 490 491
	for (i = 0; i < lmb.memory.cnt; ++i)
		add_region(0, lmb.memory.region[i].base >> PAGE_SHIFT,
			   lmb_size_pages(&lmb.memory, i));
L
Linus Torvalds 已提交
492 493 494
	node_set_online(0);
}

495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529
void __init dump_numa_cpu_topology(void)
{
	unsigned int node;
	unsigned int cpu, count;

	if (min_common_depth == -1 || !numa_enabled)
		return;

	for_each_online_node(node) {
		printk(KERN_INFO "Node %d CPUs:", node);

		count = 0;
		/*
		 * If we used a CPU iterator here we would miss printing
		 * the holes in the cpumap.
		 */
		for (cpu = 0; cpu < NR_CPUS; cpu++) {
			if (cpu_isset(cpu, numa_cpumask_lookup_table[node])) {
				if (count == 0)
					printk(" %u", cpu);
				++count;
			} else {
				if (count > 1)
					printk("-%u", cpu - 1);
				count = 0;
			}
		}

		if (count > 1)
			printk("-%u", NR_CPUS - 1);
		printk("\n");
	}
}

static void __init dump_numa_memory_topology(void)
L
Linus Torvalds 已提交
530 531 532 533 534 535 536 537 538 539 540 541 542 543
{
	unsigned int node;
	unsigned int count;

	if (min_common_depth == -1 || !numa_enabled)
		return;

	for_each_online_node(node) {
		unsigned long i;

		printk(KERN_INFO "Node %d Memory:", node);

		count = 0;

544 545 546
		for (i = 0; i < lmb_end_of_DRAM();
		     i += (1 << SECTION_SIZE_BITS)) {
			if (early_pfn_to_nid(i >> PAGE_SHIFT) == node) {
L
Linus Torvalds 已提交
547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569
				if (count == 0)
					printk(" 0x%lx", i);
				++count;
			} else {
				if (count > 0)
					printk("-0x%lx", i);
				count = 0;
			}
		}

		if (count > 0)
			printk("-0x%lx", i);
		printk("\n");
	}
}

/*
 * Allocate some memory, satisfying the lmb or bootmem allocator where
 * required. nid is the preferred node and end is the physical address of
 * the highest address in the node.
 *
 * Returns the physical address of the memory.
 */
570 571 572
static void __init *careful_allocation(int nid, unsigned long size,
				       unsigned long align,
				       unsigned long end_pfn)
L
Linus Torvalds 已提交
573
{
574
	int new_nid;
575
	unsigned long ret = __lmb_alloc_base(size, align, end_pfn << PAGE_SHIFT);
L
Linus Torvalds 已提交
576 577 578

	/* retry over all memory */
	if (!ret)
579
		ret = __lmb_alloc_base(size, align, lmb_end_of_DRAM());
L
Linus Torvalds 已提交
580 581 582 583 584 585 586 587 588

	if (!ret)
		panic("numa.c: cannot allocate %lu bytes on node %d",
		      size, nid);

	/*
	 * If the memory came from a previously allocated node, we must
	 * retry with the bootmem allocator.
	 */
589 590 591
	new_nid = early_pfn_to_nid(ret >> PAGE_SHIFT);
	if (new_nid < nid) {
		ret = (unsigned long)__alloc_bootmem_node(NODE_DATA(new_nid),
L
Linus Torvalds 已提交
592 593 594 595
				size, align, 0);

		if (!ret)
			panic("numa.c: cannot allocate %lu bytes on node %d",
596
			      size, new_nid);
L
Linus Torvalds 已提交
597

598
		ret = __pa(ret);
L
Linus Torvalds 已提交
599 600 601 602

		dbg("alloc_bootmem %lx %lx\n", ret, size);
	}

603
	return (void *)ret;
L
Linus Torvalds 已提交
604 605 606 607 608
}

void __init do_init_bootmem(void)
{
	int nid;
609
	unsigned int i;
L
Linus Torvalds 已提交
610 611 612 613 614 615 616 617 618 619 620 621
	static struct notifier_block ppc64_numa_nb = {
		.notifier_call = cpu_numa_callback,
		.priority = 1 /* Must run before sched domains notifier. */
	};

	min_low_pfn = 0;
	max_low_pfn = lmb_end_of_DRAM() >> PAGE_SHIFT;
	max_pfn = max_low_pfn;

	if (parse_numa_properties())
		setup_nonnuma();
	else
622
		dump_numa_memory_topology();
L
Linus Torvalds 已提交
623 624 625 626

	register_cpu_notifier(&ppc64_numa_nb);

	for_each_online_node(nid) {
627
		unsigned long start_pfn, end_pfn, pages_present;
L
Linus Torvalds 已提交
628 629 630
		unsigned long bootmem_paddr;
		unsigned long bootmap_pages;

631
		get_region(nid, &start_pfn, &end_pfn, &pages_present);
L
Linus Torvalds 已提交
632 633

		/* Allocate the node structure node local if possible */
634
		NODE_DATA(nid) = careful_allocation(nid,
L
Linus Torvalds 已提交
635
					sizeof(struct pglist_data),
636 637
					SMP_CACHE_BYTES, end_pfn);
		NODE_DATA(nid) = __va(NODE_DATA(nid));
L
Linus Torvalds 已提交
638 639 640 641 642 643
		memset(NODE_DATA(nid), 0, sizeof(struct pglist_data));

  		dbg("node %d\n", nid);
		dbg("NODE_DATA() = %p\n", NODE_DATA(nid));

		NODE_DATA(nid)->bdata = &plat_node_bdata[nid];
644 645
		NODE_DATA(nid)->node_start_pfn = start_pfn;
		NODE_DATA(nid)->node_spanned_pages = end_pfn - start_pfn;
L
Linus Torvalds 已提交
646 647 648 649

		if (NODE_DATA(nid)->node_spanned_pages == 0)
  			continue;

650 651
  		dbg("start_paddr = %lx\n", start_pfn << PAGE_SHIFT);
  		dbg("end_paddr = %lx\n", end_pfn << PAGE_SHIFT);
L
Linus Torvalds 已提交
652

653 654 655 656 657
		bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
		bootmem_paddr = (unsigned long)careful_allocation(nid,
					bootmap_pages << PAGE_SHIFT,
					PAGE_SIZE, end_pfn);
		memset(__va(bootmem_paddr), 0, bootmap_pages << PAGE_SHIFT);
L
Linus Torvalds 已提交
658 659 660 661

		dbg("bootmap_paddr = %lx\n", bootmem_paddr);

		init_bootmem_node(NODE_DATA(nid), bootmem_paddr >> PAGE_SHIFT,
662
				  start_pfn, end_pfn);
L
Linus Torvalds 已提交
663

664 665 666
		/* Add free regions on this node */
		for (i = 0; init_node_data[i].end_pfn; i++) {
			unsigned long start, end;
L
Linus Torvalds 已提交
667

668
			if (init_node_data[i].nid != nid)
L
Linus Torvalds 已提交
669 670
				continue;

671 672
			start = init_node_data[i].start_pfn << PAGE_SHIFT;
			end = init_node_data[i].end_pfn << PAGE_SHIFT;
L
Linus Torvalds 已提交
673

674 675
			dbg("free_bootmem %lx %lx\n", start, end - start);
  			free_bootmem_node(NODE_DATA(nid), start, end - start);
L
Linus Torvalds 已提交
676 677
		}

678
		/* Mark reserved regions on this node */
L
Linus Torvalds 已提交
679
		for (i = 0; i < lmb.reserved.cnt; i++) {
680
			unsigned long physbase = lmb.reserved.region[i].base;
L
Linus Torvalds 已提交
681
			unsigned long size = lmb.reserved.region[i].size;
682 683
			unsigned long start_paddr = start_pfn << PAGE_SHIFT;
			unsigned long end_paddr = end_pfn << PAGE_SHIFT;
L
Linus Torvalds 已提交
684

685 686
			if (early_pfn_to_nid(physbase >> PAGE_SHIFT) != nid &&
			    early_pfn_to_nid((physbase+size-1) >> PAGE_SHIFT) != nid)
L
Linus Torvalds 已提交
687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705
				continue;

			if (physbase < end_paddr &&
			    (physbase+size) > start_paddr) {
				/* overlaps */
				if (physbase < start_paddr) {
					size -= start_paddr - physbase;
					physbase = start_paddr;
				}

				if (size > end_paddr - physbase)
					size = end_paddr - physbase;

				dbg("reserve_bootmem %lx %lx\n", physbase,
				    size);
				reserve_bootmem_node(NODE_DATA(nid), physbase,
						     size);
			}
		}
B
Bob Picco 已提交
706

707 708 709 710 711
		/* Add regions into sparsemem */
		for (i = 0; init_node_data[i].end_pfn; i++) {
			unsigned long start, end;

			if (init_node_data[i].nid != nid)
B
Bob Picco 已提交
712 713
				continue;

714 715
			start = init_node_data[i].start_pfn;
			end = init_node_data[i].end_pfn;
B
Bob Picco 已提交
716

717
			memory_present(nid, start, end);
B
Bob Picco 已提交
718
		}
L
Linus Torvalds 已提交
719 720 721 722 723 724 725 726 727 728 729 730 731
	}
}

void __init paging_init(void)
{
	unsigned long zones_size[MAX_NR_ZONES];
	unsigned long zholes_size[MAX_NR_ZONES];
	int nid;

	memset(zones_size, 0, sizeof(zones_size));
	memset(zholes_size, 0, sizeof(zholes_size));

	for_each_online_node(nid) {
732
		unsigned long start_pfn, end_pfn, pages_present;
L
Linus Torvalds 已提交
733

734
		get_region(nid, &start_pfn, &end_pfn, &pages_present);
L
Linus Torvalds 已提交
735 736

		zones_size[ZONE_DMA] = end_pfn - start_pfn;
737
		zholes_size[ZONE_DMA] = zones_size[ZONE_DMA] - pages_present;
L
Linus Torvalds 已提交
738 739 740 741

		dbg("free_area_init node %d %lx %lx (hole: %lx)\n", nid,
		    zones_size[ZONE_DMA], start_pfn, zholes_size[ZONE_DMA]);

742 743
		free_area_init_node(nid, NODE_DATA(nid), zones_size, start_pfn,
				    zholes_size);
L
Linus Torvalds 已提交
744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760
	}
}

static int __init early_numa(char *p)
{
	if (!p)
		return 0;

	if (strstr(p, "off"))
		numa_enabled = 0;

	if (strstr(p, "debug"))
		numa_debug = 1;

	return 0;
}
early_param("numa", early_numa);
761 762 763 764 765 766 767 768 769 770

#ifdef CONFIG_MEMORY_HOTPLUG
/*
 * Find the node associated with a hot added memory section.  Section
 * corresponds to a SPARSEMEM section, not an LMB.  It is assumed that
 * sections are fully contained within a single LMB.
 */
int hot_add_scn_to_nid(unsigned long scn_addr)
{
	struct device_node *memory = NULL;
771
	nodemask_t nodes;
772
	int nid = 0;
773 774

	if (!numa_enabled || (min_common_depth < 0))
775
		return nid;
776 777 778

	while ((memory = of_find_node_by_type(memory, "memory")) != NULL) {
		unsigned long start, size;
779
		int ranges;
780 781 782 783 784 785 786
		unsigned int *memcell_buf;
		unsigned int len;

		memcell_buf = (unsigned int *)get_property(memory, "reg", &len);
		if (!memcell_buf || len <= 0)
			continue;

787 788
		/* ranges in cell */
		ranges = (len >> 2) / (n_mem_addr_cells + n_mem_size_cells);
789 790 791
ha_new_range:
		start = read_n_cells(n_mem_addr_cells, &memcell_buf);
		size = read_n_cells(n_mem_size_cells, &memcell_buf);
792
		nid = of_node_to_nid(memory);
793 794

		/* Domains not present at boot default to 0 */
795 796
		if (!node_online(nid))
			nid = any_online_node(NODE_MASK_ALL);
797 798 799

		if ((scn_addr >= start) && (scn_addr < (start + size))) {
			of_node_put(memory);
800
			goto got_nid;
801 802 803 804 805 806
		}

		if (--ranges)		/* process all ranges in cell */
			goto ha_new_range;
	}
	BUG();	/* section address should be found above */
807 808

	/* Temporary code to ensure that returned node is not empty */
809
got_nid:
810
	nodes_setall(nodes);
811 812 813
	while (NODE_DATA(nid)->node_spanned_pages == 0) {
		node_clear(nid, nodes);
		nid = any_online_node(nodes);
814
	}
815
	return nid;
816 817
}
#endif /* CONFIG_MEMORY_HOTPLUG */