13 	iter->sptep = iter->pt_path[iter->level - 1] +  in tdp_iter_refresh_sptep()
14 		SHADOW_PT_INDEX(iter->gfn << PAGE_SHIFT, iter->level);  in tdp_iter_refresh_sptep()
18 static gfn_t round_gfn_for_level(gfn_t gfn, int level)  in round_gfn_for_level()  argument
20 	return gfn & -KVM_PAGES_PER_HPAGE(level);  in round_gfn_for_level()
37 	iter->level = root_level;  in tdp_iter_start()
38 	iter->pt_path[iter->level - 1] = root_pt;  in tdp_iter_start()
40 	iter->gfn = round_gfn_for_level(iter->next_last_level_gfn, iter->level);  in tdp_iter_start()
51 u64 *spte_to_child_pt(u64 spte, int level)  in spte_to_child_pt()  argument
57 	if (!is_shadow_present_pte(spte) || is_last_spte(spte, level))  in spte_to_child_pt()
71 	if (iter->level == iter->min_level)  in try_step_down()
80 	child_pt = spte_to_child_pt(iter->old_spte, iter->level);  in try_step_down()
84 	iter->level--;  in try_step_down()
85 	iter->pt_path[iter->level - 1] = child_pt;  in try_step_down()
86 	iter->gfn = round_gfn_for_level(iter->next_last_level_gfn, iter->level);  in try_step_down()
105 	if (SHADOW_PT_INDEX(iter->gfn << PAGE_SHIFT, iter->level) ==  in try_step_side()
109 	iter->gfn += KVM_PAGES_PER_HPAGE(iter->level);  in try_step_side()
124 	if (iter->level == iter->root_level)  in try_step_up()
127 	iter->level++;  in try_step_up()
128 	iter->gfn = round_gfn_for_level(iter->gfn, iter->level);  in try_step_up()