xref: /OK3568_Linux_fs/kernel/sound/soc/codecs/rl6231.c (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-only
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun  * rl6231.c - RL6231 class device shared support
4*4882a593Smuzhiyun  *
5*4882a593Smuzhiyun  * Copyright 2014 Realtek Semiconductor Corp.
6*4882a593Smuzhiyun  *
7*4882a593Smuzhiyun  * Author: Oder Chiou <oder_chiou@realtek.com>
8*4882a593Smuzhiyun  */
9*4882a593Smuzhiyun 
10*4882a593Smuzhiyun #include <linux/module.h>
11*4882a593Smuzhiyun #include <linux/regmap.h>
12*4882a593Smuzhiyun 
13*4882a593Smuzhiyun #include <linux/gcd.h>
14*4882a593Smuzhiyun #include "rl6231.h"
15*4882a593Smuzhiyun 
16*4882a593Smuzhiyun /**
17*4882a593Smuzhiyun  * rl6231_get_pre_div - Return the value of pre divider.
18*4882a593Smuzhiyun  *
19*4882a593Smuzhiyun  * @map: map for setting.
20*4882a593Smuzhiyun  * @reg: register.
21*4882a593Smuzhiyun  * @sft: shift.
22*4882a593Smuzhiyun  *
23*4882a593Smuzhiyun  * Return the value of pre divider from given register value.
24*4882a593Smuzhiyun  * Return negative error code for unexpected register value.
25*4882a593Smuzhiyun  */
rl6231_get_pre_div(struct regmap * map,unsigned int reg,int sft)26*4882a593Smuzhiyun int rl6231_get_pre_div(struct regmap *map, unsigned int reg, int sft)
27*4882a593Smuzhiyun {
28*4882a593Smuzhiyun 	int pd, val;
29*4882a593Smuzhiyun 
30*4882a593Smuzhiyun 	regmap_read(map, reg, &val);
31*4882a593Smuzhiyun 
32*4882a593Smuzhiyun 	val = (val >> sft) & 0x7;
33*4882a593Smuzhiyun 
34*4882a593Smuzhiyun 	switch (val) {
35*4882a593Smuzhiyun 	case 0:
36*4882a593Smuzhiyun 	case 1:
37*4882a593Smuzhiyun 	case 2:
38*4882a593Smuzhiyun 	case 3:
39*4882a593Smuzhiyun 		pd = val + 1;
40*4882a593Smuzhiyun 		break;
41*4882a593Smuzhiyun 	case 4:
42*4882a593Smuzhiyun 		pd = 6;
43*4882a593Smuzhiyun 		break;
44*4882a593Smuzhiyun 	case 5:
45*4882a593Smuzhiyun 		pd = 8;
46*4882a593Smuzhiyun 		break;
47*4882a593Smuzhiyun 	case 6:
48*4882a593Smuzhiyun 		pd = 12;
49*4882a593Smuzhiyun 		break;
50*4882a593Smuzhiyun 	case 7:
51*4882a593Smuzhiyun 		pd = 16;
52*4882a593Smuzhiyun 		break;
53*4882a593Smuzhiyun 	default:
54*4882a593Smuzhiyun 		pd = -EINVAL;
55*4882a593Smuzhiyun 		break;
56*4882a593Smuzhiyun 	}
57*4882a593Smuzhiyun 
58*4882a593Smuzhiyun 	return pd;
59*4882a593Smuzhiyun }
60*4882a593Smuzhiyun EXPORT_SYMBOL_GPL(rl6231_get_pre_div);
61*4882a593Smuzhiyun 
62*4882a593Smuzhiyun /**
63*4882a593Smuzhiyun  * rl6231_calc_dmic_clk - Calculate the frequency divider parameter of dmic.
64*4882a593Smuzhiyun  *
65*4882a593Smuzhiyun  * @rate: base clock rate.
66*4882a593Smuzhiyun  *
67*4882a593Smuzhiyun  * Choose divider parameter that gives the highest possible DMIC frequency in
68*4882a593Smuzhiyun  * 1MHz - 3MHz range.
69*4882a593Smuzhiyun  */
rl6231_calc_dmic_clk(int rate)70*4882a593Smuzhiyun int rl6231_calc_dmic_clk(int rate)
71*4882a593Smuzhiyun {
72*4882a593Smuzhiyun 	static const int div[] = {2, 3, 4, 6, 8, 12};
73*4882a593Smuzhiyun 	int i;
74*4882a593Smuzhiyun 
75*4882a593Smuzhiyun 	if (rate < 1000000 * div[0]) {
76*4882a593Smuzhiyun 		pr_warn("Base clock rate %d is too low\n", rate);
77*4882a593Smuzhiyun 		return -EINVAL;
78*4882a593Smuzhiyun 	}
79*4882a593Smuzhiyun 
80*4882a593Smuzhiyun 	for (i = 0; i < ARRAY_SIZE(div); i++) {
81*4882a593Smuzhiyun 		if ((div[i] % 3) == 0)
82*4882a593Smuzhiyun 			continue;
83*4882a593Smuzhiyun 		/* find divider that gives DMIC frequency below 1.536MHz */
84*4882a593Smuzhiyun 		if (1536000 * div[i] >= rate)
85*4882a593Smuzhiyun 			return i;
86*4882a593Smuzhiyun 	}
87*4882a593Smuzhiyun 
88*4882a593Smuzhiyun 	pr_warn("Base clock rate %d is too high\n", rate);
89*4882a593Smuzhiyun 	return -EINVAL;
90*4882a593Smuzhiyun }
91*4882a593Smuzhiyun EXPORT_SYMBOL_GPL(rl6231_calc_dmic_clk);
92*4882a593Smuzhiyun 
93*4882a593Smuzhiyun struct pll_calc_map {
94*4882a593Smuzhiyun 	unsigned int pll_in;
95*4882a593Smuzhiyun 	unsigned int pll_out;
96*4882a593Smuzhiyun 	int k;
97*4882a593Smuzhiyun 	int n;
98*4882a593Smuzhiyun 	int m;
99*4882a593Smuzhiyun 	bool m_bp;
100*4882a593Smuzhiyun 	bool k_bp;
101*4882a593Smuzhiyun };
102*4882a593Smuzhiyun 
103*4882a593Smuzhiyun static const struct pll_calc_map pll_preset_table[] = {
104*4882a593Smuzhiyun 	{19200000,  4096000,  23, 14, 1, false, false},
105*4882a593Smuzhiyun 	{19200000,  24576000,  3, 30, 3, false, false},
106*4882a593Smuzhiyun 	{48000000,  3840000,  23,  2, 0, false, false},
107*4882a593Smuzhiyun 	{3840000,   24576000,  3, 30, 0, true, false},
108*4882a593Smuzhiyun 	{3840000,   22579200,  3,  5, 0, true, false},
109*4882a593Smuzhiyun };
110*4882a593Smuzhiyun 
find_best_div(unsigned int in,unsigned int max,unsigned int div)111*4882a593Smuzhiyun static unsigned int find_best_div(unsigned int in,
112*4882a593Smuzhiyun 	unsigned int max, unsigned int div)
113*4882a593Smuzhiyun {
114*4882a593Smuzhiyun 	unsigned int d;
115*4882a593Smuzhiyun 
116*4882a593Smuzhiyun 	if (in <= max)
117*4882a593Smuzhiyun 		return 1;
118*4882a593Smuzhiyun 
119*4882a593Smuzhiyun 	d = in / max;
120*4882a593Smuzhiyun 	if (in % max)
121*4882a593Smuzhiyun 		d++;
122*4882a593Smuzhiyun 
123*4882a593Smuzhiyun 	while (div % d != 0)
124*4882a593Smuzhiyun 		d++;
125*4882a593Smuzhiyun 
126*4882a593Smuzhiyun 
127*4882a593Smuzhiyun 	return d;
128*4882a593Smuzhiyun }
129*4882a593Smuzhiyun 
130*4882a593Smuzhiyun /**
131*4882a593Smuzhiyun  * rl6231_pll_calc - Calcualte PLL M/N/K code.
132*4882a593Smuzhiyun  * @freq_in: external clock provided to codec.
133*4882a593Smuzhiyun  * @freq_out: target clock which codec works on.
134*4882a593Smuzhiyun  * @pll_code: Pointer to structure with M, N, K, m_bypass and k_bypass flag.
135*4882a593Smuzhiyun  *
136*4882a593Smuzhiyun  * Calcualte M/N/K code to configure PLL for codec.
137*4882a593Smuzhiyun  *
138*4882a593Smuzhiyun  * Returns 0 for success or negative error code.
139*4882a593Smuzhiyun  */
rl6231_pll_calc(const unsigned int freq_in,const unsigned int freq_out,struct rl6231_pll_code * pll_code)140*4882a593Smuzhiyun int rl6231_pll_calc(const unsigned int freq_in,
141*4882a593Smuzhiyun 	const unsigned int freq_out, struct rl6231_pll_code *pll_code)
142*4882a593Smuzhiyun {
143*4882a593Smuzhiyun 	int max_n = RL6231_PLL_N_MAX, max_m = RL6231_PLL_M_MAX;
144*4882a593Smuzhiyun 	int i, k, n_t;
145*4882a593Smuzhiyun 	int k_t, min_k, max_k, n = 0, m = 0, m_t = 0;
146*4882a593Smuzhiyun 	unsigned int red, pll_out, in_t, out_t, div, div_t;
147*4882a593Smuzhiyun 	unsigned int red_t = abs(freq_out - freq_in);
148*4882a593Smuzhiyun 	unsigned int f_in, f_out, f_max;
149*4882a593Smuzhiyun 	bool m_bypass = false, k_bypass = false;
150*4882a593Smuzhiyun 
151*4882a593Smuzhiyun 	if (RL6231_PLL_INP_MAX < freq_in || RL6231_PLL_INP_MIN > freq_in)
152*4882a593Smuzhiyun 		return -EINVAL;
153*4882a593Smuzhiyun 
154*4882a593Smuzhiyun 	for (i = 0; i < ARRAY_SIZE(pll_preset_table); i++) {
155*4882a593Smuzhiyun 		if (freq_in == pll_preset_table[i].pll_in &&
156*4882a593Smuzhiyun 			freq_out == pll_preset_table[i].pll_out) {
157*4882a593Smuzhiyun 			k = pll_preset_table[i].k;
158*4882a593Smuzhiyun 			m = pll_preset_table[i].m;
159*4882a593Smuzhiyun 			n = pll_preset_table[i].n;
160*4882a593Smuzhiyun 			m_bypass = pll_preset_table[i].m_bp;
161*4882a593Smuzhiyun 			k_bypass = pll_preset_table[i].k_bp;
162*4882a593Smuzhiyun 			pr_debug("Use preset PLL parameter table\n");
163*4882a593Smuzhiyun 			goto code_find;
164*4882a593Smuzhiyun 		}
165*4882a593Smuzhiyun 	}
166*4882a593Smuzhiyun 
167*4882a593Smuzhiyun 	min_k = 80000000 / freq_out - 2;
168*4882a593Smuzhiyun 	max_k = 150000000 / freq_out - 2;
169*4882a593Smuzhiyun 	if (max_k > RL6231_PLL_K_MAX)
170*4882a593Smuzhiyun 		max_k = RL6231_PLL_K_MAX;
171*4882a593Smuzhiyun 	if (min_k > RL6231_PLL_K_MAX)
172*4882a593Smuzhiyun 		min_k = max_k = RL6231_PLL_K_MAX;
173*4882a593Smuzhiyun 	div_t = gcd(freq_in, freq_out);
174*4882a593Smuzhiyun 	f_max = 0xffffffff / RL6231_PLL_N_MAX;
175*4882a593Smuzhiyun 	div = find_best_div(freq_in, f_max, div_t);
176*4882a593Smuzhiyun 	f_in = freq_in / div;
177*4882a593Smuzhiyun 	f_out = freq_out / div;
178*4882a593Smuzhiyun 	k = min_k;
179*4882a593Smuzhiyun 	if (min_k < -1)
180*4882a593Smuzhiyun 		min_k = -1;
181*4882a593Smuzhiyun 	for (k_t = min_k; k_t <= max_k; k_t++) {
182*4882a593Smuzhiyun 		for (n_t = 0; n_t <= max_n; n_t++) {
183*4882a593Smuzhiyun 			in_t = f_in * (n_t + 2);
184*4882a593Smuzhiyun 			pll_out = f_out * (k_t + 2);
185*4882a593Smuzhiyun 			if (in_t == pll_out) {
186*4882a593Smuzhiyun 				m_bypass = true;
187*4882a593Smuzhiyun 				n = n_t;
188*4882a593Smuzhiyun 				k = k_t;
189*4882a593Smuzhiyun 				goto code_find;
190*4882a593Smuzhiyun 			}
191*4882a593Smuzhiyun 			out_t = in_t / (k_t + 2);
192*4882a593Smuzhiyun 			red = abs(f_out - out_t);
193*4882a593Smuzhiyun 			if (red < red_t) {
194*4882a593Smuzhiyun 				m_bypass = true;
195*4882a593Smuzhiyun 				n = n_t;
196*4882a593Smuzhiyun 				m = 0;
197*4882a593Smuzhiyun 				k = k_t;
198*4882a593Smuzhiyun 				if (red == 0)
199*4882a593Smuzhiyun 					goto code_find;
200*4882a593Smuzhiyun 				red_t = red;
201*4882a593Smuzhiyun 			}
202*4882a593Smuzhiyun 			for (m_t = 0; m_t <= max_m; m_t++) {
203*4882a593Smuzhiyun 				out_t = in_t / ((m_t + 2) * (k_t + 2));
204*4882a593Smuzhiyun 				red = abs(f_out - out_t);
205*4882a593Smuzhiyun 				if (red < red_t) {
206*4882a593Smuzhiyun 					m_bypass = false;
207*4882a593Smuzhiyun 					n = n_t;
208*4882a593Smuzhiyun 					m = m_t;
209*4882a593Smuzhiyun 					k = k_t;
210*4882a593Smuzhiyun 					if (red == 0)
211*4882a593Smuzhiyun 						goto code_find;
212*4882a593Smuzhiyun 					red_t = red;
213*4882a593Smuzhiyun 				}
214*4882a593Smuzhiyun 			}
215*4882a593Smuzhiyun 		}
216*4882a593Smuzhiyun 	}
217*4882a593Smuzhiyun 	pr_debug("Only get approximation about PLL\n");
218*4882a593Smuzhiyun 
219*4882a593Smuzhiyun code_find:
220*4882a593Smuzhiyun 	if (k == -1) {
221*4882a593Smuzhiyun 		k_bypass = true;
222*4882a593Smuzhiyun 		k = 0;
223*4882a593Smuzhiyun 	}
224*4882a593Smuzhiyun 
225*4882a593Smuzhiyun 	pll_code->m_bp = m_bypass;
226*4882a593Smuzhiyun 	pll_code->k_bp = k_bypass;
227*4882a593Smuzhiyun 	pll_code->m_code = m;
228*4882a593Smuzhiyun 	pll_code->n_code = n;
229*4882a593Smuzhiyun 	pll_code->k_code = k;
230*4882a593Smuzhiyun 	return 0;
231*4882a593Smuzhiyun }
232*4882a593Smuzhiyun EXPORT_SYMBOL_GPL(rl6231_pll_calc);
233*4882a593Smuzhiyun 
rl6231_get_clk_info(int sclk,int rate)234*4882a593Smuzhiyun int rl6231_get_clk_info(int sclk, int rate)
235*4882a593Smuzhiyun {
236*4882a593Smuzhiyun 	int i;
237*4882a593Smuzhiyun 	static const int pd[] = {1, 2, 3, 4, 6, 8, 12, 16};
238*4882a593Smuzhiyun 
239*4882a593Smuzhiyun 	if (sclk <= 0 || rate <= 0)
240*4882a593Smuzhiyun 		return -EINVAL;
241*4882a593Smuzhiyun 
242*4882a593Smuzhiyun 	rate = rate << 8;
243*4882a593Smuzhiyun 	for (i = 0; i < ARRAY_SIZE(pd); i++)
244*4882a593Smuzhiyun 		if (sclk == rate * pd[i])
245*4882a593Smuzhiyun 			return i;
246*4882a593Smuzhiyun 
247*4882a593Smuzhiyun 	return -EINVAL;
248*4882a593Smuzhiyun }
249*4882a593Smuzhiyun EXPORT_SYMBOL_GPL(rl6231_get_clk_info);
250*4882a593Smuzhiyun 
251*4882a593Smuzhiyun MODULE_DESCRIPTION("RL6231 class device shared support");
252*4882a593Smuzhiyun MODULE_AUTHOR("Oder Chiou <oder_chiou@realtek.com>");
253*4882a593Smuzhiyun MODULE_LICENSE("GPL v2");
254