linux-kernel - Re: [PATCH] rbtree: stop iteration early in rb_find

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: <YSY4byZYxId7k0ow@hirez.programming.kicks-ass.net>
Date:   Wed, 25 Aug 2021 14:32:47 +0200
From:   Peter Zijlstra <peterz@...radead.org>
To:     Michel Lespinasse <michel@...pinasse.org>
Cc:     Li RongQing <lirongqing@...du.com>, dbueso@...e.de,
        mingo@...nel.org, linux-kernel@...r.kernel.org
Subject: Re: [PATCH] rbtree: stop iteration early in rb_find_first

On Wed, Aug 25, 2021 at 02:29:19PM +0200, Peter Zijlstra wrote:
> More specifically, can you draw me a (binary) tree with elements: A B B
> B C, such that a search for B might have match set, hit c!=1 and not
> have found the leftmost B ?

We crossed emails, you just did :-)