Home
last modified time | relevance | path

Searched refs:sptes (Results 1 – 4 of 4) sorted by relevance

/Linux-v5.10/Documentation/virt/kvm/
Dmmu.rst122 shadow page contains 512 sptes, which can be either leaf or nonleaf sptes. A
123 shadow page may contain a mix of leaf and nonleaf sptes.
153 1=4k sptes, 2=2M sptes, 3=1G sptes, etc.
155 If set, leaf sptes reachable from this page are for a linear range.
165 sptes. That means a guest page table contains more ptes than the host,
169 page tables, each 32-bit gpte is converted to two 64-bit sptes
212 A pageful of 64-bit sptes containing the translations for this page.
216 sptes in spt point either at guest pages, or at lower-level shadow pages.
234 sptes pointing at this page and (parent_ptes & ~0x1) points at a data
235 structure with a list of parent sptes.
[all …]
/Linux-v5.10/arch/x86/kvm/mmu/
Dtdp_mmu.h47 int kvm_tdp_mmu_get_walk(struct kvm_vcpu *vcpu, u64 addr, u64 *sptes);
Dmmu.c141 u64 *sptes[PTE_LIST_EXT]; member
852 desc->sptes[0] = (u64 *)rmap_head->val; in pte_list_add()
853 desc->sptes[1] = spte; in pte_list_add()
859 while (desc->sptes[PTE_LIST_EXT-1]) { in pte_list_add()
869 for (i = 0; desc->sptes[i]; ++i) in pte_list_add()
871 desc->sptes[i] = spte; in pte_list_add()
883 for (j = PTE_LIST_EXT - 1; !desc->sptes[j] && j > i; --j) in pte_list_desc_remove_entry()
885 desc->sptes[i] = desc->sptes[j]; in pte_list_desc_remove_entry()
886 desc->sptes[j] = NULL; in pte_list_desc_remove_entry()
920 for (i = 0; i < PTE_LIST_EXT && desc->sptes[i]; ++i) { in __pte_list_remove()
[all …]
Dtdp_mmu.c1151 int kvm_tdp_mmu_get_walk(struct kvm_vcpu *vcpu, u64 addr, u64 *sptes) in kvm_tdp_mmu_get_walk() argument
1160 sptes[leaf - 1] = iter.old_spte; in kvm_tdp_mmu_get_walk()