blob: 12bb34c434ea55a41533d7146156f33495de9c88 [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
Tejun Heo7210cf92011-04-05 00:23:53 +0200107static unsigned 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
Tejun Heobbc9e2f2011-01-23 14:37:39 +0100111int __cpuinit numa_cpu_node(int cpu)
112{
113 return apic->x86_32_numa_cpu_node(cpu);
114}
115
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116/*
117 * FLAT - support for basic PC memory model with discontig enabled, essentially
118 * a single node with all available processors in it with a flat
119 * memory map.
120 */
121int __init get_memcfg_numa_flat(void)
122{
Yinghai Luc0943452008-06-23 16:41:30 -0700123 printk(KERN_DEBUG "NUMA - single node, flat memory mode\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125 node_start_pfn[0] = 0;
126 node_end_pfn[0] = max_pfn;
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700127 memblock_x86_register_active_regions(0, 0, max_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 memory_present(0, 0, max_pfn);
129
130 /* Indicate there is one node available. */
131 nodes_clear(node_online_map);
132 node_set_online(0);
133 return 1;
134}
135
136/*
137 * Find the highest page frame number we have available for the node
138 */
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200139static void __init propagate_e820_map_node(int nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140{
141 if (node_end_pfn[nid] > max_pfn)
142 node_end_pfn[nid] = max_pfn;
143 /*
144 * if a user has given mem=XXXX, then we need to make sure
145 * that the node _starts_ before that, too, not just ends
146 */
147 if (node_start_pfn[nid] > max_pfn)
148 node_start_pfn[nid] = max_pfn;
Eric Sesterhenn8d8f3cb2006-10-03 23:34:58 +0200149 BUG_ON(node_start_pfn[nid] > node_end_pfn[nid]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150}
151
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152/*
153 * Allocate memory for the pg_data_t for this node via a crude pre-bootmem
154 * method. For node zero take this from the bottom of memory, for
155 * subsequent nodes place them at node_remap_start_vaddr which contains
156 * node local data in physically node local memory. See setup_memory()
157 * for details.
158 */
159static void __init allocate_pgdat(int nid)
160{
Yinghai Lu996cf442008-06-30 18:34:58 -0700161 char buf[16];
162
163 if (node_has_online_mem(nid) && node_remap_start_vaddr[nid])
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164 NODE_DATA(nid) = (pg_data_t *)node_remap_start_vaddr[nid];
165 else {
Yinghai Lu16387292008-05-29 12:57:22 -0700166 unsigned long pgdat_phys;
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700167 pgdat_phys = memblock_find_in_range(min_low_pfn<<PAGE_SHIFT,
Yinghai Lu996cf442008-06-30 18:34:58 -0700168 max_pfn_mapped<<PAGE_SHIFT,
Yinghai Lu6af61a72008-06-01 23:53:50 -0700169 sizeof(pg_data_t),
Yinghai Lu16387292008-05-29 12:57:22 -0700170 PAGE_SIZE);
171 NODE_DATA(nid) = (pg_data_t *)(pfn_to_kaddr(pgdat_phys>>PAGE_SHIFT));
Yinghai Lu996cf442008-06-30 18:34:58 -0700172 memset(buf, 0, sizeof(buf));
173 sprintf(buf, "NODE_DATA %d", nid);
Yinghai Lua9ce6bc2010-08-25 13:39:17 -0700174 memblock_x86_reserve_range(pgdat_phys, pgdat_phys + sizeof(pg_data_t), buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 }
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700176 printk(KERN_DEBUG "allocate_pgdat: node %d NODE_DATA %08lx\n",
177 nid, (unsigned long)NODE_DATA(nid));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178}
179
Mel Gorman1b000a52008-01-30 13:33:25 +0100180/*
Andy Whitcroftb9ada422008-05-20 11:01:08 +0100181 * In the DISCONTIGMEM and SPARSEMEM memory model, a portion of the kernel
182 * virtual address space (KVA) is reserved and portions of nodes are mapped
183 * using it. This is to allow node-local memory to be allocated for
184 * structures that would normally require ZONE_NORMAL. The memory is
185 * allocated with alloc_remap() and callers should be prepared to allocate
186 * from the bootmem allocator instead.
Mel Gorman1b000a52008-01-30 13:33:25 +0100187 */
188static unsigned long node_remap_start_pfn[MAX_NUMNODES];
189static void *node_remap_end_vaddr[MAX_NUMNODES];
190static void *node_remap_alloc_vaddr[MAX_NUMNODES];
191static unsigned long node_remap_offset[MAX_NUMNODES];
192
Dave Hansen6f167ec2005-06-23 00:07:39 -0700193void *alloc_remap(int nid, unsigned long size)
194{
195 void *allocation = node_remap_alloc_vaddr[nid];
196
197 size = ALIGN(size, L1_CACHE_BYTES);
198
Tejun Heo3fe14ab2011-04-05 00:23:47 +0200199 if (!allocation || (allocation + size) > node_remap_end_vaddr[nid])
Hannes Eder2366c292009-02-22 01:01:13 +0100200 return NULL;
Dave Hansen6f167ec2005-06-23 00:07:39 -0700201
202 node_remap_alloc_vaddr[nid] += size;
203 memset(allocation, 0, size);
204
205 return allocation;
206}
207
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700208static void __init remap_numa_kva(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209{
210 void *vaddr;
211 unsigned long pfn;
212 int node;
213
214 for_each_online_node(node) {
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700215 printk(KERN_DEBUG "remap_numa_kva: node %d\n", node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216 for (pfn=0; pfn < node_remap_size[node]; pfn += PTRS_PER_PTE) {
217 vaddr = node_remap_start_vaddr[node]+(pfn<<PAGE_SHIFT);
Yinghai Lue8c27ac2008-06-01 13:15:22 -0700218 printk(KERN_DEBUG "remap_numa_kva: %08lx to pfn %08lx\n",
219 (unsigned long)vaddr,
220 node_remap_start_pfn[node] + pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221 set_pmd_pfn((ulong) vaddr,
222 node_remap_start_pfn[node] + pfn,
223 PAGE_KERNEL_LARGE);
224 }
225 }
226}
227
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100228#ifdef CONFIG_HIBERNATION
229/**
230 * resume_map_numa_kva - add KVA mapping to the temporary page tables created
231 * during resume from hibernation
232 * @pgd_base - temporary resume page directory
233 */
234void resume_map_numa_kva(pgd_t *pgd_base)
235{
236 int node;
237
238 for_each_online_node(node) {
239 unsigned long start_va, start_pfn, size, pfn;
240
241 start_va = (unsigned long)node_remap_start_vaddr[node];
242 start_pfn = node_remap_start_pfn[node];
243 size = node_remap_size[node];
244
Harvey Harrison9b4778f2009-01-07 14:42:41 -0800245 printk(KERN_DEBUG "%s: node %d\n", __func__, node);
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100246
247 for (pfn = 0; pfn < size; pfn += PTRS_PER_PTE) {
248 unsigned long vaddr = start_va + (pfn << PAGE_SHIFT);
249 pgd_t *pgd = pgd_base + pgd_index(vaddr);
250 pud_t *pud = pud_offset(pgd, vaddr);
251 pmd_t *pmd = pmd_offset(pud, vaddr);
252
253 set_pmd(pmd, pfn_pmd(start_pfn + pfn,
254 PAGE_KERNEL_LARGE_EXEC));
255
256 printk(KERN_DEBUG "%s: %08lx -> pfn %08lx\n",
Harvey Harrison9b4778f2009-01-07 14:42:41 -0800257 __func__, vaddr, start_pfn + pfn);
Rafael J. Wysocki97a70e52008-11-12 23:22:35 +0100258 }
259 }
260}
261#endif
262
Tejun Heo5510db92011-04-05 00:23:50 +0200263static __init unsigned long init_alloc_remap(int nid, unsigned long offset)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264{
Tejun Heo5510db92011-04-05 00:23:50 +0200265 unsigned long size;
Tejun Heo0e9f93c2011-04-05 00:23:55 +0200266 u64 node_pa, remap_pa;
267 void *remap_va;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268
Tejun Heo5510db92011-04-05 00:23:50 +0200269 /*
270 * The acpi/srat node info can show hot-add memroy zones where
271 * memory could be added but not currently present.
272 */
273 printk(KERN_DEBUG "node %d pfn: [%lx - %lx]\n",
274 nid, node_start_pfn[nid], node_end_pfn[nid]);
275 if (node_start_pfn[nid] > max_pfn)
276 return 0;
277 if (!node_end_pfn[nid])
278 return 0;
279 if (node_end_pfn[nid] > max_pfn)
280 node_end_pfn[nid] = max_pfn;
Mel Gorman4cfee882006-09-27 01:49:51 -0700281
Tejun Heo7210cf92011-04-05 00:23:53 +0200282 /* calculate the necessary space aligned to large page size */
283 size = node_memmap_size_bytes(nid, node_start_pfn[nid],
284 min(node_end_pfn[nid], max_pfn));
Tejun Heo5510db92011-04-05 00:23:50 +0200285 size += ALIGN(sizeof(pg_data_t), PAGE_SIZE);
Tejun Heoaf7c1a62011-04-05 00:23:52 +0200286 size = ALIGN(size, LARGE_PAGE_BYTES);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287
Tejun Heo0e9f93c2011-04-05 00:23:55 +0200288 /* allocate node memory and the lowmem remap area */
Tejun Heoc4d4f572011-04-05 00:23:51 +0200289 node_pa = memblock_find_in_range(node_start_pfn[nid] << PAGE_SHIFT,
290 (u64)node_end_pfn[nid] << PAGE_SHIFT,
Tejun Heoaf7c1a62011-04-05 00:23:52 +0200291 size, LARGE_PAGE_BYTES);
Tejun Heo82044c32011-04-05 00:23:54 +0200292 if (node_pa == MEMBLOCK_ERROR) {
293 pr_warning("remap_alloc: failed to allocate %lu bytes for node %d\n",
294 size, nid);
295 return 0;
296 }
Tejun Heoaf7c1a62011-04-05 00:23:52 +0200297 memblock_x86_reserve_range(node_pa, node_pa + size, "KVA RAM");
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700298
Tejun Heo0e9f93c2011-04-05 00:23:55 +0200299 remap_pa = memblock_find_in_range(min_low_pfn << PAGE_SHIFT,
300 max_low_pfn << PAGE_SHIFT,
301 size, LARGE_PAGE_BYTES);
302 if (remap_pa == MEMBLOCK_ERROR) {
303 pr_warning("remap_alloc: failed to allocate %lu bytes remap area for node %d\n",
304 size, nid);
305 memblock_x86_free_range(node_pa, node_pa + size);
306 return 0;
307 }
308 memblock_x86_reserve_range(remap_pa, remap_pa + size, "KVA PG");
309 remap_va = phys_to_virt(remap_pa);
310
311 /* initialize remap allocator parameters */
Tejun Heoc4d4f572011-04-05 00:23:51 +0200312 node_remap_start_pfn[nid] = node_pa >> PAGE_SHIFT;
Tejun Heo0e9f93c2011-04-05 00:23:55 +0200313 node_remap_size[nid] = size >> PAGE_SHIFT;
314 node_remap_offset[nid] = offset;
315
316 node_remap_start_vaddr[nid] = remap_va;
317 node_remap_end_vaddr[nid] = remap_va + size;
318 node_remap_alloc_vaddr[nid] = remap_va + ALIGN(sizeof(pg_data_t), PAGE_SIZE);
319
320 printk(KERN_DEBUG "remap_alloc: node %d [%08llx-%08llx) -> [%p-%p)\n",
321 nid, node_pa, node_pa + size, remap_va, remap_va + size);
Ravikiran G Thirumalai4b0271e2005-08-07 09:42:50 -0700322
Tejun Heoaf7c1a62011-04-05 00:23:52 +0200323 return size >> PAGE_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324}
325
Tejun Heod8fc3af2011-02-16 12:13:06 +0100326void __init initmem_init(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700327{
Tejun Heo5510db92011-04-05 00:23:50 +0200328 unsigned long reserve_pages = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329 int nid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330
331 /*
332 * When mapping a NUMA machine we allocate the node_mem_map arrays
333 * from node local memory. They are then mapped directly into KVA
334 * between zone normal and vmalloc space. Calculate the size of
Simon Arlott27b46d72007-10-20 01:13:56 +0200335 * this space and use it to adjust the boundary between ZONE_NORMAL
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336 * and ZONE_HIGHMEM.
337 */
Yinghai Lu7b2a0a62008-06-03 19:35:04 -0700338
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339 get_memcfg_numa();
Tejun Heo8db78cc2011-01-23 14:37:42 +0100340 numa_init_array();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341
Tejun Heo5510db92011-04-05 00:23:50 +0200342 for_each_online_node(nid)
343 reserve_pages += init_alloc_remap(nid, reserve_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345#ifdef CONFIG_HIGHMEM
346 highstart_pfn = highend_pfn = max_pfn;
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700347 if (max_pfn > max_low_pfn)
348 highstart_pfn = max_low_pfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349 printk(KERN_NOTICE "%ldMB HIGHMEM available.\n",
350 pages_to_mb(highend_pfn - highstart_pfn));
Jan Beulichba9c2312006-09-26 10:52:31 +0200351 num_physpages = highend_pfn;
352 high_memory = (void *) __va(highstart_pfn * PAGE_SIZE - 1) + 1;
353#else
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700354 num_physpages = max_low_pfn;
355 high_memory = (void *) __va(max_low_pfn * PAGE_SIZE - 1) + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356#endif
357 printk(KERN_NOTICE "%ldMB LOWMEM available.\n",
Yinghai Lu2ec65f82008-06-23 03:05:30 -0700358 pages_to_mb(max_low_pfn));
Yinghai Luc0943452008-06-23 16:41:30 -0700359 printk(KERN_DEBUG "max_low_pfn = %lx, highstart_pfn = %lx\n",
360 max_low_pfn, highstart_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361
Yinghai Luc0943452008-06-23 16:41:30 -0700362 printk(KERN_DEBUG "Low memory ends at vaddr %08lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363 (ulong) pfn_to_kaddr(max_low_pfn));
Tejun Heo0e9f93c2011-04-05 00:23:55 +0200364 for_each_online_node(nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365 allocate_pgdat(nid);
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700366 remap_numa_kva();
367
Yinghai Luc0943452008-06-23 16:41:30 -0700368 printk(KERN_DEBUG "High memory starts at vaddr %08lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369 (ulong) pfn_to_kaddr(highstart_pfn));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370 for_each_online_node(nid)
Ingo Molnarfa5c4632008-04-16 02:29:42 +0200371 propagate_e820_map_node(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700372
Yinghai Lua71edd12009-03-04 01:22:35 -0800373 for_each_online_node(nid) {
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700374 memset(NODE_DATA(nid), 0, sizeof(struct pglist_data));
Yinghai Lu59be5a82010-02-10 01:20:28 -0800375 NODE_DATA(nid)->node_id = nid;
Yinghai Lua71edd12009-03-04 01:22:35 -0800376 }
Yinghai Lu3a58a2a62008-06-24 12:19:41 -0700377
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378 setup_bootmem_allocator();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379}
380
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800381#ifdef CONFIG_MEMORY_HOTPLUG
Adrian Bunkfb8c1772007-10-24 18:24:47 +0200382static int paddr_to_nid(u64 addr)
Yasunori Goto7c7e9422006-12-22 01:11:13 -0800383{
384 int nid;
385 unsigned long pfn = PFN_DOWN(addr);
386
387 for_each_node(nid)
388 if (node_start_pfn[nid] <= pfn &&
389 pfn < node_end_pfn[nid])
390 return nid;
391
392 return -1;
393}
394
395/*
396 * This function is used to ask node id BEFORE memmap and mem_section's
397 * initialization (pfn_to_nid() can't be used yet).
398 * If _PXM is not defined on ACPI's DSDT, node id must be found by this.
399 */
400int memory_add_physaddr_to_nid(u64 addr)
401{
402 int nid = paddr_to_nid(addr);
403 return (nid >= 0) ? nid : 0;
404}
405
406EXPORT_SYMBOL_GPL(memory_add_physaddr_to_nid);
407#endif
Ingo Molnar2772f542008-06-03 10:09:45 +0200408