linux-kernel - Re: [PATCH] Make clocksource insert entry more efficiently

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: <CALAqxLXNRdjhib8v1XHE5yg6Af9kYNzp+P_BVqzWC2h5ENM15A@mail.gmail.com>
Date:	Mon, 2 May 2016 10:39:49 -0700
From:	John Stultz <john.stultz@...aro.org>
To:	Minfei Huang <mnghuan@...il.com>
Cc:	Thomas Gleixner <tglx@...utronix.de>,
	lkml <linux-kernel@...r.kernel.org>
Subject: Re: [PATCH] Make clocksource insert entry more efficiently

On Mon, Apr 25, 2016 at 2:20 AM, Minfei Huang <mnghuan@...il.com> wrote:
> It is unnecessary to continue looping the list, if we find there is an
> entry that the value of rating is smaller than the new one. It is safe
> to be out the loop, because all of entry are inserted in descending
> order.
>
> Signed-off-by: Minfei Huang <mnghuan@...il.com>
> ---

Thanks for sending this in. It looks reasonable to me, though not
likely to gain a ton, as these are usually short lists, and we only
really tinker with them at bootup. But yea. I'll put it on my toqueue
list for testing.

Its maybe a little close to make it for 4.7, but we'll see.

Thanks again!
-john