blob: 5039e9b21d9e3ae94aa11a772c2c525c18ca5e8b [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Written by: Patricia Gaughen <gone@us.ibm.com>, IBM Corporation
3 * August 2002: added remote node KVA remap - Martin J. Bligh
4 *
5 * Copyright (C) 2002, IBM Corp.
6 *
7 * All rights reserved.
8 *
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
17 * NON INFRINGEMENT. See the GNU General Public License for more
18 * details.
19 *
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
23 */
24
Linus Torvalds1da177e2005-04-16 15:20:36 -070025#include <linux/mm.h>
26#include <linux/bootmem.h>
Yinghai Lua9ce6bc2010-08-25 13:39:17 -070027#include <linux/memblock.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070028#include <linux/mmzone.h>
29#include <linux/highmem.h>
30#include <linux/initrd.h>
31#include <linux/nodemask.h>
Alexey Dobriyan129f6942005-06-23 00:08:33 -070032#include <linux/module.h>
Eric W. Biederman1bc3b912005-06-25 14:58:01 -070033#include <linux/kexec.h>
Dave Hansen22a98352006-03-27 01:16:04 -080034#include <linux/pfn.h>
Linus Torvalds28aa4832007-05-15 18:45:49 -070035#include <linux/swap.h>
Mel Gorman1b000a52008-01-30 13:33:25 +010036#include <linux/acpi.h>
Eric W. Biederman1bc3b912005-06-25 14:58:01 -070037
Linus Torvalds1da177e2005-04-16 15:20:36 -070038#include <asm/e820.h>
39#include <asm/setup.h>
40#include <asm/mmzone.h>
Alexey Starikovskiyce3fe6b2008-03-17 22:08:17 +030041#include <asm/bios_ebda.h>
Yinghai Lu287572c2008-06-01 21:06:31 -070042#include <asm/proto.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070043
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070044struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
Alexey Dobriyan129f6942005-06-23 00:08:33 -070045EXPORT_SYMBOL(node_data);
Linus Torvalds1da177e2005-04-16 15:20:36 -070046
47/*
Adrian Bunkd254c8f2006-06-30 18:29:51 +020048 * numa interface - we expect the numa architecture specific code to have
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 * populated the following initialisation.
50 *
51 * 1) node_online_map - the map of all nodes configured (online) in the system
Andy Whitcroft05b79bd2005-06-23 00:07:57 -070052 * 2) node_start_pfn - the starting page frame number for a node
Linus Torvalds1da177e2005-04-16 15:20:36 -070053 * 3) node_end_pfn - the ending page fram number for a node
54 */
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070055unsigned long node_start_pfn[MAX_NUMNODES] __read_mostly;
56unsigned long node_end_pfn[MAX_NUMNODES] __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070057
Andy Whitcroft05b79bd2005-06-23 00:07:57 -070058
59#ifdef CONFIG_DISCONTIGMEM
Linus Torvalds1da177e2005-04-16 15:20:36 -070060/*
Andy Whitcroft05b79bd2005-06-23 00:07:57 -070061 * 4) physnode_map - the mapping between a pfn and owning node
Linus Torvalds1da177e2005-04-16 15:20:36 -070062 * physnode_map keeps track of the physical memory layout of a generic
Yinghai Luba924c82008-05-31 22:51:51 -070063 * numa node on a 64Mb break (each element of the array will
64 * represent 64Mb of memory and will be marked by the node id. so,
Linus Torvalds1da177e2005-04-16 15:20:36 -070065 * if the first gig is on node 0, and the second gig is on node 1
66 * physnode_map will contain:
67 *
Yinghai Luba924c82008-05-31 22:51:51 -070068 * physnode_map[0-15] = 0;
69 * physnode_map[16-31] = 1;
70 * physnode_map[32- ] = -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070071 */
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070072s8 physnode_map[MAX_ELEMENTS] __read_mostly = { [0 ... (MAX_ELEMENTS - 1)] = -1};
Alexey Dobriyan129f6942005-06-23 00:08:33 -070073EXPORT_SYMBOL(physnode_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -070074
75void memory_present(int nid, unsigned long start, unsigned long end)
76{
77 unsigned long pfn;
78
Yinghai Luc0943452008-06-23 16:41:30 -070079 printk(KERN_INFO "Node: %d, start_pfn: %lx, end_pfn: %lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -070080 nid, start, end);
81 printk(KERN_DEBUG " Setting physnode_map array to node %d for pfns:\n", nid);
82 printk(KERN_DEBUG " ");
83 for (pfn = start; pfn < end; pfn += PAGES_PER_ELEMENT) {
84 physnode_map[pfn / PAGES_PER_ELEMENT] = nid;
Yinghai Luc0943452008-06-23 16:41:30 -070085 printk(KERN_CONT "%lx ", pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -070086 }
Yinghai Luba924c82008-05-31 22:51:51 -070087 printk(KERN_CONT "\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -070088}
89
90unsigned long node_memmap_size_bytes(int nid, unsigned long start_pfn,
91 unsigned long end_pfn)
92{
93 unsigned long nr_pages = end_pfn - start_pfn;
94
95 if (!nr_pages)
96 return 0;
97
98 return (nr_pages + 1) * sizeof(struct page);
99}
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700100#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101
102extern unsigned long find_max_low_pfn(void);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103extern unsigned long highend_pfn, highstart_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104
105#define LARGE_PAGE_BYTES (PTRS_PER_PTE * PAGE_SIZE)
106
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107unsigned long node_remap_size[MAX_NUMNODES];
Adrian Bunk59659f12007-10-17 18:04:36 +0200108static void *node_remap_start_vaddr[MAX_NUMNODES];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109void set_pmd_pfn(unsigned long vaddr, unsigned long pfn, pgprot_t flags);
110
keith mannthey91023302006-09-25 23:31:03 -0700111static unsigned long kva_start_pfn;
112static unsigned long kva_pages;
Tejun Heobbc9e2f2011-01-23 14:37:39 +0100113
114int __cpuinit numa_cpu_node(int cpu)
115{
116 return apic->x86_32_numa_cpu_node(cpu);
117}
118
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119/*
120 * FLAT - support for basic PC memory model with discontig enabled, essentially
121 * a single node with all available processors in it with a flat
122 * memory map.
123 */
124int __init get_memcfg_numa_flat(void)
125{
Yinghai Luc0943452008-06-23 16:41:30 -0700126 printk(KERN_DEBUG "NUMA - single node, flat memory mode\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 node_start_pfn[0] = 0;
129 node_end_pfn[0] = max_pfn;
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700130 memblock_x86_register_active_regions(0, 0, max_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 memory_present(0, 0, max_pfn);
Yinghai Lub66cd722008-05-31 22:53:47 -0700132 node_remap_size[0] = node_memmap_size_bytes(0, 0, max_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133
134 /* Indicate there is one node available. */
135 nodes_clear(node_online_map);
136 node_set_online(0);
137 return 1;
138}
139
140/*
141 * Find the highest page frame number we have available for the node
142 */
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200143static void __init propagate_e820_map_node(int nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144{
145 if (node_end_pfn[nid] > max_pfn)
146 node_end_pfn[nid] = max_pfn;
147 /*
148 * if a user has given mem=XXXX, then we need to make sure
149 * that the node _starts_ before that, too, not just ends
150 */
151 if (node_start_pfn[nid] > max_pfn)
152 node_start_pfn[nid] = max_pfn;
Eric Sesterhenn8d8f3cb2006-10-03 23:34:58 +0200153 BUG_ON(node_start_pfn[nid] > node_end_pfn[nid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154}
155
Linus Torvalds1da177e2005-04-16 15:20:36 -0700156/*
157 * Allocate memory for the pg_data_t for this node via a crude pre-bootmem
158 * method. For node zero take this from the bottom of memory, for
159 * subsequent nodes place them at node_remap_start_vaddr which contains
160 * node local data in physically node local memory. See setup_memory()
161 * for details.
162 */
163static void __init allocate_pgdat(int nid)
164{
Yinghai Lu996cf442008-06-30 18:34:58 -0700165 char buf[16];
166
167 if (node_has_online_mem(nid) && node_remap_start_vaddr[nid])
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168 NODE_DATA(nid) = (pg_data_t *)node_remap_start_vaddr[nid];
169 else {
Yinghai Lu16387292008-05-29 12:57:22 -0700170 unsigned long pgdat_phys;
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700171 pgdat_phys = memblock_find_in_range(min_low_pfn<<PAGE_SHIFT,
Yinghai Lu996cf442008-06-30 18:34:58 -0700172 max_pfn_mapped<<PAGE_SHIFT,
Yinghai Lu6af61a72008-06-01 23:53:50 -0700173 sizeof(pg_data_t),
Yinghai Lu16387292008-05-29 12:57:22 -0700174 PAGE_SIZE);
175 NODE_DATA(nid) = (pg_data_t *)(pfn_to_kaddr(pgdat_phys>>PAGE_SHIFT));
Yinghai Lu996cf442008-06-30 18:34:58 -0700176 memset(buf, 0, sizeof(buf));
177 sprintf(buf, "NODE_DATA %d", nid);
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700178 memblock_x86_reserve_range(pgdat_phys, pgdat_phys + sizeof(pg_data_t), buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 }
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700180 printk(KERN_DEBUG "allocate_pgdat: node %d NODE_DATA %08lx\n",
181 nid, (unsigned long)NODE_DATA(nid));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182}
183
Mel Gorman1b000a52008-01-30 13:33:25 +0100184/*
Andy Whitcroftb9ada422008-05-20 11:01:08 +0100185 * In the DISCONTIGMEM and SPARSEMEM memory model, a portion of the kernel
186 * virtual address space (KVA) is reserved and portions of nodes are mapped
187 * using it. This is to allow node-local memory to be allocated for
188 * structures that would normally require ZONE_NORMAL. The memory is
189 * allocated with alloc_remap() and callers should be prepared to allocate
190 * from the bootmem allocator instead.
Mel Gorman1b000a52008-01-30 13:33:25 +0100191 */
192static unsigned long node_remap_start_pfn[MAX_NUMNODES];
193static void *node_remap_end_vaddr[MAX_NUMNODES];
194static void *node_remap_alloc_vaddr[MAX_NUMNODES];
195static unsigned long node_remap_offset[MAX_NUMNODES];
196
Dave Hansen6f167ec2005-06-23 00:07:39 -0700197void *alloc_remap(int nid, unsigned long size)
198{
199 void *allocation = node_remap_alloc_vaddr[nid];
200
201 size = ALIGN(size, L1_CACHE_BYTES);
202
Tejun Heo3fe14ab2011-04-05 00:23:47 +0200203 if (!allocation || (allocation + size) > node_remap_end_vaddr[nid])
Hannes Eder2366c292009-02-22 01:01:13 +0100204 return NULL;
Dave Hansen6f167ec2005-06-23 00:07:39 -0700205
206 node_remap_alloc_vaddr[nid] += size;
207 memset(allocation, 0, size);
208
209 return allocation;
210}
211
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700212static void __init remap_numa_kva(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213{
214 void *vaddr;
215 unsigned long pfn;
216 int node;
217
218 for_each_online_node(node) {
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700219 printk(KERN_DEBUG "remap_numa_kva: node %d\n", node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220 for (pfn=0; pfn < node_remap_size[node]; pfn += PTRS_PER_PTE) {
221 vaddr = node_remap_start_vaddr[node]+(pfn<<PAGE_SHIFT);
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700222 printk(KERN_DEBUG "remap_numa_kva: %08lx to pfn %08lx\n",
223 (unsigned long)vaddr,
224 node_remap_start_pfn[node] + pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 set_pmd_pfn((ulong) vaddr,
226 node_remap_start_pfn[node] + pfn,
227 PAGE_KERNEL_LARGE);
228 }
229 }
230}
231
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100232#ifdef CONFIG_HIBERNATION
233/**
234 * resume_map_numa_kva - add KVA mapping to the temporary page tables created
235 * during resume from hibernation
236 * @pgd_base - temporary resume page directory
237 */
238void resume_map_numa_kva(pgd_t *pgd_base)
239{
240 int node;
241
242 for_each_online_node(node) {
243 unsigned long start_va, start_pfn, size, pfn;
244
245 start_va = (unsigned long)node_remap_start_vaddr[node];
246 start_pfn = node_remap_start_pfn[node];
247 size = node_remap_size[node];
248
Harvey Harrison9b4778f2009-01-07 14:42:41 -0800249 printk(KERN_DEBUG "%s: node %d\n", __func__, node);
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100250
251 for (pfn = 0; pfn < size; pfn += PTRS_PER_PTE) {
252 unsigned long vaddr = start_va + (pfn << PAGE_SHIFT);
253 pgd_t *pgd = pgd_base + pgd_index(vaddr);
254 pud_t *pud = pud_offset(pgd, vaddr);
255 pmd_t *pmd = pmd_offset(pud, vaddr);
256
257 set_pmd(pmd, pfn_pmd(start_pfn + pfn,
258 PAGE_KERNEL_LARGE_EXEC));
259
260 printk(KERN_DEBUG "%s: %08lx -> pfn %08lx\n",
Harvey Harrison9b4778f2009-01-07 14:42:41 -0800261 __func__, vaddr, start_pfn + pfn);
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100262 }
263 }
264}
265#endif
266
Tejun Heo5510db92011-04-05 00:23:50 +0200267static __init unsigned long init_alloc_remap(int nid, unsigned long offset)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268{
Tejun Heo5510db92011-04-05 00:23:50 +0200269 unsigned long size;
270 u64 node_kva;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271
Tejun Heo5510db92011-04-05 00:23:50 +0200272 /*
273 * The acpi/srat node info can show hot-add memroy zones where
274 * memory could be added but not currently present.
275 */
276 printk(KERN_DEBUG "node %d pfn: [%lx - %lx]\n",
277 nid, node_start_pfn[nid], node_end_pfn[nid]);
278 if (node_start_pfn[nid] > max_pfn)
279 return 0;
280 if (!node_end_pfn[nid])
281 return 0;
282 if (node_end_pfn[nid] > max_pfn)
283 node_end_pfn[nid] = max_pfn;
Mel Gorman4cfee882006-09-27 01:49:51 -0700284
Tejun Heo5510db92011-04-05 00:23:50 +0200285 /* ensure the remap includes space for the pgdat. */
286 size = node_remap_size[nid];
287 size += ALIGN(sizeof(pg_data_t), PAGE_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288
Tejun Heo5510db92011-04-05 00:23:50 +0200289 /* convert size to large (pmd size) pages, rounding up */
290 size = (size + LARGE_PAGE_BYTES - 1) / LARGE_PAGE_BYTES;
291 /* now the roundup is correct, convert to PAGE_SIZE pages */
292 size = size * PTRS_PER_PTE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293
Tejun Heo5510db92011-04-05 00:23:50 +0200294 node_kva = memblock_find_in_range(node_start_pfn[nid] << PAGE_SHIFT,
295 (u64)node_end_pfn[nid] << PAGE_SHIFT,
296 (u64)size << PAGE_SHIFT,
297 LARGE_PAGE_BYTES);
298 if (node_kva == MEMBLOCK_ERROR)
299 panic("Can not get kva ram\n");
Dave Hansen5b505b92005-06-23 00:07:41 -0700300
Tejun Heo5510db92011-04-05 00:23:50 +0200301 node_remap_size[nid] = size;
302 node_remap_offset[nid] = offset;
303 printk(KERN_DEBUG "Reserving %ld pages of KVA for lmem_map of node %d at %llx\n",
304 size, nid, node_kva >> PAGE_SHIFT);
Dave Hansen5b505b92005-06-23 00:07:41 -0700305
Tejun Heo5510db92011-04-05 00:23:50 +0200306 /*
307 * prevent kva address below max_low_pfn want it on system
308 * with less memory later.
309 * layout will be: KVA address , KVA RAM
310 *
311 * we are supposed to only record the one less then
312 * max_low_pfn but we could have some hole in high memory,
313 * and it will only check page_is_ram(pfn) &&
314 * !page_is_reserved_early(pfn) to decide to use it as free.
315 * So memblock_x86_reserve_range here, hope we don't run out
316 * of that array
317 */
318 memblock_x86_reserve_range(node_kva,
319 node_kva + ((u64)size << PAGE_SHIFT),
320 "KVA RAM");
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700321
Tejun Heo5510db92011-04-05 00:23:50 +0200322 node_remap_start_pfn[nid] = node_kva >> PAGE_SHIFT;
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700323
Tejun Heo5510db92011-04-05 00:23:50 +0200324 return size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325}
326
Mel Gorman1b000a52008-01-30 13:33:25 +0100327static void init_remap_allocator(int nid)
328{
329 node_remap_start_vaddr[nid] = pfn_to_kaddr(
330 kva_start_pfn + node_remap_offset[nid]);
331 node_remap_end_vaddr[nid] = node_remap_start_vaddr[nid] +
332 (node_remap_size[nid] * PAGE_SIZE);
333 node_remap_alloc_vaddr[nid] = node_remap_start_vaddr[nid] +
334 ALIGN(sizeof(pg_data_t), PAGE_SIZE);
335
Yinghai Luc0943452008-06-23 16:41:30 -0700336 printk(KERN_DEBUG "node %d will remap to vaddr %08lx - %08lx\n", nid,
Mel Gorman1b000a52008-01-30 13:33:25 +0100337 (ulong) node_remap_start_vaddr[nid],
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700338 (ulong) node_remap_end_vaddr[nid]);
Mel Gorman1b000a52008-01-30 13:33:25 +0100339}
Mel Gorman1b000a52008-01-30 13:33:25 +0100340
Tejun Heod8fc3af2011-02-16 12:13:06 +0100341void __init initmem_init(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342{
Tejun Heo5510db92011-04-05 00:23:50 +0200343 unsigned long reserve_pages = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344 int nid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345
346 /*
347 * When mapping a NUMA machine we allocate the node_mem_map arrays
348 * from node local memory. They are then mapped directly into KVA
349 * between zone normal and vmalloc space. Calculate the size of
Simon Arlott27b46d72007-10-20 01:13:56 +0200350 * this space and use it to adjust the boundary between ZONE_NORMAL
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 * and ZONE_HIGHMEM.
352 */
Yinghai Lu7b2a0a62008-06-03 19:35:04 -0700353
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354 get_memcfg_numa();
Tejun Heo8db78cc2011-01-23 14:37:42 +0100355 numa_init_array();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356
Tejun Heo5510db92011-04-05 00:23:50 +0200357 for_each_online_node(nid)
358 reserve_pages += init_alloc_remap(nid, reserve_pages);
359 kva_pages = roundup(reserve_pages, PTRS_PER_PTE);
360 printk(KERN_INFO "Reserving total of %lx pages for numa KVA remap\n",
361 reserve_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700362
Tejun Heo5b8443b2011-04-05 00:23:49 +0200363 kva_start_pfn = memblock_find_in_range(min_low_pfn << PAGE_SHIFT,
364 max_low_pfn << PAGE_SHIFT,
365 kva_pages << PAGE_SHIFT,
366 PTRS_PER_PTE << PAGE_SHIFT) >> PAGE_SHIFT;
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700367 if (kva_start_pfn == MEMBLOCK_ERROR)
Yinghai Lu84b56fa2008-06-03 19:32:30 -0700368 panic("Can not get kva space\n");
Mel Gormanbac48942008-01-30 13:32:54 +0100369
Yinghai Luc0943452008-06-23 16:41:30 -0700370 printk(KERN_INFO "kva_start_pfn ~ %lx max_low_pfn ~ %lx\n",
keith mannthey91023302006-09-25 23:31:03 -0700371 kva_start_pfn, max_low_pfn);
Yinghai Luc0943452008-06-23 16:41:30 -0700372 printk(KERN_INFO "max_pfn = %lx\n", max_pfn);
Yinghai Lua5481282008-05-29 12:58:37 -0700373
374 /* avoid clash with initrd */
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700375 memblock_x86_reserve_range(kva_start_pfn<<PAGE_SHIFT,
Yinghai Lua5481282008-05-29 12:58:37 -0700376 (kva_start_pfn + kva_pages)<<PAGE_SHIFT,
377 "KVA PG");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378#ifdef CONFIG_HIGHMEM
379 highstart_pfn = highend_pfn = max_pfn;
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700380 if (max_pfn > max_low_pfn)
381 highstart_pfn = max_low_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382 printk(KERN_NOTICE "%ldMB HIGHMEM available.\n",
383 pages_to_mb(highend_pfn - highstart_pfn));
Jan Beulichba9c2312006-09-26 10:52:31 +0200384 num_physpages = highend_pfn;
385 high_memory = (void *) __va(highstart_pfn * PAGE_SIZE - 1) + 1;
386#else
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700387 num_physpages = max_low_pfn;
388 high_memory = (void *) __va(max_low_pfn * PAGE_SIZE - 1) + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389#endif
390 printk(KERN_NOTICE "%ldMB LOWMEM available.\n",
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700391 pages_to_mb(max_low_pfn));
Yinghai Luc0943452008-06-23 16:41:30 -0700392 printk(KERN_DEBUG "max_low_pfn = %lx, highstart_pfn = %lx\n",
393 max_low_pfn, highstart_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394
Yinghai Luc0943452008-06-23 16:41:30 -0700395 printk(KERN_DEBUG "Low memory ends at vaddr %08lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396 (ulong) pfn_to_kaddr(max_low_pfn));
397 for_each_online_node(nid) {
Mel Gorman1b000a52008-01-30 13:33:25 +0100398 init_remap_allocator(nid);
Dave Hansen6f167ec2005-06-23 00:07:39 -0700399
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400 allocate_pgdat(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401 }
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700402 remap_numa_kva();
403
Yinghai Luc0943452008-06-23 16:41:30 -0700404 printk(KERN_DEBUG "High memory starts at vaddr %08lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405 (ulong) pfn_to_kaddr(highstart_pfn));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406 for_each_online_node(nid)
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200407 propagate_e820_map_node(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408
Yinghai Lua71edd12009-03-04 01:22:35 -0800409 for_each_online_node(nid) {
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700410 memset(NODE_DATA(nid), 0, sizeof(struct pglist_data));
Yinghai Lu59be5a82010-02-10 01:20:28 -0800411 NODE_DATA(nid)->node_id = nid;
Yinghai Lua71edd12009-03-04 01:22:35 -0800412 }
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700413
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 setup_bootmem_allocator();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415}
416
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800417#ifdef CONFIG_MEMORY_HOTPLUG
Adrian Bunkfb8c1772007-10-24 18:24:47 +0200418static int paddr_to_nid(u64 addr)
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800419{
420 int nid;
421 unsigned long pfn = PFN_DOWN(addr);
422
423 for_each_node(nid)
424 if (node_start_pfn[nid] <= pfn &&
425 pfn < node_end_pfn[nid])
426 return nid;
427
428 return -1;
429}
430
431/*
432 * This function is used to ask node id BEFORE memmap and mem_section's
433 * initialization (pfn_to_nid() can't be used yet).
434 * If _PXM is not defined on ACPI's DSDT, node id must be found by this.
435 */
436int memory_add_physaddr_to_nid(u64 addr)
437{
438 int nid = paddr_to_nid(addr);
439 return (nid >= 0) ? nid : 0;
440}
441
442EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
443#endif
Ingo Molnar2772f542008-06-03 10:09:45 +0200444