mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git/
synced 2026-11-10 20:48:12 +00:00
Merge branch 'fix-acyclic-ownership-checks'
Kumar Kartikeya Dwivedi says: ==================== Fix acyclic ownership checks Bound and ensure acyclic ownership graphs for native data structures to fix a bug reported by Nicholas. See commit logs and tests for details. The existing list/rbtree rule already rejects graph-only cycles and bounds those chains conservatively. It misses ownership through local referenced kptrs, which can produce unbounded synchronous field destruction. Validate all local ownership edges together, with an explicit depth bound, and allow longer acyclic graph-only layouts within that bound. Changelog: ---------- v1 -> v2 v1: https://lore.kernel.org/bpf/20260905090750.4064411-1-memxor@gmail.com/ * Fold the graph-walk and local-kptr changes into one complete fix. (Alexei) * Explain why the original rule catches graph-only cycles, its three-type chain bound, and the missing local-kptr ownership edges. (Alexei) * Distinguish synchronous recursive field destruction from the deferred RCU freeing of object storage. * Add depth-boundary tests with child-first BTF ordering and a shared suffix reached with different remaining budgets. * Cover list and rbtree chains at the original three-type bound and at the new eight-type bound, including rejected over-limit cases. ==================== Link: https://patch.msgid.link/20260914132444.2564218-1-memxor@gmail.com Signed-off-by: Alexei Starovoitov <ast@kernel.org>
This commit is contained in:
commit
e3b6cb020e
3 changed files with 384 additions and 50 deletions
Loading…
Add table
Add a link
Reference in a new issue