blob: 1ca228b06a20340d743b8f1a01f3bcca5c6ae4a1 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Handle the memory map.
3 * The functions here do the job until bootmem takes over.
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -07004 *
5 * Getting sanitize_e820_map() in sync with i386 version by applying change:
6 * - Provisions for empty E820 memory regions (reported by certain BIOSes).
7 * Alex Achenbach <xela@slit.de>, December 2002.
8 * Venkatesh Pallipadi <venkatesh.pallipadi@intel.com>
9 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070010 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070011#include <linux/kernel.h>
12#include <linux/types.h>
13#include <linux/init.h>
14#include <linux/bootmem.h>
15#include <linux/ioport.h>
16#include <linux/string.h>
Eric W. Biederman5f5609d2005-06-25 14:58:04 -070017#include <linux/kexec.h>
Andrew Mortonb9491ac2005-09-16 19:27:54 -070018#include <linux/module.h>
Rafael J. Wysockie8eff5a2006-09-25 23:32:46 -070019#include <linux/mm.h>
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -070020#include <linux/suspend.h>
21#include <linux/pfn.h>
Andrew Mortonb9491ac2005-09-16 19:27:54 -070022
Andrew Morton1a91023a2006-07-10 04:43:49 -070023#include <asm/pgtable.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <asm/page.h>
25#include <asm/e820.h>
26#include <asm/proto.h>
H. Peter Anvin30c82642007-10-15 17:13:22 -070027#include <asm/setup.h>
Andi Kleen2bc04142005-11-05 17:25:53 +010028#include <asm/sections.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
Jan Beulichb92e9fa2007-05-02 19:27:11 +020030struct e820map e820;
Andi Kleen3bd4d182006-09-26 10:52:33 +020031
Linus Torvalds1da177e2005-04-16 15:20:36 -070032/*
33 * PFN of last memory page.
34 */
35unsigned long end_pfn;
Andi Kleenf3591ff2005-09-13 11:35:28 +020036EXPORT_SYMBOL(end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -070037
38/*
39 * end_pfn only includes RAM, while end_pfn_map includes all e820 entries.
40 * The direct mapping extends to end_pfn_map, so that we can directly access
41 * apertures, ACPI and other tables without having to play with fixmaps.
42 */
43unsigned long end_pfn_map;
44
45/*
46 * Last pfn which the user wants to use.
47 */
Jan Beulichcaff0712006-09-26 10:52:31 +020048static unsigned long __initdata end_user_pfn = MAXMEM>>PAGE_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -070049
50extern struct resource code_resource, data_resource;
51
52/* Check for some hardcoded bad areas that early boot is not allowed to touch */
53static inline int bad_addr(unsigned long *addrp, unsigned long size)
54{
55 unsigned long addr = *addrp, last = addr + size;
56
57 /* various gunk below that needed for SMP startup */
58 if (addr < 0x8000) {
Vivek Goyal73bb8912006-10-21 18:37:01 +020059 *addrp = PAGE_ALIGN(0x8000);
Linus Torvalds1da177e2005-04-16 15:20:36 -070060 return 1;
61 }
62
63 /* direct mapping tables of the kernel */
64 if (last >= table_start<<PAGE_SHIFT && addr < table_end<<PAGE_SHIFT) {
Vivek Goyal73bb8912006-10-21 18:37:01 +020065 *addrp = PAGE_ALIGN(table_end << PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -070066 return 1;
67 }
68
69 /* initrd */
70#ifdef CONFIG_BLK_DEV_INITRD
H. Peter Anvin30c82642007-10-15 17:13:22 -070071 if (boot_params.hdr.type_of_loader && boot_params.hdr.ramdisk_image) {
72 unsigned long ramdisk_image = boot_params.hdr.ramdisk_image;
73 unsigned long ramdisk_size = boot_params.hdr.ramdisk_size;
74 unsigned long ramdisk_end = ramdisk_image+ramdisk_size;
75
76 if (last >= ramdisk_image && addr < ramdisk_end) {
77 *addrp = PAGE_ALIGN(ramdisk_end);
78 return 1;
79 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070080 }
81#endif
Andi Kleendbf92722006-09-26 10:52:36 +020082 /* kernel code */
Vivek Goyal73bb8912006-10-21 18:37:01 +020083 if (last >= __pa_symbol(&_text) && addr < __pa_symbol(&_end)) {
84 *addrp = PAGE_ALIGN(__pa_symbol(&_end));
Linus Torvalds1da177e2005-04-16 15:20:36 -070085 return 1;
86 }
Andi Kleenac71d122006-05-08 15:17:28 +020087
88 if (last >= ebda_addr && addr < ebda_addr + ebda_size) {
Vivek Goyal73bb8912006-10-21 18:37:01 +020089 *addrp = PAGE_ALIGN(ebda_addr + ebda_size);
Andi Kleenac71d122006-05-08 15:17:28 +020090 return 1;
91 }
92
Amul Shah076422d2007-02-13 13:26:19 +010093#ifdef CONFIG_NUMA
94 /* NUMA memory to node map */
95 if (last >= nodemap_addr && addr < nodemap_addr + nodemap_size) {
96 *addrp = nodemap_addr + nodemap_size;
97 return 1;
98 }
99#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100 /* XXX ramdisk image here? */
101 return 0;
102}
103
Arjan van de Ven95222362006-04-07 19:49:27 +0200104/*
105 * This function checks if any part of the range <start,end> is mapped
106 * with type.
107 */
Jan Beulichb92e9fa2007-05-02 19:27:11 +0200108int
Arjan van de Veneee5a9f2006-04-07 19:49:24 +0200109e820_any_mapped(unsigned long start, unsigned long end, unsigned type)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110{
111 int i;
112 for (i = 0; i < e820.nr_map; i++) {
113 struct e820entry *ei = &e820.map[i];
114 if (type && ei->type != type)
115 continue;
Eric W. Biederman48c8b112005-09-06 15:16:20 -0700116 if (ei->addr >= end || ei->addr + ei->size <= start)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 continue;
118 return 1;
119 }
120 return 0;
121}
Jan Beulichb92e9fa2007-05-02 19:27:11 +0200122EXPORT_SYMBOL_GPL(e820_any_mapped);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123
Linus Torvalds79e453d2006-09-19 08:15:22 -0700124/*
125 * This function checks if the entire range <start,end> is mapped with type.
126 *
127 * Note: this function only works correct if the e820 table is sorted and
128 * not-overlapping, which is the case
129 */
130int __init e820_all_mapped(unsigned long start, unsigned long end, unsigned type)
131{
132 int i;
133 for (i = 0; i < e820.nr_map; i++) {
134 struct e820entry *ei = &e820.map[i];
135 if (type && ei->type != type)
136 continue;
137 /* is the region (part) in overlap with the current region ?*/
138 if (ei->addr >= end || ei->addr + ei->size <= start)
139 continue;
140
141 /* if the region is at the beginning of <start,end> we move
142 * start to the end of the region since it's ok until there
143 */
144 if (ei->addr <= start)
145 start = ei->addr + ei->size;
146 /* if start is now at or beyond end, we're done, full coverage */
147 if (start >= end)
148 return 1; /* we're done */
149 }
150 return 0;
151}
152
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153/*
154 * Find a free area in a specific range.
155 */
156unsigned long __init find_e820_area(unsigned long start, unsigned long end, unsigned size)
157{
158 int i;
159 for (i = 0; i < e820.nr_map; i++) {
160 struct e820entry *ei = &e820.map[i];
161 unsigned long addr = ei->addr, last;
162 if (ei->type != E820_RAM)
163 continue;
164 if (addr < start)
165 addr = start;
166 if (addr > ei->addr + ei->size)
167 continue;
Robert Hentosh7ca97c62006-05-30 22:48:00 +0200168 while (bad_addr(&addr, size) && addr+size <= ei->addr+ei->size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169 ;
Vivek Goyal73bb8912006-10-21 18:37:01 +0200170 last = PAGE_ALIGN(addr) + size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 if (last > ei->addr + ei->size)
172 continue;
173 if (last > end)
174 continue;
175 return addr;
176 }
177 return -1UL;
178}
179
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180/*
181 * Find the highest page frame number we have available
182 */
183unsigned long __init e820_end_of_ram(void)
184{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185 unsigned long end_pfn = 0;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700186 end_pfn = find_max_pfn_with_active_regions();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 if (end_pfn > end_pfn_map)
189 end_pfn_map = end_pfn;
190 if (end_pfn_map > MAXMEM>>PAGE_SHIFT)
191 end_pfn_map = MAXMEM>>PAGE_SHIFT;
192 if (end_pfn > end_user_pfn)
193 end_pfn = end_user_pfn;
194 if (end_pfn > end_pfn_map)
195 end_pfn = end_pfn_map;
196
Mel Gorman5cb248a2006-09-27 01:49:52 -0700197 printk("end_pfn_map = %lu\n", end_pfn_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198 return end_pfn;
199}
200
Andi Kleen485761b2005-08-26 18:34:10 -0700201/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 * Mark e820 reserved areas as busy for the resource manager.
203 */
204void __init e820_reserve_resources(void)
205{
206 int i;
207 for (i = 0; i < e820.nr_map; i++) {
208 struct resource *res;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209 res = alloc_bootmem_low(sizeof(struct resource));
210 switch (e820.map[i].type) {
211 case E820_RAM: res->name = "System RAM"; break;
212 case E820_ACPI: res->name = "ACPI Tables"; break;
213 case E820_NVS: res->name = "ACPI Non-volatile Storage"; break;
214 default: res->name = "reserved";
215 }
216 res->start = e820.map[i].addr;
217 res->end = res->start + e820.map[i].size - 1;
218 res->flags = IORESOURCE_MEM | IORESOURCE_BUSY;
219 request_resource(&iomem_resource, res);
220 if (e820.map[i].type == E820_RAM) {
221 /*
222 * We don't know which RAM region contains kernel data,
223 * so we try it repeatedly and let the resource manager
224 * test it.
225 */
226 request_resource(res, &code_resource);
227 request_resource(res, &data_resource);
Eric W. Biederman5f5609d2005-06-25 14:58:04 -0700228#ifdef CONFIG_KEXEC
Bernhard Walle5c3391f2007-10-18 23:40:59 -0700229 if (crashk_res.start != crashk_res.end)
230 request_resource(res, &crashk_res);
Eric W. Biederman5f5609d2005-06-25 14:58:04 -0700231#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232 }
233 }
234}
235
Rafael J. Wysockie8eff5a2006-09-25 23:32:46 -0700236/*
237 * Find the ranges of physical addresses that do not correspond to
238 * e820 RAM areas and mark the corresponding pages as nosave for software
239 * suspend and suspend to RAM.
240 *
241 * This function requires the e820 map to be sorted and without any
242 * overlapping entries and assumes the first e820 area to be RAM.
243 */
244void __init e820_mark_nosave_regions(void)
245{
246 int i;
247 unsigned long paddr;
248
249 paddr = round_down(e820.map[0].addr + e820.map[0].size, PAGE_SIZE);
250 for (i = 1; i < e820.nr_map; i++) {
251 struct e820entry *ei = &e820.map[i];
252
253 if (paddr < ei->addr)
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700254 register_nosave_region(PFN_DOWN(paddr),
255 PFN_UP(ei->addr));
Rafael J. Wysockie8eff5a2006-09-25 23:32:46 -0700256
257 paddr = round_down(ei->addr + ei->size, PAGE_SIZE);
258 if (ei->type != E820_RAM)
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700259 register_nosave_region(PFN_UP(ei->addr),
260 PFN_DOWN(paddr));
Rafael J. Wysockie8eff5a2006-09-25 23:32:46 -0700261
262 if (paddr >= (end_pfn << PAGE_SHIFT))
263 break;
264 }
265}
266
David Rientjes3af044e2007-07-21 17:10:31 +0200267/*
268 * Finds an active region in the address range from start_pfn to end_pfn and
269 * returns its range in ei_startpfn and ei_endpfn for the e820 entry.
270 */
271static int __init e820_find_active_region(const struct e820entry *ei,
272 unsigned long start_pfn,
273 unsigned long end_pfn,
274 unsigned long *ei_startpfn,
275 unsigned long *ei_endpfn)
276{
277 *ei_startpfn = round_up(ei->addr, PAGE_SIZE) >> PAGE_SHIFT;
278 *ei_endpfn = round_down(ei->addr + ei->size, PAGE_SIZE) >> PAGE_SHIFT;
279
280 /* Skip map entries smaller than a page */
281 if (*ei_startpfn >= *ei_endpfn)
282 return 0;
283
284 /* Check if end_pfn_map should be updated */
285 if (ei->type != E820_RAM && *ei_endpfn > end_pfn_map)
286 end_pfn_map = *ei_endpfn;
287
288 /* Skip if map is outside the node */
289 if (ei->type != E820_RAM || *ei_endpfn <= start_pfn ||
290 *ei_startpfn >= end_pfn)
291 return 0;
292
293 /* Check for overlaps */
294 if (*ei_startpfn < start_pfn)
295 *ei_startpfn = start_pfn;
296 if (*ei_endpfn > end_pfn)
297 *ei_endpfn = end_pfn;
298
299 /* Obey end_user_pfn to save on memmap */
300 if (*ei_startpfn >= end_user_pfn)
301 return 0;
302 if (*ei_endpfn > end_user_pfn)
303 *ei_endpfn = end_user_pfn;
304
305 return 1;
306}
307
Mel Gorman5cb248a2006-09-27 01:49:52 -0700308/* Walk the e820 map and register active regions within a node */
309void __init
310e820_register_active_regions(int nid, unsigned long start_pfn,
311 unsigned long end_pfn)
312{
David Rientjes3af044e2007-07-21 17:10:31 +0200313 unsigned long ei_startpfn;
314 unsigned long ei_endpfn;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700315 int i;
Mel Gorman5cb248a2006-09-27 01:49:52 -0700316
David Rientjes3af044e2007-07-21 17:10:31 +0200317 for (i = 0; i < e820.nr_map; i++)
318 if (e820_find_active_region(&e820.map[i],
319 start_pfn, end_pfn,
320 &ei_startpfn, &ei_endpfn))
321 add_active_range(nid, ei_startpfn, ei_endpfn);
Mel Gorman5cb248a2006-09-27 01:49:52 -0700322}
323
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324/*
325 * Add a memory region to the kernel e820 map.
326 */
327void __init add_memory_region(unsigned long start, unsigned long size, int type)
328{
329 int x = e820.nr_map;
330
331 if (x == E820MAX) {
332 printk(KERN_ERR "Ooops! Too many entries in the memory map!\n");
333 return;
334 }
335
336 e820.map[x].addr = start;
337 e820.map[x].size = size;
338 e820.map[x].type = type;
339 e820.nr_map++;
340}
341
David Rientjesa7e96622007-07-21 17:11:29 +0200342/*
343 * Find the hole size (in bytes) in the memory range.
344 * @start: starting address of the memory range to scan
345 * @end: ending address of the memory range to scan
346 */
347unsigned long __init e820_hole_size(unsigned long start, unsigned long end)
348{
349 unsigned long start_pfn = start >> PAGE_SHIFT;
350 unsigned long end_pfn = end >> PAGE_SHIFT;
351 unsigned long ei_startpfn;
352 unsigned long ei_endpfn;
353 unsigned long ram = 0;
354 int i;
355
356 for (i = 0; i < e820.nr_map; i++) {
357 if (e820_find_active_region(&e820.map[i],
358 start_pfn, end_pfn,
359 &ei_startpfn, &ei_endpfn))
360 ram += ei_endpfn - ei_startpfn;
361 }
362 return end - start - (ram << PAGE_SHIFT);
363}
364
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365void __init e820_print_map(char *who)
366{
367 int i;
368
369 for (i = 0; i < e820.nr_map; i++) {
Dan Aloni5a3ece72007-07-21 17:11:37 +0200370 printk(KERN_INFO " %s: %016Lx - %016Lx ", who,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371 (unsigned long long) e820.map[i].addr,
372 (unsigned long long) (e820.map[i].addr + e820.map[i].size));
373 switch (e820.map[i].type) {
374 case E820_RAM: printk("(usable)\n");
375 break;
376 case E820_RESERVED:
377 printk("(reserved)\n");
378 break;
379 case E820_ACPI:
380 printk("(ACPI data)\n");
381 break;
382 case E820_NVS:
383 printk("(ACPI NVS)\n");
384 break;
385 default: printk("type %u\n", e820.map[i].type);
386 break;
387 }
388 }
389}
390
391/*
392 * Sanitize the BIOS e820 map.
393 *
394 * Some e820 responses include overlapping entries. The following
395 * replaces the original e820 map with a new one, removing overlaps.
396 *
397 */
398static int __init sanitize_e820_map(struct e820entry * biosmap, char * pnr_map)
399{
400 struct change_member {
401 struct e820entry *pbios; /* pointer to original bios entry */
402 unsigned long long addr; /* address for this change point */
403 };
404 static struct change_member change_point_list[2*E820MAX] __initdata;
405 static struct change_member *change_point[2*E820MAX] __initdata;
406 static struct e820entry *overlap_list[E820MAX] __initdata;
407 static struct e820entry new_bios[E820MAX] __initdata;
408 struct change_member *change_tmp;
409 unsigned long current_type, last_type;
410 unsigned long long last_addr;
411 int chgidx, still_changing;
412 int overlap_entries;
413 int new_bios_entry;
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700414 int old_nr, new_nr, chg_nr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 int i;
416
417 /*
418 Visually we're performing the following (1,2,3,4 = memory types)...
419
420 Sample memory map (w/overlaps):
421 ____22__________________
422 ______________________4_
423 ____1111________________
424 _44_____________________
425 11111111________________
426 ____________________33__
427 ___________44___________
428 __________33333_________
429 ______________22________
430 ___________________2222_
431 _________111111111______
432 _____________________11_
433 _________________4______
434
435 Sanitized equivalent (no overlap):
436 1_______________________
437 _44_____________________
438 ___1____________________
439 ____22__________________
440 ______11________________
441 _________1______________
442 __________3_____________
443 ___________44___________
444 _____________33_________
445 _______________2________
446 ________________1_______
447 _________________4______
448 ___________________2____
449 ____________________33__
450 ______________________4_
451 */
452
453 /* if there's only one memory region, don't bother */
454 if (*pnr_map < 2)
455 return -1;
456
457 old_nr = *pnr_map;
458
459 /* bail out if we find any unreasonable addresses in bios map */
460 for (i=0; i<old_nr; i++)
461 if (biosmap[i].addr + biosmap[i].size < biosmap[i].addr)
462 return -1;
463
464 /* create pointers for initial change-point information (for sorting) */
465 for (i=0; i < 2*old_nr; i++)
466 change_point[i] = &change_point_list[i];
467
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700468 /* record all known change-points (starting and ending addresses),
469 omitting those that are for empty memory regions */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470 chgidx = 0;
471 for (i=0; i < old_nr; i++) {
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700472 if (biosmap[i].size != 0) {
473 change_point[chgidx]->addr = biosmap[i].addr;
474 change_point[chgidx++]->pbios = &biosmap[i];
475 change_point[chgidx]->addr = biosmap[i].addr + biosmap[i].size;
476 change_point[chgidx++]->pbios = &biosmap[i];
477 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478 }
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700479 chg_nr = chgidx;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480
481 /* sort change-point list by memory addresses (low -> high) */
482 still_changing = 1;
483 while (still_changing) {
484 still_changing = 0;
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700485 for (i=1; i < chg_nr; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486 /* if <current_addr> > <last_addr>, swap */
487 /* or, if current=<start_addr> & last=<end_addr>, swap */
488 if ((change_point[i]->addr < change_point[i-1]->addr) ||
489 ((change_point[i]->addr == change_point[i-1]->addr) &&
490 (change_point[i]->addr == change_point[i]->pbios->addr) &&
491 (change_point[i-1]->addr != change_point[i-1]->pbios->addr))
492 )
493 {
494 change_tmp = change_point[i];
495 change_point[i] = change_point[i-1];
496 change_point[i-1] = change_tmp;
497 still_changing=1;
498 }
499 }
500 }
501
502 /* create a new bios memory map, removing overlaps */
503 overlap_entries=0; /* number of entries in the overlap table */
504 new_bios_entry=0; /* index for creating new bios map entries */
505 last_type = 0; /* start with undefined memory type */
506 last_addr = 0; /* start with 0 as last starting address */
507 /* loop through change-points, determining affect on the new bios map */
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700508 for (chgidx=0; chgidx < chg_nr; chgidx++)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 {
510 /* keep track of all overlapping bios entries */
511 if (change_point[chgidx]->addr == change_point[chgidx]->pbios->addr)
512 {
513 /* add map entry to overlap list (> 1 entry implies an overlap) */
514 overlap_list[overlap_entries++]=change_point[chgidx]->pbios;
515 }
516 else
517 {
518 /* remove entry from list (order independent, so swap with last) */
519 for (i=0; i<overlap_entries; i++)
520 {
521 if (overlap_list[i] == change_point[chgidx]->pbios)
522 overlap_list[i] = overlap_list[overlap_entries-1];
523 }
524 overlap_entries--;
525 }
526 /* if there are overlapping entries, decide which "type" to use */
527 /* (larger value takes precedence -- 1=usable, 2,3,4,4+=unusable) */
528 current_type = 0;
529 for (i=0; i<overlap_entries; i++)
530 if (overlap_list[i]->type > current_type)
531 current_type = overlap_list[i]->type;
532 /* continue building up new bios map based on this information */
533 if (current_type != last_type) {
534 if (last_type != 0) {
535 new_bios[new_bios_entry].size =
536 change_point[chgidx]->addr - last_addr;
537 /* move forward only if the new size was non-zero */
538 if (new_bios[new_bios_entry].size != 0)
539 if (++new_bios_entry >= E820MAX)
540 break; /* no more space left for new bios entries */
541 }
542 if (current_type != 0) {
543 new_bios[new_bios_entry].addr = change_point[chgidx]->addr;
544 new_bios[new_bios_entry].type = current_type;
545 last_addr=change_point[chgidx]->addr;
546 }
547 last_type = current_type;
548 }
549 }
550 new_nr = new_bios_entry; /* retain count for new bios entries */
551
552 /* copy new bios mapping into original location */
553 memcpy(biosmap, new_bios, new_nr*sizeof(struct e820entry));
554 *pnr_map = new_nr;
555
556 return 0;
557}
558
559/*
560 * Copy the BIOS e820 map into a safe place.
561 *
562 * Sanity-check it while we're at it..
563 *
564 * If we're lucky and live on a modern system, the setup code
565 * will have given us a memory map that we can use to properly
566 * set up memory. If we aren't, we'll fake a memory map.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567 */
568static int __init copy_e820_map(struct e820entry * biosmap, int nr_map)
569{
570 /* Only one memory region (or negative)? Ignore it */
571 if (nr_map < 2)
572 return -1;
573
574 do {
575 unsigned long start = biosmap->addr;
576 unsigned long size = biosmap->size;
577 unsigned long end = start + size;
578 unsigned long type = biosmap->type;
579
580 /* Overflow in 64 bits? Ignore the memory map. */
581 if (start > end)
582 return -1;
583
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584 add_memory_region(start, size, type);
585 } while (biosmap++,--nr_map);
586 return 0;
587}
588
Andi Kleen8380aab2006-09-26 10:52:37 +0200589void early_panic(char *msg)
590{
591 early_printk(msg);
592 panic(msg);
593}
594
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595void __init setup_memory_region(void)
596{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700597 /*
598 * Try to copy the BIOS-supplied E820-map.
599 *
600 * Otherwise fake a memory map; one section from 0k->640k,
601 * the next section from 1mb->appropriate_mem_k
602 */
H. Peter Anvin30c82642007-10-15 17:13:22 -0700603 sanitize_e820_map(boot_params.e820_map, &boot_params.e820_entries);
604 if (copy_e820_map(boot_params.e820_map, boot_params.e820_entries) < 0)
Andi Kleen8380aab2006-09-26 10:52:37 +0200605 early_panic("Cannot find a valid memory map");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700606 printk(KERN_INFO "BIOS-provided physical RAM map:\n");
Andi Kleen8380aab2006-09-26 10:52:37 +0200607 e820_print_map("BIOS-e820");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608}
609
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200610static int __init parse_memopt(char *p)
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800611{
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200612 if (!p)
613 return -EINVAL;
614 end_user_pfn = memparse(p, &p);
615 end_user_pfn >>= PAGE_SHIFT;
616 return 0;
617}
618early_param("mem", parse_memopt);
619
620static int userdef __initdata;
621
622static int __init parse_memmap_opt(char *p)
623{
624 char *oldp;
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800625 unsigned long long start_at, mem_size;
626
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200627 if (!strcmp(p, "exactmap")) {
628#ifdef CONFIG_CRASH_DUMP
629 /* If we are doing a crash dump, we
630 * still need to know the real mem
631 * size before original memory map is
632 * reset.
633 */
Magnus Damm15803a42006-11-14 16:57:46 +0100634 e820_register_active_regions(0, 0, -1UL);
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200635 saved_max_pfn = e820_end_of_ram();
Magnus Damm15803a42006-11-14 16:57:46 +0100636 remove_all_active_ranges();
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200637#endif
638 end_pfn_map = 0;
639 e820.nr_map = 0;
640 userdef = 1;
641 return 0;
642 }
643
644 oldp = p;
645 mem_size = memparse(p, &p);
646 if (p == oldp)
647 return -EINVAL;
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800648 if (*p == '@') {
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200649 start_at = memparse(p+1, &p);
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800650 add_memory_region(start_at, mem_size, E820_RAM);
651 } else if (*p == '#') {
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200652 start_at = memparse(p+1, &p);
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800653 add_memory_region(start_at, mem_size, E820_ACPI);
654 } else if (*p == '$') {
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200655 start_at = memparse(p+1, &p);
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800656 add_memory_region(start_at, mem_size, E820_RESERVED);
657 } else {
658 end_user_pfn = (mem_size >> PAGE_SHIFT);
659 }
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200660 return *p == '\0' ? 0 : -EINVAL;
661}
662early_param("memmap", parse_memmap_opt);
663
Sam Ravnborg43999d92007-03-16 21:07:36 +0100664void __init finish_e820_parsing(void)
Andi Kleen2c8c0e62006-09-26 10:52:32 +0200665{
666 if (userdef) {
667 printk(KERN_INFO "user-defined physical RAM map:\n");
668 e820_print_map("user");
669 }
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800670}
671
Andi Kleena1e97782005-04-16 15:25:12 -0700672unsigned long pci_mem_start = 0xaeedbabe;
Andi Kleen2ee60e172006-06-26 13:59:44 +0200673EXPORT_SYMBOL(pci_mem_start);
Andi Kleena1e97782005-04-16 15:25:12 -0700674
675/*
676 * Search for the biggest gap in the low 32 bits of the e820
677 * memory space. We pass this space to PCI to assign MMIO resources
678 * for hotplug or unconfigured devices in.
679 * Hopefully the BIOS let enough space left.
680 */
681__init void e820_setup_gap(void)
682{
Daniel Ritzf0eca962005-09-09 00:57:14 +0200683 unsigned long gapstart, gapsize, round;
Andi Kleena1e97782005-04-16 15:25:12 -0700684 unsigned long last;
685 int i;
686 int found = 0;
687
688 last = 0x100000000ull;
689 gapstart = 0x10000000;
690 gapsize = 0x400000;
691 i = e820.nr_map;
692 while (--i >= 0) {
693 unsigned long long start = e820.map[i].addr;
694 unsigned long long end = start + e820.map[i].size;
695
696 /*
697 * Since "last" is at most 4GB, we know we'll
698 * fit in 32 bits if this condition is true
699 */
700 if (last > end) {
701 unsigned long gap = last - end;
702
703 if (gap > gapsize) {
704 gapsize = gap;
705 gapstart = end;
706 found = 1;
707 }
708 }
709 if (start < last)
710 last = start;
711 }
712
713 if (!found) {
714 gapstart = (end_pfn << PAGE_SHIFT) + 1024*1024;
715 printk(KERN_ERR "PCI: Warning: Cannot find a gap in the 32bit address range\n"
716 KERN_ERR "PCI: Unassigned devices with 32bit resource registers may break!\n");
717 }
718
719 /*
Daniel Ritzf0eca962005-09-09 00:57:14 +0200720 * See how much we want to round up: start off with
721 * rounding to the next 1MB area.
Andi Kleena1e97782005-04-16 15:25:12 -0700722 */
Daniel Ritzf0eca962005-09-09 00:57:14 +0200723 round = 0x100000;
724 while ((gapsize >> 4) > round)
725 round += round;
726 /* Fun with two's complement */
727 pci_mem_start = (gapstart + round) & -round;
Andi Kleena1e97782005-04-16 15:25:12 -0700728
729 printk(KERN_INFO "Allocating PCI resources starting at %lx (gap: %lx:%lx)\n",
730 pci_mem_start, gapstart, gapsize);
731}
Keshavamurthy, Anil Se8204822007-10-21 16:41:55 -0700732
733int __init arch_get_ram_range(int slot, u64 *addr, u64 *size)
734{
735 int i;
736
737 if (slot < 0 || slot >= e820.nr_map)
738 return -1;
739 for (i = slot; i < e820.nr_map; i++) {
740 if (e820.map[i].type != E820_RAM)
741 continue;
742 break;
743 }
744 if (i == e820.nr_map || e820.map[i].addr > (max_pfn << PAGE_SHIFT))
745 return -1;
746 *addr = e820.map[i].addr;
747 *size = min_t(u64, e820.map[i].size + e820.map[i].addr,
748 max_pfn << PAGE_SHIFT) - *addr;
749 return i + 1;
750}