32 	 * different levels, starting out with the leaf level 0
37 	/** @max_level: Highest populated level in @sizes */
54  * @level: The level of @parent.
64 			      unsigned int level, u64 addr, u64 next,
75 	 * to descending to the next level. The returned value of the action
81 	 * after return from descending to the next level. The returned value
87 int xe_pt_walk_range(struct xe_ptw *parent, unsigned int level,
90 int xe_pt_walk_shared(struct xe_ptw *parent, unsigned int level,
94  * xe_pt_covers - Whether the address range covers an entire entry in @level
97  * @level: Page table level.
101  * entry can be inserted at this @level.
103  * Return: Whether the range provided covers exactly an entry at this level.
105 static inline bool xe_pt_covers(u64 addr, u64 end, unsigned int level,  in xe_pt_covers()  argument
108 	u64 pt_size = 1ull << walk->shifts[level];  in xe_pt_covers()
115  * level
118  * @level: Page table level.
121  * Return: The number of page table entries at this level between @start and
125 xe_pt_num_entries(u64 addr, u64 end, unsigned int level,  in xe_pt_num_entries()  argument
128 	u64 pt_size = 1ull << walk->shifts[level];  in xe_pt_num_entries()
131 		walk->shifts[level];  in xe_pt_num_entries()
137  * @level: Page table level.
141  * page table with size indicated by @level.
144 xe_pt_offset(u64 addr, unsigned int level, const struct xe_pt_walk *walk)  in xe_pt_offset()  argument
146 	if (level < walk->max_level)  in xe_pt_offset()
147 		addr &= ((1ull << walk->shifts[level + 1]) - 1);  in xe_pt_offset()
149 	return addr >> walk->shifts[level];  in xe_pt_offset()