2008-05-11 07:30:15 +00:00
|
|
|
/*
|
|
|
|
* Handle the memory map.
|
|
|
|
* The functions here do the job until bootmem takes over.
|
|
|
|
*
|
|
|
|
* Getting sanitize_e820_map() in sync with i386 version by applying change:
|
|
|
|
* - Provisions for empty E820 memory regions (reported by certain BIOSes).
|
|
|
|
* Alex Achenbach <xela@slit.de>, December 2002.
|
|
|
|
* Venkatesh Pallipadi <venkatesh.pallipadi@intel.com>
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/init.h>
|
2011-03-23 23:43:29 +00:00
|
|
|
#include <linux/crash_dump.h>
|
2011-05-26 16:22:53 +00:00
|
|
|
#include <linux/export.h>
|
2008-05-11 07:30:15 +00:00
|
|
|
#include <linux/bootmem.h>
|
|
|
|
#include <linux/pfn.h>
|
2008-05-21 03:10:58 +00:00
|
|
|
#include <linux/suspend.h>
|
2011-01-07 00:43:44 +00:00
|
|
|
#include <linux/acpi.h>
|
2008-06-27 11:12:55 +00:00
|
|
|
#include <linux/firmware-map.h>
|
2010-08-25 20:39:17 +00:00
|
|
|
#include <linux/memblock.h>
|
2008-05-11 07:30:15 +00:00
|
|
|
|
|
|
|
#include <asm/e820.h>
|
2008-05-18 08:18:57 +00:00
|
|
|
#include <asm/proto.h>
|
2008-05-11 07:30:15 +00:00
|
|
|
#include <asm/setup.h>
|
|
|
|
|
2008-06-27 11:12:55 +00:00
|
|
|
/*
|
|
|
|
* The e820 map is the map that gets modified e.g. with command line parameters
|
|
|
|
* and that is also registered with modifications in the kernel resource tree
|
|
|
|
* with the iomem_resource as parent.
|
|
|
|
*
|
|
|
|
* The e820_saved is directly saved after the BIOS-provided memory map is
|
|
|
|
* copied. It doesn't get modified afterwards. It's registered for the
|
|
|
|
* /sys/firmware/memmap interface.
|
|
|
|
*
|
|
|
|
* That memory map is not modified and is used as base for kexec. The kexec'd
|
|
|
|
* kernel should get the same memory map as the firmware provides. Then the
|
|
|
|
* user can e.g. boot the original kernel with mem=1G while still booting the
|
|
|
|
* next kernel with full memory.
|
|
|
|
*/
|
2008-05-11 07:30:15 +00:00
|
|
|
struct e820map e820;
|
2008-06-27 11:12:55 +00:00
|
|
|
struct e820map e820_saved;
|
2008-05-11 07:30:15 +00:00
|
|
|
|
|
|
|
/* For PCI or other memory-mapped resources */
|
|
|
|
unsigned long pci_mem_start = 0xaeedbabe;
|
|
|
|
#ifdef CONFIG_PCI
|
|
|
|
EXPORT_SYMBOL(pci_mem_start);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function checks if any part of the range <start,end> is mapped
|
|
|
|
* with type.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
e820_any_mapped(u64 start, u64 end, unsigned type)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
|
|
|
|
if (type && ei->type != type)
|
|
|
|
continue;
|
|
|
|
if (ei->addr >= end || ei->addr + ei->size <= start)
|
|
|
|
continue;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(e820_any_mapped);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function checks if the entire range <start,end> is mapped with type.
|
|
|
|
*
|
|
|
|
* Note: this function only works correct if the e820 table is sorted and
|
|
|
|
* not-overlapping, which is the case
|
|
|
|
*/
|
|
|
|
int __init e820_all_mapped(u64 start, u64 end, unsigned type)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
|
|
|
|
if (type && ei->type != type)
|
|
|
|
continue;
|
|
|
|
/* is the region (part) in overlap with the current region ?*/
|
|
|
|
if (ei->addr >= end || ei->addr + ei->size <= start)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* if the region is at the beginning of <start,end> we move
|
|
|
|
* start to the end of the region since it's ok until there
|
|
|
|
*/
|
|
|
|
if (ei->addr <= start)
|
|
|
|
start = ei->addr + ei->size;
|
|
|
|
/*
|
|
|
|
* if start is now at or beyond end, we're done, full
|
|
|
|
* coverage
|
|
|
|
*/
|
|
|
|
if (start >= end)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add a memory region to the kernel e820 map.
|
|
|
|
*/
|
2009-03-13 04:35:18 +00:00
|
|
|
static void __init __e820_add_region(struct e820map *e820x, u64 start, u64 size,
|
|
|
|
int type)
|
2008-05-11 07:30:15 +00:00
|
|
|
{
|
2009-03-13 04:35:18 +00:00
|
|
|
int x = e820x->nr_map;
|
2008-05-11 07:30:15 +00:00
|
|
|
|
2009-08-24 17:53:37 +00:00
|
|
|
if (x >= ARRAY_SIZE(e820x->map)) {
|
2008-05-11 07:30:15 +00:00
|
|
|
printk(KERN_ERR "Ooops! Too many entries in the memory map!\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-03-13 04:35:18 +00:00
|
|
|
e820x->map[x].addr = start;
|
|
|
|
e820x->map[x].size = size;
|
|
|
|
e820x->map[x].type = type;
|
|
|
|
e820x->nr_map++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void __init e820_add_region(u64 start, u64 size, int type)
|
|
|
|
{
|
|
|
|
__e820_add_region(&e820, start, size, type);
|
2008-05-11 07:30:15 +00:00
|
|
|
}
|
|
|
|
|
2009-03-15 07:59:19 +00:00
|
|
|
static void __init e820_print_type(u32 type)
|
|
|
|
{
|
|
|
|
switch (type) {
|
|
|
|
case E820_RAM:
|
|
|
|
case E820_RESERVED_KERN:
|
|
|
|
printk(KERN_CONT "(usable)");
|
|
|
|
break;
|
|
|
|
case E820_RESERVED:
|
|
|
|
printk(KERN_CONT "(reserved)");
|
|
|
|
break;
|
|
|
|
case E820_ACPI:
|
|
|
|
printk(KERN_CONT "(ACPI data)");
|
|
|
|
break;
|
|
|
|
case E820_NVS:
|
|
|
|
printk(KERN_CONT "(ACPI NVS)");
|
|
|
|
break;
|
|
|
|
case E820_UNUSABLE:
|
|
|
|
printk(KERN_CONT "(unusable)");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printk(KERN_CONT "type %u", type);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
void __init e820_print_map(char *who)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
printk(KERN_INFO " %s: %016Lx - %016Lx ", who,
|
|
|
|
(unsigned long long) e820.map[i].addr,
|
|
|
|
(unsigned long long)
|
|
|
|
(e820.map[i].addr + e820.map[i].size));
|
2009-03-15 07:59:19 +00:00
|
|
|
e820_print_type(e820.map[i].type);
|
|
|
|
printk(KERN_CONT "\n");
|
2008-05-11 07:30:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sanitize the BIOS e820 map.
|
|
|
|
*
|
|
|
|
* Some e820 responses include overlapping entries. The following
|
2008-05-14 15:15:52 +00:00
|
|
|
* replaces the original e820 map with a new one, removing overlaps,
|
|
|
|
* and resolving conflicting memory types in favor of highest
|
|
|
|
* numbered type.
|
2008-05-11 07:30:15 +00:00
|
|
|
*
|
2008-05-14 15:15:52 +00:00
|
|
|
* The input parameter biosmap points to an array of 'struct
|
|
|
|
* e820entry' which on entry has elements in the range [0, *pnr_map)
|
|
|
|
* valid, and which has space for up to max_nr_map entries.
|
|
|
|
* On return, the resulting sanitized e820 map entries will be in
|
|
|
|
* overwritten in the same location, starting at biosmap.
|
|
|
|
*
|
|
|
|
* The integer pointed to by pnr_map must be valid on entry (the
|
|
|
|
* current number of valid entries located at biosmap) and will
|
|
|
|
* be updated on return, with the new number of valid entries
|
|
|
|
* (something no more than max_nr_map.)
|
|
|
|
*
|
|
|
|
* The return value from sanitize_e820_map() is zero if it
|
|
|
|
* successfully 'sanitized' the map entries passed in, and is -1
|
|
|
|
* if it did nothing, which can happen if either of (1) it was
|
|
|
|
* only passed one map entry, or (2) any of the input map entries
|
|
|
|
* were invalid (start + size < start, meaning that the size was
|
|
|
|
* so big the described memory range wrapped around through zero.)
|
|
|
|
*
|
|
|
|
* Visually we're performing the following
|
|
|
|
* (1,2,3,4 = memory types)...
|
|
|
|
*
|
|
|
|
* Sample memory map (w/overlaps):
|
|
|
|
* ____22__________________
|
|
|
|
* ______________________4_
|
|
|
|
* ____1111________________
|
|
|
|
* _44_____________________
|
|
|
|
* 11111111________________
|
|
|
|
* ____________________33__
|
|
|
|
* ___________44___________
|
|
|
|
* __________33333_________
|
|
|
|
* ______________22________
|
|
|
|
* ___________________2222_
|
|
|
|
* _________111111111______
|
|
|
|
* _____________________11_
|
|
|
|
* _________________4______
|
|
|
|
*
|
|
|
|
* Sanitized equivalent (no overlap):
|
|
|
|
* 1_______________________
|
|
|
|
* _44_____________________
|
|
|
|
* ___1____________________
|
|
|
|
* ____22__________________
|
|
|
|
* ______11________________
|
|
|
|
* _________1______________
|
|
|
|
* __________3_____________
|
|
|
|
* ___________44___________
|
|
|
|
* _____________33_________
|
|
|
|
* _______________2________
|
|
|
|
* ________________1_______
|
|
|
|
* _________________4______
|
|
|
|
* ___________________2____
|
|
|
|
* ____________________33__
|
|
|
|
* ______________________4_
|
2008-05-11 07:30:15 +00:00
|
|
|
*/
|
2008-05-14 15:15:52 +00:00
|
|
|
|
2008-05-14 15:15:34 +00:00
|
|
|
int __init sanitize_e820_map(struct e820entry *biosmap, int max_nr_map,
|
2009-03-22 20:43:01 +00:00
|
|
|
u32 *pnr_map)
|
2008-05-11 07:30:15 +00:00
|
|
|
{
|
|
|
|
struct change_member {
|
|
|
|
struct e820entry *pbios; /* pointer to original bios entry */
|
|
|
|
unsigned long long addr; /* address for this change point */
|
|
|
|
};
|
2008-06-22 14:21:57 +00:00
|
|
|
static struct change_member change_point_list[2*E820_X_MAX] __initdata;
|
|
|
|
static struct change_member *change_point[2*E820_X_MAX] __initdata;
|
|
|
|
static struct e820entry *overlap_list[E820_X_MAX] __initdata;
|
|
|
|
static struct e820entry new_bios[E820_X_MAX] __initdata;
|
2008-05-11 07:30:15 +00:00
|
|
|
struct change_member *change_tmp;
|
|
|
|
unsigned long current_type, last_type;
|
|
|
|
unsigned long long last_addr;
|
|
|
|
int chgidx, still_changing;
|
|
|
|
int overlap_entries;
|
|
|
|
int new_bios_entry;
|
|
|
|
int old_nr, new_nr, chg_nr;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* if there's only one memory region, don't bother */
|
|
|
|
if (*pnr_map < 2)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
old_nr = *pnr_map;
|
2008-05-14 15:15:46 +00:00
|
|
|
BUG_ON(old_nr > max_nr_map);
|
2008-05-11 07:30:15 +00:00
|
|
|
|
|
|
|
/* bail out if we find any unreasonable addresses in bios map */
|
|
|
|
for (i = 0; i < old_nr; i++)
|
|
|
|
if (biosmap[i].addr + biosmap[i].size < biosmap[i].addr)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* create pointers for initial change-point information (for sorting) */
|
|
|
|
for (i = 0; i < 2 * old_nr; i++)
|
|
|
|
change_point[i] = &change_point_list[i];
|
|
|
|
|
|
|
|
/* record all known change-points (starting and ending addresses),
|
|
|
|
omitting those that are for empty memory regions */
|
|
|
|
chgidx = 0;
|
|
|
|
for (i = 0; i < old_nr; i++) {
|
|
|
|
if (biosmap[i].size != 0) {
|
|
|
|
change_point[chgidx]->addr = biosmap[i].addr;
|
|
|
|
change_point[chgidx++]->pbios = &biosmap[i];
|
|
|
|
change_point[chgidx]->addr = biosmap[i].addr +
|
|
|
|
biosmap[i].size;
|
|
|
|
change_point[chgidx++]->pbios = &biosmap[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
chg_nr = chgidx;
|
|
|
|
|
|
|
|
/* sort change-point list by memory addresses (low -> high) */
|
|
|
|
still_changing = 1;
|
|
|
|
while (still_changing) {
|
|
|
|
still_changing = 0;
|
|
|
|
for (i = 1; i < chg_nr; i++) {
|
|
|
|
unsigned long long curaddr, lastaddr;
|
|
|
|
unsigned long long curpbaddr, lastpbaddr;
|
|
|
|
|
|
|
|
curaddr = change_point[i]->addr;
|
|
|
|
lastaddr = change_point[i - 1]->addr;
|
|
|
|
curpbaddr = change_point[i]->pbios->addr;
|
|
|
|
lastpbaddr = change_point[i - 1]->pbios->addr;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* swap entries, when:
|
|
|
|
*
|
|
|
|
* curaddr > lastaddr or
|
|
|
|
* curaddr == lastaddr and curaddr == curpbaddr and
|
|
|
|
* lastaddr != lastpbaddr
|
|
|
|
*/
|
|
|
|
if (curaddr < lastaddr ||
|
|
|
|
(curaddr == lastaddr && curaddr == curpbaddr &&
|
|
|
|
lastaddr != lastpbaddr)) {
|
|
|
|
change_tmp = change_point[i];
|
|
|
|
change_point[i] = change_point[i-1];
|
|
|
|
change_point[i-1] = change_tmp;
|
|
|
|
still_changing = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* create a new bios memory map, removing overlaps */
|
|
|
|
overlap_entries = 0; /* number of entries in the overlap table */
|
|
|
|
new_bios_entry = 0; /* index for creating new bios map entries */
|
|
|
|
last_type = 0; /* start with undefined memory type */
|
|
|
|
last_addr = 0; /* start with 0 as last starting address */
|
|
|
|
|
|
|
|
/* loop through change-points, determining affect on the new bios map */
|
|
|
|
for (chgidx = 0; chgidx < chg_nr; chgidx++) {
|
|
|
|
/* keep track of all overlapping bios entries */
|
|
|
|
if (change_point[chgidx]->addr ==
|
|
|
|
change_point[chgidx]->pbios->addr) {
|
|
|
|
/*
|
|
|
|
* add map entry to overlap list (> 1 entry
|
|
|
|
* implies an overlap)
|
|
|
|
*/
|
|
|
|
overlap_list[overlap_entries++] =
|
|
|
|
change_point[chgidx]->pbios;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* remove entry from list (order independent,
|
|
|
|
* so swap with last)
|
|
|
|
*/
|
|
|
|
for (i = 0; i < overlap_entries; i++) {
|
|
|
|
if (overlap_list[i] ==
|
|
|
|
change_point[chgidx]->pbios)
|
|
|
|
overlap_list[i] =
|
|
|
|
overlap_list[overlap_entries-1];
|
|
|
|
}
|
|
|
|
overlap_entries--;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* if there are overlapping entries, decide which
|
|
|
|
* "type" to use (larger value takes precedence --
|
|
|
|
* 1=usable, 2,3,4,4+=unusable)
|
|
|
|
*/
|
|
|
|
current_type = 0;
|
|
|
|
for (i = 0; i < overlap_entries; i++)
|
|
|
|
if (overlap_list[i]->type > current_type)
|
|
|
|
current_type = overlap_list[i]->type;
|
|
|
|
/*
|
|
|
|
* continue building up new bios map based on this
|
|
|
|
* information
|
|
|
|
*/
|
|
|
|
if (current_type != last_type) {
|
|
|
|
if (last_type != 0) {
|
|
|
|
new_bios[new_bios_entry].size =
|
|
|
|
change_point[chgidx]->addr - last_addr;
|
|
|
|
/*
|
|
|
|
* move forward only if the new size
|
|
|
|
* was non-zero
|
|
|
|
*/
|
|
|
|
if (new_bios[new_bios_entry].size != 0)
|
|
|
|
/*
|
|
|
|
* no more space left for new
|
|
|
|
* bios entries ?
|
|
|
|
*/
|
2008-05-14 15:15:34 +00:00
|
|
|
if (++new_bios_entry >= max_nr_map)
|
2008-05-11 07:30:15 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (current_type != 0) {
|
|
|
|
new_bios[new_bios_entry].addr =
|
|
|
|
change_point[chgidx]->addr;
|
|
|
|
new_bios[new_bios_entry].type = current_type;
|
|
|
|
last_addr = change_point[chgidx]->addr;
|
|
|
|
}
|
|
|
|
last_type = current_type;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* retain count for new bios entries */
|
|
|
|
new_nr = new_bios_entry;
|
|
|
|
|
|
|
|
/* copy new bios mapping into original location */
|
|
|
|
memcpy(biosmap, new_bios, new_nr * sizeof(struct e820entry));
|
|
|
|
*pnr_map = new_nr;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-07-02 03:02:16 +00:00
|
|
|
static int __init __append_e820_map(struct e820entry *biosmap, int nr_map)
|
2008-06-11 03:33:39 +00:00
|
|
|
{
|
|
|
|
while (nr_map) {
|
|
|
|
u64 start = biosmap->addr;
|
|
|
|
u64 size = biosmap->size;
|
|
|
|
u64 end = start + size;
|
|
|
|
u32 type = biosmap->type;
|
|
|
|
|
|
|
|
/* Overflow in 64 bits? Ignore the memory map. */
|
|
|
|
if (start > end)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
e820_add_region(start, size, type);
|
|
|
|
|
|
|
|
biosmap++;
|
|
|
|
nr_map--;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
/*
|
|
|
|
* Copy the BIOS e820 map into a safe place.
|
|
|
|
*
|
|
|
|
* Sanity-check it while we're at it..
|
|
|
|
*
|
|
|
|
* If we're lucky and live on a modern system, the setup code
|
|
|
|
* will have given us a memory map that we can use to properly
|
|
|
|
* set up memory. If we aren't, we'll fake a memory map.
|
|
|
|
*/
|
2008-07-02 03:02:16 +00:00
|
|
|
static int __init append_e820_map(struct e820entry *biosmap, int nr_map)
|
2008-05-11 07:30:15 +00:00
|
|
|
{
|
|
|
|
/* Only one memory region (or negative)? Ignore it */
|
|
|
|
if (nr_map < 2)
|
|
|
|
return -1;
|
|
|
|
|
2008-07-02 03:02:16 +00:00
|
|
|
return __append_e820_map(biosmap, nr_map);
|
2008-05-11 07:30:15 +00:00
|
|
|
}
|
|
|
|
|
2009-03-13 04:35:18 +00:00
|
|
|
static u64 __init __e820_update_range(struct e820map *e820x, u64 start,
|
2008-07-03 18:39:00 +00:00
|
|
|
u64 size, unsigned old_type,
|
|
|
|
unsigned new_type)
|
2008-05-11 07:30:15 +00:00
|
|
|
{
|
2009-03-13 05:36:01 +00:00
|
|
|
u64 end;
|
2009-03-13 04:35:18 +00:00
|
|
|
unsigned int i;
|
2008-05-11 07:30:15 +00:00
|
|
|
u64 real_updated_size = 0;
|
|
|
|
|
|
|
|
BUG_ON(old_type == new_type);
|
|
|
|
|
2008-06-24 21:58:38 +00:00
|
|
|
if (size > (ULLONG_MAX - start))
|
|
|
|
size = ULLONG_MAX - start;
|
|
|
|
|
2009-03-13 05:36:01 +00:00
|
|
|
end = start + size;
|
2009-03-15 07:59:19 +00:00
|
|
|
printk(KERN_DEBUG "e820 update range: %016Lx - %016Lx ",
|
|
|
|
(unsigned long long) start,
|
|
|
|
(unsigned long long) end);
|
|
|
|
e820_print_type(old_type);
|
|
|
|
printk(KERN_CONT " ==> ");
|
|
|
|
e820_print_type(new_type);
|
|
|
|
printk(KERN_CONT "\n");
|
|
|
|
|
2009-03-12 13:07:23 +00:00
|
|
|
for (i = 0; i < e820x->nr_map; i++) {
|
2008-07-03 18:39:00 +00:00
|
|
|
struct e820entry *ei = &e820x->map[i];
|
2008-05-11 07:30:15 +00:00
|
|
|
u64 final_start, final_end;
|
2009-03-13 05:36:01 +00:00
|
|
|
u64 ei_end;
|
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
if (ei->type != old_type)
|
|
|
|
continue;
|
2009-03-13 05:36:01 +00:00
|
|
|
|
|
|
|
ei_end = ei->addr + ei->size;
|
|
|
|
/* totally covered by new range? */
|
|
|
|
if (ei->addr >= start && ei_end <= end) {
|
2008-05-11 07:30:15 +00:00
|
|
|
ei->type = new_type;
|
|
|
|
real_updated_size += ei->size;
|
|
|
|
continue;
|
|
|
|
}
|
2009-03-13 05:36:01 +00:00
|
|
|
|
|
|
|
/* new range is totally covered? */
|
|
|
|
if (ei->addr < start && ei_end > end) {
|
|
|
|
__e820_add_region(e820x, start, size, new_type);
|
|
|
|
__e820_add_region(e820x, end, ei_end - end, ei->type);
|
|
|
|
ei->size = start - ei->addr;
|
|
|
|
real_updated_size += size;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
/* partially covered */
|
|
|
|
final_start = max(start, ei->addr);
|
2009-03-13 05:36:01 +00:00
|
|
|
final_end = min(end, ei_end);
|
2008-05-11 07:30:15 +00:00
|
|
|
if (final_start >= final_end)
|
|
|
|
continue;
|
2009-03-12 13:07:23 +00:00
|
|
|
|
2009-03-13 04:35:18 +00:00
|
|
|
__e820_add_region(e820x, final_start, final_end - final_start,
|
|
|
|
new_type);
|
2009-03-12 13:07:23 +00:00
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
real_updated_size += final_end - final_start;
|
2008-06-24 21:55:32 +00:00
|
|
|
|
2009-03-13 04:35:18 +00:00
|
|
|
/*
|
|
|
|
* left range could be head or tail, so need to update
|
|
|
|
* size at first.
|
|
|
|
*/
|
|
|
|
ei->size -= final_end - final_start;
|
2008-06-24 21:55:32 +00:00
|
|
|
if (ei->addr < final_start)
|
|
|
|
continue;
|
|
|
|
ei->addr = final_end;
|
2008-05-11 07:30:15 +00:00
|
|
|
}
|
|
|
|
return real_updated_size;
|
|
|
|
}
|
|
|
|
|
2008-07-03 18:39:00 +00:00
|
|
|
u64 __init e820_update_range(u64 start, u64 size, unsigned old_type,
|
|
|
|
unsigned new_type)
|
|
|
|
{
|
2009-03-13 04:35:18 +00:00
|
|
|
return __e820_update_range(&e820, start, size, old_type, new_type);
|
2008-07-03 18:39:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static u64 __init e820_update_range_saved(u64 start, u64 size,
|
|
|
|
unsigned old_type, unsigned new_type)
|
|
|
|
{
|
2009-03-13 04:35:18 +00:00
|
|
|
return __e820_update_range(&e820_saved, start, size, old_type,
|
2008-07-03 18:39:00 +00:00
|
|
|
new_type);
|
|
|
|
}
|
|
|
|
|
2008-06-21 21:48:05 +00:00
|
|
|
/* make e820 not cover the range */
|
|
|
|
u64 __init e820_remove_range(u64 start, u64 size, unsigned old_type,
|
|
|
|
int checktype)
|
|
|
|
{
|
|
|
|
int i;
|
2010-01-22 03:21:04 +00:00
|
|
|
u64 end;
|
2008-06-21 21:48:05 +00:00
|
|
|
u64 real_removed_size = 0;
|
|
|
|
|
2008-06-24 21:58:38 +00:00
|
|
|
if (size > (ULLONG_MAX - start))
|
|
|
|
size = ULLONG_MAX - start;
|
|
|
|
|
2010-01-22 03:21:04 +00:00
|
|
|
end = start + size;
|
|
|
|
printk(KERN_DEBUG "e820 remove range: %016Lx - %016Lx ",
|
|
|
|
(unsigned long long) start,
|
|
|
|
(unsigned long long) end);
|
2010-03-30 05:38:29 +00:00
|
|
|
if (checktype)
|
|
|
|
e820_print_type(old_type);
|
2010-01-22 03:21:04 +00:00
|
|
|
printk(KERN_CONT "\n");
|
|
|
|
|
2008-06-21 21:48:05 +00:00
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
u64 final_start, final_end;
|
2010-03-30 05:38:29 +00:00
|
|
|
u64 ei_end;
|
2008-06-21 21:48:05 +00:00
|
|
|
|
|
|
|
if (checktype && ei->type != old_type)
|
|
|
|
continue;
|
2010-03-30 05:38:29 +00:00
|
|
|
|
|
|
|
ei_end = ei->addr + ei->size;
|
2008-06-21 21:48:05 +00:00
|
|
|
/* totally covered? */
|
2010-03-30 05:38:29 +00:00
|
|
|
if (ei->addr >= start && ei_end <= end) {
|
2008-06-21 21:48:05 +00:00
|
|
|
real_removed_size += ei->size;
|
|
|
|
memset(ei, 0, sizeof(struct e820entry));
|
|
|
|
continue;
|
|
|
|
}
|
2010-03-30 05:38:29 +00:00
|
|
|
|
|
|
|
/* new range is totally covered? */
|
|
|
|
if (ei->addr < start && ei_end > end) {
|
|
|
|
e820_add_region(end, ei_end - end, ei->type);
|
|
|
|
ei->size = start - ei->addr;
|
|
|
|
real_removed_size += size;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2008-06-21 21:48:05 +00:00
|
|
|
/* partially covered */
|
|
|
|
final_start = max(start, ei->addr);
|
2010-03-30 05:38:29 +00:00
|
|
|
final_end = min(end, ei_end);
|
2008-06-21 21:48:05 +00:00
|
|
|
if (final_start >= final_end)
|
|
|
|
continue;
|
|
|
|
real_removed_size += final_end - final_start;
|
|
|
|
|
2010-03-30 05:38:29 +00:00
|
|
|
/*
|
|
|
|
* left range could be head or tail, so need to update
|
|
|
|
* size at first.
|
|
|
|
*/
|
2008-06-21 21:48:05 +00:00
|
|
|
ei->size -= final_end - final_start;
|
|
|
|
if (ei->addr < final_start)
|
|
|
|
continue;
|
|
|
|
ei->addr = final_end;
|
|
|
|
}
|
|
|
|
return real_removed_size;
|
|
|
|
}
|
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
void __init update_e820(void)
|
|
|
|
{
|
2009-03-22 20:43:01 +00:00
|
|
|
u32 nr_map;
|
2008-05-11 07:30:15 +00:00
|
|
|
|
|
|
|
nr_map = e820.nr_map;
|
2008-05-14 15:15:34 +00:00
|
|
|
if (sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &nr_map))
|
2008-05-11 07:30:15 +00:00
|
|
|
return;
|
|
|
|
e820.nr_map = nr_map;
|
|
|
|
printk(KERN_INFO "modified physical RAM map:\n");
|
|
|
|
e820_print_map("modified");
|
|
|
|
}
|
2008-07-03 18:39:00 +00:00
|
|
|
static void __init update_e820_saved(void)
|
|
|
|
{
|
2009-03-22 20:43:01 +00:00
|
|
|
u32 nr_map;
|
2008-07-03 18:39:00 +00:00
|
|
|
|
|
|
|
nr_map = e820_saved.nr_map;
|
|
|
|
if (sanitize_e820_map(e820_saved.map, ARRAY_SIZE(e820_saved.map), &nr_map))
|
|
|
|
return;
|
|
|
|
e820_saved.nr_map = nr_map;
|
|
|
|
}
|
2008-06-25 18:02:42 +00:00
|
|
|
#define MAX_GAP_END 0x100000000ull
|
2008-05-11 07:30:15 +00:00
|
|
|
/*
|
2008-06-25 18:02:42 +00:00
|
|
|
* Search for a gap in the e820 memory space from start_addr to end_addr.
|
2008-05-11 07:30:15 +00:00
|
|
|
*/
|
2008-06-24 18:48:30 +00:00
|
|
|
__init int e820_search_gap(unsigned long *gapstart, unsigned long *gapsize,
|
2008-06-25 18:02:42 +00:00
|
|
|
unsigned long start_addr, unsigned long long end_addr)
|
2008-05-11 07:30:15 +00:00
|
|
|
{
|
2008-06-25 18:02:42 +00:00
|
|
|
unsigned long long last;
|
2008-06-24 18:48:30 +00:00
|
|
|
int i = e820.nr_map;
|
2008-05-11 07:30:15 +00:00
|
|
|
int found = 0;
|
|
|
|
|
2008-06-25 18:02:42 +00:00
|
|
|
last = (end_addr && end_addr < MAX_GAP_END) ? end_addr : MAX_GAP_END;
|
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
while (--i >= 0) {
|
|
|
|
unsigned long long start = e820.map[i].addr;
|
|
|
|
unsigned long long end = start + e820.map[i].size;
|
|
|
|
|
2008-06-24 18:48:30 +00:00
|
|
|
if (end < start_addr)
|
|
|
|
continue;
|
|
|
|
|
2008-05-11 07:30:15 +00:00
|
|
|
/*
|
|
|
|
* Since "last" is at most 4GB, we know we'll
|
|
|
|
* fit in 32 bits if this condition is true
|
|
|
|
*/
|
|
|
|
if (last > end) {
|
|
|
|
unsigned long gap = last - end;
|
|
|
|
|
2008-06-24 18:48:30 +00:00
|
|
|
if (gap >= *gapsize) {
|
|
|
|
*gapsize = gap;
|
|
|
|
*gapstart = end;
|
2008-05-11 07:30:15 +00:00
|
|
|
found = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (start < last)
|
|
|
|
last = start;
|
|
|
|
}
|
2008-06-24 18:48:30 +00:00
|
|
|
return found;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Search for the biggest gap in the low 32 bits of the e820
|
|
|
|
* memory space. We pass this space to PCI to assign MMIO resources
|
|
|
|
* for hotplug or unconfigured devices in.
|
|
|
|
* Hopefully the BIOS let enough space left.
|
|
|
|
*/
|
|
|
|
__init void e820_setup_gap(void)
|
|
|
|
{
|
2009-05-06 15:07:52 +00:00
|
|
|
unsigned long gapstart, gapsize;
|
2008-06-24 18:48:30 +00:00
|
|
|
int found;
|
|
|
|
|
|
|
|
gapstart = 0x10000000;
|
|
|
|
gapsize = 0x400000;
|
2008-06-25 18:02:42 +00:00
|
|
|
found = e820_search_gap(&gapstart, &gapsize, 0, MAX_GAP_END);
|
2008-05-11 07:30:15 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_X86_64
|
|
|
|
if (!found) {
|
2008-06-25 05:14:09 +00:00
|
|
|
gapstart = (max_pfn << PAGE_SHIFT) + 1024*1024;
|
2009-07-06 20:05:40 +00:00
|
|
|
printk(KERN_ERR
|
|
|
|
"PCI: Warning: Cannot find a gap in the 32bit address range\n"
|
|
|
|
"PCI: Unassigned devices with 32bit resource registers may break!\n");
|
2008-05-11 07:30:15 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
2009-05-06 15:07:52 +00:00
|
|
|
* e820_reserve_resources_late protect stolen RAM already
|
2008-05-11 07:30:15 +00:00
|
|
|
*/
|
2009-05-06 15:07:52 +00:00
|
|
|
pci_mem_start = gapstart;
|
2008-05-11 07:30:15 +00:00
|
|
|
|
|
|
|
printk(KERN_INFO
|
|
|
|
"Allocating PCI resources starting at %lx (gap: %lx:%lx)\n",
|
|
|
|
pci_mem_start, gapstart, gapsize);
|
|
|
|
}
|
|
|
|
|
2008-06-11 03:33:39 +00:00
|
|
|
/**
|
|
|
|
* Because of the size limitation of struct boot_params, only first
|
|
|
|
* 128 E820 memory entries are passed to kernel via
|
|
|
|
* boot_params.e820_map, others are passed via SETUP_E820_EXT node of
|
|
|
|
* linked list of struct setup_data, which is parsed here.
|
|
|
|
*/
|
2011-02-22 20:07:36 +00:00
|
|
|
void __init parse_e820_ext(struct setup_data *sdata)
|
2008-06-11 03:33:39 +00:00
|
|
|
{
|
|
|
|
int entries;
|
|
|
|
struct e820entry *extmap;
|
|
|
|
|
|
|
|
entries = sdata->len / sizeof(struct e820entry);
|
|
|
|
extmap = (struct e820entry *)(sdata->data);
|
2008-07-02 03:02:16 +00:00
|
|
|
__append_e820_map(extmap, entries);
|
2008-06-11 03:33:39 +00:00
|
|
|
sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &e820.nr_map);
|
|
|
|
printk(KERN_INFO "extended physical RAM map:\n");
|
|
|
|
e820_print_map("extended");
|
|
|
|
}
|
|
|
|
|
2008-05-21 03:10:58 +00:00
|
|
|
#if defined(CONFIG_X86_64) || \
|
|
|
|
(defined(CONFIG_X86_32) && defined(CONFIG_HIBERNATION))
|
|
|
|
/**
|
|
|
|
* Find the ranges of physical addresses that do not correspond to
|
|
|
|
* e820 RAM areas and mark the corresponding pages as nosave for
|
|
|
|
* hibernation (32 bit) or software suspend and suspend to RAM (64 bit).
|
|
|
|
*
|
|
|
|
* This function requires the e820 map to be sorted and without any
|
|
|
|
* overlapping entries and assumes the first e820 area to be RAM.
|
|
|
|
*/
|
|
|
|
void __init e820_mark_nosave_regions(unsigned long limit_pfn)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
unsigned long pfn;
|
|
|
|
|
|
|
|
pfn = PFN_DOWN(e820.map[0].addr + e820.map[0].size);
|
|
|
|
for (i = 1; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
|
|
|
|
if (pfn < PFN_UP(ei->addr))
|
|
|
|
register_nosave_region(pfn, PFN_UP(ei->addr));
|
|
|
|
|
|
|
|
pfn = PFN_DOWN(ei->addr + ei->size);
|
2008-06-30 23:20:54 +00:00
|
|
|
if (ei->type != E820_RAM && ei->type != E820_RESERVED_KERN)
|
2008-05-21 03:10:58 +00:00
|
|
|
register_nosave_region(PFN_UP(ei->addr), pfn);
|
|
|
|
|
|
|
|
if (pfn >= limit_pfn)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
2008-05-18 08:18:57 +00:00
|
|
|
|
2008-10-31 00:02:41 +00:00
|
|
|
#ifdef CONFIG_HIBERNATION
|
|
|
|
/**
|
|
|
|
* Mark ACPI NVS memory region, so that we can save/restore it during
|
|
|
|
* hibernation and the subsequent resume.
|
|
|
|
*/
|
|
|
|
static int __init e820_mark_nvs_memory(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
|
|
|
|
if (ei->type == E820_NVS)
|
2010-05-28 20:32:14 +00:00
|
|
|
suspend_nvs_register(ei->addr, ei->size);
|
2008-10-31 00:02:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
core_initcall(e820_mark_nvs_memory);
|
|
|
|
#endif
|
|
|
|
|
2008-06-01 20:17:38 +00:00
|
|
|
/*
|
2010-08-25 20:39:17 +00:00
|
|
|
* pre allocated 4k and reserved it in memblock and e820_saved
|
2008-06-01 20:17:38 +00:00
|
|
|
*/
|
|
|
|
u64 __init early_reserve_e820(u64 startt, u64 sizet, u64 align)
|
|
|
|
{
|
|
|
|
u64 size = 0;
|
|
|
|
u64 addr;
|
|
|
|
u64 start;
|
|
|
|
|
2009-05-06 12:02:19 +00:00
|
|
|
for (start = startt; ; start += size) {
|
2010-08-25 20:39:17 +00:00
|
|
|
start = memblock_x86_find_in_range_size(start, &size, align);
|
|
|
|
if (start == MEMBLOCK_ERROR)
|
2009-05-06 12:02:19 +00:00
|
|
|
return 0;
|
|
|
|
if (size >= sizet)
|
|
|
|
break;
|
|
|
|
}
|
2008-06-01 20:17:38 +00:00
|
|
|
|
2009-03-12 13:07:23 +00:00
|
|
|
#ifdef CONFIG_X86_32
|
|
|
|
if (start >= MAXMEM)
|
|
|
|
return 0;
|
|
|
|
if (start + size > MAXMEM)
|
|
|
|
size = MAXMEM - start;
|
|
|
|
#endif
|
|
|
|
|
2008-06-01 20:17:38 +00:00
|
|
|
addr = round_down(start + size - sizet, align);
|
2009-03-12 13:07:23 +00:00
|
|
|
if (addr < start)
|
|
|
|
return 0;
|
2010-08-25 20:39:17 +00:00
|
|
|
memblock_x86_reserve_range(addr, addr + sizet, "new next");
|
2008-07-03 18:39:00 +00:00
|
|
|
e820_update_range_saved(addr, sizet, E820_RAM, E820_RESERVED);
|
2010-08-25 20:39:17 +00:00
|
|
|
printk(KERN_INFO "update e820_saved for early_reserve_e820\n");
|
2008-07-03 18:39:00 +00:00
|
|
|
update_e820_saved();
|
2008-06-01 20:17:38 +00:00
|
|
|
|
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
|
2008-06-04 02:34:00 +00:00
|
|
|
#ifdef CONFIG_X86_32
|
|
|
|
# ifdef CONFIG_X86_PAE
|
|
|
|
# define MAX_ARCH_PFN (1ULL<<(36-PAGE_SHIFT))
|
|
|
|
# else
|
|
|
|
# define MAX_ARCH_PFN (1ULL<<(32-PAGE_SHIFT))
|
|
|
|
# endif
|
|
|
|
#else /* CONFIG_X86_32 */
|
2008-06-04 20:21:29 +00:00
|
|
|
# define MAX_ARCH_PFN MAXMEM>>PAGE_SHIFT
|
2008-06-04 02:34:00 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find the highest page frame number we have available
|
|
|
|
*/
|
2011-12-12 00:12:42 +00:00
|
|
|
static unsigned long __init e820_end_pfn(unsigned long limit_pfn, unsigned type)
|
2008-06-04 02:34:00 +00:00
|
|
|
{
|
2008-07-09 01:56:38 +00:00
|
|
|
int i;
|
|
|
|
unsigned long last_pfn = 0;
|
2008-06-04 02:34:00 +00:00
|
|
|
unsigned long max_arch_pfn = MAX_ARCH_PFN;
|
|
|
|
|
2008-07-09 01:56:38 +00:00
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
2008-07-11 03:38:26 +00:00
|
|
|
unsigned long start_pfn;
|
2008-07-09 01:56:38 +00:00
|
|
|
unsigned long end_pfn;
|
|
|
|
|
2008-07-11 03:38:26 +00:00
|
|
|
if (ei->type != type)
|
2008-07-09 10:01:14 +00:00
|
|
|
continue;
|
|
|
|
|
2008-07-11 03:38:26 +00:00
|
|
|
start_pfn = ei->addr >> PAGE_SHIFT;
|
2008-07-09 01:56:38 +00:00
|
|
|
end_pfn = (ei->addr + ei->size) >> PAGE_SHIFT;
|
2008-07-11 03:38:26 +00:00
|
|
|
|
|
|
|
if (start_pfn >= limit_pfn)
|
|
|
|
continue;
|
|
|
|
if (end_pfn > limit_pfn) {
|
|
|
|
last_pfn = limit_pfn;
|
|
|
|
break;
|
|
|
|
}
|
2008-07-09 01:56:38 +00:00
|
|
|
if (end_pfn > last_pfn)
|
|
|
|
last_pfn = end_pfn;
|
|
|
|
}
|
2008-06-04 02:34:00 +00:00
|
|
|
|
|
|
|
if (last_pfn > max_arch_pfn)
|
|
|
|
last_pfn = max_arch_pfn;
|
|
|
|
|
2008-06-25 12:44:40 +00:00
|
|
|
printk(KERN_INFO "last_pfn = %#lx max_arch_pfn = %#lx\n",
|
2008-06-04 02:34:00 +00:00
|
|
|
last_pfn, max_arch_pfn);
|
|
|
|
return last_pfn;
|
|
|
|
}
|
2008-07-11 03:38:26 +00:00
|
|
|
unsigned long __init e820_end_of_ram_pfn(void)
|
|
|
|
{
|
|
|
|
return e820_end_pfn(MAX_ARCH_PFN, E820_RAM);
|
|
|
|
}
|
2008-06-04 02:34:00 +00:00
|
|
|
|
2008-07-11 03:38:26 +00:00
|
|
|
unsigned long __init e820_end_of_low_ram_pfn(void)
|
|
|
|
{
|
|
|
|
return e820_end_pfn(1UL<<(32 - PAGE_SHIFT), E820_RAM);
|
|
|
|
}
|
2008-06-04 02:34:00 +00:00
|
|
|
|
2008-06-10 19:55:54 +00:00
|
|
|
static void early_panic(char *msg)
|
|
|
|
{
|
|
|
|
early_printk(msg);
|
|
|
|
panic(msg);
|
|
|
|
}
|
|
|
|
|
2008-07-10 11:17:00 +00:00
|
|
|
static int userdef __initdata;
|
|
|
|
|
2008-06-10 19:55:54 +00:00
|
|
|
/* "mem=nopentium" disables the 4MB page tables. */
|
|
|
|
static int __init parse_memopt(char *p)
|
|
|
|
{
|
|
|
|
u64 mem_size;
|
|
|
|
|
|
|
|
if (!p)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (!strcmp(p, "nopentium")) {
|
2011-02-04 01:38:05 +00:00
|
|
|
#ifdef CONFIG_X86_32
|
2008-06-10 19:55:54 +00:00
|
|
|
setup_clear_cpu_cap(X86_FEATURE_PSE);
|
|
|
|
return 0;
|
2011-02-04 01:38:05 +00:00
|
|
|
#else
|
|
|
|
printk(KERN_WARNING "mem=nopentium ignored! (only supported on x86_32)\n");
|
|
|
|
return -EINVAL;
|
2008-06-10 19:55:54 +00:00
|
|
|
#endif
|
2011-02-04 01:38:05 +00:00
|
|
|
}
|
2008-06-10 19:55:54 +00:00
|
|
|
|
2008-07-10 11:17:00 +00:00
|
|
|
userdef = 1;
|
2008-06-10 19:55:54 +00:00
|
|
|
mem_size = memparse(p, &p);
|
2011-02-04 01:38:04 +00:00
|
|
|
/* don't remove all of memory when handling "mem={invalid}" param */
|
|
|
|
if (mem_size == 0)
|
|
|
|
return -EINVAL;
|
2008-07-10 11:17:00 +00:00
|
|
|
e820_remove_range(mem_size, ULLONG_MAX - mem_size, E820_RAM, 1);
|
2008-06-25 19:39:16 +00:00
|
|
|
|
2008-06-10 19:55:54 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
early_param("mem", parse_memopt);
|
|
|
|
|
|
|
|
static int __init parse_memmap_opt(char *p)
|
|
|
|
{
|
|
|
|
char *oldp;
|
|
|
|
u64 start_at, mem_size;
|
|
|
|
|
2008-07-05 11:53:39 +00:00
|
|
|
if (!p)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2008-09-09 13:56:08 +00:00
|
|
|
if (!strncmp(p, "exactmap", 8)) {
|
2008-06-10 19:55:54 +00:00
|
|
|
#ifdef CONFIG_CRASH_DUMP
|
|
|
|
/*
|
|
|
|
* If we are doing a crash dump, we still need to know
|
|
|
|
* the real mem size before original memory map is
|
|
|
|
* reset.
|
|
|
|
*/
|
2008-07-11 03:38:26 +00:00
|
|
|
saved_max_pfn = e820_end_of_ram_pfn();
|
2008-06-10 19:55:54 +00:00
|
|
|
#endif
|
|
|
|
e820.nr_map = 0;
|
|
|
|
userdef = 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
oldp = p;
|
|
|
|
mem_size = memparse(p, &p);
|
|
|
|
if (p == oldp)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
userdef = 1;
|
|
|
|
if (*p == '@') {
|
|
|
|
start_at = memparse(p+1, &p);
|
2008-06-16 01:58:51 +00:00
|
|
|
e820_add_region(start_at, mem_size, E820_RAM);
|
2008-06-10 19:55:54 +00:00
|
|
|
} else if (*p == '#') {
|
|
|
|
start_at = memparse(p+1, &p);
|
2008-06-16 01:58:51 +00:00
|
|
|
e820_add_region(start_at, mem_size, E820_ACPI);
|
2008-06-10 19:55:54 +00:00
|
|
|
} else if (*p == '$') {
|
|
|
|
start_at = memparse(p+1, &p);
|
2008-06-16 01:58:51 +00:00
|
|
|
e820_add_region(start_at, mem_size, E820_RESERVED);
|
2008-07-13 05:57:07 +00:00
|
|
|
} else
|
2008-07-10 11:17:00 +00:00
|
|
|
e820_remove_range(mem_size, ULLONG_MAX - mem_size, E820_RAM, 1);
|
2008-07-13 05:57:07 +00:00
|
|
|
|
2008-06-10 19:55:54 +00:00
|
|
|
return *p == '\0' ? 0 : -EINVAL;
|
|
|
|
}
|
|
|
|
early_param("memmap", parse_memmap_opt);
|
|
|
|
|
|
|
|
void __init finish_e820_parsing(void)
|
|
|
|
{
|
|
|
|
if (userdef) {
|
2009-03-22 20:43:01 +00:00
|
|
|
u32 nr = e820.nr_map;
|
2008-06-10 19:55:54 +00:00
|
|
|
|
|
|
|
if (sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &nr) < 0)
|
|
|
|
early_panic("Invalid user supplied memory map");
|
|
|
|
e820.nr_map = nr;
|
|
|
|
|
|
|
|
printk(KERN_INFO "user-defined physical RAM map:\n");
|
|
|
|
e820_print_map("user");
|
|
|
|
}
|
|
|
|
}
|
2008-06-16 20:03:31 +00:00
|
|
|
|
2008-06-27 11:12:55 +00:00
|
|
|
static inline const char *e820_type_to_string(int e820_type)
|
|
|
|
{
|
|
|
|
switch (e820_type) {
|
|
|
|
case E820_RESERVED_KERN:
|
|
|
|
case E820_RAM: return "System RAM";
|
|
|
|
case E820_ACPI: return "ACPI Tables";
|
|
|
|
case E820_NVS: return "ACPI Non-volatile Storage";
|
2008-08-20 23:43:07 +00:00
|
|
|
case E820_UNUSABLE: return "Unusable memory";
|
2008-06-27 11:12:55 +00:00
|
|
|
default: return "reserved";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-06-16 20:03:31 +00:00
|
|
|
/*
|
|
|
|
* Mark e820 reserved areas as busy for the resource manager.
|
|
|
|
*/
|
2008-08-29 06:09:23 +00:00
|
|
|
static struct resource __initdata *e820_res;
|
2008-06-16 20:03:31 +00:00
|
|
|
void __init e820_reserve_resources(void)
|
|
|
|
{
|
|
|
|
int i;
|
2008-08-28 20:52:25 +00:00
|
|
|
struct resource *res;
|
2008-08-29 06:09:23 +00:00
|
|
|
u64 end;
|
2008-06-16 20:03:31 +00:00
|
|
|
|
2009-09-22 00:03:06 +00:00
|
|
|
res = alloc_bootmem(sizeof(struct resource) * e820.nr_map);
|
2008-08-28 20:52:25 +00:00
|
|
|
e820_res = res;
|
2008-06-16 20:03:31 +00:00
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
2008-06-29 00:49:59 +00:00
|
|
|
end = e820.map[i].addr + e820.map[i].size - 1;
|
2008-09-11 08:31:50 +00:00
|
|
|
if (end != (resource_size_t)end) {
|
2008-06-16 20:03:31 +00:00
|
|
|
res++;
|
|
|
|
continue;
|
|
|
|
}
|
2008-06-27 11:12:55 +00:00
|
|
|
res->name = e820_type_to_string(e820.map[i].type);
|
2008-06-29 00:49:59 +00:00
|
|
|
res->start = e820.map[i].addr;
|
|
|
|
res->end = end;
|
|
|
|
|
x86: Clean up late e820 resource allocation
This makes the late e820 resources use 'insert_resource_expand_to_fit()'
instead of doing a 'reserve_region_with_split()', and also avoids
marking them as IORESOURCE_BUSY.
This results in us being perfectly happy to use pre-existing PCI
resources even if they were marked as being in a reserved region, while
still avoiding any _new_ allocations in the reserved regions. It also
makes for a simpler and more accurate resource tree.
Example resource allocation from Jonathan Corbet, who has firmware that
has an e820 reserved entry that covered a big range (e0000000-fed003ff),
and that had various PCI resources in it set up by firmware.
With old kernels, the reserved range would force us to re-allocate all
pre-existing PCI resources, and his reserved range would end up looking
like this:
e0000000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
where only the pre-allocated special regions (IOAPIC and HPET) were kept
around.
With 2.6.28-rc2, which uses 'reserve_region_with_split()', Jonathan's
resource tree looked like this:
e0000000-fe7fffff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe800000-fe8fffff : reserved
fe900000-fe9d9aff : reserved
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9b00-fe9d9bff : reserved
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : reserved
fe9da000-fe9dafff : 0000:00:03.3
fe9da000-fe9dafff : reserved
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : reserved
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : reserved
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : reserved
fea00000-fea7ffff : 0000:00:02.0
fea00000-fea7ffff : reserved
fea80000-feafffff : 0000:00:02.1
fea80000-feafffff : reserved
feb00000-febfffff : 0000:00:02.0
feb00000-febfffff : reserved
fec00000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
and because the reserved entry had been split and moved into the
individual resources, and because it used the IORESOURCE_BUSY flag, the
drivers that actually wanted to _use_ those resources couldn't actually
attach to them:
e1000e 0000:00:19.0: BAR 0: can't reserve mem region [0xfe9e0000-0xfe9fffff]
HDA Intel 0000:00:1b.0: BAR 0: can't reserve mem region [0xfe9dc000-0xfe9dffff]
with this patch, the resource tree instead becomes
e0000000-fed003ff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : ehci_hcd
fe9da000-fe9dafff : 0000:00:03.3
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : e1000e
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : ICH HD audio
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : e1000e
fea00000-fea7ffff : 0000:00:02.0
fea80000-feafffff : 0000:00:02.1
feb00000-febfffff : 0000:00:02.0
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
ie the one reserved region now ends up surrounding all the PCI resources
that were allocated inside of it by firmware, and because it is not
marked BUSY, drivers have no problem attaching to the pre-allocated
resources.
Reported-and-tested-by: Jonathan Corbet <corbet@lwn.net>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Robert Hancock <hancockr@shaw.ca>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-11-01 17:17:22 +00:00
|
|
|
res->flags = IORESOURCE_MEM;
|
2008-08-29 06:09:23 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* don't register the region that could be conflicted with
|
|
|
|
* pci device BAR resource and insert them later in
|
|
|
|
* pcibios_resource_survey()
|
|
|
|
*/
|
x86: Clean up late e820 resource allocation
This makes the late e820 resources use 'insert_resource_expand_to_fit()'
instead of doing a 'reserve_region_with_split()', and also avoids
marking them as IORESOURCE_BUSY.
This results in us being perfectly happy to use pre-existing PCI
resources even if they were marked as being in a reserved region, while
still avoiding any _new_ allocations in the reserved regions. It also
makes for a simpler and more accurate resource tree.
Example resource allocation from Jonathan Corbet, who has firmware that
has an e820 reserved entry that covered a big range (e0000000-fed003ff),
and that had various PCI resources in it set up by firmware.
With old kernels, the reserved range would force us to re-allocate all
pre-existing PCI resources, and his reserved range would end up looking
like this:
e0000000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
where only the pre-allocated special regions (IOAPIC and HPET) were kept
around.
With 2.6.28-rc2, which uses 'reserve_region_with_split()', Jonathan's
resource tree looked like this:
e0000000-fe7fffff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe800000-fe8fffff : reserved
fe900000-fe9d9aff : reserved
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9b00-fe9d9bff : reserved
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : reserved
fe9da000-fe9dafff : 0000:00:03.3
fe9da000-fe9dafff : reserved
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : reserved
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : reserved
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : reserved
fea00000-fea7ffff : 0000:00:02.0
fea00000-fea7ffff : reserved
fea80000-feafffff : 0000:00:02.1
fea80000-feafffff : reserved
feb00000-febfffff : 0000:00:02.0
feb00000-febfffff : reserved
fec00000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
and because the reserved entry had been split and moved into the
individual resources, and because it used the IORESOURCE_BUSY flag, the
drivers that actually wanted to _use_ those resources couldn't actually
attach to them:
e1000e 0000:00:19.0: BAR 0: can't reserve mem region [0xfe9e0000-0xfe9fffff]
HDA Intel 0000:00:1b.0: BAR 0: can't reserve mem region [0xfe9dc000-0xfe9dffff]
with this patch, the resource tree instead becomes
e0000000-fed003ff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : ehci_hcd
fe9da000-fe9dafff : 0000:00:03.3
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : e1000e
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : ICH HD audio
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : e1000e
fea00000-fea7ffff : 0000:00:02.0
fea80000-feafffff : 0000:00:02.1
feb00000-febfffff : 0000:00:02.0
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
ie the one reserved region now ends up surrounding all the PCI resources
that were allocated inside of it by firmware, and because it is not
marked BUSY, drivers have no problem attaching to the pre-allocated
resources.
Reported-and-tested-by: Jonathan Corbet <corbet@lwn.net>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Robert Hancock <hancockr@shaw.ca>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-11-01 17:17:22 +00:00
|
|
|
if (e820.map[i].type != E820_RESERVED || res->start < (1ULL<<20)) {
|
|
|
|
res->flags |= IORESOURCE_BUSY;
|
2008-08-28 20:52:25 +00:00
|
|
|
insert_resource(&iomem_resource, res);
|
x86: Clean up late e820 resource allocation
This makes the late e820 resources use 'insert_resource_expand_to_fit()'
instead of doing a 'reserve_region_with_split()', and also avoids
marking them as IORESOURCE_BUSY.
This results in us being perfectly happy to use pre-existing PCI
resources even if they were marked as being in a reserved region, while
still avoiding any _new_ allocations in the reserved regions. It also
makes for a simpler and more accurate resource tree.
Example resource allocation from Jonathan Corbet, who has firmware that
has an e820 reserved entry that covered a big range (e0000000-fed003ff),
and that had various PCI resources in it set up by firmware.
With old kernels, the reserved range would force us to re-allocate all
pre-existing PCI resources, and his reserved range would end up looking
like this:
e0000000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
where only the pre-allocated special regions (IOAPIC and HPET) were kept
around.
With 2.6.28-rc2, which uses 'reserve_region_with_split()', Jonathan's
resource tree looked like this:
e0000000-fe7fffff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe800000-fe8fffff : reserved
fe900000-fe9d9aff : reserved
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9b00-fe9d9bff : reserved
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : reserved
fe9da000-fe9dafff : 0000:00:03.3
fe9da000-fe9dafff : reserved
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : reserved
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : reserved
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : reserved
fea00000-fea7ffff : 0000:00:02.0
fea00000-fea7ffff : reserved
fea80000-feafffff : 0000:00:02.1
fea80000-feafffff : reserved
feb00000-febfffff : 0000:00:02.0
feb00000-febfffff : reserved
fec00000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
and because the reserved entry had been split and moved into the
individual resources, and because it used the IORESOURCE_BUSY flag, the
drivers that actually wanted to _use_ those resources couldn't actually
attach to them:
e1000e 0000:00:19.0: BAR 0: can't reserve mem region [0xfe9e0000-0xfe9fffff]
HDA Intel 0000:00:1b.0: BAR 0: can't reserve mem region [0xfe9dc000-0xfe9dffff]
with this patch, the resource tree instead becomes
e0000000-fed003ff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : ehci_hcd
fe9da000-fe9dafff : 0000:00:03.3
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : e1000e
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : ICH HD audio
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : e1000e
fea00000-fea7ffff : 0000:00:02.0
fea80000-feafffff : 0000:00:02.1
feb00000-febfffff : 0000:00:02.0
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
ie the one reserved region now ends up surrounding all the PCI resources
that were allocated inside of it by firmware, and because it is not
marked BUSY, drivers have no problem attaching to the pre-allocated
resources.
Reported-and-tested-by: Jonathan Corbet <corbet@lwn.net>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Robert Hancock <hancockr@shaw.ca>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-11-01 17:17:22 +00:00
|
|
|
}
|
2008-06-16 20:03:31 +00:00
|
|
|
res++;
|
|
|
|
}
|
2008-06-27 11:12:55 +00:00
|
|
|
|
|
|
|
for (i = 0; i < e820_saved.nr_map; i++) {
|
|
|
|
struct e820entry *entry = &e820_saved.map[i];
|
|
|
|
firmware_map_add_early(entry->addr,
|
|
|
|
entry->addr + entry->size - 1,
|
|
|
|
e820_type_to_string(entry->type));
|
|
|
|
}
|
2008-06-16 20:03:31 +00:00
|
|
|
}
|
|
|
|
|
2009-05-06 15:06:44 +00:00
|
|
|
/* How much should we pad RAM ending depending on where it is? */
|
|
|
|
static unsigned long ram_alignment(resource_size_t pos)
|
|
|
|
{
|
|
|
|
unsigned long mb = pos >> 20;
|
|
|
|
|
|
|
|
/* To 64kB in the first megabyte */
|
|
|
|
if (!mb)
|
|
|
|
return 64*1024;
|
|
|
|
|
|
|
|
/* To 1MB in the first 16MB */
|
|
|
|
if (mb < 16)
|
|
|
|
return 1024*1024;
|
|
|
|
|
2009-10-11 21:17:16 +00:00
|
|
|
/* To 64MB for anything above that */
|
|
|
|
return 64*1024*1024;
|
2009-05-06 15:06:44 +00:00
|
|
|
}
|
|
|
|
|
2009-07-01 19:32:18 +00:00
|
|
|
#define MAX_RESOURCE_SIZE ((resource_size_t)-1)
|
|
|
|
|
2008-08-28 20:52:25 +00:00
|
|
|
void __init e820_reserve_resources_late(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct resource *res;
|
|
|
|
|
|
|
|
res = e820_res;
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
2008-08-29 06:09:23 +00:00
|
|
|
if (!res->parent && res->end)
|
x86: Clean up late e820 resource allocation
This makes the late e820 resources use 'insert_resource_expand_to_fit()'
instead of doing a 'reserve_region_with_split()', and also avoids
marking them as IORESOURCE_BUSY.
This results in us being perfectly happy to use pre-existing PCI
resources even if they were marked as being in a reserved region, while
still avoiding any _new_ allocations in the reserved regions. It also
makes for a simpler and more accurate resource tree.
Example resource allocation from Jonathan Corbet, who has firmware that
has an e820 reserved entry that covered a big range (e0000000-fed003ff),
and that had various PCI resources in it set up by firmware.
With old kernels, the reserved range would force us to re-allocate all
pre-existing PCI resources, and his reserved range would end up looking
like this:
e0000000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
where only the pre-allocated special regions (IOAPIC and HPET) were kept
around.
With 2.6.28-rc2, which uses 'reserve_region_with_split()', Jonathan's
resource tree looked like this:
e0000000-fe7fffff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe800000-fe8fffff : reserved
fe900000-fe9d9aff : reserved
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9b00-fe9d9bff : reserved
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : reserved
fe9da000-fe9dafff : 0000:00:03.3
fe9da000-fe9dafff : reserved
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : reserved
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : reserved
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : reserved
fea00000-fea7ffff : 0000:00:02.0
fea00000-fea7ffff : reserved
fea80000-feafffff : 0000:00:02.1
fea80000-feafffff : reserved
feb00000-febfffff : 0000:00:02.0
feb00000-febfffff : reserved
fec00000-fed003ff : reserved
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
and because the reserved entry had been split and moved into the
individual resources, and because it used the IORESOURCE_BUSY flag, the
drivers that actually wanted to _use_ those resources couldn't actually
attach to them:
e1000e 0000:00:19.0: BAR 0: can't reserve mem region [0xfe9e0000-0xfe9fffff]
HDA Intel 0000:00:1b.0: BAR 0: can't reserve mem region [0xfe9dc000-0xfe9dffff]
with this patch, the resource tree instead becomes
e0000000-fed003ff : reserved
fe800000-fe8fffff : PCI Bus 0000:01
fe9d9b00-fe9d9bff : 0000:00:1f.3
fe9d9c00-fe9d9fff : 0000:00:1a.7
fe9d9c00-fe9d9fff : ehci_hcd
fe9da000-fe9dafff : 0000:00:03.3
fe9db000-fe9dbfff : 0000:00:19.0
fe9db000-fe9dbfff : e1000e
fe9dc000-fe9dffff : 0000:00:1b.0
fe9dc000-fe9dffff : ICH HD audio
fe9e0000-fe9fffff : 0000:00:19.0
fe9e0000-fe9fffff : e1000e
fea00000-fea7ffff : 0000:00:02.0
fea80000-feafffff : 0000:00:02.1
feb00000-febfffff : 0000:00:02.0
fec00000-fec00fff : IOAPIC 0
fed00000-fed003ff : HPET 0
ie the one reserved region now ends up surrounding all the PCI resources
that were allocated inside of it by firmware, and because it is not
marked BUSY, drivers have no problem attaching to the pre-allocated
resources.
Reported-and-tested-by: Jonathan Corbet <corbet@lwn.net>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Robert Hancock <hancockr@shaw.ca>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-11-01 17:17:22 +00:00
|
|
|
insert_resource_expand_to_fit(&iomem_resource, res);
|
2008-08-28 20:52:25 +00:00
|
|
|
res++;
|
|
|
|
}
|
2009-05-06 15:06:44 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to bump up RAM regions to reasonable boundaries to
|
|
|
|
* avoid stolen RAM:
|
|
|
|
*/
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
2009-07-01 19:32:18 +00:00
|
|
|
struct e820entry *entry = &e820.map[i];
|
|
|
|
u64 start, end;
|
2009-05-06 15:06:44 +00:00
|
|
|
|
|
|
|
if (entry->type != E820_RAM)
|
|
|
|
continue;
|
|
|
|
start = entry->addr + entry->size;
|
2009-07-01 19:32:18 +00:00
|
|
|
end = round_up(start, ram_alignment(start)) - 1;
|
|
|
|
if (end > MAX_RESOURCE_SIZE)
|
|
|
|
end = MAX_RESOURCE_SIZE;
|
|
|
|
if (start >= end)
|
2009-05-06 15:06:44 +00:00
|
|
|
continue;
|
2010-02-10 09:20:14 +00:00
|
|
|
printk(KERN_DEBUG "reserve RAM buffer: %016llx - %016llx ",
|
|
|
|
start, end);
|
2009-07-01 19:32:18 +00:00
|
|
|
reserve_region_with_split(&iomem_resource, start, end,
|
|
|
|
"RAM buffer");
|
2009-05-06 15:06:44 +00:00
|
|
|
}
|
2008-08-28 20:52:25 +00:00
|
|
|
}
|
|
|
|
|
2008-06-19 00:27:08 +00:00
|
|
|
char *__init default_machine_specific_memory_setup(void)
|
2008-06-17 02:58:28 +00:00
|
|
|
{
|
|
|
|
char *who = "BIOS-e820";
|
2009-03-22 20:43:01 +00:00
|
|
|
u32 new_nr;
|
2008-06-17 02:58:28 +00:00
|
|
|
/*
|
|
|
|
* Try to copy the BIOS-supplied E820-map.
|
|
|
|
*
|
|
|
|
* Otherwise fake a memory map; one section from 0k->640k,
|
|
|
|
* the next section from 1mb->appropriate_mem_k
|
|
|
|
*/
|
|
|
|
new_nr = boot_params.e820_entries;
|
|
|
|
sanitize_e820_map(boot_params.e820_map,
|
|
|
|
ARRAY_SIZE(boot_params.e820_map),
|
|
|
|
&new_nr);
|
|
|
|
boot_params.e820_entries = new_nr;
|
2008-07-02 03:02:16 +00:00
|
|
|
if (append_e820_map(boot_params.e820_map, boot_params.e820_entries)
|
|
|
|
< 0) {
|
2008-06-19 00:27:08 +00:00
|
|
|
u64 mem_size;
|
2008-06-17 02:58:28 +00:00
|
|
|
|
|
|
|
/* compare results from other methods and take the greater */
|
|
|
|
if (boot_params.alt_mem_k
|
|
|
|
< boot_params.screen_info.ext_mem_k) {
|
|
|
|
mem_size = boot_params.screen_info.ext_mem_k;
|
|
|
|
who = "BIOS-88";
|
|
|
|
} else {
|
|
|
|
mem_size = boot_params.alt_mem_k;
|
|
|
|
who = "BIOS-e801";
|
|
|
|
}
|
|
|
|
|
|
|
|
e820.nr_map = 0;
|
|
|
|
e820_add_region(0, LOWMEMSIZE(), E820_RAM);
|
|
|
|
e820_add_region(HIGH_MEMORY, mem_size << 10, E820_RAM);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* In case someone cares... */
|
|
|
|
return who;
|
|
|
|
}
|
|
|
|
|
|
|
|
void __init setup_memory_map(void)
|
|
|
|
{
|
2008-07-03 18:35:37 +00:00
|
|
|
char *who;
|
|
|
|
|
2009-08-20 08:19:54 +00:00
|
|
|
who = x86_init.resources.memory_setup();
|
2008-07-03 18:35:37 +00:00
|
|
|
memcpy(&e820_saved, &e820, sizeof(struct e820map));
|
2008-06-17 02:58:28 +00:00
|
|
|
printk(KERN_INFO "BIOS-provided physical RAM map:\n");
|
2008-07-03 18:35:37 +00:00
|
|
|
e820_print_map(who);
|
2008-06-17 02:58:28 +00:00
|
|
|
}
|
2010-08-25 20:39:17 +00:00
|
|
|
|
|
|
|
void __init memblock_x86_fill(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
u64 end;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* EFI may have more than 128 entries
|
|
|
|
* We are safe to enable resizing, beause memblock_x86_fill()
|
|
|
|
* is rather later for x86
|
|
|
|
*/
|
|
|
|
memblock_can_resize = 1;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
|
|
|
|
end = ei->addr + ei->size;
|
|
|
|
if (end != (resource_size_t)end)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (ei->type != E820_RAM && ei->type != E820_RESERVED_KERN)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
memblock_add(ei->addr, ei->size);
|
|
|
|
}
|
|
|
|
|
|
|
|
memblock_analyze();
|
|
|
|
memblock_dump_all();
|
|
|
|
}
|
2010-08-25 20:39:18 +00:00
|
|
|
|
|
|
|
void __init memblock_find_dma_reserve(void)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_X86_64
|
|
|
|
u64 free_size_pfn;
|
|
|
|
u64 mem_size_pfn;
|
|
|
|
/*
|
|
|
|
* need to find out used area below MAX_DMA_PFN
|
|
|
|
* need to use memblock to get free size in [0, MAX_DMA_PFN]
|
|
|
|
* at first, and assume boot_mem will not take below MAX_DMA_PFN
|
|
|
|
*/
|
|
|
|
mem_size_pfn = memblock_x86_memory_in_range(0, MAX_DMA_PFN << PAGE_SHIFT) >> PAGE_SHIFT;
|
|
|
|
free_size_pfn = memblock_x86_free_memory_in_range(0, MAX_DMA_PFN << PAGE_SHIFT) >> PAGE_SHIFT;
|
|
|
|
set_dma_reserve(mem_size_pfn - free_size_pfn);
|
|
|
|
#endif
|
|
|
|
}
|