e820.c 30 KB

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