2 * Handle the memory map.
3 * The functions here do the job until bootmem takes over.
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>
11 #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>
17 #include <linux/kexec.h>
18 #include <linux/module.h>
20 #include <linux/pfn.h>
21 #include <linux/suspend.h>
22 #include <linux/firmware-map.h>
24 #include <asm/pgtable.h>
27 #include <asm/proto.h>
28 #include <asm/setup.h>
29 #include <asm/trampoline.h>
32 * The e820 map is the map that gets modified e.g. with command line parameters
33 * and that is also registered with modifications in the kernel resource tree
34 * with the iomem_resource as parent.
36 * The e820_saved is directly saved after the BIOS-provided memory map is
37 * copied. It doesn't get modified afterwards. It's registered for the
38 * /sys/firmware/memmap interface.
40 * That memory map is not modified and is used as base for kexec. The kexec'd
41 * kernel should get the same memory map as the firmware provides. Then the
42 * user can e.g. boot the original kernel with mem=1G while still booting the
43 * next kernel with full memory.
46 struct e820map e820_saved
;
48 /* For PCI or other memory-mapped resources */
49 unsigned long pci_mem_start
= 0xaeedbabe;
51 EXPORT_SYMBOL(pci_mem_start
);
55 * This function checks if any part of the range <start,end> is mapped
59 e820_any_mapped(u64 start
, u64 end
, unsigned type
)
63 for (i
= 0; i
< e820
.nr_map
; i
++) {
64 struct e820entry
*ei
= &e820
.map
[i
];
66 if (type
&& ei
->type
!= type
)
68 if (ei
->addr
>= end
|| ei
->addr
+ ei
->size
<= start
)
74 EXPORT_SYMBOL_GPL(e820_any_mapped
);
77 * This function checks if the entire range <start,end> is mapped with type.
79 * Note: this function only works correct if the e820 table is sorted and
80 * not-overlapping, which is the case
82 int __init
e820_all_mapped(u64 start
, u64 end
, unsigned type
)
86 for (i
= 0; i
< e820
.nr_map
; i
++) {
87 struct e820entry
*ei
= &e820
.map
[i
];
89 if (type
&& ei
->type
!= type
)
91 /* is the region (part) in overlap with the current region ?*/
92 if (ei
->addr
>= end
|| ei
->addr
+ ei
->size
<= start
)
95 /* if the region is at the beginning of <start,end> we move
96 * start to the end of the region since it's ok until there
98 if (ei
->addr
<= start
)
99 start
= ei
->addr
+ ei
->size
;
101 * if start is now at or beyond end, we're done, full
111 * Add a memory region to the kernel e820 map.
113 static void __init
__e820_add_region(struct e820map
*e820x
, u64 start
, u64 size
,
116 int x
= e820x
->nr_map
;
118 if (x
== ARRAY_SIZE(e820x
->map
)) {
119 printk(KERN_ERR
"Ooops! Too many entries in the memory map!\n");
123 e820x
->map
[x
].addr
= start
;
124 e820x
->map
[x
].size
= size
;
125 e820x
->map
[x
].type
= type
;
129 void __init
e820_add_region(u64 start
, u64 size
, int type
)
131 __e820_add_region(&e820
, start
, size
, type
);
134 static void __init
e820_print_type(u32 type
)
138 case E820_RESERVED_KERN
:
139 printk(KERN_CONT
"(usable)");
142 printk(KERN_CONT
"(reserved)");
145 printk(KERN_CONT
"(ACPI data)");
148 printk(KERN_CONT
"(ACPI NVS)");
151 printk(KERN_CONT
"(unusable)");
154 printk(KERN_CONT
"type %u", type
);
159 void __init
e820_print_map(char *who
)
163 for (i
= 0; i
< e820
.nr_map
; i
++) {
164 printk(KERN_INFO
" %s: %016Lx - %016Lx ", who
,
165 (unsigned long long) e820
.map
[i
].addr
,
167 (e820
.map
[i
].addr
+ e820
.map
[i
].size
));
168 e820_print_type(e820
.map
[i
].type
);
169 printk(KERN_CONT
"\n");
174 * Sanitize the BIOS e820 map.
176 * Some e820 responses include overlapping entries. The following
177 * replaces the original e820 map with a new one, removing overlaps,
178 * and resolving conflicting memory types in favor of highest
181 * The input parameter biosmap points to an array of 'struct
182 * e820entry' which on entry has elements in the range [0, *pnr_map)
183 * valid, and which has space for up to max_nr_map entries.
184 * On return, the resulting sanitized e820 map entries will be in
185 * overwritten in the same location, starting at biosmap.
187 * The integer pointed to by pnr_map must be valid on entry (the
188 * current number of valid entries located at biosmap) and will
189 * be updated on return, with the new number of valid entries
190 * (something no more than max_nr_map.)
192 * The return value from sanitize_e820_map() is zero if it
193 * successfully 'sanitized' the map entries passed in, and is -1
194 * if it did nothing, which can happen if either of (1) it was
195 * only passed one map entry, or (2) any of the input map entries
196 * were invalid (start + size < start, meaning that the size was
197 * so big the described memory range wrapped around through zero.)
199 * Visually we're performing the following
200 * (1,2,3,4 = memory types)...
202 * Sample memory map (w/overlaps):
203 * ____22__________________
204 * ______________________4_
205 * ____1111________________
206 * _44_____________________
207 * 11111111________________
208 * ____________________33__
209 * ___________44___________
210 * __________33333_________
211 * ______________22________
212 * ___________________2222_
213 * _________111111111______
214 * _____________________11_
215 * _________________4______
217 * Sanitized equivalent (no overlap):
218 * 1_______________________
219 * _44_____________________
220 * ___1____________________
221 * ____22__________________
222 * ______11________________
223 * _________1______________
224 * __________3_____________
225 * ___________44___________
226 * _____________33_________
227 * _______________2________
228 * ________________1_______
229 * _________________4______
230 * ___________________2____
231 * ____________________33__
232 * ______________________4_
235 int __init
sanitize_e820_map(struct e820entry
*biosmap
, int max_nr_map
,
238 struct change_member
{
239 struct e820entry
*pbios
; /* pointer to original bios entry */
240 unsigned long long addr
; /* address for this change point */
242 static struct change_member change_point_list
[2*E820_X_MAX
] __initdata
;
243 static struct change_member
*change_point
[2*E820_X_MAX
] __initdata
;
244 static struct e820entry
*overlap_list
[E820_X_MAX
] __initdata
;
245 static struct e820entry new_bios
[E820_X_MAX
] __initdata
;
246 struct change_member
*change_tmp
;
247 unsigned long current_type
, last_type
;
248 unsigned long long last_addr
;
249 int chgidx
, still_changing
;
252 int old_nr
, new_nr
, chg_nr
;
255 /* if there's only one memory region, don't bother */
260 BUG_ON(old_nr
> max_nr_map
);
262 /* bail out if we find any unreasonable addresses in bios map */
263 for (i
= 0; i
< old_nr
; i
++)
264 if (biosmap
[i
].addr
+ biosmap
[i
].size
< biosmap
[i
].addr
)
267 /* create pointers for initial change-point information (for sorting) */
268 for (i
= 0; i
< 2 * old_nr
; i
++)
269 change_point
[i
] = &change_point_list
[i
];
271 /* record all known change-points (starting and ending addresses),
272 omitting those that are for empty memory regions */
274 for (i
= 0; i
< old_nr
; i
++) {
275 if (biosmap
[i
].size
!= 0) {
276 change_point
[chgidx
]->addr
= biosmap
[i
].addr
;
277 change_point
[chgidx
++]->pbios
= &biosmap
[i
];
278 change_point
[chgidx
]->addr
= biosmap
[i
].addr
+
280 change_point
[chgidx
++]->pbios
= &biosmap
[i
];
285 /* sort change-point list by memory addresses (low -> high) */
287 while (still_changing
) {
289 for (i
= 1; i
< chg_nr
; i
++) {
290 unsigned long long curaddr
, lastaddr
;
291 unsigned long long curpbaddr
, lastpbaddr
;
293 curaddr
= change_point
[i
]->addr
;
294 lastaddr
= change_point
[i
- 1]->addr
;
295 curpbaddr
= change_point
[i
]->pbios
->addr
;
296 lastpbaddr
= change_point
[i
- 1]->pbios
->addr
;
299 * swap entries, when:
301 * curaddr > lastaddr or
302 * curaddr == lastaddr and curaddr == curpbaddr and
303 * lastaddr != lastpbaddr
305 if (curaddr
< lastaddr
||
306 (curaddr
== lastaddr
&& curaddr
== curpbaddr
&&
307 lastaddr
!= lastpbaddr
)) {
308 change_tmp
= change_point
[i
];
309 change_point
[i
] = change_point
[i
-1];
310 change_point
[i
-1] = change_tmp
;
316 /* create a new bios memory map, removing overlaps */
317 overlap_entries
= 0; /* number of entries in the overlap table */
318 new_bios_entry
= 0; /* index for creating new bios map entries */
319 last_type
= 0; /* start with undefined memory type */
320 last_addr
= 0; /* start with 0 as last starting address */
322 /* loop through change-points, determining affect on the new bios map */
323 for (chgidx
= 0; chgidx
< chg_nr
; chgidx
++) {
324 /* keep track of all overlapping bios entries */
325 if (change_point
[chgidx
]->addr
==
326 change_point
[chgidx
]->pbios
->addr
) {
328 * add map entry to overlap list (> 1 entry
329 * implies an overlap)
331 overlap_list
[overlap_entries
++] =
332 change_point
[chgidx
]->pbios
;
335 * remove entry from list (order independent,
338 for (i
= 0; i
< overlap_entries
; i
++) {
339 if (overlap_list
[i
] ==
340 change_point
[chgidx
]->pbios
)
342 overlap_list
[overlap_entries
-1];
347 * if there are overlapping entries, decide which
348 * "type" to use (larger value takes precedence --
349 * 1=usable, 2,3,4,4+=unusable)
352 for (i
= 0; i
< overlap_entries
; i
++)
353 if (overlap_list
[i
]->type
> current_type
)
354 current_type
= overlap_list
[i
]->type
;
356 * continue building up new bios map based on this
359 if (current_type
!= last_type
) {
360 if (last_type
!= 0) {
361 new_bios
[new_bios_entry
].size
=
362 change_point
[chgidx
]->addr
- last_addr
;
364 * move forward only if the new size
367 if (new_bios
[new_bios_entry
].size
!= 0)
369 * no more space left for new
372 if (++new_bios_entry
>= max_nr_map
)
375 if (current_type
!= 0) {
376 new_bios
[new_bios_entry
].addr
=
377 change_point
[chgidx
]->addr
;
378 new_bios
[new_bios_entry
].type
= current_type
;
379 last_addr
= change_point
[chgidx
]->addr
;
381 last_type
= current_type
;
384 /* retain count for new bios entries */
385 new_nr
= new_bios_entry
;
387 /* copy new bios mapping into original location */
388 memcpy(biosmap
, new_bios
, new_nr
* sizeof(struct e820entry
));
394 static int __init
__append_e820_map(struct e820entry
*biosmap
, int nr_map
)
397 u64 start
= biosmap
->addr
;
398 u64 size
= biosmap
->size
;
399 u64 end
= start
+ size
;
400 u32 type
= biosmap
->type
;
402 /* Overflow in 64 bits? Ignore the memory map. */
406 e820_add_region(start
, size
, type
);
415 * Copy the BIOS e820 map into a safe place.
417 * Sanity-check it while we're at it..
419 * If we're lucky and live on a modern system, the setup code
420 * will have given us a memory map that we can use to properly
421 * set up memory. If we aren't, we'll fake a memory map.
423 static int __init
append_e820_map(struct e820entry
*biosmap
, int nr_map
)
425 /* Only one memory region (or negative)? Ignore it */
429 return __append_e820_map(biosmap
, nr_map
);
432 static u64 __init
__e820_update_range(struct e820map
*e820x
, u64 start
,
433 u64 size
, unsigned old_type
,
438 u64 real_updated_size
= 0;
440 BUG_ON(old_type
== new_type
);
442 if (size
> (ULLONG_MAX
- start
))
443 size
= ULLONG_MAX
- start
;
446 printk(KERN_DEBUG
"e820 update range: %016Lx - %016Lx ",
447 (unsigned long long) start
,
448 (unsigned long long) end
);
449 e820_print_type(old_type
);
450 printk(KERN_CONT
" ==> ");
451 e820_print_type(new_type
);
452 printk(KERN_CONT
"\n");
454 for (i
= 0; i
< e820x
->nr_map
; i
++) {
455 struct e820entry
*ei
= &e820x
->map
[i
];
456 u64 final_start
, final_end
;
459 if (ei
->type
!= old_type
)
462 ei_end
= ei
->addr
+ ei
->size
;
463 /* totally covered by new range? */
464 if (ei
->addr
>= start
&& ei_end
<= end
) {
466 real_updated_size
+= ei
->size
;
470 /* new range is totally covered? */
471 if (ei
->addr
< start
&& ei_end
> end
) {
472 __e820_add_region(e820x
, start
, size
, new_type
);
473 __e820_add_region(e820x
, end
, ei_end
- end
, ei
->type
);
474 ei
->size
= start
- ei
->addr
;
475 real_updated_size
+= size
;
479 /* partially covered */
480 final_start
= max(start
, ei
->addr
);
481 final_end
= min(end
, ei_end
);
482 if (final_start
>= final_end
)
485 __e820_add_region(e820x
, final_start
, final_end
- final_start
,
488 real_updated_size
+= final_end
- final_start
;
491 * left range could be head or tail, so need to update
494 ei
->size
-= final_end
- final_start
;
495 if (ei
->addr
< final_start
)
497 ei
->addr
= final_end
;
499 return real_updated_size
;
502 u64 __init
e820_update_range(u64 start
, u64 size
, unsigned old_type
,
505 return __e820_update_range(&e820
, start
, size
, old_type
, new_type
);
508 static u64 __init
e820_update_range_saved(u64 start
, u64 size
,
509 unsigned old_type
, unsigned new_type
)
511 return __e820_update_range(&e820_saved
, start
, size
, old_type
,
515 /* make e820 not cover the range */
516 u64 __init
e820_remove_range(u64 start
, u64 size
, unsigned old_type
,
520 u64 real_removed_size
= 0;
522 if (size
> (ULLONG_MAX
- start
))
523 size
= ULLONG_MAX
- start
;
525 for (i
= 0; i
< e820
.nr_map
; i
++) {
526 struct e820entry
*ei
= &e820
.map
[i
];
527 u64 final_start
, final_end
;
529 if (checktype
&& ei
->type
!= old_type
)
531 /* totally covered? */
532 if (ei
->addr
>= start
&&
533 (ei
->addr
+ ei
->size
) <= (start
+ size
)) {
534 real_removed_size
+= ei
->size
;
535 memset(ei
, 0, sizeof(struct e820entry
));
538 /* partially covered */
539 final_start
= max(start
, ei
->addr
);
540 final_end
= min(start
+ size
, ei
->addr
+ ei
->size
);
541 if (final_start
>= final_end
)
543 real_removed_size
+= final_end
- final_start
;
545 ei
->size
-= final_end
- final_start
;
546 if (ei
->addr
< final_start
)
548 ei
->addr
= final_end
;
550 return real_removed_size
;
553 void __init
update_e820(void)
557 nr_map
= e820
.nr_map
;
558 if (sanitize_e820_map(e820
.map
, ARRAY_SIZE(e820
.map
), &nr_map
))
560 e820
.nr_map
= nr_map
;
561 printk(KERN_INFO
"modified physical RAM map:\n");
562 e820_print_map("modified");
564 static void __init
update_e820_saved(void)
568 nr_map
= e820_saved
.nr_map
;
569 if (sanitize_e820_map(e820_saved
.map
, ARRAY_SIZE(e820_saved
.map
), &nr_map
))
571 e820_saved
.nr_map
= nr_map
;
573 #define MAX_GAP_END 0x100000000ull
575 * Search for a gap in the e820 memory space from start_addr to end_addr.
577 __init
int e820_search_gap(unsigned long *gapstart
, unsigned long *gapsize
,
578 unsigned long start_addr
, unsigned long long end_addr
)
580 unsigned long long last
;
584 last
= (end_addr
&& end_addr
< MAX_GAP_END
) ? end_addr
: MAX_GAP_END
;
587 unsigned long long start
= e820
.map
[i
].addr
;
588 unsigned long long end
= start
+ e820
.map
[i
].size
;
590 if (end
< start_addr
)
594 * Since "last" is at most 4GB, we know we'll
595 * fit in 32 bits if this condition is true
598 unsigned long gap
= last
- end
;
600 if (gap
>= *gapsize
) {
613 * Search for the biggest gap in the low 32 bits of the e820
614 * memory space. We pass this space to PCI to assign MMIO resources
615 * for hotplug or unconfigured devices in.
616 * Hopefully the BIOS let enough space left.
618 __init
void e820_setup_gap(void)
620 unsigned long gapstart
, gapsize
;
623 gapstart
= 0x10000000;
625 found
= e820_search_gap(&gapstart
, &gapsize
, 0, MAX_GAP_END
);
629 gapstart
= (max_pfn
<< PAGE_SHIFT
) + 1024*1024;
631 "PCI: Warning: Cannot find a gap in the 32bit address range\n"
632 "PCI: Unassigned devices with 32bit resource registers may break!\n");
637 * e820_reserve_resources_late protect stolen RAM already
639 pci_mem_start
= gapstart
;
642 "Allocating PCI resources starting at %lx (gap: %lx:%lx)\n",
643 pci_mem_start
, gapstart
, gapsize
);
647 * Because of the size limitation of struct boot_params, only first
648 * 128 E820 memory entries are passed to kernel via
649 * boot_params.e820_map, others are passed via SETUP_E820_EXT node of
650 * linked list of struct setup_data, which is parsed here.
652 void __init
parse_e820_ext(struct setup_data
*sdata
, unsigned long pa_data
)
656 struct e820entry
*extmap
;
658 entries
= sdata
->len
/ sizeof(struct e820entry
);
659 map_len
= sdata
->len
+ sizeof(struct setup_data
);
660 if (map_len
> PAGE_SIZE
)
661 sdata
= early_ioremap(pa_data
, map_len
);
662 extmap
= (struct e820entry
*)(sdata
->data
);
663 __append_e820_map(extmap
, entries
);
664 sanitize_e820_map(e820
.map
, ARRAY_SIZE(e820
.map
), &e820
.nr_map
);
665 if (map_len
> PAGE_SIZE
)
666 early_iounmap(sdata
, map_len
);
667 printk(KERN_INFO
"extended physical RAM map:\n");
668 e820_print_map("extended");
671 #if defined(CONFIG_X86_64) || \
672 (defined(CONFIG_X86_32) && defined(CONFIG_HIBERNATION))
674 * Find the ranges of physical addresses that do not correspond to
675 * e820 RAM areas and mark the corresponding pages as nosave for
676 * hibernation (32 bit) or software suspend and suspend to RAM (64 bit).
678 * This function requires the e820 map to be sorted and without any
679 * overlapping entries and assumes the first e820 area to be RAM.
681 void __init
e820_mark_nosave_regions(unsigned long limit_pfn
)
686 pfn
= PFN_DOWN(e820
.map
[0].addr
+ e820
.map
[0].size
);
687 for (i
= 1; i
< e820
.nr_map
; i
++) {
688 struct e820entry
*ei
= &e820
.map
[i
];
690 if (pfn
< PFN_UP(ei
->addr
))
691 register_nosave_region(pfn
, PFN_UP(ei
->addr
));
693 pfn
= PFN_DOWN(ei
->addr
+ ei
->size
);
694 if (ei
->type
!= E820_RAM
&& ei
->type
!= E820_RESERVED_KERN
)
695 register_nosave_region(PFN_UP(ei
->addr
), pfn
);
697 if (pfn
>= limit_pfn
)
703 #ifdef CONFIG_HIBERNATION
705 * Mark ACPI NVS memory region, so that we can save/restore it during
706 * hibernation and the subsequent resume.
708 static int __init
e820_mark_nvs_memory(void)
712 for (i
= 0; i
< e820
.nr_map
; i
++) {
713 struct e820entry
*ei
= &e820
.map
[i
];
715 if (ei
->type
== E820_NVS
)
716 hibernate_nvs_register(ei
->addr
, ei
->size
);
721 core_initcall(e820_mark_nvs_memory
);
725 * Early reserved memory areas.
727 #define MAX_EARLY_RES 20
734 static struct early_res early_res
[MAX_EARLY_RES
] __initdata
= {
735 { 0, PAGE_SIZE
, "BIOS data page" }, /* BIOS data page */
739 static int __init
find_overlapped_early(u64 start
, u64 end
)
744 for (i
= 0; i
< MAX_EARLY_RES
&& early_res
[i
].end
; i
++) {
746 if (end
> r
->start
&& start
< r
->end
)
754 * Drop the i-th range from the early reservation map,
755 * by copying any higher ranges down one over it, and
756 * clearing what had been the last slot.
758 static void __init
drop_range(int i
)
762 for (j
= i
+ 1; j
< MAX_EARLY_RES
&& early_res
[j
].end
; j
++)
765 memmove(&early_res
[i
], &early_res
[i
+ 1],
766 (j
- 1 - i
) * sizeof(struct early_res
));
768 early_res
[j
- 1].end
= 0;
772 * Split any existing ranges that:
773 * 1) are marked 'overlap_ok', and
774 * 2) overlap with the stated range [start, end)
775 * into whatever portion (if any) of the existing range is entirely
776 * below or entirely above the stated range. Drop the portion
777 * of the existing range that overlaps with the stated range,
778 * which will allow the caller of this routine to then add that
779 * stated range without conflicting with any existing range.
781 static void __init
drop_overlaps_that_are_ok(u64 start
, u64 end
)
785 u64 lower_start
, lower_end
;
786 u64 upper_start
, upper_end
;
789 for (i
= 0; i
< MAX_EARLY_RES
&& early_res
[i
].end
; i
++) {
792 /* Continue past non-overlapping ranges */
793 if (end
<= r
->start
|| start
>= r
->end
)
797 * Leave non-ok overlaps as is; let caller
798 * panic "Overlapping early reservations"
799 * when it hits this overlap.
805 * We have an ok overlap. We will drop it from the early
806 * reservation map, and add back in any non-overlapping
807 * portions (lower or upper) as separate, overlap_ok,
808 * non-overlapping ranges.
811 /* 1. Note any non-overlapping (lower or upper) ranges. */
812 strncpy(name
, r
->name
, sizeof(name
) - 1);
814 lower_start
= lower_end
= 0;
815 upper_start
= upper_end
= 0;
816 if (r
->start
< start
) {
817 lower_start
= r
->start
;
825 /* 2. Drop the original ok overlapping range */
828 i
--; /* resume for-loop on copied down entry */
830 /* 3. Add back in any non-overlapping ranges. */
832 reserve_early_overlap_ok(lower_start
, lower_end
, name
);
834 reserve_early_overlap_ok(upper_start
, upper_end
, name
);
838 static void __init
__reserve_early(u64 start
, u64 end
, char *name
,
844 i
= find_overlapped_early(start
, end
);
845 if (i
>= MAX_EARLY_RES
)
846 panic("Too many early reservations");
849 panic("Overlapping early reservations "
850 "%llx-%llx %s to %llx-%llx %s\n",
851 start
, end
- 1, name
?name
:"", r
->start
,
852 r
->end
- 1, r
->name
);
855 r
->overlap_ok
= overlap_ok
;
857 strncpy(r
->name
, name
, sizeof(r
->name
) - 1);
861 * A few early reservtations come here.
863 * The 'overlap_ok' in the name of this routine does -not- mean it
864 * is ok for these reservations to overlap an earlier reservation.
865 * Rather it means that it is ok for subsequent reservations to
868 * Use this entry point to reserve early ranges when you are doing
869 * so out of "Paranoia", reserving perhaps more memory than you need,
870 * just in case, and don't mind a subsequent overlapping reservation
871 * that is known to be needed.
873 * The drop_overlaps_that_are_ok() call here isn't really needed.
874 * It would be needed if we had two colliding 'overlap_ok'
875 * reservations, so that the second such would not panic on the
876 * overlap with the first. We don't have any such as of this
877 * writing, but might as well tolerate such if it happens in
880 void __init
reserve_early_overlap_ok(u64 start
, u64 end
, char *name
)
882 drop_overlaps_that_are_ok(start
, end
);
883 __reserve_early(start
, end
, name
, 1);
887 * Most early reservations come here.
889 * We first have drop_overlaps_that_are_ok() drop any pre-existing
890 * 'overlap_ok' ranges, so that we can then reserve this memory
891 * range without risk of panic'ing on an overlapping overlap_ok
894 void __init
reserve_early(u64 start
, u64 end
, char *name
)
899 drop_overlaps_that_are_ok(start
, end
);
900 __reserve_early(start
, end
, name
, 0);
903 void __init
free_early(u64 start
, u64 end
)
908 i
= find_overlapped_early(start
, end
);
910 if (i
>= MAX_EARLY_RES
|| r
->end
!= end
|| r
->start
!= start
)
911 panic("free_early on not reserved area: %llx-%llx!",
917 void __init
early_res_to_bootmem(u64 start
, u64 end
)
920 u64 final_start
, final_end
;
923 for (i
= 0; i
< MAX_EARLY_RES
&& early_res
[i
].end
; i
++)
926 printk(KERN_INFO
"(%d early reservations) ==> bootmem [%010llx - %010llx]\n",
928 for (i
= 0; i
< count
; i
++) {
929 struct early_res
*r
= &early_res
[i
];
930 printk(KERN_INFO
" #%d [%010llx - %010llx] %16s", i
,
931 r
->start
, r
->end
, r
->name
);
932 final_start
= max(start
, r
->start
);
933 final_end
= min(end
, r
->end
);
934 if (final_start
>= final_end
) {
935 printk(KERN_CONT
"\n");
938 printk(KERN_CONT
" ==> [%010llx - %010llx]\n",
939 final_start
, final_end
);
940 reserve_bootmem_generic(final_start
, final_end
- final_start
,
945 /* Check for already reserved areas */
946 static inline int __init
bad_addr(u64
*addrp
, u64 size
, u64 align
)
953 i
= find_overlapped_early(addr
, addr
+ size
);
955 if (i
< MAX_EARLY_RES
&& r
->end
) {
956 *addrp
= addr
= round_up(r
->end
, align
);
963 /* Check for already reserved areas */
964 static inline int __init
bad_addr_size(u64
*addrp
, u64
*sizep
, u64 align
)
967 u64 addr
= *addrp
, last
;
972 for (i
= 0; i
< MAX_EARLY_RES
&& early_res
[i
].end
; i
++) {
973 struct early_res
*r
= &early_res
[i
];
974 if (last
> r
->start
&& addr
< r
->start
) {
975 size
= r
->start
- addr
;
979 if (last
> r
->end
&& addr
< r
->end
) {
980 addr
= round_up(r
->end
, align
);
985 if (last
<= r
->end
&& addr
>= r
->start
) {
998 * Find a free area with specified alignment in a specific range.
1000 u64 __init
find_e820_area(u64 start
, u64 end
, u64 size
, u64 align
)
1004 for (i
= 0; i
< e820
.nr_map
; i
++) {
1005 struct e820entry
*ei
= &e820
.map
[i
];
1009 if (ei
->type
!= E820_RAM
)
1011 addr
= round_up(ei
->addr
, align
);
1012 ei_last
= ei
->addr
+ ei
->size
;
1014 addr
= round_up(start
, align
);
1015 if (addr
>= ei_last
)
1017 while (bad_addr(&addr
, size
, align
) && addr
+size
<= ei_last
)
1030 * Find next free range after *start
1032 u64 __init
find_e820_area_size(u64 start
, u64
*sizep
, u64 align
)
1036 for (i
= 0; i
< e820
.nr_map
; i
++) {
1037 struct e820entry
*ei
= &e820
.map
[i
];
1041 if (ei
->type
!= E820_RAM
)
1043 addr
= round_up(ei
->addr
, align
);
1044 ei_last
= ei
->addr
+ ei
->size
;
1046 addr
= round_up(start
, align
);
1047 if (addr
>= ei_last
)
1049 *sizep
= ei_last
- addr
;
1050 while (bad_addr_size(&addr
, sizep
, align
) &&
1051 addr
+ *sizep
<= ei_last
)
1053 last
= addr
+ *sizep
;
1063 * pre allocated 4k and reserved it in e820
1065 u64 __init
early_reserve_e820(u64 startt
, u64 sizet
, u64 align
)
1071 for (start
= startt
; ; start
+= size
) {
1072 start
= find_e820_area_size(start
, &size
, align
);
1079 #ifdef CONFIG_X86_32
1080 if (start
>= MAXMEM
)
1082 if (start
+ size
> MAXMEM
)
1083 size
= MAXMEM
- start
;
1086 addr
= round_down(start
+ size
- sizet
, align
);
1089 e820_update_range(addr
, sizet
, E820_RAM
, E820_RESERVED
);
1090 e820_update_range_saved(addr
, sizet
, E820_RAM
, E820_RESERVED
);
1091 printk(KERN_INFO
"update e820 for early_reserve_e820\n");
1093 update_e820_saved();
1098 #ifdef CONFIG_X86_32
1099 # ifdef CONFIG_X86_PAE
1100 # define MAX_ARCH_PFN (1ULL<<(36-PAGE_SHIFT))
1102 # define MAX_ARCH_PFN (1ULL<<(32-PAGE_SHIFT))
1104 #else /* CONFIG_X86_32 */
1105 # define MAX_ARCH_PFN MAXMEM>>PAGE_SHIFT
1109 * Find the highest page frame number we have available
1111 static unsigned long __init
e820_end_pfn(unsigned long limit_pfn
, unsigned type
)
1114 unsigned long last_pfn
= 0;
1115 unsigned long max_arch_pfn
= MAX_ARCH_PFN
;
1117 for (i
= 0; i
< e820
.nr_map
; i
++) {
1118 struct e820entry
*ei
= &e820
.map
[i
];
1119 unsigned long start_pfn
;
1120 unsigned long end_pfn
;
1122 if (ei
->type
!= type
)
1125 start_pfn
= ei
->addr
>> PAGE_SHIFT
;
1126 end_pfn
= (ei
->addr
+ ei
->size
) >> PAGE_SHIFT
;
1128 if (start_pfn
>= limit_pfn
)
1130 if (end_pfn
> limit_pfn
) {
1131 last_pfn
= limit_pfn
;
1134 if (end_pfn
> last_pfn
)
1138 if (last_pfn
> max_arch_pfn
)
1139 last_pfn
= max_arch_pfn
;
1141 printk(KERN_INFO
"last_pfn = %#lx max_arch_pfn = %#lx\n",
1142 last_pfn
, max_arch_pfn
);
1145 unsigned long __init
e820_end_of_ram_pfn(void)
1147 return e820_end_pfn(MAX_ARCH_PFN
, E820_RAM
);
1150 unsigned long __init
e820_end_of_low_ram_pfn(void)
1152 return e820_end_pfn(1UL<<(32 - PAGE_SHIFT
), E820_RAM
);
1155 * Finds an active region in the address range from start_pfn to last_pfn and
1156 * returns its range in ei_startpfn and ei_endpfn for the e820 entry.
1158 int __init
e820_find_active_region(const struct e820entry
*ei
,
1159 unsigned long start_pfn
,
1160 unsigned long last_pfn
,
1161 unsigned long *ei_startpfn
,
1162 unsigned long *ei_endpfn
)
1164 u64 align
= PAGE_SIZE
;
1166 *ei_startpfn
= round_up(ei
->addr
, align
) >> PAGE_SHIFT
;
1167 *ei_endpfn
= round_down(ei
->addr
+ ei
->size
, align
) >> PAGE_SHIFT
;
1169 /* Skip map entries smaller than a page */
1170 if (*ei_startpfn
>= *ei_endpfn
)
1173 /* Skip if map is outside the node */
1174 if (ei
->type
!= E820_RAM
|| *ei_endpfn
<= start_pfn
||
1175 *ei_startpfn
>= last_pfn
)
1178 /* Check for overlaps */
1179 if (*ei_startpfn
< start_pfn
)
1180 *ei_startpfn
= start_pfn
;
1181 if (*ei_endpfn
> last_pfn
)
1182 *ei_endpfn
= last_pfn
;
1187 /* Walk the e820 map and register active regions within a node */
1188 void __init
e820_register_active_regions(int nid
, unsigned long start_pfn
,
1189 unsigned long last_pfn
)
1191 unsigned long ei_startpfn
;
1192 unsigned long ei_endpfn
;
1195 for (i
= 0; i
< e820
.nr_map
; i
++)
1196 if (e820_find_active_region(&e820
.map
[i
],
1197 start_pfn
, last_pfn
,
1198 &ei_startpfn
, &ei_endpfn
))
1199 add_active_range(nid
, ei_startpfn
, ei_endpfn
);
1203 * Find the hole size (in bytes) in the memory range.
1204 * @start: starting address of the memory range to scan
1205 * @end: ending address of the memory range to scan
1207 u64 __init
e820_hole_size(u64 start
, u64 end
)
1209 unsigned long start_pfn
= start
>> PAGE_SHIFT
;
1210 unsigned long last_pfn
= end
>> PAGE_SHIFT
;
1211 unsigned long ei_startpfn
, ei_endpfn
, ram
= 0;
1214 for (i
= 0; i
< e820
.nr_map
; i
++) {
1215 if (e820_find_active_region(&e820
.map
[i
],
1216 start_pfn
, last_pfn
,
1217 &ei_startpfn
, &ei_endpfn
))
1218 ram
+= ei_endpfn
- ei_startpfn
;
1220 return end
- start
- ((u64
)ram
<< PAGE_SHIFT
);
1223 static void early_panic(char *msg
)
1229 static int userdef __initdata
;
1231 /* "mem=nopentium" disables the 4MB page tables. */
1232 static int __init
parse_memopt(char *p
)
1239 #ifdef CONFIG_X86_32
1240 if (!strcmp(p
, "nopentium")) {
1241 setup_clear_cpu_cap(X86_FEATURE_PSE
);
1247 mem_size
= memparse(p
, &p
);
1248 e820_remove_range(mem_size
, ULLONG_MAX
- mem_size
, E820_RAM
, 1);
1252 early_param("mem", parse_memopt
);
1254 static int __init
parse_memmap_opt(char *p
)
1257 u64 start_at
, mem_size
;
1262 if (!strncmp(p
, "exactmap", 8)) {
1263 #ifdef CONFIG_CRASH_DUMP
1265 * If we are doing a crash dump, we still need to know
1266 * the real mem size before original memory map is
1269 saved_max_pfn
= e820_end_of_ram_pfn();
1277 mem_size
= memparse(p
, &p
);
1283 start_at
= memparse(p
+1, &p
);
1284 e820_add_region(start_at
, mem_size
, E820_RAM
);
1285 } else if (*p
== '#') {
1286 start_at
= memparse(p
+1, &p
);
1287 e820_add_region(start_at
, mem_size
, E820_ACPI
);
1288 } else if (*p
== '$') {
1289 start_at
= memparse(p
+1, &p
);
1290 e820_add_region(start_at
, mem_size
, E820_RESERVED
);
1292 e820_remove_range(mem_size
, ULLONG_MAX
- mem_size
, E820_RAM
, 1);
1294 return *p
== '\0' ? 0 : -EINVAL
;
1296 early_param("memmap", parse_memmap_opt
);
1298 void __init
finish_e820_parsing(void)
1301 u32 nr
= e820
.nr_map
;
1303 if (sanitize_e820_map(e820
.map
, ARRAY_SIZE(e820
.map
), &nr
) < 0)
1304 early_panic("Invalid user supplied memory map");
1307 printk(KERN_INFO
"user-defined physical RAM map:\n");
1308 e820_print_map("user");
1312 static inline const char *e820_type_to_string(int e820_type
)
1314 switch (e820_type
) {
1315 case E820_RESERVED_KERN
:
1316 case E820_RAM
: return "System RAM";
1317 case E820_ACPI
: return "ACPI Tables";
1318 case E820_NVS
: return "ACPI Non-volatile Storage";
1319 case E820_UNUSABLE
: return "Unusable memory";
1320 default: return "reserved";
1325 * Mark e820 reserved areas as busy for the resource manager.
1327 static struct resource __initdata
*e820_res
;
1328 void __init
e820_reserve_resources(void)
1331 struct resource
*res
;
1334 res
= alloc_bootmem_low(sizeof(struct resource
) * e820
.nr_map
);
1336 for (i
= 0; i
< e820
.nr_map
; i
++) {
1337 end
= e820
.map
[i
].addr
+ e820
.map
[i
].size
- 1;
1338 if (end
!= (resource_size_t
)end
) {
1342 res
->name
= e820_type_to_string(e820
.map
[i
].type
);
1343 res
->start
= e820
.map
[i
].addr
;
1346 res
->flags
= IORESOURCE_MEM
;
1349 * don't register the region that could be conflicted with
1350 * pci device BAR resource and insert them later in
1351 * pcibios_resource_survey()
1353 if (e820
.map
[i
].type
!= E820_RESERVED
|| res
->start
< (1ULL<<20)) {
1354 res
->flags
|= IORESOURCE_BUSY
;
1355 insert_resource(&iomem_resource
, res
);
1360 for (i
= 0; i
< e820_saved
.nr_map
; i
++) {
1361 struct e820entry
*entry
= &e820_saved
.map
[i
];
1362 firmware_map_add_early(entry
->addr
,
1363 entry
->addr
+ entry
->size
- 1,
1364 e820_type_to_string(entry
->type
));
1368 /* How much should we pad RAM ending depending on where it is? */
1369 static unsigned long ram_alignment(resource_size_t pos
)
1371 unsigned long mb
= pos
>> 20;
1373 /* To 64kB in the first megabyte */
1377 /* To 1MB in the first 16MB */
1381 /* To 32MB for anything above that */
1382 return 32*1024*1024;
1385 #define MAX_RESOURCE_SIZE ((resource_size_t)-1)
1387 void __init
e820_reserve_resources_late(void)
1390 struct resource
*res
;
1393 for (i
= 0; i
< e820
.nr_map
; i
++) {
1394 if (!res
->parent
&& res
->end
)
1395 insert_resource_expand_to_fit(&iomem_resource
, res
);
1400 * Try to bump up RAM regions to reasonable boundaries to
1403 for (i
= 0; i
< e820
.nr_map
; i
++) {
1404 struct e820entry
*entry
= &e820
.map
[i
];
1407 if (entry
->type
!= E820_RAM
)
1409 start
= entry
->addr
+ entry
->size
;
1410 end
= round_up(start
, ram_alignment(start
)) - 1;
1411 if (end
> MAX_RESOURCE_SIZE
)
1412 end
= MAX_RESOURCE_SIZE
;
1415 reserve_region_with_split(&iomem_resource
, start
, end
,
1420 char *__init
default_machine_specific_memory_setup(void)
1422 char *who
= "BIOS-e820";
1425 * Try to copy the BIOS-supplied E820-map.
1427 * Otherwise fake a memory map; one section from 0k->640k,
1428 * the next section from 1mb->appropriate_mem_k
1430 new_nr
= boot_params
.e820_entries
;
1431 sanitize_e820_map(boot_params
.e820_map
,
1432 ARRAY_SIZE(boot_params
.e820_map
),
1434 boot_params
.e820_entries
= new_nr
;
1435 if (append_e820_map(boot_params
.e820_map
, boot_params
.e820_entries
)
1439 /* compare results from other methods and take the greater */
1440 if (boot_params
.alt_mem_k
1441 < boot_params
.screen_info
.ext_mem_k
) {
1442 mem_size
= boot_params
.screen_info
.ext_mem_k
;
1445 mem_size
= boot_params
.alt_mem_k
;
1450 e820_add_region(0, LOWMEMSIZE(), E820_RAM
);
1451 e820_add_region(HIGH_MEMORY
, mem_size
<< 10, E820_RAM
);
1454 /* In case someone cares... */
1458 char *__init
__attribute__((weak
)) machine_specific_memory_setup(void)
1460 if (x86_quirks
->arch_memory_setup
) {
1461 char *who
= x86_quirks
->arch_memory_setup();
1466 return default_machine_specific_memory_setup();
1469 /* Overridden in paravirt.c if CONFIG_PARAVIRT */
1470 char * __init
__attribute__((weak
)) memory_setup(void)
1472 return machine_specific_memory_setup();
1475 void __init
setup_memory_map(void)
1479 who
= memory_setup();
1480 memcpy(&e820_saved
, &e820
, sizeof(struct e820map
));
1481 printk(KERN_INFO
"BIOS-provided physical RAM map:\n");
1482 e820_print_map(who
);