CVE-2026-99710: KVM: x86/mmu: Cap number of parent PTEs per SP at 1000 (the arbitrary rmap limit)

Published Nov 20, 2026
·
Updated

In the Linux kernel, the following vulnerability has been resolved:

KVM: x86/mmu: Cap number of parent PTEs per SP at 1000 (the arbitrary rmap limit)

When potentially reusing a shadow page, zap the shadow page if its number of parent PTEs exceeds KVM's (mostly) arbitrary rmap recycling threshold. Letting the guest create a (mostly) unbounded number of parent PTEs allows the guest to coerce KVM into creating lists containing millions of PTEs, effectively bounded only by the maximum number of shadow pages.

Because PTE lists are simple singly linked lists, removal is O(n). Even worse, if a list is constructed just so, teardown can be O(n^2), e.g. if SPTEs are built such that zapping child SPTEs always zaps the last entry in the list. To cap things off, all paths that walk PTE lists do so while holding mmulock, without conditionally rescheduling.

Using a doubly linked list would not address the issue, as removal would remain O(n) since KVM still wouldn't know where in the list to remove from. Removal could be made O(1) by storing a per-SPTE pointer, but that would largely defeat the purpose of reusing SPs, and would penalize well-behaved guests, especially for nested TDP where aliasing page tables is uncommon.

So, cap the maximum number of parent PTEs at the rmap limit. In practice, well-behaved guests will likely never run afoul of the limit. E.g. when running Linux as L1 with TDP, the number of parent PTEs for a single SP tops out at under 200 (though undoubtedly obscure workloads can push it higher). Deliberately use a "greater than or equal" as opposed to rmap's strictly "greater than", as the rmap code checks the threshold immediately after inserting into the list, i.e. the limit is 1000 for rmaps, KVM just very briefly blows past it.

Apply the check to both indirect and direct SPs, because while a fully direct MMU naturally limits the number of parent PTEs to '1', direct SPs in indirect MMUs have no such constraint. E.g. if the guest maps a huge PTE into many locations in its page tables, and KVM is backing the hugepage with a direct SP, i.e. with a series of smaller pages, then KVM could end up with a direct SP with many parents.

Note, shadowmmutrysplithugepages() always restarts the rmap walk or bails entirely if it gets to the point where it tries to grab a SP, i.e. there is no pre-existing bug that would be tripped by zapping a SP and thus rmaps when getting a SP.

Affected Software

7 affected componentsFixes available
linux/kernel<6.12.118
6.12.118
linux/kernel>=6.13.0<6.18.64
6.18.64
linux/kernel>=6.19.0<7.3.5
7.3.5
debian/linux*
debian/linux*
debian/linux*
debian/linux<=6.1.176-1, <=6.1.192-2, <=6.12.107-1, <=6.12.117-1, <=7.3.4-1
7.3.5-1

Remediation

Recommended actions to resolve this vulnerability, in priority order.

  1. Upgrade

    Upgrade linux/Kernel to a version that resolves this vulnerability.

    Fixed in 6.12.118
  2. Upgrade

    Upgrade linux/Kernel to a version that resolves this vulnerability.

    Fixed in 6.18.64
  3. Upgrade

    Upgrade linux/Kernel to a version that resolves this vulnerability.

    Fixed in 7.3.5
  4. Upgrade

    Upgrade debian/linux to a version that resolves this vulnerability.

    Fixed in 7.3.5-1

Event History

Nov 20, 2026
CVE Published
via MITRE·05:50 AM
Data Sourced
via MITRE·05:50 AM
Description
Data Sourced
via OSV·05:50 AM
DescriptionAffected Software
Data Sourced
via NVD·06:18 AM
Description

Frequently Asked Questions

1

Who can trigger the excessive PTE-list growth?

A guest can create an effectively unbounded number of parent PTEs for a shadow page, bounded by the maximum number of shadow pages. Systems using KVM on x86 are the relevant exposure context.

2

What is the practical impact of exploitation?

Large parent-PTE lists make removal O(n), and specially constructed lists can make teardown O(n^2). KVM walks these lists while holding mmu_lock and does not conditionally reschedule, which can cause prolonged lock hold times.

3

Does exploitation require access to the host?

The described trigger is controlled by a guest: the guest creates the parent PTE relationships that grow the lists. The provided information does not identify any additional host-side access requirement.

4

What does the fix change?

When KVM considers reusing a shadow page, it now zaps that shadow page if it has more than 1000 parent PTEs, matching KVM's arbitrary rmap recycling limit. This prevents reuse of shadow pages with excessively large parent-PTE lists.

Contact

SecAlerts Pty Ltd.
132 Wickham Terrace
Fortitude Valley,
QLD 4006, Australia
info@secalerts.co
By using SecAlerts services, you agree to our services end-user license agreement. This website is safeguarded by reCAPTCHA and governed by the Google Privacy Policy and Terms of Service. All names, logos, and brands of products are owned by their respective owners, and any usage of these names, logos, and brands for identification purposes only does not imply endorsement. If you possess any content that requires removal, please get in touch with us.
© 2026 SecAlerts Pty Ltd.
ABN: 70 645 966 203, ACN: 645 966 203