bpf: Reject resilient lock operations in rbtree callbacks
- Published
- Last modified
- Where the record stands: published, rejected by its publisher, or superseded by another id.What do these mean? →
- published
- Whether CISA lists it in its Known Exploited Vulnerabilities catalog: proof that attackers are using it.What do these mean? →
- Not listed in CISA KEV
- Fix
- Fixed in 6.18.53, 7.2.7
- Whether working attack code is public (Exploit-DB, Metasploit, Nuclei or GitHub). Public code makes attacks easier.What do these mean? →
- None on Exploit-DB, Metasploit or GitHub
Summary
In the Linux kernel, the following vulnerability has been resolved: bpf: Reject resilient lock operations in rbtree callbacks __bpf_rbtree_add() keeps parent and link pointers live across calls to the program-supplied comparison callback. The verifier therefore requires the root's lock to remain held throughout the callback. The helper path enforces this rule for bpf_spin_lock() and bpf_spin_unlock(), but the resilient lock kfunc argument path does not. Since resilient locks may protect BPF rbtree roots, a callback can release the root lock and let another CPU remove and free the node referenced by the in-progress tree walk. The walk then resumes using freed pointers. Reject resilient lock kfuncs in an rbtree comparison callback, matching the existing policy for the spin lock helpers. Resilient-lock-protected trees remain valid when their comparison callbacks leave lock state alone.
Timeline
- CVE published
- Record last updated
Affected versions
- Linux Linux
From 0de2046137f976e7302d43ac01d9894d07ac1fff · fixed in cc2e065ed206aecd9b94564779244f3ffb26e356; From 0de2046137f976e7302d43ac01d9894d07ac1fff · fixed in 71930202a0a0c49f0a3b45b41907a074cb780266; From 0de2046137f976e7302d43ac01d9894d07ac1fff · fixed in 7b7b8b5960102566bd625ae829d1f330c5b5d104
- Linux Linux
6.15
- KernelLinux
From 6.15.0 · fixed in 6.18.53; From 6.19.0 · fixed in 7.2.7