Hello:
This patch was applied to bpf/bpf-next.git (master)
by Alexei Starovoitov <ast@xxxxxxxxxx>:
On Sun, 2 Apr 2023 11:43:40 +0000 you wrote:
> If the value size in a bloom filter is a multiple of 4, then the jhash2()
> function is used to compute hashes. The length parameter of this function
> equals to the number of 32-bit words in input. Compute it in the hot path
> instead of pre-computing it, as this is translated to one extra shift to
> divide the length by four vs. one extra memory load of a pre-computed length.
>
> Signed-off-by: Anton Protopopov <aspsk@xxxxxxxxxxxxx>
>
> [...]
Here is the summary with links:
- [bpf-next] bpf: compute hashes in bloom filter similar to hashmap
https://git.kernel.org/bpf/bpf-next/c/92b2e810f0d3
You are awesome, thank you!
--
Deet-doot-dot, I am a bot.
https://korg.docs.kernel.org/patchwork/pwbot.html
