CVE-2026-99710 (GCVE-0-2026-99710)

Vulnerability from cvelistv5 – Published: 2026-11-20 05:50 – Updated: 2026-11-20 05:50
VLAI
Title
KVM: x86/mmu: Cap number of parent PTEs per SP at 1000 (the arbitrary rmap limit)
Summary
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 mmu_lock, 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, shadow_mmu_try_split_huge_pages() 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.
Severity
No CVSS data available.
Assigner
Linux CNA under the mitre root
CNA scorecard D 53/100 over 7143 records in the last 180 days details
Impacted products
Vendor Product Version CPE status
Linux Linux Affected: 1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 , < edf87e07376054eedcd5306e0794a26e3004d97b (git)
Affected: 1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 , < e0752f3e543c1b67fc9115251ae6b8f151ba9f04 (git)
Affected: 1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 , < 72238066aacc400df69cef4b602f083ae4737762 (git)
Affected: 1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 , < e4558c3d7198ed9a0adc3304681f561f4e4d80e1 (git)
Affected: 0 , < 6.12.118 (semver)
Affected: 0 , < 6.18.64 (semver)
Affected: 0 , < 7.3.5 (semver)
guessed Create a notification for this product.
Linux Linux Unaffected: 6.12.118 , ≤ 6.12.* (semver)
Unaffected: 6.18.64 , ≤ 6.18.* (semver)
Unaffected: 7.3.5 , ≤ 7.3.* (semver)
Unaffected: 7.4-rc2 , ≤ * (original_commit_for_fix)
guessed Create a notification for this product.
Show details on NVD website

