linux-kernel - Re: [rfc PATCH -next 0/5] rbtree: Cache leftmost node internally

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: <20170608134248.iebzeaxwdxcvwmdh@hirez.programming.kicks-ass.net>
Date:   Thu, 8 Jun 2017 15:42:48 +0200
From:   Peter Zijlstra <peterz@...radead.org>
To:     Davidlohr Bueso <dave@...olabs.net>
Cc:     mingo@...nel.org, akpm@...ux-foundation.org, jack@...e.cz,
        kirill.shutemov@...ux.intel.com, ldufour@...ux.vnet.ibm.com,
        mhocko@...e.com, mgorman@...hsingularity.net,
        linux-kernel@...r.kernel.org
Subject: Re: [rfc PATCH -next 0/5] rbtree: Cache leftmost node internally

On Mon, May 29, 2017 at 07:09:35PM -0700, Davidlohr Bueso wrote:
> Davidlohr Bueso (5):
>   rbtree: Cache leftmost node internally
>   sched/fair: Replace cfs_rq->rb_leftmost
>   locking/rtmutex: Replace top-waiter and pi_waiters leftmost caching
>   sched/deadline: Replace earliest deadline and runqueue leftmost caching
>   lib/interval_tree: Fast overlap detection

Seems mostly OK. Except that last patch is unfortunately large, but I
must admit to not seeing a sensible way to shrink that either :/