1 // SPDX-License-Identifier: GPL-2.0
3 #ifndef __KVM_X86_MMU_TDP_ITER_H
4 #define __KVM_X86_MMU_TDP_ITER_H
6 #include <linux/kvm_host.h>
10 typedef u64 __rcu *tdp_ptep_t;
13 * A TDP iterator performs a pre-order walk over a TDP paging structure.
17 * The iterator will traverse the paging structure towards the mapping
20 gfn_t next_last_level_gfn;
22 * The next_last_level_gfn at the time when the thread last
23 * yielded. Only yielding when the next_last_level_gfn !=
24 * yielded_gfn helps ensure forward progress.
27 /* Pointers to the page tables traversed to reach the current SPTE */
28 tdp_ptep_t pt_path[PT64_ROOT_MAX_LEVEL];
29 /* A pointer to the current SPTE */
31 /* The lowest GFN mapped by the current SPTE */
33 /* The level of the root page given to the iterator */
35 /* The lowest level the iterator should traverse to */
37 /* The iterator's current level within the paging structure */
39 /* The address space ID, i.e. SMM vs. regular. */
41 /* A snapshot of the value at sptep */
44 * Whether the iterator has a valid state. This will be false if the
45 * iterator walks off the end of the paging structure.
49 * True if KVM dropped mmu_lock and yielded in the middle of a walk, in
50 * which case tdp_iter_next() needs to restart the walk at the root
51 * level instead of advancing to the next entry.
57 * Iterates over every SPTE mapping the GFN range [start, end) in a
60 #define for_each_tdp_pte_min_level(iter, root, root_level, min_level, start, end) \
61 for (tdp_iter_start(&iter, root, root_level, min_level, start); \
62 iter.valid && iter.gfn < end; \
65 #define for_each_tdp_pte(iter, root, root_level, start, end) \
66 for_each_tdp_pte_min_level(iter, root, root_level, PG_LEVEL_4K, start, end)
68 tdp_ptep_t spte_to_child_pt(u64 pte, int level);
70 void tdp_iter_start(struct tdp_iter *iter, u64 *root_pt, int root_level,
71 int min_level, gfn_t next_last_level_gfn);
72 void tdp_iter_next(struct tdp_iter *iter);
73 void tdp_iter_restart(struct tdp_iter *iter);
75 #endif /* __KVM_X86_MMU_TDP_ITER_H */