p2m.c 20 KB

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