p2m.c 22 KB

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