Re: [PATCH bpf-next v4 0/3] Simplify min()/max(), contains() and normalize() cnum implementation

Hello:

This series was applied to bpf/bpf-next.git (master)
by Eduard Zingerman <[email protected]>:

On Thu, 30 Jul 2026 10:21:11 +0000 you wrote:
> This patches simplifies some functions of the cnum implementation:
> 
> - smin()/smax()
> - contains()
> - normalize()
> 
> 
> [...]

Here is the summary with links:
  - [bpf-next,v4,1/3] bpf: Simplify cnum contains() by removing redundant branches
    https://git.kernel.org/bpf/bpf-next/c/4e3fb5bba680
  - [bpf-next,v4,2/3] bpf: Simplify cnum normalize() by dropping unnecessary comparisons
    https://git.kernel.org/bpf/bpf-next/c/b601a4ecbe67
  - [bpf-next,v4,3/3] bpf: Avoid redundant min()/max() in cnum signed bounds
    https://git.kernel.org/bpf/bpf-next/c/705249119d94

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