[PATCH] clocksource: Make clocksource insert entry more efficient
From: Yongkai Wu
Date: Tue Mar 26 2019 - 07:34:58 EST
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@xxxxxxx>
---
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