cleanup.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987
  1. /*
  2. * MTRR (Memory Type Range Register) cleanup
  3. *
  4. * Copyright (C) 2009 Yinghai Lu
  5. *
  6. * This library is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Library General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2 of the License, or (at your option) any later version.
  10. *
  11. * This library is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Library General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Library General Public
  17. * License along with this library; if not, write to the Free
  18. * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  19. */
  20. #include <linux/init.h>
  21. #include <linux/pci.h>
  22. #include <linux/smp.h>
  23. #include <linux/cpu.h>
  24. #include <linux/mutex.h>
  25. #include <linux/uaccess.h>
  26. #include <linux/kvm_para.h>
  27. #include <linux/range.h>
  28. #include <asm/processor.h>
  29. #include <asm/e820/api.h>
  30. #include <asm/mtrr.h>
  31. #include <asm/msr.h>
  32. #include "mtrr.h"
  33. struct var_mtrr_range_state {
  34. unsigned long base_pfn;
  35. unsigned long size_pfn;
  36. mtrr_type type;
  37. };
  38. struct var_mtrr_state {
  39. unsigned long range_startk;
  40. unsigned long range_sizek;
  41. unsigned long chunk_sizek;
  42. unsigned long gran_sizek;
  43. unsigned int reg;
  44. };
  45. /* Should be related to MTRR_VAR_RANGES nums */
  46. #define RANGE_NUM 256
  47. static struct range __initdata range[RANGE_NUM];
  48. static int __initdata nr_range;
  49. static struct var_mtrr_range_state __initdata range_state[RANGE_NUM];
  50. static int __initdata debug_print;
  51. #define Dprintk(x...) do { if (debug_print) pr_debug(x); } while (0)
  52. #define BIOS_BUG_MSG \
  53. "WARNING: BIOS bug: VAR MTRR %d contains strange UC entry under 1M, check with your system vendor!\n"
  54. static int __init
  55. x86_get_mtrr_mem_range(struct range *range, int nr_range,
  56. unsigned long extra_remove_base,
  57. unsigned long extra_remove_size)
  58. {
  59. unsigned long base, size;
  60. mtrr_type type;
  61. int i;
  62. for (i = 0; i < num_var_ranges; i++) {
  63. type = range_state[i].type;
  64. if (type != MTRR_TYPE_WRBACK)
  65. continue;
  66. base = range_state[i].base_pfn;
  67. size = range_state[i].size_pfn;
  68. nr_range = add_range_with_merge(range, RANGE_NUM, nr_range,
  69. base, base + size);
  70. }
  71. if (debug_print) {
  72. pr_debug("After WB checking\n");
  73. for (i = 0; i < nr_range; i++)
  74. pr_debug("MTRR MAP PFN: %016llx - %016llx\n",
  75. range[i].start, range[i].end);
  76. }
  77. /* Take out UC ranges: */
  78. for (i = 0; i < num_var_ranges; i++) {
  79. type = range_state[i].type;
  80. if (type != MTRR_TYPE_UNCACHABLE &&
  81. type != MTRR_TYPE_WRPROT)
  82. continue;
  83. size = range_state[i].size_pfn;
  84. if (!size)
  85. continue;
  86. base = range_state[i].base_pfn;
  87. if (base < (1<<(20-PAGE_SHIFT)) && mtrr_state.have_fixed &&
  88. (mtrr_state.enabled & MTRR_STATE_MTRR_ENABLED) &&
  89. (mtrr_state.enabled & MTRR_STATE_MTRR_FIXED_ENABLED)) {
  90. /* Var MTRR contains UC entry below 1M? Skip it: */
  91. pr_warn(BIOS_BUG_MSG, i);
  92. if (base + size <= (1<<(20-PAGE_SHIFT)))
  93. continue;
  94. size -= (1<<(20-PAGE_SHIFT)) - base;
  95. base = 1<<(20-PAGE_SHIFT);
  96. }
  97. subtract_range(range, RANGE_NUM, base, base + size);
  98. }
  99. if (extra_remove_size)
  100. subtract_range(range, RANGE_NUM, extra_remove_base,
  101. extra_remove_base + extra_remove_size);
  102. if (debug_print) {
  103. pr_debug("After UC checking\n");
  104. for (i = 0; i < RANGE_NUM; i++) {
  105. if (!range[i].end)
  106. continue;
  107. pr_debug("MTRR MAP PFN: %016llx - %016llx\n",
  108. range[i].start, range[i].end);
  109. }
  110. }
  111. /* sort the ranges */
  112. nr_range = clean_sort_range(range, RANGE_NUM);
  113. if (debug_print) {
  114. pr_debug("After sorting\n");
  115. for (i = 0; i < nr_range; i++)
  116. pr_debug("MTRR MAP PFN: %016llx - %016llx\n",
  117. range[i].start, range[i].end);
  118. }
  119. return nr_range;
  120. }
  121. #ifdef CONFIG_MTRR_SANITIZER
  122. static unsigned long __init sum_ranges(struct range *range, int nr_range)
  123. {
  124. unsigned long sum = 0;
  125. int i;
  126. for (i = 0; i < nr_range; i++)
  127. sum += range[i].end - range[i].start;
  128. return sum;
  129. }
  130. static int enable_mtrr_cleanup __initdata =
  131. CONFIG_MTRR_SANITIZER_ENABLE_DEFAULT;
  132. static int __init disable_mtrr_cleanup_setup(char *str)
  133. {
  134. enable_mtrr_cleanup = 0;
  135. return 0;
  136. }
  137. early_param("disable_mtrr_cleanup", disable_mtrr_cleanup_setup);
  138. static int __init enable_mtrr_cleanup_setup(char *str)
  139. {
  140. enable_mtrr_cleanup = 1;
  141. return 0;
  142. }
  143. early_param("enable_mtrr_cleanup", enable_mtrr_cleanup_setup);
  144. static int __init mtrr_cleanup_debug_setup(char *str)
  145. {
  146. debug_print = 1;
  147. return 0;
  148. }
  149. early_param("mtrr_cleanup_debug", mtrr_cleanup_debug_setup);
  150. static void __init
  151. set_var_mtrr(unsigned int reg, unsigned long basek, unsigned long sizek,
  152. unsigned char type, unsigned int address_bits)
  153. {
  154. u32 base_lo, base_hi, mask_lo, mask_hi;
  155. u64 base, mask;
  156. if (!sizek) {
  157. fill_mtrr_var_range(reg, 0, 0, 0, 0);
  158. return;
  159. }
  160. mask = (1ULL << address_bits) - 1;
  161. mask &= ~((((u64)sizek) << 10) - 1);
  162. base = ((u64)basek) << 10;
  163. base |= type;
  164. mask |= 0x800;
  165. base_lo = base & ((1ULL<<32) - 1);
  166. base_hi = base >> 32;
  167. mask_lo = mask & ((1ULL<<32) - 1);
  168. mask_hi = mask >> 32;
  169. fill_mtrr_var_range(reg, base_lo, base_hi, mask_lo, mask_hi);
  170. }
  171. static void __init
  172. save_var_mtrr(unsigned int reg, unsigned long basek, unsigned long sizek,
  173. unsigned char type)
  174. {
  175. range_state[reg].base_pfn = basek >> (PAGE_SHIFT - 10);
  176. range_state[reg].size_pfn = sizek >> (PAGE_SHIFT - 10);
  177. range_state[reg].type = type;
  178. }
  179. static void __init set_var_mtrr_all(unsigned int address_bits)
  180. {
  181. unsigned long basek, sizek;
  182. unsigned char type;
  183. unsigned int reg;
  184. for (reg = 0; reg < num_var_ranges; reg++) {
  185. basek = range_state[reg].base_pfn << (PAGE_SHIFT - 10);
  186. sizek = range_state[reg].size_pfn << (PAGE_SHIFT - 10);
  187. type = range_state[reg].type;
  188. set_var_mtrr(reg, basek, sizek, type, address_bits);
  189. }
  190. }
  191. static unsigned long to_size_factor(unsigned long sizek, char *factorp)
  192. {
  193. unsigned long base = sizek;
  194. char factor;
  195. if (base & ((1<<10) - 1)) {
  196. /* Not MB-aligned: */
  197. factor = 'K';
  198. } else if (base & ((1<<20) - 1)) {
  199. factor = 'M';
  200. base >>= 10;
  201. } else {
  202. factor = 'G';
  203. base >>= 20;
  204. }
  205. *factorp = factor;
  206. return base;
  207. }
  208. static unsigned int __init
  209. range_to_mtrr(unsigned int reg, unsigned long range_startk,
  210. unsigned long range_sizek, unsigned char type)
  211. {
  212. if (!range_sizek || (reg >= num_var_ranges))
  213. return reg;
  214. while (range_sizek) {
  215. unsigned long max_align, align;
  216. unsigned long sizek;
  217. /* Compute the maximum size with which we can make a range: */
  218. if (range_startk)
  219. max_align = __ffs(range_startk);
  220. else
  221. max_align = BITS_PER_LONG - 1;
  222. align = __fls(range_sizek);
  223. if (align > max_align)
  224. align = max_align;
  225. sizek = 1UL << align;
  226. if (debug_print) {
  227. char start_factor = 'K', size_factor = 'K';
  228. unsigned long start_base, size_base;
  229. start_base = to_size_factor(range_startk, &start_factor);
  230. size_base = to_size_factor(sizek, &size_factor);
  231. Dprintk("Setting variable MTRR %d, "
  232. "base: %ld%cB, range: %ld%cB, type %s\n",
  233. reg, start_base, start_factor,
  234. size_base, size_factor,
  235. (type == MTRR_TYPE_UNCACHABLE) ? "UC" :
  236. ((type == MTRR_TYPE_WRBACK) ? "WB" : "Other")
  237. );
  238. }
  239. save_var_mtrr(reg++, range_startk, sizek, type);
  240. range_startk += sizek;
  241. range_sizek -= sizek;
  242. if (reg >= num_var_ranges)
  243. break;
  244. }
  245. return reg;
  246. }
  247. static unsigned __init
  248. range_to_mtrr_with_hole(struct var_mtrr_state *state, unsigned long basek,
  249. unsigned long sizek)
  250. {
  251. unsigned long hole_basek, hole_sizek;
  252. unsigned long second_sizek;
  253. unsigned long range0_basek, range0_sizek;
  254. unsigned long range_basek, range_sizek;
  255. unsigned long chunk_sizek;
  256. unsigned long gran_sizek;
  257. hole_basek = 0;
  258. hole_sizek = 0;
  259. second_sizek = 0;
  260. chunk_sizek = state->chunk_sizek;
  261. gran_sizek = state->gran_sizek;
  262. /* Align with gran size, prevent small block used up MTRRs: */
  263. range_basek = ALIGN(state->range_startk, gran_sizek);
  264. if ((range_basek > basek) && basek)
  265. return second_sizek;
  266. state->range_sizek -= (range_basek - state->range_startk);
  267. range_sizek = ALIGN(state->range_sizek, gran_sizek);
  268. while (range_sizek > state->range_sizek) {
  269. range_sizek -= gran_sizek;
  270. if (!range_sizek)
  271. return 0;
  272. }
  273. state->range_sizek = range_sizek;
  274. /* Try to append some small hole: */
  275. range0_basek = state->range_startk;
  276. range0_sizek = ALIGN(state->range_sizek, chunk_sizek);
  277. /* No increase: */
  278. if (range0_sizek == state->range_sizek) {
  279. Dprintk("rangeX: %016lx - %016lx\n",
  280. range0_basek<<10,
  281. (range0_basek + state->range_sizek)<<10);
  282. state->reg = range_to_mtrr(state->reg, range0_basek,
  283. state->range_sizek, MTRR_TYPE_WRBACK);
  284. return 0;
  285. }
  286. /* Only cut back when it is not the last: */
  287. if (sizek) {
  288. while (range0_basek + range0_sizek > (basek + sizek)) {
  289. if (range0_sizek >= chunk_sizek)
  290. range0_sizek -= chunk_sizek;
  291. else
  292. range0_sizek = 0;
  293. if (!range0_sizek)
  294. break;
  295. }
  296. }
  297. second_try:
  298. range_basek = range0_basek + range0_sizek;
  299. /* One hole in the middle: */
  300. if (range_basek > basek && range_basek <= (basek + sizek))
  301. second_sizek = range_basek - basek;
  302. if (range0_sizek > state->range_sizek) {
  303. /* One hole in middle or at the end: */
  304. hole_sizek = range0_sizek - state->range_sizek - second_sizek;
  305. /* Hole size should be less than half of range0 size: */
  306. if (hole_sizek >= (range0_sizek >> 1) &&
  307. range0_sizek >= chunk_sizek) {
  308. range0_sizek -= chunk_sizek;
  309. second_sizek = 0;
  310. hole_sizek = 0;
  311. goto second_try;
  312. }
  313. }
  314. if (range0_sizek) {
  315. Dprintk("range0: %016lx - %016lx\n",
  316. range0_basek<<10,
  317. (range0_basek + range0_sizek)<<10);
  318. state->reg = range_to_mtrr(state->reg, range0_basek,
  319. range0_sizek, MTRR_TYPE_WRBACK);
  320. }
  321. if (range0_sizek < state->range_sizek) {
  322. /* Need to handle left over range: */
  323. range_sizek = state->range_sizek - range0_sizek;
  324. Dprintk("range: %016lx - %016lx\n",
  325. range_basek<<10,
  326. (range_basek + range_sizek)<<10);
  327. state->reg = range_to_mtrr(state->reg, range_basek,
  328. range_sizek, MTRR_TYPE_WRBACK);
  329. }
  330. if (hole_sizek) {
  331. hole_basek = range_basek - hole_sizek - second_sizek;
  332. Dprintk("hole: %016lx - %016lx\n",
  333. hole_basek<<10,
  334. (hole_basek + hole_sizek)<<10);
  335. state->reg = range_to_mtrr(state->reg, hole_basek,
  336. hole_sizek, MTRR_TYPE_UNCACHABLE);
  337. }
  338. return second_sizek;
  339. }
  340. static void __init
  341. set_var_mtrr_range(struct var_mtrr_state *state, unsigned long base_pfn,
  342. unsigned long size_pfn)
  343. {
  344. unsigned long basek, sizek;
  345. unsigned long second_sizek = 0;
  346. if (state->reg >= num_var_ranges)
  347. return;
  348. basek = base_pfn << (PAGE_SHIFT - 10);
  349. sizek = size_pfn << (PAGE_SHIFT - 10);
  350. /* See if I can merge with the last range: */
  351. if ((basek <= 1024) ||
  352. (state->range_startk + state->range_sizek == basek)) {
  353. unsigned long endk = basek + sizek;
  354. state->range_sizek = endk - state->range_startk;
  355. return;
  356. }
  357. /* Write the range mtrrs: */
  358. if (state->range_sizek != 0)
  359. second_sizek = range_to_mtrr_with_hole(state, basek, sizek);
  360. /* Allocate an msr: */
  361. state->range_startk = basek + second_sizek;
  362. state->range_sizek = sizek - second_sizek;
  363. }
  364. /* Minimum size of mtrr block that can take hole: */
  365. static u64 mtrr_chunk_size __initdata = (256ULL<<20);
  366. static int __init parse_mtrr_chunk_size_opt(char *p)
  367. {
  368. if (!p)
  369. return -EINVAL;
  370. mtrr_chunk_size = memparse(p, &p);
  371. return 0;
  372. }
  373. early_param("mtrr_chunk_size", parse_mtrr_chunk_size_opt);
  374. /* Granularity of mtrr of block: */
  375. static u64 mtrr_gran_size __initdata;
  376. static int __init parse_mtrr_gran_size_opt(char *p)
  377. {
  378. if (!p)
  379. return -EINVAL;
  380. mtrr_gran_size = memparse(p, &p);
  381. return 0;
  382. }
  383. early_param("mtrr_gran_size", parse_mtrr_gran_size_opt);
  384. static unsigned long nr_mtrr_spare_reg __initdata =
  385. CONFIG_MTRR_SANITIZER_SPARE_REG_NR_DEFAULT;
  386. static int __init parse_mtrr_spare_reg(char *arg)
  387. {
  388. if (arg)
  389. nr_mtrr_spare_reg = simple_strtoul(arg, NULL, 0);
  390. return 0;
  391. }
  392. early_param("mtrr_spare_reg_nr", parse_mtrr_spare_reg);
  393. static int __init
  394. x86_setup_var_mtrrs(struct range *range, int nr_range,
  395. u64 chunk_size, u64 gran_size)
  396. {
  397. struct var_mtrr_state var_state;
  398. int num_reg;
  399. int i;
  400. var_state.range_startk = 0;
  401. var_state.range_sizek = 0;
  402. var_state.reg = 0;
  403. var_state.chunk_sizek = chunk_size >> 10;
  404. var_state.gran_sizek = gran_size >> 10;
  405. memset(range_state, 0, sizeof(range_state));
  406. /* Write the range: */
  407. for (i = 0; i < nr_range; i++) {
  408. set_var_mtrr_range(&var_state, range[i].start,
  409. range[i].end - range[i].start);
  410. }
  411. /* Write the last range: */
  412. if (var_state.range_sizek != 0)
  413. range_to_mtrr_with_hole(&var_state, 0, 0);
  414. num_reg = var_state.reg;
  415. /* Clear out the extra MTRR's: */
  416. while (var_state.reg < num_var_ranges) {
  417. save_var_mtrr(var_state.reg, 0, 0, 0);
  418. var_state.reg++;
  419. }
  420. return num_reg;
  421. }
  422. struct mtrr_cleanup_result {
  423. unsigned long gran_sizek;
  424. unsigned long chunk_sizek;
  425. unsigned long lose_cover_sizek;
  426. unsigned int num_reg;
  427. int bad;
  428. };
  429. /*
  430. * gran_size: 64K, 128K, 256K, 512K, 1M, 2M, ..., 2G
  431. * chunk size: gran_size, ..., 2G
  432. * so we need (1+16)*8
  433. */
  434. #define NUM_RESULT 136
  435. #define PSHIFT (PAGE_SHIFT - 10)
  436. static struct mtrr_cleanup_result __initdata result[NUM_RESULT];
  437. static unsigned long __initdata min_loss_pfn[RANGE_NUM];
  438. static void __init print_out_mtrr_range_state(void)
  439. {
  440. char start_factor = 'K', size_factor = 'K';
  441. unsigned long start_base, size_base;
  442. mtrr_type type;
  443. int i;
  444. for (i = 0; i < num_var_ranges; i++) {
  445. size_base = range_state[i].size_pfn << (PAGE_SHIFT - 10);
  446. if (!size_base)
  447. continue;
  448. size_base = to_size_factor(size_base, &size_factor);
  449. start_base = range_state[i].base_pfn << (PAGE_SHIFT - 10);
  450. start_base = to_size_factor(start_base, &start_factor);
  451. type = range_state[i].type;
  452. pr_debug("reg %d, base: %ld%cB, range: %ld%cB, type %s\n",
  453. i, start_base, start_factor,
  454. size_base, size_factor,
  455. (type == MTRR_TYPE_UNCACHABLE) ? "UC" :
  456. ((type == MTRR_TYPE_WRPROT) ? "WP" :
  457. ((type == MTRR_TYPE_WRBACK) ? "WB" : "Other"))
  458. );
  459. }
  460. }
  461. static int __init mtrr_need_cleanup(void)
  462. {
  463. int i;
  464. mtrr_type type;
  465. unsigned long size;
  466. /* Extra one for all 0: */
  467. int num[MTRR_NUM_TYPES + 1];
  468. /* Check entries number: */
  469. memset(num, 0, sizeof(num));
  470. for (i = 0; i < num_var_ranges; i++) {
  471. type = range_state[i].type;
  472. size = range_state[i].size_pfn;
  473. if (type >= MTRR_NUM_TYPES)
  474. continue;
  475. if (!size)
  476. type = MTRR_NUM_TYPES;
  477. num[type]++;
  478. }
  479. /* Check if we got UC entries: */
  480. if (!num[MTRR_TYPE_UNCACHABLE])
  481. return 0;
  482. /* Check if we only had WB and UC */
  483. if (num[MTRR_TYPE_WRBACK] + num[MTRR_TYPE_UNCACHABLE] !=
  484. num_var_ranges - num[MTRR_NUM_TYPES])
  485. return 0;
  486. return 1;
  487. }
  488. static unsigned long __initdata range_sums;
  489. static void __init
  490. mtrr_calc_range_state(u64 chunk_size, u64 gran_size,
  491. unsigned long x_remove_base,
  492. unsigned long x_remove_size, int i)
  493. {
  494. /*
  495. * range_new should really be an automatic variable, but
  496. * putting 4096 bytes on the stack is frowned upon, to put it
  497. * mildly. It is safe to make it a static __initdata variable,
  498. * since mtrr_calc_range_state is only called during init and
  499. * there's no way it will call itself recursively.
  500. */
  501. static struct range range_new[RANGE_NUM] __initdata;
  502. unsigned long range_sums_new;
  503. int nr_range_new;
  504. int num_reg;
  505. /* Convert ranges to var ranges state: */
  506. num_reg = x86_setup_var_mtrrs(range, nr_range, chunk_size, gran_size);
  507. /* We got new setting in range_state, check it: */
  508. memset(range_new, 0, sizeof(range_new));
  509. nr_range_new = x86_get_mtrr_mem_range(range_new, 0,
  510. x_remove_base, x_remove_size);
  511. range_sums_new = sum_ranges(range_new, nr_range_new);
  512. result[i].chunk_sizek = chunk_size >> 10;
  513. result[i].gran_sizek = gran_size >> 10;
  514. result[i].num_reg = num_reg;
  515. if (range_sums < range_sums_new) {
  516. result[i].lose_cover_sizek = (range_sums_new - range_sums) << PSHIFT;
  517. result[i].bad = 1;
  518. } else {
  519. result[i].lose_cover_sizek = (range_sums - range_sums_new) << PSHIFT;
  520. }
  521. /* Double check it: */
  522. if (!result[i].bad && !result[i].lose_cover_sizek) {
  523. if (nr_range_new != nr_range || memcmp(range, range_new, sizeof(range)))
  524. result[i].bad = 1;
  525. }
  526. if (!result[i].bad && (range_sums - range_sums_new < min_loss_pfn[num_reg]))
  527. min_loss_pfn[num_reg] = range_sums - range_sums_new;
  528. }
  529. static void __init mtrr_print_out_one_result(int i)
  530. {
  531. unsigned long gran_base, chunk_base, lose_base;
  532. char gran_factor, chunk_factor, lose_factor;
  533. gran_base = to_size_factor(result[i].gran_sizek, &gran_factor);
  534. chunk_base = to_size_factor(result[i].chunk_sizek, &chunk_factor);
  535. lose_base = to_size_factor(result[i].lose_cover_sizek, &lose_factor);
  536. pr_info("%sgran_size: %ld%c \tchunk_size: %ld%c \t",
  537. result[i].bad ? "*BAD*" : " ",
  538. gran_base, gran_factor, chunk_base, chunk_factor);
  539. pr_cont("num_reg: %d \tlose cover RAM: %s%ld%c\n",
  540. result[i].num_reg, result[i].bad ? "-" : "",
  541. lose_base, lose_factor);
  542. }
  543. static int __init mtrr_search_optimal_index(void)
  544. {
  545. int num_reg_good;
  546. int index_good;
  547. int i;
  548. if (nr_mtrr_spare_reg >= num_var_ranges)
  549. nr_mtrr_spare_reg = num_var_ranges - 1;
  550. num_reg_good = -1;
  551. for (i = num_var_ranges - nr_mtrr_spare_reg; i > 0; i--) {
  552. if (!min_loss_pfn[i])
  553. num_reg_good = i;
  554. }
  555. index_good = -1;
  556. if (num_reg_good != -1) {
  557. for (i = 0; i < NUM_RESULT; i++) {
  558. if (!result[i].bad &&
  559. result[i].num_reg == num_reg_good &&
  560. !result[i].lose_cover_sizek) {
  561. index_good = i;
  562. break;
  563. }
  564. }
  565. }
  566. return index_good;
  567. }
  568. int __init mtrr_cleanup(unsigned address_bits)
  569. {
  570. unsigned long x_remove_base, x_remove_size;
  571. unsigned long base, size, def, dummy;
  572. u64 chunk_size, gran_size;
  573. mtrr_type type;
  574. int index_good;
  575. int i;
  576. if (!is_cpu(INTEL) || enable_mtrr_cleanup < 1)
  577. return 0;
  578. rdmsr(MSR_MTRRdefType, def, dummy);
  579. def &= 0xff;
  580. if (def != MTRR_TYPE_UNCACHABLE)
  581. return 0;
  582. /* Get it and store it aside: */
  583. memset(range_state, 0, sizeof(range_state));
  584. for (i = 0; i < num_var_ranges; i++) {
  585. mtrr_if->get(i, &base, &size, &type);
  586. range_state[i].base_pfn = base;
  587. range_state[i].size_pfn = size;
  588. range_state[i].type = type;
  589. }
  590. /* Check if we need handle it and can handle it: */
  591. if (!mtrr_need_cleanup())
  592. return 0;
  593. /* Print original var MTRRs at first, for debugging: */
  594. pr_debug("original variable MTRRs\n");
  595. print_out_mtrr_range_state();
  596. memset(range, 0, sizeof(range));
  597. x_remove_size = 0;
  598. x_remove_base = 1 << (32 - PAGE_SHIFT);
  599. if (mtrr_tom2)
  600. x_remove_size = (mtrr_tom2 >> PAGE_SHIFT) - x_remove_base;
  601. /*
  602. * [0, 1M) should always be covered by var mtrr with WB
  603. * and fixed mtrrs should take effect before var mtrr for it:
  604. */
  605. nr_range = add_range_with_merge(range, RANGE_NUM, 0, 0,
  606. 1ULL<<(20 - PAGE_SHIFT));
  607. /* add from var mtrr at last */
  608. nr_range = x86_get_mtrr_mem_range(range, nr_range,
  609. x_remove_base, x_remove_size);
  610. range_sums = sum_ranges(range, nr_range);
  611. pr_info("total RAM covered: %ldM\n",
  612. range_sums >> (20 - PAGE_SHIFT));
  613. if (mtrr_chunk_size && mtrr_gran_size) {
  614. i = 0;
  615. mtrr_calc_range_state(mtrr_chunk_size, mtrr_gran_size,
  616. x_remove_base, x_remove_size, i);
  617. mtrr_print_out_one_result(i);
  618. if (!result[i].bad) {
  619. set_var_mtrr_all(address_bits);
  620. pr_debug("New variable MTRRs\n");
  621. print_out_mtrr_range_state();
  622. return 1;
  623. }
  624. pr_info("invalid mtrr_gran_size or mtrr_chunk_size, will find optimal one\n");
  625. }
  626. i = 0;
  627. memset(min_loss_pfn, 0xff, sizeof(min_loss_pfn));
  628. memset(result, 0, sizeof(result));
  629. for (gran_size = (1ULL<<16); gran_size < (1ULL<<32); gran_size <<= 1) {
  630. for (chunk_size = gran_size; chunk_size < (1ULL<<32);
  631. chunk_size <<= 1) {
  632. if (i >= NUM_RESULT)
  633. continue;
  634. mtrr_calc_range_state(chunk_size, gran_size,
  635. x_remove_base, x_remove_size, i);
  636. if (debug_print) {
  637. mtrr_print_out_one_result(i);
  638. pr_info("\n");
  639. }
  640. i++;
  641. }
  642. }
  643. /* Try to find the optimal index: */
  644. index_good = mtrr_search_optimal_index();
  645. if (index_good != -1) {
  646. pr_info("Found optimal setting for mtrr clean up\n");
  647. i = index_good;
  648. mtrr_print_out_one_result(i);
  649. /* Convert ranges to var ranges state: */
  650. chunk_size = result[i].chunk_sizek;
  651. chunk_size <<= 10;
  652. gran_size = result[i].gran_sizek;
  653. gran_size <<= 10;
  654. x86_setup_var_mtrrs(range, nr_range, chunk_size, gran_size);
  655. set_var_mtrr_all(address_bits);
  656. pr_debug("New variable MTRRs\n");
  657. print_out_mtrr_range_state();
  658. return 1;
  659. } else {
  660. /* print out all */
  661. for (i = 0; i < NUM_RESULT; i++)
  662. mtrr_print_out_one_result(i);
  663. }
  664. pr_info("mtrr_cleanup: can not find optimal value\n");
  665. pr_info("please specify mtrr_gran_size/mtrr_chunk_size\n");
  666. return 0;
  667. }
  668. #else
  669. int __init mtrr_cleanup(unsigned address_bits)
  670. {
  671. return 0;
  672. }
  673. #endif
  674. static int disable_mtrr_trim;
  675. static int __init disable_mtrr_trim_setup(char *str)
  676. {
  677. disable_mtrr_trim = 1;
  678. return 0;
  679. }
  680. early_param("disable_mtrr_trim", disable_mtrr_trim_setup);
  681. /*
  682. * Newer AMD K8s and later CPUs have a special magic MSR way to force WB
  683. * for memory >4GB. Check for that here.
  684. * Note this won't check if the MTRRs < 4GB where the magic bit doesn't
  685. * apply to are wrong, but so far we don't know of any such case in the wild.
  686. */
  687. #define Tom2Enabled (1U << 21)
  688. #define Tom2ForceMemTypeWB (1U << 22)
  689. int __init amd_special_default_mtrr(void)
  690. {
  691. u32 l, h;
  692. if (boot_cpu_data.x86_vendor != X86_VENDOR_AMD &&
  693. boot_cpu_data.x86_vendor != X86_VENDOR_HYGON)
  694. return 0;
  695. if (boot_cpu_data.x86 < 0xf)
  696. return 0;
  697. /* In case some hypervisor doesn't pass SYSCFG through: */
  698. if (rdmsr_safe(MSR_AMD64_SYSCFG, &l, &h) < 0)
  699. return 0;
  700. /*
  701. * Memory between 4GB and top of mem is forced WB by this magic bit.
  702. * Reserved before K8RevF, but should be zero there.
  703. */
  704. if ((l & (Tom2Enabled | Tom2ForceMemTypeWB)) ==
  705. (Tom2Enabled | Tom2ForceMemTypeWB))
  706. return 1;
  707. return 0;
  708. }
  709. static u64 __init
  710. real_trim_memory(unsigned long start_pfn, unsigned long limit_pfn)
  711. {
  712. u64 trim_start, trim_size;
  713. trim_start = start_pfn;
  714. trim_start <<= PAGE_SHIFT;
  715. trim_size = limit_pfn;
  716. trim_size <<= PAGE_SHIFT;
  717. trim_size -= trim_start;
  718. return e820__range_update(trim_start, trim_size, E820_TYPE_RAM, E820_TYPE_RESERVED);
  719. }
  720. /**
  721. * mtrr_trim_uncached_memory - trim RAM not covered by MTRRs
  722. * @end_pfn: ending page frame number
  723. *
  724. * Some buggy BIOSes don't setup the MTRRs properly for systems with certain
  725. * memory configurations. This routine checks that the highest MTRR matches
  726. * the end of memory, to make sure the MTRRs having a write back type cover
  727. * all of the memory the kernel is intending to use. If not, it'll trim any
  728. * memory off the end by adjusting end_pfn, removing it from the kernel's
  729. * allocation pools, warning the user with an obnoxious message.
  730. */
  731. int __init mtrr_trim_uncached_memory(unsigned long end_pfn)
  732. {
  733. unsigned long i, base, size, highest_pfn = 0, def, dummy;
  734. mtrr_type type;
  735. u64 total_trim_size;
  736. /* extra one for all 0 */
  737. int num[MTRR_NUM_TYPES + 1];
  738. /*
  739. * Make sure we only trim uncachable memory on machines that
  740. * support the Intel MTRR architecture:
  741. */
  742. if (!is_cpu(INTEL) || disable_mtrr_trim)
  743. return 0;
  744. rdmsr(MSR_MTRRdefType, def, dummy);
  745. def &= 0xff;
  746. if (def != MTRR_TYPE_UNCACHABLE)
  747. return 0;
  748. /* Get it and store it aside: */
  749. memset(range_state, 0, sizeof(range_state));
  750. for (i = 0; i < num_var_ranges; i++) {
  751. mtrr_if->get(i, &base, &size, &type);
  752. range_state[i].base_pfn = base;
  753. range_state[i].size_pfn = size;
  754. range_state[i].type = type;
  755. }
  756. /* Find highest cached pfn: */
  757. for (i = 0; i < num_var_ranges; i++) {
  758. type = range_state[i].type;
  759. if (type != MTRR_TYPE_WRBACK)
  760. continue;
  761. base = range_state[i].base_pfn;
  762. size = range_state[i].size_pfn;
  763. if (highest_pfn < base + size)
  764. highest_pfn = base + size;
  765. }
  766. /* kvm/qemu doesn't have mtrr set right, don't trim them all: */
  767. if (!highest_pfn) {
  768. pr_info("CPU MTRRs all blank - virtualized system.\n");
  769. return 0;
  770. }
  771. /* Check entries number: */
  772. memset(num, 0, sizeof(num));
  773. for (i = 0; i < num_var_ranges; i++) {
  774. type = range_state[i].type;
  775. if (type >= MTRR_NUM_TYPES)
  776. continue;
  777. size = range_state[i].size_pfn;
  778. if (!size)
  779. type = MTRR_NUM_TYPES;
  780. num[type]++;
  781. }
  782. /* No entry for WB? */
  783. if (!num[MTRR_TYPE_WRBACK])
  784. return 0;
  785. /* Check if we only had WB and UC: */
  786. if (num[MTRR_TYPE_WRBACK] + num[MTRR_TYPE_UNCACHABLE] !=
  787. num_var_ranges - num[MTRR_NUM_TYPES])
  788. return 0;
  789. memset(range, 0, sizeof(range));
  790. nr_range = 0;
  791. if (mtrr_tom2) {
  792. range[nr_range].start = (1ULL<<(32 - PAGE_SHIFT));
  793. range[nr_range].end = mtrr_tom2 >> PAGE_SHIFT;
  794. if (highest_pfn < range[nr_range].end)
  795. highest_pfn = range[nr_range].end;
  796. nr_range++;
  797. }
  798. nr_range = x86_get_mtrr_mem_range(range, nr_range, 0, 0);
  799. /* Check the head: */
  800. total_trim_size = 0;
  801. if (range[0].start)
  802. total_trim_size += real_trim_memory(0, range[0].start);
  803. /* Check the holes: */
  804. for (i = 0; i < nr_range - 1; i++) {
  805. if (range[i].end < range[i+1].start)
  806. total_trim_size += real_trim_memory(range[i].end,
  807. range[i+1].start);
  808. }
  809. /* Check the top: */
  810. i = nr_range - 1;
  811. if (range[i].end < end_pfn)
  812. total_trim_size += real_trim_memory(range[i].end,
  813. end_pfn);
  814. if (total_trim_size) {
  815. pr_warn("WARNING: BIOS bug: CPU MTRRs don't cover all of memory, losing %lluMB of RAM.\n",
  816. total_trim_size >> 20);
  817. if (!changed_by_mtrr_cleanup)
  818. WARN_ON(1);
  819. pr_info("update e820 for mtrr\n");
  820. e820__update_table_print();
  821. return 1;
  822. }
  823. return 0;
  824. }