numa_64.c 16.2 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 14 15 16 17 18 19
#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>

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

#ifndef Dprintk
#define Dprintk(x...)
#endif

26
struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
T
Thomas Gleixner 已提交
27 28
EXPORT_SYMBOL(node_data);

L
Linus Torvalds 已提交
29 30
bootmem_data_t plat_node_bdata[MAX_NUMNODES];

31
struct memnode memnode;
L
Linus Torvalds 已提交
32

T
Thomas Gleixner 已提交
33
int cpu_to_node_map[NR_CPUS] __read_mostly = {
34
	[0 ... NR_CPUS-1] = NUMA_NO_NODE
35
};
T
Thomas Gleixner 已提交
36
EXPORT_SYMBOL(cpu_to_node_map);
T
Thomas Gleixner 已提交
37

38
unsigned char apicid_to_node[MAX_LOCAL_APIC] __cpuinitdata = {
T
Thomas Gleixner 已提交
39
	[0 ... MAX_LOCAL_APIC-1] = NUMA_NO_NODE
40
};
T
Thomas Gleixner 已提交
41

T
Thomas Gleixner 已提交
42 43
cpumask_t node_to_cpumask_map[MAX_NUMNODES] __read_mostly;
EXPORT_SYMBOL(node_to_cpumask_map);
L
Linus Torvalds 已提交
44 45

int numa_off __initdata;
46 47
unsigned long __initdata nodemap_addr;
unsigned long __initdata nodemap_size;
L
Linus Torvalds 已提交
48

