LEVEL1
node = starts[LEVEL1];
for (vmm_gpt_node_level_t lvl = LEVEL1; lvl > LEVEL4; lvl--) {
(void) vmm_gpt_walk(gpt, gpa, entries, LEVEL1);
if (entries[LEVEL1] == NULL)
pte = *entries[LEVEL1];
*entries[LEVEL1] = 0;
case LEVEL1: return ((gpa >> 12) & mask);
case LEVEL1: return (0xfffffffffffff000ul); /* entries cover 4K */
case LEVEL1: return (0x1000ul); /* entries cover 4K */
ASSERT3U(parent->vgn_level, <, LEVEL1);
iter->vgi_current = vmm_gpt_walk(gpt, addr, iter->vgi_entries, LEVEL1);
if (iter->vgi_entries[LEVEL1] != NULL) {
entry->vgie_ptep = iter->vgi_entries[LEVEL1];
iter->vgi_current, iter->vgi_entries, LEVEL1);
for (uint_t lvl = LEVEL4; lvl < LEVEL1; lvl++) {
ASSERT3U(node->vgn_level, ==, LEVEL1);
for (vmm_gpt_node_level_t lvl = LEVEL4; lvl < LEVEL1; lvl++) {
(void) vmm_gpt_walk(gpt, gpa, entries, LEVEL1);
leaf = entries[LEVEL1];