Attack ChainAIDerived
Hypothetical attack flow derived from CVE metadata – not a confirmed exploit chain
-
AccessLocal access to system using netfs filesystem
-
DeliveryTrigger concurrent readahead on target file
-
ExploitWin synchronisation race in rolling buffer
-
ExecutionAccess prematurely-unlocked folios or corrupt state
-
ImpactDisclose kernel memory or crash kernel
Vulnerability Assessment
| Weakness |
CWE
OWASP Top 10:2025
A06:2025 - Insecure Design
ASVS 5.0
V15 - Secure Coding and Architecture Concurrency control, locking
MITRE ATT&CK
1 technique across 1 tactic: Privilege Escalation The technique list with ATT&CK links and the kill-chain view is part of the Basic plan and up. |
| Exploitation Conditions | Exploitation requires local access to a system actively using a netfs-based filesystem (network/cache filesystems layered on fscache, e.g. AFS, Ceph, CIFS, 9p) with readahead occurring, and the attacker must be able to run code that drives the VM's readahead on target folios concurrently with the netfs collector thread. The specific trigger is the synchronisation gap where the app thread adds folios to the rolling buffer while the collector inspects or clears them (e.g. reading front_folio_order before the next folio is added, or unlocking folios before the xarray is scanned). LIMITING FACTORS: the vector is local only (AV:L), requires an existing netfs/fscache mount in use, requires privileges sufficient to run on the host (PR:L), and depends on winning a narrow timing window - making reliable exploitation difficult and far less likely than the raw CVSS score suggests. |
| Impact | This is a CWE-362 race condition in the Linux kernel's netfs readahead path, scored CVSS 7.1 with vector AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:N/A:H - meaning local access and some privilege are required, not remote exploitation. The real-world risk signals point to low operational urgency: EPSS is 0.16% (4th percentile), the CVE is NOT on CISA KEV, and no exploit or PoC reference is present (the two git.kernel.org links are the fix commits, not exploit code). The vuln.today 'this_week' label reflects routine kernel-patch hygiene rather than active-threat pressure. The high C:H/A:H impact (potential kernel memory disclosure and crash from folios being unlocked before the xarray is scanned) explains the 7.1 score, but the combination of local-only vector, required privileges, and a narrow synchronisation window makes weaponisation difficult. Note a tension in the input: the supplied vector states AC:L, yet CWE-362 and the description describe a timing/synchronisation defect between the app thread and the collector thread, which typically implies a harder-to-win race (AC:H) - this is the basis for the differing assessed vector below. Overall this is a legitimate correctness/stability fix to apply in normal patch cycles, not a drop-everything emergency. |
| Exploit ScenarioDerived | A local user on a system using a netfs-backed filesystem (e.g. AFS, Ceph, 9p, CIFS via fscache) triggers heavy readahead on a file while the netfs collector thread processes the rolling buffer, winning a race where folios are examined or unlocked before the xarray scan completes. Successful timing could expose uninitialised/stale kernel page contents or crash the kernel (denial of service). No public exploit or PoC has been identified at time of analysis, and exploitation requires precise timing against a transient window. |
Get an e-mail when this CVE is exploited, patched or re-scored. Free account.
Alert meAnalysisAIv1 – Oct 28, 2026
Local attackers able to execute code on a Linux host that has an active netfs/fscache-backed filesystem mount (e.g. AFS, Ceph, CIFS/SMB, 9p) can race the netfs readahead folio handling, where the application thread appends folios to the rolling buffer while the collector thread inspects or clears them - for instance reading front_folio_order before the next folio has been added, or unlocking folios before the xarray has been scanned. The kernel fixes the race by loading all readahead folios into the queue upfront and deferring the bulk reference drop until the first subrequest is dispatched, with the collector waiting on NETFS_RREQ_NEED_PUT_RA_REFS. Vendor scoring is CVSS 7.1 (AV:L/AC:L/PR:L/UI:N/C:H/I:N/A:H), while our assessment raises attack complexity to High because a narrow timing window must be won on a host with a netfs mount in use; EPSS is 0.16% (4th percentile), there is no CISA KEV listing, and no public exploit identified at time of analysis. Vendor-released patches are available in Linux 7.2.7 and 7.3-rc3 (plus the listed stable commits).
RemediationAI
Apply the vendor fix: update to Linux 7.2.7 or later on the 7.2 stable branch, or to 7.3-rc3 or later on mainline, or cherry-pick the stable commits fed0b33e6c584986ba70018ec9f9787a98216e64 / 8c9b33945712074a85d3bdacbca036ba6b3d92c6 (https://git.kernel.org/stable/c/fed0b33e6c584986ba70018ec9f9787a98216e64, https://git.kernel.org/stable/c/8c9b33945712074a85d3bdacbca036ba6b3d92c6) into the 6.12 and other affected branches. The referenced changes present the corrected readahead loading and reference-drop ordering as the complete fix; no in-tree workaround is described in the supplied advisory data. Because exploitation is local (AV:L) and requires privileges sufficient to run code on a host that is actively using a netfs-based filesystem with readahead occurring, restricting interactive and service-level code execution on such hosts to trusted users lowers exposure, at the cost of reduced multi-tenant or shared-host usability; this does not remove the race and patching remains the only complete remediation per the vendor commits.
Affected VersionsENISA
Affected Packages
Source: OSV (Open Source Vulnerabilities)
Affects your stack
Affects 1 package in euvd
Checking this CVE against your own stacks and servers is part of the Basic plan and up.
Technical ContextAI · show details
The netfs library is the shared readahead and folio-caching layer used by Linux network and cache filesystems built on fscache - AFS, Ceph, CIFS/SMB and 9p among them (CPE: cpe:2.3:a:linux:linux). Readahead in this code used a rolling buffer: the application thread progressively added folios selected by the VM while a collector thread inspected them and eventually cleared them and dropped references. Because the buffer was populated lazily, the collector could read state such as front_folio_order before the next folio had been added, and could unlock folios before the xarray had been scanned for them - a classic CWE-362 concurrent access / race condition on shared state, with the folio reference lifecycle as the contested resource. The upstream fix changes the loader to pull every folio selected by the VM for readahead into the folio queue upfront, allocating the queue a batch at a time because readahead_control tracks a page count rather than a folio count, and then drops the readahead-acquired references in bulk once the first subrequest is dispatched. The collector now waits for NETFS_RREQ_NEED_PUT_RA_REFS to be cleared so it cannot unlock folios before the xarray scan completes. The fix is a synchronisation and refcounting correction in the readahead path; the trigger requires concurrent readahead activity on a mounted netfs filesystem, and the specific interleaving that produces an observable confidentiality or availability impact is not described in the available sources.
Know when the next one hits your stack
- Watch products and get an email when something new is published
- Check this CVE against your own stack and servers
- Exploit and PoC references, threat intelligence from 22 sources
No credit card · 7-day full trial
Severity by source
AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:N/A:H
Local user triggering readahead gives AV:L/PR:L; a timing-dependent race (CWE-362) implies AC:H; premature folio access yields kernel info disclosure (C:H) and crashes (A:H) with no integrity impact.
Primary rating from NVD.
CVSS VectorNVD
Lifecycle Timeline
4DescriptionNVD
In the Linux kernel, the following vulnerability has been resolved:
netfs: Fix readahead synchronisation issues by loading all folios upfront
There are some synchronisation issues that derive from the app thread adding more folios to the rolling buffer whilst the collector thread is looking at them or trying to clear them, such as determining the setting of front_folio_order when the next folio hasn't been added yet,
The reason for the rolling buffer approach is that loading the buffer upfront and then dropping all the refs just acquired is quite a slow operation, and loading progressively allows some of the cost to be deferred until after at least some of the I/O is started.
Instead, a better way is to load all the folios into the rolling buffer upfront - and then drop the refs later, once the I/O is in progress. (Even better would be for the refs not to be there at all.)
Fix this by changing the rolling buffer loader to load all the folios selected by the VM for readahead upfront into the folio queue. The folio queue is allocated a batch worth at a time as we don't know how many folios are involved (the readahead_control struct, alas, has a page count, not a folio count).
The folio refs acquired from readahead are then dropped in bulk once the first subrequest is dispatched as it's quite a slow operation. The collector waits for NETFS_RREQ_NEED_PUT_RA_REFS to be cleared so that it doesn't unlock folios before the xarray has been scanned for them.
This simplifies the buffer handling later and isn't noticeably slower as the xarray doesn't need to be modified and the folios are all already pre-locked.
Executive ViewAI
A high-severity Linux kernel vulnerability (CVE-2026-98118) affects systems with active network filesystem mounts, enabling local attackers to exploit a race condition that could lead to data confidentiality loss and denial of service. Leadership should prioritize patching because unpatched systems with such mounts are exposed to potential disruption of critical file services and data exposure, though exploitation requires local access and precise timing.
Apply vendor patch.
Threat Intelligence Overview
How this decision was reached
The engine reads each signal below and applies a fixed list of rules from top to bottom. The first rule that matches sets the recommended action – like a statement, every line is shown.
What every action level means
SSVC AssessmentENISA
Priority Score
Attack Technique
Information disclosure occurs when an application unintentionally exposes sensitive data that aids attackers in reconnaissance or directly compromises security.
Race conditions occur when multiple concurrent requests exploit the brief time gap between checking a condition and acting upon it (TOCTOU - Time of Check, Time of Use).
EUVD-2026-86949
GHSA-666r-wxpg-3rcq
NVD
CVE.org
EPSS
Exploit-DB