numa_64.c 16.6 KB
Newer Older
T
Thomas Gleixner 已提交
1
/*
L
Linus Torvalds 已提交
2 3
 * Generic VM initialization for x86-64 NUMA setups.
 * Copyright 2002,2003 Andi Kleen, SuSE Labs.
T
Thomas Gleixner 已提交
4
 */
L
Linus Torvalds 已提交
5 6 7 8 9 10 11 12 13
#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/string.h>
#include <linux/init.h>
#include <linux/bootmem.h>
#include <linux/mmzone.h>
#include <linux/ctype.h>
#include <linux/module.h>
#include <linux/nodemask.h>
14
#include <linux/sched.h>
L
Linus Torvalds 已提交
15 16 17 18 19 20

#include <asm/e820.h>
#include <asm/proto.h>
#include <asm/dma.h>
#include <asm/numa.h>
#include <asm/acpi.h>
21
#include <asm/k8.h>
L
Linus Torvalds 已提交
22

23
struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
T
Thomas Gleixner 已提交
24 25
EXPORT_SYMBOL(node_data);

26
struct memnode memnode;
L
Linus Torvalds 已提交
27

28
s16 apicid_to_node[MAX_LOCAL_APIC] __cpuinitdata = {
T
Thomas Gleixner 已提交
29
	[0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
30
};
T
Thomas Gleixner 已提交
31

L
Linus Torvalds 已提交
32
int numa_off __initdata;
33 34
static unsigned long __initdata nodemap_addr;
static unsigned long __initdata nodemap_size;
L
Linus Torvalds 已提交
35

36 37 38 39 40 41 42
/*
 * Given a shift value, try to populate memnodemap[]
 * Returns :
 * 1 if OK
 * 0 if memnodmap[] too small (of shift too small)
 * -1 if node overlap or lost ram (shift too big)
 */
T
Thomas Gleixner 已提交
43
static int __init populate_memnodemap(const struct bootnode *nodes,
44
				      int numnodes, int shift, int *nodeids)
L
Linus Torvalds 已提交
45
{
46
	unsigned long addr, end;
T
Thomas Gleixner 已提交
47
	int i, res = -1;
48

49
	memset(memnodemap, 0xff, sizeof(s16)*memnodemapsize);
50
	for (i = 0; i < numnodes; i++) {
51 52 53
		addr = nodes[i].start;
		end = nodes[i].end;
		if (addr >= end)
54
			continue;
55
		if ((end >> shift) >= memnodemapsize)
56 57
			return 0;
		do {
58
			if (memnodemap[addr >> shift] != NUMA_NO_NODE)
59
				return -1;
60 61 62 63 64 65

			if (!nodeids)
				memnodemap[addr >> shift] = i;
			else
				memnodemap[addr >> shift] = nodeids[i];

66
			addr += (1UL << shift);
67 68
		} while (addr < end);
		res = 1;
T
Thomas Gleixner 已提交
69
	}
70 71 72
	return res;
}

73 74
static int __init allocate_cachealigned_memnodemap(void)
{
75
	unsigned long addr;
76 77

	memnodemap = memnode.embedded_map;
78
	if (memnodemapsize <= ARRAY_SIZE(memnode.embedded_map))
79 80
		return 0;

81
	addr = 0x8000;
82
	nodemap_size = roundup(sizeof(s16) * memnodemapsize, L1_CACHE_BYTES);
Y
Yinghai Lu 已提交
83
	nodemap_addr = find_e820_area(addr, max_pfn<<PAGE_SHIFT,
84
				      nodemap_size, L1_CACHE_BYTES);
85 86 87 88 89 90
	if (nodemap_addr == -1UL) {
		printk(KERN_ERR
		       "NUMA: Unable to allocate Memory to Node hash map\n");
		nodemap_addr = nodemap_size = 0;
		return -1;
	}
91
	memnodemap = phys_to_virt(nodemap_addr);
92
	reserve_early(nodemap_addr, nodemap_addr + nodemap_size, "MEMNODEMAP");
93 94 95 96 97 98 99 100 101 102

	printk(KERN_DEBUG "NUMA: Allocated memnodemap from %lx - %lx\n",
	       nodemap_addr, nodemap_addr + nodemap_size);
	return 0;
}

/*
 * The LSB of all start and end addresses in the node map is the value of the
 * maximum possible shift.
 */
T
Thomas Gleixner 已提交
103 104
static int __init extract_lsb_from_nodes(const struct bootnode *nodes,
					 int numnodes)
105
{
106
	int i, nodes_used = 0;
107 108 109 110 111 112 113 114
	unsigned long start, end;
	unsigned long bitfield = 0, memtop = 0;

	for (i = 0; i < numnodes; i++) {
		start = nodes[i].start;
		end = nodes[i].end;
		if (start >= end)
			continue;
115 116
		bitfield |= start;
		nodes_used++;
117 118 119
		if (end > memtop)
			memtop = end;
	}
120 121 122 123
	if (nodes_used <= 1)
		i = 63;
	else
		i = find_first_bit(&bitfield, sizeof(unsigned long)*8);
124 125 126
	memnodemapsize = (memtop >> i)+1;
	return i;
}
127

128 129
int __init compute_hash_shift(struct bootnode *nodes, int numnodes,
			      int *nodeids)
130 131
{
	int shift;
132

133 134 135
	shift = extract_lsb_from_nodes(nodes, numnodes);
	if (allocate_cachealigned_memnodemap())
		return -1;
136
	printk(KERN_DEBUG "NUMA: Using %d for the hash shift.\n",
137 138
		shift);

139
	if (populate_memnodemap(nodes, numnodes, shift, nodeids) != 1) {
T
Thomas Gleixner 已提交
140 141 142
		printk(KERN_INFO "Your memory is not aligned you need to "
		       "rebuild your kernel with a bigger NODEMAPSIZE "
		       "shift=%d\n", shift);
143 144
		return -1;
	}
145
	return shift;
L
Linus Torvalds 已提交
146 147
}

148 149 150 151 152
int early_pfn_to_nid(unsigned long pfn)
{
	return phys_to_nid(pfn << PAGE_SHIFT);
}

T
Thomas Gleixner 已提交
153
static void * __init early_node_mem(int nodeid, unsigned long start,
154 155
				    unsigned long end, unsigned long size,
				    unsigned long align)
156
{
157
	unsigned long mem = find_e820_area(start, end, size, align);
158
	void *ptr;
T
Thomas Gleixner 已提交
159

Y
Yinghai Lu 已提交
160
	if (mem != -1L)
161
		return __va(mem);
Y
Yinghai Lu 已提交
162

163
	ptr = __alloc_bootmem_nopanic(size, align, __pa(MAX_DMA_ADDRESS));
Y
Yoann Padioleau 已提交
164
	if (ptr == NULL) {
165
		printk(KERN_ERR "Cannot find %lu bytes in node %d\n",
T
Thomas Gleixner 已提交
166
		       size, nodeid);
167 168 169 170 171
		return NULL;
	}
	return ptr;
}

L
Linus Torvalds 已提交
172
/* Initialize bootmem allocator for a node */
T
Thomas Gleixner 已提交
173 174 175
void __init setup_node_bootmem(int nodeid, unsigned long start,
			       unsigned long end)
{
176
	unsigned long start_pfn, last_pfn, bootmap_pages, bootmap_size;
T
Thomas Gleixner 已提交
177
	unsigned long bootmap_start, nodedata_phys;
178
	void *bootmap;
179
	const int pgdat_size = roundup(sizeof(pg_data_t), PAGE_SIZE);
180
	int nid;
L
Linus Torvalds 已提交
181

182
	start = roundup(start, ZONE_ALIGN);
L
Linus Torvalds 已提交
183

T
Thomas Gleixner 已提交
184 185
	printk(KERN_INFO "Bootmem setup node %d %016lx-%016lx\n", nodeid,
	       start, end);
L
Linus Torvalds 已提交
186 187

	start_pfn = start >> PAGE_SHIFT;
188
	last_pfn = end >> PAGE_SHIFT;
L
Linus Torvalds 已提交
189

190 191
	node_data[nodeid] = early_node_mem(nodeid, start, end, pgdat_size,
					   SMP_CACHE_BYTES);
192 193 194
	if (node_data[nodeid] == NULL)
		return;
	nodedata_phys = __pa(node_data[nodeid]);
195 196
	printk(KERN_INFO "  NODE_DATA [%016lx - %016lx]\n", nodedata_phys,
		nodedata_phys + pgdat_size - 1);
L
Linus Torvalds 已提交
197 198

	memset(NODE_DATA(nodeid), 0, sizeof(pg_data_t));
199
	NODE_DATA(nodeid)->bdata = &bootmem_node_data[nodeid];
L
Linus Torvalds 已提交
200
	NODE_DATA(nodeid)->node_start_pfn = start_pfn;
201
	NODE_DATA(nodeid)->node_spanned_pages = last_pfn - start_pfn;
L
Linus Torvalds 已提交
202

203 204 205 206 207 208 209
	/*
	 * Find a place for the bootmem map
	 * nodedata_phys could be on other nodes by alloc_bootmem,
	 * so need to sure bootmap_start not to be small, otherwise
	 * early_node_mem will get that with find_e820_area instead
	 * of alloc_bootmem, that could clash with reserved range
	 */
210
	bootmap_pages = bootmem_bootmap_pages(last_pfn - start_pfn);
211 212
	nid = phys_to_nid(nodedata_phys);
	if (nid == nodeid)
213
		bootmap_start = roundup(nodedata_phys + pgdat_size, PAGE_SIZE);
214
	else
215
		bootmap_start = roundup(start, PAGE_SIZE);
216
	/*
217
	 * SMP_CACHE_BYTES could be enough, but init_bootmem_node like
218 219
	 * to use that to align to PAGE_SIZE
	 */
220
	bootmap = early_node_mem(nodeid, bootmap_start, end,
221
				 bootmap_pages<<PAGE_SHIFT, PAGE_SIZE);
222 223
	if (bootmap == NULL)  {
		if (nodedata_phys < start || nodedata_phys >= end)
224
			free_bootmem(nodedata_phys, pgdat_size);
225 226 227 228
		node_data[nodeid] = NULL;
		return;
	}
	bootmap_start = __pa(bootmap);
T
Thomas Gleixner 已提交
229

L
Linus Torvalds 已提交
230
	bootmap_size = init_bootmem_node(NODE_DATA(nodeid),
T
Thomas Gleixner 已提交
231
					 bootmap_start >> PAGE_SHIFT,
232
					 start_pfn, last_pfn);
L
Linus Torvalds 已提交
233

234 235 236 237
	printk(KERN_INFO "  bootmap [%016lx -  %016lx] pages %lx\n",
		 bootmap_start, bootmap_start + bootmap_size - 1,
		 bootmap_pages);

238
	free_bootmem_with_active_regions(nodeid, end);
L
Linus Torvalds 已提交
239

240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262
	/*
	 * convert early reserve to bootmem reserve earlier
	 * otherwise early_node_mem could use early reserved mem
	 * on previous node
	 */
	early_res_to_bootmem(start, end);

	/*
	 * in some case early_node_mem could use alloc_bootmem
	 * to get range on other node, don't reserve that again
	 */
	if (nid != nodeid)
		printk(KERN_INFO "    NODE_DATA(%d) on node %d\n", nodeid, nid);
	else
		reserve_bootmem_node(NODE_DATA(nodeid), nodedata_phys,
					pgdat_size, BOOTMEM_DEFAULT);
	nid = phys_to_nid(bootmap_start);
	if (nid != nodeid)
		printk(KERN_INFO "    bootmap(%d) on node %d\n", nodeid, nid);
	else
		reserve_bootmem_node(NODE_DATA(nodeid), bootmap_start,
				 bootmap_pages<<PAGE_SHIFT, BOOTMEM_DEFAULT);

263 264 265
#ifdef CONFIG_ACPI_NUMA
	srat_reserve_add_area(nodeid);
#endif
L
Linus Torvalds 已提交
266
	node_set_online(nodeid);
T
Thomas Gleixner 已提交
267
}
L
Linus Torvalds 已提交
268

T
Thomas Gleixner 已提交
269 270 271 272 273 274 275
/*
 * There are unfortunately some poorly designed mainboards around that
 * only connect memory to a single CPU. This breaks the 1:1 cpu->node
 * mapping. To avoid this fill in the mapping for all possible CPUs,
 * as the number of CPUs is not known yet. We round robin the existing
 * nodes.
 */
L
Linus Torvalds 已提交
276 277 278
void __init numa_init_array(void)
{
	int rr, i;
T
Thomas Gleixner 已提交
279

280
	rr = first_node(node_online_map);
281
	for (i = 0; i < nr_cpu_ids; i++) {
282
		if (early_cpu_to_node(i) != NUMA_NO_NODE)
L
Linus Torvalds 已提交
283
			continue;
T
Thomas Gleixner 已提交
284
		numa_set_node(i, rr);
L
Linus Torvalds 已提交
285 286 287 288 289 290 291
		rr = next_node(rr, node_online_map);
		if (rr == MAX_NUMNODES)
			rr = first_node(node_online_map);
	}
}

#ifdef CONFIG_NUMA_EMU
292
/* Numa emulation */
293
static char *cmdline __initdata;
L
Linus Torvalds 已提交
294

295
/*
T
Thomas Gleixner 已提交
296 297 298 299 300
 * Setups up nid to range from addr to addr + size.  If the end
 * boundary is greater than max_addr, then max_addr is used instead.
 * The return value is 0 if there is additional memory left for
 * allocation past addr and -1 otherwise.  addr is adjusted to be at
 * the end of the node.
301
 */
302 303
static int __init setup_node_range(int nid, struct bootnode *nodes, u64 *addr,
				   u64 size, u64 max_addr)
304
{
305
	int ret = 0;
T
Thomas Gleixner 已提交
306

307 308 309 310 311 312 313
	nodes[nid].start = *addr;
	*addr += size;
	if (*addr >= max_addr) {
		*addr = max_addr;
		ret = -1;
	}
	nodes[nid].end = *addr;
314
	node_set(nid, node_possible_map);
315 316 317 318
	printk(KERN_INFO "Faking node %d at %016Lx-%016Lx (%LuMB)\n", nid,
	       nodes[nid].start, nodes[nid].end,
	       (nodes[nid].end - nodes[nid].start) >> 20);
	return ret;
319 320
}

321 322 323 324 325 326 327 328
/*
 * Splits num_nodes nodes up equally starting at node_start.  The return value
 * is the number of nodes split up and addr is adjusted to be at the end of the
 * last node allocated.
 */
static int __init split_nodes_equally(struct bootnode *nodes, u64 *addr,
				      u64 max_addr, int node_start,
				      int num_nodes)
L
Linus Torvalds 已提交
329
{
330 331 332
	unsigned int big;
	u64 size;
	int i;
333

334 335 336 337
	if (num_nodes <= 0)
		return -1;
	if (num_nodes > MAX_NUMNODES)
		num_nodes = MAX_NUMNODES;
338
	size = (max_addr - *addr - e820_hole_size(*addr, max_addr)) /
339
	       num_nodes;
340
	/*
341 342
	 * Calculate the number of big nodes that can be allocated as a result
	 * of consolidating the leftovers.
343
	 */
344 345 346 347 348 349 350 351 352
	big = ((size & ~FAKE_NODE_MIN_HASH_MASK) * num_nodes) /
	      FAKE_NODE_MIN_SIZE;

	/* Round down to nearest FAKE_NODE_MIN_SIZE. */
	size &= FAKE_NODE_MIN_HASH_MASK;
	if (!size) {
		printk(KERN_ERR "Not enough memory for each node.  "
		       "NUMA emulation disabled.\n");
		return -1;
353
	}
354 355 356

	for (i = node_start; i < num_nodes + node_start; i++) {
		u64 end = *addr + size;
T
Thomas Gleixner 已提交
357

358 359 360
		if (i < big)
			end += FAKE_NODE_MIN_SIZE;
		/*
361 362
		 * The final node can have the remaining system RAM.  Other
		 * nodes receive roughly the same amount of available pages.
363
		 */
364 365 366
		if (i == num_nodes + node_start - 1)
			end = max_addr;
		else
367
			while (end - *addr - e820_hole_size(*addr, end) <
368 369 370 371 372 373 374 375 376 377 378 379 380
			       size) {
				end += FAKE_NODE_MIN_SIZE;
				if (end > max_addr) {
					end = max_addr;
					break;
				}
			}
		if (setup_node_range(i, nodes, addr, end - *addr, max_addr) < 0)
			break;
	}
	return i - node_start + 1;
}

381 382 383 384 385 386 387 388 389 390 391 392 393 394 395
/*
 * Splits the remaining system RAM into chunks of size.  The remaining memory is
 * always assigned to a final node and can be asymmetric.  Returns the number of
 * nodes split.
 */
static int __init split_nodes_by_size(struct bootnode *nodes, u64 *addr,
				      u64 max_addr, int node_start, u64 size)
{
	int i = node_start;
	size = (size << 20) & FAKE_NODE_MIN_HASH_MASK;
	while (!setup_node_range(i++, nodes, addr, size, max_addr))
		;
	return i - node_start;
}

396
/*
397
 * Sets up the system RAM area from start_pfn to last_pfn according to the
398 399
 * numa=fake command-line option.
 */
400 401
static struct bootnode nodes[MAX_NUMNODES] __initdata;

402
static int __init numa_emulation(unsigned long start_pfn, unsigned long last_pfn)
403
{
T
Thomas Gleixner 已提交
404
	u64 size, addr = start_pfn << PAGE_SHIFT;
405
	u64 max_addr = last_pfn << PAGE_SHIFT;
T
Thomas Gleixner 已提交
406
	int num_nodes = 0, num = 0, coeff_flag, coeff = -1, i;
407 408 409 410 411 412 413

	memset(&nodes, 0, sizeof(nodes));
	/*
	 * If the numa=fake command-line is just a single number N, split the
	 * system RAM into N fake nodes.
	 */
	if (!strchr(cmdline, '*') && !strchr(cmdline, ',')) {
T
Thomas Gleixner 已提交
414 415 416
		long n = simple_strtol(cmdline, NULL, 0);

		num_nodes = split_nodes_equally(nodes, &addr, max_addr, 0, n);
417 418 419 420 421 422
		if (num_nodes < 0)
			return num_nodes;
		goto out;
	}

	/* Parse the command line. */
423
	for (coeff_flag = 0; ; cmdline++) {
424 425 426
		if (*cmdline && isdigit(*cmdline)) {
			num = num * 10 + *cmdline - '0';
			continue;
427
		}
428 429 430 431 432
		if (*cmdline == '*') {
			if (num > 0)
				coeff = num;
			coeff_flag = 1;
		}
433
		if (!*cmdline || *cmdline == ',') {
434 435
			if (!coeff_flag)
				coeff = 1;
436 437 438 439 440
			/*
			 * Round down to the nearest FAKE_NODE_MIN_SIZE.
			 * Command-line coefficients are in megabytes.
			 */
			size = ((u64)num << 20) & FAKE_NODE_MIN_HASH_MASK;
441
			if (size)
442 443 444 445
				for (i = 0; i < coeff; i++, num_nodes++)
					if (setup_node_range(num_nodes, nodes,
						&addr, size, max_addr) < 0)
						goto done;
446 447 448 449
			if (!*cmdline)
				break;
			coeff_flag = 0;
			coeff = -1;
450
		}
451 452 453 454 455
		num = 0;
	}
done:
	if (!num_nodes)
		return -1;
456
	/* Fill remainder of system RAM, if appropriate. */
457
	if (addr < max_addr) {
458 459 460 461 462 463
		if (coeff_flag && coeff < 0) {
			/* Split remaining nodes into num-sized chunks */
			num_nodes += split_nodes_by_size(nodes, &addr, max_addr,
							 num_nodes, num);
			goto out;
		}
464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480
		switch (*(cmdline - 1)) {
		case '*':
			/* Split remaining nodes into coeff chunks */
			if (coeff <= 0)
				break;
			num_nodes += split_nodes_equally(nodes, &addr, max_addr,
							 num_nodes, coeff);
			break;
		case ',':
			/* Do not allocate remaining system RAM */
			break;
		default:
			/* Give one final node */
			setup_node_range(num_nodes, nodes, &addr,
					 max_addr - addr, max_addr);
			num_nodes++;
		}
481 482
	}
out:
483
	memnode_shift = compute_hash_shift(nodes, num_nodes, NULL);
484 485 486 487 488 489 490 491 492
	if (memnode_shift < 0) {
		memnode_shift = 0;
		printk(KERN_ERR "No NUMA hash function found.  NUMA emulation "
		       "disabled.\n");
		return -1;
	}

	/*
	 * We need to vacate all active ranges that may have been registered by
493 494
	 * SRAT and set acpi_numa to -1 so that srat_disabled() always returns
	 * true.  NUMA emulation has succeeded so we will not scan ACPI nodes.
495 496
	 */
	remove_all_active_ranges();
497 498 499
#ifdef CONFIG_ACPI_NUMA
	acpi_numa = -1;
#endif
500
	for_each_node_mask(i, node_possible_map) {
501 502
		e820_register_active_regions(i, nodes[i].start >> PAGE_SHIFT,
						nodes[i].end >> PAGE_SHIFT);
T
Thomas Gleixner 已提交
503
		setup_node_bootmem(i, nodes[i].start, nodes[i].end);
504
	}
505
	acpi_fake_nodes(nodes, num_nodes);
T
Thomas Gleixner 已提交
506 507
	numa_init_array();
	return 0;
L
Linus Torvalds 已提交
508
}
509
#endif /* CONFIG_NUMA_EMU */
L
Linus Torvalds 已提交
510

511
void __init initmem_init(unsigned long start_pfn, unsigned long last_pfn)
T
Thomas Gleixner 已提交
512
{
L
Linus Torvalds 已提交
513 514
	int i;

515
	nodes_clear(node_possible_map);
516
	nodes_clear(node_online_map);
517

L
Linus Torvalds 已提交
518
#ifdef CONFIG_NUMA_EMU
519
	if (cmdline && !numa_emulation(start_pfn, last_pfn))
T
Thomas Gleixner 已提交
520
		return;
521
	nodes_clear(node_possible_map);
522
	nodes_clear(node_online_map);
L
Linus Torvalds 已提交
523 524 525 526
#endif

#ifdef CONFIG_ACPI_NUMA
	if (!numa_off && !acpi_scan_nodes(start_pfn << PAGE_SHIFT,
527
					  last_pfn << PAGE_SHIFT))
T
Thomas Gleixner 已提交
528
		return;
529
	nodes_clear(node_possible_map);
530
	nodes_clear(node_online_map);
L
Linus Torvalds 已提交
531 532 533
#endif

#ifdef CONFIG_K8_NUMA
T
Thomas Gleixner 已提交
534
	if (!numa_off && !k8_scan_nodes(start_pfn<<PAGE_SHIFT,
535
					last_pfn<<PAGE_SHIFT))
L
Linus Torvalds 已提交
536
		return;
537
	nodes_clear(node_possible_map);
538
	nodes_clear(node_online_map);
L
Linus Torvalds 已提交
539 540 541 542
#endif
	printk(KERN_INFO "%s\n",
	       numa_off ? "NUMA turned off" : "No NUMA configuration found");

T
Thomas Gleixner 已提交
543
	printk(KERN_INFO "Faking a node at %016lx-%016lx\n",
L
Linus Torvalds 已提交
544
	       start_pfn << PAGE_SHIFT,
545
	       last_pfn << PAGE_SHIFT);
T
Thomas Gleixner 已提交
546 547
	/* setup dummy node covering all memory */
	memnode_shift = 63;
548
	memnodemap = memnode.embedded_map;
L
Linus Torvalds 已提交
549 550
	memnodemap[0] = 0;
	node_set_online(0);
551
	node_set(0, node_possible_map);
552
	for (i = 0; i < nr_cpu_ids; i++)
553
		numa_set_node(i, 0);
554 555
	e820_register_active_regions(0, start_pfn, last_pfn);
	setup_node_bootmem(0, start_pfn << PAGE_SHIFT, last_pfn << PAGE_SHIFT);
556 557
}

T
Thomas Gleixner 已提交
558 559
unsigned long __init numa_free_all_bootmem(void)
{
L
Linus Torvalds 已提交
560
	unsigned long pages = 0;
T
Thomas Gleixner 已提交
561 562 563
	int i;

	for_each_online_node(i)
L
Linus Torvalds 已提交
564
		pages += free_all_bootmem_node(NODE_DATA(i));
T
Thomas Gleixner 已提交
565

L
Linus Torvalds 已提交
566
	return pages;
T
Thomas Gleixner 已提交
567
}
L
Linus Torvalds 已提交
568 569

void __init paging_init(void)
T
Thomas Gleixner 已提交
570
{
571
	unsigned long max_zone_pfns[MAX_NR_ZONES];
T
Thomas Gleixner 已提交
572

573 574 575
	memset(max_zone_pfns, 0, sizeof(max_zone_pfns));
	max_zone_pfns[ZONE_DMA] = MAX_DMA_PFN;
	max_zone_pfns[ZONE_DMA32] = MAX_DMA32_PFN;
Y
Yinghai Lu 已提交
576
	max_zone_pfns[ZONE_NORMAL] = max_pfn;
B
Bob Picco 已提交
577

578 579
	sparse_memory_present_with_active_regions(MAX_NUMNODES);
	sparse_init();
B
Bob Picco 已提交
580

581
	free_area_init_nodes(max_zone_pfns);
T
Thomas Gleixner 已提交
582
}
L
Linus Torvalds 已提交
583

584
static __init int numa_setup(char *opt)
T
Thomas Gleixner 已提交
585
{
586 587
	if (!opt)
		return -EINVAL;
T
Thomas Gleixner 已提交
588
	if (!strncmp(opt, "off", 3))
L
Linus Torvalds 已提交
589 590
		numa_off = 1;
#ifdef CONFIG_NUMA_EMU
591 592
	if (!strncmp(opt, "fake=", 5))
		cmdline = opt + 5;
L
Linus Torvalds 已提交
593 594
#endif
#ifdef CONFIG_ACPI_NUMA
T
Thomas Gleixner 已提交
595 596 597
	if (!strncmp(opt, "noacpi", 6))
		acpi_numa = -1;
	if (!strncmp(opt, "hotadd=", 7))
598
		hotadd_percent = simple_strtoul(opt+7, NULL, 10);
L
Linus Torvalds 已提交
599
#endif
600
	return 0;
T
Thomas Gleixner 已提交
601
}
602 603
early_param("numa", numa_setup);

604
#ifdef CONFIG_NUMA
605 606 607 608 609 610 611 612 613 614 615
/*
 * Setup early cpu_to_node.
 *
 * Populate cpu_to_node[] only if x86_cpu_to_apicid[],
 * and apicid_to_node[] tables have valid entries for a CPU.
 * This means we skip cpu_to_node[] initialisation for NUMA
 * emulation and faking node case (when running a kernel compiled
 * for NUMA on a non NUMA box), which is OK as cpu_to_node[]
 * is already initialized in a round robin manner at numa_init_array,
 * prior to this call, and this initialization is good enough
 * for the fake NUMA cases.
616 617
 *
 * Called before the per_cpu areas are setup.
618 619 620
 */
void __init init_cpu_to_node(void)
{
621 622
	int cpu;
	u16 *cpu_to_apicid = early_per_cpu_ptr(x86_cpu_to_apicid);
T
Thomas Gleixner 已提交
623

624 625 626
	BUG_ON(cpu_to_apicid == NULL);

	for_each_possible_cpu(cpu) {
627
		int node;
628
		u16 apicid = cpu_to_apicid[cpu];
T
Thomas Gleixner 已提交
629

630 631
		if (apicid == BAD_APICID)
			continue;
632 633
		node = apicid_to_node[apicid];
		if (node == NUMA_NO_NODE)
634
			continue;
635 636
		if (!node_online(node))
			continue;
637
		numa_set_node(cpu, node);
638 639
	}
}
640
#endif
641

642