AZL-115705: CVE-2026-99786 affecting package kernel 6.6.161.1-1
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 writeseqcountbegin(&bin->count) merge inexact tree nodes hlistdelrcu(&policy->bydst) reinsert policy->bydst in survivor writeseqcountend(&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 xfrmpolicyinexactinsertnode(), 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.
Affected Software
Remediation
Recommended actions to resolve this vulnerability, in priority order.
- Compensating control
For inexact IPsec policy lookups, snapshot the per-bin sequence counter before discovering candidate list heads, validate it after evaluating all candidate lists, and retry the lookup if it changed.