Re: [PATCH bpf 1/2] bpf: fix control-flow graph checking in privileged mode

[patchwork-bot+netdevbpf@kernel.org]

Hello:

This series was applied to bpf/bpf.git (master)
by Alexei Starovoitov <ast@kernel.org>:

On Thu, 9 Nov 2023 22:14:10 -0800 you wrote:
> When BPF program is verified in privileged mode, BPF verifier allows
> bounded loops. This means that from CFG point of view there are
> definitely some back-edges. Original commit adjusted check_cfg() logic
> to not detect back-edges in control flow graph if they are resulting
> from conditional jumps, which the idea that subsequent full BPF
> verification process will determine whether such loops are bounded or
> not, and either accept or reject the BPF program. At least that's my
> reading of the intent.
> 
> [...]

Here is the summary with links:
  - [bpf,1/2] bpf: fix control-flow graph checking in privileged mode
    https://git.kernel.org/bpf/bpf/c/10e14e9652bf
  - [bpf,2/2] selftests/bpf: add more test cases for check_cfg()
    https://git.kernel.org/bpf/bpf/c/e2e57d637aa5

You are awesome, thank you!
-- 
Deet-doot-dot, I am a bot.
https://korg.docs.kernel.org/patchwork/pwbot.html