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