bpf: Fix percpu map update indexing with sparse CPU IDs
Linux
Affected versions
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
| No fix yet |
| Linux Linux |
|
|
Linux
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
| No fix yet |
| Linux Linux |
|
|
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.
From the CVE record · Linux
Linux kernel BPF per-CPU array, hash, and cgroup storage map updates can read beyond the update buffer when possible CPU IDs are sparse and the update uses neither BPF_F_CPU nor BPF_F_ALL_CPUS. An attacker able to trigger such an update could cause incorrect per-CPU values and an out-of-bounds read. The input does not specify whether this requires local or network access, authentication, or user interaction.
Operators running Linux kernels with sparse possible CPU IDs should check whether their kernel contains this issue; affected versions were not provided.