30 	 * different levels, starting out with the leaf level 0
35 	/** @max_level: Highest populated level in @sizes */
50  * @level: The level of @parent.
60 			      unsigned int level, u64 addr, u64 next,
71 	 * to descending to the next level. The returned value of the action
77 	 * after return from descending to the next level. The returned value
83 int xe_pt_walk_range(struct xe_ptw *parent, unsigned int level,
86 int xe_pt_walk_shared(struct xe_ptw *parent, unsigned int level,
90  * xe_pt_covers - Whether the address range covers an entire entry in @level
93  * @level: Page table level.
97  * entry can be inserted at this @level.
99  * Return: Whether the range provided covers exactly an entry at this level.
101 static inline bool xe_pt_covers(u64 addr, u64 end, unsigned int level,  in xe_pt_covers()  argument
104 	u64 pt_size = 1ull << walk->shifts[level];  in xe_pt_covers()
111  * level
114  * @level: Page table level.
117  * Return: The number of page table entries at this level between @start and
121 xe_pt_num_entries(u64 addr, u64 end, unsigned int level,  in xe_pt_num_entries()  argument
124 	u64 pt_size = 1ull << walk->shifts[level];  in xe_pt_num_entries()
127 		walk->shifts[level];  in xe_pt_num_entries()
133  * @level: Page table level.
137  * page table with size indicated by @level.
140 xe_pt_offset(u64 addr, unsigned int level, const struct xe_pt_walk *walk)  in xe_pt_offset()  argument
142 	if (level < walk->max_level)  in xe_pt_offset()
143 		addr &= ((1ull << walk->shifts[level + 1]) - 1);  in xe_pt_offset()
145 	return addr >> walk->shifts[level];  in xe_pt_offset()