2008-01-30 20:30:12 +08:00
|
|
|
/*
|
2005-04-17 06:20:36 +08:00
|
|
|
* Handle the memory map.
|
|
|
|
* The functions here do the job until bootmem takes over.
|
2005-05-01 23:58:52 +08:00
|
|
|
*
|
|
|
|
* 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>
|
|
|
|
*
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/bootmem.h>
|
|
|
|
#include <linux/ioport.h>
|
|
|
|
#include <linux/string.h>
|
2005-06-26 05:58:04 +08:00
|
|
|
#include <linux/kexec.h>
|
2005-09-17 10:27:54 +08:00
|
|
|
#include <linux/module.h>
|
2006-09-26 14:32:46 +08:00
|
|
|
#include <linux/mm.h>
|
2007-05-07 05:50:43 +08:00
|
|
|
#include <linux/suspend.h>
|
|
|
|
#include <linux/pfn.h>
|
2005-09-17 10:27:54 +08:00
|
|
|
|
2006-07-10 19:43:49 +08:00
|
|
|
#include <asm/pgtable.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <asm/page.h>
|
|
|
|
#include <asm/e820.h>
|
|
|
|
#include <asm/proto.h>
|
2007-10-16 08:13:22 +08:00
|
|
|
#include <asm/setup.h>
|
2005-11-06 00:25:53 +08:00
|
|
|
#include <asm/sections.h>
|
2008-01-30 20:30:17 +08:00
|
|
|
#include <asm/kdebug.h>
|
2008-04-11 05:28:10 +08:00
|
|
|
#include <asm/trampoline.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-01-30 20:30:12 +08:00
|
|
|
/*
|
2005-04-17 06:20:36 +08:00
|
|
|
* PFN of last memory page.
|
|
|
|
*/
|
2008-01-30 20:30:12 +08:00
|
|
|
unsigned long end_pfn;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-01-30 20:30:12 +08:00
|
|
|
/*
|
2008-03-22 04:27:10 +08:00
|
|
|
* end_pfn only includes RAM, while max_pfn_mapped includes all e820 entries.
|
|
|
|
* The direct mapping extends to max_pfn_mapped, so that we can directly access
|
2005-04-17 06:20:36 +08:00
|
|
|
* apertures, ACPI and other tables without having to play with fixmaps.
|
2008-01-30 20:30:12 +08:00
|
|
|
*/
|
2008-03-22 04:27:10 +08:00
|
|
|
unsigned long max_pfn_mapped;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-01-30 20:30:12 +08:00
|
|
|
/*
|
2005-04-17 06:20:36 +08:00
|
|
|
* Last pfn which the user wants to use.
|
|
|
|
*/
|
2006-09-26 16:52:31 +08:00
|
|
|
static unsigned long __initdata end_user_pfn = MAXMEM>>PAGE_SHIFT;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-01-30 20:33:17 +08:00
|
|
|
/*
|
|
|
|
* Early reserved memory areas.
|
|
|
|
*/
|
|
|
|
#define MAX_EARLY_RES 20
|
2007-10-16 08:13:22 +08:00
|
|
|
|
2008-01-30 20:33:17 +08:00
|
|
|
struct early_res {
|
|
|
|
unsigned long start, end;
|
2008-02-02 00:49:41 +08:00
|
|
|
char name[16];
|
2008-01-30 20:33:17 +08:00
|
|
|
};
|
|
|
|
static struct early_res early_res[MAX_EARLY_RES] __initdata = {
|
2008-02-02 00:49:41 +08:00
|
|
|
{ 0, PAGE_SIZE, "BIOS data page" }, /* BIOS data page */
|
2008-04-11 05:28:10 +08:00
|
|
|
#ifdef CONFIG_X86_TRAMPOLINE
|
|
|
|
{ TRAMPOLINE_BASE, TRAMPOLINE_BASE + 2 * PAGE_SIZE, "TRAMPOLINE" },
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|
2008-01-30 20:33:17 +08:00
|
|
|
{}
|
|
|
|
};
|
|
|
|
|
2008-02-02 00:49:41 +08:00
|
|
|
void __init reserve_early(unsigned long start, unsigned long end, char *name)
|
2008-01-30 20:33:17 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct early_res *r;
|
|
|
|
for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) {
|
|
|
|
r = &early_res[i];
|
|
|
|
if (end > r->start && start < r->end)
|
2008-02-02 00:49:41 +08:00
|
|
|
panic("Overlapping early reservations %lx-%lx %s to %lx-%lx %s\n",
|
|
|
|
start, end - 1, name?name:"", r->start, r->end - 1, r->name);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2008-01-30 20:33:17 +08:00
|
|
|
if (i >= MAX_EARLY_RES)
|
|
|
|
panic("Too many early reservations");
|
|
|
|
r = &early_res[i];
|
|
|
|
r->start = start;
|
|
|
|
r->end = end;
|
2008-02-02 00:49:41 +08:00
|
|
|
if (name)
|
|
|
|
strncpy(r->name, name, sizeof(r->name) - 1);
|
2008-01-30 20:33:17 +08:00
|
|
|
}
|
2006-05-08 21:17:28 +08:00
|
|
|
|
2008-03-28 10:49:42 +08:00
|
|
|
void __init free_early(unsigned long start, unsigned long end)
|
|
|
|
{
|
|
|
|
struct early_res *r;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) {
|
|
|
|
r = &early_res[i];
|
|
|
|
if (start == r->start && end == r->end)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i >= MAX_EARLY_RES || !early_res[i].end)
|
|
|
|
panic("free_early on not reserved area: %lx-%lx!", start, end);
|
|
|
|
|
|
|
|
for (j = i + 1; j < MAX_EARLY_RES && early_res[j].end; j++)
|
|
|
|
;
|
|
|
|
|
2008-04-27 05:14:36 +08:00
|
|
|
memmove(&early_res[i], &early_res[i + 1],
|
2008-03-28 10:49:42 +08:00
|
|
|
(j - 1 - i) * sizeof(struct early_res));
|
|
|
|
|
|
|
|
early_res[j - 1].end = 0;
|
|
|
|
}
|
|
|
|
|
2008-03-19 03:52:37 +08:00
|
|
|
void __init early_res_to_bootmem(unsigned long start, unsigned long end)
|
2008-01-30 20:33:17 +08:00
|
|
|
{
|
|
|
|
int i;
|
2008-03-19 03:52:37 +08:00
|
|
|
unsigned long final_start, final_end;
|
2008-01-30 20:33:17 +08:00
|
|
|
for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) {
|
|
|
|
struct early_res *r = &early_res[i];
|
2008-03-19 03:52:37 +08:00
|
|
|
final_start = max(start, r->start);
|
|
|
|
final_end = min(end, r->end);
|
|
|
|
if (final_start >= final_end)
|
|
|
|
continue;
|
|
|
|
printk(KERN_INFO " early res: %d [%lx-%lx] %s\n", i,
|
|
|
|
final_start, final_end - 1, r->name);
|
|
|
|
reserve_bootmem_generic(final_start, final_end - final_start);
|
2006-05-08 21:17:28 +08:00
|
|
|
}
|
2008-01-30 20:33:17 +08:00
|
|
|
}
|
2006-05-08 21:17:28 +08:00
|
|
|
|
2008-01-30 20:33:17 +08:00
|
|
|
/* Check for already reserved areas */
|
2008-04-10 19:40:57 +08:00
|
|
|
static inline int __init
|
2008-04-17 23:40:45 +08:00
|
|
|
bad_addr(unsigned long *addrp, unsigned long size, unsigned long align)
|
2008-01-30 20:33:17 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
unsigned long addr = *addrp, last;
|
|
|
|
int changed = 0;
|
|
|
|
again:
|
|
|
|
last = addr + size;
|
|
|
|
for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) {
|
|
|
|
struct early_res *r = &early_res[i];
|
|
|
|
if (last >= r->start && addr < r->end) {
|
2008-04-17 23:40:45 +08:00
|
|
|
*addrp = addr = round_up(r->end, align);
|
2008-01-30 20:33:17 +08:00
|
|
|
changed = 1;
|
|
|
|
goto again;
|
|
|
|
}
|
2007-02-13 20:26:19 +08:00
|
|
|
}
|
2008-01-30 20:33:17 +08:00
|
|
|
return changed;
|
2008-01-30 20:30:12 +08:00
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-03-21 14:58:33 +08:00
|
|
|
/* Check for already reserved areas */
|
2008-04-10 19:40:57 +08:00
|
|
|
static inline int __init
|
2008-03-21 14:58:33 +08:00
|
|
|
bad_addr_size(unsigned long *addrp, unsigned long *sizep, unsigned long align)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
unsigned long addr = *addrp, last;
|
|
|
|
unsigned long size = *sizep;
|
|
|
|
int changed = 0;
|
|
|
|
again:
|
|
|
|
last = addr + size;
|
|
|
|
for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) {
|
|
|
|
struct early_res *r = &early_res[i];
|
|
|
|
if (last > r->start && addr < r->start) {
|
|
|
|
size = r->start - addr;
|
|
|
|
changed = 1;
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
if (last > r->end && addr < r->end) {
|
|
|
|
addr = round_up(r->end, align);
|
|
|
|
size = last - addr;
|
|
|
|
changed = 1;
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
if (last <= r->end && addr >= r->start) {
|
|
|
|
(*sizep)++;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (changed) {
|
|
|
|
*addrp = addr;
|
|
|
|
*sizep = size;
|
|
|
|
}
|
|
|
|
return changed;
|
|
|
|
}
|
2006-09-19 23:15:22 +08:00
|
|
|
|
2008-01-30 20:30:12 +08:00
|
|
|
/*
|
2008-02-02 00:49:41 +08:00
|
|
|
* Find a free area with specified alignment in a specific range.
|
2008-01-30 20:30:12 +08:00
|
|
|
*/
|
|
|
|
unsigned long __init find_e820_area(unsigned long start, unsigned long end,
|
2008-04-17 23:40:45 +08:00
|
|
|
unsigned long size, unsigned long align)
|
2008-01-30 20:30:12 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
2008-04-17 23:40:45 +08:00
|
|
|
unsigned long addr, last;
|
|
|
|
unsigned long ei_last;
|
2008-01-30 20:30:12 +08:00
|
|
|
|
|
|
|
if (ei->type != E820_RAM)
|
|
|
|
continue;
|
2008-04-17 23:40:45 +08:00
|
|
|
addr = round_up(ei->addr, align);
|
|
|
|
ei_last = ei->addr + ei->size;
|
2008-01-30 20:30:12 +08:00
|
|
|
if (addr < start)
|
2008-04-17 23:40:45 +08:00
|
|
|
addr = round_up(start, align);
|
2008-03-21 14:58:33 +08:00
|
|
|
if (addr >= ei_last)
|
2008-01-30 20:30:12 +08:00
|
|
|
continue;
|
2008-04-17 23:40:45 +08:00
|
|
|
while (bad_addr(&addr, size, align) && addr+size <= ei_last)
|
2005-04-17 06:20:36 +08:00
|
|
|
;
|
2008-02-02 00:49:41 +08:00
|
|
|
last = addr + size;
|
2008-04-17 23:40:45 +08:00
|
|
|
if (last > ei_last)
|
2005-04-17 06:20:36 +08:00
|
|
|
continue;
|
2008-01-30 20:30:12 +08:00
|
|
|
if (last > end)
|
2005-04-17 06:20:36 +08:00
|
|
|
continue;
|
2008-01-30 20:30:12 +08:00
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
return -1UL;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-03-21 14:58:33 +08:00
|
|
|
/*
|
|
|
|
* Find next free range after *start
|
|
|
|
*/
|
2008-03-22 09:56:19 +08:00
|
|
|
unsigned long __init find_e820_area_size(unsigned long start,
|
|
|
|
unsigned long *sizep,
|
|
|
|
unsigned long align)
|
2008-03-21 14:58:33 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
unsigned long addr, last;
|
|
|
|
unsigned long ei_last;
|
|
|
|
|
|
|
|
if (ei->type != E820_RAM)
|
|
|
|
continue;
|
|
|
|
addr = round_up(ei->addr, align);
|
|
|
|
ei_last = ei->addr + ei->size;
|
|
|
|
if (addr < start)
|
|
|
|
addr = round_up(start, align);
|
|
|
|
if (addr >= ei_last)
|
|
|
|
continue;
|
|
|
|
*sizep = ei_last - addr;
|
2008-03-22 09:56:19 +08:00
|
|
|
while (bad_addr_size(&addr, sizep, align) &&
|
|
|
|
addr + *sizep <= ei_last)
|
2008-03-21 14:58:33 +08:00
|
|
|
;
|
|
|
|
last = addr + *sizep;
|
|
|
|
if (last > ei_last)
|
|
|
|
continue;
|
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
return -1UL;
|
|
|
|
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Find the highest page frame number we have available
|
|
|
|
*/
|
|
|
|
unsigned long __init e820_end_of_ram(void)
|
|
|
|
{
|
2008-01-30 20:30:12 +08:00
|
|
|
unsigned long end_pfn;
|
|
|
|
|
2006-09-27 16:49:52 +08:00
|
|
|
end_pfn = find_max_pfn_with_active_regions();
|
2008-01-30 20:30:12 +08:00
|
|
|
|
2008-03-22 04:27:10 +08:00
|
|
|
if (end_pfn > max_pfn_mapped)
|
|
|
|
max_pfn_mapped = end_pfn;
|
|
|
|
if (max_pfn_mapped > MAXMEM>>PAGE_SHIFT)
|
|
|
|
max_pfn_mapped = MAXMEM>>PAGE_SHIFT;
|
2005-04-17 06:20:36 +08:00
|
|
|
if (end_pfn > end_user_pfn)
|
|
|
|
end_pfn = end_user_pfn;
|
2008-03-22 04:27:10 +08:00
|
|
|
if (end_pfn > max_pfn_mapped)
|
|
|
|
end_pfn = max_pfn_mapped;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-03-22 04:27:10 +08:00
|
|
|
printk(KERN_INFO "max_pfn_mapped = %lu\n", max_pfn_mapped);
|
2008-01-30 20:30:12 +08:00
|
|
|
return end_pfn;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2005-08-27 09:34:10 +08:00
|
|
|
/*
|
2005-04-17 06:20:36 +08:00
|
|
|
* Mark e820 reserved areas as busy for the resource manager.
|
|
|
|
*/
|
2008-02-23 09:07:16 +08:00
|
|
|
void __init e820_reserve_resources(void)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
int i;
|
2008-03-21 14:57:21 +08:00
|
|
|
struct resource *res;
|
|
|
|
|
|
|
|
res = alloc_bootmem_low(sizeof(struct resource) * e820.nr_map);
|
2005-04-17 06:20:36 +08:00
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
switch (e820.map[i].type) {
|
|
|
|
case E820_RAM: res->name = "System RAM"; break;
|
|
|
|
case E820_ACPI: res->name = "ACPI Tables"; break;
|
|
|
|
case E820_NVS: res->name = "ACPI Non-volatile Storage"; break;
|
|
|
|
default: res->name = "reserved";
|
|
|
|
}
|
|
|
|
res->start = e820.map[i].addr;
|
|
|
|
res->end = res->start + e820.map[i].size - 1;
|
|
|
|
res->flags = IORESOURCE_MEM | IORESOURCE_BUSY;
|
2008-02-23 09:07:16 +08:00
|
|
|
insert_resource(&iomem_resource, res);
|
2008-03-21 14:57:21 +08:00
|
|
|
res++;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-09-26 14:32:46 +08:00
|
|
|
/*
|
|
|
|
* Find the ranges of physical addresses that do not correspond to
|
|
|
|
* e820 RAM areas and mark the corresponding pages as nosave for software
|
|
|
|
* suspend and suspend to RAM.
|
|
|
|
*
|
|
|
|
* 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(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
unsigned long paddr;
|
|
|
|
|
|
|
|
paddr = round_down(e820.map[0].addr + e820.map[0].size, PAGE_SIZE);
|
|
|
|
for (i = 1; i < e820.nr_map; i++) {
|
|
|
|
struct e820entry *ei = &e820.map[i];
|
|
|
|
|
|
|
|
if (paddr < ei->addr)
|
2007-05-07 05:50:43 +08:00
|
|
|
register_nosave_region(PFN_DOWN(paddr),
|
|
|
|
PFN_UP(ei->addr));
|
2006-09-26 14:32:46 +08:00
|
|
|
|
|
|
|
paddr = round_down(ei->addr + ei->size, PAGE_SIZE);
|
|
|
|
if (ei->type != E820_RAM)
|
2007-05-07 05:50:43 +08:00
|
|
|
register_nosave_region(PFN_UP(ei->addr),
|
|
|
|
PFN_DOWN(paddr));
|
2006-09-26 14:32:46 +08:00
|
|
|
|
|
|
|
if (paddr >= (end_pfn << PAGE_SHIFT))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-07-21 23:10:31 +08:00
|
|
|
/*
|
|
|
|
* Finds an active region in the address range from start_pfn to end_pfn and
|
|
|
|
* returns its range in ei_startpfn and ei_endpfn for the e820 entry.
|
|
|
|
*/
|
|
|
|
static int __init e820_find_active_region(const struct e820entry *ei,
|
|
|
|
unsigned long start_pfn,
|
|
|
|
unsigned long end_pfn,
|
|
|
|
unsigned long *ei_startpfn,
|
|
|
|
unsigned long *ei_endpfn)
|
|
|
|
{
|
|
|
|
*ei_startpfn = round_up(ei->addr, PAGE_SIZE) >> PAGE_SHIFT;
|
|
|
|
*ei_endpfn = round_down(ei->addr + ei->size, PAGE_SIZE) >> PAGE_SHIFT;
|
|
|
|
|
|
|
|
/* Skip map entries smaller than a page */
|
|
|
|
if (*ei_startpfn >= *ei_endpfn)
|
|
|
|
return 0;
|
|
|
|
|
2008-03-22 04:27:10 +08:00
|
|
|
/* Check if max_pfn_mapped should be updated */
|
|
|
|
if (ei->type != E820_RAM && *ei_endpfn > max_pfn_mapped)
|
|
|
|
max_pfn_mapped = *ei_endpfn;
|
2007-07-21 23:10:31 +08:00
|
|
|
|
|
|
|
/* Skip if map is outside the node */
|
|
|
|
if (ei->type != E820_RAM || *ei_endpfn <= start_pfn ||
|
|
|
|
*ei_startpfn >= end_pfn)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Check for overlaps */
|
|
|
|
if (*ei_startpfn < start_pfn)
|
|
|
|
*ei_startpfn = start_pfn;
|
|
|
|
if (*ei_endpfn > end_pfn)
|
|
|
|
*ei_endpfn = end_pfn;
|
|
|
|
|
|
|
|
/* Obey end_user_pfn to save on memmap */
|
|
|
|
if (*ei_startpfn >= end_user_pfn)
|
|
|
|
return 0;
|
|
|
|
if (*ei_endpfn > end_user_pfn)
|
|
|
|
*ei_endpfn = end_user_pfn;
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2006-09-27 16:49:52 +08:00
|
|
|
/* Walk the e820 map and register active regions within a node */
|
|
|
|
void __init
|
|
|
|
e820_register_active_regions(int nid, unsigned long start_pfn,
|
|
|
|
unsigned long end_pfn)
|
|
|
|
{
|
2007-07-21 23:10:31 +08:00
|
|
|
unsigned long ei_startpfn;
|
|
|
|
unsigned long ei_endpfn;
|
2006-09-27 16:49:52 +08:00
|
|
|
int i;
|
|
|
|
|
2007-07-21 23:10:31 +08:00
|
|
|
for (i = 0; i < e820.nr_map; i++)
|
|
|
|
if (e820_find_active_region(&e820.map[i],
|
|
|
|
start_pfn, end_pfn,
|
|
|
|
&ei_startpfn, &ei_endpfn))
|
|
|
|
add_active_range(nid, ei_startpfn, ei_endpfn);
|
2006-09-27 16:49:52 +08:00
|
|
|
}
|
|
|
|
|
2007-07-21 23:11:29 +08:00
|
|
|
/*
|
|
|
|
* Find the hole size (in bytes) in the memory range.
|
|
|
|
* @start: starting address of the memory range to scan
|
|
|
|
* @end: ending address of the memory range to scan
|
|
|
|
*/
|
|
|
|
unsigned long __init e820_hole_size(unsigned long start, unsigned long end)
|
|
|
|
{
|
|
|
|
unsigned long start_pfn = start >> PAGE_SHIFT;
|
|
|
|
unsigned long end_pfn = end >> PAGE_SHIFT;
|
2008-01-30 20:30:12 +08:00
|
|
|
unsigned long ei_startpfn, ei_endpfn, ram = 0;
|
2007-07-21 23:11:29 +08:00
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < e820.nr_map; i++) {
|
|
|
|
if (e820_find_active_region(&e820.map[i],
|
|
|
|
start_pfn, end_pfn,
|
|
|
|
&ei_startpfn, &ei_endpfn))
|
|
|
|
ram += ei_endpfn - ei_startpfn;
|
|
|
|
}
|
|
|
|
return end - start - (ram << PAGE_SHIFT);
|
|
|
|
}
|
|
|
|
|
2008-01-30 20:30:30 +08:00
|
|
|
static void early_panic(char *msg)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2006-09-26 16:52:37 +08:00
|
|
|
early_printk(msg);
|
|
|
|
panic(msg);
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-01-30 20:31:11 +08:00
|
|
|
/* We're not void only for x86 32-bit compat */
|
2008-05-14 23:15:28 +08:00
|
|
|
char *__init machine_specific_memory_setup(void)
|
2006-09-26 16:52:37 +08:00
|
|
|
{
|
2008-01-30 20:31:11 +08:00
|
|
|
char *who = "BIOS-e820";
|
2005-04-17 06:20:36 +08: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
|
|
|
|
*/
|
2007-10-16 08:13:22 +08:00
|
|
|
sanitize_e820_map(boot_params.e820_map, &boot_params.e820_entries);
|
|
|
|
if (copy_e820_map(boot_params.e820_map, boot_params.e820_entries) < 0)
|
2006-09-26 16:52:37 +08:00
|
|
|
early_panic("Cannot find a valid memory map");
|
2005-04-17 06:20:36 +08:00
|
|
|
printk(KERN_INFO "BIOS-provided physical RAM map:\n");
|
2008-01-30 20:31:11 +08:00
|
|
|
e820_print_map(who);
|
|
|
|
|
|
|
|
/* In case someone cares... */
|
|
|
|
return who;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2006-09-26 16:52:32 +08:00
|
|
|
static int __init parse_memopt(char *p)
|
|
|
|
{
|
|
|
|
if (!p)
|
|
|
|
return -EINVAL;
|
|
|
|
end_user_pfn = memparse(p, &p);
|
2008-01-30 20:30:12 +08:00
|
|
|
end_user_pfn >>= PAGE_SHIFT;
|
2006-09-26 16:52:32 +08:00
|
|
|
return 0;
|
2008-01-30 20:30:12 +08:00
|
|
|
}
|
2006-09-26 16:52:32 +08:00
|
|
|
early_param("mem", parse_memopt);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-09-26 16:52:32 +08:00
|
|
|
static int userdef __initdata;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-09-26 16:52:32 +08:00
|
|
|
static int __init parse_memmap_opt(char *p)
|
2006-01-10 12:51:46 +08:00
|
|
|
{
|
2006-09-26 16:52:32 +08:00
|
|
|
char *oldp;
|
2006-01-10 12:51:46 +08:00
|
|
|
unsigned long long start_at, mem_size;
|
|
|
|
|
2006-09-26 16:52:32 +08:00
|
|
|
if (!strcmp(p, "exactmap")) {
|
|
|
|
#ifdef CONFIG_CRASH_DUMP
|
2008-01-30 20:30:12 +08:00
|
|
|
/*
|
|
|
|
* If we are doing a crash dump, we still need to know
|
|
|
|
* the real mem size before original memory map is
|
2006-09-26 16:52:32 +08:00
|
|
|
* reset.
|
|
|
|
*/
|
2006-11-14 23:57:46 +08:00
|
|
|
e820_register_active_regions(0, 0, -1UL);
|
2006-09-26 16:52:32 +08:00
|
|
|
saved_max_pfn = e820_end_of_ram();
|
2006-11-14 23:57:46 +08:00
|
|
|
remove_all_active_ranges();
|
2006-09-26 16:52:32 +08:00
|
|
|
#endif
|
2008-03-22 04:27:10 +08:00
|
|
|
max_pfn_mapped = 0;
|
2006-09-26 16:52:32 +08:00
|
|
|
e820.nr_map = 0;
|
|
|
|
userdef = 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
oldp = p;
|
|
|
|
mem_size = memparse(p, &p);
|
|
|
|
if (p == oldp)
|
|
|
|
return -EINVAL;
|
2008-01-30 20:30:46 +08:00
|
|
|
|
|
|
|
userdef = 1;
|
2006-01-10 12:51:46 +08:00
|
|
|
if (*p == '@') {
|
2006-09-26 16:52:32 +08:00
|
|
|
start_at = memparse(p+1, &p);
|
2006-01-10 12:51:46 +08:00
|
|
|
add_memory_region(start_at, mem_size, E820_RAM);
|
|
|
|
} else if (*p == '#') {
|
2006-09-26 16:52:32 +08:00
|
|
|
start_at = memparse(p+1, &p);
|
2006-01-10 12:51:46 +08:00
|
|
|
add_memory_region(start_at, mem_size, E820_ACPI);
|
|
|
|
} else if (*p == '$') {
|
2006-09-26 16:52:32 +08:00
|
|
|
start_at = memparse(p+1, &p);
|
2006-01-10 12:51:46 +08:00
|
|
|
add_memory_region(start_at, mem_size, E820_RESERVED);
|
|
|
|
} else {
|
|
|
|
end_user_pfn = (mem_size >> PAGE_SHIFT);
|
|
|
|
}
|
2006-09-26 16:52:32 +08:00
|
|
|
return *p == '\0' ? 0 : -EINVAL;
|
|
|
|
}
|
|
|
|
early_param("memmap", parse_memmap_opt);
|
|
|
|
|
2007-03-17 04:07:36 +08:00
|
|
|
void __init finish_e820_parsing(void)
|
2006-09-26 16:52:32 +08:00
|
|
|
{
|
|
|
|
if (userdef) {
|
2008-01-30 20:30:46 +08:00
|
|
|
char nr = e820.nr_map;
|
|
|
|
|
|
|
|
if (sanitize_e820_map(e820.map, &nr) < 0)
|
|
|
|
early_panic("Invalid user supplied memory map");
|
|
|
|
e820.nr_map = nr;
|
|
|
|
|
2006-09-26 16:52:32 +08:00
|
|
|
printk(KERN_INFO "user-defined physical RAM map:\n");
|
|
|
|
e820_print_map("user");
|
|
|
|
}
|
2006-01-10 12:51:46 +08:00
|
|
|
}
|
|
|
|
|
2007-10-22 07:41:55 +08:00
|
|
|
int __init arch_get_ram_range(int slot, u64 *addr, u64 *size)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (slot < 0 || slot >= e820.nr_map)
|
|
|
|
return -1;
|
|
|
|
for (i = slot; i < e820.nr_map; i++) {
|
|
|
|
if (e820.map[i].type != E820_RAM)
|
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i == e820.nr_map || e820.map[i].addr > (max_pfn << PAGE_SHIFT))
|
|
|
|
return -1;
|
|
|
|
*addr = e820.map[i].addr;
|
|
|
|
*size = min_t(u64, e820.map[i].size + e820.map[i].addr,
|
|
|
|
max_pfn << PAGE_SHIFT) - *addr;
|
|
|
|
return i + 1;
|
|
|
|
}
|