clk.c 11 KB

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