tdp_iter.c File Reference

#include "mmu_internal.h"
#include "tdp_iter.h"
#include "spte.h"

Include dependency graph for tdp_iter.c:

Go to the source code of this file.

Macros
#define	pr_fmt(fmt)   KBUILD_MODNAME ": " fmt

Functions
static void	tdp_iter_refresh_sptep (struct tdp_iter *iter)
void	tdp_iter_restart (struct tdp_iter *iter)
void	tdp_iter_start (struct tdp_iter *iter, struct kvm_mmu_page *root, int min_level, gfn_t next_last_level_gfn)
tdp_ptep_t	spte_to_child_pt (u64 spte, int level)
static bool	try_step_down (struct tdp_iter *iter)
static bool	try_step_side (struct tdp_iter *iter)
static bool	try_step_up (struct tdp_iter *iter)
void	tdp_iter_next (struct tdp_iter *iter)

Macro Definition Documentation

pr_fmt

#define pr_fmt

(

fmt

)

KBUILD_MODNAME ": " fmt

Definition at line 2 of file tdp_iter.c.

Function Documentation

spte_to_child_pt()

tdp_ptep_t spte_to_child_pt	(	u64	spte,
		int	level
	)

Definition at line 62 of file tdp_iter.c.

{
    /*
     * There's no child entry if this entry isn't present or is a
     * last-level entry.
     */
    if (!is_shadow_present_pte(spte) || is_last_spte(spte, level))
        return NULL;
 
    return (tdp_ptep_t)__va(spte_to_pfn(spte) << PAGE_SHIFT);
}

Here is the call graph for this function:

Here is the caller graph for this function:

tdp_iter_next()

void tdp_iter_next

(

struct tdp_iter *

iter

)

Definition at line 161 of file tdp_iter.c.

{
    if (iter->yielded) {
        tdp_iter_restart(iter);
        return;
    }
 
    if (try_step_down(iter))
        return;
 
    do {
        if (try_step_side(iter))
            return;
    } while (try_step_up(iter));
    iter->valid = false;
}

Here is the call graph for this function:

tdp_iter_refresh_sptep()

static void tdp_iter_refresh_sptep ( struct tdp_iter *  iter )

static

Definition at line 12 of file tdp_iter.c.

{
    iter->sptep = iter->pt_path[iter->level - 1] +
        SPTE_INDEX(iter->gfn << PAGE_SHIFT, iter->level);
    iter->old_spte = kvm_tdp_mmu_read_spte(iter->sptep);
}

Here is the call graph for this function:

Here is the caller graph for this function:

tdp_iter_restart()

void tdp_iter_restart

(

struct tdp_iter *

iter

)

Definition at line 23 of file tdp_iter.c.

{
    iter->yielded = false;
    iter->yielded_gfn = iter->next_last_level_gfn;
    iter->level = iter->root_level;
 
    iter->gfn = gfn_round_for_level(iter->next_last_level_gfn, iter->level);
    tdp_iter_refresh_sptep(iter);
 
    iter->valid = true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

tdp_iter_start()

void tdp_iter_start	(	struct tdp_iter *	iter,
		struct kvm_mmu_page *	root,
		int	min_level,
		gfn_t	next_last_level_gfn
	)

Definition at line 39 of file tdp_iter.c.

{
    if (WARN_ON_ONCE(!root || (root->role.level < 1) ||
             (root->role.level > PT64_ROOT_MAX_LEVEL))) {
        iter->valid = false;
        return;
    }
 
    iter->next_last_level_gfn = next_last_level_gfn;
    iter->root_level = root->role.level;
    iter->min_level = min_level;
    iter->pt_path[iter->root_level - 1] = (tdp_ptep_t)root->spt;
    iter->as_id = kvm_mmu_page_as_id(root);
 
    tdp_iter_restart(iter);
}

Here is the call graph for this function:

try_step_down()

static bool try_step_down ( struct tdp_iter *  iter )

static

Definition at line 78 of file tdp_iter.c.

{
    tdp_ptep_t child_pt;
 
    if (iter->level == iter->min_level)
        return false;
 
    /*
     * Reread the SPTE before stepping down to avoid traversing into page
     * tables that are no longer linked from this entry.
     */
    iter->old_spte = kvm_tdp_mmu_read_spte(iter->sptep);
 
    child_pt = spte_to_child_pt(iter->old_spte, iter->level);
    if (!child_pt)
        return false;
 
    iter->level--;
    iter->pt_path[iter->level - 1] = child_pt;
    iter->gfn = gfn_round_for_level(iter->next_last_level_gfn, iter->level);
    tdp_iter_refresh_sptep(iter);
 
    return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

try_step_side()

static bool try_step_side ( struct tdp_iter *  iter )

static

Definition at line 110 of file tdp_iter.c.

{
    /*
     * Check if the iterator is already at the end of the current page
     * table.
     */
    if (SPTE_INDEX(iter->gfn << PAGE_SHIFT, iter->level) ==
        (SPTE_ENT_PER_PAGE - 1))
        return false;
 
    iter->gfn += KVM_PAGES_PER_HPAGE(iter->level);
    iter->next_last_level_gfn = iter->gfn;
    iter->sptep++;
    iter->old_spte = kvm_tdp_mmu_read_spte(iter->sptep);
 
    return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

try_step_up()

static bool try_step_up ( struct tdp_iter *  iter )

static

Definition at line 133 of file tdp_iter.c.

{
    if (iter->level == iter->root_level)
        return false;
 
    iter->level++;
    iter->gfn = gfn_round_for_level(iter->gfn, iter->level);
    tdp_iter_refresh_sptep(iter);
 
    return true;
}

Here is the call graph for this function:

Here is the caller graph for this function: