kvm_mmu.h 6.0 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
/*
 * Copyright (C) 2012 - Virtual Open Systems and Columbia University
 * Author: Christoffer Dall <c.dall@virtualopensystems.com>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License, version 2, as
 * published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
 */

#ifndef __ARM_KVM_MMU_H__
#define __ARM_KVM_MMU_H__

22 23
#include <asm/memory.h>
#include <asm/page.h>
24

25 26 27 28
/*
 * We directly use the kernel VA for the HYP, as we can directly share
 * the mapping (HTTBR "covers" TTBR1).
 */
M
Marc Zyngier 已提交
29
#define kern_hyp_va(kva)	(kva)
30

31 32 33 34 35
/*
 * KVM_MMU_CACHE_MIN_PAGES is the number of stage2 page table translation levels.
 */
#define KVM_MMU_CACHE_MIN_PAGES	2

36 37
#ifndef __ASSEMBLY__

38
#include <linux/highmem.h>
39 40
#include <asm/cacheflush.h>
#include <asm/pgalloc.h>
41
#include <asm/stage2_pgtable.h>
42

43
int create_hyp_mappings(void *from, void *to, pgprot_t prot);
44
int create_hyp_io_mappings(void *from, void *to, phys_addr_t);
45
void free_hyp_pgds(void);
46

47
void stage2_unmap_vm(struct kvm *kvm);
48 49 50
int kvm_alloc_stage2_pgd(struct kvm *kvm);
void kvm_free_stage2_pgd(struct kvm *kvm);
int kvm_phys_addr_ioremap(struct kvm *kvm, phys_addr_t guest_ipa,
51
			  phys_addr_t pa, unsigned long size, bool writable);
52 53 54 55 56

int kvm_handle_guest_abort(struct kvm_vcpu *vcpu, struct kvm_run *run);

void kvm_mmu_free_memory_caches(struct kvm_vcpu *vcpu);

57
phys_addr_t kvm_mmu_get_httbr(void);
58
phys_addr_t kvm_get_idmap_vector(void);
59
phys_addr_t kvm_get_idmap_start(void);
60 61
int kvm_mmu_init(void);
void kvm_clear_hyp_idmap(void);
62

63 64 65
static inline void kvm_set_pmd(pmd_t *pmd, pmd_t new_pmd)
{
	*pmd = new_pmd;
66
	dsb(ishst);
67 68
}

69 70
static inline void kvm_set_pte(pte_t *pte, pte_t new_pte)
{
71
	*pte = new_pte;
72
	dsb(ishst);
73 74
}

75
static inline pte_t kvm_s2pte_mkwrite(pte_t pte)
76
{
77 78
	pte_val(pte) |= L_PTE_S2_RDWR;
	return pte;
79 80
}

81
static inline pmd_t kvm_s2pmd_mkwrite(pmd_t pmd)
82
{
83 84
	pmd_val(pmd) |= L_PMD_S2_RDWR;
	return pmd;
85 86
}

87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106
static inline void kvm_set_s2pte_readonly(pte_t *pte)
{
	pte_val(*pte) = (pte_val(*pte) & ~L_PTE_S2_RDWR) | L_PTE_S2_RDONLY;
}

static inline bool kvm_s2pte_readonly(pte_t *pte)
{
	return (pte_val(*pte) & L_PTE_S2_RDWR) == L_PTE_S2_RDONLY;
}

static inline void kvm_set_s2pmd_readonly(pmd_t *pmd)
{
	pmd_val(*pmd) = (pmd_val(*pmd) & ~L_PMD_S2_RDWR) | L_PMD_S2_RDONLY;
}

static inline bool kvm_s2pmd_readonly(pmd_t *pmd)
{
	return (pmd_val(*pmd) & L_PMD_S2_RDWR) == L_PMD_S2_RDONLY;
}

107 108 109 110 111 112
static inline bool kvm_page_empty(void *ptr)
{
	struct page *ptr_page = virt_to_page(ptr);
	return page_count(ptr_page) == 1;
}

113 114
#define kvm_pte_table_empty(kvm, ptep) kvm_page_empty(ptep)
#define kvm_pmd_table_empty(kvm, pmdp) kvm_page_empty(pmdp)
115
#define kvm_pud_table_empty(kvm, pudp) false
116

