bpf: derive subreg bounds from full bounds when upper 32 bits are constant
authorAndrii Nakryiko <andrii@kernel.org>
Thu, 2 Nov 2023 03:37:47 +0000 (20:37 -0700)
committerAlexei Starovoitov <ast@kernel.org>
Fri, 10 Nov 2023 02:58:39 +0000 (18:58 -0800)
commitc1efab6468fd5ef541d47d81dbb62cca27f8db3b
tree2c94b1de813a6efbcfc76a724d2ee9c4f313b1b1
parentd540517990a9d105bf0312760665964916ac044f
bpf: derive subreg bounds from full bounds when upper 32 bits are constant

Comments in code try to explain the idea behind why this is correct.
Please check the code and comments.

Acked-by: Eduard Zingerman <eddyz87@gmail.com>
Acked-by: Shung-Hsi Yu <shung-hsi.yu@suse.com>
Signed-off-by: Andrii Nakryiko <andrii@kernel.org>
Link: https://lore.kernel.org/r/20231102033759.2541186-6-andrii@kernel.org
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
kernel/bpf/verifier.c