49 50 51 52 53 54 55
/*
 * 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 已提交
56 57
static int __init populate_memnodemap(const struct bootnode *nodes,
				      int numnodes, int shift)
L
Linus Torvalds 已提交
58
{
59
	unsigned long addr, end;
T
Thomas Gleixner 已提交
60
	int i, res = -1;
61

62
	memset(memnodemap, 0xff, memnodemapsize);
63
	for (i = 0; i < numnodes; i++) {
64 65 66
		addr = nodes[i].start;
		end = nodes[i].end;
		if (addr >= end)
67
			continue;
68
		if ((end >> shift) >= memnodemapsize)
69 70 71
			return 0;
		do {
			if (memnodemap[addr >> shift] != 0xff)
72 73
				return -1;
			memnodemap[addr >> shift] = i;
74
			addr += (1UL << shift);
75 76
		} while (addr < end);
		res = 1;
T
Thomas Gleixner 已提交
77
	}
78 79 80
	return res;
}

81 82 83 84 85
static int __init allocate_cachealigned_memnodemap(void)
{
	unsigned long pad, pad_addr;

	memnodemap = memnode.embedded_map;
86
	if (memnodemapsize <= 48)
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
		return 0;

	pad = L1_CACHE_BYTES - 1;
	pad_addr = 0x8000;
	nodemap_size = pad + memnodemapsize;
	nodemap_addr = find_e820_area(pad_addr, end_pfn<<PAGE_SHIFT,
				      nodemap_size);
	if (nodemap_addr == -1UL) {
		printk(KERN_ERR
		       "NUMA: Unable to allocate Memory to Node hash map\n");
		nodemap_addr = nodemap_size = 0;
		return -1;
	}
	pad_addr = (nodemap_addr + pad) & ~pad;
	memnodemap = phys_to_virt(pad_addr);

	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 已提交
112 113
static int __init extract_lsb_from_nodes(const struct bootnode *nodes,
					 int numnodes)
114
{
115
	int i, nodes_used = 0;
116 117 118 119 120 121 122 123
	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;
124 125
		bitfield |= start;
		nodes_used++;
126 127 128
		if (end > memtop)
			memtop = end;
	}
129 130 131 132
	if (nodes_used <= 1)
		i = 63;
	else
		i = find_first_bit(&bitfield, sizeof(unsigned long)*8);
133 134 135
	memnodemapsize = (memtop >> i)+1;
	return i;
}
136

137 138 139
int __init compute_hash_shift(struct bootnode *nodes, int numnodes)
{
	int shift;
140

141 142 143
	shift = extract_lsb_from_nodes(nodes, numnodes);
	if (allocate_cachealigned_memnodemap())
		return -1;
144
	printk(KERN_DEBUG "NUMA: Using %d for the hash shift.\n",
145 146 147
		shift);

	if (populate_memnodemap(nodes, numnodes, shift) != 1) {
T
Thomas Gleixner 已提交
148 149 150
		printk(KERN_INFO "Your memory is not aligned you need to "
		       "rebuild your kernel with a bigger NODEMAPSIZE "
		       "shift=%d\n", shift);
151 152
		return -1;
	}
153
	return shift;
L
Linus Torvalds 已提交
154 155
}

156 157 158 159 160
int early_pfn_to_nid(unsigned long pfn)
{
	return phys_to_nid(pfn << PAGE_SHIFT);
}

T
Thomas Gleixner 已提交
161 162
static void * __init early_node_mem(int nodeid, unsigned long start,
				    unsigned long end, unsigned long size)
163 164 165
{
	unsigned long mem = find_e820_area(start, end, size);
	void *ptr;
T
Thomas Gleixner 已提交
166

167 168 169 170
	if (mem != -1L)
		return __va(mem);
	ptr = __alloc_bootmem_nopanic(size,
				SMP_CACHE_BYTES, __pa(MAX_DMA_ADDRESS));
Y
Yoann Padioleau 已提交
171
	if (ptr == NULL) {
172
		printk(KERN_ERR "Cannot find %lu bytes in node %d\n",
T
Thomas Gleixner 已提交
173
		       size, nodeid);
174 175 176 177 178
		return NULL;
	}
	return ptr;
}

L
Linus Torvalds 已提交
179
/* Initialize bootmem allocator for a node */
T
Thomas Gleixner 已提交
180 181 182 183 184
void __init setup_node_bootmem(int nodeid, unsigned long start,
			       unsigned long end)
{
	unsigned long start_pfn, end_pfn, bootmap_pages, bootmap_size;
	unsigned long bootmap_start, nodedata_phys;
185
	void *bootmap;
L
Linus Torvalds 已提交
186 187
	const int pgdat_size = round_up(sizeof(pg_data_t), PAGE_SIZE);

T
Thomas Gleixner 已提交
188
	start = round_up(start, ZONE_ALIGN);
L
Linus Torvalds 已提交
189

T
Thomas Gleixner 已提交
190 191
	printk(KERN_INFO "Bootmem setup node %d %016lx-%016lx\n", nodeid,
	       start, end);
L
Linus Torvalds 已提交
192 193 194 195

	start_pfn = start >> PAGE_SHIFT;
	end_pfn = end >> PAGE_SHIFT;

196 197 198 199
	node_data[nodeid] = early_node_mem(nodeid, start, end, pgdat_size);
	if (node_data[nodeid] == NULL)
		return;
	nodedata_phys = __pa(node_data[nodeid]);
L
Linus Torvalds 已提交
200 201 202 203 204 205 206

	memset(NODE_DATA(nodeid), 0, sizeof(pg_data_t));
	NODE_DATA(nodeid)->bdata = &plat_node_bdata[nodeid];
	NODE_DATA(nodeid)->node_start_pfn = start_pfn;
	NODE_DATA(nodeid)->node_spanned_pages = end_pfn - start_pfn;

	/* Find a place for the bootmem map */
T
Thomas Gleixner 已提交
207
	bootmap_pages = bootmem_bootmap_pages(end_pfn - start_pfn);
L
Linus Torvalds 已提交
208
	bootmap_start = round_up(nodedata_phys + pgdat_size, PAGE_SIZE);
209 210 211 212
	bootmap = early_node_mem(nodeid, bootmap_start, end,
					bootmap_pages<<PAGE_SHIFT);
	if (bootmap == NULL)  {
		if (nodedata_phys < start || nodedata_phys >= end)
T
Thomas Gleixner 已提交
213 214
			free_bootmem((unsigned long)node_data[nodeid],
				     pgdat_size);
215 216 217 218
		node_data[nodeid] = NULL;
		return;
	}
	bootmap_start = __pa(bootmap);
T
Thomas Gleixner 已提交
219 220
	Dprintk("bootmap start %lu pages %lu\n", bootmap_start, bootmap_pages);

L
Linus Torvalds 已提交
221
	bootmap_size = init_bootmem_node(NODE_DATA(nodeid),
T
Thomas Gleixner 已提交
222 223
					 bootmap_start >> PAGE_SHIFT,
					 start_pfn, end_pfn);
L
Linus Torvalds 已提交
224

225
	free_bootmem_with_active_regions(nodeid, end);
L
Linus Torvalds 已提交
226

T
Thomas Gleixner 已提交
227 228 229
	reserve_bootmem_node(NODE_DATA(nodeid), nodedata_phys, pgdat_size);
	reserve_bootmem_node(NODE_DATA(nodeid), bootmap_start,
			     bootmap_pages<<PAGE_SHIFT);
230 231 232
#ifdef CONFIG_ACPI_NUMA
	srat_reserve_add_area(nodeid);
#endif
L
Linus Torvalds 已提交
233
	node_set_online(nodeid);
T
Thomas Gleixner 已提交
234
}
L
Linus Torvalds 已提交
235

