lkml.org 
[lkml]   [2019]   [Mar]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
Patch in this message
/
From
Subject[PATCH] clocksource: Make clocksource insert entry more efficient
Date
In clocksource_enqueue(), it is unnecessary to do
entry = &tmp->list
in every loop,do it once in the last loop is enough.

Signed-off-by: Yongkai Wu <nic_w@163.com>
---
kernel/time/clocksource.c | 7 ++++---
1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/kernel/time/clocksource.c b/kernel/time/clocksource.c
index 3bcc19c..da4829b 100644
--- a/kernel/time/clocksource.c
+++ b/kernel/time/clocksource.c
@@ -829,11 +829,12 @@ static void clocksource_enqueue(struct clocksource *cs)

list_for_each_entry(tmp, &clocksource_list, list) {
/* Keep track of the place, where to insert */
- if (tmp->rating < cs->rating)
+ if (tmp->rating < cs->rating) {
+ entry = &tmp->list;
break;
- entry = &tmp->list;
+ }
}
- list_add(&cs->list, entry);
+ list_add_tail(&cs->list, entry);
}

/**
--
1.8.3.1
\
 
 \ /
  Last update: 2019-03-26 12:35    [W:0.028 / U:0.272 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site