pt_entry_fully_covered(9)

pt_entry_fully_covered(9) 👑

okay bestie, welcome to the Kernel API Manual page for pt_entry_fully_covered(9) — yes, the whole name, she's iconic like that. This one is lowkey simple but highkey useful: it checks whether the item or entry is entirely contained within pts->range. Periodt. 💅

NAME 💖

pt_entry_fully_covered — check if the item or entry is entirely contained within pts->range. That's the whole assignment, bestie: is it fully inside or not? 🎀

SYNOPSIS ✨

bool pt_entry_fully_covered (const struct pt_state *pts , unsigned int
oasz_lg2 );

ARGUMENTS 🧚

• pts — Iteration State. That's the state you're iterating with, no cap.
• oasz_lg2 — the size of the item to check; it's pt_table_item_lg2sz or pt_entry_oa_lg2sz. Like, one of those two, fr fr.

RETURN 🫶

true if the item is fully enclosed by the pts->range. Literally the vibe check result: fully covered means true. 🌸

SEE ALSO 👀

Kernel file: ./drivers/iommu/generic_pt/pt_iter.h

• pt_check_range(9)
• pt_index_to_va(9)
• pt_range_to_index(9)
• pt_range_to_end_index(9)
• pt_next_entry(9)
• for_each_pt_level_entry(9)
• pt_load_single_entry(9)
• pt_top_range(9)
• pt_all_range(9)
• pt_upper_range(9)
• pt_make_range(9)
• pt_init(9)
• pt_init_top(9)
• pt_descend(9)
• pt_walk_range(9)
• pt_range_slice(9)
• pt_top_memsize_lg2(9)
• pt_compute_best_pgsize(9)
• PT_MAKE_LEVELS(9)

That's the whole page, bestie. Source/version: ./drivers/iommu/generic_pt; dated October 2026; manual page: pt_entry_fully_covered(9). Mwah 💋✨