236
#ifdef CONFIG_FLAT_NODE_MEM_MAP
L
Linus Torvalds 已提交
237
/* Initialize final allocator for a zone */
238
static void __init flat_setup_node_zones(int nodeid)
T
Thomas Gleixner 已提交
239
{
240
	unsigned long start_pfn, end_pfn, memmapsize, limit;
L
Linus Torvalds 已提交
241

T
Thomas Gleixner 已提交
242 243
	start_pfn = node_start_pfn(nodeid);
	end_pfn = node_end_pfn(nodeid);
L
Linus Torvalds 已提交
244

245
	Dprintk(KERN_INFO "Setting up memmap for node %d %lx-%lx\n",
A
Andi Kleen 已提交
246
		nodeid, start_pfn, end_pfn);
L
Linus Torvalds 已提交
247

T
Thomas Gleixner 已提交
248 249 250 251
	/*
	 * Try to allocate mem_map at end to not fill up precious <4GB
	 * memory.
	 */
252 253
	memmapsize = sizeof(struct page) * (end_pfn-start_pfn);
	limit = end_pfn << PAGE_SHIFT;
254

T
Thomas Gleixner 已提交
255 256 257 258 259 260
	NODE_DATA(nodeid)->node_mem_map =
		__alloc_bootmem_core(NODE_DATA(nodeid)->bdata,
				     memmapsize, SMP_CACHE_BYTES,
				     round_down(limit - memmapsize, PAGE_SIZE),
				     limit);
}
261 262 263
#else
#define flat_setup_node_zones(i) do {} while (0)
#endif
L
Linus Torvalds 已提交
264

T
Thomas Gleixner 已提交
265 266 267 268 269 270 271
/*
 * 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 已提交
272 273 274
void __init numa_init_array(void)
{
	int rr, i;
T
Thomas Gleixner 已提交
275

276
	rr = first_node(node_online_map);
L
Linus Torvalds 已提交
277
	for (i = 0; i < NR_CPUS; i++) {
M
Mike Travis 已提交
278
		if (cpu_to_node(i) != NUMA_NO_NODE)
L
Linus Torvalds 已提交
279
			continue;
T
Thomas Gleixner 已提交
280
		numa_set_node(i, rr);
L
Linus Torvalds 已提交
281 282 283 284 285 286 287
		rr = next_node(rr, node_online_map);
		if (rr == MAX_NUMNODES)
			rr = first_node(node_online_map);
	}
}

#ifdef CONFIG_NUMA_EMU
288
/* Numa emulation */
289
char *cmdline __initdata;
L
Linus Torvalds 已提交
290

291
/*
T
Thomas Gleixner 已提交
292 293 294 295 296
 * 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.
297
 */
298 299
static int __init setup_node_range(int nid, struct bootnode *nodes, u64 *addr,
				   u64 size, u64 max_addr)
300
{
301
	int ret = 0;
T
Thomas Gleixner 已提交
302

303 304 305 306 307 308 309
	nodes[nid].start = *addr;
	*addr += size;
	if (*addr >= max_addr) {
		*addr = max_addr;
		ret = -1;
	}
	nodes[nid].end = *addr;
310
	node_set(nid, node_possible_map);
311 312 313 314
	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;
315 316
}

317 318 319 320 321 322 323 324
/*
 * 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 已提交
325
{
326 327 328
	unsigned int big;
	u64 size;
	int i;
329

330 331 332 333
	if (num_nodes <= 0)
		return -1;
	if (num_nodes > MAX_NUMNODES)
		num_nodes = MAX_NUMNODES;
334
	size = (max_addr - *addr - e820_hole_size(*addr, max_addr)) /
335
	       num_nodes;
336
	/*
337 338
	 * Calculate the number of big nodes that can be allocated as a result
	 * of consolidating the leftovers.
339
	 */
340 341 342 343 344 345 346 347 348
	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;
349
	}
350 351 352

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

