clk.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532
  1. /*
  2. * drivers/sh/clk.c - SuperH clock framework
  3. *
  4. * Copyright (C) 2005 - 2009 Paul Mundt
  5. *
  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. */
  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 <linux/sh_clk.h>
  31. static LIST_HEAD(clock_list);
  32. static DEFINE_SPINLOCK(clock_lock);
  33. static DEFINE_MUTEX(clock_list_sem);
  34. void clk_rate_table_build(struct clk *clk,
  35. struct cpufreq_frequency_table *freq_table,
  36. int nr_freqs,
  37. struct clk_div_mult_table *src_table,
  38. unsigned long *bitmap)
  39. {
  40. unsigned long mult, div;
  41. unsigned long freq;
  42. int i;
  43. for (i = 0; i < nr_freqs; i++) {
  44. div = 1;
  45. mult = 1;
  46. if (src_table->divisors && i < src_table->nr_divisors)
  47. div = src_table->divisors[i];
  48. if (src_table->multipliers && i < src_table->nr_multipliers)
  49. mult = src_table->multipliers[i];
  50. if (!div || !mult || (bitmap && !test_bit(i, bitmap)))
  51. freq = CPUFREQ_ENTRY_INVALID;
  52. else
  53. freq = clk->parent->rate * mult / div;
  54. freq_table[i].index = i;
  55. freq_table[i].frequency = freq;
  56. }
  57. /* Termination entry */
  58. freq_table[i].index = i;
  59. freq_table[i].frequency = CPUFREQ_TABLE_END;
  60. }
  61. long clk_rate_table_round(struct clk *clk,
  62. struct cpufreq_frequency_table *freq_table,
  63. unsigned long rate)
  64. {
  65. unsigned long rate_error, rate_error_prev = ~0UL;
  66. unsigned long rate_best_fit = rate;
  67. int i;
  68. for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
  69. unsigned long freq = freq_table[i].frequency;
  70. if (freq == CPUFREQ_ENTRY_INVALID)
  71. continue;
  72. rate_error = abs(freq - rate);
  73. if (rate_error < rate_error_prev) {
  74. rate_best_fit = freq;
  75. rate_error_prev = rate_error;
  76. }
  77. if (rate_error == 0)
  78. break;
  79. }
  80. return rate_best_fit;
  81. }
  82. int clk_rate_table_find(struct clk *clk,
  83. struct cpufreq_frequency_table *freq_table,
  84. unsigned long rate)
  85. {
  86. int i;
  87. for (i = 0; freq_table[i].frequency != CPUFREQ_TABLE_END; i++) {
  88. unsigned long freq = freq_table[i].frequency;
  89. if (freq == CPUFREQ_ENTRY_INVALID)
  90. continue;
  91. if (freq == rate)
  92. return i;
  93. }
  94. return -ENOENT;
  95. }
  96. /* Used for clocks that always have same value as the parent clock */
  97. unsigned long followparent_recalc(struct clk *clk)
  98. {
  99. return clk->parent ? clk->parent->rate : 0;
  100. }
  101. int clk_reparent(struct clk *child, struct clk *parent)
  102. {
  103. list_del_init(&child->sibling);
  104. if (parent)
  105. list_add(&child->sibling, &parent->children);
  106. child->parent = parent;
  107. /* now do the debugfs renaming to reattach the child
  108. to the proper parent */
  109. return 0;
  110. }
  111. /* Propagate rate to children */
  112. void propagate_rate(struct clk *tclk)
  113. {
  114. struct clk *clkp;
  115. list_for_each_entry(clkp, &tclk->children, sibling) {
  116. if (clkp->ops && clkp->ops->recalc)
  117. clkp->rate = clkp->ops->recalc(clkp);
  118. propagate_rate(clkp);
  119. }
  120. }
  121. static void __clk_disable(struct clk *clk)
  122. {
  123. if (WARN(!clk->usecount, "Trying to disable clock %s with 0 usecount\n",
  124. clk->name))
  125. return;
  126. if (!(--clk->usecount)) {
  127. if (likely(clk->ops && clk->ops->disable))
  128. clk->ops->disable(clk);
  129. if (likely(clk->parent))
  130. __clk_disable(clk->parent);
  131. }
  132. }
  133. void clk_disable(struct clk *clk)
  134. {
  135. unsigned long flags;
  136. if (!clk)
  137. return;
  138. spin_lock_irqsave(&clock_lock, flags);
  139. __clk_disable(clk);
  140. spin_unlock_irqrestore(&clock_lock, flags);
  141. }
  142. EXPORT_SYMBOL_GPL(clk_disable);
  143. static int __clk_enable(struct clk *clk)
  144. {
  145. int ret = 0;
  146. if (clk->usecount++ == 0) {
  147. if (clk->parent) {
  148. ret = __clk_enable(clk->parent);
  149. if (unlikely(ret))
  150. goto err;
  151. }
  152. if (clk->ops && clk->ops->enable) {
  153. ret = clk->ops->enable(clk);
  154. if (ret) {
  155. if (clk->parent)
  156. __clk_disable(clk->parent);
  157. goto err;
  158. }
  159. }
  160. }
  161. return ret;
  162. err:
  163. clk->usecount--;
  164. return ret;
  165. }
  166. int clk_enable(struct clk *clk)
  167. {
  168. unsigned long flags;
  169. int ret;
  170. if (!clk)
  171. return -EINVAL;
  172. spin_lock_irqsave(&clock_lock, flags);
  173. ret = __clk_enable(clk);
  174. spin_unlock_irqrestore(&clock_lock, flags);
  175. return ret;
  176. }
  177. EXPORT_SYMBOL_GPL(clk_enable);
  178. static LIST_HEAD(root_clks);
  179. /**
  180. * recalculate_root_clocks - recalculate and propagate all root clocks
  181. *
  182. * Recalculates all root clocks (clocks with no parent), which if the
  183. * clock's .recalc is set correctly, should also propagate their rates.
  184. * Called at init.
  185. */
  186. void recalculate_root_clocks(void)
  187. {
  188. struct clk *clkp;
  189. list_for_each_entry(clkp, &root_clks, sibling) {
  190. if (clkp->ops && clkp->ops->recalc)
  191. clkp->rate = clkp->ops->recalc(clkp);
  192. propagate_rate(clkp);
  193. }
  194. }
  195. int clk_register(struct clk *clk)
  196. {
  197. if (clk == NULL || IS_ERR(clk))
  198. return -EINVAL;
  199. /*
  200. * trap out already registered clocks
  201. */
  202. if (clk->node.next || clk->node.prev)
  203. return 0;
  204. mutex_lock(&clock_list_sem);
  205. INIT_LIST_HEAD(&clk->children);
  206. clk->usecount = 0;
  207. if (clk->parent)
  208. list_add(&clk->sibling, &clk->parent->children);
  209. else
  210. list_add(&clk->sibling, &root_clks);
  211. list_add(&clk->node, &clock_list);
  212. if (clk->ops && clk->ops->init)
  213. clk->ops->init(clk);
  214. mutex_unlock(&clock_list_sem);
  215. return 0;
  216. }
  217. EXPORT_SYMBOL_GPL(clk_register);
  218. void clk_unregister(struct clk *clk)
  219. {
  220. mutex_lock(&clock_list_sem);
  221. list_del(&clk->sibling);
  222. list_del(&clk->node);
  223. mutex_unlock(&clock_list_sem);
  224. }
  225. EXPORT_SYMBOL_GPL(clk_unregister);
  226. void clk_enable_init_clocks(void)
  227. {
  228. struct clk *clkp;
  229. list_for_each_entry(clkp, &clock_list, node)
  230. if (clkp->flags & CLK_ENABLE_ON_INIT)
  231. clk_enable(clkp);
  232. }
  233. unsigned long clk_get_rate(struct clk *clk)
  234. {
  235. return clk->rate;
  236. }
  237. EXPORT_SYMBOL_GPL(clk_get_rate);
  238. int clk_set_rate(struct clk *clk, unsigned long rate)
  239. {
  240. return clk_set_rate_ex(clk, rate, 0);
  241. }
  242. EXPORT_SYMBOL_GPL(clk_set_rate);
  243. int clk_set_rate_ex(struct clk *clk, unsigned long rate, int algo_id)
  244. {
  245. int ret = -EOPNOTSUPP;
  246. unsigned long flags;
  247. spin_lock_irqsave(&clock_lock, flags);
  248. if (likely(clk->ops && clk->ops->set_rate)) {
  249. ret = clk->ops->set_rate(clk, rate, algo_id);
  250. if (ret != 0)
  251. goto out_unlock;
  252. } else {
  253. clk->rate = rate;
  254. ret = 0;
  255. }
  256. if (clk->ops && clk->ops->recalc)
  257. clk->rate = clk->ops->recalc(clk);
  258. propagate_rate(clk);
  259. out_unlock:
  260. spin_unlock_irqrestore(&clock_lock, flags);
  261. return ret;
  262. }
  263. EXPORT_SYMBOL_GPL(clk_set_rate_ex);
  264. int clk_set_parent(struct clk *clk, struct clk *parent)
  265. {
  266. unsigned long flags;
  267. int ret = -EINVAL;
  268. if (!parent || !clk)
  269. return ret;
  270. if (clk->parent == parent)
  271. return 0;
  272. spin_lock_irqsave(&clock_lock, flags);
  273. if (clk->usecount == 0) {
  274. if (clk->ops->set_parent)
  275. ret = clk->ops->set_parent(clk, parent);
  276. else
  277. ret = clk_reparent(clk, parent);
  278. if (ret == 0) {
  279. if (clk->ops->recalc)
  280. clk->rate = clk->ops->recalc(clk);
  281. pr_debug("clock: set parent of %s to %s (new rate %ld)\n",
  282. clk->name, clk->parent->name, clk->rate);
  283. propagate_rate(clk);
  284. }
  285. } else
  286. ret = -EBUSY;
  287. spin_unlock_irqrestore(&clock_lock, flags);
  288. return ret;
  289. }
  290. EXPORT_SYMBOL_GPL(clk_set_parent);
  291. struct clk *clk_get_parent(struct clk *clk)
  292. {
  293. return clk->parent;
  294. }
  295. EXPORT_SYMBOL_GPL(clk_get_parent);
  296. long clk_round_rate(struct clk *clk, unsigned long rate)
  297. {
  298. if (likely(clk->ops && clk->ops->round_rate)) {
  299. unsigned long flags, rounded;
  300. spin_lock_irqsave(&clock_lock, flags);
  301. rounded = clk->ops->round_rate(clk, rate);
  302. spin_unlock_irqrestore(&clock_lock, flags);
  303. return rounded;
  304. }
  305. return clk_get_rate(clk);
  306. }
  307. EXPORT_SYMBOL_GPL(clk_round_rate);
  308. #ifdef CONFIG_PM
  309. static int clks_sysdev_suspend(struct sys_device *dev, pm_message_t state)
  310. {
  311. static pm_message_t prev_state;
  312. struct clk *clkp;
  313. switch (state.event) {
  314. case PM_EVENT_ON:
  315. /* Resumeing from hibernation */
  316. if (prev_state.event != PM_EVENT_FREEZE)
  317. break;
  318. list_for_each_entry(clkp, &clock_list, node) {
  319. if (likely(clkp->ops)) {
  320. unsigned long rate = clkp->rate;
  321. if (likely(clkp->ops->set_parent))
  322. clkp->ops->set_parent(clkp,
  323. clkp->parent);
  324. if (likely(clkp->ops->set_rate))
  325. clkp->ops->set_rate(clkp,
  326. rate, NO_CHANGE);
  327. else if (likely(clkp->ops->recalc))
  328. clkp->rate = clkp->ops->recalc(clkp);
  329. }
  330. }
  331. break;
  332. case PM_EVENT_FREEZE:
  333. break;
  334. case PM_EVENT_SUSPEND:
  335. break;
  336. }
  337. prev_state = state;
  338. return 0;
  339. }
  340. static int clks_sysdev_resume(struct sys_device *dev)
  341. {
  342. return clks_sysdev_suspend(dev, PMSG_ON);
  343. }
  344. static struct sysdev_class clks_sysdev_class = {
  345. .name = "clks",
  346. };
  347. static struct sysdev_driver clks_sysdev_driver = {
  348. .suspend = clks_sysdev_suspend,
  349. .resume = clks_sysdev_resume,
  350. };
  351. static struct sys_device clks_sysdev_dev = {
  352. .cls = &clks_sysdev_class,
  353. };
  354. static int __init clk_sysdev_init(void)
  355. {
  356. sysdev_class_register(&clks_sysdev_class);
  357. sysdev_driver_register(&clks_sysdev_class, &clks_sysdev_driver);
  358. sysdev_register(&clks_sysdev_dev);
  359. return 0;
  360. }
  361. subsys_initcall(clk_sysdev_init);
  362. #endif
  363. /*
  364. * debugfs support to trace clock tree hierarchy and attributes
  365. */
  366. static struct dentry *clk_debugfs_root;
  367. static int clk_debugfs_register_one(struct clk *c)
  368. {
  369. int err;
  370. struct dentry *d, *child, *child_tmp;
  371. struct clk *pa = c->parent;
  372. char s[255];
  373. char *p = s;
  374. p += sprintf(p, "%s", c->name);
  375. if (c->id >= 0)
  376. sprintf(p, ":%d", c->id);
  377. d = debugfs_create_dir(s, pa ? pa->dentry : clk_debugfs_root);
  378. if (!d)
  379. return -ENOMEM;
  380. c->dentry = d;
  381. d = debugfs_create_u8("usecount", S_IRUGO, c->dentry, (u8 *)&c->usecount);
  382. if (!d) {
  383. err = -ENOMEM;
  384. goto err_out;
  385. }
  386. d = debugfs_create_u32("rate", S_IRUGO, c->dentry, (u32 *)&c->rate);
  387. if (!d) {
  388. err = -ENOMEM;
  389. goto err_out;
  390. }
  391. d = debugfs_create_x32("flags", S_IRUGO, c->dentry, (u32 *)&c->flags);
  392. if (!d) {
  393. err = -ENOMEM;
  394. goto err_out;
  395. }
  396. return 0;
  397. err_out:
  398. d = c->dentry;
  399. list_for_each_entry_safe(child, child_tmp, &d->d_subdirs, d_u.d_child)
  400. debugfs_remove(child);
  401. debugfs_remove(c->dentry);
  402. return err;
  403. }
  404. static int clk_debugfs_register(struct clk *c)
  405. {
  406. int err;
  407. struct clk *pa = c->parent;
  408. if (pa && !pa->dentry) {
  409. err = clk_debugfs_register(pa);
  410. if (err)
  411. return err;
  412. }
  413. if (!c->dentry && c->name) {
  414. err = clk_debugfs_register_one(c);
  415. if (err)
  416. return err;
  417. }
  418. return 0;
  419. }
  420. static int __init clk_debugfs_init(void)
  421. {
  422. struct clk *c;
  423. struct dentry *d;
  424. int err;
  425. d = debugfs_create_dir("clock", NULL);
  426. if (!d)
  427. return -ENOMEM;
  428. clk_debugfs_root = d;
  429. list_for_each_entry(c, &clock_list, node) {
  430. err = clk_debugfs_register(c);
  431. if (err)
  432. goto err_out;
  433. }
  434. return 0;
  435. err_out:
  436. debugfs_remove_recursive(clk_debugfs_root);
  437. return err;
  438. }
  439. late_initcall(clk_debugfs_init);