117 118 119
#define hyp_pte_table_empty(ptep) kvm_page_empty(ptep)
#define hyp_pmd_table_empty(pmdp) kvm_page_empty(pmdp)
#define hyp_pud_table_empty(pudp) false
120

121 122
struct kvm;

123 124 125 126
#define kvm_flush_dcache_to_poc(a,l)	__cpuc_flush_dcache_area((a), (l))

static inline bool vcpu_has_cache_enabled(struct kvm_vcpu *vcpu)
{
127
	return (vcpu_cp15(vcpu, c1_SCTLR) & 0b101) == 0b101;
128 129
}

D
Dan Williams 已提交
130 131
static inline void __coherent_cache_guest_page(struct kvm_vcpu *vcpu,
					       kvm_pfn_t pfn,
132 133
					       unsigned long size,
					       bool ipa_uncached)
134 135 136 137 138 139 140 141 142 143 144 145
{
	/*
	 * If we are going to insert an instruction page and the icache is
	 * either VIPT or PIPT, there is a potential problem where the host
	 * (or another VM) may have used the same page as this guest, and we
	 * read incorrect data from the icache.  If we're using a PIPT cache,
	 * we can invalidate just that page, but if we are using a VIPT cache
	 * we need to invalidate the entire icache - damn shame - as written
	 * in the ARM ARM (DDI 0406C.b - Page B3-1393).
	 *
	 * VIVT caches are tagged using both the ASID and the VMID and doesn't
	 * need any kind of flushing (DDI 0406C.b - Page B3-1392).
146 147 148 149 150
	 *
	 * We need to do this through a kernel mapping (using the
	 * user-space mapping has proved to be the wrong
	 * solution). For that, we need to kmap one page at a time,
	 * and iterate over the range.
151
	 */
152 153 154

	bool need_flush = !vcpu_has_cache_enabled(vcpu) || ipa_uncached;

155
	VM_BUG_ON(size & ~PAGE_MASK);
156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177

	if (!need_flush && !icache_is_pipt())
		goto vipt_cache;

	while (size) {
		void *va = kmap_atomic_pfn(pfn);

		if (need_flush)
			kvm_flush_dcache_to_poc(va, PAGE_SIZE);

		if (icache_is_pipt())
			__cpuc_coherent_user_range((unsigned long)va,
						   (unsigned long)va + PAGE_SIZE);

		size -= PAGE_SIZE;
		pfn++;

		kunmap_atomic(va);
	}

vipt_cache:
	if (!icache_is_pipt() && !icache_is_vivt_asid_tagged()) {
178 179 180 181 182
		/* any kind of VIPT cache */
		__flush_icache_all();
	}
}

183 184 185 186 187 188 189 190 191 192 193 194
static inline void __kvm_flush_dcache_pte(pte_t pte)
{
	void *va = kmap_atomic(pte_page(pte));

	kvm_flush_dcache_to_poc(va, PAGE_SIZE);

	kunmap_atomic(va);
}

static inline void __kvm_flush_dcache_pmd(pmd_t pmd)
{
	unsigned long size = PMD_SIZE;
D
Dan Williams 已提交
195
	kvm_pfn_t pfn = pmd_pfn(pmd);
196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212

	while (size) {
		void *va = kmap_atomic_pfn(pfn);

		kvm_flush_dcache_to_poc(va, PAGE_SIZE);

		pfn++;
		size -= PAGE_SIZE;

		kunmap_atomic(va);
	}
}

static inline void __kvm_flush_dcache_pud(pud_t pud)
{
}

213
#define kvm_virt_to_phys(x)		virt_to_idmap((unsigned long)(x))
214

215 216
void kvm_set_way_flush(struct kvm_vcpu *vcpu);
void kvm_toggle_cache(struct kvm_vcpu *vcpu, bool was_enabled);
217

218 219 220 221 222 223 224 225 226 227
static inline bool __kvm_cpu_uses_extended_idmap(void)
{
	return false;
}

static inline void __kvm_extend_hypmap(pgd_t *boot_hyp_pgd,
				       pgd_t *hyp_pgd,
				       pgd_t *merged_hyp_pgd,
				       unsigned long hyp_idmap_start) { }

228 229 230 231 232
static inline unsigned int kvm_get_vmid_bits(void)
{
	return 8;
}

233 234
#endif	/* !__ASSEMBLY__ */

235
#endif /* __ARM_KVM_MMU_H__ */