]> git.proxmox.com Git - mirror_ubuntu-hirsute-kernel.git/blob - arch/x86/kvm/mmu.c
KVM: MMU: abstract the operation of rmap
[mirror_ubuntu-hirsute-kernel.git] / arch / x86 / kvm / mmu.c
1 /*
2 * Kernel-based Virtual Machine driver for Linux
3 *
4 * This module enables machines with Intel VT-x extensions to run virtual
5 * machines without emulation or binary translation.
6 *
7 * MMU support
8 *
9 * Copyright (C) 2006 Qumranet, Inc.
10 * Copyright 2010 Red Hat, Inc. and/or its affiliates.
11 *
12 * Authors:
13 * Yaniv Kamay <yaniv@qumranet.com>
14 * Avi Kivity <avi@qumranet.com>
15 *
16 * This work is licensed under the terms of the GNU GPL, version 2. See
17 * the COPYING file in the top-level directory.
18 *
19 */
20
21 #include "irq.h"
22 #include "mmu.h"
23 #include "x86.h"
24 #include "kvm_cache_regs.h"
25 #include "x86.h"
26
27 #include <linux/kvm_host.h>
28 #include <linux/types.h>
29 #include <linux/string.h>
30 #include <linux/mm.h>
31 #include <linux/highmem.h>
32 #include <linux/module.h>
33 #include <linux/swap.h>
34 #include <linux/hugetlb.h>
35 #include <linux/compiler.h>
36 #include <linux/srcu.h>
37 #include <linux/slab.h>
38 #include <linux/uaccess.h>
39
40 #include <asm/page.h>
41 #include <asm/cmpxchg.h>
42 #include <asm/io.h>
43 #include <asm/vmx.h>
44
45 /*
46 * When setting this variable to true it enables Two-Dimensional-Paging
47 * where the hardware walks 2 page tables:
48 * 1. the guest-virtual to guest-physical
49 * 2. while doing 1. it walks guest-physical to host-physical
50 * If the hardware supports that we don't need to do shadow paging.
51 */
52 bool tdp_enabled = false;
53
54 enum {
55 AUDIT_PRE_PAGE_FAULT,
56 AUDIT_POST_PAGE_FAULT,
57 AUDIT_PRE_PTE_WRITE,
58 AUDIT_POST_PTE_WRITE,
59 AUDIT_PRE_SYNC,
60 AUDIT_POST_SYNC
61 };
62
63 char *audit_point_name[] = {
64 "pre page fault",
65 "post page fault",
66 "pre pte write",
67 "post pte write",
68 "pre sync",
69 "post sync"
70 };
71
72 #undef MMU_DEBUG
73
74 #ifdef MMU_DEBUG
75
76 #define pgprintk(x...) do { if (dbg) printk(x); } while (0)
77 #define rmap_printk(x...) do { if (dbg) printk(x); } while (0)
78
79 #else
80
81 #define pgprintk(x...) do { } while (0)
82 #define rmap_printk(x...) do { } while (0)
83
84 #endif
85
86 #ifdef MMU_DEBUG
87 static int dbg = 0;
88 module_param(dbg, bool, 0644);
89 #endif
90
91 static int oos_shadow = 1;
92 module_param(oos_shadow, bool, 0644);
93
94 #ifndef MMU_DEBUG
95 #define ASSERT(x) do { } while (0)
96 #else
97 #define ASSERT(x) \
98 if (!(x)) { \
99 printk(KERN_WARNING "assertion failed %s:%d: %s\n", \
100 __FILE__, __LINE__, #x); \
101 }
102 #endif
103
104 #define PTE_PREFETCH_NUM 8
105
106 #define PT_FIRST_AVAIL_BITS_SHIFT 9
107 #define PT64_SECOND_AVAIL_BITS_SHIFT 52
108
109 #define PT64_LEVEL_BITS 9
110
111 #define PT64_LEVEL_SHIFT(level) \
112 (PAGE_SHIFT + (level - 1) * PT64_LEVEL_BITS)
113
114 #define PT64_INDEX(address, level)\
115 (((address) >> PT64_LEVEL_SHIFT(level)) & ((1 << PT64_LEVEL_BITS) - 1))
116
117
118 #define PT32_LEVEL_BITS 10
119
120 #define PT32_LEVEL_SHIFT(level) \
121 (PAGE_SHIFT + (level - 1) * PT32_LEVEL_BITS)
122
123 #define PT32_LVL_OFFSET_MASK(level) \
124 (PT32_BASE_ADDR_MASK & ((1ULL << (PAGE_SHIFT + (((level) - 1) \
125 * PT32_LEVEL_BITS))) - 1))
126
127 #define PT32_INDEX(address, level)\
128 (((address) >> PT32_LEVEL_SHIFT(level)) & ((1 << PT32_LEVEL_BITS) - 1))
129
130
131 #define PT64_BASE_ADDR_MASK (((1ULL << 52) - 1) & ~(u64)(PAGE_SIZE-1))
132 #define PT64_DIR_BASE_ADDR_MASK \
133 (PT64_BASE_ADDR_MASK & ~((1ULL << (PAGE_SHIFT + PT64_LEVEL_BITS)) - 1))
134 #define PT64_LVL_ADDR_MASK(level) \
135 (PT64_BASE_ADDR_MASK & ~((1ULL << (PAGE_SHIFT + (((level) - 1) \
136 * PT64_LEVEL_BITS))) - 1))
137 #define PT64_LVL_OFFSET_MASK(level) \
138 (PT64_BASE_ADDR_MASK & ((1ULL << (PAGE_SHIFT + (((level) - 1) \
139 * PT64_LEVEL_BITS))) - 1))
140
141 #define PT32_BASE_ADDR_MASK PAGE_MASK
142 #define PT32_DIR_BASE_ADDR_MASK \
143 (PAGE_MASK & ~((1ULL << (PAGE_SHIFT + PT32_LEVEL_BITS)) - 1))
144 #define PT32_LVL_ADDR_MASK(level) \
145 (PAGE_MASK & ~((1ULL << (PAGE_SHIFT + (((level) - 1) \
146 * PT32_LEVEL_BITS))) - 1))
147
148 #define PT64_PERM_MASK (PT_PRESENT_MASK | PT_WRITABLE_MASK | PT_USER_MASK \
149 | PT64_NX_MASK)
150
151 #define PTE_LIST_EXT 4
152
153 #define ACC_EXEC_MASK 1
154 #define ACC_WRITE_MASK PT_WRITABLE_MASK
155 #define ACC_USER_MASK PT_USER_MASK
156 #define ACC_ALL (ACC_EXEC_MASK | ACC_WRITE_MASK | ACC_USER_MASK)
157
158 #include <trace/events/kvm.h>
159
160 #define CREATE_TRACE_POINTS
161 #include "mmutrace.h"
162
163 #define SPTE_HOST_WRITEABLE (1ULL << PT_FIRST_AVAIL_BITS_SHIFT)
164
165 #define SHADOW_PT_INDEX(addr, level) PT64_INDEX(addr, level)
166
167 struct pte_list_desc {
168 u64 *sptes[PTE_LIST_EXT];
169 struct pte_list_desc *more;
170 };
171
172 struct kvm_shadow_walk_iterator {
173 u64 addr;
174 hpa_t shadow_addr;
175 int level;
176 u64 *sptep;
177 unsigned index;
178 };
179
180 #define for_each_shadow_entry(_vcpu, _addr, _walker) \
181 for (shadow_walk_init(&(_walker), _vcpu, _addr); \
182 shadow_walk_okay(&(_walker)); \
183 shadow_walk_next(&(_walker)))
184
185 typedef void (*mmu_parent_walk_fn) (struct kvm_mmu_page *sp, u64 *spte);
186
187 static struct kmem_cache *pte_chain_cache;
188 static struct kmem_cache *pte_list_desc_cache;
189 static struct kmem_cache *mmu_page_header_cache;
190 static struct percpu_counter kvm_total_used_mmu_pages;
191
192 static u64 __read_mostly shadow_trap_nonpresent_pte;
193 static u64 __read_mostly shadow_notrap_nonpresent_pte;
194 static u64 __read_mostly shadow_nx_mask;
195 static u64 __read_mostly shadow_x_mask; /* mutual exclusive with nx_mask */
196 static u64 __read_mostly shadow_user_mask;
197 static u64 __read_mostly shadow_accessed_mask;
198 static u64 __read_mostly shadow_dirty_mask;
199
200 static inline u64 rsvd_bits(int s, int e)
201 {
202 return ((1ULL << (e - s + 1)) - 1) << s;
203 }
204
205 void kvm_mmu_set_nonpresent_ptes(u64 trap_pte, u64 notrap_pte)
206 {
207 shadow_trap_nonpresent_pte = trap_pte;
208 shadow_notrap_nonpresent_pte = notrap_pte;
209 }
210 EXPORT_SYMBOL_GPL(kvm_mmu_set_nonpresent_ptes);
211
212 void kvm_mmu_set_mask_ptes(u64 user_mask, u64 accessed_mask,
213 u64 dirty_mask, u64 nx_mask, u64 x_mask)
214 {
215 shadow_user_mask = user_mask;
216 shadow_accessed_mask = accessed_mask;
217 shadow_dirty_mask = dirty_mask;
218 shadow_nx_mask = nx_mask;
219 shadow_x_mask = x_mask;
220 }
221 EXPORT_SYMBOL_GPL(kvm_mmu_set_mask_ptes);
222
223 static bool is_write_protection(struct kvm_vcpu *vcpu)
224 {
225 return kvm_read_cr0_bits(vcpu, X86_CR0_WP);
226 }
227
228 static int is_cpuid_PSE36(void)
229 {
230 return 1;
231 }
232
233 static int is_nx(struct kvm_vcpu *vcpu)
234 {
235 return vcpu->arch.efer & EFER_NX;
236 }
237
238 static int is_shadow_present_pte(u64 pte)
239 {
240 return pte != shadow_trap_nonpresent_pte
241 && pte != shadow_notrap_nonpresent_pte;
242 }
243
244 static int is_large_pte(u64 pte)
245 {
246 return pte & PT_PAGE_SIZE_MASK;
247 }
248
249 static int is_writable_pte(unsigned long pte)
250 {
251 return pte & PT_WRITABLE_MASK;
252 }
253
254 static int is_dirty_gpte(unsigned long pte)
255 {
256 return pte & PT_DIRTY_MASK;
257 }
258
259 static int is_rmap_spte(u64 pte)
260 {
261 return is_shadow_present_pte(pte);
262 }
263
264 static int is_last_spte(u64 pte, int level)
265 {
266 if (level == PT_PAGE_TABLE_LEVEL)
267 return 1;
268 if (is_large_pte(pte))
269 return 1;
270 return 0;
271 }
272
273 static pfn_t spte_to_pfn(u64 pte)
274 {
275 return (pte & PT64_BASE_ADDR_MASK) >> PAGE_SHIFT;
276 }
277
278 static gfn_t pse36_gfn_delta(u32 gpte)
279 {
280 int shift = 32 - PT32_DIR_PSE36_SHIFT - PAGE_SHIFT;
281
282 return (gpte & PT32_DIR_PSE36_MASK) << shift;
283 }
284
285 static void __set_spte(u64 *sptep, u64 spte)
286 {
287 set_64bit(sptep, spte);
288 }
289
290 static u64 __xchg_spte(u64 *sptep, u64 new_spte)
291 {
292 #ifdef CONFIG_X86_64
293 return xchg(sptep, new_spte);
294 #else
295 u64 old_spte;
296
297 do {
298 old_spte = *sptep;
299 } while (cmpxchg64(sptep, old_spte, new_spte) != old_spte);
300
301 return old_spte;
302 #endif
303 }
304
305 static bool spte_has_volatile_bits(u64 spte)
306 {
307 if (!shadow_accessed_mask)
308 return false;
309
310 if (!is_shadow_present_pte(spte))
311 return false;
312
313 if ((spte & shadow_accessed_mask) &&
314 (!is_writable_pte(spte) || (spte & shadow_dirty_mask)))
315 return false;
316
317 return true;
318 }
319
320 static bool spte_is_bit_cleared(u64 old_spte, u64 new_spte, u64 bit_mask)
321 {
322 return (old_spte & bit_mask) && !(new_spte & bit_mask);
323 }
324
325 static void update_spte(u64 *sptep, u64 new_spte)
326 {
327 u64 mask, old_spte = *sptep;
328
329 WARN_ON(!is_rmap_spte(new_spte));
330
331 new_spte |= old_spte & shadow_dirty_mask;
332
333 mask = shadow_accessed_mask;
334 if (is_writable_pte(old_spte))
335 mask |= shadow_dirty_mask;
336
337 if (!spte_has_volatile_bits(old_spte) || (new_spte & mask) == mask)
338 __set_spte(sptep, new_spte);
339 else
340 old_spte = __xchg_spte(sptep, new_spte);
341
342 if (!shadow_accessed_mask)
343 return;
344
345 if (spte_is_bit_cleared(old_spte, new_spte, shadow_accessed_mask))
346 kvm_set_pfn_accessed(spte_to_pfn(old_spte));
347 if (spte_is_bit_cleared(old_spte, new_spte, shadow_dirty_mask))
348 kvm_set_pfn_dirty(spte_to_pfn(old_spte));
349 }
350
351 static int mmu_topup_memory_cache(struct kvm_mmu_memory_cache *cache,
352 struct kmem_cache *base_cache, int min)
353 {
354 void *obj;
355
356 if (cache->nobjs >= min)
357 return 0;
358 while (cache->nobjs < ARRAY_SIZE(cache->objects)) {
359 obj = kmem_cache_zalloc(base_cache, GFP_KERNEL);
360 if (!obj)
361 return -ENOMEM;
362 cache->objects[cache->nobjs++] = obj;
363 }
364 return 0;
365 }
366
367 static void mmu_free_memory_cache(struct kvm_mmu_memory_cache *mc,
368 struct kmem_cache *cache)
369 {
370 while (mc->nobjs)
371 kmem_cache_free(cache, mc->objects[--mc->nobjs]);
372 }
373
374 static int mmu_topup_memory_cache_page(struct kvm_mmu_memory_cache *cache,
375 int min)
376 {
377 void *page;
378
379 if (cache->nobjs >= min)
380 return 0;
381 while (cache->nobjs < ARRAY_SIZE(cache->objects)) {
382 page = (void *)__get_free_page(GFP_KERNEL);
383 if (!page)
384 return -ENOMEM;
385 cache->objects[cache->nobjs++] = page;
386 }
387 return 0;
388 }
389
390 static void mmu_free_memory_cache_page(struct kvm_mmu_memory_cache *mc)
391 {
392 while (mc->nobjs)
393 free_page((unsigned long)mc->objects[--mc->nobjs]);
394 }
395
396 static int mmu_topup_memory_caches(struct kvm_vcpu *vcpu)
397 {
398 int r;
399
400 r = mmu_topup_memory_cache(&vcpu->arch.mmu_pte_chain_cache,
401 pte_chain_cache, 4);
402 if (r)
403 goto out;
404 r = mmu_topup_memory_cache(&vcpu->arch.mmu_pte_list_desc_cache,
405 pte_list_desc_cache, 4 + PTE_PREFETCH_NUM);
406 if (r)
407 goto out;
408 r = mmu_topup_memory_cache_page(&vcpu->arch.mmu_page_cache, 8);
409 if (r)
410 goto out;
411 r = mmu_topup_memory_cache(&vcpu->arch.mmu_page_header_cache,
412 mmu_page_header_cache, 4);
413 out:
414 return r;
415 }
416
417 static void mmu_free_memory_caches(struct kvm_vcpu *vcpu)
418 {
419 mmu_free_memory_cache(&vcpu->arch.mmu_pte_chain_cache,
420 pte_chain_cache);
421 mmu_free_memory_cache(&vcpu->arch.mmu_pte_list_desc_cache,
422 pte_list_desc_cache);
423 mmu_free_memory_cache_page(&vcpu->arch.mmu_page_cache);
424 mmu_free_memory_cache(&vcpu->arch.mmu_page_header_cache,
425 mmu_page_header_cache);
426 }
427
428 static void *mmu_memory_cache_alloc(struct kvm_mmu_memory_cache *mc,
429 size_t size)
430 {
431 void *p;
432
433 BUG_ON(!mc->nobjs);
434 p = mc->objects[--mc->nobjs];
435 return p;
436 }
437
438 static struct kvm_pte_chain *mmu_alloc_pte_chain(struct kvm_vcpu *vcpu)
439 {
440 return mmu_memory_cache_alloc(&vcpu->arch.mmu_pte_chain_cache,
441 sizeof(struct kvm_pte_chain));
442 }
443
444 static void mmu_free_pte_chain(struct kvm_pte_chain *pc)
445 {
446 kmem_cache_free(pte_chain_cache, pc);
447 }
448
449 static struct pte_list_desc *mmu_alloc_pte_list_desc(struct kvm_vcpu *vcpu)
450 {
451 return mmu_memory_cache_alloc(&vcpu->arch.mmu_pte_list_desc_cache,
452 sizeof(struct pte_list_desc));
453 }
454
455 static void mmu_free_pte_list_desc(struct pte_list_desc *pte_list_desc)
456 {
457 kmem_cache_free(pte_list_desc_cache, pte_list_desc);
458 }
459
460 static gfn_t kvm_mmu_page_get_gfn(struct kvm_mmu_page *sp, int index)
461 {
462 if (!sp->role.direct)
463 return sp->gfns[index];
464
465 return sp->gfn + (index << ((sp->role.level - 1) * PT64_LEVEL_BITS));
466 }
467
468 static void kvm_mmu_page_set_gfn(struct kvm_mmu_page *sp, int index, gfn_t gfn)
469 {
470 if (sp->role.direct)
471 BUG_ON(gfn != kvm_mmu_page_get_gfn(sp, index));
472 else
473 sp->gfns[index] = gfn;
474 }
475
476 /*
477 * Return the pointer to the large page information for a given gfn,
478 * handling slots that are not large page aligned.
479 */
480 static struct kvm_lpage_info *lpage_info_slot(gfn_t gfn,
481 struct kvm_memory_slot *slot,
482 int level)
483 {
484 unsigned long idx;
485
486 idx = (gfn >> KVM_HPAGE_GFN_SHIFT(level)) -
487 (slot->base_gfn >> KVM_HPAGE_GFN_SHIFT(level));
488 return &slot->lpage_info[level - 2][idx];
489 }
490
491 static void account_shadowed(struct kvm *kvm, gfn_t gfn)
492 {
493 struct kvm_memory_slot *slot;
494 struct kvm_lpage_info *linfo;
495 int i;
496
497 slot = gfn_to_memslot(kvm, gfn);
498 for (i = PT_DIRECTORY_LEVEL;
499 i < PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES; ++i) {
500 linfo = lpage_info_slot(gfn, slot, i);
501 linfo->write_count += 1;
502 }
503 kvm->arch.indirect_shadow_pages++;
504 }
505
506 static void unaccount_shadowed(struct kvm *kvm, gfn_t gfn)
507 {
508 struct kvm_memory_slot *slot;
509 struct kvm_lpage_info *linfo;
510 int i;
511
512 slot = gfn_to_memslot(kvm, gfn);
513 for (i = PT_DIRECTORY_LEVEL;
514 i < PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES; ++i) {
515 linfo = lpage_info_slot(gfn, slot, i);
516 linfo->write_count -= 1;
517 WARN_ON(linfo->write_count < 0);
518 }
519 kvm->arch.indirect_shadow_pages--;
520 }
521
522 static int has_wrprotected_page(struct kvm *kvm,
523 gfn_t gfn,
524 int level)
525 {
526 struct kvm_memory_slot *slot;
527 struct kvm_lpage_info *linfo;
528
529 slot = gfn_to_memslot(kvm, gfn);
530 if (slot) {
531 linfo = lpage_info_slot(gfn, slot, level);
532 return linfo->write_count;
533 }
534
535 return 1;
536 }
537
538 static int host_mapping_level(struct kvm *kvm, gfn_t gfn)
539 {
540 unsigned long page_size;
541 int i, ret = 0;
542
543 page_size = kvm_host_page_size(kvm, gfn);
544
545 for (i = PT_PAGE_TABLE_LEVEL;
546 i < (PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES); ++i) {
547 if (page_size >= KVM_HPAGE_SIZE(i))
548 ret = i;
549 else
550 break;
551 }
552
553 return ret;
554 }
555
556 static struct kvm_memory_slot *
557 gfn_to_memslot_dirty_bitmap(struct kvm_vcpu *vcpu, gfn_t gfn,
558 bool no_dirty_log)
559 {
560 struct kvm_memory_slot *slot;
561
562 slot = gfn_to_memslot(vcpu->kvm, gfn);
563 if (!slot || slot->flags & KVM_MEMSLOT_INVALID ||
564 (no_dirty_log && slot->dirty_bitmap))
565 slot = NULL;
566
567 return slot;
568 }
569
570 static bool mapping_level_dirty_bitmap(struct kvm_vcpu *vcpu, gfn_t large_gfn)
571 {
572 return !gfn_to_memslot_dirty_bitmap(vcpu, large_gfn, true);
573 }
574
575 static int mapping_level(struct kvm_vcpu *vcpu, gfn_t large_gfn)
576 {
577 int host_level, level, max_level;
578
579 host_level = host_mapping_level(vcpu->kvm, large_gfn);
580
581 if (host_level == PT_PAGE_TABLE_LEVEL)
582 return host_level;
583
584 max_level = kvm_x86_ops->get_lpage_level() < host_level ?
585 kvm_x86_ops->get_lpage_level() : host_level;
586
587 for (level = PT_DIRECTORY_LEVEL; level <= max_level; ++level)
588 if (has_wrprotected_page(vcpu->kvm, large_gfn, level))
589 break;
590
591 return level - 1;
592 }
593
594 /*
595 * Pte mapping structures:
596 *
597 * If pte_list bit zero is zero, then pte_list point to the spte.
598 *
599 * If pte_list bit zero is one, (then pte_list & ~1) points to a struct
600 * pte_list_desc containing more mappings.
601 *
602 * Returns the number of pte entries before the spte was added or zero if
603 * the spte was not added.
604 *
605 */
606 static int pte_list_add(struct kvm_vcpu *vcpu, u64 *spte,
607 unsigned long *pte_list)
608 {
609 struct pte_list_desc *desc;
610 int i, count = 0;
611
612 if (!*pte_list) {
613 rmap_printk("pte_list_add: %p %llx 0->1\n", spte, *spte);
614 *pte_list = (unsigned long)spte;
615 } else if (!(*pte_list & 1)) {
616 rmap_printk("pte_list_add: %p %llx 1->many\n", spte, *spte);
617 desc = mmu_alloc_pte_list_desc(vcpu);
618 desc->sptes[0] = (u64 *)*pte_list;
619 desc->sptes[1] = spte;
620 *pte_list = (unsigned long)desc | 1;
621 ++count;
622 } else {
623 rmap_printk("pte_list_add: %p %llx many->many\n", spte, *spte);
624 desc = (struct pte_list_desc *)(*pte_list & ~1ul);
625 while (desc->sptes[PTE_LIST_EXT-1] && desc->more) {
626 desc = desc->more;
627 count += PTE_LIST_EXT;
628 }
629 if (desc->sptes[PTE_LIST_EXT-1]) {
630 desc->more = mmu_alloc_pte_list_desc(vcpu);
631 desc = desc->more;
632 }
633 for (i = 0; desc->sptes[i]; ++i)
634 ++count;
635 desc->sptes[i] = spte;
636 }
637 return count;
638 }
639
640 static u64 *pte_list_next(unsigned long *pte_list, u64 *spte)
641 {
642 struct pte_list_desc *desc;
643 u64 *prev_spte;
644 int i;
645
646 if (!*pte_list)
647 return NULL;
648 else if (!(*pte_list & 1)) {
649 if (!spte)
650 return (u64 *)*pte_list;
651 return NULL;
652 }
653 desc = (struct pte_list_desc *)(*pte_list & ~1ul);
654 prev_spte = NULL;
655 while (desc) {
656 for (i = 0; i < PTE_LIST_EXT && desc->sptes[i]; ++i) {
657 if (prev_spte == spte)
658 return desc->sptes[i];
659 prev_spte = desc->sptes[i];
660 }
661 desc = desc->more;
662 }
663 return NULL;
664 }
665
666 static void
667 pte_list_desc_remove_entry(unsigned long *pte_list, struct pte_list_desc *desc,
668 int i, struct pte_list_desc *prev_desc)
669 {
670 int j;
671
672 for (j = PTE_LIST_EXT - 1; !desc->sptes[j] && j > i; --j)
673 ;
674 desc->sptes[i] = desc->sptes[j];
675 desc->sptes[j] = NULL;
676 if (j != 0)
677 return;
678 if (!prev_desc && !desc->more)
679 *pte_list = (unsigned long)desc->sptes[0];
680 else
681 if (prev_desc)
682 prev_desc->more = desc->more;
683 else
684 *pte_list = (unsigned long)desc->more | 1;
685 mmu_free_pte_list_desc(desc);
686 }
687
688 static void pte_list_remove(u64 *spte, unsigned long *pte_list)
689 {
690 struct pte_list_desc *desc;
691 struct pte_list_desc *prev_desc;
692 int i;
693
694 if (!*pte_list) {
695 printk(KERN_ERR "pte_list_remove: %p 0->BUG\n", spte);
696 BUG();
697 } else if (!(*pte_list & 1)) {
698 rmap_printk("pte_list_remove: %p 1->0\n", spte);
699 if ((u64 *)*pte_list != spte) {
700 printk(KERN_ERR "pte_list_remove: %p 1->BUG\n", spte);
701 BUG();
702 }
703 *pte_list = 0;
704 } else {
705 rmap_printk("pte_list_remove: %p many->many\n", spte);
706 desc = (struct pte_list_desc *)(*pte_list & ~1ul);
707 prev_desc = NULL;
708 while (desc) {
709 for (i = 0; i < PTE_LIST_EXT && desc->sptes[i]; ++i)
710 if (desc->sptes[i] == spte) {
711 pte_list_desc_remove_entry(pte_list,
712 desc, i,
713 prev_desc);
714 return;
715 }
716 prev_desc = desc;
717 desc = desc->more;
718 }
719 pr_err("pte_list_remove: %p many->many\n", spte);
720 BUG();
721 }
722 }
723
724 /*
725 * Take gfn and return the reverse mapping to it.
726 */
727 static unsigned long *gfn_to_rmap(struct kvm *kvm, gfn_t gfn, int level)
728 {
729 struct kvm_memory_slot *slot;
730 struct kvm_lpage_info *linfo;
731
732 slot = gfn_to_memslot(kvm, gfn);
733 if (likely(level == PT_PAGE_TABLE_LEVEL))
734 return &slot->rmap[gfn - slot->base_gfn];
735
736 linfo = lpage_info_slot(gfn, slot, level);
737
738 return &linfo->rmap_pde;
739 }
740
741 static int rmap_add(struct kvm_vcpu *vcpu, u64 *spte, gfn_t gfn)
742 {
743 struct kvm_mmu_page *sp;
744 unsigned long *rmapp;
745
746 if (!is_rmap_spte(*spte))
747 return 0;
748
749 sp = page_header(__pa(spte));
750 kvm_mmu_page_set_gfn(sp, spte - sp->spt, gfn);
751 rmapp = gfn_to_rmap(vcpu->kvm, gfn, sp->role.level);
752 return pte_list_add(vcpu, spte, rmapp);
753 }
754
755 static u64 *rmap_next(struct kvm *kvm, unsigned long *rmapp, u64 *spte)
756 {
757 return pte_list_next(rmapp, spte);
758 }
759
760 static void rmap_remove(struct kvm *kvm, u64 *spte)
761 {
762 struct kvm_mmu_page *sp;
763 gfn_t gfn;
764 unsigned long *rmapp;
765
766 sp = page_header(__pa(spte));
767 gfn = kvm_mmu_page_get_gfn(sp, spte - sp->spt);
768 rmapp = gfn_to_rmap(kvm, gfn, sp->role.level);
769 pte_list_remove(spte, rmapp);
770 }
771
772 static int set_spte_track_bits(u64 *sptep, u64 new_spte)
773 {
774 pfn_t pfn;
775 u64 old_spte = *sptep;
776
777 if (!spte_has_volatile_bits(old_spte))
778 __set_spte(sptep, new_spte);
779 else
780 old_spte = __xchg_spte(sptep, new_spte);
781
782 if (!is_rmap_spte(old_spte))
783 return 0;
784
785 pfn = spte_to_pfn(old_spte);
786 if (!shadow_accessed_mask || old_spte & shadow_accessed_mask)
787 kvm_set_pfn_accessed(pfn);
788 if (!shadow_dirty_mask || (old_spte & shadow_dirty_mask))
789 kvm_set_pfn_dirty(pfn);
790 return 1;
791 }
792
793 static void drop_spte(struct kvm *kvm, u64 *sptep, u64 new_spte)
794 {
795 if (set_spte_track_bits(sptep, new_spte))
796 rmap_remove(kvm, sptep);
797 }
798
799 static int rmap_write_protect(struct kvm *kvm, u64 gfn)
800 {
801 unsigned long *rmapp;
802 u64 *spte;
803 int i, write_protected = 0;
804
805 rmapp = gfn_to_rmap(kvm, gfn, PT_PAGE_TABLE_LEVEL);
806
807 spte = rmap_next(kvm, rmapp, NULL);
808 while (spte) {
809 BUG_ON(!spte);
810 BUG_ON(!(*spte & PT_PRESENT_MASK));
811 rmap_printk("rmap_write_protect: spte %p %llx\n", spte, *spte);
812 if (is_writable_pte(*spte)) {
813 update_spte(spte, *spte & ~PT_WRITABLE_MASK);
814 write_protected = 1;
815 }
816 spte = rmap_next(kvm, rmapp, spte);
817 }
818
819 /* check for huge page mappings */
820 for (i = PT_DIRECTORY_LEVEL;
821 i < PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES; ++i) {
822 rmapp = gfn_to_rmap(kvm, gfn, i);
823 spte = rmap_next(kvm, rmapp, NULL);
824 while (spte) {
825 BUG_ON(!spte);
826 BUG_ON(!(*spte & PT_PRESENT_MASK));
827 BUG_ON((*spte & (PT_PAGE_SIZE_MASK|PT_PRESENT_MASK)) != (PT_PAGE_SIZE_MASK|PT_PRESENT_MASK));
828 pgprintk("rmap_write_protect(large): spte %p %llx %lld\n", spte, *spte, gfn);
829 if (is_writable_pte(*spte)) {
830 drop_spte(kvm, spte,
831 shadow_trap_nonpresent_pte);
832 --kvm->stat.lpages;
833 spte = NULL;
834 write_protected = 1;
835 }
836 spte = rmap_next(kvm, rmapp, spte);
837 }
838 }
839
840 return write_protected;
841 }
842
843 static int kvm_unmap_rmapp(struct kvm *kvm, unsigned long *rmapp,
844 unsigned long data)
845 {
846 u64 *spte;
847 int need_tlb_flush = 0;
848
849 while ((spte = rmap_next(kvm, rmapp, NULL))) {
850 BUG_ON(!(*spte & PT_PRESENT_MASK));
851 rmap_printk("kvm_rmap_unmap_hva: spte %p %llx\n", spte, *spte);
852 drop_spte(kvm, spte, shadow_trap_nonpresent_pte);
853 need_tlb_flush = 1;
854 }
855 return need_tlb_flush;
856 }
857
858 static int kvm_set_pte_rmapp(struct kvm *kvm, unsigned long *rmapp,
859 unsigned long data)
860 {
861 int need_flush = 0;
862 u64 *spte, new_spte;
863 pte_t *ptep = (pte_t *)data;
864 pfn_t new_pfn;
865
866 WARN_ON(pte_huge(*ptep));
867 new_pfn = pte_pfn(*ptep);
868 spte = rmap_next(kvm, rmapp, NULL);
869 while (spte) {
870 BUG_ON(!is_shadow_present_pte(*spte));
871 rmap_printk("kvm_set_pte_rmapp: spte %p %llx\n", spte, *spte);
872 need_flush = 1;
873 if (pte_write(*ptep)) {
874 drop_spte(kvm, spte, shadow_trap_nonpresent_pte);
875 spte = rmap_next(kvm, rmapp, NULL);
876 } else {
877 new_spte = *spte &~ (PT64_BASE_ADDR_MASK);
878 new_spte |= (u64)new_pfn << PAGE_SHIFT;
879
880 new_spte &= ~PT_WRITABLE_MASK;
881 new_spte &= ~SPTE_HOST_WRITEABLE;
882 new_spte &= ~shadow_accessed_mask;
883 set_spte_track_bits(spte, new_spte);
884 spte = rmap_next(kvm, rmapp, spte);
885 }
886 }
887 if (need_flush)
888 kvm_flush_remote_tlbs(kvm);
889
890 return 0;
891 }
892
893 static int kvm_handle_hva(struct kvm *kvm, unsigned long hva,
894 unsigned long data,
895 int (*handler)(struct kvm *kvm, unsigned long *rmapp,
896 unsigned long data))
897 {
898 int i, j;
899 int ret;
900 int retval = 0;
901 struct kvm_memslots *slots;
902
903 slots = kvm_memslots(kvm);
904
905 for (i = 0; i < slots->nmemslots; i++) {
906 struct kvm_memory_slot *memslot = &slots->memslots[i];
907 unsigned long start = memslot->userspace_addr;
908 unsigned long end;
909
910 end = start + (memslot->npages << PAGE_SHIFT);
911 if (hva >= start && hva < end) {
912 gfn_t gfn_offset = (hva - start) >> PAGE_SHIFT;
913 gfn_t gfn = memslot->base_gfn + gfn_offset;
914
915 ret = handler(kvm, &memslot->rmap[gfn_offset], data);
916
917 for (j = 0; j < KVM_NR_PAGE_SIZES - 1; ++j) {
918 struct kvm_lpage_info *linfo;
919
920 linfo = lpage_info_slot(gfn, memslot,
921 PT_DIRECTORY_LEVEL + j);
922 ret |= handler(kvm, &linfo->rmap_pde, data);
923 }
924 trace_kvm_age_page(hva, memslot, ret);
925 retval |= ret;
926 }
927 }
928
929 return retval;
930 }
931
932 int kvm_unmap_hva(struct kvm *kvm, unsigned long hva)
933 {
934 return kvm_handle_hva(kvm, hva, 0, kvm_unmap_rmapp);
935 }
936
937 void kvm_set_spte_hva(struct kvm *kvm, unsigned long hva, pte_t pte)
938 {
939 kvm_handle_hva(kvm, hva, (unsigned long)&pte, kvm_set_pte_rmapp);
940 }
941
942 static int kvm_age_rmapp(struct kvm *kvm, unsigned long *rmapp,
943 unsigned long data)
944 {
945 u64 *spte;
946 int young = 0;
947
948 /*
949 * Emulate the accessed bit for EPT, by checking if this page has
950 * an EPT mapping, and clearing it if it does. On the next access,
951 * a new EPT mapping will be established.
952 * This has some overhead, but not as much as the cost of swapping
953 * out actively used pages or breaking up actively used hugepages.
954 */
955 if (!shadow_accessed_mask)
956 return kvm_unmap_rmapp(kvm, rmapp, data);
957
958 spte = rmap_next(kvm, rmapp, NULL);
959 while (spte) {
960 int _young;
961 u64 _spte = *spte;
962 BUG_ON(!(_spte & PT_PRESENT_MASK));
963 _young = _spte & PT_ACCESSED_MASK;
964 if (_young) {
965 young = 1;
966 clear_bit(PT_ACCESSED_SHIFT, (unsigned long *)spte);
967 }
968 spte = rmap_next(kvm, rmapp, spte);
969 }
970 return young;
971 }
972
973 static int kvm_test_age_rmapp(struct kvm *kvm, unsigned long *rmapp,
974 unsigned long data)
975 {
976 u64 *spte;
977 int young = 0;
978
979 /*
980 * If there's no access bit in the secondary pte set by the
981 * hardware it's up to gup-fast/gup to set the access bit in
982 * the primary pte or in the page structure.
983 */
984 if (!shadow_accessed_mask)
985 goto out;
986
987 spte = rmap_next(kvm, rmapp, NULL);
988 while (spte) {
989 u64 _spte = *spte;
990 BUG_ON(!(_spte & PT_PRESENT_MASK));
991 young = _spte & PT_ACCESSED_MASK;
992 if (young) {
993 young = 1;
994 break;
995 }
996 spte = rmap_next(kvm, rmapp, spte);
997 }
998 out:
999 return young;
1000 }
1001
1002 #define RMAP_RECYCLE_THRESHOLD 1000
1003
1004 static void rmap_recycle(struct kvm_vcpu *vcpu, u64 *spte, gfn_t gfn)
1005 {
1006 unsigned long *rmapp;
1007 struct kvm_mmu_page *sp;
1008
1009 sp = page_header(__pa(spte));
1010
1011 rmapp = gfn_to_rmap(vcpu->kvm, gfn, sp->role.level);
1012
1013 kvm_unmap_rmapp(vcpu->kvm, rmapp, 0);
1014 kvm_flush_remote_tlbs(vcpu->kvm);
1015 }
1016
1017 int kvm_age_hva(struct kvm *kvm, unsigned long hva)
1018 {
1019 return kvm_handle_hva(kvm, hva, 0, kvm_age_rmapp);
1020 }
1021
1022 int kvm_test_age_hva(struct kvm *kvm, unsigned long hva)
1023 {
1024 return kvm_handle_hva(kvm, hva, 0, kvm_test_age_rmapp);
1025 }
1026
1027 #ifdef MMU_DEBUG
1028 static int is_empty_shadow_page(u64 *spt)
1029 {
1030 u64 *pos;
1031 u64 *end;
1032
1033 for (pos = spt, end = pos + PAGE_SIZE / sizeof(u64); pos != end; pos++)
1034 if (is_shadow_present_pte(*pos)) {
1035 printk(KERN_ERR "%s: %p %llx\n", __func__,
1036 pos, *pos);
1037 return 0;
1038 }
1039 return 1;
1040 }
1041 #endif
1042
1043 /*
1044 * This value is the sum of all of the kvm instances's
1045 * kvm->arch.n_used_mmu_pages values. We need a global,
1046 * aggregate version in order to make the slab shrinker
1047 * faster
1048 */
1049 static inline void kvm_mod_used_mmu_pages(struct kvm *kvm, int nr)
1050 {
1051 kvm->arch.n_used_mmu_pages += nr;
1052 percpu_counter_add(&kvm_total_used_mmu_pages, nr);
1053 }
1054
1055 static void kvm_mmu_free_page(struct kvm *kvm, struct kvm_mmu_page *sp)
1056 {
1057 ASSERT(is_empty_shadow_page(sp->spt));
1058 hlist_del(&sp->hash_link);
1059 list_del(&sp->link);
1060 free_page((unsigned long)sp->spt);
1061 if (!sp->role.direct)
1062 free_page((unsigned long)sp->gfns);
1063 kmem_cache_free(mmu_page_header_cache, sp);
1064 kvm_mod_used_mmu_pages(kvm, -1);
1065 }
1066
1067 static unsigned kvm_page_table_hashfn(gfn_t gfn)
1068 {
1069 return gfn & ((1 << KVM_MMU_HASH_SHIFT) - 1);
1070 }
1071
1072 static struct kvm_mmu_page *kvm_mmu_alloc_page(struct kvm_vcpu *vcpu,
1073 u64 *parent_pte, int direct)
1074 {
1075 struct kvm_mmu_page *sp;
1076
1077 sp = mmu_memory_cache_alloc(&vcpu->arch.mmu_page_header_cache, sizeof *sp);
1078 sp->spt = mmu_memory_cache_alloc(&vcpu->arch.mmu_page_cache, PAGE_SIZE);
1079 if (!direct)
1080 sp->gfns = mmu_memory_cache_alloc(&vcpu->arch.mmu_page_cache,
1081 PAGE_SIZE);
1082 set_page_private(virt_to_page(sp->spt), (unsigned long)sp);
1083 list_add(&sp->link, &vcpu->kvm->arch.active_mmu_pages);
1084 bitmap_zero(sp->slot_bitmap, KVM_MEMORY_SLOTS + KVM_PRIVATE_MEM_SLOTS);
1085 sp->multimapped = 0;
1086 sp->parent_pte = parent_pte;
1087 kvm_mod_used_mmu_pages(vcpu->kvm, +1);
1088 return sp;
1089 }
1090
1091 static void mmu_page_add_parent_pte(struct kvm_vcpu *vcpu,
1092 struct kvm_mmu_page *sp, u64 *parent_pte)
1093 {
1094 struct kvm_pte_chain *pte_chain;
1095 struct hlist_node *node;
1096 int i;
1097
1098 if (!parent_pte)
1099 return;
1100 if (!sp->multimapped) {
1101 u64 *old = sp->parent_pte;
1102
1103 if (!old) {
1104 sp->parent_pte = parent_pte;
1105 return;
1106 }
1107 sp->multimapped = 1;
1108 pte_chain = mmu_alloc_pte_chain(vcpu);
1109 INIT_HLIST_HEAD(&sp->parent_ptes);
1110 hlist_add_head(&pte_chain->link, &sp->parent_ptes);
1111 pte_chain->parent_ptes[0] = old;
1112 }
1113 hlist_for_each_entry(pte_chain, node, &sp->parent_ptes, link) {
1114 if (pte_chain->parent_ptes[NR_PTE_CHAIN_ENTRIES-1])
1115 continue;
1116 for (i = 0; i < NR_PTE_CHAIN_ENTRIES; ++i)
1117 if (!pte_chain->parent_ptes[i]) {
1118 pte_chain->parent_ptes[i] = parent_pte;
1119 return;
1120 }
1121 }
1122 pte_chain = mmu_alloc_pte_chain(vcpu);
1123 BUG_ON(!pte_chain);
1124 hlist_add_head(&pte_chain->link, &sp->parent_ptes);
1125 pte_chain->parent_ptes[0] = parent_pte;
1126 }
1127
1128 static void mmu_page_remove_parent_pte(struct kvm_mmu_page *sp,
1129 u64 *parent_pte)
1130 {
1131 struct kvm_pte_chain *pte_chain;
1132 struct hlist_node *node;
1133 int i;
1134
1135 if (!sp->multimapped) {
1136 BUG_ON(sp->parent_pte != parent_pte);
1137 sp->parent_pte = NULL;
1138 return;
1139 }
1140 hlist_for_each_entry(pte_chain, node, &sp->parent_ptes, link)
1141 for (i = 0; i < NR_PTE_CHAIN_ENTRIES; ++i) {
1142 if (!pte_chain->parent_ptes[i])
1143 break;
1144 if (pte_chain->parent_ptes[i] != parent_pte)
1145 continue;
1146 while (i + 1 < NR_PTE_CHAIN_ENTRIES
1147 && pte_chain->parent_ptes[i + 1]) {
1148 pte_chain->parent_ptes[i]
1149 = pte_chain->parent_ptes[i + 1];
1150 ++i;
1151 }
1152 pte_chain->parent_ptes[i] = NULL;
1153 if (i == 0) {
1154 hlist_del(&pte_chain->link);
1155 mmu_free_pte_chain(pte_chain);
1156 if (hlist_empty(&sp->parent_ptes)) {
1157 sp->multimapped = 0;
1158 sp->parent_pte = NULL;
1159 }
1160 }
1161 return;
1162 }
1163 BUG();
1164 }
1165
1166 static void mmu_parent_walk(struct kvm_mmu_page *sp, mmu_parent_walk_fn fn)
1167 {
1168 struct kvm_pte_chain *pte_chain;
1169 struct hlist_node *node;
1170 struct kvm_mmu_page *parent_sp;
1171 int i;
1172
1173 if (!sp->multimapped && sp->parent_pte) {
1174 parent_sp = page_header(__pa(sp->parent_pte));
1175 fn(parent_sp, sp->parent_pte);
1176 return;
1177 }
1178
1179 hlist_for_each_entry(pte_chain, node, &sp->parent_ptes, link)
1180 for (i = 0; i < NR_PTE_CHAIN_ENTRIES; ++i) {
1181 u64 *spte = pte_chain->parent_ptes[i];
1182
1183 if (!spte)
1184 break;
1185 parent_sp = page_header(__pa(spte));
1186 fn(parent_sp, spte);
1187 }
1188 }
1189
1190 static void mark_unsync(struct kvm_mmu_page *sp, u64 *spte);
1191 static void kvm_mmu_mark_parents_unsync(struct kvm_mmu_page *sp)
1192 {
1193 mmu_parent_walk(sp, mark_unsync);
1194 }
1195
1196 static void mark_unsync(struct kvm_mmu_page *sp, u64 *spte)
1197 {
1198 unsigned int index;
1199
1200 index = spte - sp->spt;
1201 if (__test_and_set_bit(index, sp->unsync_child_bitmap))
1202 return;
1203 if (sp->unsync_children++)
1204 return;
1205 kvm_mmu_mark_parents_unsync(sp);
1206 }
1207
1208 static void nonpaging_prefetch_page(struct kvm_vcpu *vcpu,
1209 struct kvm_mmu_page *sp)
1210 {
1211 int i;
1212
1213 for (i = 0; i < PT64_ENT_PER_PAGE; ++i)
1214 sp->spt[i] = shadow_trap_nonpresent_pte;
1215 }
1216
1217 static int nonpaging_sync_page(struct kvm_vcpu *vcpu,
1218 struct kvm_mmu_page *sp)
1219 {
1220 return 1;
1221 }
1222
1223 static void nonpaging_invlpg(struct kvm_vcpu *vcpu, gva_t gva)
1224 {
1225 }
1226
1227 static void nonpaging_update_pte(struct kvm_vcpu *vcpu,
1228 struct kvm_mmu_page *sp, u64 *spte,
1229 const void *pte)
1230 {
1231 WARN_ON(1);
1232 }
1233
1234 #define KVM_PAGE_ARRAY_NR 16
1235
1236 struct kvm_mmu_pages {
1237 struct mmu_page_and_offset {
1238 struct kvm_mmu_page *sp;
1239 unsigned int idx;
1240 } page[KVM_PAGE_ARRAY_NR];
1241 unsigned int nr;
1242 };
1243
1244 #define for_each_unsync_children(bitmap, idx) \
1245 for (idx = find_first_bit(bitmap, 512); \
1246 idx < 512; \
1247 idx = find_next_bit(bitmap, 512, idx+1))
1248
1249 static int mmu_pages_add(struct kvm_mmu_pages *pvec, struct kvm_mmu_page *sp,
1250 int idx)
1251 {
1252 int i;
1253
1254 if (sp->unsync)
1255 for (i=0; i < pvec->nr; i++)
1256 if (pvec->page[i].sp == sp)
1257 return 0;
1258
1259 pvec->page[pvec->nr].sp = sp;
1260 pvec->page[pvec->nr].idx = idx;
1261 pvec->nr++;
1262 return (pvec->nr == KVM_PAGE_ARRAY_NR);
1263 }
1264
1265 static int __mmu_unsync_walk(struct kvm_mmu_page *sp,
1266 struct kvm_mmu_pages *pvec)
1267 {
1268 int i, ret, nr_unsync_leaf = 0;
1269
1270 for_each_unsync_children(sp->unsync_child_bitmap, i) {
1271 struct kvm_mmu_page *child;
1272 u64 ent = sp->spt[i];
1273
1274 if (!is_shadow_present_pte(ent) || is_large_pte(ent))
1275 goto clear_child_bitmap;
1276
1277 child = page_header(ent & PT64_BASE_ADDR_MASK);
1278
1279 if (child->unsync_children) {
1280 if (mmu_pages_add(pvec, child, i))
1281 return -ENOSPC;
1282
1283 ret = __mmu_unsync_walk(child, pvec);
1284 if (!ret)
1285 goto clear_child_bitmap;
1286 else if (ret > 0)
1287 nr_unsync_leaf += ret;
1288 else
1289 return ret;
1290 } else if (child->unsync) {
1291 nr_unsync_leaf++;
1292 if (mmu_pages_add(pvec, child, i))
1293 return -ENOSPC;
1294 } else
1295 goto clear_child_bitmap;
1296
1297 continue;
1298
1299 clear_child_bitmap:
1300 __clear_bit(i, sp->unsync_child_bitmap);
1301 sp->unsync_children--;
1302 WARN_ON((int)sp->unsync_children < 0);
1303 }
1304
1305
1306 return nr_unsync_leaf;
1307 }
1308
1309 static int mmu_unsync_walk(struct kvm_mmu_page *sp,
1310 struct kvm_mmu_pages *pvec)
1311 {
1312 if (!sp->unsync_children)
1313 return 0;
1314
1315 mmu_pages_add(pvec, sp, 0);
1316 return __mmu_unsync_walk(sp, pvec);
1317 }
1318
1319 static void kvm_unlink_unsync_page(struct kvm *kvm, struct kvm_mmu_page *sp)
1320 {
1321 WARN_ON(!sp->unsync);
1322 trace_kvm_mmu_sync_page(sp);
1323 sp->unsync = 0;
1324 --kvm->stat.mmu_unsync;
1325 }
1326
1327 static int kvm_mmu_prepare_zap_page(struct kvm *kvm, struct kvm_mmu_page *sp,
1328 struct list_head *invalid_list);
1329 static void kvm_mmu_commit_zap_page(struct kvm *kvm,
1330 struct list_head *invalid_list);
1331
1332 #define for_each_gfn_sp(kvm, sp, gfn, pos) \
1333 hlist_for_each_entry(sp, pos, \
1334 &(kvm)->arch.mmu_page_hash[kvm_page_table_hashfn(gfn)], hash_link) \
1335 if ((sp)->gfn != (gfn)) {} else
1336
1337 #define for_each_gfn_indirect_valid_sp(kvm, sp, gfn, pos) \
1338 hlist_for_each_entry(sp, pos, \
1339 &(kvm)->arch.mmu_page_hash[kvm_page_table_hashfn(gfn)], hash_link) \
1340 if ((sp)->gfn != (gfn) || (sp)->role.direct || \
1341 (sp)->role.invalid) {} else
1342
1343 /* @sp->gfn should be write-protected at the call site */
1344 static int __kvm_sync_page(struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp,
1345 struct list_head *invalid_list, bool clear_unsync)
1346 {
1347 if (sp->role.cr4_pae != !!is_pae(vcpu)) {
1348 kvm_mmu_prepare_zap_page(vcpu->kvm, sp, invalid_list);
1349 return 1;
1350 }
1351
1352 if (clear_unsync)
1353 kvm_unlink_unsync_page(vcpu->kvm, sp);
1354
1355 if (vcpu->arch.mmu.sync_page(vcpu, sp)) {
1356 kvm_mmu_prepare_zap_page(vcpu->kvm, sp, invalid_list);
1357 return 1;
1358 }
1359
1360 kvm_mmu_flush_tlb(vcpu);
1361 return 0;
1362 }
1363
1364 static int kvm_sync_page_transient(struct kvm_vcpu *vcpu,
1365 struct kvm_mmu_page *sp)
1366 {
1367 LIST_HEAD(invalid_list);
1368 int ret;
1369
1370 ret = __kvm_sync_page(vcpu, sp, &invalid_list, false);
1371 if (ret)
1372 kvm_mmu_commit_zap_page(vcpu->kvm, &invalid_list);
1373
1374 return ret;
1375 }
1376
1377 static int kvm_sync_page(struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp,
1378 struct list_head *invalid_list)
1379 {
1380 return __kvm_sync_page(vcpu, sp, invalid_list, true);
1381 }
1382
1383 /* @gfn should be write-protected at the call site */
1384 static void kvm_sync_pages(struct kvm_vcpu *vcpu, gfn_t gfn)
1385 {
1386 struct kvm_mmu_page *s;
1387 struct hlist_node *node;
1388 LIST_HEAD(invalid_list);
1389 bool flush = false;
1390
1391 for_each_gfn_indirect_valid_sp(vcpu->kvm, s, gfn, node) {
1392 if (!s->unsync)
1393 continue;
1394
1395 WARN_ON(s->role.level != PT_PAGE_TABLE_LEVEL);
1396 kvm_unlink_unsync_page(vcpu->kvm, s);
1397 if ((s->role.cr4_pae != !!is_pae(vcpu)) ||
1398 (vcpu->arch.mmu.sync_page(vcpu, s))) {
1399 kvm_mmu_prepare_zap_page(vcpu->kvm, s, &invalid_list);
1400 continue;
1401 }
1402 flush = true;
1403 }
1404
1405 kvm_mmu_commit_zap_page(vcpu->kvm, &invalid_list);
1406 if (flush)
1407 kvm_mmu_flush_tlb(vcpu);
1408 }
1409
1410 struct mmu_page_path {
1411 struct kvm_mmu_page *parent[PT64_ROOT_LEVEL-1];
1412 unsigned int idx[PT64_ROOT_LEVEL-1];
1413 };
1414
1415 #define for_each_sp(pvec, sp, parents, i) \
1416 for (i = mmu_pages_next(&pvec, &parents, -1), \
1417 sp = pvec.page[i].sp; \
1418 i < pvec.nr && ({ sp = pvec.page[i].sp; 1;}); \
1419 i = mmu_pages_next(&pvec, &parents, i))
1420
1421 static int mmu_pages_next(struct kvm_mmu_pages *pvec,
1422 struct mmu_page_path *parents,
1423 int i)
1424 {
1425 int n;
1426
1427 for (n = i+1; n < pvec->nr; n++) {
1428 struct kvm_mmu_page *sp = pvec->page[n].sp;
1429
1430 if (sp->role.level == PT_PAGE_TABLE_LEVEL) {
1431 parents->idx[0] = pvec->page[n].idx;
1432 return n;
1433 }
1434
1435 parents->parent[sp->role.level-2] = sp;
1436 parents->idx[sp->role.level-1] = pvec->page[n].idx;
1437 }
1438
1439 return n;
1440 }
1441
1442 static void mmu_pages_clear_parents(struct mmu_page_path *parents)
1443 {
1444 struct kvm_mmu_page *sp;
1445 unsigned int level = 0;
1446
1447 do {
1448 unsigned int idx = parents->idx[level];
1449
1450 sp = parents->parent[level];
1451 if (!sp)
1452 return;
1453
1454 --sp->unsync_children;
1455 WARN_ON((int)sp->unsync_children < 0);
1456 __clear_bit(idx, sp->unsync_child_bitmap);
1457 level++;
1458 } while (level < PT64_ROOT_LEVEL-1 && !sp->unsync_children);
1459 }
1460
1461 static void kvm_mmu_pages_init(struct kvm_mmu_page *parent,
1462 struct mmu_page_path *parents,
1463 struct kvm_mmu_pages *pvec)
1464 {
1465 parents->parent[parent->role.level-1] = NULL;
1466 pvec->nr = 0;
1467 }
1468
1469 static void mmu_sync_children(struct kvm_vcpu *vcpu,
1470 struct kvm_mmu_page *parent)
1471 {
1472 int i;
1473 struct kvm_mmu_page *sp;
1474 struct mmu_page_path parents;
1475 struct kvm_mmu_pages pages;
1476 LIST_HEAD(invalid_list);
1477
1478 kvm_mmu_pages_init(parent, &parents, &pages);
1479 while (mmu_unsync_walk(parent, &pages)) {
1480 int protected = 0;
1481
1482 for_each_sp(pages, sp, parents, i)
1483 protected |= rmap_write_protect(vcpu->kvm, sp->gfn);
1484
1485 if (protected)
1486 kvm_flush_remote_tlbs(vcpu->kvm);
1487
1488 for_each_sp(pages, sp, parents, i) {
1489 kvm_sync_page(vcpu, sp, &invalid_list);
1490 mmu_pages_clear_parents(&parents);
1491 }
1492 kvm_mmu_commit_zap_page(vcpu->kvm, &invalid_list);
1493 cond_resched_lock(&vcpu->kvm->mmu_lock);
1494 kvm_mmu_pages_init(parent, &parents, &pages);
1495 }
1496 }
1497
1498 static struct kvm_mmu_page *kvm_mmu_get_page(struct kvm_vcpu *vcpu,
1499 gfn_t gfn,
1500 gva_t gaddr,
1501 unsigned level,
1502 int direct,
1503 unsigned access,
1504 u64 *parent_pte)
1505 {
1506 union kvm_mmu_page_role role;
1507 unsigned quadrant;
1508 struct kvm_mmu_page *sp;
1509 struct hlist_node *node;
1510 bool need_sync = false;
1511
1512 role = vcpu->arch.mmu.base_role;
1513 role.level = level;
1514 role.direct = direct;
1515 if (role.direct)
1516 role.cr4_pae = 0;
1517 role.access = access;
1518 if (!vcpu->arch.mmu.direct_map
1519 && vcpu->arch.mmu.root_level <= PT32_ROOT_LEVEL) {
1520 quadrant = gaddr >> (PAGE_SHIFT + (PT64_PT_BITS * level));
1521 quadrant &= (1 << ((PT32_PT_BITS - PT64_PT_BITS) * level)) - 1;
1522 role.quadrant = quadrant;
1523 }
1524 for_each_gfn_sp(vcpu->kvm, sp, gfn, node) {
1525 if (!need_sync && sp->unsync)
1526 need_sync = true;
1527
1528 if (sp->role.word != role.word)
1529 continue;
1530
1531 if (sp->unsync && kvm_sync_page_transient(vcpu, sp))
1532 break;
1533
1534 mmu_page_add_parent_pte(vcpu, sp, parent_pte);
1535 if (sp->unsync_children) {
1536 kvm_make_request(KVM_REQ_MMU_SYNC, vcpu);
1537 kvm_mmu_mark_parents_unsync(sp);
1538 } else if (sp->unsync)
1539 kvm_mmu_mark_parents_unsync(sp);
1540
1541 trace_kvm_mmu_get_page(sp, false);
1542 return sp;
1543 }
1544 ++vcpu->kvm->stat.mmu_cache_miss;
1545 sp = kvm_mmu_alloc_page(vcpu, parent_pte, direct);
1546 if (!sp)
1547 return sp;
1548 sp->gfn = gfn;
1549 sp->role = role;
1550 hlist_add_head(&sp->hash_link,
1551 &vcpu->kvm->arch.mmu_page_hash[kvm_page_table_hashfn(gfn)]);
1552 if (!direct) {
1553 if (rmap_write_protect(vcpu->kvm, gfn))
1554 kvm_flush_remote_tlbs(vcpu->kvm);
1555 if (level > PT_PAGE_TABLE_LEVEL && need_sync)
1556 kvm_sync_pages(vcpu, gfn);
1557
1558 account_shadowed(vcpu->kvm, gfn);
1559 }
1560 if (shadow_trap_nonpresent_pte != shadow_notrap_nonpresent_pte)
1561 vcpu->arch.mmu.prefetch_page(vcpu, sp);
1562 else
1563 nonpaging_prefetch_page(vcpu, sp);
1564 trace_kvm_mmu_get_page(sp, true);
1565 return sp;
1566 }
1567
1568 static void shadow_walk_init(struct kvm_shadow_walk_iterator *iterator,
1569 struct kvm_vcpu *vcpu, u64 addr)
1570 {
1571 iterator->addr = addr;
1572 iterator->shadow_addr = vcpu->arch.mmu.root_hpa;
1573 iterator->level = vcpu->arch.mmu.shadow_root_level;
1574
1575 if (iterator->level == PT64_ROOT_LEVEL &&
1576 vcpu->arch.mmu.root_level < PT64_ROOT_LEVEL &&
1577 !vcpu->arch.mmu.direct_map)
1578 --iterator->level;
1579
1580 if (iterator->level == PT32E_ROOT_LEVEL) {
1581 iterator->shadow_addr
1582 = vcpu->arch.mmu.pae_root[(addr >> 30) & 3];
1583 iterator->shadow_addr &= PT64_BASE_ADDR_MASK;
1584 --iterator->level;
1585 if (!iterator->shadow_addr)
1586 iterator->level = 0;
1587 }
1588 }
1589
1590 static bool shadow_walk_okay(struct kvm_shadow_walk_iterator *iterator)
1591 {
1592 if (iterator->level < PT_PAGE_TABLE_LEVEL)
1593 return false;
1594
1595 if (iterator->level == PT_PAGE_TABLE_LEVEL)
1596 if (is_large_pte(*iterator->sptep))
1597 return false;
1598
1599 iterator->index = SHADOW_PT_INDEX(iterator->addr, iterator->level);
1600 iterator->sptep = ((u64 *)__va(iterator->shadow_addr)) + iterator->index;
1601 return true;
1602 }
1603
1604 static void shadow_walk_next(struct kvm_shadow_walk_iterator *iterator)
1605 {
1606 iterator->shadow_addr = *iterator->sptep & PT64_BASE_ADDR_MASK;
1607 --iterator->level;
1608 }
1609
1610 static void link_shadow_page(u64 *sptep, struct kvm_mmu_page *sp)
1611 {
1612 u64 spte;
1613
1614 spte = __pa(sp->spt)
1615 | PT_PRESENT_MASK | PT_ACCESSED_MASK
1616 | PT_WRITABLE_MASK | PT_USER_MASK;
1617 __set_spte(sptep, spte);
1618 }
1619
1620 static void drop_large_spte(struct kvm_vcpu *vcpu, u64 *sptep)
1621 {
1622 if (is_large_pte(*sptep)) {
1623 drop_spte(vcpu->kvm, sptep, shadow_trap_nonpresent_pte);
1624 kvm_flush_remote_tlbs(vcpu->kvm);
1625 }
1626 }
1627
1628 static void validate_direct_spte(struct kvm_vcpu *vcpu, u64 *sptep,
1629 unsigned direct_access)
1630 {
1631 if (is_shadow_present_pte(*sptep) && !is_large_pte(*sptep)) {
1632 struct kvm_mmu_page *child;
1633
1634 /*
1635 * For the direct sp, if the guest pte's dirty bit
1636 * changed form clean to dirty, it will corrupt the
1637 * sp's access: allow writable in the read-only sp,
1638 * so we should update the spte at this point to get
1639 * a new sp with the correct access.
1640 */
1641 child = page_header(*sptep & PT64_BASE_ADDR_MASK);
1642 if (child->role.access == direct_access)
1643 return;
1644
1645 mmu_page_remove_parent_pte(child, sptep);
1646 __set_spte(sptep, shadow_trap_nonpresent_pte);
1647 kvm_flush_remote_tlbs(vcpu->kvm);
1648 }
1649 }
1650
1651 static void kvm_mmu_page_unlink_children(struct kvm *kvm,
1652 struct kvm_mmu_page *sp)
1653 {
1654 unsigned i;
1655 u64 *pt;
1656 u64 ent;
1657
1658 pt = sp->spt;
1659
1660 for (i = 0; i < PT64_ENT_PER_PAGE; ++i) {
1661 ent = pt[i];
1662
1663 if (is_shadow_present_pte(ent)) {
1664 if (!is_last_spte(ent, sp->role.level)) {
1665 ent &= PT64_BASE_ADDR_MASK;
1666 mmu_page_remove_parent_pte(page_header(ent),
1667 &pt[i]);
1668 } else {
1669 if (is_large_pte(ent))
1670 --kvm->stat.lpages;
1671 drop_spte(kvm, &pt[i],
1672 shadow_trap_nonpresent_pte);
1673 }
1674 }
1675 pt[i] = shadow_trap_nonpresent_pte;
1676 }
1677 }
1678
1679 static void kvm_mmu_put_page(struct kvm_mmu_page *sp, u64 *parent_pte)
1680 {
1681 mmu_page_remove_parent_pte(sp, parent_pte);
1682 }
1683
1684 static void kvm_mmu_reset_last_pte_updated(struct kvm *kvm)
1685 {
1686 int i;
1687 struct kvm_vcpu *vcpu;
1688
1689 kvm_for_each_vcpu(i, vcpu, kvm)
1690 vcpu->arch.last_pte_updated = NULL;
1691 }
1692
1693 static void kvm_mmu_unlink_parents(struct kvm *kvm, struct kvm_mmu_page *sp)
1694 {
1695 u64 *parent_pte;
1696
1697 while (sp->multimapped || sp->parent_pte) {
1698 if (!sp->multimapped)
1699 parent_pte = sp->parent_pte;
1700 else {
1701 struct kvm_pte_chain *chain;
1702
1703 chain = container_of(sp->parent_ptes.first,
1704 struct kvm_pte_chain, link);
1705 parent_pte = chain->parent_ptes[0];
1706 }
1707 BUG_ON(!parent_pte);
1708 kvm_mmu_put_page(sp, parent_pte);
1709 __set_spte(parent_pte, shadow_trap_nonpresent_pte);
1710 }
1711 }
1712
1713 static int mmu_zap_unsync_children(struct kvm *kvm,
1714 struct kvm_mmu_page *parent,
1715 struct list_head *invalid_list)
1716 {
1717 int i, zapped = 0;
1718 struct mmu_page_path parents;
1719 struct kvm_mmu_pages pages;
1720
1721 if (parent->role.level == PT_PAGE_TABLE_LEVEL)
1722 return 0;
1723
1724 kvm_mmu_pages_init(parent, &parents, &pages);
1725 while (mmu_unsync_walk(parent, &pages)) {
1726 struct kvm_mmu_page *sp;
1727
1728 for_each_sp(pages, sp, parents, i) {
1729 kvm_mmu_prepare_zap_page(kvm, sp, invalid_list);
1730 mmu_pages_clear_parents(&parents);
1731 zapped++;
1732 }
1733 kvm_mmu_pages_init(parent, &parents, &pages);
1734 }
1735
1736 return zapped;
1737 }
1738
1739 static int kvm_mmu_prepare_zap_page(struct kvm *kvm, struct kvm_mmu_page *sp,
1740 struct list_head *invalid_list)
1741 {
1742 int ret;
1743
1744 trace_kvm_mmu_prepare_zap_page(sp);
1745 ++kvm->stat.mmu_shadow_zapped;
1746 ret = mmu_zap_unsync_children(kvm, sp, invalid_list);
1747 kvm_mmu_page_unlink_children(kvm, sp);
1748 kvm_mmu_unlink_parents(kvm, sp);
1749 if (!sp->role.invalid && !sp->role.direct)
1750 unaccount_shadowed(kvm, sp->gfn);
1751 if (sp->unsync)
1752 kvm_unlink_unsync_page(kvm, sp);
1753 if (!sp->root_count) {
1754 /* Count self */
1755 ret++;
1756 list_move(&sp->link, invalid_list);
1757 } else {
1758 list_move(&sp->link, &kvm->arch.active_mmu_pages);
1759 kvm_reload_remote_mmus(kvm);
1760 }
1761
1762 sp->role.invalid = 1;
1763 kvm_mmu_reset_last_pte_updated(kvm);
1764 return ret;
1765 }
1766
1767 static void kvm_mmu_commit_zap_page(struct kvm *kvm,
1768 struct list_head *invalid_list)
1769 {
1770 struct kvm_mmu_page *sp;
1771
1772 if (list_empty(invalid_list))
1773 return;
1774
1775 kvm_flush_remote_tlbs(kvm);
1776
1777 do {
1778 sp = list_first_entry(invalid_list, struct kvm_mmu_page, link);
1779 WARN_ON(!sp->role.invalid || sp->root_count);
1780 kvm_mmu_free_page(kvm, sp);
1781 } while (!list_empty(invalid_list));
1782
1783 }
1784
1785 /*
1786 * Changing the number of mmu pages allocated to the vm
1787 * Note: if goal_nr_mmu_pages is too small, you will get dead lock
1788 */
1789 void kvm_mmu_change_mmu_pages(struct kvm *kvm, unsigned int goal_nr_mmu_pages)
1790 {
1791 LIST_HEAD(invalid_list);
1792 /*
1793 * If we set the number of mmu pages to be smaller be than the
1794 * number of actived pages , we must to free some mmu pages before we
1795 * change the value
1796 */
1797
1798 if (kvm->arch.n_used_mmu_pages > goal_nr_mmu_pages) {
1799 while (kvm->arch.n_used_mmu_pages > goal_nr_mmu_pages &&
1800 !list_empty(&kvm->arch.active_mmu_pages)) {
1801 struct kvm_mmu_page *page;
1802
1803 page = container_of(kvm->arch.active_mmu_pages.prev,
1804 struct kvm_mmu_page, link);
1805 kvm_mmu_prepare_zap_page(kvm, page, &invalid_list);
1806 kvm_mmu_commit_zap_page(kvm, &invalid_list);
1807 }
1808 goal_nr_mmu_pages = kvm->arch.n_used_mmu_pages;
1809 }
1810
1811 kvm->arch.n_max_mmu_pages = goal_nr_mmu_pages;
1812 }
1813
1814 static int kvm_mmu_unprotect_page(struct kvm *kvm, gfn_t gfn)
1815 {
1816 struct kvm_mmu_page *sp;
1817 struct hlist_node *node;
1818 LIST_HEAD(invalid_list);
1819 int r;
1820
1821 pgprintk("%s: looking for gfn %llx\n", __func__, gfn);
1822 r = 0;
1823
1824 for_each_gfn_indirect_valid_sp(kvm, sp, gfn, node) {
1825 pgprintk("%s: gfn %llx role %x\n", __func__, gfn,
1826 sp->role.word);
1827 r = 1;
1828 kvm_mmu_prepare_zap_page(kvm, sp, &invalid_list);
1829 }
1830 kvm_mmu_commit_zap_page(kvm, &invalid_list);
1831 return r;
1832 }
1833
1834 static void mmu_unshadow(struct kvm *kvm, gfn_t gfn)
1835 {
1836 struct kvm_mmu_page *sp;
1837 struct hlist_node *node;
1838 LIST_HEAD(invalid_list);
1839
1840 for_each_gfn_indirect_valid_sp(kvm, sp, gfn, node) {
1841 pgprintk("%s: zap %llx %x\n",
1842 __func__, gfn, sp->role.word);
1843 kvm_mmu_prepare_zap_page(kvm, sp, &invalid_list);
1844 }
1845 kvm_mmu_commit_zap_page(kvm, &invalid_list);
1846 }
1847
1848 static void page_header_update_slot(struct kvm *kvm, void *pte, gfn_t gfn)
1849 {
1850 int slot = memslot_id(kvm, gfn);
1851 struct kvm_mmu_page *sp = page_header(__pa(pte));
1852
1853 __set_bit(slot, sp->slot_bitmap);
1854 }
1855
1856 static void mmu_convert_notrap(struct kvm_mmu_page *sp)
1857 {
1858 int i;
1859 u64 *pt = sp->spt;
1860
1861 if (shadow_trap_nonpresent_pte == shadow_notrap_nonpresent_pte)
1862 return;
1863
1864 for (i = 0; i < PT64_ENT_PER_PAGE; ++i) {
1865 if (pt[i] == shadow_notrap_nonpresent_pte)
1866 __set_spte(&pt[i], shadow_trap_nonpresent_pte);
1867 }
1868 }
1869
1870 /*
1871 * The function is based on mtrr_type_lookup() in
1872 * arch/x86/kernel/cpu/mtrr/generic.c
1873 */
1874 static int get_mtrr_type(struct mtrr_state_type *mtrr_state,
1875 u64 start, u64 end)
1876 {
1877 int i;
1878 u64 base, mask;
1879 u8 prev_match, curr_match;
1880 int num_var_ranges = KVM_NR_VAR_MTRR;
1881
1882 if (!mtrr_state->enabled)
1883 return 0xFF;
1884
1885 /* Make end inclusive end, instead of exclusive */
1886 end--;
1887
1888 /* Look in fixed ranges. Just return the type as per start */
1889 if (mtrr_state->have_fixed && (start < 0x100000)) {
1890 int idx;
1891
1892 if (start < 0x80000) {
1893 idx = 0;
1894 idx += (start >> 16);
1895 return mtrr_state->fixed_ranges[idx];
1896 } else if (start < 0xC0000) {
1897 idx = 1 * 8;
1898 idx += ((start - 0x80000) >> 14);
1899 return mtrr_state->fixed_ranges[idx];
1900 } else if (start < 0x1000000) {
1901 idx = 3 * 8;
1902 idx += ((start - 0xC0000) >> 12);
1903 return mtrr_state->fixed_ranges[idx];
1904 }
1905 }
1906
1907 /*
1908 * Look in variable ranges
1909 * Look of multiple ranges matching this address and pick type
1910 * as per MTRR precedence
1911 */
1912 if (!(mtrr_state->enabled & 2))
1913 return mtrr_state->def_type;
1914
1915 prev_match = 0xFF;
1916 for (i = 0; i < num_var_ranges; ++i) {
1917 unsigned short start_state, end_state;
1918
1919 if (!(mtrr_state->var_ranges[i].mask_lo & (1 << 11)))
1920 continue;
1921
1922 base = (((u64)mtrr_state->var_ranges[i].base_hi) << 32) +
1923 (mtrr_state->var_ranges[i].base_lo & PAGE_MASK);
1924 mask = (((u64)mtrr_state->var_ranges[i].mask_hi) << 32) +
1925 (mtrr_state->var_ranges[i].mask_lo & PAGE_MASK);
1926
1927 start_state = ((start & mask) == (base & mask));
1928 end_state = ((end & mask) == (base & mask));
1929 if (start_state != end_state)
1930 return 0xFE;
1931
1932 if ((start & mask) != (base & mask))
1933 continue;
1934
1935 curr_match = mtrr_state->var_ranges[i].base_lo & 0xff;
1936 if (prev_match == 0xFF) {
1937 prev_match = curr_match;
1938 continue;
1939 }
1940
1941 if (prev_match == MTRR_TYPE_UNCACHABLE ||
1942 curr_match == MTRR_TYPE_UNCACHABLE)
1943 return MTRR_TYPE_UNCACHABLE;
1944
1945 if ((prev_match == MTRR_TYPE_WRBACK &&
1946 curr_match == MTRR_TYPE_WRTHROUGH) ||
1947 (prev_match == MTRR_TYPE_WRTHROUGH &&
1948 curr_match == MTRR_TYPE_WRBACK)) {
1949 prev_match = MTRR_TYPE_WRTHROUGH;
1950 curr_match = MTRR_TYPE_WRTHROUGH;
1951 }
1952
1953 if (prev_match != curr_match)
1954 return MTRR_TYPE_UNCACHABLE;
1955 }
1956
1957 if (prev_match != 0xFF)
1958 return prev_match;
1959
1960 return mtrr_state->def_type;
1961 }
1962
1963 u8 kvm_get_guest_memory_type(struct kvm_vcpu *vcpu, gfn_t gfn)
1964 {
1965 u8 mtrr;
1966
1967 mtrr = get_mtrr_type(&vcpu->arch.mtrr_state, gfn << PAGE_SHIFT,
1968 (gfn << PAGE_SHIFT) + PAGE_SIZE);
1969 if (mtrr == 0xfe || mtrr == 0xff)
1970 mtrr = MTRR_TYPE_WRBACK;
1971 return mtrr;
1972 }
1973 EXPORT_SYMBOL_GPL(kvm_get_guest_memory_type);
1974
1975 static void __kvm_unsync_page(struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp)
1976 {
1977 trace_kvm_mmu_unsync_page(sp);
1978 ++vcpu->kvm->stat.mmu_unsync;
1979 sp->unsync = 1;
1980
1981 kvm_mmu_mark_parents_unsync(sp);
1982 mmu_convert_notrap(sp);
1983 }
1984
1985 static void kvm_unsync_pages(struct kvm_vcpu *vcpu, gfn_t gfn)
1986 {
1987 struct kvm_mmu_page *s;
1988 struct hlist_node *node;
1989
1990 for_each_gfn_indirect_valid_sp(vcpu->kvm, s, gfn, node) {
1991 if (s->unsync)
1992 continue;
1993 WARN_ON(s->role.level != PT_PAGE_TABLE_LEVEL);
1994 __kvm_unsync_page(vcpu, s);
1995 }
1996 }
1997
1998 static int mmu_need_write_protect(struct kvm_vcpu *vcpu, gfn_t gfn,
1999 bool can_unsync)
2000 {
2001 struct kvm_mmu_page *s;
2002 struct hlist_node *node;
2003 bool need_unsync = false;
2004
2005 for_each_gfn_indirect_valid_sp(vcpu->kvm, s, gfn, node) {
2006 if (!can_unsync)
2007 return 1;
2008
2009 if (s->role.level != PT_PAGE_TABLE_LEVEL)
2010 return 1;
2011
2012 if (!need_unsync && !s->unsync) {
2013 if (!oos_shadow)
2014 return 1;
2015 need_unsync = true;
2016 }
2017 }
2018 if (need_unsync)
2019 kvm_unsync_pages(vcpu, gfn);
2020 return 0;
2021 }
2022
2023 static int set_spte(struct kvm_vcpu *vcpu, u64 *sptep,
2024 unsigned pte_access, int user_fault,
2025 int write_fault, int dirty, int level,
2026 gfn_t gfn, pfn_t pfn, bool speculative,
2027 bool can_unsync, bool host_writable)
2028 {
2029 u64 spte, entry = *sptep;
2030 int ret = 0;
2031
2032 /*
2033 * We don't set the accessed bit, since we sometimes want to see
2034 * whether the guest actually used the pte (in order to detect
2035 * demand paging).
2036 */
2037 spte = PT_PRESENT_MASK;
2038 if (!speculative)
2039 spte |= shadow_accessed_mask;
2040 if (!dirty)
2041 pte_access &= ~ACC_WRITE_MASK;
2042 if (pte_access & ACC_EXEC_MASK)
2043 spte |= shadow_x_mask;
2044 else
2045 spte |= shadow_nx_mask;
2046 if (pte_access & ACC_USER_MASK)
2047 spte |= shadow_user_mask;
2048 if (level > PT_PAGE_TABLE_LEVEL)
2049 spte |= PT_PAGE_SIZE_MASK;
2050 if (tdp_enabled)
2051 spte |= kvm_x86_ops->get_mt_mask(vcpu, gfn,
2052 kvm_is_mmio_pfn(pfn));
2053
2054 if (host_writable)
2055 spte |= SPTE_HOST_WRITEABLE;
2056 else
2057 pte_access &= ~ACC_WRITE_MASK;
2058
2059 spte |= (u64)pfn << PAGE_SHIFT;
2060
2061 if ((pte_access & ACC_WRITE_MASK)
2062 || (!vcpu->arch.mmu.direct_map && write_fault
2063 && !is_write_protection(vcpu) && !user_fault)) {
2064
2065 if (level > PT_PAGE_TABLE_LEVEL &&
2066 has_wrprotected_page(vcpu->kvm, gfn, level)) {
2067 ret = 1;
2068 drop_spte(vcpu->kvm, sptep, shadow_trap_nonpresent_pte);
2069 goto done;
2070 }
2071
2072 spte |= PT_WRITABLE_MASK;
2073
2074 if (!vcpu->arch.mmu.direct_map
2075 && !(pte_access & ACC_WRITE_MASK))
2076 spte &= ~PT_USER_MASK;
2077
2078 /*
2079 * Optimization: for pte sync, if spte was writable the hash
2080 * lookup is unnecessary (and expensive). Write protection
2081 * is responsibility of mmu_get_page / kvm_sync_page.
2082 * Same reasoning can be applied to dirty page accounting.
2083 */
2084 if (!can_unsync && is_writable_pte(*sptep))
2085 goto set_pte;
2086
2087 if (mmu_need_write_protect(vcpu, gfn, can_unsync)) {
2088 pgprintk("%s: found shadow page for %llx, marking ro\n",
2089 __func__, gfn);
2090 ret = 1;
2091 pte_access &= ~ACC_WRITE_MASK;
2092 if (is_writable_pte(spte))
2093 spte &= ~PT_WRITABLE_MASK;
2094 }
2095 }
2096
2097 if (pte_access & ACC_WRITE_MASK)
2098 mark_page_dirty(vcpu->kvm, gfn);
2099
2100 set_pte:
2101 update_spte(sptep, spte);
2102 /*
2103 * If we overwrite a writable spte with a read-only one we
2104 * should flush remote TLBs. Otherwise rmap_write_protect
2105 * will find a read-only spte, even though the writable spte
2106 * might be cached on a CPU's TLB.
2107 */
2108 if (is_writable_pte(entry) && !is_writable_pte(*sptep))
2109 kvm_flush_remote_tlbs(vcpu->kvm);
2110 done:
2111 return ret;
2112 }
2113
2114 static void mmu_set_spte(struct kvm_vcpu *vcpu, u64 *sptep,
2115 unsigned pt_access, unsigned pte_access,
2116 int user_fault, int write_fault, int dirty,
2117 int *ptwrite, int level, gfn_t gfn,
2118 pfn_t pfn, bool speculative,
2119 bool host_writable)
2120 {
2121 int was_rmapped = 0;
2122 int rmap_count;
2123
2124 pgprintk("%s: spte %llx access %x write_fault %d"
2125 " user_fault %d gfn %llx\n",
2126 __func__, *sptep, pt_access,
2127 write_fault, user_fault, gfn);
2128
2129 if (is_rmap_spte(*sptep)) {
2130 /*
2131 * If we overwrite a PTE page pointer with a 2MB PMD, unlink
2132 * the parent of the now unreachable PTE.
2133 */
2134 if (level > PT_PAGE_TABLE_LEVEL &&
2135 !is_large_pte(*sptep)) {
2136 struct kvm_mmu_page *child;
2137 u64 pte = *sptep;
2138
2139 child = page_header(pte & PT64_BASE_ADDR_MASK);
2140 mmu_page_remove_parent_pte(child, sptep);
2141 __set_spte(sptep, shadow_trap_nonpresent_pte);
2142 kvm_flush_remote_tlbs(vcpu->kvm);
2143 } else if (pfn != spte_to_pfn(*sptep)) {
2144 pgprintk("hfn old %llx new %llx\n",
2145 spte_to_pfn(*sptep), pfn);
2146 drop_spte(vcpu->kvm, sptep, shadow_trap_nonpresent_pte);
2147 kvm_flush_remote_tlbs(vcpu->kvm);
2148 } else
2149 was_rmapped = 1;
2150 }
2151
2152 if (set_spte(vcpu, sptep, pte_access, user_fault, write_fault,
2153 dirty, level, gfn, pfn, speculative, true,
2154 host_writable)) {
2155 if (write_fault)
2156 *ptwrite = 1;
2157 kvm_mmu_flush_tlb(vcpu);
2158 }
2159
2160 pgprintk("%s: setting spte %llx\n", __func__, *sptep);
2161 pgprintk("instantiating %s PTE (%s) at %llx (%llx) addr %p\n",
2162 is_large_pte(*sptep)? "2MB" : "4kB",
2163 *sptep & PT_PRESENT_MASK ?"RW":"R", gfn,
2164 *sptep, sptep);
2165 if (!was_rmapped && is_large_pte(*sptep))
2166 ++vcpu->kvm->stat.lpages;
2167
2168 page_header_update_slot(vcpu->kvm, sptep, gfn);
2169 if (!was_rmapped) {
2170 rmap_count = rmap_add(vcpu, sptep, gfn);
2171 if (rmap_count > RMAP_RECYCLE_THRESHOLD)
2172 rmap_recycle(vcpu, sptep, gfn);
2173 }
2174 kvm_release_pfn_clean(pfn);
2175 if (speculative) {
2176 vcpu->arch.last_pte_updated = sptep;
2177 vcpu->arch.last_pte_gfn = gfn;
2178 }
2179 }
2180
2181 static void nonpaging_new_cr3(struct kvm_vcpu *vcpu)
2182 {
2183 }
2184
2185 static pfn_t pte_prefetch_gfn_to_pfn(struct kvm_vcpu *vcpu, gfn_t gfn,
2186 bool no_dirty_log)
2187 {
2188 struct kvm_memory_slot *slot;
2189 unsigned long hva;
2190
2191 slot = gfn_to_memslot_dirty_bitmap(vcpu, gfn, no_dirty_log);
2192 if (!slot) {
2193 get_page(bad_page);
2194 return page_to_pfn(bad_page);
2195 }
2196
2197 hva = gfn_to_hva_memslot(slot, gfn);
2198
2199 return hva_to_pfn_atomic(vcpu->kvm, hva);
2200 }
2201
2202 static int direct_pte_prefetch_many(struct kvm_vcpu *vcpu,
2203 struct kvm_mmu_page *sp,
2204 u64 *start, u64 *end)
2205 {
2206 struct page *pages[PTE_PREFETCH_NUM];
2207 unsigned access = sp->role.access;
2208 int i, ret;
2209 gfn_t gfn;
2210
2211 gfn = kvm_mmu_page_get_gfn(sp, start - sp->spt);
2212 if (!gfn_to_memslot_dirty_bitmap(vcpu, gfn, access & ACC_WRITE_MASK))
2213 return -1;
2214
2215 ret = gfn_to_page_many_atomic(vcpu->kvm, gfn, pages, end - start);
2216 if (ret <= 0)
2217 return -1;
2218
2219 for (i = 0; i < ret; i++, gfn++, start++)
2220 mmu_set_spte(vcpu, start, ACC_ALL,
2221 access, 0, 0, 1, NULL,
2222 sp->role.level, gfn,
2223 page_to_pfn(pages[i]), true, true);
2224
2225 return 0;
2226 }
2227
2228 static void __direct_pte_prefetch(struct kvm_vcpu *vcpu,
2229 struct kvm_mmu_page *sp, u64 *sptep)
2230 {
2231 u64 *spte, *start = NULL;
2232 int i;
2233
2234 WARN_ON(!sp->role.direct);
2235
2236 i = (sptep - sp->spt) & ~(PTE_PREFETCH_NUM - 1);
2237 spte = sp->spt + i;
2238
2239 for (i = 0; i < PTE_PREFETCH_NUM; i++, spte++) {
2240 if (*spte != shadow_trap_nonpresent_pte || spte == sptep) {
2241 if (!start)
2242 continue;
2243 if (direct_pte_prefetch_many(vcpu, sp, start, spte) < 0)
2244 break;
2245 start = NULL;
2246 } else if (!start)
2247 start = spte;
2248 }
2249 }
2250
2251 static void direct_pte_prefetch(struct kvm_vcpu *vcpu, u64 *sptep)
2252 {
2253 struct kvm_mmu_page *sp;
2254
2255 /*
2256 * Since it's no accessed bit on EPT, it's no way to
2257 * distinguish between actually accessed translations
2258 * and prefetched, so disable pte prefetch if EPT is
2259 * enabled.
2260 */
2261 if (!shadow_accessed_mask)
2262 return;
2263
2264 sp = page_header(__pa(sptep));
2265 if (sp->role.level > PT_PAGE_TABLE_LEVEL)
2266 return;
2267
2268 __direct_pte_prefetch(vcpu, sp, sptep);
2269 }
2270
2271 static int __direct_map(struct kvm_vcpu *vcpu, gpa_t v, int write,
2272 int map_writable, int level, gfn_t gfn, pfn_t pfn,
2273 bool prefault)
2274 {
2275 struct kvm_shadow_walk_iterator iterator;
2276 struct kvm_mmu_page *sp;
2277 int pt_write = 0;
2278 gfn_t pseudo_gfn;
2279
2280 for_each_shadow_entry(vcpu, (u64)gfn << PAGE_SHIFT, iterator) {
2281 if (iterator.level == level) {
2282 unsigned pte_access = ACC_ALL;
2283
2284 mmu_set_spte(vcpu, iterator.sptep, ACC_ALL, pte_access,
2285 0, write, 1, &pt_write,
2286 level, gfn, pfn, prefault, map_writable);
2287 direct_pte_prefetch(vcpu, iterator.sptep);
2288 ++vcpu->stat.pf_fixed;
2289 break;
2290 }
2291
2292 if (*iterator.sptep == shadow_trap_nonpresent_pte) {
2293 u64 base_addr = iterator.addr;
2294
2295 base_addr &= PT64_LVL_ADDR_MASK(iterator.level);
2296 pseudo_gfn = base_addr >> PAGE_SHIFT;
2297 sp = kvm_mmu_get_page(vcpu, pseudo_gfn, iterator.addr,
2298 iterator.level - 1,
2299 1, ACC_ALL, iterator.sptep);
2300 if (!sp) {
2301 pgprintk("nonpaging_map: ENOMEM\n");
2302 kvm_release_pfn_clean(pfn);
2303 return -ENOMEM;
2304 }
2305
2306 __set_spte(iterator.sptep,
2307 __pa(sp->spt)
2308 | PT_PRESENT_MASK | PT_WRITABLE_MASK
2309 | shadow_user_mask | shadow_x_mask
2310 | shadow_accessed_mask);
2311 }
2312 }
2313 return pt_write;
2314 }
2315
2316 static void kvm_send_hwpoison_signal(unsigned long address, struct task_struct *tsk)
2317 {
2318 siginfo_t info;
2319
2320 info.si_signo = SIGBUS;
2321 info.si_errno = 0;
2322 info.si_code = BUS_MCEERR_AR;
2323 info.si_addr = (void __user *)address;
2324 info.si_addr_lsb = PAGE_SHIFT;
2325
2326 send_sig_info(SIGBUS, &info, tsk);
2327 }
2328
2329 static int kvm_handle_bad_page(struct kvm *kvm, gfn_t gfn, pfn_t pfn)
2330 {
2331 kvm_release_pfn_clean(pfn);
2332 if (is_hwpoison_pfn(pfn)) {
2333 kvm_send_hwpoison_signal(gfn_to_hva(kvm, gfn), current);
2334 return 0;
2335 } else if (is_fault_pfn(pfn))
2336 return -EFAULT;
2337
2338 return 1;
2339 }
2340
2341 static void transparent_hugepage_adjust(struct kvm_vcpu *vcpu,
2342 gfn_t *gfnp, pfn_t *pfnp, int *levelp)
2343 {
2344 pfn_t pfn = *pfnp;
2345 gfn_t gfn = *gfnp;
2346 int level = *levelp;
2347
2348 /*
2349 * Check if it's a transparent hugepage. If this would be an
2350 * hugetlbfs page, level wouldn't be set to
2351 * PT_PAGE_TABLE_LEVEL and there would be no adjustment done
2352 * here.
2353 */
2354 if (!is_error_pfn(pfn) && !kvm_is_mmio_pfn(pfn) &&
2355 level == PT_PAGE_TABLE_LEVEL &&
2356 PageTransCompound(pfn_to_page(pfn)) &&
2357 !has_wrprotected_page(vcpu->kvm, gfn, PT_DIRECTORY_LEVEL)) {
2358 unsigned long mask;
2359 /*
2360 * mmu_notifier_retry was successful and we hold the
2361 * mmu_lock here, so the pmd can't become splitting
2362 * from under us, and in turn
2363 * __split_huge_page_refcount() can't run from under
2364 * us and we can safely transfer the refcount from
2365 * PG_tail to PG_head as we switch the pfn to tail to
2366 * head.
2367 */
2368 *levelp = level = PT_DIRECTORY_LEVEL;
2369 mask = KVM_PAGES_PER_HPAGE(level) - 1;
2370 VM_BUG_ON((gfn & mask) != (pfn & mask));
2371 if (pfn & mask) {
2372 gfn &= ~mask;
2373 *gfnp = gfn;
2374 kvm_release_pfn_clean(pfn);
2375 pfn &= ~mask;
2376 if (!get_page_unless_zero(pfn_to_page(pfn)))
2377 BUG();
2378 *pfnp = pfn;
2379 }
2380 }
2381 }
2382
2383 static bool try_async_pf(struct kvm_vcpu *vcpu, bool prefault, gfn_t gfn,
2384 gva_t gva, pfn_t *pfn, bool write, bool *writable);
2385
2386 static int nonpaging_map(struct kvm_vcpu *vcpu, gva_t v, int write, gfn_t gfn,
2387 bool prefault)
2388 {
2389 int r;
2390 int level;
2391 int force_pt_level;
2392 pfn_t pfn;
2393 unsigned long mmu_seq;
2394 bool map_writable;
2395
2396 force_pt_level = mapping_level_dirty_bitmap(vcpu, gfn);
2397 if (likely(!force_pt_level)) {
2398 level = mapping_level(vcpu, gfn);
2399 /*
2400 * This path builds a PAE pagetable - so we can map
2401 * 2mb pages at maximum. Therefore check if the level
2402 * is larger than that.
2403 */
2404 if (level > PT_DIRECTORY_LEVEL)
2405 level = PT_DIRECTORY_LEVEL;
2406
2407 gfn &= ~(KVM_PAGES_PER_HPAGE(level) - 1);
2408 } else
2409 level = PT_PAGE_TABLE_LEVEL;
2410
2411 mmu_seq = vcpu->kvm->mmu_notifier_seq;
2412 smp_rmb();
2413
2414 if (try_async_pf(vcpu, prefault, gfn, v, &pfn, write, &map_writable))
2415 return 0;
2416
2417 /* mmio */
2418 if (is_error_pfn(pfn))
2419 return kvm_handle_bad_page(vcpu->kvm, gfn, pfn);
2420
2421 spin_lock(&vcpu->kvm->mmu_lock);
2422 if (mmu_notifier_retry(vcpu, mmu_seq))
2423 goto out_unlock;
2424 kvm_mmu_free_some_pages(vcpu);
2425 if (likely(!force_pt_level))
2426 transparent_hugepage_adjust(vcpu, &gfn, &pfn, &level);
2427 r = __direct_map(vcpu, v, write, map_writable, level, gfn, pfn,
2428 prefault);
2429 spin_unlock(&vcpu->kvm->mmu_lock);
2430
2431
2432 return r;
2433
2434 out_unlock:
2435 spin_unlock(&vcpu->kvm->mmu_lock);
2436 kvm_release_pfn_clean(pfn);
2437 return 0;
2438 }
2439
2440
2441 static void mmu_free_roots(struct kvm_vcpu *vcpu)
2442 {
2443 int i;
2444 struct kvm_mmu_page *sp;
2445 LIST_HEAD(invalid_list);
2446
2447 if (!VALID_PAGE(vcpu->arch.mmu.root_hpa))
2448 return;
2449 spin_lock(&vcpu->kvm->mmu_lock);
2450 if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL &&
2451 (vcpu->arch.mmu.root_level == PT64_ROOT_LEVEL ||
2452 vcpu->arch.mmu.direct_map)) {
2453 hpa_t root = vcpu->arch.mmu.root_hpa;
2454
2455 sp = page_header(root);
2456 --sp->root_count;
2457 if (!sp->root_count && sp->role.invalid) {
2458 kvm_mmu_prepare_zap_page(vcpu->kvm, sp, &invalid_list);
2459 kvm_mmu_commit_zap_page(vcpu->kvm, &invalid_list);
2460 }
2461 vcpu->arch.mmu.root_hpa = INVALID_PAGE;
2462 spin_unlock(&vcpu->kvm->mmu_lock);
2463 return;
2464 }
2465 for (i = 0; i < 4; ++i) {
2466 hpa_t root = vcpu->arch.mmu.pae_root[i];
2467
2468 if (root) {
2469 root &= PT64_BASE_ADDR_MASK;
2470 sp = page_header(root);
2471 --sp->root_count;
2472 if (!sp->root_count && sp->role.invalid)
2473 kvm_mmu_prepare_zap_page(vcpu->kvm, sp,
2474 &invalid_list);
2475 }
2476 vcpu->arch.mmu.pae_root[i] = INVALID_PAGE;
2477 }
2478 kvm_mmu_commit_zap_page(vcpu->kvm, &invalid_list);
2479 spin_unlock(&vcpu->kvm->mmu_lock);
2480 vcpu->arch.mmu.root_hpa = INVALID_PAGE;
2481 }
2482
2483 static int mmu_check_root(struct kvm_vcpu *vcpu, gfn_t root_gfn)
2484 {
2485 int ret = 0;
2486
2487 if (!kvm_is_visible_gfn(vcpu->kvm, root_gfn)) {
2488 kvm_make_request(KVM_REQ_TRIPLE_FAULT, vcpu);
2489 ret = 1;
2490 }
2491
2492 return ret;
2493 }
2494
2495 static int mmu_alloc_direct_roots(struct kvm_vcpu *vcpu)
2496 {
2497 struct kvm_mmu_page *sp;
2498 unsigned i;
2499
2500 if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL) {
2501 spin_lock(&vcpu->kvm->mmu_lock);
2502 kvm_mmu_free_some_pages(vcpu);
2503 sp = kvm_mmu_get_page(vcpu, 0, 0, PT64_ROOT_LEVEL,
2504 1, ACC_ALL, NULL);
2505 ++sp->root_count;
2506 spin_unlock(&vcpu->kvm->mmu_lock);
2507 vcpu->arch.mmu.root_hpa = __pa(sp->spt);
2508 } else if (vcpu->arch.mmu.shadow_root_level == PT32E_ROOT_LEVEL) {
2509 for (i = 0; i < 4; ++i) {
2510 hpa_t root = vcpu->arch.mmu.pae_root[i];
2511
2512 ASSERT(!VALID_PAGE(root));
2513 spin_lock(&vcpu->kvm->mmu_lock);
2514 kvm_mmu_free_some_pages(vcpu);
2515 sp = kvm_mmu_get_page(vcpu, i << (30 - PAGE_SHIFT),
2516 i << 30,
2517 PT32_ROOT_LEVEL, 1, ACC_ALL,
2518 NULL);
2519 root = __pa(sp->spt);
2520 ++sp->root_count;
2521 spin_unlock(&vcpu->kvm->mmu_lock);
2522 vcpu->arch.mmu.pae_root[i] = root | PT_PRESENT_MASK;
2523 }
2524 vcpu->arch.mmu.root_hpa = __pa(vcpu->arch.mmu.pae_root);
2525 } else
2526 BUG();
2527
2528 return 0;
2529 }
2530
2531 static int mmu_alloc_shadow_roots(struct kvm_vcpu *vcpu)
2532 {
2533 struct kvm_mmu_page *sp;
2534 u64 pdptr, pm_mask;
2535 gfn_t root_gfn;
2536 int i;
2537
2538 root_gfn = vcpu->arch.mmu.get_cr3(vcpu) >> PAGE_SHIFT;
2539
2540 if (mmu_check_root(vcpu, root_gfn))
2541 return 1;
2542
2543 /*
2544 * Do we shadow a long mode page table? If so we need to
2545 * write-protect the guests page table root.
2546 */
2547 if (vcpu->arch.mmu.root_level == PT64_ROOT_LEVEL) {
2548 hpa_t root = vcpu->arch.mmu.root_hpa;
2549
2550 ASSERT(!VALID_PAGE(root));
2551
2552 spin_lock(&vcpu->kvm->mmu_lock);
2553 kvm_mmu_free_some_pages(vcpu);
2554 sp = kvm_mmu_get_page(vcpu, root_gfn, 0, PT64_ROOT_LEVEL,
2555 0, ACC_ALL, NULL);
2556 root = __pa(sp->spt);
2557 ++sp->root_count;
2558 spin_unlock(&vcpu->kvm->mmu_lock);
2559 vcpu->arch.mmu.root_hpa = root;
2560 return 0;
2561 }
2562
2563 /*
2564 * We shadow a 32 bit page table. This may be a legacy 2-level
2565 * or a PAE 3-level page table. In either case we need to be aware that
2566 * the shadow page table may be a PAE or a long mode page table.
2567 */
2568 pm_mask = PT_PRESENT_MASK;
2569 if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL)
2570 pm_mask |= PT_ACCESSED_MASK | PT_WRITABLE_MASK | PT_USER_MASK;
2571
2572 for (i = 0; i < 4; ++i) {
2573 hpa_t root = vcpu->arch.mmu.pae_root[i];
2574
2575 ASSERT(!VALID_PAGE(root));
2576 if (vcpu->arch.mmu.root_level == PT32E_ROOT_LEVEL) {
2577 pdptr = kvm_pdptr_read_mmu(vcpu, &vcpu->arch.mmu, i);
2578 if (!is_present_gpte(pdptr)) {
2579 vcpu->arch.mmu.pae_root[i] = 0;
2580 continue;
2581 }
2582 root_gfn = pdptr >> PAGE_SHIFT;
2583 if (mmu_check_root(vcpu, root_gfn))
2584 return 1;
2585 }
2586 spin_lock(&vcpu->kvm->mmu_lock);
2587 kvm_mmu_free_some_pages(vcpu);
2588 sp = kvm_mmu_get_page(vcpu, root_gfn, i << 30,
2589 PT32_ROOT_LEVEL, 0,
2590 ACC_ALL, NULL);
2591 root = __pa(sp->spt);
2592 ++sp->root_count;
2593 spin_unlock(&vcpu->kvm->mmu_lock);
2594
2595 vcpu->arch.mmu.pae_root[i] = root | pm_mask;
2596 }
2597 vcpu->arch.mmu.root_hpa = __pa(vcpu->arch.mmu.pae_root);
2598
2599 /*
2600 * If we shadow a 32 bit page table with a long mode page
2601 * table we enter this path.
2602 */
2603 if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL) {
2604 if (vcpu->arch.mmu.lm_root == NULL) {
2605 /*
2606 * The additional page necessary for this is only
2607 * allocated on demand.
2608 */
2609
2610 u64 *lm_root;
2611
2612 lm_root = (void*)get_zeroed_page(GFP_KERNEL);
2613 if (lm_root == NULL)
2614 return 1;
2615
2616 lm_root[0] = __pa(vcpu->arch.mmu.pae_root) | pm_mask;
2617
2618 vcpu->arch.mmu.lm_root = lm_root;
2619 }
2620
2621 vcpu->arch.mmu.root_hpa = __pa(vcpu->arch.mmu.lm_root);
2622 }
2623
2624 return 0;
2625 }
2626
2627 static int mmu_alloc_roots(struct kvm_vcpu *vcpu)
2628 {
2629 if (vcpu->arch.mmu.direct_map)
2630 return mmu_alloc_direct_roots(vcpu);
2631 else
2632 return mmu_alloc_shadow_roots(vcpu);
2633 }
2634
2635 static void mmu_sync_roots(struct kvm_vcpu *vcpu)
2636 {
2637 int i;
2638 struct kvm_mmu_page *sp;
2639
2640 if (vcpu->arch.mmu.direct_map)
2641 return;
2642
2643 if (!VALID_PAGE(vcpu->arch.mmu.root_hpa))
2644 return;
2645
2646 trace_kvm_mmu_audit(vcpu, AUDIT_PRE_SYNC);
2647 if (vcpu->arch.mmu.root_level == PT64_ROOT_LEVEL) {
2648 hpa_t root = vcpu->arch.mmu.root_hpa;
2649 sp = page_header(root);
2650 mmu_sync_children(vcpu, sp);
2651 trace_kvm_mmu_audit(vcpu, AUDIT_POST_SYNC);
2652 return;
2653 }
2654 for (i = 0; i < 4; ++i) {
2655 hpa_t root = vcpu->arch.mmu.pae_root[i];
2656
2657 if (root && VALID_PAGE(root)) {
2658 root &= PT64_BASE_ADDR_MASK;
2659 sp = page_header(root);
2660 mmu_sync_children(vcpu, sp);
2661 }
2662 }
2663 trace_kvm_mmu_audit(vcpu, AUDIT_POST_SYNC);
2664 }
2665
2666 void kvm_mmu_sync_roots(struct kvm_vcpu *vcpu)
2667 {
2668 spin_lock(&vcpu->kvm->mmu_lock);
2669 mmu_sync_roots(vcpu);
2670 spin_unlock(&vcpu->kvm->mmu_lock);
2671 }
2672
2673 static gpa_t nonpaging_gva_to_gpa(struct kvm_vcpu *vcpu, gva_t vaddr,
2674 u32 access, struct x86_exception *exception)
2675 {
2676 if (exception)
2677 exception->error_code = 0;
2678 return vaddr;
2679 }
2680
2681 static gpa_t nonpaging_gva_to_gpa_nested(struct kvm_vcpu *vcpu, gva_t vaddr,
2682 u32 access,
2683 struct x86_exception *exception)
2684 {
2685 if (exception)
2686 exception->error_code = 0;
2687 return vcpu->arch.nested_mmu.translate_gpa(vcpu, vaddr, access);
2688 }
2689
2690 static int nonpaging_page_fault(struct kvm_vcpu *vcpu, gva_t gva,
2691 u32 error_code, bool prefault)
2692 {
2693 gfn_t gfn;
2694 int r;
2695
2696 pgprintk("%s: gva %lx error %x\n", __func__, gva, error_code);
2697 r = mmu_topup_memory_caches(vcpu);
2698 if (r)
2699 return r;
2700
2701 ASSERT(vcpu);
2702 ASSERT(VALID_PAGE(vcpu->arch.mmu.root_hpa));
2703
2704 gfn = gva >> PAGE_SHIFT;
2705
2706 return nonpaging_map(vcpu, gva & PAGE_MASK,
2707 error_code & PFERR_WRITE_MASK, gfn, prefault);
2708 }
2709
2710 static int kvm_arch_setup_async_pf(struct kvm_vcpu *vcpu, gva_t gva, gfn_t gfn)
2711 {
2712 struct kvm_arch_async_pf arch;
2713
2714 arch.token = (vcpu->arch.apf.id++ << 12) | vcpu->vcpu_id;
2715 arch.gfn = gfn;
2716 arch.direct_map = vcpu->arch.mmu.direct_map;
2717 arch.cr3 = vcpu->arch.mmu.get_cr3(vcpu);
2718
2719 return kvm_setup_async_pf(vcpu, gva, gfn, &arch);
2720 }
2721
2722 static bool can_do_async_pf(struct kvm_vcpu *vcpu)
2723 {
2724 if (unlikely(!irqchip_in_kernel(vcpu->kvm) ||
2725 kvm_event_needs_reinjection(vcpu)))
2726 return false;
2727
2728 return kvm_x86_ops->interrupt_allowed(vcpu);
2729 }
2730
2731 static bool try_async_pf(struct kvm_vcpu *vcpu, bool prefault, gfn_t gfn,
2732 gva_t gva, pfn_t *pfn, bool write, bool *writable)
2733 {
2734 bool async;
2735
2736 *pfn = gfn_to_pfn_async(vcpu->kvm, gfn, &async, write, writable);
2737
2738 if (!async)
2739 return false; /* *pfn has correct page already */
2740
2741 put_page(pfn_to_page(*pfn));
2742
2743 if (!prefault && can_do_async_pf(vcpu)) {
2744 trace_kvm_try_async_get_page(gva, gfn);
2745 if (kvm_find_async_pf_gfn(vcpu, gfn)) {
2746 trace_kvm_async_pf_doublefault(gva, gfn);
2747 kvm_make_request(KVM_REQ_APF_HALT, vcpu);
2748 return true;
2749 } else if (kvm_arch_setup_async_pf(vcpu, gva, gfn))
2750 return true;
2751 }
2752
2753 *pfn = gfn_to_pfn_prot(vcpu->kvm, gfn, write, writable);
2754
2755 return false;
2756 }
2757
2758 static int tdp_page_fault(struct kvm_vcpu *vcpu, gva_t gpa, u32 error_code,
2759 bool prefault)
2760 {
2761 pfn_t pfn;
2762 int r;
2763 int level;
2764 int force_pt_level;
2765 gfn_t gfn = gpa >> PAGE_SHIFT;
2766 unsigned long mmu_seq;
2767 int write = error_code & PFERR_WRITE_MASK;
2768 bool map_writable;
2769
2770 ASSERT(vcpu);
2771 ASSERT(VALID_PAGE(vcpu->arch.mmu.root_hpa));
2772
2773 r = mmu_topup_memory_caches(vcpu);
2774 if (r)
2775 return r;
2776
2777 force_pt_level = mapping_level_dirty_bitmap(vcpu, gfn);
2778 if (likely(!force_pt_level)) {
2779 level = mapping_level(vcpu, gfn);
2780 gfn &= ~(KVM_PAGES_PER_HPAGE(level) - 1);
2781 } else
2782 level = PT_PAGE_TABLE_LEVEL;
2783
2784 mmu_seq = vcpu->kvm->mmu_notifier_seq;
2785 smp_rmb();
2786
2787 if (try_async_pf(vcpu, prefault, gfn, gpa, &pfn, write, &map_writable))
2788 return 0;
2789
2790 /* mmio */
2791 if (is_error_pfn(pfn))
2792 return kvm_handle_bad_page(vcpu->kvm, gfn, pfn);
2793 spin_lock(&vcpu->kvm->mmu_lock);
2794 if (mmu_notifier_retry(vcpu, mmu_seq))
2795 goto out_unlock;
2796 kvm_mmu_free_some_pages(vcpu);
2797 if (likely(!force_pt_level))
2798 transparent_hugepage_adjust(vcpu, &gfn, &pfn, &level);
2799 r = __direct_map(vcpu, gpa, write, map_writable,
2800 level, gfn, pfn, prefault);
2801 spin_unlock(&vcpu->kvm->mmu_lock);
2802
2803 return r;
2804
2805 out_unlock:
2806 spin_unlock(&vcpu->kvm->mmu_lock);
2807 kvm_release_pfn_clean(pfn);
2808 return 0;
2809 }
2810
2811 static void nonpaging_free(struct kvm_vcpu *vcpu)
2812 {
2813 mmu_free_roots(vcpu);
2814 }
2815
2816 static int nonpaging_init_context(struct kvm_vcpu *vcpu,
2817 struct kvm_mmu *context)
2818 {
2819 context->new_cr3 = nonpaging_new_cr3;
2820 context->page_fault = nonpaging_page_fault;
2821 context->gva_to_gpa = nonpaging_gva_to_gpa;
2822 context->free = nonpaging_free;
2823 context->prefetch_page = nonpaging_prefetch_page;
2824 context->sync_page = nonpaging_sync_page;
2825 context->invlpg = nonpaging_invlpg;
2826 context->update_pte = nonpaging_update_pte;
2827 context->root_level = 0;
2828 context->shadow_root_level = PT32E_ROOT_LEVEL;
2829 context->root_hpa = INVALID_PAGE;
2830 context->direct_map = true;
2831 context->nx = false;
2832 return 0;
2833 }
2834
2835 void kvm_mmu_flush_tlb(struct kvm_vcpu *vcpu)
2836 {
2837 ++vcpu->stat.tlb_flush;
2838 kvm_make_request(KVM_REQ_TLB_FLUSH, vcpu);
2839 }
2840
2841 static void paging_new_cr3(struct kvm_vcpu *vcpu)
2842 {
2843 pgprintk("%s: cr3 %lx\n", __func__, kvm_read_cr3(vcpu));
2844 mmu_free_roots(vcpu);
2845 }
2846
2847 static unsigned long get_cr3(struct kvm_vcpu *vcpu)
2848 {
2849 return kvm_read_cr3(vcpu);
2850 }
2851
2852 static void inject_page_fault(struct kvm_vcpu *vcpu,
2853 struct x86_exception *fault)
2854 {
2855 vcpu->arch.mmu.inject_page_fault(vcpu, fault);
2856 }
2857
2858 static void paging_free(struct kvm_vcpu *vcpu)
2859 {
2860 nonpaging_free(vcpu);
2861 }
2862
2863 static bool is_rsvd_bits_set(struct kvm_mmu *mmu, u64 gpte, int level)
2864 {
2865 int bit7;
2866
2867 bit7 = (gpte >> 7) & 1;
2868 return (gpte & mmu->rsvd_bits_mask[bit7][level-1]) != 0;
2869 }
2870
2871 #define PTTYPE 64
2872 #include "paging_tmpl.h"
2873 #undef PTTYPE
2874
2875 #define PTTYPE 32
2876 #include "paging_tmpl.h"
2877 #undef PTTYPE
2878
2879 static void reset_rsvds_bits_mask(struct kvm_vcpu *vcpu,
2880 struct kvm_mmu *context,
2881 int level)
2882 {
2883 int maxphyaddr = cpuid_maxphyaddr(vcpu);
2884 u64 exb_bit_rsvd = 0;
2885
2886 if (!context->nx)
2887 exb_bit_rsvd = rsvd_bits(63, 63);
2888 switch (level) {
2889 case PT32_ROOT_LEVEL:
2890 /* no rsvd bits for 2 level 4K page table entries */
2891 context->rsvd_bits_mask[0][1] = 0;
2892 context->rsvd_bits_mask[0][0] = 0;
2893 context->rsvd_bits_mask[1][0] = context->rsvd_bits_mask[0][0];
2894
2895 if (!is_pse(vcpu)) {
2896 context->rsvd_bits_mask[1][1] = 0;
2897 break;
2898 }
2899
2900 if (is_cpuid_PSE36())
2901 /* 36bits PSE 4MB page */
2902 context->rsvd_bits_mask[1][1] = rsvd_bits(17, 21);
2903 else
2904 /* 32 bits PSE 4MB page */
2905 context->rsvd_bits_mask[1][1] = rsvd_bits(13, 21);
2906 break;
2907 case PT32E_ROOT_LEVEL:
2908 context->rsvd_bits_mask[0][2] =
2909 rsvd_bits(maxphyaddr, 63) |
2910 rsvd_bits(7, 8) | rsvd_bits(1, 2); /* PDPTE */
2911 context->rsvd_bits_mask[0][1] = exb_bit_rsvd |
2912 rsvd_bits(maxphyaddr, 62); /* PDE */
2913 context->rsvd_bits_mask[0][0] = exb_bit_rsvd |
2914 rsvd_bits(maxphyaddr, 62); /* PTE */
2915 context->rsvd_bits_mask[1][1] = exb_bit_rsvd |
2916 rsvd_bits(maxphyaddr, 62) |
2917 rsvd_bits(13, 20); /* large page */
2918 context->rsvd_bits_mask[1][0] = context->rsvd_bits_mask[0][0];
2919 break;
2920 case PT64_ROOT_LEVEL:
2921 context->rsvd_bits_mask[0][3] = exb_bit_rsvd |
2922 rsvd_bits(maxphyaddr, 51) | rsvd_bits(7, 8);
2923 context->rsvd_bits_mask[0][2] = exb_bit_rsvd |
2924 rsvd_bits(maxphyaddr, 51) | rsvd_bits(7, 8);
2925 context->rsvd_bits_mask[0][1] = exb_bit_rsvd |
2926 rsvd_bits(maxphyaddr, 51);
2927 context->rsvd_bits_mask[0][0] = exb_bit_rsvd |
2928 rsvd_bits(maxphyaddr, 51);
2929 context->rsvd_bits_mask[1][3] = context->rsvd_bits_mask[0][3];
2930 context->rsvd_bits_mask[1][2] = exb_bit_rsvd |
2931 rsvd_bits(maxphyaddr, 51) |
2932 rsvd_bits(13, 29);
2933 context->rsvd_bits_mask[1][1] = exb_bit_rsvd |
2934 rsvd_bits(maxphyaddr, 51) |
2935 rsvd_bits(13, 20); /* large page */
2936 context->rsvd_bits_mask[1][0] = context->rsvd_bits_mask[0][0];
2937 break;
2938 }
2939 }
2940
2941 static int paging64_init_context_common(struct kvm_vcpu *vcpu,
2942 struct kvm_mmu *context,
2943 int level)
2944 {
2945 context->nx = is_nx(vcpu);
2946
2947 reset_rsvds_bits_mask(vcpu, context, level);
2948
2949 ASSERT(is_pae(vcpu));
2950 context->new_cr3 = paging_new_cr3;
2951 context->page_fault = paging64_page_fault;
2952 context->gva_to_gpa = paging64_gva_to_gpa;
2953 context->prefetch_page = paging64_prefetch_page;
2954 context->sync_page = paging64_sync_page;
2955 context->invlpg = paging64_invlpg;
2956 context->update_pte = paging64_update_pte;
2957 context->free = paging_free;
2958 context->root_level = level;
2959 context->shadow_root_level = level;
2960 context->root_hpa = INVALID_PAGE;
2961 context->direct_map = false;
2962 return 0;
2963 }
2964
2965 static int paging64_init_context(struct kvm_vcpu *vcpu,
2966 struct kvm_mmu *context)
2967 {
2968 return paging64_init_context_common(vcpu, context, PT64_ROOT_LEVEL);
2969 }
2970
2971 static int paging32_init_context(struct kvm_vcpu *vcpu,
2972 struct kvm_mmu *context)
2973 {
2974 context->nx = false;
2975
2976 reset_rsvds_bits_mask(vcpu, context, PT32_ROOT_LEVEL);
2977
2978 context->new_cr3 = paging_new_cr3;
2979 context->page_fault = paging32_page_fault;
2980 context->gva_to_gpa = paging32_gva_to_gpa;
2981 context->free = paging_free;
2982 context->prefetch_page = paging32_prefetch_page;
2983 context->sync_page = paging32_sync_page;
2984 context->invlpg = paging32_invlpg;
2985 context->update_pte = paging32_update_pte;
2986 context->root_level = PT32_ROOT_LEVEL;
2987 context->shadow_root_level = PT32E_ROOT_LEVEL;
2988 context->root_hpa = INVALID_PAGE;
2989 context->direct_map = false;
2990 return 0;
2991 }
2992
2993 static int paging32E_init_context(struct kvm_vcpu *vcpu,
2994 struct kvm_mmu *context)
2995 {
2996 return paging64_init_context_common(vcpu, context, PT32E_ROOT_LEVEL);
2997 }
2998
2999 static int init_kvm_tdp_mmu(struct kvm_vcpu *vcpu)
3000 {
3001 struct kvm_mmu *context = vcpu->arch.walk_mmu;
3002
3003 context->base_role.word = 0;
3004 context->new_cr3 = nonpaging_new_cr3;
3005 context->page_fault = tdp_page_fault;
3006 context->free = nonpaging_free;
3007 context->prefetch_page = nonpaging_prefetch_page;
3008 context->sync_page = nonpaging_sync_page;
3009 context->invlpg = nonpaging_invlpg;
3010 context->update_pte = nonpaging_update_pte;
3011 context->shadow_root_level = kvm_x86_ops->get_tdp_level();
3012 context->root_hpa = INVALID_PAGE;
3013 context->direct_map = true;
3014 context->set_cr3 = kvm_x86_ops->set_tdp_cr3;
3015 context->get_cr3 = get_cr3;
3016 context->inject_page_fault = kvm_inject_page_fault;
3017 context->nx = is_nx(vcpu);
3018
3019 if (!is_paging(vcpu)) {
3020 context->nx = false;
3021 context->gva_to_gpa = nonpaging_gva_to_gpa;
3022 context->root_level = 0;
3023 } else if (is_long_mode(vcpu)) {
3024 context->nx = is_nx(vcpu);
3025 reset_rsvds_bits_mask(vcpu, context, PT64_ROOT_LEVEL);
3026 context->gva_to_gpa = paging64_gva_to_gpa;
3027 context->root_level = PT64_ROOT_LEVEL;
3028 } else if (is_pae(vcpu)) {
3029 context->nx = is_nx(vcpu);
3030 reset_rsvds_bits_mask(vcpu, context, PT32E_ROOT_LEVEL);
3031 context->gva_to_gpa = paging64_gva_to_gpa;
3032 context->root_level = PT32E_ROOT_LEVEL;
3033 } else {
3034 context->nx = false;
3035 reset_rsvds_bits_mask(vcpu, context, PT32_ROOT_LEVEL);
3036 context->gva_to_gpa = paging32_gva_to_gpa;
3037 context->root_level = PT32_ROOT_LEVEL;
3038 }
3039
3040 return 0;
3041 }
3042
3043 int kvm_init_shadow_mmu(struct kvm_vcpu *vcpu, struct kvm_mmu *context)
3044 {
3045 int r;
3046 ASSERT(vcpu);
3047 ASSERT(!VALID_PAGE(vcpu->arch.mmu.root_hpa));
3048
3049 if (!is_paging(vcpu))
3050 r = nonpaging_init_context(vcpu, context);
3051 else if (is_long_mode(vcpu))
3052 r = paging64_init_context(vcpu, context);
3053 else if (is_pae(vcpu))
3054 r = paging32E_init_context(vcpu, context);
3055 else
3056 r = paging32_init_context(vcpu, context);
3057
3058 vcpu->arch.mmu.base_role.cr4_pae = !!is_pae(vcpu);
3059 vcpu->arch.mmu.base_role.cr0_wp = is_write_protection(vcpu);
3060
3061 return r;
3062 }
3063 EXPORT_SYMBOL_GPL(kvm_init_shadow_mmu);
3064
3065 static int init_kvm_softmmu(struct kvm_vcpu *vcpu)
3066 {
3067 int r = kvm_init_shadow_mmu(vcpu, vcpu->arch.walk_mmu);
3068
3069 vcpu->arch.walk_mmu->set_cr3 = kvm_x86_ops->set_cr3;
3070 vcpu->arch.walk_mmu->get_cr3 = get_cr3;
3071 vcpu->arch.walk_mmu->inject_page_fault = kvm_inject_page_fault;
3072
3073 return r;
3074 }
3075
3076 static int init_kvm_nested_mmu(struct kvm_vcpu *vcpu)
3077 {
3078 struct kvm_mmu *g_context = &vcpu->arch.nested_mmu;
3079
3080 g_context->get_cr3 = get_cr3;
3081 g_context->inject_page_fault = kvm_inject_page_fault;
3082
3083 /*
3084 * Note that arch.mmu.gva_to_gpa translates l2_gva to l1_gpa. The
3085 * translation of l2_gpa to l1_gpa addresses is done using the
3086 * arch.nested_mmu.gva_to_gpa function. Basically the gva_to_gpa
3087 * functions between mmu and nested_mmu are swapped.
3088 */
3089 if (!is_paging(vcpu)) {
3090 g_context->nx = false;
3091 g_context->root_level = 0;
3092 g_context->gva_to_gpa = nonpaging_gva_to_gpa_nested;
3093 } else if (is_long_mode(vcpu)) {
3094 g_context->nx = is_nx(vcpu);
3095 reset_rsvds_bits_mask(vcpu, g_context, PT64_ROOT_LEVEL);
3096 g_context->root_level = PT64_ROOT_LEVEL;
3097 g_context->gva_to_gpa = paging64_gva_to_gpa_nested;
3098 } else if (is_pae(vcpu)) {
3099 g_context->nx = is_nx(vcpu);
3100 reset_rsvds_bits_mask(vcpu, g_context, PT32E_ROOT_LEVEL);
3101 g_context->root_level = PT32E_ROOT_LEVEL;
3102 g_context->gva_to_gpa = paging64_gva_to_gpa_nested;
3103 } else {
3104 g_context->nx = false;
3105 reset_rsvds_bits_mask(vcpu, g_context, PT32_ROOT_LEVEL);
3106 g_context->root_level = PT32_ROOT_LEVEL;
3107 g_context->gva_to_gpa = paging32_gva_to_gpa_nested;
3108 }
3109
3110 return 0;
3111 }
3112
3113 static int init_kvm_mmu(struct kvm_vcpu *vcpu)
3114 {
3115 if (mmu_is_nested(vcpu))
3116 return init_kvm_nested_mmu(vcpu);
3117 else if (tdp_enabled)
3118 return init_kvm_tdp_mmu(vcpu);
3119 else
3120 return init_kvm_softmmu(vcpu);
3121 }
3122
3123 static void destroy_kvm_mmu(struct kvm_vcpu *vcpu)
3124 {
3125 ASSERT(vcpu);
3126 if (VALID_PAGE(vcpu->arch.mmu.root_hpa))
3127 /* mmu.free() should set root_hpa = INVALID_PAGE */
3128 vcpu->arch.mmu.free(vcpu);
3129 }
3130
3131 int kvm_mmu_reset_context(struct kvm_vcpu *vcpu)
3132 {
3133 destroy_kvm_mmu(vcpu);
3134 return init_kvm_mmu(vcpu);
3135 }
3136 EXPORT_SYMBOL_GPL(kvm_mmu_reset_context);
3137
3138 int kvm_mmu_load(struct kvm_vcpu *vcpu)
3139 {
3140 int r;
3141
3142 r = mmu_topup_memory_caches(vcpu);
3143 if (r)
3144 goto out;
3145 r = mmu_alloc_roots(vcpu);
3146 spin_lock(&vcpu->kvm->mmu_lock);
3147 mmu_sync_roots(vcpu);
3148 spin_unlock(&vcpu->kvm->mmu_lock);
3149 if (r)
3150 goto out;
3151 /* set_cr3() should ensure TLB has been flushed */
3152 vcpu->arch.mmu.set_cr3(vcpu, vcpu->arch.mmu.root_hpa);
3153 out:
3154 return r;
3155 }
3156 EXPORT_SYMBOL_GPL(kvm_mmu_load);
3157
3158 void kvm_mmu_unload(struct kvm_vcpu *vcpu)
3159 {
3160 mmu_free_roots(vcpu);
3161 }
3162 EXPORT_SYMBOL_GPL(kvm_mmu_unload);
3163
3164 static void mmu_pte_write_zap_pte(struct kvm_vcpu *vcpu,
3165 struct kvm_mmu_page *sp,
3166 u64 *spte)
3167 {
3168 u64 pte;
3169 struct kvm_mmu_page *child;
3170
3171 pte = *spte;
3172 if (is_shadow_present_pte(pte)) {
3173 if (is_last_spte(pte, sp->role.level))
3174 drop_spte(vcpu->kvm, spte, shadow_trap_nonpresent_pte);
3175 else {
3176 child = page_header(pte & PT64_BASE_ADDR_MASK);
3177 mmu_page_remove_parent_pte(child, spte);
3178 }
3179 }
3180 __set_spte(spte, shadow_trap_nonpresent_pte);
3181 if (is_large_pte(pte))
3182 --vcpu->kvm->stat.lpages;
3183 }
3184
3185 static void mmu_pte_write_new_pte(struct kvm_vcpu *vcpu,
3186 struct kvm_mmu_page *sp, u64 *spte,
3187 const void *new)
3188 {
3189 if (sp->role.level != PT_PAGE_TABLE_LEVEL) {
3190 ++vcpu->kvm->stat.mmu_pde_zapped;
3191 return;
3192 }
3193
3194 ++vcpu->kvm->stat.mmu_pte_updated;
3195 vcpu->arch.mmu.update_pte(vcpu, sp, spte, new);
3196 }
3197
3198 static bool need_remote_flush(u64 old, u64 new)
3199 {
3200 if (!is_shadow_present_pte(old))
3201 return false;
3202 if (!is_shadow_present_pte(new))
3203 return true;
3204 if ((old ^ new) & PT64_BASE_ADDR_MASK)
3205 return true;
3206 old ^= PT64_NX_MASK;
3207 new ^= PT64_NX_MASK;
3208 return (old & ~new & PT64_PERM_MASK) != 0;
3209 }
3210
3211 static void mmu_pte_write_flush_tlb(struct kvm_vcpu *vcpu, bool zap_page,
3212 bool remote_flush, bool local_flush)
3213 {
3214 if (zap_page)
3215 return;
3216
3217 if (remote_flush)
3218 kvm_flush_remote_tlbs(vcpu->kvm);
3219 else if (local_flush)
3220 kvm_mmu_flush_tlb(vcpu);
3221 }
3222
3223 static bool last_updated_pte_accessed(struct kvm_vcpu *vcpu)
3224 {
3225 u64 *spte = vcpu->arch.last_pte_updated;
3226
3227 return !!(spte && (*spte & shadow_accessed_mask));
3228 }
3229
3230 static void kvm_mmu_access_page(struct kvm_vcpu *vcpu, gfn_t gfn)
3231 {
3232 u64 *spte = vcpu->arch.last_pte_updated;
3233
3234 if (spte
3235 && vcpu->arch.last_pte_gfn == gfn
3236 && shadow_accessed_mask
3237 && !(*spte & shadow_accessed_mask)
3238 && is_shadow_present_pte(*spte))
3239 set_bit(PT_ACCESSED_SHIFT, (unsigned long *)spte);
3240 }
3241
3242 void kvm_mmu_pte_write(struct kvm_vcpu *vcpu, gpa_t gpa,
3243 const u8 *new, int bytes,
3244 bool guest_initiated)
3245 {
3246 gfn_t gfn = gpa >> PAGE_SHIFT;
3247 union kvm_mmu_page_role mask = { .word = 0 };
3248 struct kvm_mmu_page *sp;
3249 struct hlist_node *node;
3250 LIST_HEAD(invalid_list);
3251 u64 entry, gentry, *spte;
3252 unsigned pte_size, page_offset, misaligned, quadrant, offset;
3253 int level, npte, invlpg_counter, r, flooded = 0;
3254 bool remote_flush, local_flush, zap_page;
3255
3256 /*
3257 * If we don't have indirect shadow pages, it means no page is
3258 * write-protected, so we can exit simply.
3259 */
3260 if (!ACCESS_ONCE(vcpu->kvm->arch.indirect_shadow_pages))
3261 return;
3262
3263 zap_page = remote_flush = local_flush = false;
3264 offset = offset_in_page(gpa);
3265
3266 pgprintk("%s: gpa %llx bytes %d\n", __func__, gpa, bytes);
3267
3268 invlpg_counter = atomic_read(&vcpu->kvm->arch.invlpg_counter);
3269
3270 /*
3271 * Assume that the pte write on a page table of the same type
3272 * as the current vcpu paging mode since we update the sptes only
3273 * when they have the same mode.
3274 */
3275 if ((is_pae(vcpu) && bytes == 4) || !new) {
3276 /* Handle a 32-bit guest writing two halves of a 64-bit gpte */
3277 if (is_pae(vcpu)) {
3278 gpa &= ~(gpa_t)7;
3279 bytes = 8;
3280 }
3281 r = kvm_read_guest(vcpu->kvm, gpa, &gentry, min(bytes, 8));
3282 if (r)
3283 gentry = 0;
3284 new = (const u8 *)&gentry;
3285 }
3286
3287 switch (bytes) {
3288 case 4:
3289 gentry = *(const u32 *)new;
3290 break;
3291 case 8:
3292 gentry = *(const u64 *)new;
3293 break;
3294 default:
3295 gentry = 0;
3296 break;
3297 }
3298
3299 spin_lock(&vcpu->kvm->mmu_lock);
3300 if (atomic_read(&vcpu->kvm->arch.invlpg_counter) != invlpg_counter)
3301 gentry = 0;
3302 kvm_mmu_free_some_pages(vcpu);
3303 ++vcpu->kvm->stat.mmu_pte_write;
3304 trace_kvm_mmu_audit(vcpu, AUDIT_PRE_PTE_WRITE);
3305 if (guest_initiated) {
3306 kvm_mmu_access_page(vcpu, gfn);
3307 if (gfn == vcpu->arch.last_pt_write_gfn
3308 && !last_updated_pte_accessed(vcpu)) {
3309 ++vcpu->arch.last_pt_write_count;
3310 if (vcpu->arch.last_pt_write_count >= 3)
3311 flooded = 1;
3312 } else {
3313 vcpu->arch.last_pt_write_gfn = gfn;
3314 vcpu->arch.last_pt_write_count = 1;
3315 vcpu->arch.last_pte_updated = NULL;
3316 }
3317 }
3318
3319 mask.cr0_wp = mask.cr4_pae = mask.nxe = 1;
3320 for_each_gfn_indirect_valid_sp(vcpu->kvm, sp, gfn, node) {
3321 pte_size = sp->role.cr4_pae ? 8 : 4;
3322 misaligned = (offset ^ (offset + bytes - 1)) & ~(pte_size - 1);
3323 misaligned |= bytes < 4;
3324 if (misaligned || flooded) {
3325 /*
3326 * Misaligned accesses are too much trouble to fix
3327 * up; also, they usually indicate a page is not used
3328 * as a page table.
3329 *
3330 * If we're seeing too many writes to a page,
3331 * it may no longer be a page table, or we may be
3332 * forking, in which case it is better to unmap the
3333 * page.
3334 */
3335 pgprintk("misaligned: gpa %llx bytes %d role %x\n",
3336 gpa, bytes, sp->role.word);
3337 zap_page |= !!kvm_mmu_prepare_zap_page(vcpu->kvm, sp,
3338 &invalid_list);
3339 ++vcpu->kvm->stat.mmu_flooded;
3340 continue;
3341 }
3342 page_offset = offset;
3343 level = sp->role.level;
3344 npte = 1;
3345 if (!sp->role.cr4_pae) {
3346 page_offset <<= 1; /* 32->64 */
3347 /*
3348 * A 32-bit pde maps 4MB while the shadow pdes map
3349 * only 2MB. So we need to double the offset again
3350 * and zap two pdes instead of one.
3351 */
3352 if (level == PT32_ROOT_LEVEL) {
3353 page_offset &= ~7; /* kill rounding error */
3354 page_offset <<= 1;
3355 npte = 2;
3356 }
3357 quadrant = page_offset >> PAGE_SHIFT;
3358 page_offset &= ~PAGE_MASK;
3359 if (quadrant != sp->role.quadrant)
3360 continue;
3361 }
3362 local_flush = true;
3363 spte = &sp->spt[page_offset / sizeof(*spte)];
3364 while (npte--) {
3365 entry = *spte;
3366 mmu_pte_write_zap_pte(vcpu, sp, spte);
3367 if (gentry &&
3368 !((sp->role.word ^ vcpu->arch.mmu.base_role.word)
3369 & mask.word))
3370 mmu_pte_write_new_pte(vcpu, sp, spte, &gentry);
3371 if (!remote_flush && need_remote_flush(entry, *spte))
3372 remote_flush = true;
3373 ++spte;
3374 }
3375 }
3376 mmu_pte_write_flush_tlb(vcpu, zap_page, remote_flush, local_flush);
3377 kvm_mmu_commit_zap_page(vcpu->kvm, &invalid_list);
3378 trace_kvm_mmu_audit(vcpu, AUDIT_POST_PTE_WRITE);
3379 spin_unlock(&vcpu->kvm->mmu_lock);
3380 }
3381
3382 int kvm_mmu_unprotect_page_virt(struct kvm_vcpu *vcpu, gva_t gva)
3383 {
3384 gpa_t gpa;
3385 int r;
3386
3387 if (vcpu->arch.mmu.direct_map)
3388 return 0;
3389
3390 gpa = kvm_mmu_gva_to_gpa_read(vcpu, gva, NULL);
3391
3392 spin_lock(&vcpu->kvm->mmu_lock);
3393 r = kvm_mmu_unprotect_page(vcpu->kvm, gpa >> PAGE_SHIFT);
3394 spin_unlock(&vcpu->kvm->mmu_lock);
3395 return r;
3396 }
3397 EXPORT_SYMBOL_GPL(kvm_mmu_unprotect_page_virt);
3398
3399 void __kvm_mmu_free_some_pages(struct kvm_vcpu *vcpu)
3400 {
3401 LIST_HEAD(invalid_list);
3402
3403 while (kvm_mmu_available_pages(vcpu->kvm) < KVM_REFILL_PAGES &&
3404 !list_empty(&vcpu->kvm->arch.active_mmu_pages)) {
3405 struct kvm_mmu_page *sp;
3406
3407 sp = container_of(vcpu->kvm->arch.active_mmu_pages.prev,
3408 struct kvm_mmu_page, link);
3409 kvm_mmu_prepare_zap_page(vcpu->kvm, sp, &invalid_list);
3410 kvm_mmu_commit_zap_page(vcpu->kvm, &invalid_list);
3411 ++vcpu->kvm->stat.mmu_recycled;
3412 }
3413 }
3414
3415 int kvm_mmu_page_fault(struct kvm_vcpu *vcpu, gva_t cr2, u32 error_code,
3416 void *insn, int insn_len)
3417 {
3418 int r;
3419 enum emulation_result er;
3420
3421 r = vcpu->arch.mmu.page_fault(vcpu, cr2, error_code, false);
3422 if (r < 0)
3423 goto out;
3424
3425 if (!r) {
3426 r = 1;
3427 goto out;
3428 }
3429
3430 r = mmu_topup_memory_caches(vcpu);
3431 if (r)
3432 goto out;
3433
3434 er = x86_emulate_instruction(vcpu, cr2, 0, insn, insn_len);
3435
3436 switch (er) {
3437 case EMULATE_DONE:
3438 return 1;
3439 case EMULATE_DO_MMIO:
3440 ++vcpu->stat.mmio_exits;
3441 /* fall through */
3442 case EMULATE_FAIL:
3443 return 0;
3444 default:
3445 BUG();
3446 }
3447 out:
3448 return r;
3449 }
3450 EXPORT_SYMBOL_GPL(kvm_mmu_page_fault);
3451
3452 void kvm_mmu_invlpg(struct kvm_vcpu *vcpu, gva_t gva)
3453 {
3454 vcpu->arch.mmu.invlpg(vcpu, gva);
3455 kvm_mmu_flush_tlb(vcpu);
3456 ++vcpu->stat.invlpg;
3457 }
3458 EXPORT_SYMBOL_GPL(kvm_mmu_invlpg);
3459
3460 void kvm_enable_tdp(void)
3461 {
3462 tdp_enabled = true;
3463 }
3464 EXPORT_SYMBOL_GPL(kvm_enable_tdp);
3465
3466 void kvm_disable_tdp(void)
3467 {
3468 tdp_enabled = false;
3469 }
3470 EXPORT_SYMBOL_GPL(kvm_disable_tdp);
3471
3472 static void free_mmu_pages(struct kvm_vcpu *vcpu)
3473 {
3474 free_page((unsigned long)vcpu->arch.mmu.pae_root);
3475 if (vcpu->arch.mmu.lm_root != NULL)
3476 free_page((unsigned long)vcpu->arch.mmu.lm_root);
3477 }
3478
3479 static int alloc_mmu_pages(struct kvm_vcpu *vcpu)
3480 {
3481 struct page *page;
3482 int i;
3483
3484 ASSERT(vcpu);
3485
3486 /*
3487 * When emulating 32-bit mode, cr3 is only 32 bits even on x86_64.
3488 * Therefore we need to allocate shadow page tables in the first
3489 * 4GB of memory, which happens to fit the DMA32 zone.
3490 */
3491 page = alloc_page(GFP_KERNEL | __GFP_DMA32);
3492 if (!page)
3493 return -ENOMEM;
3494
3495 vcpu->arch.mmu.pae_root = page_address(page);
3496 for (i = 0; i < 4; ++i)
3497 vcpu->arch.mmu.pae_root[i] = INVALID_PAGE;
3498
3499 return 0;
3500 }
3501
3502 int kvm_mmu_create(struct kvm_vcpu *vcpu)
3503 {
3504 ASSERT(vcpu);
3505 ASSERT(!VALID_PAGE(vcpu->arch.mmu.root_hpa));
3506
3507 return alloc_mmu_pages(vcpu);
3508 }
3509
3510 int kvm_mmu_setup(struct kvm_vcpu *vcpu)
3511 {
3512 ASSERT(vcpu);
3513 ASSERT(!VALID_PAGE(vcpu->arch.mmu.root_hpa));
3514
3515 return init_kvm_mmu(vcpu);
3516 }
3517
3518 void kvm_mmu_slot_remove_write_access(struct kvm *kvm, int slot)
3519 {
3520 struct kvm_mmu_page *sp;
3521
3522 list_for_each_entry(sp, &kvm->arch.active_mmu_pages, link) {
3523 int i;
3524 u64 *pt;
3525
3526 if (!test_bit(slot, sp->slot_bitmap))
3527 continue;
3528
3529 pt = sp->spt;
3530 for (i = 0; i < PT64_ENT_PER_PAGE; ++i) {
3531 if (!is_shadow_present_pte(pt[i]) ||
3532 !is_last_spte(pt[i], sp->role.level))
3533 continue;
3534
3535 if (is_large_pte(pt[i])) {
3536 drop_spte(kvm, &pt[i],
3537 shadow_trap_nonpresent_pte);
3538 --kvm->stat.lpages;
3539 continue;
3540 }
3541
3542 /* avoid RMW */
3543 if (is_writable_pte(pt[i]))
3544 update_spte(&pt[i], pt[i] & ~PT_WRITABLE_MASK);
3545 }
3546 }
3547 kvm_flush_remote_tlbs(kvm);
3548 }
3549
3550 void kvm_mmu_zap_all(struct kvm *kvm)
3551 {
3552 struct kvm_mmu_page *sp, *node;
3553 LIST_HEAD(invalid_list);
3554
3555 spin_lock(&kvm->mmu_lock);
3556 restart:
3557 list_for_each_entry_safe(sp, node, &kvm->arch.active_mmu_pages, link)
3558 if (kvm_mmu_prepare_zap_page(kvm, sp, &invalid_list))
3559 goto restart;
3560
3561 kvm_mmu_commit_zap_page(kvm, &invalid_list);
3562 spin_unlock(&kvm->mmu_lock);
3563 }
3564
3565 static int kvm_mmu_remove_some_alloc_mmu_pages(struct kvm *kvm,
3566 struct list_head *invalid_list)
3567 {
3568 struct kvm_mmu_page *page;
3569
3570 page = container_of(kvm->arch.active_mmu_pages.prev,
3571 struct kvm_mmu_page, link);
3572 return kvm_mmu_prepare_zap_page(kvm, page, invalid_list);
3573 }
3574
3575 static int mmu_shrink(struct shrinker *shrink, struct shrink_control *sc)
3576 {
3577 struct kvm *kvm;
3578 struct kvm *kvm_freed = NULL;
3579 int nr_to_scan = sc->nr_to_scan;
3580
3581 if (nr_to_scan == 0)
3582 goto out;
3583
3584 raw_spin_lock(&kvm_lock);
3585
3586 list_for_each_entry(kvm, &vm_list, vm_list) {
3587 int idx, freed_pages;
3588 LIST_HEAD(invalid_list);
3589
3590 idx = srcu_read_lock(&kvm->srcu);
3591 spin_lock(&kvm->mmu_lock);
3592 if (!kvm_freed && nr_to_scan > 0 &&
3593 kvm->arch.n_used_mmu_pages > 0) {
3594 freed_pages = kvm_mmu_remove_some_alloc_mmu_pages(kvm,
3595 &invalid_list);
3596 kvm_freed = kvm;
3597 }
3598 nr_to_scan--;
3599
3600 kvm_mmu_commit_zap_page(kvm, &invalid_list);
3601 spin_unlock(&kvm->mmu_lock);
3602 srcu_read_unlock(&kvm->srcu, idx);
3603 }
3604 if (kvm_freed)
3605 list_move_tail(&kvm_freed->vm_list, &vm_list);
3606
3607 raw_spin_unlock(&kvm_lock);
3608
3609 out:
3610 return percpu_counter_read_positive(&kvm_total_used_mmu_pages);
3611 }
3612
3613 static struct shrinker mmu_shrinker = {
3614 .shrink = mmu_shrink,
3615 .seeks = DEFAULT_SEEKS * 10,
3616 };
3617
3618 static void mmu_destroy_caches(void)
3619 {
3620 if (pte_chain_cache)
3621 kmem_cache_destroy(pte_chain_cache);
3622 if (pte_list_desc_cache)
3623 kmem_cache_destroy(pte_list_desc_cache);
3624 if (mmu_page_header_cache)
3625 kmem_cache_destroy(mmu_page_header_cache);
3626 }
3627
3628 int kvm_mmu_module_init(void)
3629 {
3630 pte_chain_cache = kmem_cache_create("kvm_pte_chain",
3631 sizeof(struct kvm_pte_chain),
3632 0, 0, NULL);
3633 if (!pte_chain_cache)
3634 goto nomem;
3635 pte_list_desc_cache = kmem_cache_create("pte_list_desc",
3636 sizeof(struct pte_list_desc),
3637 0, 0, NULL);
3638 if (!pte_list_desc_cache)
3639 goto nomem;
3640
3641 mmu_page_header_cache = kmem_cache_create("kvm_mmu_page_header",
3642 sizeof(struct kvm_mmu_page),
3643 0, 0, NULL);
3644 if (!mmu_page_header_cache)
3645 goto nomem;
3646
3647 if (percpu_counter_init(&kvm_total_used_mmu_pages, 0))
3648 goto nomem;
3649
3650 register_shrinker(&mmu_shrinker);
3651
3652 return 0;
3653
3654 nomem:
3655 mmu_destroy_caches();
3656 return -ENOMEM;
3657 }
3658
3659 /*
3660 * Caculate mmu pages needed for kvm.
3661 */
3662 unsigned int kvm_mmu_calculate_mmu_pages(struct kvm *kvm)
3663 {
3664 int i;
3665 unsigned int nr_mmu_pages;
3666 unsigned int nr_pages = 0;
3667 struct kvm_memslots *slots;
3668
3669 slots = kvm_memslots(kvm);
3670
3671 for (i = 0; i < slots->nmemslots; i++)
3672 nr_pages += slots->memslots[i].npages;
3673
3674 nr_mmu_pages = nr_pages * KVM_PERMILLE_MMU_PAGES / 1000;
3675 nr_mmu_pages = max(nr_mmu_pages,
3676 (unsigned int) KVM_MIN_ALLOC_MMU_PAGES);
3677
3678 return nr_mmu_pages;
3679 }
3680
3681 static void *pv_mmu_peek_buffer(struct kvm_pv_mmu_op_buffer *buffer,
3682 unsigned len)
3683 {
3684 if (len > buffer->len)
3685 return NULL;
3686 return buffer->ptr;
3687 }
3688
3689 static void *pv_mmu_read_buffer(struct kvm_pv_mmu_op_buffer *buffer,
3690 unsigned len)
3691 {
3692 void *ret;
3693
3694 ret = pv_mmu_peek_buffer(buffer, len);
3695 if (!ret)
3696 return ret;
3697 buffer->ptr += len;
3698 buffer->len -= len;
3699 buffer->processed += len;
3700 return ret;
3701 }
3702
3703 static int kvm_pv_mmu_write(struct kvm_vcpu *vcpu,
3704 gpa_t addr, gpa_t value)
3705 {
3706 int bytes = 8;
3707 int r;
3708
3709 if (!is_long_mode(vcpu) && !is_pae(vcpu))
3710 bytes = 4;
3711
3712 r = mmu_topup_memory_caches(vcpu);
3713 if (r)
3714 return r;
3715
3716 if (!emulator_write_phys(vcpu, addr, &value, bytes))
3717 return -EFAULT;
3718
3719 return 1;
3720 }
3721
3722 static int kvm_pv_mmu_flush_tlb(struct kvm_vcpu *vcpu)
3723 {
3724 (void)kvm_set_cr3(vcpu, kvm_read_cr3(vcpu));
3725 return 1;
3726 }
3727
3728 static int kvm_pv_mmu_release_pt(struct kvm_vcpu *vcpu, gpa_t addr)
3729 {
3730 spin_lock(&vcpu->kvm->mmu_lock);
3731 mmu_unshadow(vcpu->kvm, addr >> PAGE_SHIFT);
3732 spin_unlock(&vcpu->kvm->mmu_lock);
3733 return 1;
3734 }
3735
3736 static int kvm_pv_mmu_op_one(struct kvm_vcpu *vcpu,
3737 struct kvm_pv_mmu_op_buffer *buffer)
3738 {
3739 struct kvm_mmu_op_header *header;
3740
3741 header = pv_mmu_peek_buffer(buffer, sizeof *header);
3742 if (!header)
3743 return 0;
3744 switch (header->op) {
3745 case KVM_MMU_OP_WRITE_PTE: {
3746 struct kvm_mmu_op_write_pte *wpte;
3747
3748 wpte = pv_mmu_read_buffer(buffer, sizeof *wpte);
3749 if (!wpte)
3750 return 0;
3751 return kvm_pv_mmu_write(vcpu, wpte->pte_phys,
3752 wpte->pte_val);
3753 }
3754 case KVM_MMU_OP_FLUSH_TLB: {
3755 struct kvm_mmu_op_flush_tlb *ftlb;
3756
3757 ftlb = pv_mmu_read_buffer(buffer, sizeof *ftlb);
3758 if (!ftlb)
3759 return 0;
3760 return kvm_pv_mmu_flush_tlb(vcpu);
3761 }
3762 case KVM_MMU_OP_RELEASE_PT: {
3763 struct kvm_mmu_op_release_pt *rpt;
3764
3765 rpt = pv_mmu_read_buffer(buffer, sizeof *rpt);
3766 if (!rpt)
3767 return 0;
3768 return kvm_pv_mmu_release_pt(vcpu, rpt->pt_phys);
3769 }
3770 default: return 0;
3771 }
3772 }
3773
3774 int kvm_pv_mmu_op(struct kvm_vcpu *vcpu, unsigned long bytes,
3775 gpa_t addr, unsigned long *ret)
3776 {
3777 int r;
3778 struct kvm_pv_mmu_op_buffer *buffer = &vcpu->arch.mmu_op_buffer;
3779
3780 buffer->ptr = buffer->buf;
3781 buffer->len = min_t(unsigned long, bytes, sizeof buffer->buf);
3782 buffer->processed = 0;
3783
3784 r = kvm_read_guest(vcpu->kvm, addr, buffer->buf, buffer->len);
3785 if (r)
3786 goto out;
3787
3788 while (buffer->len) {
3789 r = kvm_pv_mmu_op_one(vcpu, buffer);
3790 if (r < 0)
3791 goto out;
3792 if (r == 0)
3793 break;
3794 }
3795
3796 r = 1;
3797 out:
3798 *ret = buffer->processed;
3799 return r;
3800 }
3801
3802 int kvm_mmu_get_spte_hierarchy(struct kvm_vcpu *vcpu, u64 addr, u64 sptes[4])
3803 {
3804 struct kvm_shadow_walk_iterator iterator;
3805 int nr_sptes = 0;
3806
3807 spin_lock(&vcpu->kvm->mmu_lock);
3808 for_each_shadow_entry(vcpu, addr, iterator) {
3809 sptes[iterator.level-1] = *iterator.sptep;
3810 nr_sptes++;
3811 if (!is_shadow_present_pte(*iterator.sptep))
3812 break;
3813 }
3814 spin_unlock(&vcpu->kvm->mmu_lock);
3815
3816 return nr_sptes;
3817 }
3818 EXPORT_SYMBOL_GPL(kvm_mmu_get_spte_hierarchy);
3819
3820 void kvm_mmu_destroy(struct kvm_vcpu *vcpu)
3821 {
3822 ASSERT(vcpu);
3823
3824 destroy_kvm_mmu(vcpu);
3825 free_mmu_pages(vcpu);
3826 mmu_free_memory_caches(vcpu);
3827 }
3828
3829 #ifdef CONFIG_KVM_MMU_AUDIT
3830 #include "mmu_audit.c"
3831 #else
3832 static void mmu_audit_disable(void) { }
3833 #endif
3834
3835 void kvm_mmu_module_exit(void)
3836 {
3837 mmu_destroy_caches();
3838 percpu_counter_destroy(&kvm_total_used_mmu_pages);
3839 unregister_shrinker(&mmu_shrinker);
3840 mmu_audit_disable();
3841 }