divider.c 12 KB

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