Description
In the Linux kernel, the following vulnerability has been resolved:

bpf: Fix percpu map update indexing with sparse CPU IDs

Per-CPU array, hash, and cgroup storage map updates without BPF_F_CPU
or BPF_F_ALL_CPUS use a value buffer whose per-CPU slots are packed in
possible-CPU order. The buffer is sized as:

round_up(value_size, 8) * num_possible_cpus()

The update paths iterate over possible CPUs, but use the logical CPU ID
to calculate the source offset:

value + size * cpu

This only works when possible CPU IDs are contiguous starting at zero.

For example, with a possible CPU mask of 0,2-3, the buffer contains
three slots corresponding to CPUs 0, 2, and 3. CPU2 is therefore
expected to use slot 1 and CPU3 slot 2. Instead, the current code uses
slots 2 and 3 respectively, causing incorrect per-CPU values and an
out-of-bounds read from the update buffer for CPU3.

The corresponding lookup paths already use a dense offset while
iterating over possible CPUs. Do the same for the array, hash, and
cgroup storage update paths, advancing the source offset once for each
possible CPU. BPF_F_ALL_CPUS continues to use the same value for every
CPU.
Published: 2026-09-25
Score: n/a
EPSS: n/a
KEV: No
Impact: Memory corruption through out-of-bounds BPF map update
Action: Patch kernel
AI Analysis

Impact

A flaw in the Linux kernel’s BPF module miscalculates the offset for per‑CPU array, hash, and cgroup storage map updates when the system’s CPU mask is sparse. The code assumes logically contiguous CPU IDs starting at zero, but with non‑contiguous IDs the computed offset skips valid slots, causing out-of-bounds reads and corrupted per‑CPU values. An attacker with the ability to load malicious BPF programs could invoke this logic and read or corrupt sensitive kernel memory, potentially leading to privilege escalation.

Affected Systems

All Linux kernel releases that precede the fix (the commits referenced in the advisory). The issue affects every distribution that ships the unpatched kernel, regardless of vendor. All CPUs that are present but not contiguous in the possible CPU mask are susceptible.

Risk and Exploitability

Based on the description, it is inferred that the likely attack vector is a local user or an attacker who can load BPF programs. No CVSS score or EPSS value is provided, limiting precise quantification. The bug does not require kernel privileges to trigger; a local user or compromised BPF program can exploit it. Because it leads to out-of-bounds memory access, the potential impact is high if abused. The vulnerability is not listed in the CISA KEV catalog, so no widespread exploitation has been reported yet.

Generated by OpenCVE AI on September 25, 2026 at 13:13 UTC.

Remediation

No vendor fix or workaround currently provided.

OpenCVE Recommended Actions

  • Apply the kernel patch that incorporates the commits linked in the advisory, ensuring the kernel source includes the fix for percpu map indexing.
  • After patching, reboot or reload affected services to activate the updated kernel and eliminate the risk.
  • Until the patch is applied, update to the latest kernel release that contains the fix as soon as it becomes available, or temporarily restrict loading of non‑privileged BPF programs.

Generated by OpenCVE AI on September 25, 2026 at 13:13 UTC.

Tracking

Sign in to view the affected projects.

Advisories

No advisories yet.

History

Fri, 25 Sep 2026 10:45:00 +0000

Type Values Removed Values Added
Description In the Linux kernel, the following vulnerability has been resolved: bpf: Fix percpu map update indexing with sparse CPU IDs Per-CPU array, hash, and cgroup storage map updates without BPF_F_CPU or BPF_F_ALL_CPUS use a value buffer whose per-CPU slots are packed in possible-CPU order. The buffer is sized as: round_up(value_size, 8) * num_possible_cpus() The update paths iterate over possible CPUs, but use the logical CPU ID to calculate the source offset: value + size * cpu This only works when possible CPU IDs are contiguous starting at zero. For example, with a possible CPU mask of 0,2-3, the buffer contains three slots corresponding to CPUs 0, 2, and 3. CPU2 is therefore expected to use slot 1 and CPU3 slot 2. Instead, the current code uses slots 2 and 3 respectively, causing incorrect per-CPU values and an out-of-bounds read from the update buffer for CPU3. The corresponding lookup paths already use a dense offset while iterating over possible CPUs. Do the same for the array, hash, and cgroup storage update paths, advancing the source offset once for each possible CPU. BPF_F_ALL_CPUS continues to use the same value for every CPU.
Title bpf: Fix percpu map update indexing with sparse CPU IDs
First Time appeared Linux
Linux linux Kernel
CPEs cpe:2.3:o:linux:linux_kernel:*:*:*:*:*:*:*:*
Vendors & Products Linux
Linux linux Kernel
References

Subscriptions

Linux Linux Kernel
cve-icon MITRE

Status: PUBLISHED

Assigner: Linux

Published:

Updated: 2026-09-25T10:36:22.182Z

Reserved: 2026-09-25T10:25:14.320Z

Link: CVE-2026-98149

cve-icon Vulnrichment

No data.

cve-icon NVD

Status : Received

Published: 2026-09-25T11:17:46.473

Modified: 2026-09-25T11:17:46.473

Link: CVE-2026-98149

cve-icon Redhat

No data.

cve-icon OpenCVE Enrichment

Updated: 2026-09-25T13:15:07Z

Weaknesses

No weakness.