354 355 356
		if (i < big)
			end += FAKE_NODE_MIN_SIZE;
		/*
357 358
		 * The final node can have the remaining system RAM.  Other
		 * nodes receive roughly the same amount of available pages.
359
		 */
360 361 362
		if (i == num_nodes + node_start - 1)
			end = max_addr;
		else
363
			while (end - *addr - e820_hole_size(*addr, end) <
364 365 366 367 368 369 370 371 372 373 374 375 376
			       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;
}

377 378 379 380 381 382 383 384 385 386 387 388 389 390 391
/*
 * 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;
}

392 393 394 395 396 397 398
/*
 * Sets up the system RAM area from start_pfn to end_pfn according to the
 * numa=fake command-line option.
 */
static int __init numa_emulation(unsigned long start_pfn, unsigned long end_pfn)
{
	struct bootnode nodes[MAX_NUMNODES];
T
Thomas Gleixner 已提交
399
	u64 size, addr = start_pfn << PAGE_SHIFT;
400
	u64 max_addr = end_pfn << PAGE_SHIFT;
T
Thomas Gleixner 已提交
401
	int num_nodes = 0, num = 0, coeff_flag, coeff = -1, i;
402 403 404 405 406 407 408

	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 已提交
409 410 411
		long n = simple_strtol(cmdline, NULL, 0);

		num_nodes = split_nodes_equally(nodes, &addr, max_addr, 0, n);
412 413 414 415 416 417
		if (num_nodes < 0)
			return num_nodes;
		goto out;
	}

	/* Parse the command line. */
418
	for (coeff_flag = 0; ; cmdline++) {
419 420 421
		if (*cmdline && isdigit(*cmdline)) {
			num = num * 10 + *cmdline - '0';
			continue;
422
		}
423 424 425 426 427
		if (*cmdline == '*') {
			if (num > 0)
				coeff = num;
			coeff_flag = 1;
		}
428
		if (!*cmdline || *cmdline == ',') {
429 430
			if (!coeff_flag)
				coeff = 1;
431 432 433 434 435
			/*
			 * Round down to the nearest FAKE_NODE_MIN_SIZE.
			 * Command-line coefficients are in megabytes.
			 */
			size = ((u64)num << 20) & FAKE_NODE_MIN_HASH_MASK;
436
			if (size)
437 438 439 440
				for (i = 0; i < coeff; i++, num_nodes++)
					if (setup_node_range(num_nodes, nodes,
						&addr, size, max_addr) < 0)
						goto done;
441 442 443 444
			if (!*cmdline)
				break;
			coeff_flag = 0;
			coeff = -1;
445
		}
446 447 448 449 450
		num = 0;
	}
done:
	if (!num_nodes)
		return -1;
451
	/* Fill remainder of system RAM, if appropriate. */
452
	if (addr < max_addr) {
453 454 455 456 457 458
		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;
		}
459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475
		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++;
		}
476 477 478 479 480 481 482 483 484 485 486 487
	}
out:
	memnode_shift = compute_hash_shift(nodes, num_nodes);
	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
488 489
	 * 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.
490 491
	 */
	remove_all_active_ranges();
492 493 494
#ifdef CONFIG_ACPI_NUMA
	acpi_numa = -1;
#endif
495
	for_each_node_mask(i, node_possible_map) {
496 497
		e820_register_active_regions(i, nodes[i].start >> PAGE_SHIFT,
						nodes[i].end >> PAGE_SHIFT);
T
Thomas Gleixner 已提交
498
		setup_node_bootmem(i, nodes[i].start, nodes[i].end);
499
	}
500
	acpi_fake_nodes(nodes, num_nodes);
T
Thomas Gleixner 已提交
501 502
	numa_init_array();
	return 0;
L
Linus Torvalds 已提交
503
}
504
#endif /* CONFIG_NUMA_EMU */
L
Linus Torvalds 已提交
505 506

