blob: 5e5e90a4a50c8bd80a9ca0ea1fc91ccee9a3428e [file] [log] [blame]
Maxime Ripard6174a1e2016-06-29 21:05:31 +02001/*
2 * Copyright (C) 2016 Maxime Ripard
3 * Maxime Ripard <maxime.ripard@free-electrons.com>
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation; either version 2 of
8 * the License, or (at your option) any later version.
9 */
10
11#include <linux/clk-provider.h>
Maxime Ripard6174a1e2016-06-29 21:05:31 +020012
13#include "ccu_frac.h"
14#include "ccu_gate.h"
15#include "ccu_nm.h"
16
Maxime Ripardee286482016-09-29 22:53:12 +020017struct _ccu_nm {
Maxime Ripard6e0d50d2016-09-29 22:57:26 +020018 unsigned long n, min_n, max_n;
19 unsigned long m, min_m, max_m;
Maxime Ripardee286482016-09-29 22:53:12 +020020};
21
22static void ccu_nm_find_best(unsigned long parent, unsigned long rate,
23 struct _ccu_nm *nm)
24{
25 unsigned long best_rate = 0;
26 unsigned long best_n = 0, best_m = 0;
27 unsigned long _n, _m;
28
Maxime Ripard6e0d50d2016-09-29 22:57:26 +020029 for (_n = nm->min_n; _n <= nm->max_n; _n++) {
30 for (_m = nm->min_m; _m <= nm->max_m; _m++) {
Maxime Ripardee286482016-09-29 22:53:12 +020031 unsigned long tmp_rate = parent * _n / _m;
32
33 if (tmp_rate > rate)
34 continue;
35
36 if ((rate - tmp_rate) < (rate - best_rate)) {
37 best_rate = tmp_rate;
38 best_n = _n;
39 best_m = _m;
40 }
41 }
42 }
43
44 nm->n = best_n;
45 nm->m = best_m;
46}
47
Maxime Ripard6174a1e2016-06-29 21:05:31 +020048static void ccu_nm_disable(struct clk_hw *hw)
49{
50 struct ccu_nm *nm = hw_to_ccu_nm(hw);
51
52 return ccu_gate_helper_disable(&nm->common, nm->enable);
53}
54
55static int ccu_nm_enable(struct clk_hw *hw)
56{
57 struct ccu_nm *nm = hw_to_ccu_nm(hw);
58
59 return ccu_gate_helper_enable(&nm->common, nm->enable);
60}
61
62static int ccu_nm_is_enabled(struct clk_hw *hw)
63{
64 struct ccu_nm *nm = hw_to_ccu_nm(hw);
65
66 return ccu_gate_helper_is_enabled(&nm->common, nm->enable);
67}
68
69static unsigned long ccu_nm_recalc_rate(struct clk_hw *hw,
70 unsigned long parent_rate)
71{
72 struct ccu_nm *nm = hw_to_ccu_nm(hw);
73 unsigned long n, m;
74 u32 reg;
75
76 if (ccu_frac_helper_is_enabled(&nm->common, &nm->frac))
77 return ccu_frac_helper_read_rate(&nm->common, &nm->frac);
78
79 reg = readl(nm->common.base + nm->common.reg);
80
81 n = reg >> nm->n.shift;
82 n &= (1 << nm->n.width) - 1;
Maxime Riparde66f81b2016-11-08 18:12:34 +010083 n += nm->n.offset;
84 if (!n)
85 n++;
Maxime Ripard6174a1e2016-06-29 21:05:31 +020086
87 m = reg >> nm->m.shift;
88 m &= (1 << nm->m.width) - 1;
Maxime Riparde66f81b2016-11-08 18:12:34 +010089 m += nm->m.offset;
90 if (!m)
91 m++;
Maxime Ripard6174a1e2016-06-29 21:05:31 +020092
Maxime Riparde66f81b2016-11-08 18:12:34 +010093 return parent_rate * n / m;
Maxime Ripard6174a1e2016-06-29 21:05:31 +020094}
95
96static long ccu_nm_round_rate(struct clk_hw *hw, unsigned long rate,
97 unsigned long *parent_rate)
98{
99 struct ccu_nm *nm = hw_to_ccu_nm(hw);
Maxime Ripardee286482016-09-29 22:53:12 +0200100 struct _ccu_nm _nm;
Maxime Ripard6174a1e2016-06-29 21:05:31 +0200101
Chen-Yu Tsai4162c5c2017-03-24 16:33:05 +0800102 _nm.min_n = nm->n.min ?: 1;
Maxime Ripard0c3c8e12016-10-14 12:08:19 +0200103 _nm.max_n = nm->n.max ?: 1 << nm->n.width;
Maxime Ripard6e0d50d2016-09-29 22:57:26 +0200104 _nm.min_m = 1;
Maxime Ripardee286482016-09-29 22:53:12 +0200105 _nm.max_m = nm->m.max ?: 1 << nm->m.width;
Maxime Ripard87ba9e52016-09-06 12:29:04 +0200106
Maxime Ripardee286482016-09-29 22:53:12 +0200107 ccu_nm_find_best(*parent_rate, rate, &_nm);
Maxime Ripard6174a1e2016-06-29 21:05:31 +0200108
Maxime Ripardee286482016-09-29 22:53:12 +0200109 return *parent_rate * _nm.n / _nm.m;
Maxime Ripard6174a1e2016-06-29 21:05:31 +0200110}
111
112static int ccu_nm_set_rate(struct clk_hw *hw, unsigned long rate,
113 unsigned long parent_rate)
114{
115 struct ccu_nm *nm = hw_to_ccu_nm(hw);
Maxime Ripardee286482016-09-29 22:53:12 +0200116 struct _ccu_nm _nm;
Maxime Ripard6174a1e2016-06-29 21:05:31 +0200117 unsigned long flags;
Maxime Ripard6174a1e2016-06-29 21:05:31 +0200118 u32 reg;
119
120 if (ccu_frac_helper_has_rate(&nm->common, &nm->frac, rate))
121 return ccu_frac_helper_set_rate(&nm->common, &nm->frac, rate);
122 else
123 ccu_frac_helper_disable(&nm->common, &nm->frac);
124
Chen-Yu Tsai95ad8ed2017-03-24 16:33:06 +0800125 _nm.min_n = nm->n.min ?: 1;
Maxime Ripard0c3c8e12016-10-14 12:08:19 +0200126 _nm.max_n = nm->n.max ?: 1 << nm->n.width;
Maxime Ripard6e0d50d2016-09-29 22:57:26 +0200127 _nm.min_m = 1;
Maxime Ripardee286482016-09-29 22:53:12 +0200128 _nm.max_m = nm->m.max ?: 1 << nm->m.width;
Maxime Ripard87ba9e52016-09-06 12:29:04 +0200129
Maxime Ripardee286482016-09-29 22:53:12 +0200130 ccu_nm_find_best(parent_rate, rate, &_nm);
Maxime Ripard6174a1e2016-06-29 21:05:31 +0200131
132 spin_lock_irqsave(nm->common.lock, flags);
133
134 reg = readl(nm->common.base + nm->common.reg);
135 reg &= ~GENMASK(nm->n.width + nm->n.shift - 1, nm->n.shift);
136 reg &= ~GENMASK(nm->m.width + nm->m.shift - 1, nm->m.shift);
137
Maxime Riparde66f81b2016-11-08 18:12:34 +0100138 reg |= (_nm.n - nm->n.offset) << nm->n.shift;
139 reg |= (_nm.m - nm->m.offset) << nm->m.shift;
140 writel(reg, nm->common.base + nm->common.reg);
Maxime Ripard6174a1e2016-06-29 21:05:31 +0200141
142 spin_unlock_irqrestore(nm->common.lock, flags);
143
144 ccu_helper_wait_for_lock(&nm->common, nm->lock);
145
146 return 0;
147}
148
149const struct clk_ops ccu_nm_ops = {
150 .disable = ccu_nm_disable,
151 .enable = ccu_nm_enable,
152 .is_enabled = ccu_nm_is_enabled,
153
154 .recalc_rate = ccu_nm_recalc_rate,
155 .round_rate = ccu_nm_round_rate,
156 .set_rate = ccu_nm_set_rate,
157};