k210_pll.c 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (C) 2020 Sean Anderson <seanga2@gmail.com>
  4. */
  5. #include <common.h>
  6. /* For DIV_ROUND_DOWN_ULL, defined in linux/kernel.h */
  7. #include <div64.h>
  8. #include <dm/test.h>
  9. #include <k210/pll.h>
  10. #include <test/ut.h>
  11. static int dm_test_k210_pll_calc_config(u32 rate, u32 rate_in,
  12. struct k210_pll_config *best)
  13. {
  14. u64 f, r, od, max_r, inv_ratio;
  15. s64 error, best_error;
  16. best_error = S64_MAX;
  17. error = best_error;
  18. max_r = min(16ULL, DIV_ROUND_DOWN_ULL(rate_in, 13300000));
  19. inv_ratio = DIV_ROUND_CLOSEST_ULL((u64)rate_in << 32, rate);
  20. /* Brute force it */
  21. for (r = 1; r <= max_r; r++) {
  22. for (f = 1; f <= 64; f++) {
  23. for (od = 1; od <= 16; od++) {
  24. u64 vco = DIV_ROUND_CLOSEST_ULL(rate_in * f, r);
  25. if (vco > 1750000000 || vco < 340000000)
  26. continue;
  27. error = DIV_ROUND_CLOSEST_ULL(f * inv_ratio,
  28. r * od);
  29. /* The lower 16 bits are spurious */
  30. error = abs64((error - BIT_ULL(32))) >> 16;
  31. if (error < best_error) {
  32. best->r = r;
  33. best->f = f;
  34. best->od = od;
  35. best_error = error;
  36. }
  37. }
  38. }
  39. }
  40. if (best_error == S64_MAX)
  41. return -EINVAL;
  42. return 0;
  43. }
  44. static int dm_test_k210_pll_compare(struct k210_pll_config *ours,
  45. struct k210_pll_config *theirs)
  46. {
  47. return (u32)ours->f * theirs->r * theirs->od !=
  48. (u32)theirs->f * ours->r * ours->od;
  49. }
  50. static int dm_test_k210_pll(struct unit_test_state *uts)
  51. {
  52. struct k210_pll_config ours, theirs;
  53. /* General range checks */
  54. ut_asserteq(-EINVAL, k210_pll_calc_config(0, 26000000, &theirs));
  55. ut_asserteq(-EINVAL, k210_pll_calc_config(390000000, 0, &theirs));
  56. ut_asserteq(-EINVAL, k210_pll_calc_config(2000000000, 26000000,
  57. &theirs));
  58. ut_asserteq(-EINVAL, k210_pll_calc_config(390000000, 2000000000,
  59. &theirs));
  60. ut_asserteq(-EINVAL, k210_pll_calc_config(1500000000, 20000000,
  61. &theirs));
  62. ut_asserteq(-EINVAL, k210_pll_calc_config(1750000000, 13300000,
  63. &theirs));
  64. /* Verify we get the same output with brute-force */
  65. #define compare(rate, rate_in) do { \
  66. ut_assertok(dm_test_k210_pll_calc_config(rate, rate_in, &ours)); \
  67. ut_assertok(k210_pll_calc_config(rate, rate_in, &theirs)); \
  68. ut_assertok(dm_test_k210_pll_compare(&ours, &theirs)); \
  69. } while (0)
  70. compare(390000000, 26000000);
  71. compare(26000000, 390000000);
  72. compare(400000000, 26000000);
  73. compare(27000000, 26000000);
  74. compare(26000000, 27000000);
  75. compare(13300000 * 64, 13300000);
  76. compare(21250000, 21250000 * 70);
  77. compare(21250000, 1750000000);
  78. compare(1750000000, 1750000000);
  79. return 0;
  80. }
  81. DM_TEST(dm_test_k210_pll, 0);