همهٔ گزارش‌ها
متوسط

kernel: bpf: Check ancestor frames for rbtree callbacks

متن اصلی

نسخه‌های متأثر

نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده
نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده
نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده
نسخه‌های متأثر
نامشخص
نسخهٔ اصلاح‌شده
اعلام نشده

بهره‌برداری

CVE-2026-98047

احتمال بهره‌برداری در ۳۰ روز آینده: 0.22%

FIRST EPSS · ۱۴۰۵/۰۸/۲۹

شرح آسیب‌پذیری

In the Linux kernel, the following vulnerability has been resolved: bpf: Check ancestor frames for rbtree callbacks bpf_rbtree_add() invokes its comparator while the caller holds the root lock. The native insertion code retains raw parent and link pointers across the callback, so the verifier prohibits unlocking, consuming tree nodes, or changing RCU state from that callback. in_rbtree_lock_required_cb() only checks the innermost verifier frame. Static subprogram calls are permitted while holding a spin lock, and such a call pushes a frame without in_callback_fn set. Consequently, all callback restrictions disappear in the nested frame. The subprogram can unlock the tree, remove and drop the node being compared, then relock. Native insertion resumes with the stale parent pointer and links freed memory into the tree. Walk all active frames for the rbtree callback instead. Benign static subprograms remain permitted, while callback restrictions follow execution into nested frames.

A flaw was found in the Linux kernel's BPF (Berkeley Packet Filter) verifier, which may allow a local attacker to cause a denial of service (DoS) or potentially escalate privileges. When verifying red-black tree (rbtree) callbacks, the verifier fails to enforce callback restrictions across nested subprogram call frames. A local user capable of loading BPF programs can exploit this issue to bypass safety checks and alter locked tree nodes, resulting in freed memory being linked back into the tree. This behavior causes kernel memory corruption and can lead to a system crash.