FKIE_CVE-2026-99786

Vulnerability from fkie_nvd - Published: 2026-11-20 06:18 - Updated: 2026-11-20 06:18
Severity
Summary
In the Linux kernel, the following vulnerability has been resolved: xfrm: retry inexact policy lookup after node reinsertion An inexact policy lookup first records pointers to candidate hlist heads and then traverses the lists. A concurrent policy insertion can merge inexact tree nodes between those operations: lookup policy insertion ------ ---------------- find inexact candidates save obsolete hlist head write_seqcount_begin(&bin->count) merge inexact tree nodes hlist_del_rcu(&policy->bydst) reinsert policy->bydst in survivor write_seqcount_end(&bin->count) evaluate saved candidate list miss the moved policy The merge immediately reinserts the same hlist node into the surviving tree node. RCU keeps the policy alive, but it does not provide a consistent view while its list node is moved. A lookup that selected the obsolete list can observe it empty. A lookup already traversing a moved policy can instead follow the next pointer rewritten by the reinsertion. Either case can return an incorrect IPsec policy result. The per-bin sequence counter already brackets calls to xfrm_policy_inexact_insert_node(), including node merges. The read side, however, currently validates the counter only while searching an individual rb-tree. A successful search returns without validation, and the later candidate-list traversal is outside that read-side section. Snapshot the per-bin sequence before discovering candidate heads and validate it after evaluating all candidate lists. Retry the lookup if the inexact policy tree changes while it is being searched.
Impacted products
Vendor Product Version

{
  "affected": [
    {
      "affectedData": [
        {
          "defaultStatus": "unaffected",
          "product": "Linux",
          "programFiles": [
            "net/xfrm/xfrm_policy.c"
          ],
          "repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
          "vendor": "Linux",
          "versions": [
            {
              "lessThan": "f10bd6c317cef7aa15e185e514513e8548f9ce77",
              "status": "affected",
              "version": "9cf545ebd591da673bb6b6c88150212ad83567a9",
              "versionType": "git"
            },
            {
              "lessThan": "6f66839895b7e9c2673df5bd9dd8d5a82033c825",
              "status": "affected",
              "version": "9cf545ebd591da673bb6b6c88150212ad83567a9",
              "versionType": "git"
            },
            {
              "lessThan": "50d8f2c52093320c70676e9f8af686ff6740abd0",
              "status": "affected",
              "version": "9cf545ebd591da673bb6b6c88150212ad83567a9",
              "versionType": "git"
            },
            {
              "lessThan": "868f63c8bfafa9b827168c9126f85264c39c02ec",
              "status": "affected",
              "version": "9cf545ebd591da673bb6b6c88150212ad83567a9",
              "versionType": "git"
            }
          ]
        },
        {
          "defaultStatus": "affected",
          "product": "Linux",
          "programFiles": [
            "net/xfrm/xfrm_policy.c"
          ],
          "repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
          "vendor": "Linux",
          "versions": [
            {
              "status": "affected",
              "version": "5.0"
            },
            {
              "lessThan": "5.0",
              "status": "unaffected",
              "version": "0",
              "versionType": "semver"
            },
            {
              "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\nxfrm: retry inexact policy lookup after node reinsertion\n\nAn inexact policy lookup first records pointers to candidate hlist heads\nand then traverses the lists.  A concurrent policy insertion can merge\ninexact tree nodes between those operations:\n\n  lookup                         policy insertion\n  ------                         ----------------\n  find inexact candidates\n    save obsolete hlist head\n                                 write_seqcount_begin(\u0026bin-\u003ecount)\n                                 merge inexact tree nodes\n                                   hlist_del_rcu(\u0026policy-\u003ebydst)\n                                   reinsert policy-\u003ebydst in survivor\n                                 write_seqcount_end(\u0026bin-\u003ecount)\n  evaluate saved candidate list\n    miss the moved policy\n\nThe merge immediately reinserts the same hlist node into the surviving\ntree node.  RCU keeps the policy alive, but it does not provide a\nconsistent view while its list node is moved.  A lookup that selected the\nobsolete list can observe it empty.  A lookup already traversing a moved\npolicy can instead follow the next pointer rewritten by the reinsertion.\nEither case can return an incorrect IPsec policy result.\n\nThe per-bin sequence counter already brackets calls to\nxfrm_policy_inexact_insert_node(), including node merges.  The read side,\nhowever, currently validates the counter only while searching an\nindividual rb-tree.  A successful search returns without validation, and\nthe later candidate-list traversal is outside that read-side section.\n\nSnapshot the per-bin sequence before discovering candidate heads and\nvalidate it after evaluating all candidate lists.   Retry the lookup if\nthe inexact policy tree changes while it is being searched."
    }
  ],
  "id": "CVE-2026-99786",
  "lastModified": "2026-11-20T06:18:17.847",
  "metrics": {},
  "published": "2026-11-20T06:18:17.847",
  "references": [
    {
      "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
      "url": "https://git.kernel.org/stable/c/50d8f2c52093320c70676e9f8af686ff6740abd0"
    },
    {
      "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
      "url": "https://git.kernel.org/stable/c/6f66839895b7e9c2673df5bd9dd8d5a82033c825"
    },
    {
      "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
      "url": "https://git.kernel.org/stable/c/868f63c8bfafa9b827168c9126f85264c39c02ec"
    },
    {
      "source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
      "url": "https://git.kernel.org/stable/c/f10bd6c317cef7aa15e185e514513e8548f9ce77"
    }
  ],
  "sourceIdentifier": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
  "vulnStatus": "Received"
}



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.