Re: [PATCH] Make clocksource insert entry more efficiently

2016-05-02 Thread Minfei Huang
On 05/02/16 at 10:39P, John Stultz wrote: > On Mon, Apr 25, 2016 at 2:20 AM, Minfei Huang 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 in

Re: [PATCH] Make clocksource insert entry more efficiently

2016-05-02 Thread John Stultz
On Mon, Apr 25, 2016 at 2:20 AM, Minfei Huang 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: M

Re: [PATCH] Make clocksource insert entry more efficiently

2016-04-30 Thread Minfei Huang
Ping. Any comment is appreciate. Thanks Minfei On 04/25/16 at 05:20P, Minfei Huang 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 d

[PATCH] Make clocksource insert entry more efficiently

2016-04-25 Thread Minfei Huang
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 --- kernel/time/clocksource.c | 8 +--- 1 file