bpf: Fix unsound scalar forking in maybe_fork_scalars() for BPF_OR
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 |
|
≥ 6.18.16 · < 6.18.21≥ 6.19.6 · < 6.19.11| No fix yet |
In the Linux kernel, the following vulnerability has been resolved:
bpf: Fix unsound scalar forking in maybe_fork_scalars() for BPF_OR
maybe_fork_scalars() is called for both BPF_AND and BPF_OR when the source operand is a constant. When dst has signed range [-1, 0], it forks the verifier state: the pushed path gets dst = 0, the current path gets dst = -1.
For BPF_AND this is correct: 0 & K == 0. For BPF_OR this is wrong: 0 | K == K, not 0.
The pushed path therefore tracks dst as 0 when the runtime value is K, producing an exploitable verifier/runtime divergence that allows out-of-bounds map access.
Fix this by passing env->insn_idx (instead of env->insn_idx + 1) to push_stack(), so the pushed path re-executes the ALU instruction with dst = 0 and naturally computes the correct result for any opcode.
From the CVE record · Linux
The Linux kernel BPF verifier can incorrectly track a value when a BPF_OR instruction has a constant source operand and the destination has a signed range of [-1, 0]. This verifier/runtime mismatch can allow out-of-bounds map access. The input does not specify whether exploitation requires local access, authentication, or user interaction.
Engineers running the Linux kernel should check their kernel against the vendor advisory; affected versions are not specified.