clock.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626
  1. /*
  2. * arch/sh/kernel/cpu/clock.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 <asm/clock.h>
  31. #include <asm/machvec.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 = lowest = 0;
  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 (clk->usecount == 0) {
  135. printk(KERN_ERR "Trying disable clock %s with 0 usecount\n",
  136. clk->name);
  137. WARN_ON(1);
  138. return;
  139. }
  140. if (!(--clk->usecount)) {
  141. if (likely(clk->ops && clk->ops->disable))
  142. clk->ops->disable(clk);
  143. if (likely(clk->parent))
  144. __clk_disable(clk->parent);
  145. }
  146. }
  147. void clk_disable(struct clk *clk)
  148. {
  149. unsigned long flags;
  150. if (!clk)
  151. return;
  152. spin_lock_irqsave(&clock_lock, flags);
  153. __clk_disable(clk);
  154. spin_unlock_irqrestore(&clock_lock, flags);
  155. }
  156. EXPORT_SYMBOL_GPL(clk_disable);
  157. static int __clk_enable(struct clk *clk)
  158. {
  159. int ret = 0;
  160. if (clk->usecount++ == 0) {
  161. if (clk->parent) {
  162. ret = __clk_enable(clk->parent);
  163. if (unlikely(ret))
  164. goto err;
  165. }
  166. if (clk->ops && clk->ops->enable) {
  167. ret = clk->ops->enable(clk);
  168. if (ret) {
  169. if (clk->parent)
  170. __clk_disable(clk->parent);
  171. goto err;
  172. }
  173. }
  174. }
  175. return ret;
  176. err:
  177. clk->usecount--;
  178. return ret;
  179. }
  180. int clk_enable(struct clk *clk)
  181. {
  182. unsigned long flags;
  183. int ret;
  184. if (!clk)
  185. return -EINVAL;
  186. spin_lock_irqsave(&clock_lock, flags);
  187. ret = __clk_enable(clk);
  188. spin_unlock_irqrestore(&clock_lock, flags);
  189. return ret;
  190. }
  191. EXPORT_SYMBOL_GPL(clk_enable);
  192. static LIST_HEAD(root_clks);
  193. /**
  194. * recalculate_root_clocks - recalculate and propagate all root clocks
  195. *
  196. * Recalculates all root clocks (clocks with no parent), which if the
  197. * clock's .recalc is set correctly, should also propagate their rates.
  198. * Called at init.
  199. */
  200. void recalculate_root_clocks(void)
  201. {
  202. struct clk *clkp;
  203. list_for_each_entry(clkp, &root_clks, sibling) {
  204. if (clkp->ops && clkp->ops->recalc)
  205. clkp->rate = clkp->ops->recalc(clkp);
  206. propagate_rate(clkp);
  207. }
  208. }
  209. int clk_register(struct clk *clk)
  210. {
  211. if (clk == NULL || IS_ERR(clk))
  212. return -EINVAL;
  213. /*
  214. * trap out already registered clocks
  215. */
  216. if (clk->node.next || clk->node.prev)
  217. return 0;
  218. mutex_lock(&clock_list_sem);
  219. INIT_LIST_HEAD(&clk->children);
  220. clk->usecount = 0;
  221. if (clk->parent)
  222. list_add(&clk->sibling, &clk->parent->children);
  223. else
  224. list_add(&clk->sibling, &root_clks);
  225. list_add(&clk->node, &clock_list);
  226. if (clk->ops && clk->ops->init)
  227. clk->ops->init(clk);
  228. mutex_unlock(&clock_list_sem);
  229. return 0;
  230. }
  231. EXPORT_SYMBOL_GPL(clk_register);
  232. void clk_unregister(struct clk *clk)
  233. {
  234. mutex_lock(&clock_list_sem);
  235. list_del(&clk->sibling);
  236. list_del(&clk->node);
  237. mutex_unlock(&clock_list_sem);
  238. }
  239. EXPORT_SYMBOL_GPL(clk_unregister);
  240. static void clk_enable_init_clocks(void)
  241. {
  242. struct clk *clkp;
  243. list_for_each_entry(clkp, &clock_list, node)
  244. if (clkp->flags & CLK_ENABLE_ON_INIT)
  245. clk_enable(clkp);
  246. }
  247. unsigned long clk_get_rate(struct clk *clk)
  248. {
  249. return clk->rate;
  250. }
  251. EXPORT_SYMBOL_GPL(clk_get_rate);
  252. int clk_set_rate(struct clk *clk, unsigned long rate)
  253. {
  254. return clk_set_rate_ex(clk, rate, 0);
  255. }
  256. EXPORT_SYMBOL_GPL(clk_set_rate);
  257. int clk_set_rate_ex(struct clk *clk, unsigned long rate, int algo_id)
  258. {
  259. int ret = -EOPNOTSUPP;
  260. unsigned long flags;
  261. spin_lock_irqsave(&clock_lock, flags);
  262. if (likely(clk->ops && clk->ops->set_rate)) {
  263. ret = clk->ops->set_rate(clk, rate, algo_id);
  264. if (ret != 0)
  265. goto out_unlock;
  266. } else {
  267. clk->rate = rate;
  268. ret = 0;
  269. }
  270. if (clk->ops && clk->ops->recalc)
  271. clk->rate = clk->ops->recalc(clk);
  272. propagate_rate(clk);
  273. out_unlock:
  274. spin_unlock_irqrestore(&clock_lock, flags);
  275. return ret;
  276. }
  277. EXPORT_SYMBOL_GPL(clk_set_rate_ex);
  278. int clk_set_parent(struct clk *clk, struct clk *parent)
  279. {
  280. unsigned long flags;
  281. int ret = -EINVAL;
  282. if (!parent || !clk)
  283. return ret;
  284. if (clk->parent == parent)
  285. return 0;
  286. spin_lock_irqsave(&clock_lock, flags);
  287. if (clk->usecount == 0) {
  288. if (clk->ops->set_parent)
  289. ret = clk->ops->set_parent(clk, parent);
  290. else
  291. ret = clk_reparent(clk, parent);
  292. if (ret == 0) {
  293. pr_debug("clock: set parent of %s to %s (new rate %ld)\n",
  294. clk->name, clk->parent->name, clk->rate);
  295. if (clk->ops->recalc)
  296. clk->rate = clk->ops->recalc(clk);
  297. propagate_rate(clk);
  298. }
  299. } else
  300. ret = -EBUSY;
  301. spin_unlock_irqrestore(&clock_lock, flags);
  302. return ret;
  303. }
  304. EXPORT_SYMBOL_GPL(clk_set_parent);
  305. struct clk *clk_get_parent(struct clk *clk)
  306. {
  307. return clk->parent;
  308. }
  309. EXPORT_SYMBOL_GPL(clk_get_parent);
  310. long clk_round_rate(struct clk *clk, unsigned long rate)
  311. {
  312. if (likely(clk->ops && clk->ops->round_rate)) {
  313. unsigned long flags, rounded;
  314. spin_lock_irqsave(&clock_lock, flags);
  315. rounded = clk->ops->round_rate(clk, rate);
  316. spin_unlock_irqrestore(&clock_lock, flags);
  317. return rounded;
  318. }
  319. return clk_get_rate(clk);
  320. }
  321. EXPORT_SYMBOL_GPL(clk_round_rate);
  322. /*
  323. * Returns a clock. Note that we first try to use device id on the bus
  324. * and clock name. If this fails, we try to use clock name only.
  325. */
  326. struct clk *clk_get(struct device *dev, const char *id)
  327. {
  328. const char *dev_id = dev ? dev_name(dev) : NULL;
  329. struct clk *p, *clk = ERR_PTR(-ENOENT);
  330. int idno;
  331. clk = clk_get_sys(dev_id, id);
  332. if (clk && !IS_ERR(clk))
  333. return clk;
  334. if (dev == NULL || dev->bus != &platform_bus_type)
  335. idno = -1;
  336. else
  337. idno = to_platform_device(dev)->id;
  338. mutex_lock(&clock_list_sem);
  339. list_for_each_entry(p, &clock_list, node) {
  340. if (p->id == idno &&
  341. strcmp(id, p->name) == 0 && try_module_get(p->owner)) {
  342. clk = p;
  343. goto found;
  344. }
  345. }
  346. list_for_each_entry(p, &clock_list, node) {
  347. if (strcmp(id, p->name) == 0 && try_module_get(p->owner)) {
  348. clk = p;
  349. break;
  350. }
  351. }
  352. found:
  353. mutex_unlock(&clock_list_sem);
  354. return clk;
  355. }
  356. EXPORT_SYMBOL_GPL(clk_get);
  357. void clk_put(struct clk *clk)
  358. {
  359. if (clk && !IS_ERR(clk))
  360. module_put(clk->owner);
  361. }
  362. EXPORT_SYMBOL_GPL(clk_put);
  363. #ifdef CONFIG_PM
  364. static int clks_sysdev_suspend(struct sys_device *dev, pm_message_t state)
  365. {
  366. static pm_message_t prev_state;
  367. struct clk *clkp;
  368. switch (state.event) {
  369. case PM_EVENT_ON:
  370. /* Resumeing from hibernation */
  371. if (prev_state.event != PM_EVENT_FREEZE)
  372. break;
  373. list_for_each_entry(clkp, &clock_list, node) {
  374. if (likely(clkp->ops)) {
  375. unsigned long rate = clkp->rate;
  376. if (likely(clkp->ops->set_parent))
  377. clkp->ops->set_parent(clkp,
  378. clkp->parent);
  379. if (likely(clkp->ops->set_rate))
  380. clkp->ops->set_rate(clkp,
  381. rate, NO_CHANGE);
  382. else if (likely(clkp->ops->recalc))
  383. clkp->rate = clkp->ops->recalc(clkp);
  384. }
  385. }
  386. break;
  387. case PM_EVENT_FREEZE:
  388. break;
  389. case PM_EVENT_SUSPEND:
  390. break;
  391. }
  392. prev_state = state;
  393. return 0;
  394. }
  395. static int clks_sysdev_resume(struct sys_device *dev)
  396. {
  397. return clks_sysdev_suspend(dev, PMSG_ON);
  398. }
  399. static struct sysdev_class clks_sysdev_class = {
  400. .name = "clks",
  401. };
  402. static struct sysdev_driver clks_sysdev_driver = {
  403. .suspend = clks_sysdev_suspend,
  404. .resume = clks_sysdev_resume,
  405. };
  406. static struct sys_device clks_sysdev_dev = {
  407. .cls = &clks_sysdev_class,
  408. };
  409. static int __init clk_sysdev_init(void)
  410. {
  411. sysdev_class_register(&clks_sysdev_class);
  412. sysdev_driver_register(&clks_sysdev_class, &clks_sysdev_driver);
  413. sysdev_register(&clks_sysdev_dev);
  414. return 0;
  415. }
  416. subsys_initcall(clk_sysdev_init);
  417. #endif
  418. int __init clk_init(void)
  419. {
  420. int ret;
  421. ret = arch_clk_init();
  422. if (unlikely(ret)) {
  423. pr_err("%s: CPU clock registration failed.\n", __func__);
  424. return ret;
  425. }
  426. if (sh_mv.mv_clk_init) {
  427. ret = sh_mv.mv_clk_init();
  428. if (unlikely(ret)) {
  429. pr_err("%s: machvec clock initialization failed.\n",
  430. __func__);
  431. return ret;
  432. }
  433. }
  434. /* Kick the child clocks.. */
  435. recalculate_root_clocks();
  436. /* Enable the necessary init clocks */
  437. clk_enable_init_clocks();
  438. return ret;
  439. }
  440. /*
  441. * debugfs support to trace clock tree hierarchy and attributes
  442. */
  443. static struct dentry *clk_debugfs_root;
  444. static int clk_debugfs_register_one(struct clk *c)
  445. {
  446. int err;
  447. struct dentry *d, *child, *child_tmp;
  448. struct clk *pa = c->parent;
  449. char s[255];
  450. char *p = s;
  451. p += sprintf(p, "%s", c->name);
  452. if (c->id >= 0)
  453. sprintf(p, ":%d", c->id);
  454. d = debugfs_create_dir(s, pa ? pa->dentry : clk_debugfs_root);
  455. if (!d)
  456. return -ENOMEM;
  457. c->dentry = d;
  458. d = debugfs_create_u8("usecount", S_IRUGO, c->dentry, (u8 *)&c->usecount);
  459. if (!d) {
  460. err = -ENOMEM;
  461. goto err_out;
  462. }
  463. d = debugfs_create_u32("rate", S_IRUGO, c->dentry, (u32 *)&c->rate);
  464. if (!d) {
  465. err = -ENOMEM;
  466. goto err_out;
  467. }
  468. d = debugfs_create_x32("flags", S_IRUGO, c->dentry, (u32 *)&c->flags);
  469. if (!d) {
  470. err = -ENOMEM;
  471. goto err_out;
  472. }
  473. return 0;
  474. err_out:
  475. d = c->dentry;
  476. list_for_each_entry_safe(child, child_tmp, &d->d_subdirs, d_u.d_child)
  477. debugfs_remove(child);
  478. debugfs_remove(c->dentry);
  479. return err;
  480. }
  481. static int clk_debugfs_register(struct clk *c)
  482. {
  483. int err;
  484. struct clk *pa = c->parent;
  485. if (pa && !pa->dentry) {
  486. err = clk_debugfs_register(pa);
  487. if (err)
  488. return err;
  489. }
  490. if (!c->dentry) {
  491. err = clk_debugfs_register_one(c);
  492. if (err)
  493. return err;
  494. }
  495. return 0;
  496. }
  497. static int __init clk_debugfs_init(void)
  498. {
  499. struct clk *c;
  500. struct dentry *d;
  501. int err;
  502. d = debugfs_create_dir("clock", NULL);
  503. if (!d)
  504. return -ENOMEM;
  505. clk_debugfs_root = d;
  506. list_for_each_entry(c, &clock_list, node) {
  507. err = clk_debugfs_register(c);
  508. if (err)
  509. goto err_out;
  510. }
  511. return 0;
  512. err_out:
  513. debugfs_remove(clk_debugfs_root); /* REVISIT: Cleanup correctly */
  514. return err;
  515. }
  516. late_initcall(clk_debugfs_init);