netdev - Re: [RFC PATCH bpf-next 07/12] selftests/bpf: Add rbtree

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] [thread-next>] [day] [month] [year] [list]

Message-ID: <CAP01T75mhuTnFGhxZgrsqYmLM13DpzR5C5SM9Q-771-pyaYdjg@mail.gmail.com>
Date: Tue, 22 Apr 2025 05:03:21 +0200
From: Kumar Kartikeya Dwivedi <memxor@...il.com>
To: Martin KaFai Lau <martin.lau@...ux.dev>
Cc: bpf@...r.kernel.org, Alexei Starovoitov <ast@...nel.org>, 
	Andrii Nakryiko <andrii@...nel.org>, Daniel Borkmann <daniel@...earbox.net>, netdev@...r.kernel.org, 
	kernel-team@...a.com, Amery Hung <ameryhung@...il.com>
Subject: Re: [RFC PATCH bpf-next 07/12] selftests/bpf: Add rbtree_search test

On Sat, 19 Apr 2025 at 00:48, Martin KaFai Lau <martin.lau@...ux.dev> wrote:
>
> From: Martin KaFai Lau <martin.lau@...nel.org>
>
> This patch has a much simplified rbtree usage from the
> kernel sch_fq qdisc. It has a "struct node_data" which can be
> added to two different rbtrees which are ordered by different keys.
>
> The test first populates both rbtrees. Then search for a lookup_key
> from the "groot0" rbtree. Once the lookup_key is found, that node
> refcount is taken. The node is then removed from another "groot1"
> rbtree.
>
> While searching the lookup_key, the test will also try to remove
> all rbnodes in the path leading to the lookup_key.
>
> Signed-off-by: Martin KaFai Lau <martin.lau@...nel.org>
> ---

Acked-by: Kumar Kartikeya Dwivedi <memxor@...il.com>