aboutsummaryrefslogtreecommitdiffstats
path: root/drivers/sh
diff options
context:
space:
mode:
authorGuennadi Liakhovetski <g.liakhovetski@gmx.de>2010-06-25 03:19:39 -0400
committerPaul Mundt <lethal@linux-sh.org>2010-07-02 05:07:51 -0400
commit088bcc2aff25f31f1497f8196fa02c8cd2a43f68 (patch)
tree8426693a95cdd91bec285ad86e95132e3e94bf35 /drivers/sh
parentc45f6f10263ab53574f54de0caf0299b7d7c06a8 (diff)
sh: remove bogus highest / lowest logic from clock rate rounding
The use of highest and lowest in clk_rate_table_round() is completely bogus and superfluous. Remove it. Signed-off-by: Guennadi Liakhovetski <g.liakhovetski@gmx.de> Signed-off-by: Paul Mundt <lethal@linux-sh.org>
Diffstat (limited to 'drivers/sh')
-rw-r--r--drivers/sh/clk.c13
1 files changed, 0 insertions, 13 deletions
diff --git a/drivers/sh/clk.c b/drivers/sh/clk.c
index 936c93aaef11..cede14e34507 100644
--- a/drivers/sh/clk.c
+++ b/drivers/sh/clk.c
@@ -73,22 +73,14 @@ long clk_rate_table_round(struct clk *clk,
73{ 73{
74 unsigned long rate_error, rate_error_prev = ~0UL; 74 unsigned long rate_error, rate_error_prev = ~0UL;
75 unsigned long rate_best_fit = rate; 75 unsigned long rate_best_fit = rate;
76 unsigned long highest, lowest;
77 int i; 76 int i;
78 77
79 highest = lowest = 0;
80
81 for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) { 78 for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
82 unsigned long freq = freq_table[i].frequency; 79 unsigned long freq = freq_table[i].frequency;
83 80
84 if (freq == CPUFREQ_ENTRY_INVALID) 81 if (freq == CPUFREQ_ENTRY_INVALID)
85 continue; 82 continue;
86 83
87 if (freq > highest)
88 highest = freq;
89 if (freq < lowest)
90 lowest = freq;
91
92 rate_error = abs(freq - rate); 84 rate_error = abs(freq - rate);
93 if (rate_error < rate_error_prev) { 85 if (rate_error < rate_error_prev) {
94 rate_best_fit = freq; 86 rate_best_fit = freq;
@@ -99,11 +91,6 @@ long clk_rate_table_round(struct clk *clk,
99 break; 91 break;
100 } 92 }
101 93
102 if (rate >= highest)
103 rate_best_fit = highest;
104 if (rate <= lowest)
105 rate_best_fit = lowest;
106
107 return rate_best_fit; 94 return rate_best_fit;
108} 95}
109 96