e820.c 29 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153
  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/crash_dump.h>
  15. #include <linux/export.h>
  16. #include <linux/bootmem.h>
  17. #include <linux/pfn.h>
  18. #include <linux/suspend.h>
  19. #include <linux/acpi.h>
  20. #include <linux/firmware-map.h>
  21. #include <linux/memblock.h>
  22. #include <linux/sort.h>
  23. #include <asm/e820.h>
  24. #include <asm/proto.h>
  25. #include <asm/setup.h>
  26. #include <asm/cpufeature.h>
  27. /*
  28. * The e820 map is the map that gets modified e.g. with command line parameters
  29. * and that is also registered with modifications in the kernel resource tree
  30. * with the iomem_resource as parent.
  31. *
  32. * The e820_saved is directly saved after the BIOS-provided memory map is
  33. * copied. It doesn't get modified afterwards. It's registered for the
  34. * /sys/firmware/memmap interface.
  35. *
  36. * That memory map is not modified and is used as base for kexec. The kexec'd
  37. * kernel should get the same memory map as the firmware provides. Then the
  38. * user can e.g. boot the original kernel with mem=1G while still booting the
  39. * next kernel with full memory.
  40. */
  41. struct e820map e820;
  42. struct e820map e820_saved;
  43. /* For PCI or other memory-mapped resources */
  44. unsigned long pci_mem_start = 0xaeedbabe;
  45. #ifdef CONFIG_PCI
  46. EXPORT_SYMBOL(pci_mem_start);
  47. #endif
  48. /*
  49. * This function checks if any part of the range <start,end> is mapped
  50. * with type.
  51. */
  52. int
  53. e820_any_mapped(u64 start, u64 end, unsigned type)
  54. {
  55. int i;
  56. for (i = 0; i < e820.nr_map; i++) {
  57. struct e820entry *ei = &e820.map[i];
  58. if (type && ei->type != type)
  59. continue;
  60. if (ei->addr >= end || ei->addr + ei->size <= start)
  61. continue;
  62. return 1;
  63. }
  64. return 0;
  65. }
  66. EXPORT_SYMBOL_GPL(e820_any_mapped);
  67. /*
  68. * This function checks if the entire range <start,end> is mapped with type.
  69. *
  70. * Note: this function only works correct if the e820 table is sorted and
  71. * not-overlapping, which is the case
  72. */
  73. int __init e820_all_mapped(u64 start, u64 end, unsigned type)
  74. {
  75. int i;
  76. for (i = 0; i < e820.nr_map; i++) {
  77. struct e820entry *ei = &e820.map[i];
  78. if (type && ei->type != type)
  79. continue;
  80. /* is the region (part) in overlap with the current region ?*/
  81. if (ei->addr >= end || ei->addr + ei->size <= start)
  82. continue;
  83. /* if the region is at the beginning of <start,end> we move
  84. * start to the end of the region since it's ok until there
  85. */
  86. if (ei->addr <= start)
  87. start = ei->addr + ei->size;
  88. /*
  89. * if start is now at or beyond end, we're done, full
  90. * coverage
  91. */
  92. if (start >= end)
  93. return 1;
  94. }
  95. return 0;
  96. }
  97. /*
  98. * Add a memory region to the kernel e820 map.
  99. */
  100. static void __init __e820_add_region(struct e820map *e820x, u64 start, u64 size,
  101. int type)
  102. {
  103. int x = e820x->nr_map;
  104. if (x >= ARRAY_SIZE(e820x->map)) {
  105. printk(KERN_ERR "e820: too many entries; ignoring [mem %#010llx-%#010llx]\n",
  106. (unsigned long long) start,
  107. (unsigned long long) (start + size - 1));
  108. return;
  109. }
  110. e820x->map[x].addr = start;
  111. e820x->map[x].size = size;
  112. e820x->map[x].type = type;
  113. e820x->nr_map++;
  114. }
  115. void __init e820_add_region(u64 start, u64 size, int type)
  116. {
  117. __e820_add_region(&e820, start, size, type);
  118. }
  119. static void __init e820_print_type(u32 type)
  120. {
  121. switch (type) {
  122. case E820_RAM:
  123. case E820_RESERVED_KERN:
  124. printk(KERN_CONT "usable");
  125. break;
  126. case E820_RESERVED:
  127. printk(KERN_CONT "reserved");
  128. break;
  129. case E820_ACPI:
  130. printk(KERN_CONT "ACPI data");
  131. break;
  132. case E820_NVS:
  133. printk(KERN_CONT "ACPI NVS");
  134. break;
  135. case E820_UNUSABLE:
  136. printk(KERN_CONT "unusable");
  137. break;
  138. case E820_PMEM:
  139. case E820_PRAM:
  140. printk(KERN_CONT "persistent (type %u)", type);
  141. break;
  142. default:
  143. printk(KERN_CONT "type %u", type);
  144. break;
  145. }
  146. }
  147. void __init e820_print_map(char *who)
  148. {
  149. int i;
  150. for (i = 0; i < e820.nr_map; i++) {
  151. printk(KERN_INFO "%s: [mem %#018Lx-%#018Lx] ", who,
  152. (unsigned long long) e820.map[i].addr,
  153. (unsigned long long)
  154. (e820.map[i].addr + e820.map[i].size - 1));
  155. e820_print_type(e820.map[i].type);
  156. printk(KERN_CONT "\n");
  157. }
  158. }
  159. /*
  160. * Sanitize the BIOS e820 map.
  161. *
  162. * Some e820 responses include overlapping entries. The following
  163. * replaces the original e820 map with a new one, removing overlaps,
  164. * and resolving conflicting memory types in favor of highest
  165. * numbered type.
  166. *
  167. * The input parameter biosmap points to an array of 'struct
  168. * e820entry' which on entry has elements in the range [0, *pnr_map)
  169. * valid, and which has space for up to max_nr_map entries.
  170. * On return, the resulting sanitized e820 map entries will be in
  171. * overwritten in the same location, starting at biosmap.
  172. *
  173. * The integer pointed to by pnr_map must be valid on entry (the
  174. * current number of valid entries located at biosmap). If the
  175. * sanitizing succeeds the *pnr_map will be updated with the new
  176. * number of valid entries (something no more than max_nr_map).
  177. *
  178. * The return value from sanitize_e820_map() is zero if it
  179. * successfully 'sanitized' the map entries passed in, and is -1
  180. * if it did nothing, which can happen if either of (1) it was
  181. * only passed one map entry, or (2) any of the input map entries
  182. * were invalid (start + size < start, meaning that the size was
  183. * so big the described memory range wrapped around through zero.)
  184. *
  185. * Visually we're performing the following
  186. * (1,2,3,4 = memory types)...
  187. *
  188. * Sample memory map (w/overlaps):
  189. * ____22__________________
  190. * ______________________4_
  191. * ____1111________________
  192. * _44_____________________
  193. * 11111111________________
  194. * ____________________33__
  195. * ___________44___________
  196. * __________33333_________
  197. * ______________22________
  198. * ___________________2222_
  199. * _________111111111______
  200. * _____________________11_
  201. * _________________4______
  202. *
  203. * Sanitized equivalent (no overlap):
  204. * 1_______________________
  205. * _44_____________________
  206. * ___1____________________
  207. * ____22__________________
  208. * ______11________________
  209. * _________1______________
  210. * __________3_____________
  211. * ___________44___________
  212. * _____________33_________
  213. * _______________2________
  214. * ________________1_______
  215. * _________________4______
  216. * ___________________2____
  217. * ____________________33__
  218. * ______________________4_
  219. */
  220. struct change_member {
  221. struct e820entry *pbios; /* pointer to original bios entry */
  222. unsigned long long addr; /* address for this change point */
  223. };
  224. static int __init cpcompare(const void *a, const void *b)
  225. {
  226. struct change_member * const *app = a, * const *bpp = b;
  227. const struct change_member *ap = *app, *bp = *bpp;
  228. /*
  229. * Inputs are pointers to two elements of change_point[]. If their
  230. * addresses are unequal, their difference dominates. If the addresses
  231. * are equal, then consider one that represents the end of its region
  232. * to be greater than one that does not.
  233. */
  234. if (ap->addr != bp->addr)
  235. return ap->addr > bp->addr ? 1 : -1;
  236. return (ap->addr != ap->pbios->addr) - (bp->addr != bp->pbios->addr);
  237. }
  238. int __init sanitize_e820_map(struct e820entry *biosmap, int max_nr_map,
  239. u32 *pnr_map)
  240. {
  241. static struct change_member change_point_list[2*E820_X_MAX] __initdata;
  242. static struct change_member *change_point[2*E820_X_MAX] __initdata;
  243. static struct e820entry *overlap_list[E820_X_MAX] __initdata;
  244. static struct e820entry new_bios[E820_X_MAX] __initdata;
  245. unsigned long current_type, last_type;
  246. unsigned long long last_addr;
  247. int chgidx;
  248. int overlap_entries;
  249. int new_bios_entry;
  250. int old_nr, new_nr, chg_nr;
  251. int i;
  252. /* if there's only one memory region, don't bother */
  253. if (*pnr_map < 2)
  254. return -1;
  255. old_nr = *pnr_map;
  256. BUG_ON(old_nr > max_nr_map);
  257. /* bail out if we find any unreasonable addresses in bios map */
  258. for (i = 0; i < old_nr; i++)
  259. if (biosmap[i].addr + biosmap[i].size < biosmap[i].addr)
  260. return -1;
  261. /* create pointers for initial change-point information (for sorting) */
  262. for (i = 0; i < 2 * old_nr; i++)
  263. change_point[i] = &change_point_list[i];
  264. /* record all known change-points (starting and ending addresses),
  265. omitting those that are for empty memory regions */
  266. chgidx = 0;
  267. for (i = 0; i < old_nr; i++) {
  268. if (biosmap[i].size != 0) {
  269. change_point[chgidx]->addr = biosmap[i].addr;
  270. change_point[chgidx++]->pbios = &biosmap[i];
  271. change_point[chgidx]->addr = biosmap[i].addr +
  272. biosmap[i].size;
  273. change_point[chgidx++]->pbios = &biosmap[i];
  274. }
  275. }
  276. chg_nr = chgidx;
  277. /* sort change-point list by memory addresses (low -> high) */
  278. sort(change_point, chg_nr, sizeof *change_point, cpcompare, NULL);
  279. /* create a new bios memory map, removing overlaps */
  280. overlap_entries = 0; /* number of entries in the overlap table */
  281. new_bios_entry = 0; /* index for creating new bios map entries */
  282. last_type = 0; /* start with undefined memory type */
  283. last_addr = 0; /* start with 0 as last starting address */
  284. /* loop through change-points, determining affect on the new bios map */
  285. for (chgidx = 0; chgidx < chg_nr; chgidx++) {
  286. /* keep track of all overlapping bios entries */
  287. if (change_point[chgidx]->addr ==
  288. change_point[chgidx]->pbios->addr) {
  289. /*
  290. * add map entry to overlap list (> 1 entry
  291. * implies an overlap)
  292. */
  293. overlap_list[overlap_entries++] =
  294. change_point[chgidx]->pbios;
  295. } else {
  296. /*
  297. * remove entry from list (order independent,
  298. * so swap with last)
  299. */
  300. for (i = 0; i < overlap_entries; i++) {
  301. if (overlap_list[i] ==
  302. change_point[chgidx]->pbios)
  303. overlap_list[i] =
  304. overlap_list[overlap_entries-1];
  305. }
  306. overlap_entries--;
  307. }
  308. /*
  309. * if there are overlapping entries, decide which
  310. * "type" to use (larger value takes precedence --
  311. * 1=usable, 2,3,4,4+=unusable)
  312. */
  313. current_type = 0;
  314. for (i = 0; i < overlap_entries; i++)
  315. if (overlap_list[i]->type > current_type)
  316. current_type = overlap_list[i]->type;
  317. /*
  318. * continue building up new bios map based on this
  319. * information
  320. */
  321. if (current_type != last_type || current_type == E820_PRAM) {
  322. if (last_type != 0) {
  323. new_bios[new_bios_entry].size =
  324. change_point[chgidx]->addr - last_addr;
  325. /*
  326. * move forward only if the new size
  327. * was non-zero
  328. */
  329. if (new_bios[new_bios_entry].size != 0)
  330. /*
  331. * no more space left for new
  332. * bios entries ?
  333. */
  334. if (++new_bios_entry >= max_nr_map)
  335. break;
  336. }
  337. if (current_type != 0) {
  338. new_bios[new_bios_entry].addr =
  339. change_point[chgidx]->addr;
  340. new_bios[new_bios_entry].type = current_type;
  341. last_addr = change_point[chgidx]->addr;
  342. }
  343. last_type = current_type;
  344. }
  345. }
  346. /* retain count for new bios entries */
  347. new_nr = new_bios_entry;
  348. /* copy new bios mapping into original location */
  349. memcpy(biosmap, new_bios, new_nr * sizeof(struct e820entry));
  350. *pnr_map = new_nr;
  351. return 0;
  352. }
  353. static int __init __append_e820_map(struct e820entry *biosmap, int nr_map)
  354. {
  355. while (nr_map) {
  356. u64 start = biosmap->addr;
  357. u64 size = biosmap->size;
  358. u64 end = start + size;
  359. u32 type = biosmap->type;
  360. /* Overflow in 64 bits? Ignore the memory map. */
  361. if (start > end)
  362. return -1;
  363. e820_add_region(start, size, type);
  364. biosmap++;
  365. nr_map--;
  366. }
  367. return 0;
  368. }
  369. /*
  370. * Copy the BIOS e820 map into a safe place.
  371. *
  372. * Sanity-check it while we're at it..
  373. *
  374. * If we're lucky and live on a modern system, the setup code
  375. * will have given us a memory map that we can use to properly
  376. * set up memory. If we aren't, we'll fake a memory map.
  377. */
  378. static int __init append_e820_map(struct e820entry *biosmap, int nr_map)
  379. {
  380. /* Only one memory region (or negative)? Ignore it */
  381. if (nr_map < 2)
  382. return -1;
  383. return __append_e820_map(biosmap, nr_map);
  384. }
  385. static u64 __init __e820_update_range(struct e820map *e820x, u64 start,
  386. u64 size, unsigned old_type,
  387. unsigned new_type)
  388. {
  389. u64 end;
  390. unsigned int i;
  391. u64 real_updated_size = 0;
  392. BUG_ON(old_type == new_type);
  393. if (size > (ULLONG_MAX - start))
  394. size = ULLONG_MAX - start;
  395. end = start + size;
  396. printk(KERN_DEBUG "e820: update [mem %#010Lx-%#010Lx] ",
  397. (unsigned long long) start, (unsigned long long) (end - 1));
  398. e820_print_type(old_type);
  399. printk(KERN_CONT " ==> ");
  400. e820_print_type(new_type);
  401. printk(KERN_CONT "\n");
  402. for (i = 0; i < e820x->nr_map; i++) {
  403. struct e820entry *ei = &e820x->map[i];
  404. u64 final_start, final_end;
  405. u64 ei_end;
  406. if (ei->type != old_type)
  407. continue;
  408. ei_end = ei->addr + ei->size;
  409. /* totally covered by new range? */
  410. if (ei->addr >= start && ei_end <= end) {
  411. ei->type = new_type;
  412. real_updated_size += ei->size;
  413. continue;
  414. }
  415. /* new range is totally covered? */
  416. if (ei->addr < start && ei_end > end) {
  417. __e820_add_region(e820x, start, size, new_type);
  418. __e820_add_region(e820x, end, ei_end - end, ei->type);
  419. ei->size = start - ei->addr;
  420. real_updated_size += size;
  421. continue;
  422. }
  423. /* partially covered */
  424. final_start = max(start, ei->addr);
  425. final_end = min(end, ei_end);
  426. if (final_start >= final_end)
  427. continue;
  428. __e820_add_region(e820x, final_start, final_end - final_start,
  429. new_type);
  430. real_updated_size += final_end - final_start;
  431. /*
  432. * left range could be head or tail, so need to update
  433. * size at first.
  434. */
  435. ei->size -= final_end - final_start;
  436. if (ei->addr < final_start)
  437. continue;
  438. ei->addr = final_end;
  439. }
  440. return real_updated_size;
  441. }
  442. u64 __init e820_update_range(u64 start, u64 size, unsigned old_type,
  443. unsigned new_type)
  444. {
  445. return __e820_update_range(&e820, start, size, old_type, new_type);
  446. }
  447. static u64 __init e820_update_range_saved(u64 start, u64 size,
  448. unsigned old_type, unsigned new_type)
  449. {
  450. return __e820_update_range(&e820_saved, start, size, old_type,
  451. new_type);
  452. }
  453. /* make e820 not cover the range */
  454. u64 __init e820_remove_range(u64 start, u64 size, unsigned old_type,
  455. int checktype)
  456. {
  457. int i;
  458. u64 end;
  459. u64 real_removed_size = 0;
  460. if (size > (ULLONG_MAX - start))
  461. size = ULLONG_MAX - start;
  462. end = start + size;
  463. printk(KERN_DEBUG "e820: remove [mem %#010Lx-%#010Lx] ",
  464. (unsigned long long) start, (unsigned long long) (end - 1));
  465. if (checktype)
  466. e820_print_type(old_type);
  467. printk(KERN_CONT "\n");
  468. for (i = 0; i < e820.nr_map; i++) {
  469. struct e820entry *ei = &e820.map[i];
  470. u64 final_start, final_end;
  471. u64 ei_end;
  472. if (checktype && ei->type != old_type)
  473. continue;
  474. ei_end = ei->addr + ei->size;
  475. /* totally covered? */
  476. if (ei->addr >= start && ei_end <= end) {
  477. real_removed_size += ei->size;
  478. memset(ei, 0, sizeof(struct e820entry));
  479. continue;
  480. }
  481. /* new range is totally covered? */
  482. if (ei->addr < start && ei_end > end) {
  483. e820_add_region(end, ei_end - end, ei->type);
  484. ei->size = start - ei->addr;
  485. real_removed_size += size;
  486. continue;
  487. }
  488. /* partially covered */
  489. final_start = max(start, ei->addr);
  490. final_end = min(end, ei_end);
  491. if (final_start >= final_end)
  492. continue;
  493. real_removed_size += final_end - final_start;
  494. /*
  495. * left range could be head or tail, so need to update
  496. * size at first.
  497. */
  498. ei->size -= final_end - final_start;
  499. if (ei->addr < final_start)
  500. continue;
  501. ei->addr = final_end;
  502. }
  503. return real_removed_size;
  504. }
  505. void __init update_e820(void)
  506. {
  507. if (sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &e820.nr_map))
  508. return;
  509. printk(KERN_INFO "e820: modified physical RAM map:\n");
  510. e820_print_map("modified");
  511. }
  512. static void __init update_e820_saved(void)
  513. {
  514. sanitize_e820_map(e820_saved.map, ARRAY_SIZE(e820_saved.map),
  515. &e820_saved.nr_map);
  516. }
  517. #define MAX_GAP_END 0x100000000ull
  518. /*
  519. * Search for a gap in the e820 memory space from start_addr to end_addr.
  520. */
  521. __init int e820_search_gap(unsigned long *gapstart, unsigned long *gapsize,
  522. unsigned long start_addr, unsigned long long end_addr)
  523. {
  524. unsigned long long last;
  525. int i = e820.nr_map;
  526. int found = 0;
  527. last = (end_addr && end_addr < MAX_GAP_END) ? end_addr : MAX_GAP_END;
  528. while (--i >= 0) {
  529. unsigned long long start = e820.map[i].addr;
  530. unsigned long long end = start + e820.map[i].size;
  531. if (end < start_addr)
  532. continue;
  533. /*
  534. * Since "last" is at most 4GB, we know we'll
  535. * fit in 32 bits if this condition is true
  536. */
  537. if (last > end) {
  538. unsigned long gap = last - end;
  539. if (gap >= *gapsize) {
  540. *gapsize = gap;
  541. *gapstart = end;
  542. found = 1;
  543. }
  544. }
  545. if (start < last)
  546. last = start;
  547. }
  548. return found;
  549. }
  550. /*
  551. * Search for the biggest gap in the low 32 bits of the e820
  552. * memory space. We pass this space to PCI to assign MMIO resources
  553. * for hotplug or unconfigured devices in.
  554. * Hopefully the BIOS let enough space left.
  555. */
  556. __init void e820_setup_gap(void)
  557. {
  558. unsigned long gapstart, gapsize;
  559. int found;
  560. gapstart = 0x10000000;
  561. gapsize = 0x400000;
  562. found = e820_search_gap(&gapstart, &gapsize, 0, MAX_GAP_END);
  563. #ifdef CONFIG_X86_64
  564. if (!found) {
  565. gapstart = (max_pfn << PAGE_SHIFT) + 1024*1024;
  566. printk(KERN_ERR
  567. "e820: cannot find a gap in the 32bit address range\n"
  568. "e820: PCI devices with unassigned 32bit BARs may break!\n");
  569. }
  570. #endif
  571. /*
  572. * e820_reserve_resources_late protect stolen RAM already
  573. */
  574. pci_mem_start = gapstart;
  575. printk(KERN_INFO
  576. "e820: [mem %#010lx-%#010lx] available for PCI devices\n",
  577. gapstart, gapstart + gapsize - 1);
  578. }
  579. /**
  580. * Because of the size limitation of struct boot_params, only first
  581. * 128 E820 memory entries are passed to kernel via
  582. * boot_params.e820_map, others are passed via SETUP_E820_EXT node of
  583. * linked list of struct setup_data, which is parsed here.
  584. */
  585. void __init parse_e820_ext(u64 phys_addr, u32 data_len)
  586. {
  587. int entries;
  588. struct e820entry *extmap;
  589. struct setup_data *sdata;
  590. sdata = early_memremap(phys_addr, data_len);
  591. entries = sdata->len / sizeof(struct e820entry);
  592. extmap = (struct e820entry *)(sdata->data);
  593. __append_e820_map(extmap, entries);
  594. sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map), &e820.nr_map);
  595. early_memunmap(sdata, data_len);
  596. printk(KERN_INFO "e820: extended physical RAM map:\n");
  597. e820_print_map("extended");
  598. }
  599. #if defined(CONFIG_X86_64) || \
  600. (defined(CONFIG_X86_32) && defined(CONFIG_HIBERNATION))
  601. /**
  602. * Find the ranges of physical addresses that do not correspond to
  603. * e820 RAM areas and mark the corresponding pages as nosave for
  604. * hibernation (32 bit) or software suspend and suspend to RAM (64 bit).
  605. *
  606. * This function requires the e820 map to be sorted and without any
  607. * overlapping entries.
  608. */
  609. void __init e820_mark_nosave_regions(unsigned long limit_pfn)
  610. {
  611. int i;
  612. unsigned long pfn = 0;
  613. for (i = 0; i < e820.nr_map; i++) {
  614. struct e820entry *ei = &e820.map[i];
  615. if (pfn < PFN_UP(ei->addr))
  616. register_nosave_region(pfn, PFN_UP(ei->addr));
  617. pfn = PFN_DOWN(ei->addr + ei->size);
  618. if (ei->type != E820_RAM && ei->type != E820_RESERVED_KERN)
  619. register_nosave_region(PFN_UP(ei->addr), pfn);
  620. if (pfn >= limit_pfn)
  621. break;
  622. }
  623. }
  624. #endif
  625. #ifdef CONFIG_ACPI
  626. /**
  627. * Mark ACPI NVS memory region, so that we can save/restore it during
  628. * hibernation and the subsequent resume.
  629. */
  630. static int __init e820_mark_nvs_memory(void)
  631. {
  632. int i;
  633. for (i = 0; i < e820.nr_map; i++) {
  634. struct e820entry *ei = &e820.map[i];
  635. if (ei->type == E820_NVS)
  636. acpi_nvs_register(ei->addr, ei->size);
  637. }
  638. return 0;
  639. }
  640. core_initcall(e820_mark_nvs_memory);
  641. #endif
  642. /*
  643. * pre allocated 4k and reserved it in memblock and e820_saved
  644. */
  645. u64 __init early_reserve_e820(u64 size, u64 align)
  646. {
  647. u64 addr;
  648. addr = __memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
  649. if (addr) {
  650. e820_update_range_saved(addr, size, E820_RAM, E820_RESERVED);
  651. printk(KERN_INFO "e820: update e820_saved for early_reserve_e820\n");
  652. update_e820_saved();
  653. }
  654. return addr;
  655. }
  656. #ifdef CONFIG_X86_32
  657. # ifdef CONFIG_X86_PAE
  658. # define MAX_ARCH_PFN (1ULL<<(36-PAGE_SHIFT))
  659. # else
  660. # define MAX_ARCH_PFN (1ULL<<(32-PAGE_SHIFT))
  661. # endif
  662. #else /* CONFIG_X86_32 */
  663. # define MAX_ARCH_PFN MAXMEM>>PAGE_SHIFT
  664. #endif
  665. /*
  666. * Find the highest page frame number we have available
  667. */
  668. static unsigned long __init e820_end_pfn(unsigned long limit_pfn, unsigned type)
  669. {
  670. int i;
  671. unsigned long last_pfn = 0;
  672. unsigned long max_arch_pfn = MAX_ARCH_PFN;
  673. for (i = 0; i < e820.nr_map; i++) {
  674. struct e820entry *ei = &e820.map[i];
  675. unsigned long start_pfn;
  676. unsigned long end_pfn;
  677. if (ei->type != type)
  678. continue;
  679. start_pfn = ei->addr >> PAGE_SHIFT;
  680. end_pfn = (ei->addr + ei->size) >> PAGE_SHIFT;
  681. if (start_pfn >= limit_pfn)
  682. continue;
  683. if (end_pfn > limit_pfn) {
  684. last_pfn = limit_pfn;
  685. break;
  686. }
  687. if (end_pfn > last_pfn)
  688. last_pfn = end_pfn;
  689. }
  690. if (last_pfn > max_arch_pfn)
  691. last_pfn = max_arch_pfn;
  692. printk(KERN_INFO "e820: last_pfn = %#lx max_arch_pfn = %#lx\n",
  693. last_pfn, max_arch_pfn);
  694. return last_pfn;
  695. }
  696. unsigned long __init e820_end_of_ram_pfn(void)
  697. {
  698. return e820_end_pfn(MAX_ARCH_PFN, E820_RAM);
  699. }
  700. unsigned long __init e820_end_of_low_ram_pfn(void)
  701. {
  702. return e820_end_pfn(1UL << (32 - PAGE_SHIFT), E820_RAM);
  703. }
  704. static void early_panic(char *msg)
  705. {
  706. early_printk(msg);
  707. panic(msg);
  708. }
  709. static int userdef __initdata;
  710. /* "mem=nopentium" disables the 4MB page tables. */
  711. static int __init parse_memopt(char *p)
  712. {
  713. u64 mem_size;
  714. if (!p)
  715. return -EINVAL;
  716. if (!strcmp(p, "nopentium")) {
  717. #ifdef CONFIG_X86_32
  718. setup_clear_cpu_cap(X86_FEATURE_PSE);
  719. return 0;
  720. #else
  721. printk(KERN_WARNING "mem=nopentium ignored! (only supported on x86_32)\n");
  722. return -EINVAL;
  723. #endif
  724. }
  725. userdef = 1;
  726. mem_size = memparse(p, &p);
  727. /* don't remove all of memory when handling "mem={invalid}" param */
  728. if (mem_size == 0)
  729. return -EINVAL;
  730. e820_remove_range(mem_size, ULLONG_MAX - mem_size, E820_RAM, 1);
  731. return 0;
  732. }
  733. early_param("mem", parse_memopt);
  734. static int __init parse_memmap_one(char *p)
  735. {
  736. char *oldp;
  737. u64 start_at, mem_size;
  738. if (!p)
  739. return -EINVAL;
  740. if (!strncmp(p, "exactmap", 8)) {
  741. #ifdef CONFIG_CRASH_DUMP
  742. /*
  743. * If we are doing a crash dump, we still need to know
  744. * the real mem size before original memory map is
  745. * reset.
  746. */
  747. saved_max_pfn = e820_end_of_ram_pfn();
  748. #endif
  749. e820.nr_map = 0;
  750. userdef = 1;
  751. return 0;
  752. }
  753. oldp = p;
  754. mem_size = memparse(p, &p);
  755. if (p == oldp)
  756. return -EINVAL;
  757. userdef = 1;
  758. if (*p == '@') {
  759. start_at = memparse(p+1, &p);
  760. e820_add_region(start_at, mem_size, E820_RAM);
  761. } else if (*p == '#') {
  762. start_at = memparse(p+1, &p);
  763. e820_add_region(start_at, mem_size, E820_ACPI);
  764. } else if (*p == '$') {
  765. start_at = memparse(p+1, &p);
  766. e820_add_region(start_at, mem_size, E820_RESERVED);
  767. } else if (*p == '!') {
  768. start_at = memparse(p+1, &p);
  769. e820_add_region(start_at, mem_size, E820_PRAM);
  770. } else
  771. e820_remove_range(mem_size, ULLONG_MAX - mem_size, E820_RAM, 1);
  772. return *p == '\0' ? 0 : -EINVAL;
  773. }
  774. static int __init parse_memmap_opt(char *str)
  775. {
  776. while (str) {
  777. char *k = strchr(str, ',');
  778. if (k)
  779. *k++ = 0;
  780. parse_memmap_one(str);
  781. str = k;
  782. }
  783. return 0;
  784. }
  785. early_param("memmap", parse_memmap_opt);
  786. void __init finish_e820_parsing(void)
  787. {
  788. if (userdef) {
  789. if (sanitize_e820_map(e820.map, ARRAY_SIZE(e820.map),
  790. &e820.nr_map) < 0)
  791. early_panic("Invalid user supplied memory map");
  792. printk(KERN_INFO "e820: user-defined physical RAM map:\n");
  793. e820_print_map("user");
  794. }
  795. }
  796. static const char *e820_type_to_string(int e820_type)
  797. {
  798. switch (e820_type) {
  799. case E820_RESERVED_KERN:
  800. case E820_RAM: return "System RAM";
  801. case E820_ACPI: return "ACPI Tables";
  802. case E820_NVS: return "ACPI Non-volatile Storage";
  803. case E820_UNUSABLE: return "Unusable memory";
  804. case E820_PRAM: return "Persistent Memory (legacy)";
  805. case E820_PMEM: return "Persistent Memory";
  806. default: return "reserved";
  807. }
  808. }
  809. static bool do_mark_busy(u32 type, struct resource *res)
  810. {
  811. /* this is the legacy bios/dos rom-shadow + mmio region */
  812. if (res->start < (1ULL<<20))
  813. return true;
  814. /*
  815. * Treat persistent memory like device memory, i.e. reserve it
  816. * for exclusive use of a driver
  817. */
  818. switch (type) {
  819. case E820_RESERVED:
  820. case E820_PRAM:
  821. case E820_PMEM:
  822. return false;
  823. default:
  824. return true;
  825. }
  826. }
  827. /*
  828. * Mark e820 reserved areas as busy for the resource manager.
  829. */
  830. static struct resource __initdata *e820_res;
  831. void __init e820_reserve_resources(void)
  832. {
  833. int i;
  834. struct resource *res;
  835. u64 end;
  836. res = alloc_bootmem(sizeof(struct resource) * e820.nr_map);
  837. e820_res = res;
  838. for (i = 0; i < e820.nr_map; i++) {
  839. end = e820.map[i].addr + e820.map[i].size - 1;
  840. if (end != (resource_size_t)end) {
  841. res++;
  842. continue;
  843. }
  844. res->name = e820_type_to_string(e820.map[i].type);
  845. res->start = e820.map[i].addr;
  846. res->end = end;
  847. res->flags = IORESOURCE_MEM;
  848. /*
  849. * don't register the region that could be conflicted with
  850. * pci device BAR resource and insert them later in
  851. * pcibios_resource_survey()
  852. */
  853. if (do_mark_busy(e820.map[i].type, res)) {
  854. res->flags |= IORESOURCE_BUSY;
  855. insert_resource(&iomem_resource, res);
  856. }
  857. res++;
  858. }
  859. for (i = 0; i < e820_saved.nr_map; i++) {
  860. struct e820entry *entry = &e820_saved.map[i];
  861. firmware_map_add_early(entry->addr,
  862. entry->addr + entry->size,
  863. e820_type_to_string(entry->type));
  864. }
  865. }
  866. /* How much should we pad RAM ending depending on where it is? */
  867. static unsigned long ram_alignment(resource_size_t pos)
  868. {
  869. unsigned long mb = pos >> 20;
  870. /* To 64kB in the first megabyte */
  871. if (!mb)
  872. return 64*1024;
  873. /* To 1MB in the first 16MB */
  874. if (mb < 16)
  875. return 1024*1024;
  876. /* To 64MB for anything above that */
  877. return 64*1024*1024;
  878. }
  879. #define MAX_RESOURCE_SIZE ((resource_size_t)-1)
  880. void __init e820_reserve_resources_late(void)
  881. {
  882. int i;
  883. struct resource *res;
  884. res = e820_res;
  885. for (i = 0; i < e820.nr_map; i++) {
  886. if (!res->parent && res->end)
  887. insert_resource_expand_to_fit(&iomem_resource, res);
  888. res++;
  889. }
  890. /*
  891. * Try to bump up RAM regions to reasonable boundaries to
  892. * avoid stolen RAM:
  893. */
  894. for (i = 0; i < e820.nr_map; i++) {
  895. struct e820entry *entry = &e820.map[i];
  896. u64 start, end;
  897. if (entry->type != E820_RAM)
  898. continue;
  899. start = entry->addr + entry->size;
  900. end = round_up(start, ram_alignment(start)) - 1;
  901. if (end > MAX_RESOURCE_SIZE)
  902. end = MAX_RESOURCE_SIZE;
  903. if (start >= end)
  904. continue;
  905. printk(KERN_DEBUG
  906. "e820: reserve RAM buffer [mem %#010llx-%#010llx]\n",
  907. start, end);
  908. reserve_region_with_split(&iomem_resource, start, end,
  909. "RAM buffer");
  910. }
  911. }
  912. char *__init default_machine_specific_memory_setup(void)
  913. {
  914. char *who = "BIOS-e820";
  915. u32 new_nr;
  916. /*
  917. * Try to copy the BIOS-supplied E820-map.
  918. *
  919. * Otherwise fake a memory map; one section from 0k->640k,
  920. * the next section from 1mb->appropriate_mem_k
  921. */
  922. new_nr = boot_params.e820_entries;
  923. sanitize_e820_map(boot_params.e820_map,
  924. ARRAY_SIZE(boot_params.e820_map),
  925. &new_nr);
  926. boot_params.e820_entries = new_nr;
  927. if (append_e820_map(boot_params.e820_map, boot_params.e820_entries)
  928. < 0) {
  929. u64 mem_size;
  930. /* compare results from other methods and take the greater */
  931. if (boot_params.alt_mem_k
  932. < boot_params.screen_info.ext_mem_k) {
  933. mem_size = boot_params.screen_info.ext_mem_k;
  934. who = "BIOS-88";
  935. } else {
  936. mem_size = boot_params.alt_mem_k;
  937. who = "BIOS-e801";
  938. }
  939. e820.nr_map = 0;
  940. e820_add_region(0, LOWMEMSIZE(), E820_RAM);
  941. e820_add_region(HIGH_MEMORY, mem_size << 10, E820_RAM);
  942. }
  943. /* In case someone cares... */
  944. return who;
  945. }
  946. void __init setup_memory_map(void)
  947. {
  948. char *who;
  949. who = x86_init.resources.memory_setup();
  950. memcpy(&e820_saved, &e820, sizeof(struct e820map));
  951. printk(KERN_INFO "e820: BIOS-provided physical RAM map:\n");
  952. e820_print_map(who);
  953. }
  954. void __init memblock_x86_fill(void)
  955. {
  956. int i;
  957. u64 end;
  958. /*
  959. * EFI may have more than 128 entries
  960. * We are safe to enable resizing, beause memblock_x86_fill()
  961. * is rather later for x86
  962. */
  963. memblock_allow_resize();
  964. for (i = 0; i < e820.nr_map; i++) {
  965. struct e820entry *ei = &e820.map[i];
  966. end = ei->addr + ei->size;
  967. if (end != (resource_size_t)end)
  968. continue;
  969. if (ei->type != E820_RAM && ei->type != E820_RESERVED_KERN)
  970. continue;
  971. memblock_add(ei->addr, ei->size);
  972. }
  973. /* throw away partial pages */
  974. memblock_trim_memory(PAGE_SIZE);
  975. memblock_dump_all();
  976. }
  977. void __init memblock_find_dma_reserve(void)
  978. {
  979. #ifdef CONFIG_X86_64
  980. u64 nr_pages = 0, nr_free_pages = 0;
  981. unsigned long start_pfn, end_pfn;
  982. phys_addr_t start, end;
  983. int i;
  984. u64 u;
  985. /*
  986. * need to find out used area below MAX_DMA_PFN
  987. * need to use memblock to get free size in [0, MAX_DMA_PFN]
  988. * at first, and assume boot_mem will not take below MAX_DMA_PFN
  989. */
  990. for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, NULL) {
  991. start_pfn = min(start_pfn, MAX_DMA_PFN);
  992. end_pfn = min(end_pfn, MAX_DMA_PFN);
  993. nr_pages += end_pfn - start_pfn;
  994. }
  995. for_each_free_mem_range(u, NUMA_NO_NODE, MEMBLOCK_NONE, &start, &end,
  996. NULL) {
  997. start_pfn = min_t(unsigned long, PFN_UP(start), MAX_DMA_PFN);
  998. end_pfn = min_t(unsigned long, PFN_DOWN(end), MAX_DMA_PFN);
  999. if (start_pfn < end_pfn)
  1000. nr_free_pages += end_pfn - start_pfn;
  1001. }
  1002. set_dma_reserve(nr_pages - nr_free_pages);
  1003. #endif
  1004. }