Re: [PATCH bpf-next 0/2] bpf: range_tree for bpf arena

[patchwork-bot+netdevbpf@kernel.org]

Hello:

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

On Thu,  7 Nov 2024 18:56:14 -0800 you wrote:
> From: Alexei Starovoitov <ast@kernel.org>
> 
> Introduce range_tree (internval tree plus rbtree) to track
> unallocated ranges in bpf arena and replace maple_tree with it.
> This is a step towards making bpf_arena|free_alloc_pages non-sleepable.
> The previous approach to reuse drm_mm to replace maple_tree reached
> dead end, since sizeof(struct drm_mm_node) = 168 and
> sizeof(struct maple_node) = 256 while
> sizeof(struct range_node) = 64 introduced in this patch.
> Not only it's smaller, but the algorithm splits and merges
> adjacent ranges. Ultimate performance doesn't matter.
> The main objective of range_tree is to work in context
> where kmalloc/kfree are not safe. It achieves that via bpf_mem_alloc.
> 
> [...]

Here is the summary with links:
  - [bpf-next,1/2] bpf: Introduce range_tree data structure and use it in bpf arena
    https://git.kernel.org/bpf/bpf-next/c/b795379757eb
  - [bpf-next,2/2] selftests/bpf: Add a test for arena range tree algorithm
    https://git.kernel.org/bpf/bpf-next/c/e58358afa84e

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