lkml.org 
[lkml]   [2016]   [May]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
SubjectRe: [PATCH] Make clocksource insert entry more efficiently
From
On Mon, Apr 25, 2016 at 2:20 AM, Minfei Huang <mnghuan@gmail.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@gmail.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

\
 
 \ /
  Last update: 2016-05-02 20:01    [W:0.036 / U:0.632 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site