divider.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639
  1. /*
  2. * TI Divider Clock
  3. *
  4. * Copyright (C) 2013 Texas Instruments, Inc.
  5. *
  6. * Tero Kristo <t-kristo@ti.com>
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License version 2 as
  10. * published by the Free Software Foundation.
  11. *
  12. * This program is distributed "as is" WITHOUT ANY WARRANTY of any
  13. * kind, whether express or implied; without even the implied warranty
  14. * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. */
  17. #include <linux/clk-provider.h>
  18. #include <linux/slab.h>
  19. #include <linux/err.h>
  20. #include <linux/of.h>
  21. #include <linux/of_address.h>
  22. #include <linux/clk/ti.h>
  23. #include "clock.h"
  24. #undef pr_fmt
  25. #define pr_fmt(fmt) "%s: " fmt, __func__
  26. #define div_mask(d) ((1 << ((d)->width)) - 1)
  27. static unsigned int _get_table_maxdiv(const struct clk_div_table *table)
  28. {
  29. unsigned int maxdiv = 0;
  30. const struct clk_div_table *clkt;
  31. for (clkt = table; clkt->div; clkt++)
  32. if (clkt->div > maxdiv)
  33. maxdiv = clkt->div;
  34. return maxdiv;
  35. }
  36. static unsigned int _get_maxdiv(struct clk_divider *divider)
  37. {
  38. if (divider->flags & CLK_DIVIDER_ONE_BASED)
  39. return div_mask(divider);
  40. if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
  41. return 1 << div_mask(divider);
  42. if (divider->table)
  43. return _get_table_maxdiv(divider->table);
  44. return div_mask(divider) + 1;
  45. }
  46. static unsigned int _get_table_div(const struct clk_div_table *table,
  47. unsigned int val)
  48. {
  49. const struct clk_div_table *clkt;
  50. for (clkt = table; clkt->div; clkt++)
  51. if (clkt->val == val)
  52. return clkt->div;
  53. return 0;
  54. }
  55. static unsigned int _get_div(struct clk_divider *divider, unsigned int val)
  56. {
  57. if (divider->flags & CLK_DIVIDER_ONE_BASED)
  58. return val;
  59. if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
  60. return 1 << val;
  61. if (divider->table)
  62. return _get_table_div(divider->table, val);
  63. return val + 1;
  64. }
  65. static unsigned int _get_table_val(const struct clk_div_table *table,
  66. unsigned int div)
  67. {
  68. const struct clk_div_table *clkt;
  69. for (clkt = table; clkt->div; clkt++)
  70. if (clkt->div == div)
  71. return clkt->val;
  72. return 0;
  73. }
  74. static unsigned int _get_val(struct clk_divider *divider, u8 div)
  75. {
  76. if (divider->flags & CLK_DIVIDER_ONE_BASED)
  77. return div;
  78. if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
  79. return __ffs(div);
  80. if (divider->table)
  81. return _get_table_val(divider->table, div);
  82. return div - 1;
  83. }
  84. static unsigned long ti_clk_divider_recalc_rate(struct clk_hw *hw,
  85. unsigned long parent_rate)
  86. {
  87. struct clk_divider *divider = to_clk_divider(hw);
  88. unsigned int div, val;
  89. val = ti_clk_ll_ops->clk_readl(divider->reg) >> divider->shift;
  90. val &= div_mask(divider);
  91. div = _get_div(divider, val);
  92. if (!div) {
  93. WARN(!(divider->flags & CLK_DIVIDER_ALLOW_ZERO),
  94. "%s: Zero divisor and CLK_DIVIDER_ALLOW_ZERO not set\n",
  95. clk_hw_get_name(hw));
  96. return parent_rate;
  97. }
  98. return DIV_ROUND_UP(parent_rate, div);
  99. }
  100. /*
  101. * The reverse of DIV_ROUND_UP: The maximum number which
  102. * divided by m is r
  103. */
  104. #define MULT_ROUND_UP(r, m) ((r) * (m) + (m) - 1)
  105. static bool _is_valid_table_div(const struct clk_div_table *table,
  106. unsigned int div)
  107. {
  108. const struct clk_div_table *clkt;
  109. for (clkt = table; clkt->div; clkt++)
  110. if (clkt->div == div)
  111. return true;
  112. return false;
  113. }
  114. static bool _is_valid_div(struct clk_divider *divider, unsigned int div)
  115. {
  116. if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
  117. return is_power_of_2(div);
  118. if (divider->table)
  119. return _is_valid_table_div(divider->table, div);
  120. return true;
  121. }
  122. static int _div_round_up(const struct clk_div_table *table,
  123. unsigned long parent_rate, unsigned long rate)
  124. {
  125. const struct clk_div_table *clkt;
  126. int up = INT_MAX;
  127. int div = DIV_ROUND_UP_ULL((u64)parent_rate, rate);
  128. for (clkt = table; clkt->div; clkt++) {
  129. if (clkt->div == div)
  130. return clkt->div;
  131. else if (clkt->div < div)
  132. continue;
  133. if ((clkt->div - div) < (up - div))
  134. up = clkt->div;
  135. }
  136. return up;
  137. }
  138. static int _div_round(const struct clk_div_table *table,
  139. unsigned long parent_rate, unsigned long rate)
  140. {
  141. if (!table)
  142. return DIV_ROUND_UP(parent_rate, rate);
  143. return _div_round_up(table, parent_rate, rate);
  144. }
  145. static int ti_clk_divider_bestdiv(struct clk_hw *hw, unsigned long rate,
  146. unsigned long *best_parent_rate)
  147. {
  148. struct clk_divider *divider = to_clk_divider(hw);
  149. int i, bestdiv = 0;
  150. unsigned long parent_rate, best = 0, now, maxdiv;
  151. unsigned long parent_rate_saved = *best_parent_rate;
  152. if (!rate)
  153. rate = 1;
  154. maxdiv = _get_maxdiv(divider);
  155. if (!(clk_hw_get_flags(hw) & CLK_SET_RATE_PARENT)) {
  156. parent_rate = *best_parent_rate;
  157. bestdiv = _div_round(divider->table, parent_rate, rate);
  158. bestdiv = bestdiv == 0 ? 1 : bestdiv;
  159. bestdiv = bestdiv > maxdiv ? maxdiv : bestdiv;
  160. return bestdiv;
  161. }
  162. /*
  163. * The maximum divider we can use without overflowing
  164. * unsigned long in rate * i below
  165. */
  166. maxdiv = min(ULONG_MAX / rate, maxdiv);
  167. for (i = 1; i <= maxdiv; i++) {
  168. if (!_is_valid_div(divider, i))
  169. continue;
  170. if (rate * i == parent_rate_saved) {
  171. /*
  172. * It's the most ideal case if the requested rate can be
  173. * divided from parent clock without needing to change
  174. * parent rate, so return the divider immediately.
  175. */
  176. *best_parent_rate = parent_rate_saved;
  177. return i;
  178. }
  179. parent_rate = clk_hw_round_rate(clk_hw_get_parent(hw),
  180. MULT_ROUND_UP(rate, i));
  181. now = DIV_ROUND_UP(parent_rate, i);
  182. if (now <= rate && now > best) {
  183. bestdiv = i;
  184. best = now;
  185. *best_parent_rate = parent_rate;
  186. }
  187. }
  188. if (!bestdiv) {
  189. bestdiv = _get_maxdiv(divider);
  190. *best_parent_rate =
  191. clk_hw_round_rate(clk_hw_get_parent(hw), 1);
  192. }
  193. return bestdiv;
  194. }
  195. static long ti_clk_divider_round_rate(struct clk_hw *hw, unsigned long rate,
  196. unsigned long *prate)
  197. {
  198. int div;
  199. div = ti_clk_divider_bestdiv(hw, rate, prate);
  200. return DIV_ROUND_UP(*prate, div);
  201. }
  202. static int ti_clk_divider_set_rate(struct clk_hw *hw, unsigned long rate,
  203. unsigned long parent_rate)
  204. {
  205. struct clk_divider *divider;
  206. unsigned int div, value;
  207. u32 val;
  208. if (!hw || !rate)
  209. return -EINVAL;
  210. divider = to_clk_divider(hw);
  211. div = DIV_ROUND_UP(parent_rate, rate);
  212. value = _get_val(divider, div);
  213. if (value > div_mask(divider))
  214. value = div_mask(divider);
  215. if (divider->flags & CLK_DIVIDER_HIWORD_MASK) {
  216. val = div_mask(divider) << (divider->shift + 16);
  217. } else {
  218. val = ti_clk_ll_ops->clk_readl(divider->reg);
  219. val &= ~(div_mask(divider) << divider->shift);
  220. }
  221. val |= value << divider->shift;
  222. ti_clk_ll_ops->clk_writel(val, divider->reg);
  223. return 0;
  224. }
  225. const struct clk_ops ti_clk_divider_ops = {
  226. .recalc_rate = ti_clk_divider_recalc_rate,
  227. .round_rate = ti_clk_divider_round_rate,
  228. .set_rate = ti_clk_divider_set_rate,
  229. };
  230. static struct clk *_register_divider(struct device *dev, const char *name,
  231. const char *parent_name,
  232. unsigned long flags, void __iomem *reg,
  233. u8 shift, u8 width, u8 clk_divider_flags,
  234. const struct clk_div_table *table)
  235. {
  236. struct clk_divider *div;
  237. struct clk *clk;
  238. struct clk_init_data init;
  239. if (clk_divider_flags & CLK_DIVIDER_HIWORD_MASK) {
  240. if (width + shift > 16) {
  241. pr_warn("divider value exceeds LOWORD field\n");
  242. return ERR_PTR(-EINVAL);
  243. }
  244. }
  245. /* allocate the divider */
  246. div = kzalloc(sizeof(*div), GFP_KERNEL);
  247. if (!div) {
  248. pr_err("%s: could not allocate divider clk\n", __func__);
  249. return ERR_PTR(-ENOMEM);
  250. }
  251. init.name = name;
  252. init.ops = &ti_clk_divider_ops;
  253. init.flags = flags | CLK_IS_BASIC;
  254. init.parent_names = (parent_name ? &parent_name : NULL);
  255. init.num_parents = (parent_name ? 1 : 0);
  256. /* struct clk_divider assignments */
  257. div->reg = reg;
  258. div->shift = shift;
  259. div->width = width;
  260. div->flags = clk_divider_flags;
  261. div->hw.init = &init;
  262. div->table = table;
  263. /* register the clock */
  264. clk = clk_register(dev, &div->hw);
  265. if (IS_ERR(clk))
  266. kfree(div);
  267. return clk;
  268. }
  269. static struct clk_div_table *
  270. _get_div_table_from_setup(struct ti_clk_divider *setup, u8 *width)
  271. {
  272. int valid_div = 0;
  273. struct clk_div_table *table;
  274. int i;
  275. int div;
  276. u32 val;
  277. u8 flags;
  278. if (!setup->num_dividers) {
  279. /* Clk divider table not provided, determine min/max divs */
  280. flags = setup->flags;
  281. if (flags & CLKF_INDEX_STARTS_AT_ONE)
  282. val = 1;
  283. else
  284. val = 0;
  285. div = 1;
  286. while (div < setup->max_div) {
  287. if (flags & CLKF_INDEX_POWER_OF_TWO)
  288. div <<= 1;
  289. else
  290. div++;
  291. val++;
  292. }
  293. *width = fls(val);
  294. return NULL;
  295. }
  296. for (i = 0; i < setup->num_dividers; i++)
  297. if (setup->dividers[i])
  298. valid_div++;
  299. table = kzalloc(sizeof(*table) * (valid_div + 1), GFP_KERNEL);
  300. if (!table)
  301. return ERR_PTR(-ENOMEM);
  302. valid_div = 0;
  303. *width = 0;
  304. for (i = 0; i < setup->num_dividers; i++)
  305. if (setup->dividers[i]) {
  306. table[valid_div].div = setup->dividers[i];
  307. table[valid_div].val = i;
  308. valid_div++;
  309. *width = i;
  310. }
  311. *width = fls(*width);
  312. return table;
  313. }
  314. struct clk_hw *ti_clk_build_component_div(struct ti_clk_divider *setup)
  315. {
  316. struct clk_divider *div;
  317. struct clk_omap_reg *reg;
  318. if (!setup)
  319. return NULL;
  320. div = kzalloc(sizeof(*div), GFP_KERNEL);
  321. if (!div)
  322. return ERR_PTR(-ENOMEM);
  323. reg = (struct clk_omap_reg *)&div->reg;
  324. reg->index = setup->module;
  325. reg->offset = setup->reg;
  326. if (setup->flags & CLKF_INDEX_STARTS_AT_ONE)
  327. div->flags |= CLK_DIVIDER_ONE_BASED;
  328. if (setup->flags & CLKF_INDEX_POWER_OF_TWO)
  329. div->flags |= CLK_DIVIDER_POWER_OF_TWO;
  330. div->table = _get_div_table_from_setup(setup, &div->width);
  331. div->shift = setup->bit_shift;
  332. return &div->hw;
  333. }
  334. struct clk *ti_clk_register_divider(struct ti_clk *setup)
  335. {
  336. struct ti_clk_divider *div;
  337. struct clk_omap_reg *reg_setup;
  338. u32 reg;
  339. u8 width;
  340. u32 flags = 0;
  341. u8 div_flags = 0;
  342. struct clk_div_table *table;
  343. struct clk *clk;
  344. div = setup->data;
  345. reg_setup = (struct clk_omap_reg *)&reg;
  346. reg_setup->index = div->module;
  347. reg_setup->offset = div->reg;
  348. if (div->flags & CLKF_INDEX_STARTS_AT_ONE)
  349. div_flags |= CLK_DIVIDER_ONE_BASED;
  350. if (div->flags & CLKF_INDEX_POWER_OF_TWO)
  351. div_flags |= CLK_DIVIDER_POWER_OF_TWO;
  352. if (div->flags & CLKF_SET_RATE_PARENT)
  353. flags |= CLK_SET_RATE_PARENT;
  354. table = _get_div_table_from_setup(div, &width);
  355. if (IS_ERR(table))
  356. return (struct clk *)table;
  357. clk = _register_divider(NULL, setup->name, div->parent,
  358. flags, (void __iomem *)reg, div->bit_shift,
  359. width, div_flags, table);
  360. if (IS_ERR(clk))
  361. kfree(table);
  362. return clk;
  363. }
  364. static struct clk_div_table *
  365. __init ti_clk_get_div_table(struct device_node *node)
  366. {
  367. struct clk_div_table *table;
  368. const __be32 *divspec;
  369. u32 val;
  370. u32 num_div;
  371. u32 valid_div;
  372. int i;
  373. divspec = of_get_property(node, "ti,dividers", &num_div);
  374. if (!divspec)
  375. return NULL;
  376. num_div /= 4;
  377. valid_div = 0;
  378. /* Determine required size for divider table */
  379. for (i = 0; i < num_div; i++) {
  380. of_property_read_u32_index(node, "ti,dividers", i, &val);
  381. if (val)
  382. valid_div++;
  383. }
  384. if (!valid_div) {
  385. pr_err("no valid dividers for %s table\n", node->name);
  386. return ERR_PTR(-EINVAL);
  387. }
  388. table = kzalloc(sizeof(*table) * (valid_div + 1), GFP_KERNEL);
  389. if (!table)
  390. return ERR_PTR(-ENOMEM);
  391. valid_div = 0;
  392. for (i = 0; i < num_div; i++) {
  393. of_property_read_u32_index(node, "ti,dividers", i, &val);
  394. if (val) {
  395. table[valid_div].div = val;
  396. table[valid_div].val = i;
  397. valid_div++;
  398. }
  399. }
  400. return table;
  401. }
  402. static int _get_divider_width(struct device_node *node,
  403. const struct clk_div_table *table,
  404. u8 flags)
  405. {
  406. u32 min_div;
  407. u32 max_div;
  408. u32 val = 0;
  409. u32 div;
  410. if (!table) {
  411. /* Clk divider table not provided, determine min/max divs */
  412. if (of_property_read_u32(node, "ti,min-div", &min_div))
  413. min_div = 1;
  414. if (of_property_read_u32(node, "ti,max-div", &max_div)) {
  415. pr_err("no max-div for %s!\n", node->name);
  416. return -EINVAL;
  417. }
  418. /* Determine bit width for the field */
  419. if (flags & CLK_DIVIDER_ONE_BASED)
  420. val = 1;
  421. div = min_div;
  422. while (div < max_div) {
  423. if (flags & CLK_DIVIDER_POWER_OF_TWO)
  424. div <<= 1;
  425. else
  426. div++;
  427. val++;
  428. }
  429. } else {
  430. div = 0;
  431. while (table[div].div) {
  432. val = table[div].val;
  433. div++;
  434. }
  435. }
  436. return fls(val);
  437. }
  438. static int __init ti_clk_divider_populate(struct device_node *node,
  439. void __iomem **reg, const struct clk_div_table **table,
  440. u32 *flags, u8 *div_flags, u8 *width, u8 *shift)
  441. {
  442. u32 val;
  443. *reg = ti_clk_get_reg_addr(node, 0);
  444. if (IS_ERR(*reg))
  445. return PTR_ERR(*reg);
  446. if (!of_property_read_u32(node, "ti,bit-shift", &val))
  447. *shift = val;
  448. else
  449. *shift = 0;
  450. *flags = 0;
  451. *div_flags = 0;
  452. if (of_property_read_bool(node, "ti,index-starts-at-one"))
  453. *div_flags |= CLK_DIVIDER_ONE_BASED;
  454. if (of_property_read_bool(node, "ti,index-power-of-two"))
  455. *div_flags |= CLK_DIVIDER_POWER_OF_TWO;
  456. if (of_property_read_bool(node, "ti,set-rate-parent"))
  457. *flags |= CLK_SET_RATE_PARENT;
  458. *table = ti_clk_get_div_table(node);
  459. if (IS_ERR(*table))
  460. return PTR_ERR(*table);
  461. *width = _get_divider_width(node, *table, *div_flags);
  462. return 0;
  463. }
  464. /**
  465. * of_ti_divider_clk_setup - Setup function for simple div rate clock
  466. * @node: device node for this clock
  467. *
  468. * Sets up a basic divider clock.
  469. */
  470. static void __init of_ti_divider_clk_setup(struct device_node *node)
  471. {
  472. struct clk *clk;
  473. const char *parent_name;
  474. void __iomem *reg;
  475. u8 clk_divider_flags = 0;
  476. u8 width = 0;
  477. u8 shift = 0;
  478. const struct clk_div_table *table = NULL;
  479. u32 flags = 0;
  480. parent_name = of_clk_get_parent_name(node, 0);
  481. if (ti_clk_divider_populate(node, &reg, &table, &flags,
  482. &clk_divider_flags, &width, &shift))
  483. goto cleanup;
  484. clk = _register_divider(NULL, node->name, parent_name, flags, reg,
  485. shift, width, clk_divider_flags, table);
  486. if (!IS_ERR(clk)) {
  487. of_clk_add_provider(node, of_clk_src_simple_get, clk);
  488. of_ti_clk_autoidle_setup(node);
  489. return;
  490. }
  491. cleanup:
  492. kfree(table);
  493. }
  494. CLK_OF_DECLARE(divider_clk, "ti,divider-clock", of_ti_divider_clk_setup);
  495. static void __init of_ti_composite_divider_clk_setup(struct device_node *node)
  496. {
  497. struct clk_divider *div;
  498. u32 val;
  499. div = kzalloc(sizeof(*div), GFP_KERNEL);
  500. if (!div)
  501. return;
  502. if (ti_clk_divider_populate(node, &div->reg, &div->table, &val,
  503. &div->flags, &div->width, &div->shift) < 0)
  504. goto cleanup;
  505. if (!ti_clk_add_component(node, &div->hw, CLK_COMPONENT_TYPE_DIVIDER))
  506. return;
  507. cleanup:
  508. kfree(div->table);
  509. kfree(div);
  510. }
  511. CLK_OF_DECLARE(ti_composite_divider_clk, "ti,composite-divider-clock",
  512. of_ti_composite_divider_clk_setup);