vmm_gpt_node_t
vmm_gpt_node_t *vgn_sib_prev;
vmm_gpt_node_t *next = vmm_gpt_node_next(node, false);
vmm_gpt_node_t *vgpt_root;
static vmm_gpt_node_t *
vmm_gpt_node_t *node;
vmm_gpt_node_free(vmm_gpt_node_t *node)
vmm_gpt_node_end(vmm_gpt_node_t *node)
vmm_gpt_node_is_last(vmm_gpt_node_t *node)
vmm_gpt_node_entries_covered(vmm_gpt_node_t *node, uint64_t start, uint64_t end)
static vmm_gpt_node_t *
vmm_gpt_node_next(vmm_gpt_node_t *node, bool only_seq)
vmm_gpt_node_t *next = node->vgn_sib_next;
vmm_gpt_node_t *psibling =
static vmm_gpt_node_t *
vmm_gpt_node_find_child(vmm_gpt_node_t *parent, uint64_t gpa)
for (vmm_gpt_node_t *child = parent->vgn_children;
vmm_gpt_node_add(vmm_gpt_t *gpt, vmm_gpt_node_t *parent,
vmm_gpt_node_t *child, uint64_t gpa, vmm_gpt_node_t *prev_sibling)
vmm_gpt_node_t *next_sibling = parent->vgn_children;
vmm_gpt_node_remove(vmm_gpt_node_t *child)
vmm_gpt_node_t *parent = child->vgn_parent;
vmm_gpt_node_t *prev = child->vgn_sib_prev;
vmm_gpt_node_t *next = child->vgn_sib_next;
static vmm_gpt_node_t *
vmm_gpt_node_t *node_start)
vmm_gpt_node_t *parent = node_start;
vmm_gpt_node_t *prev = NULL, *node = parent->vgn_children;
vmm_gpt_node_t *front_node = node;
vmm_gpt_node_t *node = gpt->vgpt_root;
vmm_gpt_node_t *next = vmm_gpt_node_next(node, true);
vmm_gpt_node_t *vgn_parent;
vmm_gpt_node_t *vgn_children;
vmm_gpt_node_t *node, *starts[MAX_GPT_LEVEL] = {
vmm_gpt_node_t *vgn_sib_next;