bpf: signal error if old liveness is more conservative than new
authorEduard Zingerman <eddyz87@gmail.com>
Fri, 19 Sep 2025 02:18:41 +0000 (19:18 -0700)
committerAlexei Starovoitov <ast@kernel.org>
Fri, 19 Sep 2025 16:27:23 +0000 (09:27 -0700)
commitccf25a67c7e29cfa6815d193054789b45ef825ad
tree9df851b84a8d166f3962fa619bc8d163a5f5a33b
parente41c237953b36cdd025b82996a74bfe39c509d20
bpf: signal error if old liveness is more conservative than new

Unlike the new algorithm, register chain based liveness tracking is
fully path sensitive, and thus should be strictly more accurate.
Validate the new algorithm by signaling an error whenever it considers
a stack slot dead while the old algorithm considers it alive.

Signed-off-by: Eduard Zingerman <eddyz87@gmail.com>
Link: https://lore.kernel.org/r/20250918-callchain-sensitive-liveness-v3-8-c3cd27bacc60@gmail.com
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
include/linux/bpf_verifier.h
kernel/bpf/verifier.c