icst.c 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * linux/arch/arm/common/icst307.c
  4. *
  5. * Copyright (C) 2003 Deep Blue Solutions, Ltd, All Rights Reserved.
  6. *
  7. * Support functions for calculating clocks/divisors for the ICST307
  8. * clock generators. See https://www.idt.com/ for more information
  9. * on these devices.
  10. *
  11. * This is an almost identical implementation to the ICST525 clock generator.
  12. * The s2div and idx2s files are different
  13. */
  14. #include <linux/module.h>
  15. #include <linux/kernel.h>
  16. #include <asm/div64.h>
  17. #include "icst.h"
  18. /*
  19. * Divisors for each OD setting.
  20. */
  21. const unsigned char icst307_s2div[8] = { 10, 2, 8, 4, 5, 7, 3, 6 };
  22. const unsigned char icst525_s2div[8] = { 10, 2, 8, 4, 5, 7, 9, 6 };
  23. EXPORT_SYMBOL(icst307_s2div);
  24. EXPORT_SYMBOL(icst525_s2div);
  25. unsigned long icst_hz(const struct icst_params *p, struct icst_vco vco)
  26. {
  27. u64 dividend = p->ref * 2 * (u64)(vco.v + 8);
  28. u32 divisor = (vco.r + 2) * p->s2div[vco.s];
  29. do_div(dividend, divisor);
  30. return (unsigned long)dividend;
  31. }
  32. EXPORT_SYMBOL(icst_hz);
  33. /*
  34. * Ascending divisor S values.
  35. */
  36. const unsigned char icst307_idx2s[8] = { 1, 6, 3, 4, 7, 5, 2, 0 };
  37. const unsigned char icst525_idx2s[8] = { 1, 3, 4, 7, 5, 2, 6, 0 };
  38. EXPORT_SYMBOL(icst307_idx2s);
  39. EXPORT_SYMBOL(icst525_idx2s);
  40. struct icst_vco
  41. icst_hz_to_vco(const struct icst_params *p, unsigned long freq)
  42. {
  43. struct icst_vco vco = { .s = 1, .v = p->vd_max, .r = p->rd_max };
  44. unsigned long f;
  45. unsigned int i = 0, rd, best = (unsigned int)-1;
  46. /*
  47. * First, find the PLL output divisor such
  48. * that the PLL output is within spec.
  49. */
  50. do {
  51. f = freq * p->s2div[p->idx2s[i]];
  52. if (f > p->vco_min && f <= p->vco_max)
  53. break;
  54. i++;
  55. } while (i < 8);
  56. if (i >= 8)
  57. return vco;
  58. vco.s = p->idx2s[i];
  59. /*
  60. * Now find the closest divisor combination
  61. * which gives a PLL output of 'f'.
  62. */
  63. for (rd = p->rd_min; rd <= p->rd_max; rd++) {
  64. unsigned long fref_div, f_pll;
  65. unsigned int vd;
  66. int f_diff;
  67. fref_div = (2 * p->ref) / rd;
  68. vd = (f + fref_div / 2) / fref_div;
  69. if (vd < p->vd_min || vd > p->vd_max)
  70. continue;
  71. f_pll = fref_div * vd;
  72. f_diff = f_pll - f;
  73. if (f_diff < 0)
  74. f_diff = -f_diff;
  75. if ((unsigned)f_diff < best) {
  76. vco.v = vd - 8;
  77. vco.r = rd - 2;
  78. if (f_diff == 0)
  79. break;
  80. best = f_diff;
  81. }
  82. }
  83. return vco;
  84. }
  85. EXPORT_SYMBOL(icst_hz_to_vco);