Commit | Line | Data |
---|---|---|
b79cd8f1 YL |
1 | /* |
2 | * Handle the memory map. | |
3 | * The functions here do the job until bootmem takes over. | |
4 | * | |
5 | * Getting sanitize_e820_map() in sync with i386 version by applying change: | |
6 | * - Provisions for empty E820 memory regions (reported by certain BIOSes). | |
7 | * Alex Achenbach <xela@slit.de>, December 2002. | |
8 | * Venkatesh Pallipadi <venkatesh.pallipadi@intel.com> | |
9 | * | |
10 | */ | |
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> | |
19 | #include <linux/mm.h> | |
20 | #include <linux/pfn.h> | |
bf62f398 | 21 | #include <linux/suspend.h> |
b79cd8f1 YL |
22 | |
23 | #include <asm/pgtable.h> | |
24 | #include <asm/page.h> | |
25 | #include <asm/e820.h> | |
a4c81cf6 | 26 | #include <asm/proto.h> |
b79cd8f1 | 27 | #include <asm/setup.h> |
a4c81cf6 | 28 | #include <asm/trampoline.h> |
b79cd8f1 YL |
29 | |
30 | struct e820map e820; | |
31 | ||
32 | /* For PCI or other memory-mapped resources */ | |
33 | unsigned long pci_mem_start = 0xaeedbabe; | |
34 | #ifdef CONFIG_PCI | |
35 | EXPORT_SYMBOL(pci_mem_start); | |
36 | #endif | |
37 | ||
38 | /* | |
39 | * This function checks if any part of the range <start,end> is mapped | |
40 | * with type. | |
41 | */ | |
42 | int | |
43 | e820_any_mapped(u64 start, u64 end, unsigned type) | |
44 | { | |
45 | int i; | |
46 | ||
47 | for (i = 0; i < e820.nr_map; i++) { | |
48 | struct e820entry *ei = &e820.map[i]; | |
49 | ||
50 | if (type && ei->type != type) | |
51 | continue; | |
52 | if (ei->addr >= end || ei->addr + ei->size <= start) | |
53 | continue; | |
54 | return 1; | |
55 | } | |
56 | return 0; | |
57 | } | |
58 | EXPORT_SYMBOL_GPL(e820_any_mapped); | |
59 | ||
60 | /* | |
61 | * This function checks if the entire range <start,end> is mapped with type. | |
62 | * | |
63 | * Note: this function only works correct if the e820 table is sorted and | |
64 | * not-overlapping, which is the case | |
65 | */ | |
66 | int __init e820_all_mapped(u64 start, u64 end, unsigned type) | |
67 | { | |
68 | int i; | |
69 | ||
70 | for (i = 0; i < e820.nr_map; i++) { | |
71 | struct e820entry *ei = &e820.map[i]; | |
72 | ||
73 | if (type && ei->type != type) | |
74 | continue; | |
75 | /* is the region (part) in overlap with the current region ?*/ | |
76 | if (ei->addr >= end || ei->addr + ei->size <= start) | |
77 | continue; | |
78 | ||
79 | /* if the region is at the beginning of <start,end> we move | |
80 | * start to the end of the region since it's ok until there | |
81 | */ | |
82 | if (ei->addr <= start) | |
83 | start = ei->addr + ei->size; | |
84 | /* | |
85 | * if start is now at or beyond end, we're done, full | |
86 | * coverage | |
87 | */ | |
88 | if (start >= end) | |
89 | return 1; | |
90 | } | |
91 | return 0; | |
92 | } | |
93 | ||
94 | /* | |
95 | * Add a memory region to the kernel e820 map. | |
96 | */ | |
d0be6bde | 97 | void __init e820_add_region(u64 start, u64 size, int type) |
b79cd8f1 YL |
98 | { |
99 | int x = e820.nr_map; | |
100 | ||
c3965bd1 | 101 | if (x == ARRAY_SIZE(e820.map)) { |
b79cd8f1 YL |
102 | printk(KERN_ERR "Ooops! Too many entries in the memory map!\n"); |
103 | return; | |
104 | } | |
105 | ||
106 | e820.map[x].addr = start; | |
107 | e820.map[x].size = size; | |
108 | e820.map[x].type = type; | |
109 | e820.nr_map++; | |
110 | } | |
111 | ||
112 | void __init e820_print_map(char *who) | |
113 | { | |
114 | int i; | |
115 | ||
116 | for (i = 0; i < e820.nr_map; i++) { | |
117 | printk(KERN_INFO " %s: %016Lx - %016Lx ", who, | |
118 | (unsigned long long) e820.map[i].addr, | |
119 | (unsigned long long) | |
120 | (e820.map[i].addr + e820.map[i].size)); | |
121 | switch (e820.map[i].type) { | |
122 | case E820_RAM: | |
123 | printk(KERN_CONT "(usable)\n"); | |
124 | break; | |
125 | case E820_RESERVED: | |
126 | printk(KERN_CONT "(reserved)\n"); | |
127 | break; | |
128 | case E820_ACPI: | |
129 | printk(KERN_CONT "(ACPI data)\n"); | |
130 | break; | |
131 | case E820_NVS: | |
132 | printk(KERN_CONT "(ACPI NVS)\n"); | |
133 | break; | |
134 | default: | |
135 | printk(KERN_CONT "type %u\n", e820.map[i].type); | |
136 | break; | |
137 | } | |
138 | } | |
139 | } | |
140 | ||
141 | /* | |
142 | * Sanitize the BIOS e820 map. | |
143 | * | |
144 | * Some e820 responses include overlapping entries. The following | |
5b7eb2e9 PJ |
145 | * replaces the original e820 map with a new one, removing overlaps, |
146 | * and resolving conflicting memory types in favor of highest | |
147 | * numbered type. | |
b79cd8f1 | 148 | * |
5b7eb2e9 PJ |
149 | * The input parameter biosmap points to an array of 'struct |
150 | * e820entry' which on entry has elements in the range [0, *pnr_map) | |
151 | * valid, and which has space for up to max_nr_map entries. | |
152 | * On return, the resulting sanitized e820 map entries will be in | |
153 | * overwritten in the same location, starting at biosmap. | |
154 | * | |
155 | * The integer pointed to by pnr_map must be valid on entry (the | |
156 | * current number of valid entries located at biosmap) and will | |
157 | * be updated on return, with the new number of valid entries | |
158 | * (something no more than max_nr_map.) | |
159 | * | |
160 | * The return value from sanitize_e820_map() is zero if it | |
161 | * successfully 'sanitized' the map entries passed in, and is -1 | |
162 | * if it did nothing, which can happen if either of (1) it was | |
163 | * only passed one map entry, or (2) any of the input map entries | |
164 | * were invalid (start + size < start, meaning that the size was | |
165 | * so big the described memory range wrapped around through zero.) | |
166 | * | |
167 | * Visually we're performing the following | |
168 | * (1,2,3,4 = memory types)... | |
169 | * | |
170 | * Sample memory map (w/overlaps): | |
171 | * ____22__________________ | |
172 | * ______________________4_ | |
173 | * ____1111________________ | |
174 | * _44_____________________ | |
175 | * 11111111________________ | |
176 | * ____________________33__ | |
177 | * ___________44___________ | |
178 | * __________33333_________ | |
179 | * ______________22________ | |
180 | * ___________________2222_ | |
181 | * _________111111111______ | |
182 | * _____________________11_ | |
183 | * _________________4______ | |
184 | * | |
185 | * Sanitized equivalent (no overlap): | |
186 | * 1_______________________ | |
187 | * _44_____________________ | |
188 | * ___1____________________ | |
189 | * ____22__________________ | |
190 | * ______11________________ | |
191 | * _________1______________ | |
192 | * __________3_____________ | |
193 | * ___________44___________ | |
194 | * _____________33_________ | |
195 | * _______________2________ | |
196 | * ________________1_______ | |
197 | * _________________4______ | |
198 | * ___________________2____ | |
199 | * ____________________33__ | |
200 | * ______________________4_ | |
b79cd8f1 | 201 | */ |
5b7eb2e9 | 202 | |
c3965bd1 | 203 | int __init sanitize_e820_map(struct e820entry *biosmap, int max_nr_map, |
6e9bcc79 | 204 | int *pnr_map) |
b79cd8f1 YL |
205 | { |
206 | struct change_member { | |
207 | struct e820entry *pbios; /* pointer to original bios entry */ | |
208 | unsigned long long addr; /* address for this change point */ | |
209 | }; | |
157fabf0 PJ |
210 | static struct change_member change_point_list[2*E820_X_MAX] __initdata; |
211 | static struct change_member *change_point[2*E820_X_MAX] __initdata; | |
212 | static struct e820entry *overlap_list[E820_X_MAX] __initdata; | |
213 | static struct e820entry new_bios[E820_X_MAX] __initdata; | |
b79cd8f1 YL |
214 | struct change_member *change_tmp; |
215 | unsigned long current_type, last_type; | |
216 | unsigned long long last_addr; | |
217 | int chgidx, still_changing; | |
218 | int overlap_entries; | |
219 | int new_bios_entry; | |
220 | int old_nr, new_nr, chg_nr; | |
221 | int i; | |
222 | ||
b79cd8f1 YL |
223 | /* if there's only one memory region, don't bother */ |
224 | if (*pnr_map < 2) | |
225 | return -1; | |
226 | ||
227 | old_nr = *pnr_map; | |
6e9bcc79 | 228 | BUG_ON(old_nr > max_nr_map); |
b79cd8f1 YL |
229 | |
230 | /* bail out if we find any unreasonable addresses in bios map */ | |
231 | for (i = 0; i < old_nr; i++) | |
232 | if (biosmap[i].addr + biosmap[i].size < biosmap[i].addr) | |
233 | return -1; | |
234 | ||
235 | /* create pointers for initial change-point information (for sorting) */ | |
236 | for (i = 0; i < 2 * old_nr; i++) | |
237 | change_point[i] = &change_point_list[i]; | |
238 | ||
239 | /* record all known change-points (starting and ending addresses), | |
240 | omitting those that are for empty memory regions */ | |
241 | chgidx = 0; | |
242 | for (i = 0; i < old_nr; i++) { | |
243 | if (biosmap[i].size != 0) { | |
244 | change_point[chgidx]->addr = biosmap[i].addr; | |
245 | change_point[chgidx++]->pbios = &biosmap[i]; | |
246 | change_point[chgidx]->addr = biosmap[i].addr + | |
247 | biosmap[i].size; | |
248 | change_point[chgidx++]->pbios = &biosmap[i]; | |
249 | } | |
250 | } | |
251 | chg_nr = chgidx; | |
252 | ||
253 | /* sort change-point list by memory addresses (low -> high) */ | |
254 | still_changing = 1; | |
255 | while (still_changing) { | |
256 | still_changing = 0; | |
257 | for (i = 1; i < chg_nr; i++) { | |
258 | unsigned long long curaddr, lastaddr; | |
259 | unsigned long long curpbaddr, lastpbaddr; | |
260 | ||
261 | curaddr = change_point[i]->addr; | |
262 | lastaddr = change_point[i - 1]->addr; | |
263 | curpbaddr = change_point[i]->pbios->addr; | |
264 | lastpbaddr = change_point[i - 1]->pbios->addr; | |
265 | ||
266 | /* | |
267 | * swap entries, when: | |
268 | * | |
269 | * curaddr > lastaddr or | |
270 | * curaddr == lastaddr and curaddr == curpbaddr and | |
271 | * lastaddr != lastpbaddr | |
272 | */ | |
273 | if (curaddr < lastaddr || | |
274 | (curaddr == lastaddr && curaddr == curpbaddr && | |
275 | lastaddr != lastpbaddr)) { | |
276 | change_tmp = change_point[i]; | |
277 | change_point[i] = change_point[i-1]; | |
278 | change_point[i-1] = change_tmp; | |
279 | still_changing = 1; | |
280 | } | |
281 | } | |
282 | } | |
283 | ||
284 | /* create a new bios memory map, removing overlaps */ | |
285 | overlap_entries = 0; /* number of entries in the overlap table */ | |
286 | new_bios_entry = 0; /* index for creating new bios map entries */ | |
287 | last_type = 0; /* start with undefined memory type */ | |
288 | last_addr = 0; /* start with 0 as last starting address */ | |
289 | ||
290 | /* loop through change-points, determining affect on the new bios map */ | |
291 | for (chgidx = 0; chgidx < chg_nr; chgidx++) { | |
292 | /* keep track of all overlapping bios entries */ | |
293 | if (change_point[chgidx]->addr == | |
294 | change_point[chgidx]->pbios->addr) { | |
295 | /* | |
296 | * add map entry to overlap list (> 1 entry | |
297 | * implies an overlap) | |
298 | */ | |
299 | overlap_list[overlap_entries++] = | |
300 | change_point[chgidx]->pbios; | |
301 | } else { | |
302 | /* | |
303 | * remove entry from list (order independent, | |
304 | * so swap with last) | |
305 | */ | |
306 | for (i = 0; i < overlap_entries; i++) { | |
307 | if (overlap_list[i] == | |
308 | change_point[chgidx]->pbios) | |
309 | overlap_list[i] = | |
310 | overlap_list[overlap_entries-1]; | |
311 | } | |
312 | overlap_entries--; | |
313 | } | |
314 | /* | |
315 | * if there are overlapping entries, decide which | |
316 | * "type" to use (larger value takes precedence -- | |
317 | * 1=usable, 2,3,4,4+=unusable) | |
318 | */ | |
319 | current_type = 0; | |
320 | for (i = 0; i < overlap_entries; i++) | |
321 | if (overlap_list[i]->type > current_type) | |
322 | current_type = overlap_list[i]->type; | |
323 | /* | |
324 | * continue building up new bios map based on this | |
325 | * information | |
326 | */ | |
327 | if (current_type != last_type) { | |
328 | if (last_type != 0) { | |
329 | new_bios[new_bios_entry].size = | |
330 | change_point[chgidx]->addr - last_addr; | |
331 | /* | |
332 | * move forward only if the new size | |
333 | * was non-zero | |
334 | */ | |
335 | if (new_bios[new_bios_entry].size != 0) | |
336 | /* | |
337 | * no more space left for new | |
338 | * bios entries ? | |
339 | */ | |
c3965bd1 | 340 | if (++new_bios_entry >= max_nr_map) |
b79cd8f1 YL |
341 | break; |
342 | } | |
343 | if (current_type != 0) { | |
344 | new_bios[new_bios_entry].addr = | |
345 | change_point[chgidx]->addr; | |
346 | new_bios[new_bios_entry].type = current_type; | |
347 | last_addr = change_point[chgidx]->addr; | |
348 | } | |
349 | last_type = current_type; | |
350 | } | |
351 | } | |
352 | /* retain count for new bios entries */ | |
353 | new_nr = new_bios_entry; | |
354 | ||
355 | /* copy new bios mapping into original location */ | |
356 | memcpy(biosmap, new_bios, new_nr * sizeof(struct e820entry)); | |
357 | *pnr_map = new_nr; | |
358 | ||
359 | return 0; | |
360 | } | |
361 | ||
8c5beb50 HY |
362 | static int __init __copy_e820_map(struct e820entry *biosmap, int nr_map) |
363 | { | |
364 | while (nr_map) { | |
365 | u64 start = biosmap->addr; | |
366 | u64 size = biosmap->size; | |
367 | u64 end = start + size; | |
368 | u32 type = biosmap->type; | |
369 | ||
370 | /* Overflow in 64 bits? Ignore the memory map. */ | |
371 | if (start > end) | |
372 | return -1; | |
373 | ||
374 | e820_add_region(start, size, type); | |
375 | ||
376 | biosmap++; | |
377 | nr_map--; | |
378 | } | |
379 | return 0; | |
380 | } | |
381 | ||
b79cd8f1 YL |
382 | /* |
383 | * Copy the BIOS e820 map into a safe place. | |
384 | * | |
385 | * Sanity-check it while we're at it.. | |
386 | * | |
387 | * If we're lucky and live on a modern system, the setup code | |
388 | * will have given us a memory map that we can use to properly | |
389 | * set up memory. If we aren't, we'll fake a memory map. | |
390 | */ | |
391 | int __init copy_e820_map(struct e820entry *biosmap, int nr_map) | |
392 | { | |
393 | /* Only one memory region (or negative)? Ignore it */ | |
394 | if (nr_map < 2) | |
395 | return -1; | |
396 | ||
8c5beb50 | 397 | return __copy_e820_map(biosmap, nr_map); |
b79cd8f1 YL |
398 | } |
399 | ||
d0be6bde | 400 | u64 __init e820_update_range(u64 start, u64 size, unsigned old_type, |
b79cd8f1 YL |
401 | unsigned new_type) |
402 | { | |
403 | int i; | |
404 | u64 real_updated_size = 0; | |
405 | ||
406 | BUG_ON(old_type == new_type); | |
407 | ||
408 | for (i = 0; i < e820.nr_map; i++) { | |
409 | struct e820entry *ei = &e820.map[i]; | |
410 | u64 final_start, final_end; | |
411 | if (ei->type != old_type) | |
412 | continue; | |
413 | /* totally covered? */ | |
414 | if (ei->addr >= start && | |
415 | (ei->addr + ei->size) <= (start + size)) { | |
416 | ei->type = new_type; | |
417 | real_updated_size += ei->size; | |
418 | continue; | |
419 | } | |
420 | /* partially covered */ | |
421 | final_start = max(start, ei->addr); | |
422 | final_end = min(start + size, ei->addr + ei->size); | |
423 | if (final_start >= final_end) | |
424 | continue; | |
d0be6bde | 425 | e820_add_region(final_start, final_end - final_start, |
b79cd8f1 YL |
426 | new_type); |
427 | real_updated_size += final_end - final_start; | |
428 | } | |
429 | return real_updated_size; | |
430 | } | |
431 | ||
7a1fd986 YL |
432 | /* make e820 not cover the range */ |
433 | u64 __init e820_remove_range(u64 start, u64 size, unsigned old_type, | |
434 | int checktype) | |
435 | { | |
436 | int i; | |
437 | u64 real_removed_size = 0; | |
438 | ||
439 | for (i = 0; i < e820.nr_map; i++) { | |
440 | struct e820entry *ei = &e820.map[i]; | |
441 | u64 final_start, final_end; | |
442 | ||
443 | if (checktype && ei->type != old_type) | |
444 | continue; | |
445 | /* totally covered? */ | |
446 | if (ei->addr >= start && | |
447 | (ei->addr + ei->size) <= (start + size)) { | |
448 | real_removed_size += ei->size; | |
449 | memset(ei, 0, sizeof(struct e820entry)); | |
450 | continue; | |
451 | } | |
452 | /* partially covered */ | |
453 | final_start = max(start, ei->addr); | |
454 | final_end = min(start + size, ei->addr + ei->size); | |
455 | if (final_start >= final_end) | |
456 | continue; | |
457 | real_removed_size += final_end - final_start; | |
458 | ||
459 | ei->size -= final_end - final_start; | |
460 | if (ei->addr < final_start) | |
461 | continue; | |
462 | ei->addr = final_end; | |
463 | } | |
464 | return real_removed_size; | |
465 | } | |
466 | ||
b79cd8f1 YL |
467 | void __init update_e820(void) |
468 | { | |
6e9bcc79 | 469 | int nr_map; |
b79cd8f1 YL |
470 | |
471 | nr_map = e820.nr_map; | |
c3965bd1 | 472 | if (sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &nr_map)) |
b79cd8f1 YL |
473 | return; |
474 | e820.nr_map = nr_map; | |
475 | printk(KERN_INFO "modified physical RAM map:\n"); | |
476 | e820_print_map("modified"); | |
477 | } | |
478 | ||
479 | /* | |
480 | * Search for the biggest gap in the low 32 bits of the e820 | |
481 | * memory space. We pass this space to PCI to assign MMIO resources | |
482 | * for hotplug or unconfigured devices in. | |
483 | * Hopefully the BIOS let enough space left. | |
484 | */ | |
485 | __init void e820_setup_gap(void) | |
486 | { | |
487 | unsigned long gapstart, gapsize, round; | |
488 | unsigned long long last; | |
489 | int i; | |
490 | int found = 0; | |
491 | ||
492 | last = 0x100000000ull; | |
493 | gapstart = 0x10000000; | |
494 | gapsize = 0x400000; | |
495 | i = e820.nr_map; | |
496 | while (--i >= 0) { | |
497 | unsigned long long start = e820.map[i].addr; | |
498 | unsigned long long end = start + e820.map[i].size; | |
499 | ||
500 | /* | |
501 | * Since "last" is at most 4GB, we know we'll | |
502 | * fit in 32 bits if this condition is true | |
503 | */ | |
504 | if (last > end) { | |
505 | unsigned long gap = last - end; | |
506 | ||
507 | if (gap > gapsize) { | |
508 | gapsize = gap; | |
509 | gapstart = end; | |
510 | found = 1; | |
511 | } | |
512 | } | |
513 | if (start < last) | |
514 | last = start; | |
515 | } | |
516 | ||
517 | #ifdef CONFIG_X86_64 | |
518 | if (!found) { | |
519 | gapstart = (end_pfn << PAGE_SHIFT) + 1024*1024; | |
520 | printk(KERN_ERR "PCI: Warning: Cannot find a gap in the 32bit " | |
521 | "address range\n" | |
522 | KERN_ERR "PCI: Unassigned devices with 32bit resource " | |
523 | "registers may break!\n"); | |
524 | } | |
525 | #endif | |
526 | ||
527 | /* | |
528 | * See how much we want to round up: start off with | |
529 | * rounding to the next 1MB area. | |
530 | */ | |
531 | round = 0x100000; | |
532 | while ((gapsize >> 4) > round) | |
533 | round += round; | |
534 | /* Fun with two's complement */ | |
535 | pci_mem_start = (gapstart + round) & -round; | |
536 | ||
537 | printk(KERN_INFO | |
538 | "Allocating PCI resources starting at %lx (gap: %lx:%lx)\n", | |
539 | pci_mem_start, gapstart, gapsize); | |
540 | } | |
541 | ||
8c5beb50 HY |
542 | /** |
543 | * Because of the size limitation of struct boot_params, only first | |
544 | * 128 E820 memory entries are passed to kernel via | |
545 | * boot_params.e820_map, others are passed via SETUP_E820_EXT node of | |
546 | * linked list of struct setup_data, which is parsed here. | |
547 | */ | |
548 | void __init parse_e820_ext(struct setup_data *sdata, unsigned long pa_data) | |
549 | { | |
550 | u32 map_len; | |
551 | int entries; | |
552 | struct e820entry *extmap; | |
553 | ||
554 | entries = sdata->len / sizeof(struct e820entry); | |
555 | map_len = sdata->len + sizeof(struct setup_data); | |
556 | if (map_len > PAGE_SIZE) | |
557 | sdata = early_ioremap(pa_data, map_len); | |
558 | extmap = (struct e820entry *)(sdata->data); | |
559 | __copy_e820_map(extmap, entries); | |
560 | sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &e820.nr_map); | |
561 | if (map_len > PAGE_SIZE) | |
562 | early_iounmap(sdata, map_len); | |
563 | printk(KERN_INFO "extended physical RAM map:\n"); | |
564 | e820_print_map("extended"); | |
565 | } | |
566 | ||
bf62f398 YL |
567 | #if defined(CONFIG_X86_64) || \ |
568 | (defined(CONFIG_X86_32) && defined(CONFIG_HIBERNATION)) | |
569 | /** | |
570 | * Find the ranges of physical addresses that do not correspond to | |
571 | * e820 RAM areas and mark the corresponding pages as nosave for | |
572 | * hibernation (32 bit) or software suspend and suspend to RAM (64 bit). | |
573 | * | |
574 | * This function requires the e820 map to be sorted and without any | |
575 | * overlapping entries and assumes the first e820 area to be RAM. | |
576 | */ | |
577 | void __init e820_mark_nosave_regions(unsigned long limit_pfn) | |
578 | { | |
579 | int i; | |
580 | unsigned long pfn; | |
581 | ||
582 | pfn = PFN_DOWN(e820.map[0].addr + e820.map[0].size); | |
583 | for (i = 1; i < e820.nr_map; i++) { | |
584 | struct e820entry *ei = &e820.map[i]; | |
585 | ||
586 | if (pfn < PFN_UP(ei->addr)) | |
587 | register_nosave_region(pfn, PFN_UP(ei->addr)); | |
588 | ||
589 | pfn = PFN_DOWN(ei->addr + ei->size); | |
590 | if (ei->type != E820_RAM) | |
591 | register_nosave_region(PFN_UP(ei->addr), pfn); | |
592 | ||
593 | if (pfn >= limit_pfn) | |
594 | break; | |
595 | } | |
596 | } | |
597 | #endif | |
a4c81cf6 YL |
598 | |
599 | /* | |
600 | * Early reserved memory areas. | |
601 | */ | |
602 | #define MAX_EARLY_RES 20 | |
603 | ||
604 | struct early_res { | |
605 | u64 start, end; | |
606 | char name[16]; | |
c4ba1320 | 607 | char overlap_ok; |
a4c81cf6 YL |
608 | }; |
609 | static struct early_res early_res[MAX_EARLY_RES] __initdata = { | |
610 | { 0, PAGE_SIZE, "BIOS data page" }, /* BIOS data page */ | |
611 | #if defined(CONFIG_X86_64) && defined(CONFIG_X86_TRAMPOLINE) | |
612 | { TRAMPOLINE_BASE, TRAMPOLINE_BASE + 2 * PAGE_SIZE, "TRAMPOLINE" }, | |
613 | #endif | |
614 | #if defined(CONFIG_X86_32) && defined(CONFIG_SMP) | |
615 | /* | |
616 | * But first pinch a few for the stack/trampoline stuff | |
617 | * FIXME: Don't need the extra page at 4K, but need to fix | |
618 | * trampoline before removing it. (see the GDT stuff) | |
619 | */ | |
620 | { PAGE_SIZE, PAGE_SIZE + PAGE_SIZE, "EX TRAMPOLINE" }, | |
621 | /* | |
622 | * Has to be in very low memory so we can execute | |
623 | * real-mode AP code. | |
624 | */ | |
625 | { TRAMPOLINE_BASE, TRAMPOLINE_BASE + PAGE_SIZE, "TRAMPOLINE" }, | |
626 | #endif | |
627 | {} | |
628 | }; | |
629 | ||
d3fbe5ea | 630 | static int __init find_overlapped_early(u64 start, u64 end) |
a4c81cf6 YL |
631 | { |
632 | int i; | |
633 | struct early_res *r; | |
d3fbe5ea | 634 | |
a4c81cf6 YL |
635 | for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) { |
636 | r = &early_res[i]; | |
637 | if (end > r->start && start < r->end) | |
d3fbe5ea | 638 | break; |
a4c81cf6 | 639 | } |
d3fbe5ea HY |
640 | |
641 | return i; | |
642 | } | |
643 | ||
c4ba1320 PJ |
644 | /* |
645 | * Drop the i-th range from the early reservation map, | |
646 | * by copying any higher ranges down one over it, and | |
647 | * clearing what had been the last slot. | |
648 | */ | |
649 | static void __init drop_range(int i) | |
650 | { | |
651 | int j; | |
652 | ||
653 | for (j = i + 1; j < MAX_EARLY_RES && early_res[j].end; j++) | |
654 | ; | |
655 | ||
656 | memmove(&early_res[i], &early_res[i + 1], | |
657 | (j - 1 - i) * sizeof(struct early_res)); | |
658 | ||
659 | early_res[j - 1].end = 0; | |
660 | } | |
661 | ||
662 | /* | |
663 | * Split any existing ranges that: | |
664 | * 1) are marked 'overlap_ok', and | |
665 | * 2) overlap with the stated range [start, end) | |
666 | * into whatever portion (if any) of the existing range is entirely | |
667 | * below or entirely above the stated range. Drop the portion | |
668 | * of the existing range that overlaps with the stated range, | |
669 | * which will allow the caller of this routine to then add that | |
670 | * stated range without conflicting with any existing range. | |
671 | */ | |
672 | static void __init drop_overlaps_that_are_ok(u64 start, u64 end) | |
673 | { | |
674 | int i; | |
675 | struct early_res *r; | |
676 | u64 lower_start, lower_end; | |
677 | u64 upper_start, upper_end; | |
678 | char name[16]; | |
679 | ||
680 | for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) { | |
681 | r = &early_res[i]; | |
682 | ||
683 | /* Continue past non-overlapping ranges */ | |
684 | if (end <= r->start || start >= r->end) | |
685 | continue; | |
686 | ||
687 | /* | |
688 | * Leave non-ok overlaps as is; let caller | |
689 | * panic "Overlapping early reservations" | |
690 | * when it hits this overlap. | |
691 | */ | |
692 | if (!r->overlap_ok) | |
693 | return; | |
694 | ||
695 | /* | |
696 | * We have an ok overlap. We will drop it from the early | |
697 | * reservation map, and add back in any non-overlapping | |
698 | * portions (lower or upper) as separate, overlap_ok, | |
699 | * non-overlapping ranges. | |
700 | */ | |
701 | ||
702 | /* 1. Note any non-overlapping (lower or upper) ranges. */ | |
703 | strncpy(name, r->name, sizeof(name) - 1); | |
704 | ||
705 | lower_start = lower_end = 0; | |
706 | upper_start = upper_end = 0; | |
707 | if (r->start < start) { | |
708 | lower_start = r->start; | |
709 | lower_end = start; | |
710 | } | |
711 | if (r->end > end) { | |
712 | upper_start = end; | |
713 | upper_end = r->end; | |
714 | } | |
715 | ||
716 | /* 2. Drop the original ok overlapping range */ | |
717 | drop_range(i); | |
718 | ||
719 | i--; /* resume for-loop on copied down entry */ | |
720 | ||
721 | /* 3. Add back in any non-overlapping ranges. */ | |
722 | if (lower_end) | |
723 | reserve_early_overlap_ok(lower_start, lower_end, name); | |
724 | if (upper_end) | |
725 | reserve_early_overlap_ok(upper_start, upper_end, name); | |
726 | } | |
727 | } | |
728 | ||
729 | static void __init __reserve_early(u64 start, u64 end, char *name, | |
730 | int overlap_ok) | |
d3fbe5ea HY |
731 | { |
732 | int i; | |
733 | struct early_res *r; | |
734 | ||
735 | i = find_overlapped_early(start, end); | |
a4c81cf6 YL |
736 | if (i >= MAX_EARLY_RES) |
737 | panic("Too many early reservations"); | |
738 | r = &early_res[i]; | |
d3fbe5ea HY |
739 | if (r->end) |
740 | panic("Overlapping early reservations " | |
741 | "%llx-%llx %s to %llx-%llx %s\n", | |
742 | start, end - 1, name?name:"", r->start, | |
743 | r->end - 1, r->name); | |
a4c81cf6 YL |
744 | r->start = start; |
745 | r->end = end; | |
c4ba1320 | 746 | r->overlap_ok = overlap_ok; |
a4c81cf6 YL |
747 | if (name) |
748 | strncpy(r->name, name, sizeof(r->name) - 1); | |
749 | } | |
750 | ||
c4ba1320 PJ |
751 | /* |
752 | * A few early reservtations come here. | |
753 | * | |
754 | * The 'overlap_ok' in the name of this routine does -not- mean it | |
755 | * is ok for these reservations to overlap an earlier reservation. | |
756 | * Rather it means that it is ok for subsequent reservations to | |
757 | * overlap this one. | |
758 | * | |
759 | * Use this entry point to reserve early ranges when you are doing | |
760 | * so out of "Paranoia", reserving perhaps more memory than you need, | |
761 | * just in case, and don't mind a subsequent overlapping reservation | |
762 | * that is known to be needed. | |
763 | * | |
764 | * The drop_overlaps_that_are_ok() call here isn't really needed. | |
765 | * It would be needed if we had two colliding 'overlap_ok' | |
766 | * reservations, so that the second such would not panic on the | |
767 | * overlap with the first. We don't have any such as of this | |
768 | * writing, but might as well tolerate such if it happens in | |
769 | * the future. | |
770 | */ | |
771 | void __init reserve_early_overlap_ok(u64 start, u64 end, char *name) | |
772 | { | |
773 | drop_overlaps_that_are_ok(start, end); | |
774 | __reserve_early(start, end, name, 1); | |
775 | } | |
776 | ||
777 | /* | |
778 | * Most early reservations come here. | |
779 | * | |
780 | * We first have drop_overlaps_that_are_ok() drop any pre-existing | |
781 | * 'overlap_ok' ranges, so that we can then reserve this memory | |
782 | * range without risk of panic'ing on an overlapping overlap_ok | |
783 | * early reservation. | |
784 | */ | |
785 | void __init reserve_early(u64 start, u64 end, char *name) | |
786 | { | |
787 | drop_overlaps_that_are_ok(start, end); | |
788 | __reserve_early(start, end, name, 0); | |
789 | } | |
790 | ||
a4c81cf6 YL |
791 | void __init free_early(u64 start, u64 end) |
792 | { | |
793 | struct early_res *r; | |
c4ba1320 | 794 | int i; |
a4c81cf6 | 795 | |
d3fbe5ea HY |
796 | i = find_overlapped_early(start, end); |
797 | r = &early_res[i]; | |
798 | if (i >= MAX_EARLY_RES || r->end != end || r->start != start) | |
a4c81cf6 | 799 | panic("free_early on not reserved area: %llx-%llx!", |
d3fbe5ea | 800 | start, end - 1); |
a4c81cf6 | 801 | |
c4ba1320 | 802 | drop_range(i); |
a4c81cf6 YL |
803 | } |
804 | ||
805 | void __init early_res_to_bootmem(u64 start, u64 end) | |
806 | { | |
807 | int i; | |
808 | u64 final_start, final_end; | |
809 | for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) { | |
810 | struct early_res *r = &early_res[i]; | |
811 | final_start = max(start, r->start); | |
812 | final_end = min(end, r->end); | |
813 | if (final_start >= final_end) | |
814 | continue; | |
815 | printk(KERN_INFO " early res: %d [%llx-%llx] %s\n", i, | |
816 | final_start, final_end - 1, r->name); | |
d2dbf343 | 817 | reserve_bootmem_generic(final_start, final_end - final_start, |
a4c81cf6 | 818 | BOOTMEM_DEFAULT); |
a4c81cf6 YL |
819 | } |
820 | } | |
821 | ||
822 | /* Check for already reserved areas */ | |
823 | static inline int __init bad_addr(u64 *addrp, u64 size, u64 align) | |
824 | { | |
825 | int i; | |
d3fbe5ea | 826 | u64 addr = *addrp; |
a4c81cf6 | 827 | int changed = 0; |
d3fbe5ea | 828 | struct early_res *r; |
a4c81cf6 | 829 | again: |
d3fbe5ea HY |
830 | i = find_overlapped_early(addr, addr + size); |
831 | r = &early_res[i]; | |
832 | if (i < MAX_EARLY_RES && r->end) { | |
833 | *addrp = addr = round_up(r->end, align); | |
834 | changed = 1; | |
835 | goto again; | |
a4c81cf6 YL |
836 | } |
837 | return changed; | |
838 | } | |
839 | ||
840 | /* Check for already reserved areas */ | |
841 | static inline int __init bad_addr_size(u64 *addrp, u64 *sizep, u64 align) | |
842 | { | |
843 | int i; | |
844 | u64 addr = *addrp, last; | |
845 | u64 size = *sizep; | |
846 | int changed = 0; | |
847 | again: | |
848 | last = addr + size; | |
849 | for (i = 0; i < MAX_EARLY_RES && early_res[i].end; i++) { | |
850 | struct early_res *r = &early_res[i]; | |
851 | if (last > r->start && addr < r->start) { | |
852 | size = r->start - addr; | |
853 | changed = 1; | |
854 | goto again; | |
855 | } | |
856 | if (last > r->end && addr < r->end) { | |
857 | addr = round_up(r->end, align); | |
858 | size = last - addr; | |
859 | changed = 1; | |
860 | goto again; | |
861 | } | |
862 | if (last <= r->end && addr >= r->start) { | |
863 | (*sizep)++; | |
864 | return 0; | |
865 | } | |
866 | } | |
867 | if (changed) { | |
868 | *addrp = addr; | |
869 | *sizep = size; | |
870 | } | |
871 | return changed; | |
872 | } | |
873 | ||
874 | /* | |
875 | * Find a free area with specified alignment in a specific range. | |
876 | */ | |
877 | u64 __init find_e820_area(u64 start, u64 end, u64 size, u64 align) | |
878 | { | |
879 | int i; | |
880 | ||
881 | for (i = 0; i < e820.nr_map; i++) { | |
882 | struct e820entry *ei = &e820.map[i]; | |
883 | u64 addr, last; | |
884 | u64 ei_last; | |
885 | ||
886 | if (ei->type != E820_RAM) | |
887 | continue; | |
888 | addr = round_up(ei->addr, align); | |
889 | ei_last = ei->addr + ei->size; | |
890 | if (addr < start) | |
891 | addr = round_up(start, align); | |
892 | if (addr >= ei_last) | |
893 | continue; | |
894 | while (bad_addr(&addr, size, align) && addr+size <= ei_last) | |
895 | ; | |
896 | last = addr + size; | |
897 | if (last > ei_last) | |
898 | continue; | |
899 | if (last > end) | |
900 | continue; | |
901 | return addr; | |
902 | } | |
903 | return -1ULL; | |
904 | } | |
905 | ||
906 | /* | |
907 | * Find next free range after *start | |
908 | */ | |
909 | u64 __init find_e820_area_size(u64 start, u64 *sizep, u64 align) | |
910 | { | |
911 | int i; | |
912 | ||
913 | for (i = 0; i < e820.nr_map; i++) { | |
914 | struct e820entry *ei = &e820.map[i]; | |
915 | u64 addr, last; | |
916 | u64 ei_last; | |
917 | ||
918 | if (ei->type != E820_RAM) | |
919 | continue; | |
920 | addr = round_up(ei->addr, align); | |
921 | ei_last = ei->addr + ei->size; | |
922 | if (addr < start) | |
923 | addr = round_up(start, align); | |
924 | if (addr >= ei_last) | |
925 | continue; | |
926 | *sizep = ei_last - addr; | |
927 | while (bad_addr_size(&addr, sizep, align) && | |
928 | addr + *sizep <= ei_last) | |
929 | ; | |
930 | last = addr + *sizep; | |
931 | if (last > ei_last) | |
932 | continue; | |
933 | return addr; | |
934 | } | |
935 | return -1UL; | |
936 | ||
937 | } | |
2944e16b YL |
938 | |
939 | /* | |
940 | * pre allocated 4k and reserved it in e820 | |
941 | */ | |
942 | u64 __init early_reserve_e820(u64 startt, u64 sizet, u64 align) | |
943 | { | |
944 | u64 size = 0; | |
945 | u64 addr; | |
946 | u64 start; | |
947 | ||
948 | start = startt; | |
949 | while (size < sizet) | |
950 | start = find_e820_area_size(start, &size, align); | |
951 | ||
952 | if (size < sizet) | |
953 | return 0; | |
954 | ||
955 | addr = round_down(start + size - sizet, align); | |
d0be6bde | 956 | e820_update_range(addr, sizet, E820_RAM, E820_RESERVED); |
2944e16b YL |
957 | printk(KERN_INFO "update e820 for early_reserve_e820\n"); |
958 | update_e820(); | |
959 | ||
960 | return addr; | |
961 | } | |
962 | ||
ee0c80fa YL |
963 | #ifdef CONFIG_X86_32 |
964 | # ifdef CONFIG_X86_PAE | |
965 | # define MAX_ARCH_PFN (1ULL<<(36-PAGE_SHIFT)) | |
966 | # else | |
967 | # define MAX_ARCH_PFN (1ULL<<(32-PAGE_SHIFT)) | |
968 | # endif | |
969 | #else /* CONFIG_X86_32 */ | |
bd70e522 | 970 | # define MAX_ARCH_PFN MAXMEM>>PAGE_SHIFT |
ee0c80fa YL |
971 | #endif |
972 | ||
973 | /* | |
974 | * Last pfn which the user wants to use. | |
975 | */ | |
976 | unsigned long __initdata end_user_pfn = MAX_ARCH_PFN; | |
977 | ||
978 | /* | |
979 | * Find the highest page frame number we have available | |
980 | */ | |
981 | unsigned long __init e820_end_of_ram(void) | |
982 | { | |
983 | unsigned long last_pfn; | |
984 | unsigned long max_arch_pfn = MAX_ARCH_PFN; | |
985 | ||
986 | last_pfn = find_max_pfn_with_active_regions(); | |
987 | ||
988 | if (last_pfn > max_arch_pfn) | |
989 | last_pfn = max_arch_pfn; | |
990 | if (last_pfn > end_user_pfn) | |
991 | last_pfn = end_user_pfn; | |
992 | ||
e2fc252e | 993 | printk(KERN_INFO "last_pfn = 0x%lx max_arch_pfn = 0x%lx\n", |
ee0c80fa YL |
994 | last_pfn, max_arch_pfn); |
995 | return last_pfn; | |
996 | } | |
997 | ||
998 | /* | |
999 | * Finds an active region in the address range from start_pfn to last_pfn and | |
1000 | * returns its range in ei_startpfn and ei_endpfn for the e820 entry. | |
1001 | */ | |
1002 | int __init e820_find_active_region(const struct e820entry *ei, | |
1003 | unsigned long start_pfn, | |
1004 | unsigned long last_pfn, | |
1005 | unsigned long *ei_startpfn, | |
1006 | unsigned long *ei_endpfn) | |
1007 | { | |
1008 | u64 align = PAGE_SIZE; | |
1009 | ||
1010 | *ei_startpfn = round_up(ei->addr, align) >> PAGE_SHIFT; | |
1011 | *ei_endpfn = round_down(ei->addr + ei->size, align) >> PAGE_SHIFT; | |
1012 | ||
1013 | /* Skip map entries smaller than a page */ | |
1014 | if (*ei_startpfn >= *ei_endpfn) | |
1015 | return 0; | |
1016 | ||
1017 | /* Skip if map is outside the node */ | |
1018 | if (ei->type != E820_RAM || *ei_endpfn <= start_pfn || | |
1019 | *ei_startpfn >= last_pfn) | |
1020 | return 0; | |
1021 | ||
1022 | /* Check for overlaps */ | |
1023 | if (*ei_startpfn < start_pfn) | |
1024 | *ei_startpfn = start_pfn; | |
1025 | if (*ei_endpfn > last_pfn) | |
1026 | *ei_endpfn = last_pfn; | |
1027 | ||
1028 | /* Obey end_user_pfn to save on memmap */ | |
1029 | if (*ei_startpfn >= end_user_pfn) | |
1030 | return 0; | |
1031 | if (*ei_endpfn > end_user_pfn) | |
1032 | *ei_endpfn = end_user_pfn; | |
1033 | ||
1034 | return 1; | |
1035 | } | |
1036 | ||
1037 | /* Walk the e820 map and register active regions within a node */ | |
1038 | void __init e820_register_active_regions(int nid, unsigned long start_pfn, | |
1039 | unsigned long last_pfn) | |
1040 | { | |
1041 | unsigned long ei_startpfn; | |
1042 | unsigned long ei_endpfn; | |
1043 | int i; | |
1044 | ||
1045 | for (i = 0; i < e820.nr_map; i++) | |
1046 | if (e820_find_active_region(&e820.map[i], | |
1047 | start_pfn, last_pfn, | |
1048 | &ei_startpfn, &ei_endpfn)) | |
1049 | add_active_range(nid, ei_startpfn, ei_endpfn); | |
1050 | } | |
1051 | ||
1052 | /* | |
1053 | * Find the hole size (in bytes) in the memory range. | |
1054 | * @start: starting address of the memory range to scan | |
1055 | * @end: ending address of the memory range to scan | |
1056 | */ | |
1057 | u64 __init e820_hole_size(u64 start, u64 end) | |
1058 | { | |
1059 | unsigned long start_pfn = start >> PAGE_SHIFT; | |
1060 | unsigned long last_pfn = end >> PAGE_SHIFT; | |
1061 | unsigned long ei_startpfn, ei_endpfn, ram = 0; | |
1062 | int i; | |
1063 | ||
1064 | for (i = 0; i < e820.nr_map; i++) { | |
1065 | if (e820_find_active_region(&e820.map[i], | |
1066 | start_pfn, last_pfn, | |
1067 | &ei_startpfn, &ei_endpfn)) | |
1068 | ram += ei_endpfn - ei_startpfn; | |
1069 | } | |
1070 | return end - start - ((u64)ram << PAGE_SHIFT); | |
1071 | } | |
ab4a465e YL |
1072 | |
1073 | static void early_panic(char *msg) | |
1074 | { | |
1075 | early_printk(msg); | |
1076 | panic(msg); | |
1077 | } | |
1078 | ||
1079 | /* "mem=nopentium" disables the 4MB page tables. */ | |
1080 | static int __init parse_memopt(char *p) | |
1081 | { | |
1082 | u64 mem_size; | |
1083 | ||
1084 | if (!p) | |
1085 | return -EINVAL; | |
1086 | ||
1087 | #ifdef CONFIG_X86_32 | |
1088 | if (!strcmp(p, "nopentium")) { | |
1089 | setup_clear_cpu_cap(X86_FEATURE_PSE); | |
1090 | return 0; | |
1091 | } | |
1092 | #endif | |
1093 | ||
1094 | mem_size = memparse(p, &p); | |
1095 | end_user_pfn = mem_size>>PAGE_SHIFT; | |
1096 | return 0; | |
1097 | } | |
1098 | early_param("mem", parse_memopt); | |
1099 | ||
1100 | static int userdef __initdata; | |
1101 | ||
1102 | static int __init parse_memmap_opt(char *p) | |
1103 | { | |
1104 | char *oldp; | |
1105 | u64 start_at, mem_size; | |
1106 | ||
1107 | if (!strcmp(p, "exactmap")) { | |
1108 | #ifdef CONFIG_CRASH_DUMP | |
1109 | /* | |
1110 | * If we are doing a crash dump, we still need to know | |
1111 | * the real mem size before original memory map is | |
1112 | * reset. | |
1113 | */ | |
1114 | e820_register_active_regions(0, 0, -1UL); | |
1115 | saved_max_pfn = e820_end_of_ram(); | |
1116 | remove_all_active_ranges(); | |
1117 | #endif | |
1118 | e820.nr_map = 0; | |
1119 | userdef = 1; | |
1120 | return 0; | |
1121 | } | |
1122 | ||
1123 | oldp = p; | |
1124 | mem_size = memparse(p, &p); | |
1125 | if (p == oldp) | |
1126 | return -EINVAL; | |
1127 | ||
1128 | userdef = 1; | |
1129 | if (*p == '@') { | |
1130 | start_at = memparse(p+1, &p); | |
d0be6bde | 1131 | e820_add_region(start_at, mem_size, E820_RAM); |
ab4a465e YL |
1132 | } else if (*p == '#') { |
1133 | start_at = memparse(p+1, &p); | |
d0be6bde | 1134 | e820_add_region(start_at, mem_size, E820_ACPI); |
ab4a465e YL |
1135 | } else if (*p == '$') { |
1136 | start_at = memparse(p+1, &p); | |
d0be6bde | 1137 | e820_add_region(start_at, mem_size, E820_RESERVED); |
ab4a465e YL |
1138 | } else { |
1139 | end_user_pfn = (mem_size >> PAGE_SHIFT); | |
1140 | } | |
1141 | return *p == '\0' ? 0 : -EINVAL; | |
1142 | } | |
1143 | early_param("memmap", parse_memmap_opt); | |
1144 | ||
1145 | void __init finish_e820_parsing(void) | |
1146 | { | |
1147 | if (userdef) { | |
1148 | int nr = e820.nr_map; | |
1149 | ||
1150 | if (sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &nr) < 0) | |
1151 | early_panic("Invalid user supplied memory map"); | |
1152 | e820.nr_map = nr; | |
1153 | ||
1154 | printk(KERN_INFO "user-defined physical RAM map:\n"); | |
1155 | e820_print_map("user"); | |
1156 | } | |
1157 | } | |
41c094fd YL |
1158 | |
1159 | /* | |
1160 | * Mark e820 reserved areas as busy for the resource manager. | |
1161 | */ | |
1162 | void __init e820_reserve_resources(void) | |
1163 | { | |
1164 | int i; | |
1165 | struct resource *res; | |
1166 | ||
1167 | res = alloc_bootmem_low(sizeof(struct resource) * e820.nr_map); | |
1168 | for (i = 0; i < e820.nr_map; i++) { | |
1169 | switch (e820.map[i].type) { | |
1170 | case E820_RAM: res->name = "System RAM"; break; | |
1171 | case E820_ACPI: res->name = "ACPI Tables"; break; | |
1172 | case E820_NVS: res->name = "ACPI Non-volatile Storage"; break; | |
1173 | default: res->name = "reserved"; | |
1174 | } | |
1175 | res->start = e820.map[i].addr; | |
1176 | res->end = res->start + e820.map[i].size - 1; | |
1177 | #ifndef CONFIG_RESOURCES_64BIT | |
1178 | if (res->end > 0x100000000ULL) { | |
1179 | res++; | |
1180 | continue; | |
1181 | } | |
1182 | #endif | |
1183 | res->flags = IORESOURCE_MEM | IORESOURCE_BUSY; | |
1184 | insert_resource(&iomem_resource, res); | |
1185 | res++; | |
1186 | } | |
1187 | } | |
1188 | ||
95a71a45 | 1189 | char *__init default_machine_specific_memory_setup(void) |
064d25f1 YL |
1190 | { |
1191 | char *who = "BIOS-e820"; | |
1192 | int new_nr; | |
1193 | /* | |
1194 | * Try to copy the BIOS-supplied E820-map. | |
1195 | * | |
1196 | * Otherwise fake a memory map; one section from 0k->640k, | |
1197 | * the next section from 1mb->appropriate_mem_k | |
1198 | */ | |
1199 | new_nr = boot_params.e820_entries; | |
1200 | sanitize_e820_map(boot_params.e820_map, | |
1201 | ARRAY_SIZE(boot_params.e820_map), | |
1202 | &new_nr); | |
1203 | boot_params.e820_entries = new_nr; | |
1204 | if (copy_e820_map(boot_params.e820_map, boot_params.e820_entries) < 0) { | |
95a71a45 | 1205 | u64 mem_size; |
064d25f1 YL |
1206 | |
1207 | /* compare results from other methods and take the greater */ | |
1208 | if (boot_params.alt_mem_k | |
1209 | < boot_params.screen_info.ext_mem_k) { | |
1210 | mem_size = boot_params.screen_info.ext_mem_k; | |
1211 | who = "BIOS-88"; | |
1212 | } else { | |
1213 | mem_size = boot_params.alt_mem_k; | |
1214 | who = "BIOS-e801"; | |
1215 | } | |
1216 | ||
1217 | e820.nr_map = 0; | |
1218 | e820_add_region(0, LOWMEMSIZE(), E820_RAM); | |
1219 | e820_add_region(HIGH_MEMORY, mem_size << 10, E820_RAM); | |
064d25f1 YL |
1220 | } |
1221 | ||
1222 | /* In case someone cares... */ | |
1223 | return who; | |
1224 | } | |
1225 | ||
95a71a45 YL |
1226 | char *__init __attribute__((weak)) machine_specific_memory_setup(void) |
1227 | { | |
1228 | return default_machine_specific_memory_setup(); | |
1229 | } | |
1230 | ||
064d25f1 YL |
1231 | /* Overridden in paravirt.c if CONFIG_PARAVIRT */ |
1232 | char * __init __attribute__((weak)) memory_setup(void) | |
1233 | { | |
1234 | return machine_specific_memory_setup(); | |
1235 | } | |
1236 | ||
1237 | void __init setup_memory_map(void) | |
1238 | { | |
1239 | printk(KERN_INFO "BIOS-provided physical RAM map:\n"); | |
1240 | e820_print_map(memory_setup()); | |
1241 | } | |
1242 | ||
1243 | #ifdef CONFIG_X86_64 | |
1244 | int __init arch_get_ram_range(int slot, u64 *addr, u64 *size) | |
1245 | { | |
1246 | int i; | |
41c094fd | 1247 | |
064d25f1 YL |
1248 | if (slot < 0 || slot >= e820.nr_map) |
1249 | return -1; | |
1250 | for (i = slot; i < e820.nr_map; i++) { | |
1251 | if (e820.map[i].type != E820_RAM) | |
1252 | continue; | |
1253 | break; | |
1254 | } | |
1255 | if (i == e820.nr_map || e820.map[i].addr > (max_pfn << PAGE_SHIFT)) | |
1256 | return -1; | |
1257 | *addr = e820.map[i].addr; | |
1258 | *size = min_t(u64, e820.map[i].size + e820.map[i].addr, | |
1259 | max_pfn << PAGE_SHIFT) - *addr; | |
1260 | return i + 1; | |
1261 | } | |
1262 | #endif |