netdev - Re: [PATCH bpf-next V2] bpf/lpm_trie: inline longest_prefix

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Message-Id: 
 <171085262862.28386.4132852347769986084.git-patchwork-notify@kernel.org>
Date: Tue, 19 Mar 2024 12:50:28 +0000
From: patchwork-bot+netdevbpf@...nel.org
To: Jesper Dangaard Brouer <hawk@...nel.org>
Cc: bpf@...r.kernel.org, borkmann@...earbox.net, ast@...nel.org,
 martin.lau@...nel.org, netdev@...r.kernel.org, bp@...en8.de,
 kernel-team@...udflare.com
Subject: Re: [PATCH bpf-next V2] bpf/lpm_trie: inline longest_prefix_match for
 fastpath

Hello:

This patch was applied to bpf/bpf-next.git (master)
by Daniel Borkmann <daniel@...earbox.net>:

On Mon, 18 Mar 2024 14:25:26 +0100 you wrote:
> The BPF map type LPM (Longest Prefix Match) is used heavily
> in production by multiple products that have BPF components.
> Perf data shows trie_lookup_elem() and longest_prefix_match()
> being part of kernels perf top.
> 
> For every level in the LPM tree trie_lookup_elem() calls out
> to longest_prefix_match().  The compiler is free to inline this
> call, but chooses not to inline, because other slowpath callers
> (that can be invoked via syscall) exists like trie_update_elem(),
> trie_delete_elem() or trie_get_next_key().
> 
> [...]

Here is the summary with links:
  - [bpf-next,V2] bpf/lpm_trie: inline longest_prefix_match for fastpath
    https://git.kernel.org/bpf/bpf-next/c/1a4a0cb7985f

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