Hello:
This series was applied to bpf/bpf-next.git (master)
by Alexei Starovoitov <ast@xxxxxxxxxx>:
On Mon, 28 Jul 2025 11:50:01 +0200 you wrote:
> This patchset improves the 64bits bounds refinement when the s64 ranges
> crosses the sign boundary. The first patch explains the small addition
> to __reg64_deduce_bounds. The last one explains why we need a third
> round of __reg_deduce_bounds. The third patch adds a selftest with a
> more complete example of the impact on verification. The second and
> fourth patches update the existing selftests to take the new refinement
> into account.
>
> [...]
Here is the summary with links:
- [bpf-next,v4,1/5] bpf: Improve bounds when s64 crosses sign boundary
https://git.kernel.org/bpf/bpf-next/c/00bf8d0c6c9b
- [bpf-next,v4,2/5] selftests/bpf: Update reg_bound range refinement logic
https://git.kernel.org/bpf/bpf-next/c/da653de268d3
- [bpf-next,v4,3/5] selftests/bpf: Test cross-sign 64bits range refinement
https://git.kernel.org/bpf/bpf-next/c/26e5e346a52c
- [bpf-next,v4,4/5] selftests/bpf: Test invariants on JSLT crossing sign
https://git.kernel.org/bpf/bpf-next/c/f96841bbf4a1
- [bpf-next,v4,5/5] bpf: Add third round of bounds deduction
https://git.kernel.org/bpf/bpf-next/c/5dbb19b16ac4
You are awesome, thank you!
--
Deet-doot-dot, I am a bot.
https://korg.docs.kernel.org/patchwork/pwbot.html