{
  "containers": {
    "cna": {
      "affected": [
        {
          "defaultStatus": "unaffected",
          "product": "Linux",
          "programFiles": [
            "arch/x86/kvm/mmu/mmu.c"
          ],
          "repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
          "vendor": "Linux",
          "versions": [
            {
              "lessThan": "edf87e07376054eedcd5306e0794a26e3004d97b",
              "status": "affected",
              "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
              "versionType": "git"
            },
            {
              "lessThan": "e0752f3e543c1b67fc9115251ae6b8f151ba9f04",
              "status": "affected",
              "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
              "versionType": "git"
            },
            {
              "lessThan": "72238066aacc400df69cef4b602f083ae4737762",
              "status": "affected",
              "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
              "versionType": "git"
            },
            {
              "lessThan": "e4558c3d7198ed9a0adc3304681f561f4e4d80e1",
              "status": "affected",
              "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
              "versionType": "git"
            },
            {
              "lessThan": "6.12.118",
              "status": "affected",
              "version": "0",
              "versionType": "semver"
            },
            {
              "lessThan": "6.18.64",
              "status": "affected",
              "version": "0",
              "versionType": "semver"
            },
            {
              "lessThan": "7.3.5",
              "status": "affected",
              "version": "0",
              "versionType": "semver"
            }
          ]
        },
        {
          "defaultStatus": "affected",
          "product": "Linux",
          "programFiles": [
            "arch/x86/kvm/mmu/mmu.c"
          ],
          "repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
          "vendor": "Linux",
          "versions": [
            {
              "lessThanOrEqual": "6.12.*",
              "status": "unaffected",
              "version": "6.12.118",
              "versionType": "semver"
            },
            {
              "lessThanOrEqual": "6.18.*",
              "status": "unaffected",
              "version": "6.18.64",
              "versionType": "semver"
            },
            {
              "lessThanOrEqual": "7.3.*",
              "status": "unaffected",
              "version": "7.3.5",
              "versionType": "semver"
            },
            {
              "lessThanOrEqual": "*",
              "status": "unaffected",
              "version": "7.4-rc2",
              "versionType": "original_commit_for_fix"
            }
          ]
        }
      ],
      "cpeApplicability": [
        {
          "nodes": [
            {
              "cpeMatch": [
                {
                  "criteria": "cpe:2.3:o:linux:linux_kernel:*:*:*:*:*:*:*:*",
                  "versionEndExcluding": "6.12.118",
                  "vulnerable": true
                },
                {
                  "criteria": "cpe:2.3:o:linux:linux_kernel:*:*:*:*:*:*:*:*",
                  "versionEndExcluding": "6.18.64",
                  "vulnerable": true
                },
                {
                  "criteria": "cpe:2.3:o:linux:linux_kernel:*:*:*:*:*:*:*:*",
                  "versionEndExcluding": "7.3.5",
                  "vulnerable": true
                },
                {
                  "criteria": "cpe:2.3:o:linux:linux_kernel:*:*:*:*:*:*:*:*",
                  "versionEndExcluding": "7.4-rc2",
                  "vulnerable": true
                }
              ],
              "negate": false,
              "operator": "OR"
            }
          ]
        }
      ],
      "descriptions": [
        {
          "lang": "en",
          "value": "In the Linux kernel, the following vulnerability has been resolved:\n\nKVM: x86/mmu: Cap number of parent PTEs per SP at 1000 (the arbitrary rmap limit)\n\nWhen potentially reusing a shadow page, zap the shadow page if its number\nof parent PTEs exceeds KVM\u0027s (mostly) arbitrary rmap recycling threshold.\nLetting the guest create a (mostly) unbounded number of parent PTEs allows\nthe guest to coerce KVM into creating lists containing millions of PTEs,\neffectively bounded only by the maximum number of shadow pages.\n\nBecause PTE lists are simple singly linked lists, removal is O(n).  Even\nworse, if a list is constructed just so, teardown can be O(n^2), e.g. if\nSPTEs are built such that zapping child SPTEs always zaps the last entry\nin the list.  To cap things off, all paths that walk PTE lists do so\nwhile holding mmu_lock, without conditionally rescheduling.\n\nUsing a doubly linked list would not address the issue, as removal would\nremain O(n) since KVM still wouldn\u0027t know where in the list to remove from.\nRemoval could be made O(1) by storing a per-SPTE pointer, but that would\nlargely defeat the purpose of reusing SPs, and would penalize well-behaved\nguests, especially for nested TDP where aliasing page tables is uncommon.\n\nSo, cap the maximum number of parent PTEs at the rmap limit.  In practice,\nwell-behaved guests will likely never run afoul of the limit.  E.g. when\nrunning Linux as L1 with TDP, the number of parent PTEs for a single SP\ntops out at under 200 (though undoubtedly obscure workloads can push it\nhigher).  Deliberately use a \"greater than or equal\" as opposed to rmap\u0027s\nstrictly \"greater than\", as the rmap code checks the threshold immediately\n*after* inserting into the list, i.e. the limit is 1000 for rmaps, KVM just\nvery briefly blows past it.\n\nApply the check to both indirect and direct SPs, because while a fully\ndirect MMU naturally limits the number of parent PTEs to \u00271\u0027, direct SPs in\nindirect MMUs have no such constraint.  E.g. if the guest maps a huge PTE\ninto many locations in its page tables, and KVM is backing the hugepage\nwith a direct SP, i.e. with a series of smaller pages, then KVM could end\nup with a direct SP with many parents.\n\nNote, shadow_mmu_try_split_huge_pages() always restarts the rmap walk or\nbails entirely if it gets to the point where it tries to grab a SP, i.e.\nthere is *no* pre-existing bug that would be tripped by zapping a SP and\nthus rmaps when getting a SP."
        }
      ],
      "providerMetadata": {
        "dateUpdated": "2026-11-20T05:50:50.082Z",
        "orgId": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
        "shortName": "Linux"
      },
      "references": [
        {
          "url": "https://git.kernel.org/stable/c/edf87e07376054eedcd5306e0794a26e3004d97b"
        },
        {
          "url": "https://git.kernel.org/stable/c/e0752f3e543c1b67fc9115251ae6b8f151ba9f04"
        },
        {
          "url": "https://git.kernel.org/stable/c/72238066aacc400df69cef4b602f083ae4737762"
        },
        {
          "url": "https://git.kernel.org/stable/c/e4558c3d7198ed9a0adc3304681f561f4e4d80e1"
        }
      ],
      "title": "KVM: x86/mmu: Cap number of parent PTEs per SP at 1000 (the arbitrary rmap limit)",
      "x_generator": {
        "engine": "bippy-1.2.0"
      }
    }
  },
  "cveMetadata": {
    "assignerOrgId": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
    "assignerShortName": "Linux",
    "cveId": "CVE-2026-99710",
    "datePublished": "2026-11-20T05:50:50.082Z",
    "dateReserved": "2026-09-25T10:25:14.430Z",
    "dateUpdated": "2026-11-20T05:50:50.082Z",
    "state": "PUBLISHED"
  },
  "dataType": "CVE_RECORD",
  "dataVersion": "5.2",
  "vulnerability-lookup:meta": {
    "epss": {
      "cve": "CVE-2026-99710",
      "date": "2026-11-20",
      "epss": "0.00168",
      "percentile": "0.06297"
    },
    "nvd": {
      "cve": {
        "affected": [
          {
            "affectedData": [
              {
                "defaultStatus": "unaffected",
                "product": "Linux",
                "programFiles": [
                  "arch/x86/kvm/mmu/mmu.c"
                ],
                "repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
                "vendor": "Linux",
                "versions": [
                  {
                    "lessThan": "edf87e07376054eedcd5306e0794a26e3004d97b",
                    "status": "affected",
                    "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
                    "versionType": "git"
                  },
                  {
                    "lessThan": "e0752f3e543c1b67fc9115251ae6b8f151ba9f04",
                    "status": "affected",
                    "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
                    "versionType": "git"
                  },
                  {
                    "lessThan": "72238066aacc400df69cef4b602f083ae4737762",
                    "status": "affected",
                    "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
                    "versionType": "git"
                  },
                  {
                    "lessThan": "e4558c3d7198ed9a0adc3304681f561f4e4d80e1",
                    "status": "affected",
                    "version": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
                    "versionType": "git"
                  },
                  {
                    "lessThan": "6.12.118",
                    "status": "affected",
                    "version": "0",
                    "versionType": "semver"
                  },
                  {
                    "lessThan": "6.18.64",
                    "status": "affected",
                    "version": "0",
                    "versionType": "semver"
                  },
                  {
                    "lessThan": "7.3.5",
                    "status": "affected",
                    "version": "0",
                    "versionType": "semver"
                  }
                ]
              },
              {
                "defaultStatus": "affected",
                "product": "Linux",
                "programFiles": [
                  "arch/x86/kvm/mmu/mmu.c"
                ],
                "repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
                "vendor": "Linux",
                "versions": [
                  {
                    "lessThanOrEqual": "6.12.*",
                    "status": "unaffected",
                    "version": "6.12.118",
                    "versionType": "semver"
                  },
                  {
                    "lessThanOrEqual": "6.18.*",
                    "status": "unaffected",
                    "version": "6.18.64",
                    "versionType": "semver"
                  },
                  {
                    "lessThanOrEqual": "7.3.*",
                    "status": "unaffected",
                    "version": "7.3.5",
                    "versionType": "semver"
                  },
                  {
                    "lessThanOrEqual": "*",
                    "status": "unaffected",
                    "version": "7.4-rc2",
                    "versionType": "original_commit_for_fix"
                  }
                ]
              }
            ],
            "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67"
          }
        ],
        "cveTags": [],
        "descriptions": [
          {
            "lang": "en",
            "value": "In the Linux kernel, the following vulnerability has been resolved:\n\nKVM: x86/mmu: Cap number of parent PTEs per SP at 1000 (the arbitrary rmap limit)\n\nWhen potentially reusing a shadow page, zap the shadow page if its number\nof parent PTEs exceeds KVM\u0027s (mostly) arbitrary rmap recycling threshold.\nLetting the guest create a (mostly) unbounded number of parent PTEs allows\nthe guest to coerce KVM into creating lists containing millions of PTEs,\neffectively bounded only by the maximum number of shadow pages.\n\nBecause PTE lists are simple singly linked lists, removal is O(n).  Even\nworse, if a list is constructed just so, teardown can be O(n^2), e.g. if\nSPTEs are built such that zapping child SPTEs always zaps the last entry\nin the list.  To cap things off, all paths that walk PTE lists do so\nwhile holding mmu_lock, without conditionally rescheduling.\n\nUsing a doubly linked list would not address the issue, as removal would\nremain O(n) since KVM still wouldn\u0027t know where in the list to remove from.\nRemoval could be made O(1) by storing a per-SPTE pointer, but that would\nlargely defeat the purpose of reusing SPs, and would penalize well-behaved\nguests, especially for nested TDP where aliasing page tables is uncommon.\n\nSo, cap the maximum number of parent PTEs at the rmap limit.  In practice,\nwell-behaved guests will likely never run afoul of the limit.  E.g. when\nrunning Linux as L1 with TDP, the number of parent PTEs for a single SP\ntops out at under 200 (though undoubtedly obscure workloads can push it\nhigher).  Deliberately use a \"greater than or equal\" as opposed to rmap\u0027s\nstrictly \"greater than\", as the rmap code checks the threshold immediately\n*after* inserting into the list, i.e. the limit is 1000 for rmaps, KVM just\nvery briefly blows past it.\n\nApply the check to both indirect and direct SPs, because while a fully\ndirect MMU naturally limits the number of parent PTEs to \u00271\u0027, direct SPs in\nindirect MMUs have no such constraint.  E.g. if the guest maps a huge PTE\ninto many locations in its page tables, and KVM is backing the hugepage\nwith a direct SP, i.e. with a series of smaller pages, then KVM could end\nup with a direct SP with many parents.\n\nNote, shadow_mmu_try_split_huge_pages() always restarts the rmap walk or\nbails entirely if it gets to the point where it tries to grab a SP, i.e.\nthere is *no* pre-existing bug that would be tripped by zapping a SP and\nthus rmaps when getting a SP."
          }
        ],
        "id": "CVE-2026-99710",
        "lastModified": "2026-11-20T06:18:07.093",
        "metrics": {},
        "published": "2026-11-20T06:18:07.093",
        "references": [
          {
            "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
            "url": "https://git.kernel.org/stable/c/72238066aacc400df69cef4b602f083ae4737762"
          },
          {
            "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
            "url": "https://git.kernel.org/stable/c/e0752f3e543c1b67fc9115251ae6b8f151ba9f04"
          },
          {
            "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
            "url": "https://git.kernel.org/stable/c/e4558c3d7198ed9a0adc3304681f561f4e4d80e1"
          },
          {
            "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
            "url": "https://git.kernel.org/stable/c/edf87e07376054eedcd5306e0794a26e3004d97b"
          }
        ],
        "sourceIdentifier": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
        "vulnStatus": "Received"
      }
    },
    "redhat_vex": {
      "aggregate_severity": "Moderate",
      "current_release_date": "2026-11-20T08:03:15+00:00",
      "cve": "CVE-2026-99710",
      "id": "CVE-2026-99710",
      "initial_release_date": "2026-11-20T05:50:50.082000+00:00",
      "product_status:known_affected": "162",
      "product_status:known_not_affected": "42",
      "source": "Red Hat CSAF VEX",
      "status": "final",
      "title": "kernel: kernel: Denial of Service via unbounded parent page table entries in KVM",
      "url": "https://security.access.redhat.com/data/csaf/v2/vex/2026/cve-2026-99710.json",
      "version": "3"
    }
  }
}



