clk: divider: Add round to closest divider
[linux-2.6/btrfs-unstable.git] / drivers / clk / clk-divider.c
blobc57294563a98212d09e556b5e939e32dc394a247
1 /*
2 * Copyright (C) 2011 Sascha Hauer, Pengutronix <s.hauer@pengutronix.de>
3 * Copyright (C) 2011 Richard Zhao, Linaro <richard.zhao@linaro.org>
4 * Copyright (C) 2011-2012 Mike Turquette, Linaro Ltd <mturquette@linaro.org>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
10 * Adjustable divider clock implementation
13 #include <linux/clk-provider.h>
14 #include <linux/module.h>
15 #include <linux/slab.h>
16 #include <linux/io.h>
17 #include <linux/err.h>
18 #include <linux/string.h>
19 #include <linux/log2.h>
22 * DOC: basic adjustable divider clock that cannot gate
24 * Traits of this clock:
25 * prepare - clk_prepare only ensures that parents are prepared
26 * enable - clk_enable only ensures that parents are enabled
27 * rate - rate is adjustable. clk->rate = DIV_ROUND_UP(parent->rate / divisor)
28 * parent - fixed parent. No clk_set_parent support
31 #define to_clk_divider(_hw) container_of(_hw, struct clk_divider, hw)
33 #define div_mask(d) ((1 << ((d)->width)) - 1)
35 static unsigned int _get_table_maxdiv(const struct clk_div_table *table)
37 unsigned int maxdiv = 0;
38 const struct clk_div_table *clkt;
40 for (clkt = table; clkt->div; clkt++)
41 if (clkt->div > maxdiv)
42 maxdiv = clkt->div;
43 return maxdiv;
46 static unsigned int _get_table_mindiv(const struct clk_div_table *table)
48 unsigned int mindiv = UINT_MAX;
49 const struct clk_div_table *clkt;
51 for (clkt = table; clkt->div; clkt++)
52 if (clkt->div < mindiv)
53 mindiv = clkt->div;
54 return mindiv;
57 static unsigned int _get_maxdiv(struct clk_divider *divider)
59 if (divider->flags & CLK_DIVIDER_ONE_BASED)
60 return div_mask(divider);
61 if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
62 return 1 << div_mask(divider);
63 if (divider->table)
64 return _get_table_maxdiv(divider->table);
65 return div_mask(divider) + 1;
68 static unsigned int _get_table_div(const struct clk_div_table *table,
69 unsigned int val)
71 const struct clk_div_table *clkt;
73 for (clkt = table; clkt->div; clkt++)
74 if (clkt->val == val)
75 return clkt->div;
76 return 0;
79 static unsigned int _get_div(struct clk_divider *divider, unsigned int val)
81 if (divider->flags & CLK_DIVIDER_ONE_BASED)
82 return val;
83 if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
84 return 1 << val;
85 if (divider->table)
86 return _get_table_div(divider->table, val);
87 return val + 1;
90 static unsigned int _get_table_val(const struct clk_div_table *table,
91 unsigned int div)
93 const struct clk_div_table *clkt;
95 for (clkt = table; clkt->div; clkt++)
96 if (clkt->div == div)
97 return clkt->val;
98 return 0;
101 static unsigned int _get_val(struct clk_divider *divider, unsigned int div)
103 if (divider->flags & CLK_DIVIDER_ONE_BASED)
104 return div;
105 if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
106 return __ffs(div);
107 if (divider->table)
108 return _get_table_val(divider->table, div);
109 return div - 1;
112 static unsigned long clk_divider_recalc_rate(struct clk_hw *hw,
113 unsigned long parent_rate)
115 struct clk_divider *divider = to_clk_divider(hw);
116 unsigned int div, val;
118 val = clk_readl(divider->reg) >> divider->shift;
119 val &= div_mask(divider);
121 div = _get_div(divider, val);
122 if (!div) {
123 WARN(!(divider->flags & CLK_DIVIDER_ALLOW_ZERO),
124 "%s: Zero divisor and CLK_DIVIDER_ALLOW_ZERO not set\n",
125 __clk_get_name(hw->clk));
126 return parent_rate;
129 return DIV_ROUND_UP(parent_rate, div);
133 * The reverse of DIV_ROUND_UP: The maximum number which
134 * divided by m is r
136 #define MULT_ROUND_UP(r, m) ((r) * (m) + (m) - 1)
138 static bool _is_valid_table_div(const struct clk_div_table *table,
139 unsigned int div)
141 const struct clk_div_table *clkt;
143 for (clkt = table; clkt->div; clkt++)
144 if (clkt->div == div)
145 return true;
146 return false;
149 static bool _is_valid_div(struct clk_divider *divider, unsigned int div)
151 if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
152 return is_power_of_2(div);
153 if (divider->table)
154 return _is_valid_table_div(divider->table, div);
155 return true;
158 static int _round_up_table(const struct clk_div_table *table, int div)
160 const struct clk_div_table *clkt;
161 int up = _get_table_maxdiv(table);
163 for (clkt = table; clkt->div; clkt++) {
164 if (clkt->div == div)
165 return clkt->div;
166 else if (clkt->div < div)
167 continue;
169 if ((clkt->div - div) < (up - div))
170 up = clkt->div;
173 return up;
176 static int _round_down_table(const struct clk_div_table *table, int div)
178 const struct clk_div_table *clkt;
179 int down = _get_table_mindiv(table);
181 for (clkt = table; clkt->div; clkt++) {
182 if (clkt->div == div)
183 return clkt->div;
184 else if (clkt->div > div)
185 continue;
187 if ((div - clkt->div) < (div - down))
188 down = clkt->div;
191 return down;
194 static int _div_round_up(struct clk_divider *divider,
195 unsigned long parent_rate, unsigned long rate)
197 int div = DIV_ROUND_UP(parent_rate, rate);
199 if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
200 div = __roundup_pow_of_two(div);
201 if (divider->table)
202 div = _round_up_table(divider->table, div);
204 return div;
207 static int _div_round_closest(struct clk_divider *divider,
208 unsigned long parent_rate, unsigned long rate)
210 int up, down, div;
212 up = down = div = DIV_ROUND_CLOSEST(parent_rate, rate);
214 if (divider->flags & CLK_DIVIDER_POWER_OF_TWO) {
215 up = __roundup_pow_of_two(div);
216 down = __rounddown_pow_of_two(div);
217 } else if (divider->table) {
218 up = _round_up_table(divider->table, div);
219 down = _round_down_table(divider->table, div);
222 return (up - div) <= (div - down) ? up : down;
225 static int _div_round(struct clk_divider *divider, unsigned long parent_rate,
226 unsigned long rate)
228 if (divider->flags & CLK_DIVIDER_ROUND_CLOSEST)
229 return _div_round_closest(divider, parent_rate, rate);
231 return _div_round_up(divider, parent_rate, rate);
234 static bool _is_best_div(struct clk_divider *divider,
235 int rate, int now, int best)
237 if (divider->flags & CLK_DIVIDER_ROUND_CLOSEST)
238 return abs(rate - now) < abs(rate - best);
240 return now <= rate && now > best;
243 static int clk_divider_bestdiv(struct clk_hw *hw, unsigned long rate,
244 unsigned long *best_parent_rate)
246 struct clk_divider *divider = to_clk_divider(hw);
247 int i, bestdiv = 0;
248 unsigned long parent_rate, best = 0, now, maxdiv;
249 unsigned long parent_rate_saved = *best_parent_rate;
251 if (!rate)
252 rate = 1;
254 maxdiv = _get_maxdiv(divider);
256 if (!(__clk_get_flags(hw->clk) & CLK_SET_RATE_PARENT)) {
257 parent_rate = *best_parent_rate;
258 bestdiv = _div_round(divider, parent_rate, rate);
259 bestdiv = bestdiv == 0 ? 1 : bestdiv;
260 bestdiv = bestdiv > maxdiv ? maxdiv : bestdiv;
261 return bestdiv;
265 * The maximum divider we can use without overflowing
266 * unsigned long in rate * i below
268 maxdiv = min(ULONG_MAX / rate, maxdiv);
270 for (i = 1; i <= maxdiv; i++) {
271 if (!_is_valid_div(divider, i))
272 continue;
273 if (rate * i == parent_rate_saved) {
275 * It's the most ideal case if the requested rate can be
276 * divided from parent clock without needing to change
277 * parent rate, so return the divider immediately.
279 *best_parent_rate = parent_rate_saved;
280 return i;
282 parent_rate = __clk_round_rate(__clk_get_parent(hw->clk),
283 MULT_ROUND_UP(rate, i));
284 now = DIV_ROUND_UP(parent_rate, i);
285 if (_is_best_div(divider, rate, now, best)) {
286 bestdiv = i;
287 best = now;
288 *best_parent_rate = parent_rate;
292 if (!bestdiv) {
293 bestdiv = _get_maxdiv(divider);
294 *best_parent_rate = __clk_round_rate(__clk_get_parent(hw->clk), 1);
297 return bestdiv;
300 static long clk_divider_round_rate(struct clk_hw *hw, unsigned long rate,
301 unsigned long *prate)
303 int div;
304 div = clk_divider_bestdiv(hw, rate, prate);
306 return DIV_ROUND_UP(*prate, div);
309 static int clk_divider_set_rate(struct clk_hw *hw, unsigned long rate,
310 unsigned long parent_rate)
312 struct clk_divider *divider = to_clk_divider(hw);
313 unsigned int div, value;
314 unsigned long flags = 0;
315 u32 val;
317 div = DIV_ROUND_UP(parent_rate, rate);
319 if (!_is_valid_div(divider, div))
320 return -EINVAL;
322 value = _get_val(divider, div);
324 if (value > div_mask(divider))
325 value = div_mask(divider);
327 if (divider->lock)
328 spin_lock_irqsave(divider->lock, flags);
330 if (divider->flags & CLK_DIVIDER_HIWORD_MASK) {
331 val = div_mask(divider) << (divider->shift + 16);
332 } else {
333 val = clk_readl(divider->reg);
334 val &= ~(div_mask(divider) << divider->shift);
336 val |= value << divider->shift;
337 clk_writel(val, divider->reg);
339 if (divider->lock)
340 spin_unlock_irqrestore(divider->lock, flags);
342 return 0;
345 const struct clk_ops clk_divider_ops = {
346 .recalc_rate = clk_divider_recalc_rate,
347 .round_rate = clk_divider_round_rate,
348 .set_rate = clk_divider_set_rate,
350 EXPORT_SYMBOL_GPL(clk_divider_ops);
352 static struct clk *_register_divider(struct device *dev, const char *name,
353 const char *parent_name, unsigned long flags,
354 void __iomem *reg, u8 shift, u8 width,
355 u8 clk_divider_flags, const struct clk_div_table *table,
356 spinlock_t *lock)
358 struct clk_divider *div;
359 struct clk *clk;
360 struct clk_init_data init;
362 if (clk_divider_flags & CLK_DIVIDER_HIWORD_MASK) {
363 if (width + shift > 16) {
364 pr_warn("divider value exceeds LOWORD field\n");
365 return ERR_PTR(-EINVAL);
369 /* allocate the divider */
370 div = kzalloc(sizeof(struct clk_divider), GFP_KERNEL);
371 if (!div) {
372 pr_err("%s: could not allocate divider clk\n", __func__);
373 return ERR_PTR(-ENOMEM);
376 init.name = name;
377 init.ops = &clk_divider_ops;
378 init.flags = flags | CLK_IS_BASIC;
379 init.parent_names = (parent_name ? &parent_name: NULL);
380 init.num_parents = (parent_name ? 1 : 0);
382 /* struct clk_divider assignments */
383 div->reg = reg;
384 div->shift = shift;
385 div->width = width;
386 div->flags = clk_divider_flags;
387 div->lock = lock;
388 div->hw.init = &init;
389 div->table = table;
391 /* register the clock */
392 clk = clk_register(dev, &div->hw);
394 if (IS_ERR(clk))
395 kfree(div);
397 return clk;
401 * clk_register_divider - register a divider clock with the clock framework
402 * @dev: device registering this clock
403 * @name: name of this clock
404 * @parent_name: name of clock's parent
405 * @flags: framework-specific flags
406 * @reg: register address to adjust divider
407 * @shift: number of bits to shift the bitfield
408 * @width: width of the bitfield
409 * @clk_divider_flags: divider-specific flags for this clock
410 * @lock: shared register lock for this clock
412 struct clk *clk_register_divider(struct device *dev, const char *name,
413 const char *parent_name, unsigned long flags,
414 void __iomem *reg, u8 shift, u8 width,
415 u8 clk_divider_flags, spinlock_t *lock)
417 return _register_divider(dev, name, parent_name, flags, reg, shift,
418 width, clk_divider_flags, NULL, lock);
420 EXPORT_SYMBOL_GPL(clk_register_divider);
423 * clk_register_divider_table - register a table based divider clock with
424 * the clock framework
425 * @dev: device registering this clock
426 * @name: name of this clock
427 * @parent_name: name of clock's parent
428 * @flags: framework-specific flags
429 * @reg: register address to adjust divider
430 * @shift: number of bits to shift the bitfield
431 * @width: width of the bitfield
432 * @clk_divider_flags: divider-specific flags for this clock
433 * @table: array of divider/value pairs ending with a div set to 0
434 * @lock: shared register lock for this clock
436 struct clk *clk_register_divider_table(struct device *dev, const char *name,
437 const char *parent_name, unsigned long flags,
438 void __iomem *reg, u8 shift, u8 width,
439 u8 clk_divider_flags, const struct clk_div_table *table,
440 spinlock_t *lock)
442 return _register_divider(dev, name, parent_name, flags, reg, shift,
443 width, clk_divider_flags, table, lock);
445 EXPORT_SYMBOL_GPL(clk_register_divider_table);