2 * drivers/sh/clk.c - SuperH clock framework
4 * Copyright (C) 2005 - 2010 Paul Mundt
6 * This clock framework is derived from the OMAP version by:
8 * Copyright (C) 2004 - 2008 Nokia Corporation
9 * Written by Tuukka Tikkanen <tuukka.tikkanen@elektrobit.com>
11 * Modified for omap shared clock framework by Tony Lindgren <tony@atomide.com>
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
17 #define pr_fmt(fmt) "clock: " fmt
19 #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>
29 #include <linux/debugfs.h>
30 #include <linux/cpufreq.h>
31 #include <linux/clk.h>
32 #include <linux/sh_clk.h>
34 static LIST_HEAD(clock_list);
35 static DEFINE_SPINLOCK(clock_lock);
36 static DEFINE_MUTEX(clock_list_sem);
38 void clk_rate_table_build(struct clk *clk,
39 struct cpufreq_frequency_table *freq_table,
41 struct clk_div_mult_table *src_table,
42 unsigned long *bitmap)
44 unsigned long mult, div;
48 clk->nr_freqs = nr_freqs;
50 for (i = 0; i < nr_freqs; i++) {
54 if (src_table->divisors && i < src_table->nr_divisors)
55 div = src_table->divisors[i];
57 if (src_table->multipliers && i < src_table->nr_multipliers)
58 mult = src_table->multipliers[i];
60 if (!div || !mult || (bitmap && !test_bit(i, bitmap)))
61 freq = CPUFREQ_ENTRY_INVALID;
63 freq = clk->parent->rate * mult / div;
65 freq_table[i].index = i;
66 freq_table[i].frequency = freq;
69 /* Termination entry */
70 freq_table[i].index = i;
71 freq_table[i].frequency = CPUFREQ_TABLE_END;
74 struct clk_rate_round_data;
76 struct clk_rate_round_data {
78 unsigned int min, max;
79 long (*func)(unsigned int pos, struct clk_rate_round_data *arg);
83 #define for_each_frequency(pos, r, freq) \
84 for (pos = r->min, freq = r->func(pos, r->arg); \
85 pos < r->max; pos++, freq = r->func(pos, r)) \
86 if (unlikely(freq == 0)) \
90 static long clk_rate_round_helper(struct clk_rate_round_data *rounder)
92 unsigned long rate_error, rate_error_prev = ~0UL;
93 unsigned long rate_best_fit = rounder->rate;
94 unsigned long highest, lowest, freq;
100 for_each_frequency(i, rounder, freq) {
106 rate_error = abs(freq - rounder->rate);
107 if (rate_error < rate_error_prev) {
108 rate_best_fit = freq;
109 rate_error_prev = rate_error;
116 if (rounder->rate >= highest)
117 rate_best_fit = highest;
118 if (rounder->rate <= lowest)
119 rate_best_fit = lowest;
121 return rate_best_fit;
124 static long clk_rate_table_iter(unsigned int pos,
125 struct clk_rate_round_data *rounder)
127 struct cpufreq_frequency_table *freq_table = rounder->arg;
128 unsigned long freq = freq_table[pos].frequency;
130 if (freq == CPUFREQ_ENTRY_INVALID)
136 long clk_rate_table_round(struct clk *clk,
137 struct cpufreq_frequency_table *freq_table,
140 struct clk_rate_round_data table_round = {
142 .max = clk->nr_freqs,
143 .func = clk_rate_table_iter,
148 return clk_rate_round_helper(&table_round);
151 int clk_rate_table_find(struct clk *clk,
152 struct cpufreq_frequency_table *freq_table,
157 for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
158 unsigned long freq = freq_table[i].frequency;
160 if (freq == CPUFREQ_ENTRY_INVALID)
170 /* Used for clocks that always have same value as the parent clock */
171 unsigned long followparent_recalc(struct clk *clk)
173 return clk->parent ? clk->parent->rate : 0;
176 int clk_reparent(struct clk *child, struct clk *parent)
178 list_del_init(&child->sibling);
180 list_add(&child->sibling, &parent->children);
181 child->parent = parent;
183 /* now do the debugfs renaming to reattach the child
184 to the proper parent */
189 /* Propagate rate to children */
190 void propagate_rate(struct clk *tclk)
194 list_for_each_entry(clkp, &tclk->children, sibling) {
195 if (clkp->ops && clkp->ops->recalc)
196 clkp->rate = clkp->ops->recalc(clkp);
198 propagate_rate(clkp);
202 static void __clk_disable(struct clk *clk)
204 if (WARN(!clk->usecount, "Trying to disable clock %p with 0 usecount\n",
208 if (!(--clk->usecount)) {
209 if (likely(clk->ops && clk->ops->disable))
210 clk->ops->disable(clk);
211 if (likely(clk->parent))
212 __clk_disable(clk->parent);
216 void clk_disable(struct clk *clk)
223 spin_lock_irqsave(&clock_lock, flags);
225 spin_unlock_irqrestore(&clock_lock, flags);
227 EXPORT_SYMBOL_GPL(clk_disable);
229 static int __clk_enable(struct clk *clk)
233 if (clk->usecount++ == 0) {
235 ret = __clk_enable(clk->parent);
240 if (clk->ops && clk->ops->enable) {
241 ret = clk->ops->enable(clk);
244 __clk_disable(clk->parent);
256 int clk_enable(struct clk *clk)
264 spin_lock_irqsave(&clock_lock, flags);
265 ret = __clk_enable(clk);
266 spin_unlock_irqrestore(&clock_lock, flags);
270 EXPORT_SYMBOL_GPL(clk_enable);
272 static LIST_HEAD(root_clks);
275 * recalculate_root_clocks - recalculate and propagate all root clocks
277 * Recalculates all root clocks (clocks with no parent), which if the
278 * clock's .recalc is set correctly, should also propagate their rates.
281 void recalculate_root_clocks(void)
285 list_for_each_entry(clkp, &root_clks, sibling) {
286 if (clkp->ops && clkp->ops->recalc)
287 clkp->rate = clkp->ops->recalc(clkp);
288 propagate_rate(clkp);
292 static struct clk_mapping dummy_mapping;
294 static struct clk *lookup_root_clock(struct clk *clk)
302 static int clk_establish_mapping(struct clk *clk)
304 struct clk_mapping *mapping = clk->mapping;
307 * Propagate mappings.
313 * dummy mapping for root clocks with no specified ranges
316 clk->mapping = &dummy_mapping;
321 * If we're on a child clock and it provides no mapping of its
322 * own, inherit the mapping from its root clock.
324 clkp = lookup_root_clock(clk);
325 mapping = clkp->mapping;
330 * Establish initial mapping.
332 if (!mapping->base && mapping->phys) {
333 kref_init(&mapping->ref);
335 mapping->base = ioremap_nocache(mapping->phys, mapping->len);
336 if (unlikely(!mapping->base))
338 } else if (mapping->base) {
340 * Bump the refcount for an existing mapping
342 kref_get(&mapping->ref);
345 clk->mapping = mapping;
349 static void clk_destroy_mapping(struct kref *kref)
351 struct clk_mapping *mapping;
353 mapping = container_of(kref, struct clk_mapping, ref);
355 iounmap(mapping->base);
358 static void clk_teardown_mapping(struct clk *clk)
360 struct clk_mapping *mapping = clk->mapping;
363 if (mapping == &dummy_mapping)
366 kref_put(&mapping->ref, clk_destroy_mapping);
370 int clk_register(struct clk *clk)
374 if (clk == NULL || IS_ERR(clk))
378 * trap out already registered clocks
380 if (clk->node.next || clk->node.prev)
383 mutex_lock(&clock_list_sem);
385 INIT_LIST_HEAD(&clk->children);
388 ret = clk_establish_mapping(clk);
393 list_add(&clk->sibling, &clk->parent->children);
395 list_add(&clk->sibling, &root_clks);
397 list_add(&clk->node, &clock_list);
398 if (clk->ops && clk->ops->init)
402 mutex_unlock(&clock_list_sem);
406 EXPORT_SYMBOL_GPL(clk_register);
408 void clk_unregister(struct clk *clk)
410 mutex_lock(&clock_list_sem);
411 list_del(&clk->sibling);
412 list_del(&clk->node);
413 clk_teardown_mapping(clk);
414 mutex_unlock(&clock_list_sem);
416 EXPORT_SYMBOL_GPL(clk_unregister);
418 void clk_enable_init_clocks(void)
422 list_for_each_entry(clkp, &clock_list, node)
423 if (clkp->flags & CLK_ENABLE_ON_INIT)
427 unsigned long clk_get_rate(struct clk *clk)
431 EXPORT_SYMBOL_GPL(clk_get_rate);
433 int clk_set_rate(struct clk *clk, unsigned long rate)
435 return clk_set_rate_ex(clk, rate, 0);
437 EXPORT_SYMBOL_GPL(clk_set_rate);
439 int clk_set_rate_ex(struct clk *clk, unsigned long rate, int algo_id)
441 int ret = -EOPNOTSUPP;
444 spin_lock_irqsave(&clock_lock, flags);
446 if (likely(clk->ops && clk->ops->set_rate)) {
447 ret = clk->ops->set_rate(clk, rate, algo_id);
455 if (clk->ops && clk->ops->recalc)
456 clk->rate = clk->ops->recalc(clk);
461 spin_unlock_irqrestore(&clock_lock, flags);
465 EXPORT_SYMBOL_GPL(clk_set_rate_ex);
467 int clk_set_parent(struct clk *clk, struct clk *parent)
474 if (clk->parent == parent)
477 spin_lock_irqsave(&clock_lock, flags);
478 if (clk->usecount == 0) {
479 if (clk->ops->set_parent)
480 ret = clk->ops->set_parent(clk, parent);
482 ret = clk_reparent(clk, parent);
485 if (clk->ops->recalc)
486 clk->rate = clk->ops->recalc(clk);
487 pr_debug("set parent of %p to %p (new rate %ld)\n",
488 clk, clk->parent, clk->rate);
493 spin_unlock_irqrestore(&clock_lock, flags);
497 EXPORT_SYMBOL_GPL(clk_set_parent);
499 struct clk *clk_get_parent(struct clk *clk)
503 EXPORT_SYMBOL_GPL(clk_get_parent);
505 long clk_round_rate(struct clk *clk, unsigned long rate)
507 if (likely(clk->ops && clk->ops->round_rate)) {
508 unsigned long flags, rounded;
510 spin_lock_irqsave(&clock_lock, flags);
511 rounded = clk->ops->round_rate(clk, rate);
512 spin_unlock_irqrestore(&clock_lock, flags);
517 return clk_get_rate(clk);
519 EXPORT_SYMBOL_GPL(clk_round_rate);
522 static int clks_sysdev_suspend(struct sys_device *dev, pm_message_t state)
524 static pm_message_t prev_state;
527 switch (state.event) {
529 /* Resumeing from hibernation */
530 if (prev_state.event != PM_EVENT_FREEZE)
533 list_for_each_entry(clkp, &clock_list, node) {
534 if (likely(clkp->ops)) {
535 unsigned long rate = clkp->rate;
537 if (likely(clkp->ops->set_parent))
538 clkp->ops->set_parent(clkp,
540 if (likely(clkp->ops->set_rate))
541 clkp->ops->set_rate(clkp,
543 else if (likely(clkp->ops->recalc))
544 clkp->rate = clkp->ops->recalc(clkp);
548 case PM_EVENT_FREEZE:
550 case PM_EVENT_SUSPEND:
558 static int clks_sysdev_resume(struct sys_device *dev)
560 return clks_sysdev_suspend(dev, PMSG_ON);
563 static struct sysdev_class clks_sysdev_class = {
567 static struct sysdev_driver clks_sysdev_driver = {
568 .suspend = clks_sysdev_suspend,
569 .resume = clks_sysdev_resume,
572 static struct sys_device clks_sysdev_dev = {
573 .cls = &clks_sysdev_class,
576 static int __init clk_sysdev_init(void)
578 sysdev_class_register(&clks_sysdev_class);
579 sysdev_driver_register(&clks_sysdev_class, &clks_sysdev_driver);
580 sysdev_register(&clks_sysdev_dev);
584 subsys_initcall(clk_sysdev_init);
588 * debugfs support to trace clock tree hierarchy and attributes
590 static struct dentry *clk_debugfs_root;
592 static int clk_debugfs_register_one(struct clk *c)
595 struct dentry *d, *child, *child_tmp;
596 struct clk *pa = c->parent;
600 p += sprintf(p, "%p", c);
601 d = debugfs_create_dir(s, pa ? pa->dentry : clk_debugfs_root);
606 d = debugfs_create_u8("usecount", S_IRUGO, c->dentry, (u8 *)&c->usecount);
611 d = debugfs_create_u32("rate", S_IRUGO, c->dentry, (u32 *)&c->rate);
616 d = debugfs_create_x32("flags", S_IRUGO, c->dentry, (u32 *)&c->flags);
625 list_for_each_entry_safe(child, child_tmp, &d->d_subdirs, d_u.d_child)
626 debugfs_remove(child);
627 debugfs_remove(c->dentry);
631 static int clk_debugfs_register(struct clk *c)
634 struct clk *pa = c->parent;
636 if (pa && !pa->dentry) {
637 err = clk_debugfs_register(pa);
643 err = clk_debugfs_register_one(c);
650 static int __init clk_debugfs_init(void)
656 d = debugfs_create_dir("clock", NULL);
659 clk_debugfs_root = d;
661 list_for_each_entry(c, &clock_list, node) {
662 err = clk_debugfs_register(c);
668 debugfs_remove_recursive(clk_debugfs_root);
671 late_initcall(clk_debugfs_init);