Log in or create an account to share your comment.




Tags
Taxonomy of the tags.


Loading…

Loading…

Loading…

Drag nodes to arrange them. Double-click a related vulnerability to open it, or a source to visit its link. The Physics button on the left tunes the layout and the simulation; the legend at the bottom left hides or shows nodes by kind and by sighting type.

Forecast uses a logistic model when the trend is rising, or an exponential decay model when the trend is falling. Fitted via linearized least squares.

Sightings

Author Source Type Date Other

Nomenclature

  • Seen: The vulnerability was mentioned, discussed, or observed by the user.
  • Confirmed: The vulnerability has been validated from an analyst's perspective.
  • Published Proof of Concept: A public proof of concept is available for this vulnerability.
  • Exploited: The vulnerability was observed as exploited by the user who reported the sighting.
  • Patched: The vulnerability was observed as successfully patched by the user who reported the sighting.
  • Not exploited: The vulnerability was not observed as exploited by the user who reported the sighting.
  • Not confirmed: The user expressed doubt about the validity of the vulnerability.
  • Not patched: The vulnerability was not observed as successfully patched by the user who reported the sighting.
Vulnerability timeline

Sightings and recorded dates, grouped by day · UTC

JSON
How durations are calculated

Following the VTEM framework (Black Hat USA 2015), time to patch starts when the vendor or a coordinator was informed, total time to patch at discovery, and disclosure to patch at public disclosure; vendor response time runs from the report to its acknowledgement. Time to exploit and time unpatched start at the earliest discovery or report, falling back to public disclosure. Unpatched time ends at the first recorded patch, or the calculation time when no patch is recorded. Exploitation to patch shows the interval between those two events; a published proof of concept is a public exploit, not exploitation.

Each result shows its source dates. A negative interval means the end event came first; when date-only inputs leave the order open, the result says so. Date-only inputs are approximate. The earliest evidence wins: KEV report dates and sightings are labelled as such. Records describing another vulnerability are listed but never calculated from, and a PoC alone does not establish exploitation. Missing patch evidence does not prove that no patch exists. Filters below change the event list only.

Events included in the timeline

Loading timeline…


    Loading…

    Loading…

    Loading…

    Related by attack behaviour

    Vulnerabilities whose description is nearest to this one in the vector space of the CIRCL/vulnerability-attack-technique-biencoder model. This is a similarity search over the bi-encoder space (plain cosine), not a classification, and it has no measured accuracy.