core.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625
  1. /*
  2. * 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/syscore_ops.h>
  24. #include <linux/seq_file.h>
  25. #include <linux/err.h>
  26. #include <linux/io.h>
  27. #include <linux/cpufreq.h>
  28. #include <linux/clk.h>
  29. #include <linux/sh_clk.h>
  30. static LIST_HEAD(clock_list);
  31. static DEFINE_SPINLOCK(clock_lock);
  32. static DEFINE_MUTEX(clock_list_sem);
  33. /* clock disable operations are not passed on to hardware during boot */
  34. static int allow_disable;
  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. clk->nr_freqs = nr_freqs;
  45. for (i = 0; i < nr_freqs; i++) {
  46. div = 1;
  47. mult = 1;
  48. if (src_table->divisors && i < src_table->nr_divisors)
  49. div = src_table->divisors[i];
  50. if (src_table->multipliers && i < src_table->nr_multipliers)
  51. mult = src_table->multipliers[i];
  52. if (!div || !mult || (bitmap && !test_bit(i, bitmap)))
  53. freq = CPUFREQ_ENTRY_INVALID;
  54. else
  55. freq = clk->parent->rate * mult / div;
  56. freq_table[i].driver_data = i;
  57. freq_table[i].frequency = freq;
  58. }
  59. /* Termination entry */
  60. freq_table[i].driver_data = i;
  61. freq_table[i].frequency = CPUFREQ_TABLE_END;
  62. }
  63. struct clk_rate_round_data;
  64. struct clk_rate_round_data {
  65. unsigned long rate;
  66. unsigned int min, max;
  67. long (*func)(unsigned int, struct clk_rate_round_data *);
  68. void *arg;
  69. };
  70. #define for_each_frequency(pos, r, freq) \
  71. for (pos = r->min, freq = r->func(pos, r); \
  72. pos <= r->max; pos++, freq = r->func(pos, r)) \
  73. if (unlikely(freq == 0)) \
  74. ; \
  75. else
  76. static long clk_rate_round_helper(struct clk_rate_round_data *rounder)
  77. {
  78. unsigned long rate_error, rate_error_prev = ~0UL;
  79. unsigned long highest, lowest, freq;
  80. long rate_best_fit = -ENOENT;
  81. int i;
  82. highest = 0;
  83. lowest = ~0UL;
  84. for_each_frequency(i, rounder, freq) {
  85. if (freq > highest)
  86. highest = freq;
  87. if (freq < lowest)
  88. lowest = freq;
  89. rate_error = abs(freq - rounder->rate);
  90. if (rate_error < rate_error_prev) {
  91. rate_best_fit = freq;
  92. rate_error_prev = rate_error;
  93. }
  94. if (rate_error == 0)
  95. break;
  96. }
  97. if (rounder->rate >= highest)
  98. rate_best_fit = highest;
  99. if (rounder->rate <= lowest)
  100. rate_best_fit = lowest;
  101. return rate_best_fit;
  102. }
  103. static long clk_rate_table_iter(unsigned int pos,
  104. struct clk_rate_round_data *rounder)
  105. {
  106. struct cpufreq_frequency_table *freq_table = rounder->arg;
  107. unsigned long freq = freq_table[pos].frequency;
  108. if (freq == CPUFREQ_ENTRY_INVALID)
  109. freq = 0;
  110. return freq;
  111. }
  112. long clk_rate_table_round(struct clk *clk,
  113. struct cpufreq_frequency_table *freq_table,
  114. unsigned long rate)
  115. {
  116. struct clk_rate_round_data table_round = {
  117. .min = 0,
  118. .max = clk->nr_freqs - 1,
  119. .func = clk_rate_table_iter,
  120. .arg = freq_table,
  121. .rate = rate,
  122. };
  123. if (clk->nr_freqs < 1)
  124. return -ENOSYS;
  125. return clk_rate_round_helper(&table_round);
  126. }
  127. static long clk_rate_div_range_iter(unsigned int pos,
  128. struct clk_rate_round_data *rounder)
  129. {
  130. return clk_get_rate(rounder->arg) / pos;
  131. }
  132. long clk_rate_div_range_round(struct clk *clk, unsigned int div_min,
  133. unsigned int div_max, unsigned long rate)
  134. {
  135. struct clk_rate_round_data div_range_round = {
  136. .min = div_min,
  137. .max = div_max,
  138. .func = clk_rate_div_range_iter,
  139. .arg = clk_get_parent(clk),
  140. .rate = rate,
  141. };
  142. return clk_rate_round_helper(&div_range_round);
  143. }
  144. static long clk_rate_mult_range_iter(unsigned int pos,
  145. struct clk_rate_round_data *rounder)
  146. {
  147. return clk_get_rate(rounder->arg) * pos;
  148. }
  149. long clk_rate_mult_range_round(struct clk *clk, unsigned int mult_min,
  150. unsigned int mult_max, unsigned long rate)
  151. {
  152. struct clk_rate_round_data mult_range_round = {
  153. .min = mult_min,
  154. .max = mult_max,
  155. .func = clk_rate_mult_range_iter,
  156. .arg = clk_get_parent(clk),
  157. .rate = rate,
  158. };
  159. return clk_rate_round_helper(&mult_range_round);
  160. }
  161. int clk_rate_table_find(struct clk *clk,
  162. struct cpufreq_frequency_table *freq_table,
  163. unsigned long rate)
  164. {
  165. struct cpufreq_frequency_table *pos;
  166. int idx;
  167. cpufreq_for_each_valid_entry_idx(pos, freq_table, idx)
  168. if (pos->frequency == rate)
  169. return idx;
  170. return -ENOENT;
  171. }
  172. /* Used for clocks that always have same value as the parent clock */
  173. unsigned long followparent_recalc(struct clk *clk)
  174. {
  175. return clk->parent ? clk->parent->rate : 0;
  176. }
  177. int clk_reparent(struct clk *child, struct clk *parent)
  178. {
  179. list_del_init(&child->sibling);
  180. if (parent)
  181. list_add(&child->sibling, &parent->children);
  182. child->parent = parent;
  183. return 0;
  184. }
  185. /* Propagate rate to children */
  186. void propagate_rate(struct clk *tclk)
  187. {
  188. struct clk *clkp;
  189. list_for_each_entry(clkp, &tclk->children, sibling) {
  190. if (clkp->ops && clkp->ops->recalc)
  191. clkp->rate = clkp->ops->recalc(clkp);
  192. propagate_rate(clkp);
  193. }
  194. }
  195. static void __clk_disable(struct clk *clk)
  196. {
  197. if (WARN(!clk->usecount, "Trying to disable clock %p with 0 usecount\n",
  198. clk))
  199. return;
  200. if (!(--clk->usecount)) {
  201. if (likely(allow_disable && clk->ops && clk->ops->disable))
  202. clk->ops->disable(clk);
  203. if (likely(clk->parent))
  204. __clk_disable(clk->parent);
  205. }
  206. }
  207. void clk_disable(struct clk *clk)
  208. {
  209. unsigned long flags;
  210. if (!clk)
  211. return;
  212. spin_lock_irqsave(&clock_lock, flags);
  213. __clk_disable(clk);
  214. spin_unlock_irqrestore(&clock_lock, flags);
  215. }
  216. EXPORT_SYMBOL_GPL(clk_disable);
  217. static int __clk_enable(struct clk *clk)
  218. {
  219. int ret = 0;
  220. if (clk->usecount++ == 0) {
  221. if (clk->parent) {
  222. ret = __clk_enable(clk->parent);
  223. if (unlikely(ret))
  224. goto err;
  225. }
  226. if (clk->ops && clk->ops->enable) {
  227. ret = clk->ops->enable(clk);
  228. if (ret) {
  229. if (clk->parent)
  230. __clk_disable(clk->parent);
  231. goto err;
  232. }
  233. }
  234. }
  235. return ret;
  236. err:
  237. clk->usecount--;
  238. return ret;
  239. }
  240. int clk_enable(struct clk *clk)
  241. {
  242. unsigned long flags;
  243. int ret;
  244. if (!clk)
  245. return -EINVAL;
  246. spin_lock_irqsave(&clock_lock, flags);
  247. ret = __clk_enable(clk);
  248. spin_unlock_irqrestore(&clock_lock, flags);
  249. return ret;
  250. }
  251. EXPORT_SYMBOL_GPL(clk_enable);
  252. static LIST_HEAD(root_clks);
  253. /**
  254. * recalculate_root_clocks - recalculate and propagate all root clocks
  255. *
  256. * Recalculates all root clocks (clocks with no parent), which if the
  257. * clock's .recalc is set correctly, should also propagate their rates.
  258. * Called at init.
  259. */
  260. void recalculate_root_clocks(void)
  261. {
  262. struct clk *clkp;
  263. list_for_each_entry(clkp, &root_clks, sibling) {
  264. if (clkp->ops && clkp->ops->recalc)
  265. clkp->rate = clkp->ops->recalc(clkp);
  266. propagate_rate(clkp);
  267. }
  268. }
  269. static struct clk_mapping dummy_mapping;
  270. static struct clk *lookup_root_clock(struct clk *clk)
  271. {
  272. while (clk->parent)
  273. clk = clk->parent;
  274. return clk;
  275. }
  276. static int clk_establish_mapping(struct clk *clk)
  277. {
  278. struct clk_mapping *mapping = clk->mapping;
  279. /*
  280. * Propagate mappings.
  281. */
  282. if (!mapping) {
  283. struct clk *clkp;
  284. /*
  285. * dummy mapping for root clocks with no specified ranges
  286. */
  287. if (!clk->parent) {
  288. clk->mapping = &dummy_mapping;
  289. goto out;
  290. }
  291. /*
  292. * If we're on a child clock and it provides no mapping of its
  293. * own, inherit the mapping from its root clock.
  294. */
  295. clkp = lookup_root_clock(clk);
  296. mapping = clkp->mapping;
  297. BUG_ON(!mapping);
  298. }
  299. /*
  300. * Establish initial mapping.
  301. */
  302. if (!mapping->base && mapping->phys) {
  303. kref_init(&mapping->ref);
  304. mapping->base = ioremap_nocache(mapping->phys, mapping->len);
  305. if (unlikely(!mapping->base))
  306. return -ENXIO;
  307. } else if (mapping->base) {
  308. /*
  309. * Bump the refcount for an existing mapping
  310. */
  311. kref_get(&mapping->ref);
  312. }
  313. clk->mapping = mapping;
  314. out:
  315. clk->mapped_reg = clk->mapping->base;
  316. clk->mapped_reg += (phys_addr_t)clk->enable_reg - clk->mapping->phys;
  317. return 0;
  318. }
  319. static void clk_destroy_mapping(struct kref *kref)
  320. {
  321. struct clk_mapping *mapping;
  322. mapping = container_of(kref, struct clk_mapping, ref);
  323. iounmap(mapping->base);
  324. }
  325. static void clk_teardown_mapping(struct clk *clk)
  326. {
  327. struct clk_mapping *mapping = clk->mapping;
  328. /* Nothing to do */
  329. if (mapping == &dummy_mapping)
  330. goto out;
  331. kref_put(&mapping->ref, clk_destroy_mapping);
  332. clk->mapping = NULL;
  333. out:
  334. clk->mapped_reg = NULL;
  335. }
  336. int clk_register(struct clk *clk)
  337. {
  338. int ret;
  339. if (IS_ERR_OR_NULL(clk))
  340. return -EINVAL;
  341. /*
  342. * trap out already registered clocks
  343. */
  344. if (clk->node.next || clk->node.prev)
  345. return 0;
  346. mutex_lock(&clock_list_sem);
  347. INIT_LIST_HEAD(&clk->children);
  348. clk->usecount = 0;
  349. ret = clk_establish_mapping(clk);
  350. if (unlikely(ret))
  351. goto out_unlock;
  352. if (clk->parent)
  353. list_add(&clk->sibling, &clk->parent->children);
  354. else
  355. list_add(&clk->sibling, &root_clks);
  356. list_add(&clk->node, &clock_list);
  357. #ifdef CONFIG_SH_CLK_CPG_LEGACY
  358. if (clk->ops && clk->ops->init)
  359. clk->ops->init(clk);
  360. #endif
  361. out_unlock:
  362. mutex_unlock(&clock_list_sem);
  363. return ret;
  364. }
  365. EXPORT_SYMBOL_GPL(clk_register);
  366. void clk_unregister(struct clk *clk)
  367. {
  368. mutex_lock(&clock_list_sem);
  369. list_del(&clk->sibling);
  370. list_del(&clk->node);
  371. clk_teardown_mapping(clk);
  372. mutex_unlock(&clock_list_sem);
  373. }
  374. EXPORT_SYMBOL_GPL(clk_unregister);
  375. void clk_enable_init_clocks(void)
  376. {
  377. struct clk *clkp;
  378. list_for_each_entry(clkp, &clock_list, node)
  379. if (clkp->flags & CLK_ENABLE_ON_INIT)
  380. clk_enable(clkp);
  381. }
  382. unsigned long clk_get_rate(struct clk *clk)
  383. {
  384. if (!clk)
  385. return 0;
  386. return clk->rate;
  387. }
  388. EXPORT_SYMBOL_GPL(clk_get_rate);
  389. int clk_set_rate(struct clk *clk, unsigned long rate)
  390. {
  391. int ret = -EOPNOTSUPP;
  392. unsigned long flags;
  393. if (!clk)
  394. return 0;
  395. spin_lock_irqsave(&clock_lock, flags);
  396. if (likely(clk->ops && clk->ops->set_rate)) {
  397. ret = clk->ops->set_rate(clk, rate);
  398. if (ret != 0)
  399. goto out_unlock;
  400. } else {
  401. clk->rate = rate;
  402. ret = 0;
  403. }
  404. if (clk->ops && clk->ops->recalc)
  405. clk->rate = clk->ops->recalc(clk);
  406. propagate_rate(clk);
  407. out_unlock:
  408. spin_unlock_irqrestore(&clock_lock, flags);
  409. return ret;
  410. }
  411. EXPORT_SYMBOL_GPL(clk_set_rate);
  412. int clk_set_parent(struct clk *clk, struct clk *parent)
  413. {
  414. unsigned long flags;
  415. int ret = -EINVAL;
  416. if (!parent || !clk)
  417. return ret;
  418. if (clk->parent == parent)
  419. return 0;
  420. spin_lock_irqsave(&clock_lock, flags);
  421. if (clk->usecount == 0) {
  422. if (clk->ops->set_parent)
  423. ret = clk->ops->set_parent(clk, parent);
  424. else
  425. ret = clk_reparent(clk, parent);
  426. if (ret == 0) {
  427. if (clk->ops->recalc)
  428. clk->rate = clk->ops->recalc(clk);
  429. pr_debug("set parent of %p to %p (new rate %ld)\n",
  430. clk, clk->parent, clk->rate);
  431. propagate_rate(clk);
  432. }
  433. } else
  434. ret = -EBUSY;
  435. spin_unlock_irqrestore(&clock_lock, flags);
  436. return ret;
  437. }
  438. EXPORT_SYMBOL_GPL(clk_set_parent);
  439. struct clk *clk_get_parent(struct clk *clk)
  440. {
  441. if (!clk)
  442. return NULL;
  443. return clk->parent;
  444. }
  445. EXPORT_SYMBOL_GPL(clk_get_parent);
  446. long clk_round_rate(struct clk *clk, unsigned long rate)
  447. {
  448. if (!clk)
  449. return 0;
  450. if (likely(clk->ops && clk->ops->round_rate)) {
  451. unsigned long flags, rounded;
  452. spin_lock_irqsave(&clock_lock, flags);
  453. rounded = clk->ops->round_rate(clk, rate);
  454. spin_unlock_irqrestore(&clock_lock, flags);
  455. return rounded;
  456. }
  457. return clk_get_rate(clk);
  458. }
  459. EXPORT_SYMBOL_GPL(clk_round_rate);
  460. #ifdef CONFIG_PM
  461. static void clks_core_resume(void)
  462. {
  463. struct clk *clkp;
  464. list_for_each_entry(clkp, &clock_list, node) {
  465. if (likely(clkp->usecount && clkp->ops)) {
  466. unsigned long rate = clkp->rate;
  467. if (likely(clkp->ops->set_parent))
  468. clkp->ops->set_parent(clkp,
  469. clkp->parent);
  470. if (likely(clkp->ops->set_rate))
  471. clkp->ops->set_rate(clkp, rate);
  472. else if (likely(clkp->ops->recalc))
  473. clkp->rate = clkp->ops->recalc(clkp);
  474. }
  475. }
  476. }
  477. static struct syscore_ops clks_syscore_ops = {
  478. .resume = clks_core_resume,
  479. };
  480. static int __init clk_syscore_init(void)
  481. {
  482. register_syscore_ops(&clks_syscore_ops);
  483. return 0;
  484. }
  485. subsys_initcall(clk_syscore_init);
  486. #endif
  487. static int __init clk_late_init(void)
  488. {
  489. unsigned long flags;
  490. struct clk *clk;
  491. /* disable all clocks with zero use count */
  492. mutex_lock(&clock_list_sem);
  493. spin_lock_irqsave(&clock_lock, flags);
  494. list_for_each_entry(clk, &clock_list, node)
  495. if (!clk->usecount && clk->ops && clk->ops->disable)
  496. clk->ops->disable(clk);
  497. /* from now on allow clock disable operations */
  498. allow_disable = 1;
  499. spin_unlock_irqrestore(&clock_lock, flags);
  500. mutex_unlock(&clock_list_sem);
  501. return 0;
  502. }
  503. late_initcall(clk_late_init);