2 * Copyright (C) 2015 Maxime Ripard <maxime.ripard@free-electrons.com>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
9 #include <linux/bitops.h>
10 #include <linux/clk-provider.h>
11 #include <linux/err.h>
12 #include <linux/export.h>
13 #include <linux/kernel.h>
15 #include <linux/slab.h>
17 static unsigned long __get_mult(struct clk_multiplier
*mult
,
19 unsigned long parent_rate
)
21 if (mult
->flags
& CLK_MULTIPLIER_ROUND_CLOSEST
)
22 return DIV_ROUND_CLOSEST(rate
, parent_rate
);
24 return rate
/ parent_rate
;
27 static unsigned long clk_multiplier_recalc_rate(struct clk_hw
*hw
,
28 unsigned long parent_rate
)
30 struct clk_multiplier
*mult
= to_clk_multiplier(hw
);
33 val
= clk_readl(mult
->reg
) >> mult
->shift
;
34 val
&= GENMASK(mult
->width
- 1, 0);
36 if (!val
&& mult
->flags
& CLK_MULTIPLIER_ZERO_BYPASS
)
39 return parent_rate
* val
;
42 static bool __is_best_rate(unsigned long rate
, unsigned long new,
43 unsigned long best
, unsigned long flags
)
45 if (flags
& CLK_MULTIPLIER_ROUND_CLOSEST
)
46 return abs(rate
- new) < abs(rate
- best
);
48 return new >= rate
&& new < best
;
51 static unsigned long __bestmult(struct clk_hw
*hw
, unsigned long rate
,
52 unsigned long *best_parent_rate
,
53 u8 width
, unsigned long flags
)
55 struct clk_multiplier
*mult
= to_clk_multiplier(hw
);
56 unsigned long orig_parent_rate
= *best_parent_rate
;
57 unsigned long parent_rate
, current_rate
, best_rate
= ~0;
58 unsigned int i
, bestmult
= 0;
59 unsigned int maxmult
= (1 << width
) - 1;
61 if (!(clk_hw_get_flags(hw
) & CLK_SET_RATE_PARENT
)) {
62 bestmult
= rate
/ orig_parent_rate
;
64 /* Make sure we don't end up with a 0 multiplier */
65 if ((bestmult
== 0) &&
66 !(mult
->flags
& CLK_MULTIPLIER_ZERO_BYPASS
))
69 /* Make sure we don't overflow the multiplier */
70 if (bestmult
> maxmult
)
76 for (i
= 1; i
< maxmult
; i
++) {
77 if (rate
== orig_parent_rate
* i
) {
79 * This is the best case for us if we have a
80 * perfect match without changing the parent
83 *best_parent_rate
= orig_parent_rate
;
87 parent_rate
= clk_hw_round_rate(clk_hw_get_parent(hw
),
89 current_rate
= parent_rate
* i
;
91 if (__is_best_rate(rate
, current_rate
, best_rate
, flags
)) {
93 best_rate
= current_rate
;
94 *best_parent_rate
= parent_rate
;
101 static long clk_multiplier_round_rate(struct clk_hw
*hw
, unsigned long rate
,
102 unsigned long *parent_rate
)
104 struct clk_multiplier
*mult
= to_clk_multiplier(hw
);
105 unsigned long factor
= __bestmult(hw
, rate
, parent_rate
,
106 mult
->width
, mult
->flags
);
108 return *parent_rate
* factor
;
111 static int clk_multiplier_set_rate(struct clk_hw
*hw
, unsigned long rate
,
112 unsigned long parent_rate
)
114 struct clk_multiplier
*mult
= to_clk_multiplier(hw
);
115 unsigned long factor
= __get_mult(mult
, rate
, parent_rate
);
116 unsigned long flags
= 0;
120 spin_lock_irqsave(mult
->lock
, flags
);
122 __acquire(mult
->lock
);
124 val
= clk_readl(mult
->reg
);
125 val
&= ~GENMASK(mult
->width
+ mult
->shift
- 1, mult
->shift
);
126 val
|= factor
<< mult
->shift
;
127 clk_writel(val
, mult
->reg
);
130 spin_unlock_irqrestore(mult
->lock
, flags
);
132 __release(mult
->lock
);
137 const struct clk_ops clk_multiplier_ops
= {
138 .recalc_rate
= clk_multiplier_recalc_rate
,
139 .round_rate
= clk_multiplier_round_rate
,
140 .set_rate
= clk_multiplier_set_rate
,
142 EXPORT_SYMBOL_GPL(clk_multiplier_ops
);