KernelScan.io

HIGH Introduced in 5.19

bpf LinkIterator UAF

CVE-2026-98378

CVSS 7.8 / 10.0 NVD

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

KernelScan AI7.0HIGH

01

In the Linux kernel, the following vulnerability has been resolved: bpf: Skip unsettled links in link iterator bpf_link_prime() inserts a link into link_idr before anon_inode_getfile() succeeds and before bpf_link_settle() publishes the ID in link->id. bpf_link_by_id() treats such an ID-zero link as unsettled, but the link iterator takes a reference without this check. If anon_inode_getfile() then fails, the creator removes the ID and frees its still-private link directly. The iterator is left with a dangling reference and its next bpf_link_put() accesses freed memory. Treat ID-zero entries as transient in bpf_link_get_curr_or_next(), just as bpf_link_by_id() does. BUG: KASAN: slab-use-after-free in bpf_link_put Write of size 8 by task exp/384 Call Trace: bpf_link_put kernel/bpf/syscall.c:3372 bpf_link_seq_next kernel/bpf/link_iter.c:33 bpf_seq_read kernel/bpf/bpf_iter.c:158 vfs_read fs/read_write.c:572 ksys_read fs/read_write.c:716 do_syscall_64 arch/x86/entry/syscall_64.c:84 entry_SYSCALL_64_after_hwframe arch/x86/entry/entry_64.S:121 Kernel panic - not syncing: KASAN: panic_on_warn set ...

02

Engine v0.7.0

Risk summary

A local attacker with BPF capabilities can exploit a race between BPF link creation and the link iterator to trigger a use-after-free, leading to kernel memory corruption or a kernel panic. The vulnerability requires winning a narrow race window but can be reached by any local user who can create BPF links and read from BPF iterators.

Affectedkernel/bpf/syscall.c (bpf)

Vulnerability analysis

During BPF link creation, a link is inserted into the global link ID table before its file descriptor is fully established and before its ID is published. The link iterator traverses this table and takes a reference on any link it finds, including links still in this transient, not-yet-published state. If the link creation subsequently fails, the creator removes the ID and frees the link directly, leaving the iterator with a dangling reference. The next time the iterator releases that reference, it accesses freed memory. The fix makes the iterator skip entries whose ID has not yet been published, treating them as transient — the same check already applied by the lookup-by-ID path. This vulnerability is reachable locally by any user who can create BPF links and open BPF iterators, which on most systems requires CAP_BPF (obtainable in a user namespace when unprivileged BPF is not disabled).

03

BranchIntroducedFixed inPatch commit
6.15.196.1.18968930f8d40ab
6.125.196.12.112798a61edbc43
6.185.196.18.556e271f093d15
6.65.196.6.158c251ed48bd90
7.25.197.2.987ce4b53b743
mainline5.197.350e80e2bb5e2
cip/6.15.196.1.189-cip6168930f8d40ab
cip/6.1-rt5.196.1.189-cip61-rt3268930f8d40ab
cip/6.125.196.12.112-cip33798a61edbc43

04

State of the newest release of each Civil Infrastructure Platform SLTS tree, from CIP's own fix records.

CIP treeState
cip/6.12Fixed in 6.12.112-cip33
cip/6.1Fixed in 6.1.189-cip61
cip/6.1-rtFixed in 6.1.189-cip61-rt32