Re: [PATCH bpf-next v12 00/11] Improve the performance of BTF type lookups with binary search

[patchwork-bot+netdevbpf@kernel.org]

Hello:

This series was applied to bpf/bpf-next.git (master)
by Andrii Nakryiko <andrii@kernel.org>:

On Fri,  9 Jan 2026 20:59:52 +0800 you wrote:
> From: Donglin Peng <pengdonglin@xiaomi.com>
> 
> The series addresses the performance limitations of linear search in large
> BTFs by:
> 1. Adding BTF permutation support
> 2. Using resolve_btfids to sort BTF during the build phase
> 3. Checking BTF sorting
> 4. Using binary search when looking up types
> 
> [...]

Here is the summary with links:
  - [bpf-next,v12,01/11] libbpf: Add BTF permutation support for type reordering
    https://git.kernel.org/bpf/bpf-next/c/6fbf129c4990
  - [bpf-next,v12,02/11] selftests/bpf: Add test cases for btf__permute functionality
    https://git.kernel.org/bpf/bpf-next/c/a3acd7d43462
  - [bpf-next,v12,03/11] tools/resolve_btfids: Support BTF sorting feature
    https://git.kernel.org/bpf/bpf-next/c/230e7d7de5a8
  - [bpf-next,v12,04/11] libbpf: Optimize type lookup with binary search for sorted BTF
    (no matching commit)
  - [bpf-next,v12,05/11] libbpf: Verify BTF sorting
    https://git.kernel.org/bpf/bpf-next/c/33ecca574f1c
  - [bpf-next,v12,06/11] btf: Optimize type lookup with binary search
    (no matching commit)
  - [bpf-next,v12,07/11] btf: Verify BTF sorting
    (no matching commit)
  - [bpf-next,v12,08/11] bpf: Skip anonymous types in type lookup for performance
    https://git.kernel.org/bpf/bpf-next/c/dc893cfa390a
  - [bpf-next,v12,09/11] bpf: Optimize the performance of find_bpffs_btf_enums
    https://git.kernel.org/bpf/bpf-next/c/434bcbc837a6
  - [bpf-next,v12,10/11] libbpf: Optimize the performance of determine_ptr_size
    (no matching commit)
  - [bpf-next,v12,11/11] btf: Refactor the code by calling str_is_empty
    https://git.kernel.org/bpf/bpf-next/c/9282a42a1fe1

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