CVE-2026-98642

Description

A flaw was found in the Linux kernel's Berkeley Packet Filter (BPF) memory allocator. A race condition occurs when bulk memory allocation and memory cleanup run concurrently without adequate synchronization. A local attacker could exploit this flaw to trigger a use-after-free condition, leading to a Denial of Service (DoS) via a system crash or potential privilege escalation.

Statement

A race in the BPF memory allocator allows alloc_bulk to consume waiting_for_gp_ttrace while an RCU Tasks Trace callback removes and frees the same list. The confirmed result is a use-after-free read of entry next in llist_del_first, which can cause a kernel crash and may propagate stale list state if the freed node is reused before the read. A related race can affect free_by_rcu_ttrace during allocator draining when IRQ work and cross-CPU frees overlap. For the CVSS the PR:L value is used because a local user or process with access to the BPF interface may create the required allocation and free activity. Systems that disable unprivileged BPF may require CAP_BPF or equivalent capabilities and therefore have lower practical exposure. AC:H is used because successful triggering depends on a concurrent timing window involving RCU callbacks and list consumption. The issue is not directly network reachable. Impact is at least a local denial of service via kernel crash and in the paranoid case may include confidentiality and integrity impact due to reuse of a freed list node and possible allocator state corruption. Privilege escalation is plausible as a worst-case consequence of the memory corruption class but is not demonstrated by the available evidence.

Mitigation

Mitigation for this issue is either not available or the currently available options don't meet the Red Hat Product Security criteria comprising ease of use and deployment, applicability to widespread installation base or stability.

Common Vulnerability Scoring System (CVSS) Score Details

Info alert:Important note

CVSS scores for open source components depend on vendor-specific factors (e.g. version or build chain). Therefore, Red Hat's score and impact rating can be different from NVD and other vendors. Red Hat remains the authoritative CVE Naming Authority (CNA) source for its products and services (see Red Hat classifications).

The following CVSS metrics and score provided are preliminary and subject to review.

CVSS v3 Score Breakdown

Red HatNVDcve.org
Base Score4.7N/AN/A
Attack VectorLocalN/AN/A
Attack ComplexityHighN/AN/A
Privileges RequiredLowN/AN/A
User InteractionNoneN/AN/A
ScopeUnchangedN/AN/A
ConfidentialityNoneN/AN/A
Integrity ImpactNoneN/AN/A
Availability ImpactHighN/AN/A

Vector

Red Hat: CVSS:3.1/AV:L/AC:H/PR:L/UI:N/S:U/C:N/I:N/A:H

Understanding the Weakness (CWE)

Integrity

Technical Impact: Modify Memory

The use of previously freed memory may corrupt valid data, if the memory area in question has been allocated and used properly elsewhere.

Availability

Technical Impact: DoS: Crash, Exit, or Restart

If chunk consolidation occurs after the use of previously freed data, the process may crash when invalid data is used as chunk information.

Confidentiality

Technical Impact: Read Memory

Read operations on freed memory can sometimes leak sensitive information instead of causing a crash

Integrity,Confidentiality,Availability

Technical Impact: Execute Unauthorized Code or Commands

If malicious data is entered before chunk consolidation can take place, it may be possible to take advantage of a write-what-where primitive to execute arbitrary code. If the newly allocated data happens to hold a class, in C++ for example, various function pointers may be scattered within the heap data. If one of these function pointers is overwritten with an address to valid shellcode, execution of arbitrary code can be achieved.

Frequently Asked Questions

Want to get errata notifications? Sign up here.