Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Handle the memory map. | |
3 | * The functions here do the job until bootmem takes over. | |
8059b2a2 VP |
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 | * | |
1da177e4 LT |
10 | */ |
11 | #include <linux/config.h> | |
12 | #include <linux/kernel.h> | |
13 | #include <linux/types.h> | |
14 | #include <linux/init.h> | |
15 | #include <linux/bootmem.h> | |
16 | #include <linux/ioport.h> | |
17 | #include <linux/string.h> | |
5f5609df | 18 | #include <linux/kexec.h> |
b9491ac8 AM |
19 | #include <linux/module.h> |
20 | ||
1da177e4 LT |
21 | #include <asm/page.h> |
22 | #include <asm/e820.h> | |
23 | #include <asm/proto.h> | |
24 | #include <asm/bootsetup.h> | |
2bc0414e | 25 | #include <asm/sections.h> |
1da177e4 LT |
26 | |
27 | /* | |
28 | * PFN of last memory page. | |
29 | */ | |
30 | unsigned long end_pfn; | |
f3591fff | 31 | EXPORT_SYMBOL(end_pfn); |
1da177e4 LT |
32 | |
33 | /* | |
34 | * end_pfn only includes RAM, while end_pfn_map includes all e820 entries. | |
35 | * The direct mapping extends to end_pfn_map, so that we can directly access | |
36 | * apertures, ACPI and other tables without having to play with fixmaps. | |
37 | */ | |
38 | unsigned long end_pfn_map; | |
39 | ||
40 | /* | |
41 | * Last pfn which the user wants to use. | |
42 | */ | |
43 | unsigned long end_user_pfn = MAXMEM>>PAGE_SHIFT; | |
44 | ||
45 | extern struct resource code_resource, data_resource; | |
46 | ||
47 | /* Check for some hardcoded bad areas that early boot is not allowed to touch */ | |
48 | static inline int bad_addr(unsigned long *addrp, unsigned long size) | |
49 | { | |
50 | unsigned long addr = *addrp, last = addr + size; | |
51 | ||
52 | /* various gunk below that needed for SMP startup */ | |
53 | if (addr < 0x8000) { | |
54 | *addrp = 0x8000; | |
55 | return 1; | |
56 | } | |
57 | ||
58 | /* direct mapping tables of the kernel */ | |
59 | if (last >= table_start<<PAGE_SHIFT && addr < table_end<<PAGE_SHIFT) { | |
60 | *addrp = table_end << PAGE_SHIFT; | |
61 | return 1; | |
62 | } | |
63 | ||
64 | /* initrd */ | |
65 | #ifdef CONFIG_BLK_DEV_INITRD | |
66 | if (LOADER_TYPE && INITRD_START && last >= INITRD_START && | |
67 | addr < INITRD_START+INITRD_SIZE) { | |
68 | *addrp = INITRD_START + INITRD_SIZE; | |
69 | return 1; | |
70 | } | |
71 | #endif | |
72 | /* kernel code + 640k memory hole (later should not be needed, but | |
73 | be paranoid for now) */ | |
74 | if (last >= 640*1024 && addr < __pa_symbol(&_end)) { | |
75 | *addrp = __pa_symbol(&_end); | |
76 | return 1; | |
77 | } | |
ac71d12c AK |
78 | |
79 | if (last >= ebda_addr && addr < ebda_addr + ebda_size) { | |
80 | *addrp = ebda_addr + ebda_size; | |
81 | return 1; | |
82 | } | |
83 | ||
1da177e4 LT |
84 | /* XXX ramdisk image here? */ |
85 | return 0; | |
86 | } | |
87 | ||
95222368 AV |
88 | /* |
89 | * This function checks if any part of the range <start,end> is mapped | |
90 | * with type. | |
91 | */ | |
eee5a9fa AV |
92 | int __meminit |
93 | e820_any_mapped(unsigned long start, unsigned long end, unsigned type) | |
1da177e4 LT |
94 | { |
95 | int i; | |
96 | for (i = 0; i < e820.nr_map; i++) { | |
97 | struct e820entry *ei = &e820.map[i]; | |
98 | if (type && ei->type != type) | |
99 | continue; | |
48c8b113 | 100 | if (ei->addr >= end || ei->addr + ei->size <= start) |
1da177e4 LT |
101 | continue; |
102 | return 1; | |
103 | } | |
104 | return 0; | |
105 | } | |
106 | ||
95222368 AV |
107 | /* |
108 | * This function checks if the entire range <start,end> is mapped with type. | |
109 | * | |
110 | * Note: this function only works correct if the e820 table is sorted and | |
111 | * not-overlapping, which is the case | |
112 | */ | |
113 | int __init e820_all_mapped(unsigned long start, unsigned long end, unsigned type) | |
114 | { | |
115 | int i; | |
116 | for (i = 0; i < e820.nr_map; i++) { | |
117 | struct e820entry *ei = &e820.map[i]; | |
118 | if (type && ei->type != type) | |
119 | continue; | |
120 | /* is the region (part) in overlap with the current region ?*/ | |
121 | if (ei->addr >= end || ei->addr + ei->size <= start) | |
122 | continue; | |
123 | ||
124 | /* if the region is at the beginning of <start,end> we move | |
125 | * start to the end of the region since it's ok until there | |
126 | */ | |
127 | if (ei->addr <= start) | |
128 | start = ei->addr + ei->size; | |
129 | /* if start is now at or beyond end, we're done, full coverage */ | |
130 | if (start >= end) | |
131 | return 1; /* we're done */ | |
132 | } | |
133 | return 0; | |
134 | } | |
135 | ||
1da177e4 LT |
136 | /* |
137 | * Find a free area in a specific range. | |
138 | */ | |
139 | unsigned long __init find_e820_area(unsigned long start, unsigned long end, unsigned size) | |
140 | { | |
141 | int i; | |
142 | for (i = 0; i < e820.nr_map; i++) { | |
143 | struct e820entry *ei = &e820.map[i]; | |
144 | unsigned long addr = ei->addr, last; | |
145 | if (ei->type != E820_RAM) | |
146 | continue; | |
147 | if (addr < start) | |
148 | addr = start; | |
149 | if (addr > ei->addr + ei->size) | |
150 | continue; | |
7ca97c61 | 151 | while (bad_addr(&addr, size) && addr+size <= ei->addr+ei->size) |
1da177e4 LT |
152 | ; |
153 | last = addr + size; | |
154 | if (last > ei->addr + ei->size) | |
155 | continue; | |
156 | if (last > end) | |
157 | continue; | |
158 | return addr; | |
159 | } | |
160 | return -1UL; | |
161 | } | |
162 | ||
163 | /* | |
164 | * Free bootmem based on the e820 table for a node. | |
165 | */ | |
166 | void __init e820_bootmem_free(pg_data_t *pgdat, unsigned long start,unsigned long end) | |
167 | { | |
168 | int i; | |
169 | for (i = 0; i < e820.nr_map; i++) { | |
170 | struct e820entry *ei = &e820.map[i]; | |
171 | unsigned long last, addr; | |
172 | ||
173 | if (ei->type != E820_RAM || | |
174 | ei->addr+ei->size <= start || | |
7c7a3897 | 175 | ei->addr >= end) |
1da177e4 LT |
176 | continue; |
177 | ||
178 | addr = round_up(ei->addr, PAGE_SIZE); | |
179 | if (addr < start) | |
180 | addr = start; | |
181 | ||
182 | last = round_down(ei->addr + ei->size, PAGE_SIZE); | |
183 | if (last >= end) | |
184 | last = end; | |
185 | ||
186 | if (last > addr && last-addr >= PAGE_SIZE) | |
187 | free_bootmem_node(pgdat, addr, last-addr); | |
188 | } | |
189 | } | |
190 | ||
191 | /* | |
192 | * Find the highest page frame number we have available | |
193 | */ | |
194 | unsigned long __init e820_end_of_ram(void) | |
195 | { | |
196 | int i; | |
197 | unsigned long end_pfn = 0; | |
198 | ||
199 | for (i = 0; i < e820.nr_map; i++) { | |
200 | struct e820entry *ei = &e820.map[i]; | |
201 | unsigned long start, end; | |
202 | ||
203 | start = round_up(ei->addr, PAGE_SIZE); | |
204 | end = round_down(ei->addr + ei->size, PAGE_SIZE); | |
205 | if (start >= end) | |
206 | continue; | |
207 | if (ei->type == E820_RAM) { | |
208 | if (end > end_pfn<<PAGE_SHIFT) | |
209 | end_pfn = end>>PAGE_SHIFT; | |
210 | } else { | |
211 | if (end > end_pfn_map<<PAGE_SHIFT) | |
212 | end_pfn_map = end>>PAGE_SHIFT; | |
213 | } | |
214 | } | |
215 | ||
216 | if (end_pfn > end_pfn_map) | |
217 | end_pfn_map = end_pfn; | |
218 | if (end_pfn_map > MAXMEM>>PAGE_SHIFT) | |
219 | end_pfn_map = MAXMEM>>PAGE_SHIFT; | |
220 | if (end_pfn > end_user_pfn) | |
221 | end_pfn = end_user_pfn; | |
222 | if (end_pfn > end_pfn_map) | |
223 | end_pfn = end_pfn_map; | |
224 | ||
225 | return end_pfn; | |
226 | } | |
227 | ||
228 | /* | |
485761bd AK |
229 | * Compute how much memory is missing in a range. |
230 | * Unlike the other functions in this file the arguments are in page numbers. | |
231 | */ | |
232 | unsigned long __init | |
233 | e820_hole_size(unsigned long start_pfn, unsigned long end_pfn) | |
234 | { | |
235 | unsigned long ram = 0; | |
236 | unsigned long start = start_pfn << PAGE_SHIFT; | |
237 | unsigned long end = end_pfn << PAGE_SHIFT; | |
238 | int i; | |
239 | for (i = 0; i < e820.nr_map; i++) { | |
240 | struct e820entry *ei = &e820.map[i]; | |
241 | unsigned long last, addr; | |
242 | ||
243 | if (ei->type != E820_RAM || | |
244 | ei->addr+ei->size <= start || | |
245 | ei->addr >= end) | |
246 | continue; | |
247 | ||
248 | addr = round_up(ei->addr, PAGE_SIZE); | |
249 | if (addr < start) | |
250 | addr = start; | |
251 | ||
252 | last = round_down(ei->addr + ei->size, PAGE_SIZE); | |
253 | if (last >= end) | |
254 | last = end; | |
255 | ||
256 | if (last > addr) | |
257 | ram += last - addr; | |
258 | } | |
259 | return ((end - start) - ram) >> PAGE_SHIFT; | |
260 | } | |
261 | ||
262 | /* | |
1da177e4 LT |
263 | * Mark e820 reserved areas as busy for the resource manager. |
264 | */ | |
265 | void __init e820_reserve_resources(void) | |
266 | { | |
267 | int i; | |
268 | for (i = 0; i < e820.nr_map; i++) { | |
269 | struct resource *res; | |
1da177e4 LT |
270 | res = alloc_bootmem_low(sizeof(struct resource)); |
271 | switch (e820.map[i].type) { | |
272 | case E820_RAM: res->name = "System RAM"; break; | |
273 | case E820_ACPI: res->name = "ACPI Tables"; break; | |
274 | case E820_NVS: res->name = "ACPI Non-volatile Storage"; break; | |
275 | default: res->name = "reserved"; | |
276 | } | |
277 | res->start = e820.map[i].addr; | |
278 | res->end = res->start + e820.map[i].size - 1; | |
279 | res->flags = IORESOURCE_MEM | IORESOURCE_BUSY; | |
280 | request_resource(&iomem_resource, res); | |
281 | if (e820.map[i].type == E820_RAM) { | |
282 | /* | |
283 | * We don't know which RAM region contains kernel data, | |
284 | * so we try it repeatedly and let the resource manager | |
285 | * test it. | |
286 | */ | |
287 | request_resource(res, &code_resource); | |
288 | request_resource(res, &data_resource); | |
5f5609df EB |
289 | #ifdef CONFIG_KEXEC |
290 | request_resource(res, &crashk_res); | |
291 | #endif | |
1da177e4 LT |
292 | } |
293 | } | |
294 | } | |
295 | ||
296 | /* | |
297 | * Add a memory region to the kernel e820 map. | |
298 | */ | |
299 | void __init add_memory_region(unsigned long start, unsigned long size, int type) | |
300 | { | |
301 | int x = e820.nr_map; | |
302 | ||
303 | if (x == E820MAX) { | |
304 | printk(KERN_ERR "Ooops! Too many entries in the memory map!\n"); | |
305 | return; | |
306 | } | |
307 | ||
308 | e820.map[x].addr = start; | |
309 | e820.map[x].size = size; | |
310 | e820.map[x].type = type; | |
311 | e820.nr_map++; | |
312 | } | |
313 | ||
314 | void __init e820_print_map(char *who) | |
315 | { | |
316 | int i; | |
317 | ||
318 | for (i = 0; i < e820.nr_map; i++) { | |
319 | printk(" %s: %016Lx - %016Lx ", who, | |
320 | (unsigned long long) e820.map[i].addr, | |
321 | (unsigned long long) (e820.map[i].addr + e820.map[i].size)); | |
322 | switch (e820.map[i].type) { | |
323 | case E820_RAM: printk("(usable)\n"); | |
324 | break; | |
325 | case E820_RESERVED: | |
326 | printk("(reserved)\n"); | |
327 | break; | |
328 | case E820_ACPI: | |
329 | printk("(ACPI data)\n"); | |
330 | break; | |
331 | case E820_NVS: | |
332 | printk("(ACPI NVS)\n"); | |
333 | break; | |
334 | default: printk("type %u\n", e820.map[i].type); | |
335 | break; | |
336 | } | |
337 | } | |
338 | } | |
339 | ||
340 | /* | |
341 | * Sanitize the BIOS e820 map. | |
342 | * | |
343 | * Some e820 responses include overlapping entries. The following | |
344 | * replaces the original e820 map with a new one, removing overlaps. | |
345 | * | |
346 | */ | |
347 | static int __init sanitize_e820_map(struct e820entry * biosmap, char * pnr_map) | |
348 | { | |
349 | struct change_member { | |
350 | struct e820entry *pbios; /* pointer to original bios entry */ | |
351 | unsigned long long addr; /* address for this change point */ | |
352 | }; | |
353 | static struct change_member change_point_list[2*E820MAX] __initdata; | |
354 | static struct change_member *change_point[2*E820MAX] __initdata; | |
355 | static struct e820entry *overlap_list[E820MAX] __initdata; | |
356 | static struct e820entry new_bios[E820MAX] __initdata; | |
357 | struct change_member *change_tmp; | |
358 | unsigned long current_type, last_type; | |
359 | unsigned long long last_addr; | |
360 | int chgidx, still_changing; | |
361 | int overlap_entries; | |
362 | int new_bios_entry; | |
8059b2a2 | 363 | int old_nr, new_nr, chg_nr; |
1da177e4 LT |
364 | int i; |
365 | ||
366 | /* | |
367 | Visually we're performing the following (1,2,3,4 = memory types)... | |
368 | ||
369 | Sample memory map (w/overlaps): | |
370 | ____22__________________ | |
371 | ______________________4_ | |
372 | ____1111________________ | |
373 | _44_____________________ | |
374 | 11111111________________ | |
375 | ____________________33__ | |
376 | ___________44___________ | |
377 | __________33333_________ | |
378 | ______________22________ | |
379 | ___________________2222_ | |
380 | _________111111111______ | |
381 | _____________________11_ | |
382 | _________________4______ | |
383 | ||
384 | Sanitized equivalent (no overlap): | |
385 | 1_______________________ | |
386 | _44_____________________ | |
387 | ___1____________________ | |
388 | ____22__________________ | |
389 | ______11________________ | |
390 | _________1______________ | |
391 | __________3_____________ | |
392 | ___________44___________ | |
393 | _____________33_________ | |
394 | _______________2________ | |
395 | ________________1_______ | |
396 | _________________4______ | |
397 | ___________________2____ | |
398 | ____________________33__ | |
399 | ______________________4_ | |
400 | */ | |
401 | ||
402 | /* if there's only one memory region, don't bother */ | |
403 | if (*pnr_map < 2) | |
404 | return -1; | |
405 | ||
406 | old_nr = *pnr_map; | |
407 | ||
408 | /* bail out if we find any unreasonable addresses in bios map */ | |
409 | for (i=0; i<old_nr; i++) | |
410 | if (biosmap[i].addr + biosmap[i].size < biosmap[i].addr) | |
411 | return -1; | |
412 | ||
413 | /* create pointers for initial change-point information (for sorting) */ | |
414 | for (i=0; i < 2*old_nr; i++) | |
415 | change_point[i] = &change_point_list[i]; | |
416 | ||
8059b2a2 VP |
417 | /* record all known change-points (starting and ending addresses), |
418 | omitting those that are for empty memory regions */ | |
1da177e4 LT |
419 | chgidx = 0; |
420 | for (i=0; i < old_nr; i++) { | |
8059b2a2 VP |
421 | if (biosmap[i].size != 0) { |
422 | change_point[chgidx]->addr = biosmap[i].addr; | |
423 | change_point[chgidx++]->pbios = &biosmap[i]; | |
424 | change_point[chgidx]->addr = biosmap[i].addr + biosmap[i].size; | |
425 | change_point[chgidx++]->pbios = &biosmap[i]; | |
426 | } | |
1da177e4 | 427 | } |
8059b2a2 | 428 | chg_nr = chgidx; |
1da177e4 LT |
429 | |
430 | /* sort change-point list by memory addresses (low -> high) */ | |
431 | still_changing = 1; | |
432 | while (still_changing) { | |
433 | still_changing = 0; | |
8059b2a2 | 434 | for (i=1; i < chg_nr; i++) { |
1da177e4 LT |
435 | /* if <current_addr> > <last_addr>, swap */ |
436 | /* or, if current=<start_addr> & last=<end_addr>, swap */ | |
437 | if ((change_point[i]->addr < change_point[i-1]->addr) || | |
438 | ((change_point[i]->addr == change_point[i-1]->addr) && | |
439 | (change_point[i]->addr == change_point[i]->pbios->addr) && | |
440 | (change_point[i-1]->addr != change_point[i-1]->pbios->addr)) | |
441 | ) | |
442 | { | |
443 | change_tmp = change_point[i]; | |
444 | change_point[i] = change_point[i-1]; | |
445 | change_point[i-1] = change_tmp; | |
446 | still_changing=1; | |
447 | } | |
448 | } | |
449 | } | |
450 | ||
451 | /* create a new bios memory map, removing overlaps */ | |
452 | overlap_entries=0; /* number of entries in the overlap table */ | |
453 | new_bios_entry=0; /* index for creating new bios map entries */ | |
454 | last_type = 0; /* start with undefined memory type */ | |
455 | last_addr = 0; /* start with 0 as last starting address */ | |
456 | /* loop through change-points, determining affect on the new bios map */ | |
8059b2a2 | 457 | for (chgidx=0; chgidx < chg_nr; chgidx++) |
1da177e4 LT |
458 | { |
459 | /* keep track of all overlapping bios entries */ | |
460 | if (change_point[chgidx]->addr == change_point[chgidx]->pbios->addr) | |
461 | { | |
462 | /* add map entry to overlap list (> 1 entry implies an overlap) */ | |
463 | overlap_list[overlap_entries++]=change_point[chgidx]->pbios; | |
464 | } | |
465 | else | |
466 | { | |
467 | /* remove entry from list (order independent, so swap with last) */ | |
468 | for (i=0; i<overlap_entries; i++) | |
469 | { | |
470 | if (overlap_list[i] == change_point[chgidx]->pbios) | |
471 | overlap_list[i] = overlap_list[overlap_entries-1]; | |
472 | } | |
473 | overlap_entries--; | |
474 | } | |
475 | /* if there are overlapping entries, decide which "type" to use */ | |
476 | /* (larger value takes precedence -- 1=usable, 2,3,4,4+=unusable) */ | |
477 | current_type = 0; | |
478 | for (i=0; i<overlap_entries; i++) | |
479 | if (overlap_list[i]->type > current_type) | |
480 | current_type = overlap_list[i]->type; | |
481 | /* continue building up new bios map based on this information */ | |
482 | if (current_type != last_type) { | |
483 | if (last_type != 0) { | |
484 | new_bios[new_bios_entry].size = | |
485 | change_point[chgidx]->addr - last_addr; | |
486 | /* move forward only if the new size was non-zero */ | |
487 | if (new_bios[new_bios_entry].size != 0) | |
488 | if (++new_bios_entry >= E820MAX) | |
489 | break; /* no more space left for new bios entries */ | |
490 | } | |
491 | if (current_type != 0) { | |
492 | new_bios[new_bios_entry].addr = change_point[chgidx]->addr; | |
493 | new_bios[new_bios_entry].type = current_type; | |
494 | last_addr=change_point[chgidx]->addr; | |
495 | } | |
496 | last_type = current_type; | |
497 | } | |
498 | } | |
499 | new_nr = new_bios_entry; /* retain count for new bios entries */ | |
500 | ||
501 | /* copy new bios mapping into original location */ | |
502 | memcpy(biosmap, new_bios, new_nr*sizeof(struct e820entry)); | |
503 | *pnr_map = new_nr; | |
504 | ||
505 | return 0; | |
506 | } | |
507 | ||
508 | /* | |
509 | * Copy the BIOS e820 map into a safe place. | |
510 | * | |
511 | * Sanity-check it while we're at it.. | |
512 | * | |
513 | * If we're lucky and live on a modern system, the setup code | |
514 | * will have given us a memory map that we can use to properly | |
515 | * set up memory. If we aren't, we'll fake a memory map. | |
516 | * | |
517 | * We check to see that the memory map contains at least 2 elements | |
518 | * before we'll use it, because the detection code in setup.S may | |
519 | * not be perfect and most every PC known to man has two memory | |
520 | * regions: one from 0 to 640k, and one from 1mb up. (The IBM | |
521 | * thinkpad 560x, for example, does not cooperate with the memory | |
522 | * detection code.) | |
523 | */ | |
524 | static int __init copy_e820_map(struct e820entry * biosmap, int nr_map) | |
525 | { | |
526 | /* Only one memory region (or negative)? Ignore it */ | |
527 | if (nr_map < 2) | |
528 | return -1; | |
529 | ||
530 | do { | |
531 | unsigned long start = biosmap->addr; | |
532 | unsigned long size = biosmap->size; | |
533 | unsigned long end = start + size; | |
534 | unsigned long type = biosmap->type; | |
535 | ||
536 | /* Overflow in 64 bits? Ignore the memory map. */ | |
537 | if (start > end) | |
538 | return -1; | |
539 | ||
540 | /* | |
541 | * Some BIOSes claim RAM in the 640k - 1M region. | |
542 | * Not right. Fix it up. | |
543 | * | |
544 | * This should be removed on Hammer which is supposed to not | |
545 | * have non e820 covered ISA mappings there, but I had some strange | |
546 | * problems so it stays for now. -AK | |
547 | */ | |
548 | if (type == E820_RAM) { | |
549 | if (start < 0x100000ULL && end > 0xA0000ULL) { | |
550 | if (start < 0xA0000ULL) | |
551 | add_memory_region(start, 0xA0000ULL-start, type); | |
552 | if (end <= 0x100000ULL) | |
553 | continue; | |
554 | start = 0x100000ULL; | |
555 | size = end - start; | |
556 | } | |
557 | } | |
558 | ||
559 | add_memory_region(start, size, type); | |
560 | } while (biosmap++,--nr_map); | |
561 | return 0; | |
562 | } | |
563 | ||
564 | void __init setup_memory_region(void) | |
565 | { | |
566 | char *who = "BIOS-e820"; | |
567 | ||
568 | /* | |
569 | * Try to copy the BIOS-supplied E820-map. | |
570 | * | |
571 | * Otherwise fake a memory map; one section from 0k->640k, | |
572 | * the next section from 1mb->appropriate_mem_k | |
573 | */ | |
574 | sanitize_e820_map(E820_MAP, &E820_MAP_NR); | |
575 | if (copy_e820_map(E820_MAP, E820_MAP_NR) < 0) { | |
576 | unsigned long mem_size; | |
577 | ||
578 | /* compare results from other methods and take the greater */ | |
579 | if (ALT_MEM_K < EXT_MEM_K) { | |
580 | mem_size = EXT_MEM_K; | |
581 | who = "BIOS-88"; | |
582 | } else { | |
583 | mem_size = ALT_MEM_K; | |
584 | who = "BIOS-e801"; | |
585 | } | |
586 | ||
587 | e820.nr_map = 0; | |
588 | add_memory_region(0, LOWMEMSIZE(), E820_RAM); | |
589 | add_memory_region(HIGH_MEMORY, mem_size << 10, E820_RAM); | |
590 | } | |
591 | printk(KERN_INFO "BIOS-provided physical RAM map:\n"); | |
592 | e820_print_map(who); | |
593 | } | |
594 | ||
595 | void __init parse_memopt(char *p, char **from) | |
596 | { | |
597 | end_user_pfn = memparse(p, from); | |
598 | end_user_pfn >>= PAGE_SHIFT; | |
599 | } | |
600 | ||
69cda7b1 | 601 | void __init parse_memmapopt(char *p, char **from) |
602 | { | |
603 | unsigned long long start_at, mem_size; | |
604 | ||
605 | mem_size = memparse(p, from); | |
606 | p = *from; | |
607 | if (*p == '@') { | |
608 | start_at = memparse(p+1, from); | |
609 | add_memory_region(start_at, mem_size, E820_RAM); | |
610 | } else if (*p == '#') { | |
611 | start_at = memparse(p+1, from); | |
612 | add_memory_region(start_at, mem_size, E820_ACPI); | |
613 | } else if (*p == '$') { | |
614 | start_at = memparse(p+1, from); | |
615 | add_memory_region(start_at, mem_size, E820_RESERVED); | |
616 | } else { | |
617 | end_user_pfn = (mem_size >> PAGE_SHIFT); | |
618 | } | |
619 | p = *from; | |
620 | } | |
621 | ||
a1e97782 AK |
622 | unsigned long pci_mem_start = 0xaeedbabe; |
623 | ||
624 | /* | |
625 | * Search for the biggest gap in the low 32 bits of the e820 | |
626 | * memory space. We pass this space to PCI to assign MMIO resources | |
627 | * for hotplug or unconfigured devices in. | |
628 | * Hopefully the BIOS let enough space left. | |
629 | */ | |
630 | __init void e820_setup_gap(void) | |
631 | { | |
f0eca962 | 632 | unsigned long gapstart, gapsize, round; |
a1e97782 AK |
633 | unsigned long last; |
634 | int i; | |
635 | int found = 0; | |
636 | ||
637 | last = 0x100000000ull; | |
638 | gapstart = 0x10000000; | |
639 | gapsize = 0x400000; | |
640 | i = e820.nr_map; | |
641 | while (--i >= 0) { | |
642 | unsigned long long start = e820.map[i].addr; | |
643 | unsigned long long end = start + e820.map[i].size; | |
644 | ||
645 | /* | |
646 | * Since "last" is at most 4GB, we know we'll | |
647 | * fit in 32 bits if this condition is true | |
648 | */ | |
649 | if (last > end) { | |
650 | unsigned long gap = last - end; | |
651 | ||
652 | if (gap > gapsize) { | |
653 | gapsize = gap; | |
654 | gapstart = end; | |
655 | found = 1; | |
656 | } | |
657 | } | |
658 | if (start < last) | |
659 | last = start; | |
660 | } | |
661 | ||
662 | if (!found) { | |
663 | gapstart = (end_pfn << PAGE_SHIFT) + 1024*1024; | |
664 | printk(KERN_ERR "PCI: Warning: Cannot find a gap in the 32bit address range\n" | |
665 | KERN_ERR "PCI: Unassigned devices with 32bit resource registers may break!\n"); | |
666 | } | |
667 | ||
668 | /* | |
f0eca962 DR |
669 | * See how much we want to round up: start off with |
670 | * rounding to the next 1MB area. | |
a1e97782 | 671 | */ |
f0eca962 DR |
672 | round = 0x100000; |
673 | while ((gapsize >> 4) > round) | |
674 | round += round; | |
675 | /* Fun with two's complement */ | |
676 | pci_mem_start = (gapstart + round) & -round; | |
a1e97782 AK |
677 | |
678 | printk(KERN_INFO "Allocating PCI resources starting at %lx (gap: %lx:%lx)\n", | |
679 | pci_mem_start, gapstart, gapsize); | |
680 | } |