sh: allow registering clocks without name
[linux-2.6/libata-dev.git] / arch / sh / kernel / cpu / clock.c
blob073f4ffe956a9000145bb5d83bc750554d4d065a
1 /*
2 * arch/sh/kernel/cpu/clock.c - SuperH clock framework
4 * Copyright (C) 2005 - 2009 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
15 * for more details.
17 #include <linux/kernel.h>
18 #include <linux/init.h>
19 #include <linux/module.h>
20 #include <linux/mutex.h>
21 #include <linux/list.h>
22 #include <linux/kobject.h>
23 #include <linux/sysdev.h>
24 #include <linux/seq_file.h>
25 #include <linux/err.h>
26 #include <linux/platform_device.h>
27 #include <linux/debugfs.h>
28 #include <linux/cpufreq.h>
29 #include <linux/clk.h>
30 #include <asm/clock.h>
31 #include <asm/machvec.h>
33 static LIST_HEAD(clock_list);
34 static DEFINE_SPINLOCK(clock_lock);
35 static DEFINE_MUTEX(clock_list_sem);
37 void clk_rate_table_build(struct clk *clk,
38 struct cpufreq_frequency_table *freq_table,
39 int nr_freqs,
40 struct clk_div_mult_table *src_table,
41 unsigned long *bitmap)
43 unsigned long mult, div;
44 unsigned long freq;
45 int i;
47 for (i = 0; i < nr_freqs; i++) {
48 div = 1;
49 mult = 1;
51 if (src_table->divisors && i < src_table->nr_divisors)
52 div = src_table->divisors[i];
54 if (src_table->multipliers && i < src_table->nr_multipliers)
55 mult = src_table->multipliers[i];
57 if (!div || !mult || (bitmap && !test_bit(i, bitmap)))
58 freq = CPUFREQ_ENTRY_INVALID;
59 else
60 freq = clk->parent->rate * mult / div;
62 freq_table[i].index = i;
63 freq_table[i].frequency = freq;
66 /* Termination entry */
67 freq_table[i].index = i;
68 freq_table[i].frequency = CPUFREQ_TABLE_END;
71 long clk_rate_table_round(struct clk *clk,
72 struct cpufreq_frequency_table *freq_table,
73 unsigned long rate)
75 unsigned long rate_error, rate_error_prev = ~0UL;
76 unsigned long rate_best_fit = rate;
77 unsigned long highest, lowest;
78 int i;
80 highest = lowest = 0;
82 for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
83 unsigned long freq = freq_table[i].frequency;
85 if (freq == CPUFREQ_ENTRY_INVALID)
86 continue;
88 if (freq > highest)
89 highest = freq;
90 if (freq < lowest)
91 lowest = freq;
93 rate_error = abs(freq - rate);
94 if (rate_error < rate_error_prev) {
95 rate_best_fit = freq;
96 rate_error_prev = rate_error;
99 if (rate_error == 0)
100 break;
103 if (rate >= highest)
104 rate_best_fit = highest;
105 if (rate <= lowest)
106 rate_best_fit = lowest;
108 return rate_best_fit;
111 int clk_rate_table_find(struct clk *clk,
112 struct cpufreq_frequency_table *freq_table,
113 unsigned long rate)
115 int i;
117 for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
118 unsigned long freq = freq_table[i].frequency;
120 if (freq == CPUFREQ_ENTRY_INVALID)
121 continue;
123 if (freq == rate)
124 return i;
127 return -ENOENT;
130 /* Used for clocks that always have same value as the parent clock */
131 unsigned long followparent_recalc(struct clk *clk)
133 return clk->parent ? clk->parent->rate : 0;
136 int clk_reparent(struct clk *child, struct clk *parent)
138 list_del_init(&child->sibling);
139 if (parent)
140 list_add(&child->sibling, &parent->children);
141 child->parent = parent;
143 /* now do the debugfs renaming to reattach the child
144 to the proper parent */
146 return 0;
149 /* Propagate rate to children */
150 void propagate_rate(struct clk *tclk)
152 struct clk *clkp;
154 list_for_each_entry(clkp, &tclk->children, sibling) {
155 if (clkp->ops && clkp->ops->recalc)
156 clkp->rate = clkp->ops->recalc(clkp);
158 propagate_rate(clkp);
162 static void __clk_disable(struct clk *clk)
164 if (clk->usecount == 0) {
165 printk(KERN_ERR "Trying disable clock %s with 0 usecount\n",
166 clk->name);
167 WARN_ON(1);
168 return;
171 if (!(--clk->usecount)) {
172 if (likely(clk->ops && clk->ops->disable))
173 clk->ops->disable(clk);
174 if (likely(clk->parent))
175 __clk_disable(clk->parent);
179 void clk_disable(struct clk *clk)
181 unsigned long flags;
183 if (!clk)
184 return;
186 spin_lock_irqsave(&clock_lock, flags);
187 __clk_disable(clk);
188 spin_unlock_irqrestore(&clock_lock, flags);
190 EXPORT_SYMBOL_GPL(clk_disable);
192 static int __clk_enable(struct clk *clk)
194 int ret = 0;
196 if (clk->usecount++ == 0) {
197 if (clk->parent) {
198 ret = __clk_enable(clk->parent);
199 if (unlikely(ret))
200 goto err;
203 if (clk->ops && clk->ops->enable) {
204 ret = clk->ops->enable(clk);
205 if (ret) {
206 if (clk->parent)
207 __clk_disable(clk->parent);
208 goto err;
213 return ret;
214 err:
215 clk->usecount--;
216 return ret;
219 int clk_enable(struct clk *clk)
221 unsigned long flags;
222 int ret;
224 if (!clk)
225 return -EINVAL;
227 spin_lock_irqsave(&clock_lock, flags);
228 ret = __clk_enable(clk);
229 spin_unlock_irqrestore(&clock_lock, flags);
231 return ret;
233 EXPORT_SYMBOL_GPL(clk_enable);
235 static LIST_HEAD(root_clks);
238 * recalculate_root_clocks - recalculate and propagate all root clocks
240 * Recalculates all root clocks (clocks with no parent), which if the
241 * clock's .recalc is set correctly, should also propagate their rates.
242 * Called at init.
244 void recalculate_root_clocks(void)
246 struct clk *clkp;
248 list_for_each_entry(clkp, &root_clks, sibling) {
249 if (clkp->ops && clkp->ops->recalc)
250 clkp->rate = clkp->ops->recalc(clkp);
251 propagate_rate(clkp);
255 int clk_register(struct clk *clk)
257 if (clk == NULL || IS_ERR(clk))
258 return -EINVAL;
261 * trap out already registered clocks
263 if (clk->node.next || clk->node.prev)
264 return 0;
266 mutex_lock(&clock_list_sem);
268 INIT_LIST_HEAD(&clk->children);
269 clk->usecount = 0;
271 if (clk->parent)
272 list_add(&clk->sibling, &clk->parent->children);
273 else
274 list_add(&clk->sibling, &root_clks);
276 list_add(&clk->node, &clock_list);
277 if (clk->ops && clk->ops->init)
278 clk->ops->init(clk);
279 mutex_unlock(&clock_list_sem);
281 return 0;
283 EXPORT_SYMBOL_GPL(clk_register);
285 void clk_unregister(struct clk *clk)
287 mutex_lock(&clock_list_sem);
288 list_del(&clk->sibling);
289 list_del(&clk->node);
290 mutex_unlock(&clock_list_sem);
292 EXPORT_SYMBOL_GPL(clk_unregister);
294 static void clk_enable_init_clocks(void)
296 struct clk *clkp;
298 list_for_each_entry(clkp, &clock_list, node)
299 if (clkp->flags & CLK_ENABLE_ON_INIT)
300 clk_enable(clkp);
303 unsigned long clk_get_rate(struct clk *clk)
305 return clk->rate;
307 EXPORT_SYMBOL_GPL(clk_get_rate);
309 int clk_set_rate(struct clk *clk, unsigned long rate)
311 return clk_set_rate_ex(clk, rate, 0);
313 EXPORT_SYMBOL_GPL(clk_set_rate);
315 int clk_set_rate_ex(struct clk *clk, unsigned long rate, int algo_id)
317 int ret = -EOPNOTSUPP;
318 unsigned long flags;
320 spin_lock_irqsave(&clock_lock, flags);
322 if (likely(clk->ops && clk->ops->set_rate)) {
323 ret = clk->ops->set_rate(clk, rate, algo_id);
324 if (ret != 0)
325 goto out_unlock;
326 } else {
327 clk->rate = rate;
328 ret = 0;
331 if (clk->ops && clk->ops->recalc)
332 clk->rate = clk->ops->recalc(clk);
334 propagate_rate(clk);
336 out_unlock:
337 spin_unlock_irqrestore(&clock_lock, flags);
339 return ret;
341 EXPORT_SYMBOL_GPL(clk_set_rate_ex);
343 int clk_set_parent(struct clk *clk, struct clk *parent)
345 unsigned long flags;
346 int ret = -EINVAL;
348 if (!parent || !clk)
349 return ret;
350 if (clk->parent == parent)
351 return 0;
353 spin_lock_irqsave(&clock_lock, flags);
354 if (clk->usecount == 0) {
355 if (clk->ops->set_parent)
356 ret = clk->ops->set_parent(clk, parent);
357 else
358 ret = clk_reparent(clk, parent);
360 if (ret == 0) {
361 pr_debug("clock: set parent of %s to %s (new rate %ld)\n",
362 clk->name, clk->parent->name, clk->rate);
363 if (clk->ops->recalc)
364 clk->rate = clk->ops->recalc(clk);
365 propagate_rate(clk);
367 } else
368 ret = -EBUSY;
369 spin_unlock_irqrestore(&clock_lock, flags);
371 return ret;
373 EXPORT_SYMBOL_GPL(clk_set_parent);
375 struct clk *clk_get_parent(struct clk *clk)
377 return clk->parent;
379 EXPORT_SYMBOL_GPL(clk_get_parent);
381 long clk_round_rate(struct clk *clk, unsigned long rate)
383 if (likely(clk->ops && clk->ops->round_rate)) {
384 unsigned long flags, rounded;
386 spin_lock_irqsave(&clock_lock, flags);
387 rounded = clk->ops->round_rate(clk, rate);
388 spin_unlock_irqrestore(&clock_lock, flags);
390 return rounded;
393 return clk_get_rate(clk);
395 EXPORT_SYMBOL_GPL(clk_round_rate);
398 * Returns a clock. Note that we first try to use device id on the bus
399 * and clock name. If this fails, we try to use clock name only.
401 struct clk *clk_get(struct device *dev, const char *id)
403 const char *dev_id = dev ? dev_name(dev) : NULL;
404 struct clk *p, *clk = ERR_PTR(-ENOENT);
405 int idno;
407 clk = clk_get_sys(dev_id, id);
408 if (clk && !IS_ERR(clk))
409 return clk;
411 if (dev == NULL || dev->bus != &platform_bus_type)
412 idno = -1;
413 else
414 idno = to_platform_device(dev)->id;
416 mutex_lock(&clock_list_sem);
417 list_for_each_entry(p, &clock_list, node) {
418 if (p->name && p->id == idno &&
419 strcmp(id, p->name) == 0 && try_module_get(p->owner)) {
420 clk = p;
421 goto found;
425 list_for_each_entry(p, &clock_list, node) {
426 if (p->name &&
427 strcmp(id, p->name) == 0 && try_module_get(p->owner)) {
428 clk = p;
429 break;
433 found:
434 mutex_unlock(&clock_list_sem);
436 return clk;
438 EXPORT_SYMBOL_GPL(clk_get);
440 void clk_put(struct clk *clk)
442 if (clk && !IS_ERR(clk))
443 module_put(clk->owner);
445 EXPORT_SYMBOL_GPL(clk_put);
447 #ifdef CONFIG_PM
448 static int clks_sysdev_suspend(struct sys_device *dev, pm_message_t state)
450 static pm_message_t prev_state;
451 struct clk *clkp;
453 switch (state.event) {
454 case PM_EVENT_ON:
455 /* Resumeing from hibernation */
456 if (prev_state.event != PM_EVENT_FREEZE)
457 break;
459 list_for_each_entry(clkp, &clock_list, node) {
460 if (likely(clkp->ops)) {
461 unsigned long rate = clkp->rate;
463 if (likely(clkp->ops->set_parent))
464 clkp->ops->set_parent(clkp,
465 clkp->parent);
466 if (likely(clkp->ops->set_rate))
467 clkp->ops->set_rate(clkp,
468 rate, NO_CHANGE);
469 else if (likely(clkp->ops->recalc))
470 clkp->rate = clkp->ops->recalc(clkp);
473 break;
474 case PM_EVENT_FREEZE:
475 break;
476 case PM_EVENT_SUSPEND:
477 break;
480 prev_state = state;
481 return 0;
484 static int clks_sysdev_resume(struct sys_device *dev)
486 return clks_sysdev_suspend(dev, PMSG_ON);
489 static struct sysdev_class clks_sysdev_class = {
490 .name = "clks",
493 static struct sysdev_driver clks_sysdev_driver = {
494 .suspend = clks_sysdev_suspend,
495 .resume = clks_sysdev_resume,
498 static struct sys_device clks_sysdev_dev = {
499 .cls = &clks_sysdev_class,
502 static int __init clk_sysdev_init(void)
504 sysdev_class_register(&clks_sysdev_class);
505 sysdev_driver_register(&clks_sysdev_class, &clks_sysdev_driver);
506 sysdev_register(&clks_sysdev_dev);
508 return 0;
510 subsys_initcall(clk_sysdev_init);
511 #endif
513 int __init clk_init(void)
515 int ret;
517 ret = arch_clk_init();
518 if (unlikely(ret)) {
519 pr_err("%s: CPU clock registration failed.\n", __func__);
520 return ret;
523 if (sh_mv.mv_clk_init) {
524 ret = sh_mv.mv_clk_init();
525 if (unlikely(ret)) {
526 pr_err("%s: machvec clock initialization failed.\n",
527 __func__);
528 return ret;
532 /* Kick the child clocks.. */
533 recalculate_root_clocks();
535 /* Enable the necessary init clocks */
536 clk_enable_init_clocks();
538 return ret;
542 * debugfs support to trace clock tree hierarchy and attributes
544 static struct dentry *clk_debugfs_root;
546 static int clk_debugfs_register_one(struct clk *c)
548 int err;
549 struct dentry *d, *child, *child_tmp;
550 struct clk *pa = c->parent;
551 char s[255];
552 char *p = s;
554 p += sprintf(p, "%s", c->name);
555 if (c->id >= 0)
556 sprintf(p, ":%d", c->id);
557 d = debugfs_create_dir(s, pa ? pa->dentry : clk_debugfs_root);
558 if (!d)
559 return -ENOMEM;
560 c->dentry = d;
562 d = debugfs_create_u8("usecount", S_IRUGO, c->dentry, (u8 *)&c->usecount);
563 if (!d) {
564 err = -ENOMEM;
565 goto err_out;
567 d = debugfs_create_u32("rate", S_IRUGO, c->dentry, (u32 *)&c->rate);
568 if (!d) {
569 err = -ENOMEM;
570 goto err_out;
572 d = debugfs_create_x32("flags", S_IRUGO, c->dentry, (u32 *)&c->flags);
573 if (!d) {
574 err = -ENOMEM;
575 goto err_out;
577 return 0;
579 err_out:
580 d = c->dentry;
581 list_for_each_entry_safe(child, child_tmp, &d->d_subdirs, d_u.d_child)
582 debugfs_remove(child);
583 debugfs_remove(c->dentry);
584 return err;
587 static int clk_debugfs_register(struct clk *c)
589 int err;
590 struct clk *pa = c->parent;
592 if (pa && !pa->dentry) {
593 err = clk_debugfs_register(pa);
594 if (err)
595 return err;
598 if (!c->dentry && c->name) {
599 err = clk_debugfs_register_one(c);
600 if (err)
601 return err;
603 return 0;
606 static int __init clk_debugfs_init(void)
608 struct clk *c;
609 struct dentry *d;
610 int err;
612 d = debugfs_create_dir("clock", NULL);
613 if (!d)
614 return -ENOMEM;
615 clk_debugfs_root = d;
617 list_for_each_entry(c, &clock_list, node) {
618 err = clk_debugfs_register(c);
619 if (err)
620 goto err_out;
622 return 0;
623 err_out:
624 debugfs_remove(clk_debugfs_root); /* REVISIT: Cleanup correctly */
625 return err;
627 late_initcall(clk_debugfs_init);