blob: 661a801126ad934f78006f28ac1e8f59243a916c [file] [log] [blame]
Magnus Damm8b5ee112010-05-11 13:29:25 +00001/*
2 * drivers/sh/clk.c - SuperH clock framework
3 *
Paul Mundt960bc362010-08-20 19:10:38 +09004 * Copyright (C) 2005 - 2010 Paul Mundt
Magnus Damm8b5ee112010-05-11 13:29:25 +00005 *
6 * This clock framework is derived from the OMAP version by:
7 *
8 * Copyright (C) 2004 - 2008 Nokia Corporation
9 * Written by Tuukka Tikkanen <tuukka.tikkanen@elektrobit.com>
10 *
11 * Modified for omap shared clock framework by Tony Lindgren <tony@atomide.com>
12 *
13 * This file is subject to the terms and conditions of the GNU General Public
14 * License. See the file "COPYING" in the main directory of this archive
15 * for more details.
16 */
Paul Mundt550a1ef2010-10-13 19:24:55 +090017#define pr_fmt(fmt) "clock: " fmt
18
Magnus Damm8b5ee112010-05-11 13:29:25 +000019#include <linux/kernel.h>
20#include <linux/init.h>
21#include <linux/module.h>
22#include <linux/mutex.h>
23#include <linux/list.h>
24#include <linux/kobject.h>
25#include <linux/sysdev.h>
26#include <linux/seq_file.h>
27#include <linux/err.h>
28#include <linux/platform_device.h>
29#include <linux/debugfs.h>
30#include <linux/cpufreq.h>
31#include <linux/clk.h>
32#include <linux/sh_clk.h>
33
34static LIST_HEAD(clock_list);
35static DEFINE_SPINLOCK(clock_lock);
36static DEFINE_MUTEX(clock_list_sem);
37
38void clk_rate_table_build(struct clk *clk,
39 struct cpufreq_frequency_table *freq_table,
40 int nr_freqs,
41 struct clk_div_mult_table *src_table,
42 unsigned long *bitmap)
43{
44 unsigned long mult, div;
45 unsigned long freq;
46 int i;
47
48 for (i = 0; i < nr_freqs; i++) {
49 div = 1;
50 mult = 1;
51
52 if (src_table->divisors && i < src_table->nr_divisors)
53 div = src_table->divisors[i];
54
55 if (src_table->multipliers && i < src_table->nr_multipliers)
56 mult = src_table->multipliers[i];
57
58 if (!div || !mult || (bitmap && !test_bit(i, bitmap)))
59 freq = CPUFREQ_ENTRY_INVALID;
60 else
61 freq = clk->parent->rate * mult / div;
62
63 freq_table[i].index = i;
64 freq_table[i].frequency = freq;
65 }
66
67 /* Termination entry */
68 freq_table[i].index = i;
69 freq_table[i].frequency = CPUFREQ_TABLE_END;
70}
71
72long clk_rate_table_round(struct clk *clk,
73 struct cpufreq_frequency_table *freq_table,
74 unsigned long rate)
75{
76 unsigned long rate_error, rate_error_prev = ~0UL;
77 unsigned long rate_best_fit = rate;
Paul Mundt960bc362010-08-20 19:10:38 +090078 unsigned long highest, lowest;
Magnus Damm8b5ee112010-05-11 13:29:25 +000079 int i;
80
Paul Mundt960bc362010-08-20 19:10:38 +090081 highest = 0;
82 lowest = ~0UL;
83
Magnus Damm8b5ee112010-05-11 13:29:25 +000084 for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
85 unsigned long freq = freq_table[i].frequency;
86
87 if (freq == CPUFREQ_ENTRY_INVALID)
88 continue;
89
Paul Mundt960bc362010-08-20 19:10:38 +090090 if (freq > highest)
91 highest = freq;
92 if (freq < lowest)
93 lowest = freq;
94
Magnus Damm8b5ee112010-05-11 13:29:25 +000095 rate_error = abs(freq - rate);
96 if (rate_error < rate_error_prev) {
97 rate_best_fit = freq;
98 rate_error_prev = rate_error;
99 }
100
101 if (rate_error == 0)
102 break;
103 }
104
Paul Mundt960bc362010-08-20 19:10:38 +0900105 if (rate >= highest)
106 rate_best_fit = highest;
107 if (rate <= lowest)
108 rate_best_fit = lowest;
109
Magnus Damm8b5ee112010-05-11 13:29:25 +0000110 return rate_best_fit;
111}
112
113int clk_rate_table_find(struct clk *clk,
114 struct cpufreq_frequency_table *freq_table,
115 unsigned long rate)
116{
117 int i;
118
119 for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
120 unsigned long freq = freq_table[i].frequency;
121
122 if (freq == CPUFREQ_ENTRY_INVALID)
123 continue;
124
125 if (freq == rate)
126 return i;
127 }
128
129 return -ENOENT;
130}
131
132/* Used for clocks that always have same value as the parent clock */
133unsigned long followparent_recalc(struct clk *clk)
134{
135 return clk->parent ? clk->parent->rate : 0;
136}
137
138int clk_reparent(struct clk *child, struct clk *parent)
139{
140 list_del_init(&child->sibling);
141 if (parent)
142 list_add(&child->sibling, &parent->children);
143 child->parent = parent;
144
145 /* now do the debugfs renaming to reattach the child
146 to the proper parent */
147
148 return 0;
149}
150
151/* Propagate rate to children */
152void propagate_rate(struct clk *tclk)
153{
154 struct clk *clkp;
155
156 list_for_each_entry(clkp, &tclk->children, sibling) {
157 if (clkp->ops && clkp->ops->recalc)
158 clkp->rate = clkp->ops->recalc(clkp);
159
160 propagate_rate(clkp);
161 }
162}
163
164static void __clk_disable(struct clk *clk)
165{
Magnus Damm69395392010-10-13 07:44:36 +0000166 if (WARN(!clk->usecount, "Trying to disable clock %p with 0 usecount\n",
167 clk))
Magnus Damm8b5ee112010-05-11 13:29:25 +0000168 return;
Magnus Damm8b5ee112010-05-11 13:29:25 +0000169
170 if (!(--clk->usecount)) {
171 if (likely(clk->ops && clk->ops->disable))
172 clk->ops->disable(clk);
173 if (likely(clk->parent))
174 __clk_disable(clk->parent);
175 }
176}
177
178void clk_disable(struct clk *clk)
179{
180 unsigned long flags;
181
182 if (!clk)
183 return;
184
185 spin_lock_irqsave(&clock_lock, flags);
186 __clk_disable(clk);
187 spin_unlock_irqrestore(&clock_lock, flags);
188}
189EXPORT_SYMBOL_GPL(clk_disable);
190
191static int __clk_enable(struct clk *clk)
192{
193 int ret = 0;
194
195 if (clk->usecount++ == 0) {
196 if (clk->parent) {
197 ret = __clk_enable(clk->parent);
198 if (unlikely(ret))
199 goto err;
200 }
201
202 if (clk->ops && clk->ops->enable) {
203 ret = clk->ops->enable(clk);
204 if (ret) {
205 if (clk->parent)
206 __clk_disable(clk->parent);
207 goto err;
208 }
209 }
210 }
211
212 return ret;
213err:
214 clk->usecount--;
215 return ret;
216}
217
218int clk_enable(struct clk *clk)
219{
220 unsigned long flags;
221 int ret;
222
223 if (!clk)
224 return -EINVAL;
225
226 spin_lock_irqsave(&clock_lock, flags);
227 ret = __clk_enable(clk);
228 spin_unlock_irqrestore(&clock_lock, flags);
229
230 return ret;
231}
232EXPORT_SYMBOL_GPL(clk_enable);
233
234static LIST_HEAD(root_clks);
235
236/**
237 * recalculate_root_clocks - recalculate and propagate all root clocks
238 *
239 * Recalculates all root clocks (clocks with no parent), which if the
240 * clock's .recalc is set correctly, should also propagate their rates.
241 * Called at init.
242 */
243void recalculate_root_clocks(void)
244{
245 struct clk *clkp;
246
247 list_for_each_entry(clkp, &root_clks, sibling) {
248 if (clkp->ops && clkp->ops->recalc)
249 clkp->rate = clkp->ops->recalc(clkp);
250 propagate_rate(clkp);
251 }
252}
253
254int clk_register(struct clk *clk)
255{
256 if (clk == NULL || IS_ERR(clk))
257 return -EINVAL;
258
259 /*
260 * trap out already registered clocks
261 */
262 if (clk->node.next || clk->node.prev)
263 return 0;
264
265 mutex_lock(&clock_list_sem);
266
267 INIT_LIST_HEAD(&clk->children);
268 clk->usecount = 0;
269
270 if (clk->parent)
271 list_add(&clk->sibling, &clk->parent->children);
272 else
273 list_add(&clk->sibling, &root_clks);
274
275 list_add(&clk->node, &clock_list);
276 if (clk->ops && clk->ops->init)
277 clk->ops->init(clk);
278 mutex_unlock(&clock_list_sem);
279
280 return 0;
281}
282EXPORT_SYMBOL_GPL(clk_register);
283
284void clk_unregister(struct clk *clk)
285{
286 mutex_lock(&clock_list_sem);
287 list_del(&clk->sibling);
288 list_del(&clk->node);
289 mutex_unlock(&clock_list_sem);
290}
291EXPORT_SYMBOL_GPL(clk_unregister);
292
293void clk_enable_init_clocks(void)
294{
295 struct clk *clkp;
296
297 list_for_each_entry(clkp, &clock_list, node)
298 if (clkp->flags & CLK_ENABLE_ON_INIT)
299 clk_enable(clkp);
300}
301
302unsigned long clk_get_rate(struct clk *clk)
303{
304 return clk->rate;
305}
306EXPORT_SYMBOL_GPL(clk_get_rate);
307
308int clk_set_rate(struct clk *clk, unsigned long rate)
309{
310 return clk_set_rate_ex(clk, rate, 0);
311}
312EXPORT_SYMBOL_GPL(clk_set_rate);
313
314int clk_set_rate_ex(struct clk *clk, unsigned long rate, int algo_id)
315{
316 int ret = -EOPNOTSUPP;
317 unsigned long flags;
318
319 spin_lock_irqsave(&clock_lock, flags);
320
321 if (likely(clk->ops && clk->ops->set_rate)) {
322 ret = clk->ops->set_rate(clk, rate, algo_id);
323 if (ret != 0)
324 goto out_unlock;
325 } else {
326 clk->rate = rate;
327 ret = 0;
328 }
329
330 if (clk->ops && clk->ops->recalc)
331 clk->rate = clk->ops->recalc(clk);
332
333 propagate_rate(clk);
334
335out_unlock:
336 spin_unlock_irqrestore(&clock_lock, flags);
337
338 return ret;
339}
340EXPORT_SYMBOL_GPL(clk_set_rate_ex);
341
342int clk_set_parent(struct clk *clk, struct clk *parent)
343{
344 unsigned long flags;
345 int ret = -EINVAL;
346
347 if (!parent || !clk)
348 return ret;
349 if (clk->parent == parent)
350 return 0;
351
352 spin_lock_irqsave(&clock_lock, flags);
353 if (clk->usecount == 0) {
354 if (clk->ops->set_parent)
355 ret = clk->ops->set_parent(clk, parent);
356 else
357 ret = clk_reparent(clk, parent);
358
359 if (ret == 0) {
Magnus Damm8b5ee112010-05-11 13:29:25 +0000360 if (clk->ops->recalc)
361 clk->rate = clk->ops->recalc(clk);
Paul Mundt550a1ef2010-10-13 19:24:55 +0900362 pr_debug("set parent of %p to %p (new rate %ld)\n",
Magnus Damm69395392010-10-13 07:44:36 +0000363 clk, clk->parent, clk->rate);
Magnus Damm8b5ee112010-05-11 13:29:25 +0000364 propagate_rate(clk);
365 }
366 } else
367 ret = -EBUSY;
368 spin_unlock_irqrestore(&clock_lock, flags);
369
370 return ret;
371}
372EXPORT_SYMBOL_GPL(clk_set_parent);
373
374struct clk *clk_get_parent(struct clk *clk)
375{
376 return clk->parent;
377}
378EXPORT_SYMBOL_GPL(clk_get_parent);
379
380long clk_round_rate(struct clk *clk, unsigned long rate)
381{
382 if (likely(clk->ops && clk->ops->round_rate)) {
383 unsigned long flags, rounded;
384
385 spin_lock_irqsave(&clock_lock, flags);
386 rounded = clk->ops->round_rate(clk, rate);
387 spin_unlock_irqrestore(&clock_lock, flags);
388
389 return rounded;
390 }
391
392 return clk_get_rate(clk);
393}
394EXPORT_SYMBOL_GPL(clk_round_rate);
395
396#ifdef CONFIG_PM
397static int clks_sysdev_suspend(struct sys_device *dev, pm_message_t state)
398{
399 static pm_message_t prev_state;
400 struct clk *clkp;
401
402 switch (state.event) {
403 case PM_EVENT_ON:
404 /* Resumeing from hibernation */
405 if (prev_state.event != PM_EVENT_FREEZE)
406 break;
407
408 list_for_each_entry(clkp, &clock_list, node) {
409 if (likely(clkp->ops)) {
410 unsigned long rate = clkp->rate;
411
412 if (likely(clkp->ops->set_parent))
413 clkp->ops->set_parent(clkp,
414 clkp->parent);
415 if (likely(clkp->ops->set_rate))
416 clkp->ops->set_rate(clkp,
417 rate, NO_CHANGE);
418 else if (likely(clkp->ops->recalc))
419 clkp->rate = clkp->ops->recalc(clkp);
420 }
421 }
422 break;
423 case PM_EVENT_FREEZE:
424 break;
425 case PM_EVENT_SUSPEND:
426 break;
427 }
428
429 prev_state = state;
430 return 0;
431}
432
433static int clks_sysdev_resume(struct sys_device *dev)
434{
435 return clks_sysdev_suspend(dev, PMSG_ON);
436}
437
438static struct sysdev_class clks_sysdev_class = {
439 .name = "clks",
440};
441
442static struct sysdev_driver clks_sysdev_driver = {
443 .suspend = clks_sysdev_suspend,
444 .resume = clks_sysdev_resume,
445};
446
447static struct sys_device clks_sysdev_dev = {
448 .cls = &clks_sysdev_class,
449};
450
451static int __init clk_sysdev_init(void)
452{
453 sysdev_class_register(&clks_sysdev_class);
454 sysdev_driver_register(&clks_sysdev_class, &clks_sysdev_driver);
455 sysdev_register(&clks_sysdev_dev);
456
457 return 0;
458}
459subsys_initcall(clk_sysdev_init);
460#endif
461
462/*
463 * debugfs support to trace clock tree hierarchy and attributes
464 */
465static struct dentry *clk_debugfs_root;
466
467static int clk_debugfs_register_one(struct clk *c)
468{
469 int err;
470 struct dentry *d, *child, *child_tmp;
471 struct clk *pa = c->parent;
472 char s[255];
473 char *p = s;
474
Magnus Damm69395392010-10-13 07:44:36 +0000475 p += sprintf(p, "%p", c);
Magnus Damm8b5ee112010-05-11 13:29:25 +0000476 d = debugfs_create_dir(s, pa ? pa->dentry : clk_debugfs_root);
477 if (!d)
478 return -ENOMEM;
479 c->dentry = d;
480
481 d = debugfs_create_u8("usecount", S_IRUGO, c->dentry, (u8 *)&c->usecount);
482 if (!d) {
483 err = -ENOMEM;
484 goto err_out;
485 }
486 d = debugfs_create_u32("rate", S_IRUGO, c->dentry, (u32 *)&c->rate);
487 if (!d) {
488 err = -ENOMEM;
489 goto err_out;
490 }
491 d = debugfs_create_x32("flags", S_IRUGO, c->dentry, (u32 *)&c->flags);
492 if (!d) {
493 err = -ENOMEM;
494 goto err_out;
495 }
496 return 0;
497
498err_out:
499 d = c->dentry;
500 list_for_each_entry_safe(child, child_tmp, &d->d_subdirs, d_u.d_child)
501 debugfs_remove(child);
502 debugfs_remove(c->dentry);
503 return err;
504}
505
506static int clk_debugfs_register(struct clk *c)
507{
508 int err;
509 struct clk *pa = c->parent;
510
511 if (pa && !pa->dentry) {
512 err = clk_debugfs_register(pa);
513 if (err)
514 return err;
515 }
516
Magnus Damm69395392010-10-13 07:44:36 +0000517 if (!c->dentry) {
Magnus Damm8b5ee112010-05-11 13:29:25 +0000518 err = clk_debugfs_register_one(c);
519 if (err)
520 return err;
521 }
522 return 0;
523}
524
525static int __init clk_debugfs_init(void)
526{
527 struct clk *c;
528 struct dentry *d;
529 int err;
530
531 d = debugfs_create_dir("clock", NULL);
532 if (!d)
533 return -ENOMEM;
534 clk_debugfs_root = d;
535
536 list_for_each_entry(c, &clock_list, node) {
537 err = clk_debugfs_register(c);
538 if (err)
539 goto err_out;
540 }
541 return 0;
542err_out:
543 debugfs_remove_recursive(clk_debugfs_root);
544 return err;
545}
546late_initcall(clk_debugfs_init);