blob: d2530062fe003ee6f28127369ae4f22878329765 [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>
27#include <linux/mmzone.h>
28#include <linux/highmem.h>
29#include <linux/initrd.h>
30#include <linux/nodemask.h>
Alexey Dobriyan129f6942005-06-23 00:08:33 -070031#include <linux/module.h>
Eric W. Biederman1bc3b912005-06-25 14:58:01 -070032#include <linux/kexec.h>
Dave Hansen22a98352006-03-27 01:16:04 -080033#include <linux/pfn.h>
Linus Torvalds28aa4832007-05-15 18:45:49 -070034#include <linux/swap.h>
Mel Gorman1b000a52008-01-30 13:33:25 +010035#include <linux/acpi.h>
Eric W. Biederman1bc3b912005-06-25 14:58:01 -070036
Linus Torvalds1da177e2005-04-16 15:20:36 -070037#include <asm/e820.h>
38#include <asm/setup.h>
39#include <asm/mmzone.h>
Alexey Starikovskiyce3fe6b2008-03-17 22:08:17 +030040#include <asm/bios_ebda.h>
Yinghai Lu287572c2008-06-01 21:06:31 -070041#include <asm/proto.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070042
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070043struct pglist_data *node_data[MAX_NUMNODES] __read_mostly;
Alexey Dobriyan129f6942005-06-23 00:08:33 -070044EXPORT_SYMBOL(node_data);
Linus Torvalds1da177e2005-04-16 15:20:36 -070045
46/*
Adrian Bunkd254c8f2006-06-30 18:29:51 +020047 * numa interface - we expect the numa architecture specific code to have
Linus Torvalds1da177e2005-04-16 15:20:36 -070048 * populated the following initialisation.
49 *
50 * 1) node_online_map - the map of all nodes configured (online) in the system
Andy Whitcroft05b79bd2005-06-23 00:07:57 -070051 * 2) node_start_pfn - the starting page frame number for a node
Linus Torvalds1da177e2005-04-16 15:20:36 -070052 * 3) node_end_pfn - the ending page fram number for a node
53 */
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070054unsigned long node_start_pfn[MAX_NUMNODES] __read_mostly;
55unsigned long node_end_pfn[MAX_NUMNODES] __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070056
Andy Whitcroft05b79bd2005-06-23 00:07:57 -070057
58#ifdef CONFIG_DISCONTIGMEM
Linus Torvalds1da177e2005-04-16 15:20:36 -070059/*
Andy Whitcroft05b79bd2005-06-23 00:07:57 -070060 * 4) physnode_map - the mapping between a pfn and owning node
Linus Torvalds1da177e2005-04-16 15:20:36 -070061 * physnode_map keeps track of the physical memory layout of a generic
Yinghai Luba924c82008-05-31 22:51:51 -070062 * numa node on a 64Mb break (each element of the array will
63 * represent 64Mb of memory and will be marked by the node id. so,
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 * if the first gig is on node 0, and the second gig is on node 1
65 * physnode_map will contain:
66 *
Yinghai Luba924c82008-05-31 22:51:51 -070067 * physnode_map[0-15] = 0;
68 * physnode_map[16-31] = 1;
69 * physnode_map[32- ] = -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070070 */
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070071s8 physnode_map[MAX_ELEMENTS] __read_mostly = { [0 ... (MAX_ELEMENTS - 1)] = -1};
Alexey Dobriyan129f6942005-06-23 00:08:33 -070072EXPORT_SYMBOL(physnode_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -070073
74void memory_present(int nid, unsigned long start, unsigned long end)
75{
76 unsigned long pfn;
77
Yinghai Luc0943452008-06-23 16:41:30 -070078 printk(KERN_INFO "Node: %d, start_pfn: %lx, end_pfn: %lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 nid, start, end);
80 printk(KERN_DEBUG " Setting physnode_map array to node %d for pfns:\n", nid);
81 printk(KERN_DEBUG " ");
82 for (pfn = start; pfn < end; pfn += PAGES_PER_ELEMENT) {
83 physnode_map[pfn / PAGES_PER_ELEMENT] = nid;
Yinghai Luc0943452008-06-23 16:41:30 -070084 printk(KERN_CONT "%lx ", pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -070085 }
Yinghai Luba924c82008-05-31 22:51:51 -070086 printk(KERN_CONT "\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -070087}
88
89unsigned long node_memmap_size_bytes(int nid, unsigned long start_pfn,
90 unsigned long end_pfn)
91{
92 unsigned long nr_pages = end_pfn - start_pfn;
93
94 if (!nr_pages)
95 return 0;
96
97 return (nr_pages + 1) * sizeof(struct page);
98}
Andy Whitcroft05b79bd2005-06-23 00:07:57 -070099#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100
101extern unsigned long find_max_low_pfn(void);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102extern unsigned long highend_pfn, highstart_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103
104#define LARGE_PAGE_BYTES (PTRS_PER_PTE * PAGE_SIZE)
105
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106unsigned long node_remap_size[MAX_NUMNODES];
Adrian Bunk59659f12007-10-17 18:04:36 +0200107static void *node_remap_start_vaddr[MAX_NUMNODES];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108void set_pmd_pfn(unsigned long vaddr, unsigned long pfn, pgprot_t flags);
109
keith mannthey91023302006-09-25 23:31:03 -0700110static unsigned long kva_start_pfn;
111static unsigned long kva_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112/*
113 * FLAT - support for basic PC memory model with discontig enabled, essentially
114 * a single node with all available processors in it with a flat
115 * memory map.
116 */
117int __init get_memcfg_numa_flat(void)
118{
Yinghai Luc0943452008-06-23 16:41:30 -0700119 printk(KERN_DEBUG "NUMA - single node, flat memory mode\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 node_start_pfn[0] = 0;
122 node_end_pfn[0] = max_pfn;
Yinghai Lu7b2a0a62008-06-03 19:35:04 -0700123 e820_register_active_regions(0, 0, max_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 memory_present(0, 0, max_pfn);
Yinghai Lub66cd722008-05-31 22:53:47 -0700125 node_remap_size[0] = node_memmap_size_bytes(0, 0, max_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126
127 /* Indicate there is one node available. */
128 nodes_clear(node_online_map);
129 node_set_online(0);
130 return 1;
131}
132
133/*
134 * Find the highest page frame number we have available for the node
135 */
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200136static void __init propagate_e820_map_node(int nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137{
138 if (node_end_pfn[nid] > max_pfn)
139 node_end_pfn[nid] = max_pfn;
140 /*
141 * if a user has given mem=XXXX, then we need to make sure
142 * that the node _starts_ before that, too, not just ends
143 */
144 if (node_start_pfn[nid] > max_pfn)
145 node_start_pfn[nid] = max_pfn;
Eric Sesterhenn8d8f3cb2006-10-03 23:34:58 +0200146 BUG_ON(node_start_pfn[nid] > node_end_pfn[nid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147}
148
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149/*
150 * Allocate memory for the pg_data_t for this node via a crude pre-bootmem
151 * method. For node zero take this from the bottom of memory, for
152 * subsequent nodes place them at node_remap_start_vaddr which contains
153 * node local data in physically node local memory. See setup_memory()
154 * for details.
155 */
156static void __init allocate_pgdat(int nid)
157{
Yinghai Lu996cf442008-06-30 18:34:58 -0700158 char buf[16];
159
160 if (node_has_online_mem(nid) && node_remap_start_vaddr[nid])
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161 NODE_DATA(nid) = (pg_data_t *)node_remap_start_vaddr[nid];
162 else {
Yinghai Lu16387292008-05-29 12:57:22 -0700163 unsigned long pgdat_phys;
164 pgdat_phys = find_e820_area(min_low_pfn<<PAGE_SHIFT,
Yinghai Lu996cf442008-06-30 18:34:58 -0700165 max_pfn_mapped<<PAGE_SHIFT,
Yinghai Lu6af61a72008-06-01 23:53:50 -0700166 sizeof(pg_data_t),
Yinghai Lu16387292008-05-29 12:57:22 -0700167 PAGE_SIZE);
168 NODE_DATA(nid) = (pg_data_t *)(pfn_to_kaddr(pgdat_phys>>PAGE_SHIFT));
Yinghai Lu996cf442008-06-30 18:34:58 -0700169 memset(buf, 0, sizeof(buf));
170 sprintf(buf, "NODE_DATA %d", nid);
171 reserve_early(pgdat_phys, pgdat_phys + sizeof(pg_data_t), buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 }
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700173 printk(KERN_DEBUG "allocate_pgdat: node %d NODE_DATA %08lx\n",
174 nid, (unsigned long)NODE_DATA(nid));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175}
176
Mel Gorman1b000a52008-01-30 13:33:25 +0100177/*
Andy Whitcroftb9ada422008-05-20 11:01:08 +0100178 * In the DISCONTIGMEM and SPARSEMEM memory model, a portion of the kernel
179 * virtual address space (KVA) is reserved and portions of nodes are mapped
180 * using it. This is to allow node-local memory to be allocated for
181 * structures that would normally require ZONE_NORMAL. The memory is
182 * allocated with alloc_remap() and callers should be prepared to allocate
183 * from the bootmem allocator instead.
Mel Gorman1b000a52008-01-30 13:33:25 +0100184 */
185static unsigned long node_remap_start_pfn[MAX_NUMNODES];
186static void *node_remap_end_vaddr[MAX_NUMNODES];
187static void *node_remap_alloc_vaddr[MAX_NUMNODES];
188static unsigned long node_remap_offset[MAX_NUMNODES];
189
Dave Hansen6f167ec2005-06-23 00:07:39 -0700190void *alloc_remap(int nid, unsigned long size)
191{
192 void *allocation = node_remap_alloc_vaddr[nid];
193
194 size = ALIGN(size, L1_CACHE_BYTES);
195
196 if (!allocation || (allocation + size) >= node_remap_end_vaddr[nid])
Hannes Eder2366c292009-02-22 01:01:13 +0100197 return NULL;
Dave Hansen6f167ec2005-06-23 00:07:39 -0700198
199 node_remap_alloc_vaddr[nid] += size;
200 memset(allocation, 0, size);
201
202 return allocation;
203}
204
Yinghai Lu3a58a2a2008-06-24 12:19:41 -0700205static void __init remap_numa_kva(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206{
207 void *vaddr;
208 unsigned long pfn;
209 int node;
210
211 for_each_online_node(node) {
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700212 printk(KERN_DEBUG "remap_numa_kva: node %d\n", node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 for (pfn=0; pfn < node_remap_size[node]; pfn += PTRS_PER_PTE) {
214 vaddr = node_remap_start_vaddr[node]+(pfn<<PAGE_SHIFT);
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700215 printk(KERN_DEBUG "remap_numa_kva: %08lx to pfn %08lx\n",
216 (unsigned long)vaddr,
217 node_remap_start_pfn[node] + pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 set_pmd_pfn((ulong) vaddr,
219 node_remap_start_pfn[node] + pfn,
220 PAGE_KERNEL_LARGE);
221 }
222 }
223}
224
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100225#ifdef CONFIG_HIBERNATION
226/**
227 * resume_map_numa_kva - add KVA mapping to the temporary page tables created
228 * during resume from hibernation
229 * @pgd_base - temporary resume page directory
230 */
231void resume_map_numa_kva(pgd_t *pgd_base)
232{
233 int node;
234
235 for_each_online_node(node) {
236 unsigned long start_va, start_pfn, size, pfn;
237
238 start_va = (unsigned long)node_remap_start_vaddr[node];
239 start_pfn = node_remap_start_pfn[node];
240 size = node_remap_size[node];
241
Harvey Harrison9b4778f2009-01-07 14:42:41 -0800242 printk(KERN_DEBUG "%s: node %d\n", __func__, node);
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100243
244 for (pfn = 0; pfn < size; pfn += PTRS_PER_PTE) {
245 unsigned long vaddr = start_va + (pfn << PAGE_SHIFT);
246 pgd_t *pgd = pgd_base + pgd_index(vaddr);
247 pud_t *pud = pud_offset(pgd, vaddr);
248 pmd_t *pmd = pmd_offset(pud, vaddr);
249
250 set_pmd(pmd, pfn_pmd(start_pfn + pfn,
251 PAGE_KERNEL_LARGE_EXEC));
252
253 printk(KERN_DEBUG "%s: %08lx -> pfn %08lx\n",
Harvey Harrison9b4778f2009-01-07 14:42:41 -0800254 __func__, vaddr, start_pfn + pfn);
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100255 }
256 }
257}
258#endif
259
Jaswinder Singh Rajputa81b6312009-04-17 23:31:20 +0530260static __init unsigned long calculate_numa_remap_pages(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261{
262 int nid;
263 unsigned long size, reserve_pages = 0;
264
265 for_each_online_node(nid) {
Yinghai Lucc1050b2008-06-13 19:08:52 -0700266 u64 node_kva_target;
267 u64 node_kva_final;
Mel Gorman4cfee882006-09-27 01:49:51 -0700268
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269 /*
270 * The acpi/srat node info can show hot-add memroy zones
271 * where memory could be added but not currently present.
272 */
Yinghai Luc0943452008-06-23 16:41:30 -0700273 printk(KERN_DEBUG "node %d pfn: [%lx - %lx]\n",
Yinghai Lu9043f002008-06-06 18:53:33 -0700274 nid, node_start_pfn[nid], node_end_pfn[nid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 if (node_start_pfn[nid] > max_pfn)
276 continue;
Yinghai Lu9043f002008-06-06 18:53:33 -0700277 if (!node_end_pfn[nid])
278 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 if (node_end_pfn[nid] > max_pfn)
280 node_end_pfn[nid] = max_pfn;
281
282 /* ensure the remap includes space for the pgdat. */
283 size = node_remap_size[nid] + sizeof(pg_data_t);
284
285 /* convert size to large (pmd size) pages, rounding up */
286 size = (size + LARGE_PAGE_BYTES - 1) / LARGE_PAGE_BYTES;
287 /* now the roundup is correct, convert to PAGE_SIZE pages */
288 size = size * PTRS_PER_PTE;
Dave Hansen5b505b92005-06-23 00:07:41 -0700289
Yinghai Lucc1050b2008-06-13 19:08:52 -0700290 node_kva_target = round_down(node_end_pfn[nid] - size,
Yinghai Lu9043f002008-06-06 18:53:33 -0700291 PTRS_PER_PTE);
Yinghai Lucc1050b2008-06-13 19:08:52 -0700292 node_kva_target <<= PAGE_SHIFT;
Yinghai Lu9043f002008-06-06 18:53:33 -0700293 do {
Yinghai Lucc1050b2008-06-13 19:08:52 -0700294 node_kva_final = find_e820_area(node_kva_target,
Yinghai Lu9043f002008-06-06 18:53:33 -0700295 ((u64)node_end_pfn[nid])<<PAGE_SHIFT,
296 ((u64)size)<<PAGE_SHIFT,
297 LARGE_PAGE_BYTES);
Yinghai Lucc1050b2008-06-13 19:08:52 -0700298 node_kva_target -= LARGE_PAGE_BYTES;
299 } while (node_kva_final == -1ULL &&
300 (node_kva_target>>PAGE_SHIFT) > (node_start_pfn[nid]));
Dave Hansen5b505b92005-06-23 00:07:41 -0700301
Yinghai Lucc1050b2008-06-13 19:08:52 -0700302 if (node_kva_final == -1ULL)
Yinghai Lu9043f002008-06-06 18:53:33 -0700303 panic("Can not get kva ram\n");
Dave Hansen5b505b92005-06-23 00:07:41 -0700304
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305 node_remap_size[nid] = size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 node_remap_offset[nid] = reserve_pages;
Dave Hansen6f167ec2005-06-23 00:07:39 -0700307 reserve_pages += size;
Yinghai Luc0943452008-06-23 16:41:30 -0700308 printk(KERN_DEBUG "Reserving %ld pages of KVA for lmem_map of"
309 " node %d at %llx\n",
Yinghai Lucc1050b2008-06-13 19:08:52 -0700310 size, nid, node_kva_final>>PAGE_SHIFT);
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700311
Yinghai Lu9043f002008-06-06 18:53:33 -0700312 /*
313 * prevent kva address below max_low_pfn want it on system
314 * with less memory later.
315 * layout will be: KVA address , KVA RAM
Yinghai Lucc1050b2008-06-13 19:08:52 -0700316 *
317 * we are supposed to only record the one less then max_low_pfn
318 * but we could have some hole in high memory, and it will only
319 * check page_is_ram(pfn) && !page_is_reserved_early(pfn) to decide
320 * to use it as free.
321 * So reserve_early here, hope we don't run out of that array
Yinghai Lu9043f002008-06-06 18:53:33 -0700322 */
Yinghai Lucc1050b2008-06-13 19:08:52 -0700323 reserve_early(node_kva_final,
324 node_kva_final+(((u64)size)<<PAGE_SHIFT),
325 "KVA RAM");
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700326
Yinghai Lucc1050b2008-06-13 19:08:52 -0700327 node_remap_start_pfn[nid] = node_kva_final>>PAGE_SHIFT;
328 remove_active_range(nid, node_remap_start_pfn[nid],
329 node_remap_start_pfn[nid] + size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330 }
Yinghai Luc0943452008-06-23 16:41:30 -0700331 printk(KERN_INFO "Reserving total of %lx pages for numa KVA remap\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700332 reserve_pages);
333 return reserve_pages;
334}
335
Mel Gorman1b000a52008-01-30 13:33:25 +0100336static void init_remap_allocator(int nid)
337{
338 node_remap_start_vaddr[nid] = pfn_to_kaddr(
339 kva_start_pfn + node_remap_offset[nid]);
340 node_remap_end_vaddr[nid] = node_remap_start_vaddr[nid] +
341 (node_remap_size[nid] * PAGE_SIZE);
342 node_remap_alloc_vaddr[nid] = node_remap_start_vaddr[nid] +
343 ALIGN(sizeof(pg_data_t), PAGE_SIZE);
344
Yinghai Luc0943452008-06-23 16:41:30 -0700345 printk(KERN_DEBUG "node %d will remap to vaddr %08lx - %08lx\n", nid,
Mel Gorman1b000a52008-01-30 13:33:25 +0100346 (ulong) node_remap_start_vaddr[nid],
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700347 (ulong) node_remap_end_vaddr[nid]);
Mel Gorman1b000a52008-01-30 13:33:25 +0100348}
Mel Gorman1b000a52008-01-30 13:33:25 +0100349
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700350void __init initmem_init(unsigned long start_pfn,
Yinghai Lub2ac82a2008-06-22 02:45:39 -0700351 unsigned long end_pfn)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352{
353 int nid;
Yinghai Lu84b56fa2008-06-03 19:32:30 -0700354 long kva_target_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355
356 /*
357 * When mapping a NUMA machine we allocate the node_mem_map arrays
358 * from node local memory. They are then mapped directly into KVA
359 * between zone normal and vmalloc space. Calculate the size of
Simon Arlott27b46d72007-10-20 01:13:56 +0200360 * this space and use it to adjust the boundary between ZONE_NORMAL
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361 * and ZONE_HIGHMEM.
362 */
Yinghai Lu7b2a0a62008-06-03 19:35:04 -0700363
Linus Torvalds1da177e2005-04-16 15:20:36 -0700364 get_memcfg_numa();
365
Joerg Roedel17f3ab72008-07-25 16:48:59 +0200366 kva_pages = roundup(calculate_numa_remap_pages(), PTRS_PER_PTE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700367
Yinghai Lu84b56fa2008-06-03 19:32:30 -0700368 kva_target_pfn = round_down(max_low_pfn - kva_pages, PTRS_PER_PTE);
369 do {
370 kva_start_pfn = find_e820_area(kva_target_pfn<<PAGE_SHIFT,
371 max_low_pfn<<PAGE_SHIFT,
372 kva_pages<<PAGE_SHIFT,
373 PTRS_PER_PTE<<PAGE_SHIFT) >> PAGE_SHIFT;
374 kva_target_pfn -= PTRS_PER_PTE;
375 } while (kva_start_pfn == -1UL && kva_target_pfn > min_low_pfn);
keith mannthey91023302006-09-25 23:31:03 -0700376
Yinghai Lu84b56fa2008-06-03 19:32:30 -0700377 if (kva_start_pfn == -1UL)
378 panic("Can not get kva space\n");
Mel Gormanbac48942008-01-30 13:32:54 +0100379
Yinghai Luc0943452008-06-23 16:41:30 -0700380 printk(KERN_INFO "kva_start_pfn ~ %lx max_low_pfn ~ %lx\n",
keith mannthey91023302006-09-25 23:31:03 -0700381 kva_start_pfn, max_low_pfn);
Yinghai Luc0943452008-06-23 16:41:30 -0700382 printk(KERN_INFO "max_pfn = %lx\n", max_pfn);
Yinghai Lua5481282008-05-29 12:58:37 -0700383
384 /* avoid clash with initrd */
385 reserve_early(kva_start_pfn<<PAGE_SHIFT,
386 (kva_start_pfn + kva_pages)<<PAGE_SHIFT,
387 "KVA PG");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388#ifdef CONFIG_HIGHMEM
389 highstart_pfn = highend_pfn = max_pfn;
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700390 if (max_pfn > max_low_pfn)
391 highstart_pfn = max_low_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392 printk(KERN_NOTICE "%ldMB HIGHMEM available.\n",
393 pages_to_mb(highend_pfn - highstart_pfn));
Jan Beulichba9c2312006-09-26 10:52:31 +0200394 num_physpages = highend_pfn;
395 high_memory = (void *) __va(highstart_pfn * PAGE_SIZE - 1) + 1;
396#else
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700397 num_physpages = max_low_pfn;
398 high_memory = (void *) __va(max_low_pfn * PAGE_SIZE - 1) + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700399#endif
400 printk(KERN_NOTICE "%ldMB LOWMEM available.\n",
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700401 pages_to_mb(max_low_pfn));
Yinghai Luc0943452008-06-23 16:41:30 -0700402 printk(KERN_DEBUG "max_low_pfn = %lx, highstart_pfn = %lx\n",
403 max_low_pfn, highstart_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404
Yinghai Luc0943452008-06-23 16:41:30 -0700405 printk(KERN_DEBUG "Low memory ends at vaddr %08lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406 (ulong) pfn_to_kaddr(max_low_pfn));
407 for_each_online_node(nid) {
Mel Gorman1b000a52008-01-30 13:33:25 +0100408 init_remap_allocator(nid);
Dave Hansen6f167ec2005-06-23 00:07:39 -0700409
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410 allocate_pgdat(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700411 }
Yinghai Lu3a58a2a2008-06-24 12:19:41 -0700412 remap_numa_kva();
413
Yinghai Luc0943452008-06-23 16:41:30 -0700414 printk(KERN_DEBUG "High memory starts at vaddr %08lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 (ulong) pfn_to_kaddr(highstart_pfn));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416 for_each_online_node(nid)
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200417 propagate_e820_map_node(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418
Yinghai Lua71edd12009-03-04 01:22:35 -0800419 for_each_online_node(nid) {
Yinghai Lu3a58a2a2008-06-24 12:19:41 -0700420 memset(NODE_DATA(nid), 0, sizeof(struct pglist_data));
Yinghai Lua71edd12009-03-04 01:22:35 -0800421 NODE_DATA(nid)->bdata = &bootmem_node_data[nid];
422 }
Yinghai Lu3a58a2a2008-06-24 12:19:41 -0700423
Linus Torvalds1da177e2005-04-16 15:20:36 -0700424 setup_bootmem_allocator();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425}
426
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800427#ifdef CONFIG_MEMORY_HOTPLUG
Adrian Bunkfb8c1772007-10-24 18:24:47 +0200428static int paddr_to_nid(u64 addr)
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800429{
430 int nid;
431 unsigned long pfn = PFN_DOWN(addr);
432
433 for_each_node(nid)
434 if (node_start_pfn[nid] <= pfn &&
435 pfn < node_end_pfn[nid])
436 return nid;
437
438 return -1;
439}
440
441/*
442 * This function is used to ask node id BEFORE memmap and mem_section's
443 * initialization (pfn_to_nid() can't be used yet).
444 * If _PXM is not defined on ACPI's DSDT, node id must be found by this.
445 */
446int memory_add_physaddr_to_nid(u64 addr)
447{
448 int nid = paddr_to_nid(addr);
449 return (nid >= 0) ? nid : 0;
450}
451
452EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
453#endif
Ingo Molnar2772f542008-06-03 10:09:45 +0200454