Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > linux.kernel > #1392415
| From | John Stultz <john.stultz@linaro.org> |
|---|---|
| Newsgroups | linux.kernel |
| Subject | Re: [PATCH] Make clocksource insert entry more efficiently |
| Date | 2016-05-02 19:50 +0200 |
| Message-ID | <ruq8Q-7OL-25@gated-at.bofh.it> (permalink) |
| References | <rrL06-3oi-25@gated-at.bofh.it> |
| Organization | linux.* mail to news gateway |
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
Back to linux.kernel | Previous | Next — Next in thread | Find similar | Unroll thread
Re: [PATCH] Make clocksource insert entry more efficiently John Stultz <john.stultz@linaro.org> - 2016-05-02 19:50 +0200 Re: [PATCH] Make clocksource insert entry more efficiently Minfei Huang <mnghuan@gmail.com> - 2016-05-03 05:40 +0200
csiph-web