Lines Matching refs:skip
104 uint32_t skip : 6; member
198 e.skip = leaf ? 0 : 1; in phys_map_node_alloc()
213 if (lp->skip && lp->ptr == PHYS_MAP_NODE_NIL) { in phys_page_set_level()
221 lp->skip = 0; in phys_page_set_level()
264 if (p[i].skip) { in phys_page_compact()
278 lp->skip + p[valid_ptr].skip >= (1 << 6)) { in phys_page_compact()
283 if (!p[valid_ptr].skip) { in phys_page_compact()
290 lp->skip = 0; in phys_page_compact()
292 lp->skip += p[valid_ptr].skip; in phys_page_compact()
298 if (d->phys_map.skip) { in address_space_dispatch_compact()
322 for (i = P_L2_LEVELS; lp.skip && (i -= lp.skip) >= 0;) { in phys_page_find()
2554 d->phys_map = (PhysPageEntry) { .ptr = PHYS_MAP_NODE_NIL, .skip = 1 }; in address_space_dispatch_new()
3757 static void mtree_print_phys_entries(int start, int end, int skip, int ptr) in mtree_print_phys_entries() argument
3764 qemu_printf(" skip=%d ", skip); in mtree_print_phys_entries()
3767 } else if (!skip) { in mtree_print_phys_entries()
3809 P_L2_BITS, P_L2_LEVELS, d->phys_map.ptr, d->phys_map.skip); in mtree_print_dispatch()
3820 if (pe->ptr == prev.ptr && pe->skip == prev.skip) { in mtree_print_dispatch()
3824 mtree_print_phys_entries(jprev, j, prev.skip, prev.ptr); in mtree_print_dispatch()
3831 mtree_print_phys_entries(jprev, j, prev.skip, prev.ptr); in mtree_print_dispatch()