1 // SPDX-License-Identifier: GPL-2.0-only
4 * Copyright 2016 Paul Mackerras, IBM Corp. <paulus@au1.ibm.com>
7 #include <linux/types.h>
8 #include <linux/string.h>
10 #include <linux/kvm_host.h>
11 #include <linux/anon_inodes.h>
12 #include <linux/file.h>
13 #include <linux/debugfs.h>
15 #include <asm/kvm_ppc.h>
16 #include <asm/kvm_book3s.h>
19 #include <linux/pgtable.h>
20 #include <asm/pgalloc.h>
21 #include <asm/pte-walk.h>
22 #include <asm/ultravisor.h>
23 #include <asm/kvm_book3s_uvmem.h>
26 * Supported radix tree geometry.
27 * Like p9, we support either 5 or 9 bits at the first (lowest) level,
28 * for a page size of 64k or 4k.
30 static int p9_supported_radix_bits[4] = { 5, 9, 9, 13 };
32 unsigned long __kvmhv_copy_tofrom_guest_radix(int lpid, int pid,
33 gva_t eaddr, void *to, void *from,
36 int uninitialized_var(old_pid), old_lpid;
37 unsigned long quadrant, ret = n;
40 /* Can't access quadrants 1 or 2 in non-HV mode, call the HV to do it */
41 if (kvmhv_on_pseries())
42 return plpar_hcall_norets(H_COPY_TOFROM_GUEST, lpid, pid, eaddr,
43 __pa(to), __pa(from), n);
49 from = (void *) (eaddr | (quadrant << 62));
51 to = (void *) (eaddr | (quadrant << 62));
55 /* switch the lpid first to avoid running host with unallocated pid */
56 old_lpid = mfspr(SPRN_LPID);
58 mtspr(SPRN_LPID, lpid);
60 old_pid = mfspr(SPRN_PID);
67 ret = probe_user_read(to, (const void __user *)from, n);
69 ret = probe_user_write((void __user *)to, from, n);
71 /* switch the pid first to avoid running host with unallocated pid */
72 if (quadrant == 1 && pid != old_pid)
73 mtspr(SPRN_PID, old_pid);
75 mtspr(SPRN_LPID, old_lpid);
82 EXPORT_SYMBOL_GPL(__kvmhv_copy_tofrom_guest_radix);
84 static long kvmhv_copy_tofrom_guest_radix(struct kvm_vcpu *vcpu, gva_t eaddr,
85 void *to, void *from, unsigned long n)
87 int lpid = vcpu->kvm->arch.lpid;
88 int pid = vcpu->arch.pid;
90 /* This would cause a data segment intr so don't allow the access */
91 if (eaddr & (0x3FFUL << 52))
94 /* Should we be using the nested lpid */
95 if (vcpu->arch.nested)
96 lpid = vcpu->arch.nested->shadow_lpid;
98 /* If accessing quadrant 3 then pid is expected to be 0 */
99 if (((eaddr >> 62) & 0x3) == 0x3)
102 eaddr &= ~(0xFFFUL << 52);
104 return __kvmhv_copy_tofrom_guest_radix(lpid, pid, eaddr, to, from, n);
107 long kvmhv_copy_from_guest_radix(struct kvm_vcpu *vcpu, gva_t eaddr, void *to,
112 ret = kvmhv_copy_tofrom_guest_radix(vcpu, eaddr, to, NULL, n);
114 memset(to + (n - ret), 0, ret);
118 EXPORT_SYMBOL_GPL(kvmhv_copy_from_guest_radix);
120 long kvmhv_copy_to_guest_radix(struct kvm_vcpu *vcpu, gva_t eaddr, void *from,
123 return kvmhv_copy_tofrom_guest_radix(vcpu, eaddr, NULL, from, n);
125 EXPORT_SYMBOL_GPL(kvmhv_copy_to_guest_radix);
127 int kvmppc_mmu_walk_radix_tree(struct kvm_vcpu *vcpu, gva_t eaddr,
128 struct kvmppc_pte *gpte, u64 root,
131 struct kvm *kvm = vcpu->kvm;
133 unsigned long rts, bits, offset, index;
137 rts = ((root & RTS1_MASK) >> (RTS1_SHIFT - 3)) |
138 ((root & RTS2_MASK) >> RTS2_SHIFT);
139 bits = root & RPDS_MASK;
140 base = root & RPDB_MASK;
144 /* Current implementations only support 52-bit space */
148 /* Walk each level of the radix tree */
149 for (level = 3; level >= 0; --level) {
151 /* Check a valid size */
152 if (level && bits != p9_supported_radix_bits[level])
154 if (level == 0 && !(bits == 5 || bits == 9))
157 index = (eaddr >> offset) & ((1UL << bits) - 1);
158 /* Check that low bits of page table base are zero */
159 if (base & ((1UL << (bits + 3)) - 1))
161 /* Read the entry from guest memory */
162 addr = base + (index * sizeof(rpte));
163 ret = kvm_read_guest(kvm, addr, &rpte, sizeof(rpte));
169 pte = __be64_to_cpu(rpte);
170 if (!(pte & _PAGE_PRESENT))
172 /* Check if a leaf entry */
175 /* Get ready to walk the next level */
176 base = pte & RPDB_MASK;
177 bits = pte & RPDS_MASK;
180 /* Need a leaf at lowest level; 512GB pages not supported */
181 if (level < 0 || level == 3)
184 /* We found a valid leaf PTE */
185 /* Offset is now log base 2 of the page size */
186 gpa = pte & 0x01fffffffffff000ul;
187 if (gpa & ((1ul << offset) - 1))
189 gpa |= eaddr & ((1ul << offset) - 1);
190 for (ps = MMU_PAGE_4K; ps < MMU_PAGE_COUNT; ++ps)
191 if (offset == mmu_psize_defs[ps].shift)
193 gpte->page_size = ps;
194 gpte->page_shift = offset;
199 /* Work out permissions */
200 gpte->may_read = !!(pte & _PAGE_READ);
201 gpte->may_write = !!(pte & _PAGE_WRITE);
202 gpte->may_execute = !!(pte & _PAGE_EXEC);
204 gpte->rc = pte & (_PAGE_ACCESSED | _PAGE_DIRTY);
213 * Used to walk a partition or process table radix tree in guest memory
214 * Note: We exploit the fact that a partition table and a process
215 * table have the same layout, a partition-scoped page table and a
216 * process-scoped page table have the same layout, and the 2nd
217 * doubleword of a partition table entry has the same layout as
220 int kvmppc_mmu_radix_translate_table(struct kvm_vcpu *vcpu, gva_t eaddr,
221 struct kvmppc_pte *gpte, u64 table,
222 int table_index, u64 *pte_ret_p)
224 struct kvm *kvm = vcpu->kvm;
226 unsigned long size, ptbl, root;
227 struct prtb_entry entry;
229 if ((table & PRTS_MASK) > 24)
231 size = 1ul << ((table & PRTS_MASK) + 12);
233 /* Is the table big enough to contain this entry? */
234 if ((table_index * sizeof(entry)) >= size)
237 /* Read the table to find the root of the radix tree */
238 ptbl = (table & PRTB_MASK) + (table_index * sizeof(entry));
239 ret = kvm_read_guest(kvm, ptbl, &entry, sizeof(entry));
243 /* Root is stored in the first double word */
244 root = be64_to_cpu(entry.prtb0);
246 return kvmppc_mmu_walk_radix_tree(vcpu, eaddr, gpte, root, pte_ret_p);
249 int kvmppc_mmu_radix_xlate(struct kvm_vcpu *vcpu, gva_t eaddr,
250 struct kvmppc_pte *gpte, bool data, bool iswrite)
256 /* Work out effective PID */
257 switch (eaddr >> 62) {
259 pid = vcpu->arch.pid;
268 ret = kvmppc_mmu_radix_translate_table(vcpu, eaddr, gpte,
269 vcpu->kvm->arch.process_table, pid, &pte);
273 /* Check privilege (applies only to process scoped translations) */
274 if (kvmppc_get_msr(vcpu) & MSR_PR) {
275 if (pte & _PAGE_PRIVILEGED) {
278 gpte->may_execute = 0;
281 if (!(pte & _PAGE_PRIVILEGED)) {
282 /* Check AMR/IAMR to see if strict mode is in force */
283 if (vcpu->arch.amr & (1ul << 62))
285 if (vcpu->arch.amr & (1ul << 63))
287 if (vcpu->arch.iamr & (1ul << 62))
288 gpte->may_execute = 0;
295 void kvmppc_radix_tlbie_page(struct kvm *kvm, unsigned long addr,
296 unsigned int pshift, unsigned int lpid)
298 unsigned long psize = PAGE_SIZE;
304 psize = 1UL << pshift;
308 addr &= ~(psize - 1);
310 if (!kvmhv_on_pseries()) {
311 radix__flush_tlb_lpid_page(lpid, addr, psize);
315 psi = shift_to_mmu_psize(pshift);
316 rb = addr | (mmu_get_ap(psi) << PPC_BITLSHIFT(58));
317 rc = plpar_hcall_norets(H_TLB_INVALIDATE, H_TLBIE_P1_ENC(0, 0, 1),
320 pr_err("KVM: TLB page invalidation hcall failed, rc=%ld\n", rc);
323 static void kvmppc_radix_flush_pwc(struct kvm *kvm, unsigned int lpid)
327 if (!kvmhv_on_pseries()) {
328 radix__flush_pwc_lpid(lpid);
332 rc = plpar_hcall_norets(H_TLB_INVALIDATE, H_TLBIE_P1_ENC(1, 0, 1),
333 lpid, TLBIEL_INVAL_SET_LPID);
335 pr_err("KVM: TLB PWC invalidation hcall failed, rc=%ld\n", rc);
338 static unsigned long kvmppc_radix_update_pte(struct kvm *kvm, pte_t *ptep,
339 unsigned long clr, unsigned long set,
340 unsigned long addr, unsigned int shift)
342 return __radix_pte_update(ptep, clr, set);
345 void kvmppc_radix_set_pte_at(struct kvm *kvm, unsigned long addr,
346 pte_t *ptep, pte_t pte)
348 radix__set_pte_at(kvm->mm, addr, ptep, pte, 0);
351 static struct kmem_cache *kvm_pte_cache;
352 static struct kmem_cache *kvm_pmd_cache;
354 static pte_t *kvmppc_pte_alloc(void)
356 return kmem_cache_alloc(kvm_pte_cache, GFP_KERNEL);
359 static void kvmppc_pte_free(pte_t *ptep)
361 kmem_cache_free(kvm_pte_cache, ptep);
364 static pmd_t *kvmppc_pmd_alloc(void)
366 return kmem_cache_alloc(kvm_pmd_cache, GFP_KERNEL);
369 static void kvmppc_pmd_free(pmd_t *pmdp)
371 kmem_cache_free(kvm_pmd_cache, pmdp);
374 /* Called with kvm->mmu_lock held */
375 void kvmppc_unmap_pte(struct kvm *kvm, pte_t *pte, unsigned long gpa,
377 const struct kvm_memory_slot *memslot,
382 unsigned long gfn = gpa >> PAGE_SHIFT;
383 unsigned long page_size = PAGE_SIZE;
386 old = kvmppc_radix_update_pte(kvm, pte, ~0UL, 0, gpa, shift);
387 kvmppc_radix_tlbie_page(kvm, gpa, shift, lpid);
389 /* The following only applies to L1 entries */
390 if (lpid != kvm->arch.lpid)
394 memslot = gfn_to_memslot(kvm, gfn);
398 if (shift) { /* 1GB or 2MB page */
399 page_size = 1ul << shift;
400 if (shift == PMD_SHIFT)
401 kvm->stat.num_2M_pages--;
402 else if (shift == PUD_SHIFT)
403 kvm->stat.num_1G_pages--;
406 gpa &= ~(page_size - 1);
407 hpa = old & PTE_RPN_MASK;
408 kvmhv_remove_nest_rmap_range(kvm, memslot, gpa, hpa, page_size);
410 if ((old & _PAGE_DIRTY) && memslot->dirty_bitmap)
411 kvmppc_update_dirty_map(memslot, gfn, page_size);
415 * kvmppc_free_p?d are used to free existing page tables, and recursively
416 * descend and clear and free children.
417 * Callers are responsible for flushing the PWC.
419 * When page tables are being unmapped/freed as part of page fault path
420 * (full == false), ptes are not expected. There is code to unmap them
421 * and emit a warning if encountered, but there may already be data
422 * corruption due to the unexpected mappings.
424 static void kvmppc_unmap_free_pte(struct kvm *kvm, pte_t *pte, bool full,
428 memset(pte, 0, sizeof(long) << RADIX_PTE_INDEX_SIZE);
433 for (it = 0; it < PTRS_PER_PTE; ++it, ++p) {
434 if (pte_val(*p) == 0)
437 kvmppc_unmap_pte(kvm, p,
438 pte_pfn(*p) << PAGE_SHIFT,
439 PAGE_SHIFT, NULL, lpid);
443 kvmppc_pte_free(pte);
446 static void kvmppc_unmap_free_pmd(struct kvm *kvm, pmd_t *pmd, bool full,
452 for (im = 0; im < PTRS_PER_PMD; ++im, ++p) {
453 if (!pmd_present(*p))
455 if (pmd_is_leaf(*p)) {
460 kvmppc_unmap_pte(kvm, (pte_t *)p,
461 pte_pfn(*(pte_t *)p) << PAGE_SHIFT,
462 PMD_SHIFT, NULL, lpid);
467 pte = pte_offset_map(p, 0);
468 kvmppc_unmap_free_pte(kvm, pte, full, lpid);
472 kvmppc_pmd_free(pmd);
475 static void kvmppc_unmap_free_pud(struct kvm *kvm, pud_t *pud,
481 for (iu = 0; iu < PTRS_PER_PUD; ++iu, ++p) {
482 if (!pud_present(*p))
484 if (pud_is_leaf(*p)) {
489 pmd = pmd_offset(p, 0);
490 kvmppc_unmap_free_pmd(kvm, pmd, true, lpid);
494 pud_free(kvm->mm, pud);
497 void kvmppc_free_pgtable_radix(struct kvm *kvm, pgd_t *pgd, unsigned int lpid)
501 for (ig = 0; ig < PTRS_PER_PGD; ++ig, ++pgd) {
502 p4d_t *p4d = p4d_offset(pgd, 0);
505 if (!p4d_present(*p4d))
507 pud = pud_offset(p4d, 0);
508 kvmppc_unmap_free_pud(kvm, pud, lpid);
513 void kvmppc_free_radix(struct kvm *kvm)
515 if (kvm->arch.pgtable) {
516 kvmppc_free_pgtable_radix(kvm, kvm->arch.pgtable,
518 pgd_free(kvm->mm, kvm->arch.pgtable);
519 kvm->arch.pgtable = NULL;
523 static void kvmppc_unmap_free_pmd_entry_table(struct kvm *kvm, pmd_t *pmd,
524 unsigned long gpa, unsigned int lpid)
526 pte_t *pte = pte_offset_kernel(pmd, 0);
529 * Clearing the pmd entry then flushing the PWC ensures that the pte
530 * page no longer be cached by the MMU, so can be freed without
531 * flushing the PWC again.
534 kvmppc_radix_flush_pwc(kvm, lpid);
536 kvmppc_unmap_free_pte(kvm, pte, false, lpid);
539 static void kvmppc_unmap_free_pud_entry_table(struct kvm *kvm, pud_t *pud,
540 unsigned long gpa, unsigned int lpid)
542 pmd_t *pmd = pmd_offset(pud, 0);
545 * Clearing the pud entry then flushing the PWC ensures that the pmd
546 * page and any children pte pages will no longer be cached by the MMU,
547 * so can be freed without flushing the PWC again.
550 kvmppc_radix_flush_pwc(kvm, lpid);
552 kvmppc_unmap_free_pmd(kvm, pmd, false, lpid);
556 * There are a number of bits which may differ between different faults to
557 * the same partition scope entry. RC bits, in the course of cleaning and
558 * aging. And the write bit can change, either the access could have been
559 * upgraded, or a read fault could happen concurrently with a write fault
560 * that sets those bits first.
562 #define PTE_BITS_MUST_MATCH (~(_PAGE_WRITE | _PAGE_DIRTY | _PAGE_ACCESSED))
564 int kvmppc_create_pte(struct kvm *kvm, pgd_t *pgtable, pte_t pte,
565 unsigned long gpa, unsigned int level,
566 unsigned long mmu_seq, unsigned int lpid,
567 unsigned long *rmapp, struct rmap_nested **n_rmap)
571 pud_t *pud, *new_pud = NULL;
572 pmd_t *pmd, *new_pmd = NULL;
573 pte_t *ptep, *new_ptep = NULL;
576 /* Traverse the guest's 2nd-level tree, allocate new levels needed */
577 pgd = pgtable + pgd_index(gpa);
578 p4d = p4d_offset(pgd, gpa);
581 if (p4d_present(*p4d))
582 pud = pud_offset(p4d, gpa);
584 new_pud = pud_alloc_one(kvm->mm, gpa);
587 if (pud && pud_present(*pud) && !pud_is_leaf(*pud))
588 pmd = pmd_offset(pud, gpa);
590 new_pmd = kvmppc_pmd_alloc();
592 if (level == 0 && !(pmd && pmd_present(*pmd) && !pmd_is_leaf(*pmd)))
593 new_ptep = kvmppc_pte_alloc();
595 /* Check if we might have been invalidated; let the guest retry if so */
596 spin_lock(&kvm->mmu_lock);
598 if (mmu_notifier_retry(kvm, mmu_seq))
601 /* Now traverse again under the lock and change the tree */
603 if (p4d_none(*p4d)) {
606 p4d_populate(kvm->mm, p4d, new_pud);
609 pud = pud_offset(p4d, gpa);
610 if (pud_is_leaf(*pud)) {
611 unsigned long hgpa = gpa & PUD_MASK;
613 /* Check if we raced and someone else has set the same thing */
615 if (pud_raw(*pud) == pte_raw(pte)) {
619 /* Valid 1GB page here already, add our extra bits */
620 WARN_ON_ONCE((pud_val(*pud) ^ pte_val(pte)) &
621 PTE_BITS_MUST_MATCH);
622 kvmppc_radix_update_pte(kvm, (pte_t *)pud,
623 0, pte_val(pte), hgpa, PUD_SHIFT);
628 * If we raced with another CPU which has just put
629 * a 1GB pte in after we saw a pmd page, try again.
635 /* Valid 1GB page here already, remove it */
636 kvmppc_unmap_pte(kvm, (pte_t *)pud, hgpa, PUD_SHIFT, NULL,
640 if (!pud_none(*pud)) {
642 * There's a page table page here, but we wanted to
643 * install a large page, so remove and free the page
646 kvmppc_unmap_free_pud_entry_table(kvm, pud, gpa, lpid);
648 kvmppc_radix_set_pte_at(kvm, gpa, (pte_t *)pud, pte);
650 kvmhv_insert_nest_rmap(kvm, rmapp, n_rmap);
654 if (pud_none(*pud)) {
657 pud_populate(kvm->mm, pud, new_pmd);
660 pmd = pmd_offset(pud, gpa);
661 if (pmd_is_leaf(*pmd)) {
662 unsigned long lgpa = gpa & PMD_MASK;
664 /* Check if we raced and someone else has set the same thing */
666 if (pmd_raw(*pmd) == pte_raw(pte)) {
670 /* Valid 2MB page here already, add our extra bits */
671 WARN_ON_ONCE((pmd_val(*pmd) ^ pte_val(pte)) &
672 PTE_BITS_MUST_MATCH);
673 kvmppc_radix_update_pte(kvm, pmdp_ptep(pmd),
674 0, pte_val(pte), lgpa, PMD_SHIFT);
680 * If we raced with another CPU which has just put
681 * a 2MB pte in after we saw a pte page, try again.
687 /* Valid 2MB page here already, remove it */
688 kvmppc_unmap_pte(kvm, pmdp_ptep(pmd), lgpa, PMD_SHIFT, NULL,
692 if (!pmd_none(*pmd)) {
694 * There's a page table page here, but we wanted to
695 * install a large page, so remove and free the page
698 kvmppc_unmap_free_pmd_entry_table(kvm, pmd, gpa, lpid);
700 kvmppc_radix_set_pte_at(kvm, gpa, pmdp_ptep(pmd), pte);
702 kvmhv_insert_nest_rmap(kvm, rmapp, n_rmap);
706 if (pmd_none(*pmd)) {
709 pmd_populate(kvm->mm, pmd, new_ptep);
712 ptep = pte_offset_kernel(pmd, gpa);
713 if (pte_present(*ptep)) {
714 /* Check if someone else set the same thing */
715 if (pte_raw(*ptep) == pte_raw(pte)) {
719 /* Valid page here already, add our extra bits */
720 WARN_ON_ONCE((pte_val(*ptep) ^ pte_val(pte)) &
721 PTE_BITS_MUST_MATCH);
722 kvmppc_radix_update_pte(kvm, ptep, 0, pte_val(pte), gpa, 0);
726 kvmppc_radix_set_pte_at(kvm, gpa, ptep, pte);
728 kvmhv_insert_nest_rmap(kvm, rmapp, n_rmap);
732 spin_unlock(&kvm->mmu_lock);
734 pud_free(kvm->mm, new_pud);
736 kvmppc_pmd_free(new_pmd);
738 kvmppc_pte_free(new_ptep);
742 bool kvmppc_hv_handle_set_rc(struct kvm *kvm, bool nested, bool writing,
743 unsigned long gpa, unsigned int lpid)
745 unsigned long pgflags;
750 * Need to set an R or C bit in the 2nd-level tables;
751 * since we are just helping out the hardware here,
752 * it is sufficient to do what the hardware does.
754 pgflags = _PAGE_ACCESSED;
756 pgflags |= _PAGE_DIRTY;
759 ptep = find_kvm_nested_guest_pte(kvm, lpid, gpa, &shift);
761 ptep = find_kvm_secondary_pte(kvm, gpa, &shift);
763 if (ptep && pte_present(*ptep) && (!writing || pte_write(*ptep))) {
764 kvmppc_radix_update_pte(kvm, ptep, 0, pgflags, gpa, shift);
770 int kvmppc_book3s_instantiate_page(struct kvm_vcpu *vcpu,
772 struct kvm_memory_slot *memslot,
773 bool writing, bool kvm_ro,
774 pte_t *inserted_pte, unsigned int *levelp)
776 struct kvm *kvm = vcpu->kvm;
777 struct page *page = NULL;
778 unsigned long mmu_seq;
779 unsigned long hva, gfn = gpa >> PAGE_SHIFT;
780 bool upgrade_write = false;
781 bool *upgrade_p = &upgrade_write;
783 unsigned int shift, level;
787 /* used to check for invalidations in progress */
788 mmu_seq = kvm->mmu_notifier_seq;
792 * Do a fast check first, since __gfn_to_pfn_memslot doesn't
793 * do it with !atomic && !async, which is how we call it.
794 * We always ask for write permission since the common case
795 * is that the page is writable.
797 hva = gfn_to_hva_memslot(memslot, gfn);
798 if (!kvm_ro && get_user_page_fast_only(hva, FOLL_WRITE, &page)) {
799 upgrade_write = true;
803 /* Call KVM generic code to do the slow-path check */
804 pfn = __gfn_to_pfn_memslot(memslot, gfn, false, NULL,
806 if (is_error_noslot_pfn(pfn))
809 if (pfn_valid(pfn)) {
810 page = pfn_to_page(pfn);
811 if (PageReserved(page))
817 * Read the PTE from the process' radix tree and use that
818 * so we get the shift and attribute bits.
820 spin_lock(&kvm->mmu_lock);
821 ptep = find_kvm_host_pte(kvm, mmu_seq, hva, &shift);
824 pte = READ_ONCE(*ptep);
825 spin_unlock(&kvm->mmu_lock);
827 * If the PTE disappeared temporarily due to a THP
828 * collapse, just return and let the guest try again.
830 if (!pte_present(pte)) {
836 /* If we're logging dirty pages, always map single pages */
837 large_enable = !(memslot->flags & KVM_MEM_LOG_DIRTY_PAGES);
839 /* Get pte level from shift/size */
840 if (large_enable && shift == PUD_SHIFT &&
841 (gpa & (PUD_SIZE - PAGE_SIZE)) ==
842 (hva & (PUD_SIZE - PAGE_SIZE))) {
844 } else if (large_enable && shift == PMD_SHIFT &&
845 (gpa & (PMD_SIZE - PAGE_SIZE)) ==
846 (hva & (PMD_SIZE - PAGE_SIZE))) {
850 if (shift > PAGE_SHIFT) {
852 * If the pte maps more than one page, bring over
853 * bits from the virtual address to get the real
854 * address of the specific single page we want.
856 unsigned long rpnmask = (1ul << shift) - PAGE_SIZE;
857 pte = __pte(pte_val(pte) | (hva & rpnmask));
861 pte = __pte(pte_val(pte) | _PAGE_EXEC | _PAGE_ACCESSED);
862 if (writing || upgrade_write) {
863 if (pte_val(pte) & _PAGE_WRITE)
864 pte = __pte(pte_val(pte) | _PAGE_DIRTY);
866 pte = __pte(pte_val(pte) & ~(_PAGE_WRITE | _PAGE_DIRTY));
869 /* Allocate space in the tree and write the PTE */
870 ret = kvmppc_create_pte(kvm, kvm->arch.pgtable, pte, gpa, level,
871 mmu_seq, kvm->arch.lpid, NULL, NULL);
878 if (!ret && (pte_val(pte) & _PAGE_WRITE))
879 set_page_dirty_lock(page);
883 /* Increment number of large pages if we (successfully) inserted one */
886 kvm->stat.num_2M_pages++;
888 kvm->stat.num_1G_pages++;
894 int kvmppc_book3s_radix_page_fault(struct kvm_run *run, struct kvm_vcpu *vcpu,
895 unsigned long ea, unsigned long dsisr)
897 struct kvm *kvm = vcpu->kvm;
898 unsigned long gpa, gfn;
899 struct kvm_memory_slot *memslot;
901 bool writing = !!(dsisr & DSISR_ISSTORE);
904 /* Check for unusual errors */
905 if (dsisr & DSISR_UNSUPP_MMU) {
906 pr_err("KVM: Got unsupported MMU fault\n");
909 if (dsisr & DSISR_BADACCESS) {
910 /* Reflect to the guest as DSI */
911 pr_err("KVM: Got radix HV page fault with DSISR=%lx\n", dsisr);
912 kvmppc_core_queue_data_storage(vcpu, ea, dsisr);
916 /* Translate the logical address */
917 gpa = vcpu->arch.fault_gpa & ~0xfffUL;
918 gpa &= ~0xF000000000000000ul;
919 gfn = gpa >> PAGE_SHIFT;
920 if (!(dsisr & DSISR_PRTABLE_FAULT))
923 if (kvm->arch.secure_guest & KVMPPC_SECURE_INIT_DONE)
924 return kvmppc_send_page_to_uv(kvm, gfn);
926 /* Get the corresponding memslot */
927 memslot = gfn_to_memslot(kvm, gfn);
929 /* No memslot means it's an emulated MMIO region */
930 if (!memslot || (memslot->flags & KVM_MEMSLOT_INVALID)) {
931 if (dsisr & (DSISR_PRTABLE_FAULT | DSISR_BADACCESS |
934 * Bad address in guest page table tree, or other
935 * unusual error - reflect it to the guest as DSI.
937 kvmppc_core_queue_data_storage(vcpu, ea, dsisr);
940 return kvmppc_hv_emulate_mmio(run, vcpu, gpa, ea, writing);
943 if (memslot->flags & KVM_MEM_READONLY) {
945 /* give the guest a DSI */
946 kvmppc_core_queue_data_storage(vcpu, ea, DSISR_ISSTORE |
953 /* Failed to set the reference/change bits */
954 if (dsisr & DSISR_SET_RC) {
955 spin_lock(&kvm->mmu_lock);
956 if (kvmppc_hv_handle_set_rc(kvm, false, writing,
957 gpa, kvm->arch.lpid))
958 dsisr &= ~DSISR_SET_RC;
959 spin_unlock(&kvm->mmu_lock);
961 if (!(dsisr & (DSISR_BAD_FAULT_64S | DSISR_NOHPTE |
962 DSISR_PROTFAULT | DSISR_SET_RC)))
966 /* Try to insert a pte */
967 ret = kvmppc_book3s_instantiate_page(vcpu, gpa, memslot, writing,
970 if (ret == 0 || ret == -EAGAIN)
975 /* Called with kvm->mmu_lock held */
976 int kvm_unmap_radix(struct kvm *kvm, struct kvm_memory_slot *memslot,
980 unsigned long gpa = gfn << PAGE_SHIFT;
983 if (kvm->arch.secure_guest & KVMPPC_SECURE_INIT_DONE) {
984 uv_page_inval(kvm->arch.lpid, gpa, PAGE_SHIFT);
988 ptep = find_kvm_secondary_pte(kvm, gpa, &shift);
989 if (ptep && pte_present(*ptep))
990 kvmppc_unmap_pte(kvm, ptep, gpa, shift, memslot,
995 /* Called with kvm->mmu_lock held */
996 int kvm_age_radix(struct kvm *kvm, struct kvm_memory_slot *memslot,
1000 unsigned long gpa = gfn << PAGE_SHIFT;
1003 unsigned long old, *rmapp;
1005 if (kvm->arch.secure_guest & KVMPPC_SECURE_INIT_DONE)
1008 ptep = find_kvm_secondary_pte(kvm, gpa, &shift);
1009 if (ptep && pte_present(*ptep) && pte_young(*ptep)) {
1010 old = kvmppc_radix_update_pte(kvm, ptep, _PAGE_ACCESSED, 0,
1012 /* XXX need to flush tlb here? */
1013 /* Also clear bit in ptes in shadow pgtable for nested guests */
1014 rmapp = &memslot->arch.rmap[gfn - memslot->base_gfn];
1015 kvmhv_update_nest_rmap_rc_list(kvm, rmapp, _PAGE_ACCESSED, 0,
1023 /* Called with kvm->mmu_lock held */
1024 int kvm_test_age_radix(struct kvm *kvm, struct kvm_memory_slot *memslot,
1028 unsigned long gpa = gfn << PAGE_SHIFT;
1032 if (kvm->arch.secure_guest & KVMPPC_SECURE_INIT_DONE)
1035 ptep = find_kvm_secondary_pte(kvm, gpa, &shift);
1036 if (ptep && pte_present(*ptep) && pte_young(*ptep))
1041 /* Returns the number of PAGE_SIZE pages that are dirty */
1042 static int kvm_radix_test_clear_dirty(struct kvm *kvm,
1043 struct kvm_memory_slot *memslot, int pagenum)
1045 unsigned long gfn = memslot->base_gfn + pagenum;
1046 unsigned long gpa = gfn << PAGE_SHIFT;
1050 unsigned long old, *rmapp;
1052 if (kvm->arch.secure_guest & KVMPPC_SECURE_INIT_DONE)
1056 * For performance reasons we don't hold kvm->mmu_lock while walking the
1057 * partition scoped table.
1059 ptep = find_kvm_secondary_pte_unlocked(kvm, gpa, &shift);
1063 pte = READ_ONCE(*ptep);
1064 if (pte_present(pte) && pte_dirty(pte)) {
1065 spin_lock(&kvm->mmu_lock);
1067 * Recheck the pte again
1069 if (pte_val(pte) != pte_val(*ptep)) {
1071 * We have KVM_MEM_LOG_DIRTY_PAGES enabled. Hence we can
1072 * only find PAGE_SIZE pte entries here. We can continue
1073 * to use the pte addr returned by above page table
1076 if (!pte_present(*ptep) || !pte_dirty(*ptep)) {
1077 spin_unlock(&kvm->mmu_lock);
1084 old = kvmppc_radix_update_pte(kvm, ptep, _PAGE_DIRTY, 0,
1086 kvmppc_radix_tlbie_page(kvm, gpa, shift, kvm->arch.lpid);
1087 /* Also clear bit in ptes in shadow pgtable for nested guests */
1088 rmapp = &memslot->arch.rmap[gfn - memslot->base_gfn];
1089 kvmhv_update_nest_rmap_rc_list(kvm, rmapp, _PAGE_DIRTY, 0,
1092 spin_unlock(&kvm->mmu_lock);
1097 long kvmppc_hv_get_dirty_log_radix(struct kvm *kvm,
1098 struct kvm_memory_slot *memslot, unsigned long *map)
1103 for (i = 0; i < memslot->npages; i = j) {
1104 npages = kvm_radix_test_clear_dirty(kvm, memslot, i);
1107 * Note that if npages > 0 then i must be a multiple of npages,
1108 * since huge pages are only used to back the guest at guest
1109 * real addresses that are a multiple of their size.
1110 * Since we have at most one PTE covering any given guest
1111 * real address, if npages > 1 we can skip to i + npages.
1115 set_dirty_bits(map, i, npages);
1122 void kvmppc_radix_flush_memslot(struct kvm *kvm,
1123 const struct kvm_memory_slot *memslot)
1130 if (kvm->arch.secure_guest & KVMPPC_SECURE_INIT_START)
1131 kvmppc_uvmem_drop_pages(memslot, kvm, true);
1133 if (kvm->arch.secure_guest & KVMPPC_SECURE_INIT_DONE)
1136 gpa = memslot->base_gfn << PAGE_SHIFT;
1137 spin_lock(&kvm->mmu_lock);
1138 for (n = memslot->npages; n; --n) {
1139 ptep = find_kvm_secondary_pte(kvm, gpa, &shift);
1140 if (ptep && pte_present(*ptep))
1141 kvmppc_unmap_pte(kvm, ptep, gpa, shift, memslot,
1145 spin_unlock(&kvm->mmu_lock);
1148 static void add_rmmu_ap_encoding(struct kvm_ppc_rmmu_info *info,
1149 int psize, int *indexp)
1151 if (!mmu_psize_defs[psize].shift)
1153 info->ap_encodings[*indexp] = mmu_psize_defs[psize].shift |
1154 (mmu_psize_defs[psize].ap << 29);
1158 int kvmhv_get_rmmu_info(struct kvm *kvm, struct kvm_ppc_rmmu_info *info)
1162 if (!radix_enabled())
1164 memset(info, 0, sizeof(*info));
1167 info->geometries[0].page_shift = 12;
1168 info->geometries[0].level_bits[0] = 9;
1169 for (i = 1; i < 4; ++i)
1170 info->geometries[0].level_bits[i] = p9_supported_radix_bits[i];
1172 info->geometries[1].page_shift = 16;
1173 for (i = 0; i < 4; ++i)
1174 info->geometries[1].level_bits[i] = p9_supported_radix_bits[i];
1177 add_rmmu_ap_encoding(info, MMU_PAGE_4K, &i);
1178 add_rmmu_ap_encoding(info, MMU_PAGE_64K, &i);
1179 add_rmmu_ap_encoding(info, MMU_PAGE_2M, &i);
1180 add_rmmu_ap_encoding(info, MMU_PAGE_1G, &i);
1185 int kvmppc_init_vm_radix(struct kvm *kvm)
1187 kvm->arch.pgtable = pgd_alloc(kvm->mm);
1188 if (!kvm->arch.pgtable)
1193 static void pte_ctor(void *addr)
1195 memset(addr, 0, RADIX_PTE_TABLE_SIZE);
1198 static void pmd_ctor(void *addr)
1200 memset(addr, 0, RADIX_PMD_TABLE_SIZE);
1203 struct debugfs_radix_state {
1214 static int debugfs_radix_open(struct inode *inode, struct file *file)
1216 struct kvm *kvm = inode->i_private;
1217 struct debugfs_radix_state *p;
1219 p = kzalloc(sizeof(*p), GFP_KERNEL);
1225 mutex_init(&p->mutex);
1226 file->private_data = p;
1228 return nonseekable_open(inode, file);
1231 static int debugfs_radix_release(struct inode *inode, struct file *file)
1233 struct debugfs_radix_state *p = file->private_data;
1235 kvm_put_kvm(p->kvm);
1240 static ssize_t debugfs_radix_read(struct file *file, char __user *buf,
1241 size_t len, loff_t *ppos)
1243 struct debugfs_radix_state *p = file->private_data;
1249 struct kvm_nested_guest *nested;
1259 if (!kvm_is_radix(kvm))
1262 ret = mutex_lock_interruptible(&p->mutex);
1266 if (p->chars_left) {
1270 r = copy_to_user(buf, p->buf + p->buf_index, n);
1287 while (len != 0 && p->lpid >= 0) {
1288 if (gpa >= RADIX_PGTABLE_RANGE) {
1292 kvmhv_put_nested(nested);
1295 p->lpid = kvmhv_nested_next_lpid(kvm, p->lpid);
1302 pgt = kvm->arch.pgtable;
1304 nested = kvmhv_get_nested(kvm, p->lpid, false);
1306 gpa = RADIX_PGTABLE_RANGE;
1309 pgt = nested->shadow_pgtable;
1315 n = scnprintf(p->buf, sizeof(p->buf),
1316 "\nNested LPID %d: ", p->lpid);
1317 n += scnprintf(p->buf + n, sizeof(p->buf) - n,
1318 "pgdir: %lx\n", (unsigned long)pgt);
1323 pgdp = pgt + pgd_index(gpa);
1324 p4dp = p4d_offset(pgdp, gpa);
1325 p4d = READ_ONCE(*p4dp);
1326 if (!(p4d_val(p4d) & _PAGE_PRESENT)) {
1327 gpa = (gpa & P4D_MASK) + P4D_SIZE;
1331 pudp = pud_offset(&p4d, gpa);
1332 pud = READ_ONCE(*pudp);
1333 if (!(pud_val(pud) & _PAGE_PRESENT)) {
1334 gpa = (gpa & PUD_MASK) + PUD_SIZE;
1337 if (pud_val(pud) & _PAGE_PTE) {
1343 pmdp = pmd_offset(&pud, gpa);
1344 pmd = READ_ONCE(*pmdp);
1345 if (!(pmd_val(pmd) & _PAGE_PRESENT)) {
1346 gpa = (gpa & PMD_MASK) + PMD_SIZE;
1349 if (pmd_val(pmd) & _PAGE_PTE) {
1355 ptep = pte_offset_kernel(&pmd, gpa);
1356 pte = pte_val(READ_ONCE(*ptep));
1357 if (!(pte & _PAGE_PRESENT)) {
1363 n = scnprintf(p->buf, sizeof(p->buf),
1364 " %lx: %lx %d\n", gpa, pte, shift);
1365 gpa += 1ul << shift;
1370 r = copy_to_user(buf, p->buf, n);
1385 kvmhv_put_nested(nested);
1388 mutex_unlock(&p->mutex);
1392 static ssize_t debugfs_radix_write(struct file *file, const char __user *buf,
1393 size_t len, loff_t *ppos)
1398 static const struct file_operations debugfs_radix_fops = {
1399 .owner = THIS_MODULE,
1400 .open = debugfs_radix_open,
1401 .release = debugfs_radix_release,
1402 .read = debugfs_radix_read,
1403 .write = debugfs_radix_write,
1404 .llseek = generic_file_llseek,
1407 void kvmhv_radix_debugfs_init(struct kvm *kvm)
1409 debugfs_create_file("radix", 0400, kvm->arch.debugfs_dir, kvm,
1410 &debugfs_radix_fops);
1413 int kvmppc_radix_init(void)
1415 unsigned long size = sizeof(void *) << RADIX_PTE_INDEX_SIZE;
1417 kvm_pte_cache = kmem_cache_create("kvm-pte", size, size, 0, pte_ctor);
1421 size = sizeof(void *) << RADIX_PMD_INDEX_SIZE;
1423 kvm_pmd_cache = kmem_cache_create("kvm-pmd", size, size, 0, pmd_ctor);
1424 if (!kvm_pmd_cache) {
1425 kmem_cache_destroy(kvm_pte_cache);
1432 void kvmppc_radix_exit(void)
1434 kmem_cache_destroy(kvm_pte_cache);
1435 kmem_cache_destroy(kvm_pmd_cache);