e820.c 29 KB

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