p2m.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790
  1. /*
  2. * Xen leaves the responsibility for maintaining p2m mappings to the
  3. * guests themselves, but it must also access and update the p2m array
  4. * during suspend/resume when all the pages are reallocated.
  5. *
  6. * The logical flat p2m table is mapped to a linear kernel memory area.
  7. * For accesses by Xen a three-level tree linked via mfns only is set up to
  8. * allow the address space to be sparse.
  9. *
  10. * Xen
  11. * |
  12. * p2m_top_mfn
  13. * / \
  14. * p2m_mid_mfn p2m_mid_mfn
  15. * / /
  16. * p2m p2m p2m ...
  17. *
  18. * The p2m_mid_mfn pages are mapped by p2m_top_mfn_p.
  19. *
  20. * The p2m_top_mfn level is limited to 1 page, so the maximum representable
  21. * pseudo-physical address space is:
  22. * P2M_TOP_PER_PAGE * P2M_MID_PER_PAGE * P2M_PER_PAGE pages
  23. *
  24. * P2M_PER_PAGE depends on the architecture, as a mfn is always
  25. * unsigned long (8 bytes on 64-bit, 4 bytes on 32), leading to
  26. * 512 and 1024 entries respectively.
  27. *
  28. * In short, these structures contain the Machine Frame Number (MFN) of the PFN.
  29. *
  30. * However not all entries are filled with MFNs. Specifically for all other
  31. * leaf entries, or for the top root, or middle one, for which there is a void
  32. * entry, we assume it is "missing". So (for example)
  33. * pfn_to_mfn(0x90909090)=INVALID_P2M_ENTRY.
  34. * We have a dedicated page p2m_missing with all entries being
  35. * INVALID_P2M_ENTRY. This page may be referenced multiple times in the p2m
  36. * list/tree in case there are multiple areas with P2M_PER_PAGE invalid pfns.
  37. *
  38. * We also have the possibility of setting 1-1 mappings on certain regions, so
  39. * that:
  40. * pfn_to_mfn(0xc0000)=0xc0000
  41. *
  42. * The benefit of this is, that we can assume for non-RAM regions (think
  43. * PCI BARs, or ACPI spaces), we can create mappings easily because we
  44. * get the PFN value to match the MFN.
  45. *
  46. * For this to work efficiently we have one new page p2m_identity. All entries
  47. * in p2m_identity are set to INVALID_P2M_ENTRY type (Xen toolstack only
  48. * recognizes that and MFNs, no other fancy value).
  49. *
  50. * On lookup we spot that the entry points to p2m_identity and return the
  51. * identity value instead of dereferencing and returning INVALID_P2M_ENTRY.
  52. * If the entry points to an allocated page, we just proceed as before and
  53. * return the PFN. If the PFN has IDENTITY_FRAME_BIT set we unmask that in
  54. * appropriate functions (pfn_to_mfn).
  55. *
  56. * The reason for having the IDENTITY_FRAME_BIT instead of just returning the
  57. * PFN is that we could find ourselves where pfn_to_mfn(pfn)==pfn for a
  58. * non-identity pfn. To protect ourselves against we elect to set (and get) the
  59. * IDENTITY_FRAME_BIT on all identity mapped PFNs.
  60. */
  61. #include <linux/init.h>
  62. #include <linux/module.h>
  63. #include <linux/list.h>
  64. #include <linux/hash.h>
  65. #include <linux/sched.h>
  66. #include <linux/seq_file.h>
  67. #include <linux/bootmem.h>
  68. #include <linux/slab.h>
  69. #include <asm/cache.h>
  70. #include <asm/setup.h>
  71. #include <asm/uaccess.h>
  72. #include <asm/xen/page.h>
  73. #include <asm/xen/hypercall.h>
  74. #include <asm/xen/hypervisor.h>
  75. #include <xen/balloon.h>
  76. #include <xen/grant_table.h>
  77. #include "p2m.h"
  78. #include "multicalls.h"
  79. #include "xen-ops.h"
  80. #define PMDS_PER_MID_PAGE (P2M_MID_PER_PAGE / PTRS_PER_PTE)
  81. unsigned long *xen_p2m_addr __read_mostly;
  82. EXPORT_SYMBOL_GPL(xen_p2m_addr);
  83. unsigned long xen_p2m_size __read_mostly;
  84. EXPORT_SYMBOL_GPL(xen_p2m_size);
  85. unsigned long xen_max_p2m_pfn __read_mostly;
  86. EXPORT_SYMBOL_GPL(xen_max_p2m_pfn);
  87. #ifdef CONFIG_XEN_BALLOON_MEMORY_HOTPLUG_LIMIT
  88. #define P2M_LIMIT CONFIG_XEN_BALLOON_MEMORY_HOTPLUG_LIMIT
  89. #else
  90. #define P2M_LIMIT 0
  91. #endif
  92. static DEFINE_SPINLOCK(p2m_update_lock);
  93. static unsigned long *p2m_mid_missing_mfn;
  94. static unsigned long *p2m_top_mfn;
  95. static unsigned long **p2m_top_mfn_p;
  96. static unsigned long *p2m_missing;
  97. static unsigned long *p2m_identity;
  98. static pte_t *p2m_missing_pte;
  99. static pte_t *p2m_identity_pte;
  100. static inline unsigned p2m_top_index(unsigned long pfn)
  101. {
  102. BUG_ON(pfn >= MAX_P2M_PFN);
  103. return pfn / (P2M_MID_PER_PAGE * P2M_PER_PAGE);
  104. }
  105. static inline unsigned p2m_mid_index(unsigned long pfn)
  106. {
  107. return (pfn / P2M_PER_PAGE) % P2M_MID_PER_PAGE;
  108. }
  109. static inline unsigned p2m_index(unsigned long pfn)
  110. {
  111. return pfn % P2M_PER_PAGE;
  112. }
  113. static void p2m_top_mfn_init(unsigned long *top)
  114. {
  115. unsigned i;
  116. for (i = 0; i < P2M_TOP_PER_PAGE; i++)
  117. top[i] = virt_to_mfn(p2m_mid_missing_mfn);
  118. }
  119. static void p2m_top_mfn_p_init(unsigned long **top)
  120. {
  121. unsigned i;
  122. for (i = 0; i < P2M_TOP_PER_PAGE; i++)
  123. top[i] = p2m_mid_missing_mfn;
  124. }
  125. static void p2m_mid_mfn_init(unsigned long *mid, unsigned long *leaf)
  126. {
  127. unsigned i;
  128. for (i = 0; i < P2M_MID_PER_PAGE; i++)
  129. mid[i] = virt_to_mfn(leaf);
  130. }
  131. static void p2m_init(unsigned long *p2m)
  132. {
  133. unsigned i;
  134. for (i = 0; i < P2M_PER_PAGE; i++)
  135. p2m[i] = INVALID_P2M_ENTRY;
  136. }
  137. static void p2m_init_identity(unsigned long *p2m, unsigned long pfn)
  138. {
  139. unsigned i;
  140. for (i = 0; i < P2M_PER_PAGE; i++)
  141. p2m[i] = IDENTITY_FRAME(pfn + i);
  142. }
  143. static void * __ref alloc_p2m_page(void)
  144. {
  145. if (unlikely(!slab_is_available()))
  146. return alloc_bootmem_align(PAGE_SIZE, PAGE_SIZE);
  147. return (void *)__get_free_page(GFP_KERNEL | __GFP_REPEAT);
  148. }
  149. static void __ref free_p2m_page(void *p)
  150. {
  151. if (unlikely(!slab_is_available())) {
  152. free_bootmem((unsigned long)p, PAGE_SIZE);
  153. return;
  154. }
  155. free_page((unsigned long)p);
  156. }
  157. /*
  158. * Build the parallel p2m_top_mfn and p2m_mid_mfn structures
  159. *
  160. * This is called both at boot time, and after resuming from suspend:
  161. * - At boot time we're called rather early, and must use alloc_bootmem*()
  162. * to allocate memory.
  163. *
  164. * - After resume we're called from within stop_machine, but the mfn
  165. * tree should already be completely allocated.
  166. */
  167. void __ref xen_build_mfn_list_list(void)
  168. {
  169. unsigned long pfn, mfn;
  170. pte_t *ptep;
  171. unsigned int level, topidx, mididx;
  172. unsigned long *mid_mfn_p;
  173. if (xen_feature(XENFEAT_auto_translated_physmap))
  174. return;
  175. /* Pre-initialize p2m_top_mfn to be completely missing */
  176. if (p2m_top_mfn == NULL) {
  177. p2m_mid_missing_mfn = alloc_p2m_page();
  178. p2m_mid_mfn_init(p2m_mid_missing_mfn, p2m_missing);
  179. p2m_top_mfn_p = alloc_p2m_page();
  180. p2m_top_mfn_p_init(p2m_top_mfn_p);
  181. p2m_top_mfn = alloc_p2m_page();
  182. p2m_top_mfn_init(p2m_top_mfn);
  183. } else {
  184. /* Reinitialise, mfn's all change after migration */
  185. p2m_mid_mfn_init(p2m_mid_missing_mfn, p2m_missing);
  186. }
  187. for (pfn = 0; pfn < xen_max_p2m_pfn && pfn < MAX_P2M_PFN;
  188. pfn += P2M_PER_PAGE) {
  189. topidx = p2m_top_index(pfn);
  190. mididx = p2m_mid_index(pfn);
  191. mid_mfn_p = p2m_top_mfn_p[topidx];
  192. ptep = lookup_address((unsigned long)(xen_p2m_addr + pfn),
  193. &level);
  194. BUG_ON(!ptep || level != PG_LEVEL_4K);
  195. mfn = pte_mfn(*ptep);
  196. ptep = (pte_t *)((unsigned long)ptep & ~(PAGE_SIZE - 1));
  197. /* Don't bother allocating any mfn mid levels if
  198. * they're just missing, just update the stored mfn,
  199. * since all could have changed over a migrate.
  200. */
  201. if (ptep == p2m_missing_pte || ptep == p2m_identity_pte) {
  202. BUG_ON(mididx);
  203. BUG_ON(mid_mfn_p != p2m_mid_missing_mfn);
  204. p2m_top_mfn[topidx] = virt_to_mfn(p2m_mid_missing_mfn);
  205. pfn += (P2M_MID_PER_PAGE - 1) * P2M_PER_PAGE;
  206. continue;
  207. }
  208. if (mid_mfn_p == p2m_mid_missing_mfn) {
  209. mid_mfn_p = alloc_p2m_page();
  210. p2m_mid_mfn_init(mid_mfn_p, p2m_missing);
  211. p2m_top_mfn_p[topidx] = mid_mfn_p;
  212. }
  213. p2m_top_mfn[topidx] = virt_to_mfn(mid_mfn_p);
  214. mid_mfn_p[mididx] = mfn;
  215. }
  216. }
  217. void xen_setup_mfn_list_list(void)
  218. {
  219. if (xen_feature(XENFEAT_auto_translated_physmap))
  220. return;
  221. BUG_ON(HYPERVISOR_shared_info == &xen_dummy_shared_info);
  222. HYPERVISOR_shared_info->arch.pfn_to_mfn_frame_list_list =
  223. virt_to_mfn(p2m_top_mfn);
  224. HYPERVISOR_shared_info->arch.max_pfn = xen_max_p2m_pfn;
  225. }
  226. /* Set up p2m_top to point to the domain-builder provided p2m pages */
  227. void __init xen_build_dynamic_phys_to_machine(void)
  228. {
  229. unsigned long pfn;
  230. if (xen_feature(XENFEAT_auto_translated_physmap))
  231. return;
  232. xen_p2m_addr = (unsigned long *)xen_start_info->mfn_list;
  233. xen_p2m_size = ALIGN(xen_start_info->nr_pages, P2M_PER_PAGE);
  234. for (pfn = xen_start_info->nr_pages; pfn < xen_p2m_size; pfn++)
  235. xen_p2m_addr[pfn] = INVALID_P2M_ENTRY;
  236. xen_max_p2m_pfn = xen_p2m_size;
  237. }
  238. #define P2M_TYPE_IDENTITY 0
  239. #define P2M_TYPE_MISSING 1
  240. #define P2M_TYPE_PFN 2
  241. #define P2M_TYPE_UNKNOWN 3
  242. static int xen_p2m_elem_type(unsigned long pfn)
  243. {
  244. unsigned long mfn;
  245. if (pfn >= xen_p2m_size)
  246. return P2M_TYPE_IDENTITY;
  247. mfn = xen_p2m_addr[pfn];
  248. if (mfn == INVALID_P2M_ENTRY)
  249. return P2M_TYPE_MISSING;
  250. if (mfn & IDENTITY_FRAME_BIT)
  251. return P2M_TYPE_IDENTITY;
  252. return P2M_TYPE_PFN;
  253. }
  254. static void __init xen_rebuild_p2m_list(unsigned long *p2m)
  255. {
  256. unsigned int i, chunk;
  257. unsigned long pfn;
  258. unsigned long *mfns;
  259. pte_t *ptep;
  260. pmd_t *pmdp;
  261. int type;
  262. p2m_missing = alloc_p2m_page();
  263. p2m_init(p2m_missing);
  264. p2m_identity = alloc_p2m_page();
  265. p2m_init(p2m_identity);
  266. p2m_missing_pte = alloc_p2m_page();
  267. paravirt_alloc_pte(&init_mm, __pa(p2m_missing_pte) >> PAGE_SHIFT);
  268. p2m_identity_pte = alloc_p2m_page();
  269. paravirt_alloc_pte(&init_mm, __pa(p2m_identity_pte) >> PAGE_SHIFT);
  270. for (i = 0; i < PTRS_PER_PTE; i++) {
  271. set_pte(p2m_missing_pte + i,
  272. pfn_pte(PFN_DOWN(__pa(p2m_missing)), PAGE_KERNEL_RO));
  273. set_pte(p2m_identity_pte + i,
  274. pfn_pte(PFN_DOWN(__pa(p2m_identity)), PAGE_KERNEL_RO));
  275. }
  276. for (pfn = 0; pfn < xen_max_p2m_pfn; pfn += chunk) {
  277. /*
  278. * Try to map missing/identity PMDs or p2m-pages if possible.
  279. * We have to respect the structure of the mfn_list_list
  280. * which will be built just afterwards.
  281. * Chunk size to test is one p2m page if we are in the middle
  282. * of a mfn_list_list mid page and the complete mid page area
  283. * if we are at index 0 of the mid page. Please note that a
  284. * mid page might cover more than one PMD, e.g. on 32 bit PAE
  285. * kernels.
  286. */
  287. chunk = (pfn & (P2M_PER_PAGE * P2M_MID_PER_PAGE - 1)) ?
  288. P2M_PER_PAGE : P2M_PER_PAGE * P2M_MID_PER_PAGE;
  289. type = xen_p2m_elem_type(pfn);
  290. i = 0;
  291. if (type != P2M_TYPE_PFN)
  292. for (i = 1; i < chunk; i++)
  293. if (xen_p2m_elem_type(pfn + i) != type)
  294. break;
  295. if (i < chunk)
  296. /* Reset to minimal chunk size. */
  297. chunk = P2M_PER_PAGE;
  298. if (type == P2M_TYPE_PFN || i < chunk) {
  299. /* Use initial p2m page contents. */
  300. #ifdef CONFIG_X86_64
  301. mfns = alloc_p2m_page();
  302. copy_page(mfns, xen_p2m_addr + pfn);
  303. #else
  304. mfns = xen_p2m_addr + pfn;
  305. #endif
  306. ptep = populate_extra_pte((unsigned long)(p2m + pfn));
  307. set_pte(ptep,
  308. pfn_pte(PFN_DOWN(__pa(mfns)), PAGE_KERNEL));
  309. continue;
  310. }
  311. if (chunk == P2M_PER_PAGE) {
  312. /* Map complete missing or identity p2m-page. */
  313. mfns = (type == P2M_TYPE_MISSING) ?
  314. p2m_missing : p2m_identity;
  315. ptep = populate_extra_pte((unsigned long)(p2m + pfn));
  316. set_pte(ptep,
  317. pfn_pte(PFN_DOWN(__pa(mfns)), PAGE_KERNEL_RO));
  318. continue;
  319. }
  320. /* Complete missing or identity PMD(s) can be mapped. */
  321. ptep = (type == P2M_TYPE_MISSING) ?
  322. p2m_missing_pte : p2m_identity_pte;
  323. for (i = 0; i < PMDS_PER_MID_PAGE; i++) {
  324. pmdp = populate_extra_pmd(
  325. (unsigned long)(p2m + pfn) + i * PMD_SIZE);
  326. set_pmd(pmdp, __pmd(__pa(ptep) | _KERNPG_TABLE));
  327. }
  328. }
  329. }
  330. void __init xen_vmalloc_p2m_tree(void)
  331. {
  332. static struct vm_struct vm;
  333. unsigned long p2m_limit;
  334. p2m_limit = (phys_addr_t)P2M_LIMIT * 1024 * 1024 * 1024 / PAGE_SIZE;
  335. vm.flags = VM_ALLOC;
  336. vm.size = ALIGN(sizeof(unsigned long) * max(xen_max_p2m_pfn, p2m_limit),
  337. PMD_SIZE * PMDS_PER_MID_PAGE);
  338. vm_area_register_early(&vm, PMD_SIZE * PMDS_PER_MID_PAGE);
  339. pr_notice("p2m virtual area at %p, size is %lx\n", vm.addr, vm.size);
  340. xen_max_p2m_pfn = vm.size / sizeof(unsigned long);
  341. xen_rebuild_p2m_list(vm.addr);
  342. xen_p2m_addr = vm.addr;
  343. xen_p2m_size = xen_max_p2m_pfn;
  344. xen_inv_extra_mem();
  345. }
  346. unsigned long get_phys_to_machine(unsigned long pfn)
  347. {
  348. pte_t *ptep;
  349. unsigned int level;
  350. if (unlikely(pfn >= xen_p2m_size)) {
  351. if (pfn < xen_max_p2m_pfn)
  352. return xen_chk_extra_mem(pfn);
  353. return IDENTITY_FRAME(pfn);
  354. }
  355. ptep = lookup_address((unsigned long)(xen_p2m_addr + pfn), &level);
  356. BUG_ON(!ptep || level != PG_LEVEL_4K);
  357. /*
  358. * The INVALID_P2M_ENTRY is filled in both p2m_*identity
  359. * and in p2m_*missing, so returning the INVALID_P2M_ENTRY
  360. * would be wrong.
  361. */
  362. if (pte_pfn(*ptep) == PFN_DOWN(__pa(p2m_identity)))
  363. return IDENTITY_FRAME(pfn);
  364. return xen_p2m_addr[pfn];
  365. }
  366. EXPORT_SYMBOL_GPL(get_phys_to_machine);
  367. /*
  368. * Allocate new pmd(s). It is checked whether the old pmd is still in place.
  369. * If not, nothing is changed. This is okay as the only reason for allocating
  370. * a new pmd is to replace p2m_missing_pte or p2m_identity_pte by a individual
  371. * pmd. In case of PAE/x86-32 there are multiple pmds to allocate!
  372. */
  373. static pte_t *alloc_p2m_pmd(unsigned long addr, pte_t *pte_pg)
  374. {
  375. pte_t *ptechk;
  376. pte_t *pte_newpg[PMDS_PER_MID_PAGE];
  377. pmd_t *pmdp;
  378. unsigned int level;
  379. unsigned long flags;
  380. unsigned long vaddr;
  381. int i;
  382. /* Do all allocations first to bail out in error case. */
  383. for (i = 0; i < PMDS_PER_MID_PAGE; i++) {
  384. pte_newpg[i] = alloc_p2m_page();
  385. if (!pte_newpg[i]) {
  386. for (i--; i >= 0; i--)
  387. free_p2m_page(pte_newpg[i]);
  388. return NULL;
  389. }
  390. }
  391. vaddr = addr & ~(PMD_SIZE * PMDS_PER_MID_PAGE - 1);
  392. for (i = 0; i < PMDS_PER_MID_PAGE; i++) {
  393. copy_page(pte_newpg[i], pte_pg);
  394. paravirt_alloc_pte(&init_mm, __pa(pte_newpg[i]) >> PAGE_SHIFT);
  395. pmdp = lookup_pmd_address(vaddr);
  396. BUG_ON(!pmdp);
  397. spin_lock_irqsave(&p2m_update_lock, flags);
  398. ptechk = lookup_address(vaddr, &level);
  399. if (ptechk == pte_pg) {
  400. set_pmd(pmdp,
  401. __pmd(__pa(pte_newpg[i]) | _KERNPG_TABLE));
  402. pte_newpg[i] = NULL;
  403. }
  404. spin_unlock_irqrestore(&p2m_update_lock, flags);
  405. if (pte_newpg[i]) {
  406. paravirt_release_pte(__pa(pte_newpg[i]) >> PAGE_SHIFT);
  407. free_p2m_page(pte_newpg[i]);
  408. }
  409. vaddr += PMD_SIZE;
  410. }
  411. return lookup_address(addr, &level);
  412. }
  413. /*
  414. * Fully allocate the p2m structure for a given pfn. We need to check
  415. * that both the top and mid levels are allocated, and make sure the
  416. * parallel mfn tree is kept in sync. We may race with other cpus, so
  417. * the new pages are installed with cmpxchg; if we lose the race then
  418. * simply free the page we allocated and use the one that's there.
  419. */
  420. static bool alloc_p2m(unsigned long pfn)
  421. {
  422. unsigned topidx, mididx;
  423. unsigned long *top_mfn_p, *mid_mfn;
  424. pte_t *ptep, *pte_pg;
  425. unsigned int level;
  426. unsigned long flags;
  427. unsigned long addr = (unsigned long)(xen_p2m_addr + pfn);
  428. unsigned long p2m_pfn;
  429. topidx = p2m_top_index(pfn);
  430. mididx = p2m_mid_index(pfn);
  431. ptep = lookup_address(addr, &level);
  432. BUG_ON(!ptep || level != PG_LEVEL_4K);
  433. pte_pg = (pte_t *)((unsigned long)ptep & ~(PAGE_SIZE - 1));
  434. if (pte_pg == p2m_missing_pte || pte_pg == p2m_identity_pte) {
  435. /* PMD level is missing, allocate a new one */
  436. ptep = alloc_p2m_pmd(addr, pte_pg);
  437. if (!ptep)
  438. return false;
  439. }
  440. if (p2m_top_mfn) {
  441. top_mfn_p = &p2m_top_mfn[topidx];
  442. mid_mfn = ACCESS_ONCE(p2m_top_mfn_p[topidx]);
  443. BUG_ON(virt_to_mfn(mid_mfn) != *top_mfn_p);
  444. if (mid_mfn == p2m_mid_missing_mfn) {
  445. /* Separately check the mid mfn level */
  446. unsigned long missing_mfn;
  447. unsigned long mid_mfn_mfn;
  448. unsigned long old_mfn;
  449. mid_mfn = alloc_p2m_page();
  450. if (!mid_mfn)
  451. return false;
  452. p2m_mid_mfn_init(mid_mfn, p2m_missing);
  453. missing_mfn = virt_to_mfn(p2m_mid_missing_mfn);
  454. mid_mfn_mfn = virt_to_mfn(mid_mfn);
  455. old_mfn = cmpxchg(top_mfn_p, missing_mfn, mid_mfn_mfn);
  456. if (old_mfn != missing_mfn) {
  457. free_p2m_page(mid_mfn);
  458. mid_mfn = mfn_to_virt(old_mfn);
  459. } else {
  460. p2m_top_mfn_p[topidx] = mid_mfn;
  461. }
  462. }
  463. } else {
  464. mid_mfn = NULL;
  465. }
  466. p2m_pfn = pte_pfn(READ_ONCE(*ptep));
  467. if (p2m_pfn == PFN_DOWN(__pa(p2m_identity)) ||
  468. p2m_pfn == PFN_DOWN(__pa(p2m_missing))) {
  469. /* p2m leaf page is missing */
  470. unsigned long *p2m;
  471. p2m = alloc_p2m_page();
  472. if (!p2m)
  473. return false;
  474. if (p2m_pfn == PFN_DOWN(__pa(p2m_missing)))
  475. p2m_init(p2m);
  476. else
  477. p2m_init_identity(p2m, pfn & ~(P2M_PER_PAGE - 1));
  478. spin_lock_irqsave(&p2m_update_lock, flags);
  479. if (pte_pfn(*ptep) == p2m_pfn) {
  480. set_pte(ptep,
  481. pfn_pte(PFN_DOWN(__pa(p2m)), PAGE_KERNEL));
  482. if (mid_mfn)
  483. mid_mfn[mididx] = virt_to_mfn(p2m);
  484. p2m = NULL;
  485. }
  486. spin_unlock_irqrestore(&p2m_update_lock, flags);
  487. if (p2m)
  488. free_p2m_page(p2m);
  489. }
  490. return true;
  491. }
  492. unsigned long __init set_phys_range_identity(unsigned long pfn_s,
  493. unsigned long pfn_e)
  494. {
  495. unsigned long pfn;
  496. if (unlikely(pfn_s >= xen_p2m_size))
  497. return 0;
  498. if (unlikely(xen_feature(XENFEAT_auto_translated_physmap)))
  499. return pfn_e - pfn_s;
  500. if (pfn_s > pfn_e)
  501. return 0;
  502. if (pfn_e > xen_p2m_size)
  503. pfn_e = xen_p2m_size;
  504. for (pfn = pfn_s; pfn < pfn_e; pfn++)
  505. xen_p2m_addr[pfn] = IDENTITY_FRAME(pfn);
  506. return pfn - pfn_s;
  507. }
  508. bool __set_phys_to_machine(unsigned long pfn, unsigned long mfn)
  509. {
  510. pte_t *ptep;
  511. unsigned int level;
  512. /* don't track P2M changes in autotranslate guests */
  513. if (unlikely(xen_feature(XENFEAT_auto_translated_physmap)))
  514. return true;
  515. if (unlikely(pfn >= xen_p2m_size)) {
  516. BUG_ON(mfn != INVALID_P2M_ENTRY);
  517. return true;
  518. }
  519. if (likely(!xen_safe_write_ulong(xen_p2m_addr + pfn, mfn)))
  520. return true;
  521. ptep = lookup_address((unsigned long)(xen_p2m_addr + pfn), &level);
  522. BUG_ON(!ptep || level != PG_LEVEL_4K);
  523. if (pte_pfn(*ptep) == PFN_DOWN(__pa(p2m_missing)))
  524. return mfn == INVALID_P2M_ENTRY;
  525. if (pte_pfn(*ptep) == PFN_DOWN(__pa(p2m_identity)))
  526. return mfn == IDENTITY_FRAME(pfn);
  527. return false;
  528. }
  529. bool set_phys_to_machine(unsigned long pfn, unsigned long mfn)
  530. {
  531. if (unlikely(!__set_phys_to_machine(pfn, mfn))) {
  532. if (!alloc_p2m(pfn))
  533. return false;
  534. return __set_phys_to_machine(pfn, mfn);
  535. }
  536. return true;
  537. }
  538. int set_foreign_p2m_mapping(struct gnttab_map_grant_ref *map_ops,
  539. struct gnttab_map_grant_ref *kmap_ops,
  540. struct page **pages, unsigned int count)
  541. {
  542. int i, ret = 0;
  543. pte_t *pte;
  544. if (xen_feature(XENFEAT_auto_translated_physmap))
  545. return 0;
  546. if (kmap_ops) {
  547. ret = HYPERVISOR_grant_table_op(GNTTABOP_map_grant_ref,
  548. kmap_ops, count);
  549. if (ret)
  550. goto out;
  551. }
  552. for (i = 0; i < count; i++) {
  553. unsigned long mfn, pfn;
  554. /* Do not add to override if the map failed. */
  555. if (map_ops[i].status)
  556. continue;
  557. if (map_ops[i].flags & GNTMAP_contains_pte) {
  558. pte = (pte_t *)(mfn_to_virt(PFN_DOWN(map_ops[i].host_addr)) +
  559. (map_ops[i].host_addr & ~PAGE_MASK));
  560. mfn = pte_mfn(*pte);
  561. } else {
  562. mfn = PFN_DOWN(map_ops[i].dev_bus_addr);
  563. }
  564. pfn = page_to_pfn(pages[i]);
  565. WARN(pfn_to_mfn(pfn) != INVALID_P2M_ENTRY, "page must be ballooned");
  566. if (unlikely(!set_phys_to_machine(pfn, FOREIGN_FRAME(mfn)))) {
  567. ret = -ENOMEM;
  568. goto out;
  569. }
  570. }
  571. out:
  572. return ret;
  573. }
  574. EXPORT_SYMBOL_GPL(set_foreign_p2m_mapping);
  575. int clear_foreign_p2m_mapping(struct gnttab_unmap_grant_ref *unmap_ops,
  576. struct gnttab_unmap_grant_ref *kunmap_ops,
  577. struct page **pages, unsigned int count)
  578. {
  579. int i, ret = 0;
  580. if (xen_feature(XENFEAT_auto_translated_physmap))
  581. return 0;
  582. for (i = 0; i < count; i++) {
  583. unsigned long mfn = __pfn_to_mfn(page_to_pfn(pages[i]));
  584. unsigned long pfn = page_to_pfn(pages[i]);
  585. if (mfn == INVALID_P2M_ENTRY || !(mfn & FOREIGN_FRAME_BIT)) {
  586. ret = -EINVAL;
  587. goto out;
  588. }
  589. set_phys_to_machine(pfn, INVALID_P2M_ENTRY);
  590. }
  591. if (kunmap_ops)
  592. ret = HYPERVISOR_grant_table_op(GNTTABOP_unmap_grant_ref,
  593. kunmap_ops, count);
  594. out:
  595. return ret;
  596. }
  597. EXPORT_SYMBOL_GPL(clear_foreign_p2m_mapping);
  598. #ifdef CONFIG_XEN_DEBUG_FS
  599. #include <linux/debugfs.h>
  600. #include "debugfs.h"
  601. static int p2m_dump_show(struct seq_file *m, void *v)
  602. {
  603. static const char * const type_name[] = {
  604. [P2M_TYPE_IDENTITY] = "identity",
  605. [P2M_TYPE_MISSING] = "missing",
  606. [P2M_TYPE_PFN] = "pfn",
  607. [P2M_TYPE_UNKNOWN] = "abnormal"};
  608. unsigned long pfn, first_pfn;
  609. int type, prev_type;
  610. prev_type = xen_p2m_elem_type(0);
  611. first_pfn = 0;
  612. for (pfn = 0; pfn < xen_p2m_size; pfn++) {
  613. type = xen_p2m_elem_type(pfn);
  614. if (type != prev_type) {
  615. seq_printf(m, " [0x%lx->0x%lx] %s\n", first_pfn, pfn,
  616. type_name[prev_type]);
  617. prev_type = type;
  618. first_pfn = pfn;
  619. }
  620. }
  621. seq_printf(m, " [0x%lx->0x%lx] %s\n", first_pfn, pfn,
  622. type_name[prev_type]);
  623. return 0;
  624. }
  625. static int p2m_dump_open(struct inode *inode, struct file *filp)
  626. {
  627. return single_open(filp, p2m_dump_show, NULL);
  628. }
  629. static const struct file_operations p2m_dump_fops = {
  630. .open = p2m_dump_open,
  631. .read = seq_read,
  632. .llseek = seq_lseek,
  633. .release = single_release,
  634. };
  635. static struct dentry *d_mmu_debug;
  636. static int __init xen_p2m_debugfs(void)
  637. {
  638. struct dentry *d_xen = xen_init_debugfs();
  639. if (d_xen == NULL)
  640. return -ENOMEM;
  641. d_mmu_debug = debugfs_create_dir("mmu", d_xen);
  642. debugfs_create_file("p2m", 0600, d_mmu_debug, NULL, &p2m_dump_fops);
  643. return 0;
  644. }
  645. fs_initcall(xen_p2m_debugfs);
  646. #endif /* CONFIG_XEN_DEBUG_FS */