blob: c3f119e99e0def59f43c7767152ea2562dbdcf92 [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);
Adrian Bunkfb8c1772007-10-24 18:24:47 +020045static bootmem_data_t node0_bdata;
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
79 printk(KERN_INFO "Node: %d, start_pfn: %ld, end_pfn: %ld\n",
80 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 Luba924c82008-05-31 22:51:51 -070085 printk(KERN_CONT "%ld ", 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);
Dave Hansen05039b92005-10-29 18:16:57 -0700103extern void add_one_highpage_init(struct page *, int, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104extern unsigned long highend_pfn, highstart_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
106#define LARGE_PAGE_BYTES (PTRS_PER_PTE * PAGE_SIZE)
107
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108unsigned long node_remap_size[MAX_NUMNODES];
Adrian Bunk59659f12007-10-17 18:04:36 +0200109static void *node_remap_start_vaddr[MAX_NUMNODES];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110void set_pmd_pfn(unsigned long vaddr, unsigned long pfn, pgprot_t flags);
111
keith mannthey91023302006-09-25 23:31:03 -0700112static unsigned long kva_start_pfn;
113static unsigned long kva_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114/*
115 * FLAT - support for basic PC memory model with discontig enabled, essentially
116 * a single node with all available processors in it with a flat
117 * memory map.
118 */
119int __init get_memcfg_numa_flat(void)
120{
121 printk("NUMA - single node, flat memory mode\n");
122
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123 node_start_pfn[0] = 0;
124 node_end_pfn[0] = max_pfn;
Yinghai Lu7b2a0a62008-06-03 19:35:04 -0700125 e820_register_active_regions(0, 0, max_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126 memory_present(0, 0, max_pfn);
Yinghai Lub66cd722008-05-31 22:53:47 -0700127 node_remap_size[0] = node_memmap_size_bytes(0, 0, max_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128
129 /* Indicate there is one node available. */
130 nodes_clear(node_online_map);
131 node_set_online(0);
132 return 1;
133}
134
135/*
136 * Find the highest page frame number we have available for the node
137 */
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200138static void __init propagate_e820_map_node(int nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139{
140 if (node_end_pfn[nid] > max_pfn)
141 node_end_pfn[nid] = max_pfn;
142 /*
143 * if a user has given mem=XXXX, then we need to make sure
144 * that the node _starts_ before that, too, not just ends
145 */
146 if (node_start_pfn[nid] > max_pfn)
147 node_start_pfn[nid] = max_pfn;
Eric Sesterhenn8d8f3cb2006-10-03 23:34:58 +0200148 BUG_ON(node_start_pfn[nid] > node_end_pfn[nid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149}
150
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151/*
152 * Allocate memory for the pg_data_t for this node via a crude pre-bootmem
153 * method. For node zero take this from the bottom of memory, for
154 * subsequent nodes place them at node_remap_start_vaddr which contains
155 * node local data in physically node local memory. See setup_memory()
156 * for details.
157 */
158static void __init allocate_pgdat(int nid)
159{
160 if (nid && node_has_online_mem(nid))
161 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 Lu6af61a72008-06-01 23:53:50 -0700165 (nid ? max_low_pfn:max_pfn_mapped)<<PAGE_SHIFT,
166 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));
169 reserve_early(pgdat_phys, pgdat_phys + sizeof(pg_data_t),
170 "NODE_DATA");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 }
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700172 printk(KERN_DEBUG "allocate_pgdat: node %d NODE_DATA %08lx\n",
173 nid, (unsigned long)NODE_DATA(nid));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174}
175
Mel Gorman1b000a52008-01-30 13:33:25 +0100176#ifdef CONFIG_DISCONTIGMEM
177/*
178 * In the discontig memory model, a portion of the kernel virtual area (KVA)
179 * is reserved and portions of nodes are mapped using it. This is to allow
180 * node-local memory to be allocated for structures that would normally require
181 * ZONE_NORMAL. The memory is allocated with alloc_remap() and callers
182 * should be prepared to allocate from the bootmem allocator instead. This KVA
183 * mechanism is incompatible with SPARSEMEM as it makes assumptions about the
184 * layout of memory that are broken if alloc_remap() succeeds for some of the
185 * map and fails for others
186 */
187static unsigned long node_remap_start_pfn[MAX_NUMNODES];
188static void *node_remap_end_vaddr[MAX_NUMNODES];
189static void *node_remap_alloc_vaddr[MAX_NUMNODES];
190static unsigned long node_remap_offset[MAX_NUMNODES];
191
Dave Hansen6f167ec2005-06-23 00:07:39 -0700192void *alloc_remap(int nid, unsigned long size)
193{
194 void *allocation = node_remap_alloc_vaddr[nid];
195
196 size = ALIGN(size, L1_CACHE_BYTES);
197
198 if (!allocation || (allocation + size) >= node_remap_end_vaddr[nid])
199 return 0;
200
201 node_remap_alloc_vaddr[nid] += size;
202 memset(allocation, 0, size);
203
204 return allocation;
205}
206
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207void __init remap_numa_kva(void)
208{
209 void *vaddr;
210 unsigned long pfn;
211 int node;
212
213 for_each_online_node(node) {
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700214 printk(KERN_DEBUG "remap_numa_kva: node %d\n", node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 for (pfn=0; pfn < node_remap_size[node]; pfn += PTRS_PER_PTE) {
216 vaddr = node_remap_start_vaddr[node]+(pfn<<PAGE_SHIFT);
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700217 printk(KERN_DEBUG "remap_numa_kva: %08lx to pfn %08lx\n",
218 (unsigned long)vaddr,
219 node_remap_start_pfn[node] + pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220 set_pmd_pfn((ulong) vaddr,
221 node_remap_start_pfn[node] + pfn,
222 PAGE_KERNEL_LARGE);
223 }
224 }
225}
226
227static unsigned long calculate_numa_remap_pages(void)
228{
229 int nid;
230 unsigned long size, reserve_pages = 0;
231
232 for_each_online_node(nid) {
Yinghai Lucc1050b2008-06-13 19:08:52 -0700233 u64 node_kva_target;
234 u64 node_kva_final;
Mel Gorman4cfee882006-09-27 01:49:51 -0700235
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 /*
237 * The acpi/srat node info can show hot-add memroy zones
238 * where memory could be added but not currently present.
239 */
Yinghai Lu9043f002008-06-06 18:53:33 -0700240 printk("node %d pfn: [%lx - %lx]\n",
241 nid, node_start_pfn[nid], node_end_pfn[nid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242 if (node_start_pfn[nid] > max_pfn)
243 continue;
Yinghai Lu9043f002008-06-06 18:53:33 -0700244 if (!node_end_pfn[nid])
245 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246 if (node_end_pfn[nid] > max_pfn)
247 node_end_pfn[nid] = max_pfn;
248
249 /* ensure the remap includes space for the pgdat. */
250 size = node_remap_size[nid] + sizeof(pg_data_t);
251
252 /* convert size to large (pmd size) pages, rounding up */
253 size = (size + LARGE_PAGE_BYTES - 1) / LARGE_PAGE_BYTES;
254 /* now the roundup is correct, convert to PAGE_SIZE pages */
255 size = size * PTRS_PER_PTE;
Dave Hansen5b505b92005-06-23 00:07:41 -0700256
Yinghai Lucc1050b2008-06-13 19:08:52 -0700257 node_kva_target = round_down(node_end_pfn[nid] - size,
Yinghai Lu9043f002008-06-06 18:53:33 -0700258 PTRS_PER_PTE);
Yinghai Lucc1050b2008-06-13 19:08:52 -0700259 node_kva_target <<= PAGE_SHIFT;
Yinghai Lu9043f002008-06-06 18:53:33 -0700260 do {
Yinghai Lucc1050b2008-06-13 19:08:52 -0700261 node_kva_final = find_e820_area(node_kva_target,
Yinghai Lu9043f002008-06-06 18:53:33 -0700262 ((u64)node_end_pfn[nid])<<PAGE_SHIFT,
263 ((u64)size)<<PAGE_SHIFT,
264 LARGE_PAGE_BYTES);
Yinghai Lucc1050b2008-06-13 19:08:52 -0700265 node_kva_target -= LARGE_PAGE_BYTES;
266 } while (node_kva_final == -1ULL &&
267 (node_kva_target>>PAGE_SHIFT) > (node_start_pfn[nid]));
Dave Hansen5b505b92005-06-23 00:07:41 -0700268
Yinghai Lucc1050b2008-06-13 19:08:52 -0700269 if (node_kva_final == -1ULL)
Yinghai Lu9043f002008-06-06 18:53:33 -0700270 panic("Can not get kva ram\n");
Dave Hansen5b505b92005-06-23 00:07:41 -0700271
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 node_remap_size[nid] = size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273 node_remap_offset[nid] = reserve_pages;
Dave Hansen6f167ec2005-06-23 00:07:39 -0700274 reserve_pages += size;
Yinghai Lucc1050b2008-06-13 19:08:52 -0700275 printk("Reserving %ld pages of KVA for lmem_map of node %d at %llx\n",
276 size, nid, node_kva_final>>PAGE_SHIFT);
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700277
Yinghai Lu9043f002008-06-06 18:53:33 -0700278 /*
279 * prevent kva address below max_low_pfn want it on system
280 * with less memory later.
281 * layout will be: KVA address , KVA RAM
Yinghai Lucc1050b2008-06-13 19:08:52 -0700282 *
283 * we are supposed to only record the one less then max_low_pfn
284 * but we could have some hole in high memory, and it will only
285 * check page_is_ram(pfn) && !page_is_reserved_early(pfn) to decide
286 * to use it as free.
287 * So reserve_early here, hope we don't run out of that array
Yinghai Lu9043f002008-06-06 18:53:33 -0700288 */
Yinghai Lucc1050b2008-06-13 19:08:52 -0700289 reserve_early(node_kva_final,
290 node_kva_final+(((u64)size)<<PAGE_SHIFT),
291 "KVA RAM");
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700292
Yinghai Lucc1050b2008-06-13 19:08:52 -0700293 node_remap_start_pfn[nid] = node_kva_final>>PAGE_SHIFT;
294 remove_active_range(nid, node_remap_start_pfn[nid],
295 node_remap_start_pfn[nid] + size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296 }
297 printk("Reserving total of %ld pages for numa KVA remap\n",
298 reserve_pages);
299 return reserve_pages;
300}
301
Mel Gorman1b000a52008-01-30 13:33:25 +0100302static void init_remap_allocator(int nid)
303{
304 node_remap_start_vaddr[nid] = pfn_to_kaddr(
305 kva_start_pfn + node_remap_offset[nid]);
306 node_remap_end_vaddr[nid] = node_remap_start_vaddr[nid] +
307 (node_remap_size[nid] * PAGE_SIZE);
308 node_remap_alloc_vaddr[nid] = node_remap_start_vaddr[nid] +
309 ALIGN(sizeof(pg_data_t), PAGE_SIZE);
310
311 printk ("node %d will remap to vaddr %08lx - %08lx\n", nid,
312 (ulong) node_remap_start_vaddr[nid],
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700313 (ulong) node_remap_end_vaddr[nid]);
Mel Gorman1b000a52008-01-30 13:33:25 +0100314}
315#else
316void *alloc_remap(int nid, unsigned long size)
317{
318 return NULL;
319}
320
321static unsigned long calculate_numa_remap_pages(void)
322{
323 return 0;
324}
325
326static void init_remap_allocator(int nid)
327{
328}
329
330void __init remap_numa_kva(void)
331{
332}
333#endif /* CONFIG_DISCONTIGMEM */
334
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335extern void setup_bootmem_allocator(void);
336unsigned long __init setup_memory(void)
337{
338 int nid;
339 unsigned long system_start_pfn, system_max_low_pfn;
Yinghai Lu84b56fa2008-06-03 19:32:30 -0700340 long kva_target_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341
342 /*
343 * When mapping a NUMA machine we allocate the node_mem_map arrays
344 * from node local memory. They are then mapped directly into KVA
345 * between zone normal and vmalloc space. Calculate the size of
Simon Arlott27b46d72007-10-20 01:13:56 +0200346 * this space and use it to adjust the boundary between ZONE_NORMAL
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347 * and ZONE_HIGHMEM.
348 */
Yinghai Lu7b2a0a62008-06-03 19:35:04 -0700349
350 /* call find_max_low_pfn at first, it could update max_pfn */
351 system_max_low_pfn = max_low_pfn = find_max_low_pfn();
352
353 remove_all_active_ranges();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354 get_memcfg_numa();
355
Yinghai Lu287572c2008-06-01 21:06:31 -0700356 kva_pages = round_up(calculate_numa_remap_pages(), PTRS_PER_PTE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357
358 /* partially used pages are not usable - thus round upwards */
359 system_start_pfn = min_low_pfn = PFN_UP(init_pg_tables_end);
360
Yinghai Lu84b56fa2008-06-03 19:32:30 -0700361 kva_target_pfn = round_down(max_low_pfn - kva_pages, PTRS_PER_PTE);
362 do {
363 kva_start_pfn = find_e820_area(kva_target_pfn<<PAGE_SHIFT,
364 max_low_pfn<<PAGE_SHIFT,
365 kva_pages<<PAGE_SHIFT,
366 PTRS_PER_PTE<<PAGE_SHIFT) >> PAGE_SHIFT;
367 kva_target_pfn -= PTRS_PER_PTE;
368 } while (kva_start_pfn == -1UL && kva_target_pfn > min_low_pfn);
369
370 if (kva_start_pfn == -1UL)
371 panic("Can not get kva space\n");
Yinghai Lu287572c2008-06-01 21:06:31 -0700372
keith mannthey91023302006-09-25 23:31:03 -0700373 printk("kva_start_pfn ~ %ld find_max_low_pfn() ~ %ld\n",
374 kva_start_pfn, max_low_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375 printk("max_pfn = %ld\n", max_pfn);
Yinghai Lua5481282008-05-29 12:58:37 -0700376
377 /* avoid clash with initrd */
378 reserve_early(kva_start_pfn<<PAGE_SHIFT,
379 (kva_start_pfn + kva_pages)<<PAGE_SHIFT,
380 "KVA PG");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381#ifdef CONFIG_HIGHMEM
382 highstart_pfn = highend_pfn = max_pfn;
383 if (max_pfn > system_max_low_pfn)
384 highstart_pfn = system_max_low_pfn;
385 printk(KERN_NOTICE "%ldMB HIGHMEM available.\n",
386 pages_to_mb(highend_pfn - highstart_pfn));
Jan Beulichba9c2312006-09-26 10:52:31 +0200387 num_physpages = highend_pfn;
388 high_memory = (void *) __va(highstart_pfn * PAGE_SIZE - 1) + 1;
389#else
390 num_physpages = system_max_low_pfn;
391 high_memory = (void *) __va(system_max_low_pfn * PAGE_SIZE - 1) + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392#endif
393 printk(KERN_NOTICE "%ldMB LOWMEM available.\n",
394 pages_to_mb(system_max_low_pfn));
395 printk("min_low_pfn = %ld, max_low_pfn = %ld, highstart_pfn = %ld\n",
396 min_low_pfn, max_low_pfn, highstart_pfn);
397
398 printk("Low memory ends at vaddr %08lx\n",
399 (ulong) pfn_to_kaddr(max_low_pfn));
400 for_each_online_node(nid) {
Mel Gorman1b000a52008-01-30 13:33:25 +0100401 init_remap_allocator(nid);
Dave Hansen6f167ec2005-06-23 00:07:39 -0700402
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403 allocate_pgdat(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404 }
405 printk("High memory starts at vaddr %08lx\n",
406 (ulong) pfn_to_kaddr(highstart_pfn));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407 for_each_online_node(nid)
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200408 propagate_e820_map_node(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409
410 memset(NODE_DATA(0), 0, sizeof(struct pglist_data));
411 NODE_DATA(0)->bdata = &node0_bdata;
412 setup_bootmem_allocator();
413 return max_low_pfn;
414}
415
416void __init zone_sizes_init(void)
417{
Mel Gorman6391af12006-10-11 01:20:39 -0700418 unsigned long max_zone_pfns[MAX_NR_ZONES];
419 memset(max_zone_pfns, 0, sizeof(max_zone_pfns));
420 max_zone_pfns[ZONE_DMA] =
421 virt_to_phys((char *)MAX_DMA_ADDRESS) >> PAGE_SHIFT;
422 max_zone_pfns[ZONE_NORMAL] = max_low_pfn;
Linus Torvalds28aa4832007-05-15 18:45:49 -0700423#ifdef CONFIG_HIGHMEM
Mel Gorman6391af12006-10-11 01:20:39 -0700424 max_zone_pfns[ZONE_HIGHMEM] = highend_pfn;
Linus Torvalds28aa4832007-05-15 18:45:49 -0700425#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426
Mel Gorman4cfee882006-09-27 01:49:51 -0700427 free_area_init_nodes(max_zone_pfns);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428 return;
429}
430
431void __init set_highmem_pages_init(int bad_ppro)
432{
433#ifdef CONFIG_HIGHMEM
434 struct zone *zone;
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700435 struct page *page;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436
437 for_each_zone(zone) {
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700438 unsigned long node_pfn, zone_start_pfn, zone_end_pfn;
439
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440 if (!is_highmem(zone))
441 continue;
442
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 zone_start_pfn = zone->zone_start_pfn;
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700444 zone_end_pfn = zone_start_pfn + zone->spanned_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700446 printk("Initializing %s for node %d (%08lx:%08lx)\n",
Christoph Lameter89fa3022006-09-25 23:31:55 -0700447 zone->name, zone_to_nid(zone),
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700448 zone_start_pfn, zone_end_pfn);
449
450 for (node_pfn = zone_start_pfn; node_pfn < zone_end_pfn; node_pfn++) {
451 if (!pfn_valid(node_pfn))
452 continue;
453 page = pfn_to_page(node_pfn);
Dave Hansen05039b92005-10-29 18:16:57 -0700454 add_one_highpage_init(page, node_pfn, bad_ppro);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455 }
456 }
457 totalram_pages += totalhigh_pages;
458#endif
459}
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800460
461#ifdef CONFIG_MEMORY_HOTPLUG
Adrian Bunkfb8c1772007-10-24 18:24:47 +0200462static int paddr_to_nid(u64 addr)
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800463{
464 int nid;
465 unsigned long pfn = PFN_DOWN(addr);
466
467 for_each_node(nid)
468 if (node_start_pfn[nid] <= pfn &&
469 pfn < node_end_pfn[nid])
470 return nid;
471
472 return -1;
473}
474
475/*
476 * This function is used to ask node id BEFORE memmap and mem_section's
477 * initialization (pfn_to_nid() can't be used yet).
478 * If _PXM is not defined on ACPI's DSDT, node id must be found by this.
479 */
480int memory_add_physaddr_to_nid(u64 addr)
481{
482 int nid = paddr_to_nid(addr);
483 return (nid >= 0) ? nid : 0;
484}
485
486EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
487#endif