kvm/mmu/tdp_iter.c

9  * Recalculates the pointer to the SPTE for the current GFN and level and
14 	iter->sptep = iter->pt_path[iter->level - 1] +
15 		SPTE_INDEX((iter->gfn | iter->gfn_bits) << PAGE_SHIFT, iter->level);
27 	iter->level = iter->root_level;
29 	iter->gfn = gfn_round_for_level(iter->next_last_level_gfn, iter->level);
42 	if (WARN_ON_ONCE(!root || (root->role.level < 1) ||
43 			 (root->role.level > PT64_ROOT_MAX_LEVEL) ||
51 	iter->root_level = root->role.level;
60  * Given an SPTE and its level, returns a pointer containing the host virtual
64 tdp_ptep_t spte_to_child_pt(u64 spte, int level)
68 	 * last-level entry.
70 	if (!is_shadow_present_pte(spte) || is_last_spte(spte, level))
77  * Steps down one level in the paging structure towards the goal GFN. Returns
78  * true if the iterator was able to step down a level, false otherwise.
84 	if (iter->level == iter->min_level)
93 	child_pt = spte_to_child_pt(iter->old_spte, iter->level);
97 	iter->level--;
98 	iter->pt_path[iter->level - 1] = child_pt;
99 	iter->gfn = gfn_round_for_level(iter->next_last_level_gfn, iter->level);
107  * level. The next entry could point to a page backing guest memory or another
118 	if (SPTE_INDEX((iter->gfn | iter->gfn_bits) << PAGE_SHIFT, iter->level) ==
122 	iter->gfn += KVM_PAGES_PER_HPAGE(iter->level);
131  * Tries to traverse back up a level in the paging structure so that the walk
137 	if (iter->level == iter->root_level)
140 	iter->level++;
141 	iter->gfn = gfn_round_for_level(iter->gfn, iter->level);
150  * GFN, if at a present, non-last-level SPTE, or over to a SPTE mapping a
154  * 1. If the current SPTE is a non-last-level SPTE, step down into the page