void __init numa_initmem_init(unsigned long start_pfn, unsigned long end_pfn)
T
Thomas Gleixner 已提交
507
{
L
Linus Torvalds 已提交
508 509
	int i;

510 511
	nodes_clear(node_possible_map);

L
Linus Torvalds 已提交
512
#ifdef CONFIG_NUMA_EMU
513
	if (cmdline && !numa_emulation(start_pfn, end_pfn))
T
Thomas Gleixner 已提交
514
		return;
515
	nodes_clear(node_possible_map);
L
Linus Torvalds 已提交
516 517 518 519 520
#endif

#ifdef CONFIG_ACPI_NUMA
	if (!numa_off && !acpi_scan_nodes(start_pfn << PAGE_SHIFT,
					  end_pfn << PAGE_SHIFT))
T
Thomas Gleixner 已提交
521
		return;
522
	nodes_clear(node_possible_map);
L
Linus Torvalds 已提交
523 524 525
#endif

#ifdef CONFIG_K8_NUMA
T
Thomas Gleixner 已提交
526 527
	if (!numa_off && !k8_scan_nodes(start_pfn<<PAGE_SHIFT,
					end_pfn<<PAGE_SHIFT))
L
Linus Torvalds 已提交
528
		return;
529
	nodes_clear(node_possible_map);
L
Linus Torvalds 已提交
530 531 532 533
#endif
	printk(KERN_INFO "%s\n",
	       numa_off ? "NUMA turned off" : "No NUMA configuration found");

T
Thomas Gleixner 已提交
534
	printk(KERN_INFO "Faking a node at %016lx-%016lx\n",
L
Linus Torvalds 已提交
535
	       start_pfn << PAGE_SHIFT,
T
Thomas Gleixner 已提交
536 537 538
	       end_pfn << PAGE_SHIFT);
	/* setup dummy node covering all memory */
	memnode_shift = 63;
539
	memnodemap = memnode.embedded_map;
L
Linus Torvalds 已提交
540 541 542
	memnodemap[0] = 0;
	nodes_clear(node_online_map);
	node_set_online(0);
543
	node_set(0, node_possible_map);
L
Linus Torvalds 已提交
544
	for (i = 0; i < NR_CPUS; i++)
545
		numa_set_node(i, 0);
T
Thomas Gleixner 已提交
546
	node_to_cpumask_map[0] = cpumask_of_cpu(0);
547
	e820_register_active_regions(0, start_pfn, end_pfn);
L
Linus Torvalds 已提交
548 549 550
	setup_node_bootmem(0, start_pfn << PAGE_SHIFT, end_pfn << PAGE_SHIFT);
}

551
__cpuinit void numa_add_cpu(int cpu)
L
Linus Torvalds 已提交
552
{
553
	set_bit(cpu, (unsigned long *)&node_to_cpumask_map[cpu_to_node(cpu)]);
T
Thomas Gleixner 已提交
554
}
L
Linus Torvalds 已提交
555

556 557
void __cpuinit numa_set_node(int cpu, int node)
{
558
	cpu_pda(cpu)->nodenumber = node;
T
Thomas Gleixner 已提交
559
	cpu_to_node_map[cpu] = node;
560 561
}

T
Thomas Gleixner 已提交
562 563
unsigned long __init numa_free_all_bootmem(void)
{
L
Linus Torvalds 已提交
564
	unsigned long pages = 0;
T
Thomas Gleixner 已提交
565 566 567
	int i;

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

L
Linus Torvalds 已提交
570
	return pages;
T
Thomas Gleixner 已提交
571
}
L
Linus Torvalds 已提交
572 573

void __init paging_init(void)
T
Thomas Gleixner 已提交
574
{
575
	unsigned long max_zone_pfns[MAX_NR_ZONES];
T
Thomas Gleixner 已提交
576 577
	int i;

578 579 580 581
	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;
	max_zone_pfns[ZONE_NORMAL] = end_pfn;
B
Bob Picco 已提交
582

583 584
	sparse_memory_present_with_active_regions(MAX_NUMNODES);
	sparse_init();
B
Bob Picco 已提交
585

T
Thomas Gleixner 已提交
586
	for_each_online_node(i)
587
		flat_setup_node_zones(i);
588 589

	free_area_init_nodes(max_zone_pfns);
T
Thomas Gleixner 已提交
590
}
L
Linus Torvalds 已提交
591

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

612 613 614 615 616 617 618 619 620 621 622 623 624 625 626
/*
 * 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.
 */
void __init init_cpu_to_node(void)
{
	int i;
T
Thomas Gleixner 已提交
627 628

	for (i = 0; i < NR_CPUS; i++) {
629
		u8 apicid = x86_cpu_to_apicid_init[i];
T
Thomas Gleixner 已提交
630

631 632 633 634
		if (apicid == BAD_APICID)
			continue;
		if (apicid_to_node[apicid] == NUMA_NO_NODE)
			continue;
T
Thomas Gleixner 已提交
635
		numa_set_node(i, apicid_to_node[apicid]);
636 637 638
	}
}

639