divider.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655
  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_omap_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_omap_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_omap_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_omap_divider *divider = to_clk_omap_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_omap_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_omap_divider *divider = to_clk_omap_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_omap_divider *divider;
  206. unsigned int div, value;
  207. u32 val;
  208. if (!hw || !rate)
  209. return -EINVAL;
  210. divider = to_clk_omap_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,
  233. struct clk_omap_reg *reg,
  234. u8 shift, u8 width, u8 clk_divider_flags,
  235. const struct clk_div_table *table)
  236. {
  237. struct clk_omap_divider *div;
  238. struct clk *clk;
  239. struct clk_init_data init;
  240. if (clk_divider_flags & CLK_DIVIDER_HIWORD_MASK) {
  241. if (width + shift > 16) {
  242. pr_warn("divider value exceeds LOWORD field\n");
  243. return ERR_PTR(-EINVAL);
  244. }
  245. }
  246. /* allocate the divider */
  247. div = kzalloc(sizeof(*div), GFP_KERNEL);
  248. if (!div) {
  249. pr_err("%s: could not allocate divider clk\n", __func__);
  250. return ERR_PTR(-ENOMEM);
  251. }
  252. init.name = name;
  253. init.ops = &ti_clk_divider_ops;
  254. init.flags = flags | CLK_IS_BASIC;
  255. init.parent_names = (parent_name ? &parent_name : NULL);
  256. init.num_parents = (parent_name ? 1 : 0);
  257. /* struct clk_divider assignments */
  258. memcpy(&div->reg, reg, sizeof(*reg));
  259. div->shift = shift;
  260. div->width = width;
  261. div->flags = clk_divider_flags;
  262. div->hw.init = &init;
  263. div->table = table;
  264. /* register the clock */
  265. clk = ti_clk_register(dev, &div->hw, name);
  266. if (IS_ERR(clk))
  267. kfree(div);
  268. return clk;
  269. }
  270. int ti_clk_parse_divider_data(int *div_table, int num_dividers, int max_div,
  271. u8 flags, u8 *width,
  272. const struct clk_div_table **table)
  273. {
  274. int valid_div = 0;
  275. u32 val;
  276. int div;
  277. int i;
  278. struct clk_div_table *tmp;
  279. if (!div_table) {
  280. if (flags & CLKF_INDEX_STARTS_AT_ONE)
  281. val = 1;
  282. else
  283. val = 0;
  284. div = 1;
  285. while (div < max_div) {
  286. if (flags & CLKF_INDEX_POWER_OF_TWO)
  287. div <<= 1;
  288. else
  289. div++;
  290. val++;
  291. }
  292. *width = fls(val);
  293. *table = NULL;
  294. return 0;
  295. }
  296. i = 0;
  297. while (!num_dividers || i < num_dividers) {
  298. if (div_table[i] == -1)
  299. break;
  300. if (div_table[i])
  301. valid_div++;
  302. i++;
  303. }
  304. num_dividers = i;
  305. tmp = kzalloc(sizeof(*tmp) * (valid_div + 1), GFP_KERNEL);
  306. if (!tmp)
  307. return -ENOMEM;
  308. valid_div = 0;
  309. *width = 0;
  310. for (i = 0; i < num_dividers; i++)
  311. if (div_table[i] > 0) {
  312. tmp[valid_div].div = div_table[i];
  313. tmp[valid_div].val = i;
  314. valid_div++;
  315. *width = i;
  316. }
  317. *width = fls(*width);
  318. *table = tmp;
  319. return 0;
  320. }
  321. static const struct clk_div_table *
  322. _get_div_table_from_setup(struct ti_clk_divider *setup, u8 *width)
  323. {
  324. const struct clk_div_table *table = NULL;
  325. ti_clk_parse_divider_data(setup->dividers, setup->num_dividers,
  326. setup->max_div, setup->flags, width,
  327. &table);
  328. return table;
  329. }
  330. struct clk_hw *ti_clk_build_component_div(struct ti_clk_divider *setup)
  331. {
  332. struct clk_omap_divider *div;
  333. struct clk_omap_reg *reg;
  334. if (!setup)
  335. return NULL;
  336. div = kzalloc(sizeof(*div), GFP_KERNEL);
  337. if (!div)
  338. return ERR_PTR(-ENOMEM);
  339. reg = (struct clk_omap_reg *)&div->reg;
  340. reg->index = setup->module;
  341. reg->offset = setup->reg;
  342. if (setup->flags & CLKF_INDEX_STARTS_AT_ONE)
  343. div->flags |= CLK_DIVIDER_ONE_BASED;
  344. if (setup->flags & CLKF_INDEX_POWER_OF_TWO)
  345. div->flags |= CLK_DIVIDER_POWER_OF_TWO;
  346. div->table = _get_div_table_from_setup(setup, &div->width);
  347. div->shift = setup->bit_shift;
  348. return &div->hw;
  349. }
  350. struct clk *ti_clk_register_divider(struct ti_clk *setup)
  351. {
  352. struct ti_clk_divider *div = setup->data;
  353. struct clk_omap_reg reg = {
  354. .index = div->module,
  355. .offset = div->reg,
  356. };
  357. u8 width;
  358. u32 flags = 0;
  359. u8 div_flags = 0;
  360. const struct clk_div_table *table;
  361. struct clk *clk;
  362. if (div->flags & CLKF_INDEX_STARTS_AT_ONE)
  363. div_flags |= CLK_DIVIDER_ONE_BASED;
  364. if (div->flags & CLKF_INDEX_POWER_OF_TWO)
  365. div_flags |= CLK_DIVIDER_POWER_OF_TWO;
  366. if (div->flags & CLKF_SET_RATE_PARENT)
  367. flags |= CLK_SET_RATE_PARENT;
  368. table = _get_div_table_from_setup(div, &width);
  369. if (IS_ERR(table))
  370. return (struct clk *)table;
  371. clk = _register_divider(NULL, setup->name, div->parent,
  372. flags, &reg, div->bit_shift,
  373. width, div_flags, table);
  374. if (IS_ERR(clk))
  375. kfree(table);
  376. return clk;
  377. }
  378. static struct clk_div_table *
  379. __init ti_clk_get_div_table(struct device_node *node)
  380. {
  381. struct clk_div_table *table;
  382. const __be32 *divspec;
  383. u32 val;
  384. u32 num_div;
  385. u32 valid_div;
  386. int i;
  387. divspec = of_get_property(node, "ti,dividers", &num_div);
  388. if (!divspec)
  389. return NULL;
  390. num_div /= 4;
  391. valid_div = 0;
  392. /* Determine required size for divider table */
  393. for (i = 0; i < num_div; i++) {
  394. of_property_read_u32_index(node, "ti,dividers", i, &val);
  395. if (val)
  396. valid_div++;
  397. }
  398. if (!valid_div) {
  399. pr_err("no valid dividers for %s table\n", node->name);
  400. return ERR_PTR(-EINVAL);
  401. }
  402. table = kzalloc(sizeof(*table) * (valid_div + 1), GFP_KERNEL);
  403. if (!table)
  404. return ERR_PTR(-ENOMEM);
  405. valid_div = 0;
  406. for (i = 0; i < num_div; i++) {
  407. of_property_read_u32_index(node, "ti,dividers", i, &val);
  408. if (val) {
  409. table[valid_div].div = val;
  410. table[valid_div].val = i;
  411. valid_div++;
  412. }
  413. }
  414. return table;
  415. }
  416. static int _get_divider_width(struct device_node *node,
  417. const struct clk_div_table *table,
  418. u8 flags)
  419. {
  420. u32 min_div;
  421. u32 max_div;
  422. u32 val = 0;
  423. u32 div;
  424. if (!table) {
  425. /* Clk divider table not provided, determine min/max divs */
  426. if (of_property_read_u32(node, "ti,min-div", &min_div))
  427. min_div = 1;
  428. if (of_property_read_u32(node, "ti,max-div", &max_div)) {
  429. pr_err("no max-div for %s!\n", node->name);
  430. return -EINVAL;
  431. }
  432. /* Determine bit width for the field */
  433. if (flags & CLK_DIVIDER_ONE_BASED)
  434. val = 1;
  435. div = min_div;
  436. while (div < max_div) {
  437. if (flags & CLK_DIVIDER_POWER_OF_TWO)
  438. div <<= 1;
  439. else
  440. div++;
  441. val++;
  442. }
  443. } else {
  444. div = 0;
  445. while (table[div].div) {
  446. val = table[div].val;
  447. div++;
  448. }
  449. }
  450. return fls(val);
  451. }
  452. static int __init ti_clk_divider_populate(struct device_node *node,
  453. struct clk_omap_reg *reg, const struct clk_div_table **table,
  454. u32 *flags, u8 *div_flags, u8 *width, u8 *shift)
  455. {
  456. u32 val;
  457. int ret;
  458. ret = ti_clk_get_reg_addr(node, 0, reg);
  459. if (ret)
  460. return ret;
  461. if (!of_property_read_u32(node, "ti,bit-shift", &val))
  462. *shift = val;
  463. else
  464. *shift = 0;
  465. *flags = 0;
  466. *div_flags = 0;
  467. if (of_property_read_bool(node, "ti,index-starts-at-one"))
  468. *div_flags |= CLK_DIVIDER_ONE_BASED;
  469. if (of_property_read_bool(node, "ti,index-power-of-two"))
  470. *div_flags |= CLK_DIVIDER_POWER_OF_TWO;
  471. if (of_property_read_bool(node, "ti,set-rate-parent"))
  472. *flags |= CLK_SET_RATE_PARENT;
  473. *table = ti_clk_get_div_table(node);
  474. if (IS_ERR(*table))
  475. return PTR_ERR(*table);
  476. *width = _get_divider_width(node, *table, *div_flags);
  477. return 0;
  478. }
  479. /**
  480. * of_ti_divider_clk_setup - Setup function for simple div rate clock
  481. * @node: device node for this clock
  482. *
  483. * Sets up a basic divider clock.
  484. */
  485. static void __init of_ti_divider_clk_setup(struct device_node *node)
  486. {
  487. struct clk *clk;
  488. const char *parent_name;
  489. struct clk_omap_reg reg;
  490. u8 clk_divider_flags = 0;
  491. u8 width = 0;
  492. u8 shift = 0;
  493. const struct clk_div_table *table = NULL;
  494. u32 flags = 0;
  495. parent_name = of_clk_get_parent_name(node, 0);
  496. if (ti_clk_divider_populate(node, &reg, &table, &flags,
  497. &clk_divider_flags, &width, &shift))
  498. goto cleanup;
  499. clk = _register_divider(NULL, node->name, parent_name, flags, &reg,
  500. shift, width, clk_divider_flags, table);
  501. if (!IS_ERR(clk)) {
  502. of_clk_add_provider(node, of_clk_src_simple_get, clk);
  503. of_ti_clk_autoidle_setup(node);
  504. return;
  505. }
  506. cleanup:
  507. kfree(table);
  508. }
  509. CLK_OF_DECLARE(divider_clk, "ti,divider-clock", of_ti_divider_clk_setup);
  510. static void __init of_ti_composite_divider_clk_setup(struct device_node *node)
  511. {
  512. struct clk_omap_divider *div;
  513. u32 val;
  514. div = kzalloc(sizeof(*div), GFP_KERNEL);
  515. if (!div)
  516. return;
  517. if (ti_clk_divider_populate(node, &div->reg, &div->table, &val,
  518. &div->flags, &div->width, &div->shift) < 0)
  519. goto cleanup;
  520. if (!ti_clk_add_component(node, &div->hw, CLK_COMPONENT_TYPE_DIVIDER))
  521. return;
  522. cleanup:
  523. kfree(div->table);
  524. kfree(div);
  525. }
  526. CLK_OF_DECLARE(ti_composite_divider_clk, "ti,composite-divider-clock",
  527. of_ti_composite_divider_clk_setup);