CyberRota Analysis
AI-GeneratedThe vulnerability affects the Linux kernel's BPF (Berkeley Packet Filter) subsystem, specifically in the handling of red-black tree nodes during the freeing of BPF root objects. If an object is refcounted and survives the drop, it may retain stale pointers to a freed root, potentially leading to incorrect memory operations and exploitation opportunities. System administrators and developers working with Linux kernel modules that utilize BPF should prioritize addressing this issue to prevent potential security risks.
Original NVD Description
In the Linux kernel, the following vulnerability has been resolved: bpf: Clear rb node linkage when freeing bpf_rb_root bpf_rb_root_free() detaches the root by copying the current rb_root_cached and then replacing the live root with RB_ROOT_CACHED. It then walks the copied root and drops each object contained in the tree. This leaves the rb node state intact while dropping the object. If the object is refcounted and survives the drop, its bpf_rb_node_kern still contains an owner pointer to the freed root and stale rb tree linkage. If a later bpf_rb_root allocation reuses the same address, bpf_rbtree_remove() can incorrectly pass the owner check and call rb_erase_cached() on a node whose rb pointers belong to the old tree. Mirror the list draining behavior by marking nodes as busy while the root is being detached, then clear the rb node and release the owner before dropping the containing object. This makes surviving nodes unowned and safe to reject from remove or accept for a later add.