xref: /OK3568_Linux_fs/kernel/drivers/clk/ti/clkt_dpll.c (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-only
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun  * OMAP2/3/4 DPLL clock functions
4*4882a593Smuzhiyun  *
5*4882a593Smuzhiyun  * Copyright (C) 2005-2008 Texas Instruments, Inc.
6*4882a593Smuzhiyun  * Copyright (C) 2004-2010 Nokia Corporation
7*4882a593Smuzhiyun  *
8*4882a593Smuzhiyun  * Contacts:
9*4882a593Smuzhiyun  * Richard Woodruff <r-woodruff2@ti.com>
10*4882a593Smuzhiyun  * Paul Walmsley
11*4882a593Smuzhiyun  */
12*4882a593Smuzhiyun #undef DEBUG
13*4882a593Smuzhiyun 
14*4882a593Smuzhiyun #include <linux/kernel.h>
15*4882a593Smuzhiyun #include <linux/errno.h>
16*4882a593Smuzhiyun #include <linux/clk.h>
17*4882a593Smuzhiyun #include <linux/clk-provider.h>
18*4882a593Smuzhiyun #include <linux/io.h>
19*4882a593Smuzhiyun #include <linux/clk/ti.h>
20*4882a593Smuzhiyun 
21*4882a593Smuzhiyun #include <asm/div64.h>
22*4882a593Smuzhiyun 
23*4882a593Smuzhiyun #include "clock.h"
24*4882a593Smuzhiyun 
25*4882a593Smuzhiyun /* DPLL rate rounding: minimum DPLL multiplier, divider values */
26*4882a593Smuzhiyun #define DPLL_MIN_MULTIPLIER		2
27*4882a593Smuzhiyun #define DPLL_MIN_DIVIDER		1
28*4882a593Smuzhiyun 
29*4882a593Smuzhiyun /* Possible error results from _dpll_test_mult */
30*4882a593Smuzhiyun #define DPLL_MULT_UNDERFLOW		-1
31*4882a593Smuzhiyun 
32*4882a593Smuzhiyun /*
33*4882a593Smuzhiyun  * Scale factor to mitigate roundoff errors in DPLL rate rounding.
34*4882a593Smuzhiyun  * The higher the scale factor, the greater the risk of arithmetic overflow,
35*4882a593Smuzhiyun  * but the closer the rounded rate to the target rate.  DPLL_SCALE_FACTOR
36*4882a593Smuzhiyun  * must be a power of DPLL_SCALE_BASE.
37*4882a593Smuzhiyun  */
38*4882a593Smuzhiyun #define DPLL_SCALE_FACTOR		64
39*4882a593Smuzhiyun #define DPLL_SCALE_BASE			2
40*4882a593Smuzhiyun #define DPLL_ROUNDING_VAL		((DPLL_SCALE_BASE / 2) * \
41*4882a593Smuzhiyun 					 (DPLL_SCALE_FACTOR / DPLL_SCALE_BASE))
42*4882a593Smuzhiyun 
43*4882a593Smuzhiyun /*
44*4882a593Smuzhiyun  * DPLL valid Fint frequency range for OMAP36xx and OMAP4xxx.
45*4882a593Smuzhiyun  * From device data manual section 4.3 "DPLL and DLL Specifications".
46*4882a593Smuzhiyun  */
47*4882a593Smuzhiyun #define OMAP3PLUS_DPLL_FINT_JTYPE_MIN	500000
48*4882a593Smuzhiyun #define OMAP3PLUS_DPLL_FINT_JTYPE_MAX	2500000
49*4882a593Smuzhiyun 
50*4882a593Smuzhiyun /* _dpll_test_fint() return codes */
51*4882a593Smuzhiyun #define DPLL_FINT_UNDERFLOW		-1
52*4882a593Smuzhiyun #define DPLL_FINT_INVALID		-2
53*4882a593Smuzhiyun 
54*4882a593Smuzhiyun /* Private functions */
55*4882a593Smuzhiyun 
56*4882a593Smuzhiyun /*
57*4882a593Smuzhiyun  * _dpll_test_fint - test whether an Fint value is valid for the DPLL
58*4882a593Smuzhiyun  * @clk: DPLL struct clk to test
59*4882a593Smuzhiyun  * @n: divider value (N) to test
60*4882a593Smuzhiyun  *
61*4882a593Smuzhiyun  * Tests whether a particular divider @n will result in a valid DPLL
62*4882a593Smuzhiyun  * internal clock frequency Fint. See the 34xx TRM 4.7.6.2 "DPLL Jitter
63*4882a593Smuzhiyun  * Correction".  Returns 0 if OK, -1 if the enclosing loop can terminate
64*4882a593Smuzhiyun  * (assuming that it is counting N upwards), or -2 if the enclosing loop
65*4882a593Smuzhiyun  * should skip to the next iteration (again assuming N is increasing).
66*4882a593Smuzhiyun  */
_dpll_test_fint(struct clk_hw_omap * clk,unsigned int n)67*4882a593Smuzhiyun static int _dpll_test_fint(struct clk_hw_omap *clk, unsigned int n)
68*4882a593Smuzhiyun {
69*4882a593Smuzhiyun 	struct dpll_data *dd;
70*4882a593Smuzhiyun 	long fint, fint_min, fint_max;
71*4882a593Smuzhiyun 	int ret = 0;
72*4882a593Smuzhiyun 
73*4882a593Smuzhiyun 	dd = clk->dpll_data;
74*4882a593Smuzhiyun 
75*4882a593Smuzhiyun 	/* DPLL divider must result in a valid jitter correction val */
76*4882a593Smuzhiyun 	fint = clk_hw_get_rate(clk_hw_get_parent(&clk->hw)) / n;
77*4882a593Smuzhiyun 
78*4882a593Smuzhiyun 	if (dd->flags & DPLL_J_TYPE) {
79*4882a593Smuzhiyun 		fint_min = OMAP3PLUS_DPLL_FINT_JTYPE_MIN;
80*4882a593Smuzhiyun 		fint_max = OMAP3PLUS_DPLL_FINT_JTYPE_MAX;
81*4882a593Smuzhiyun 	} else {
82*4882a593Smuzhiyun 		fint_min = ti_clk_get_features()->fint_min;
83*4882a593Smuzhiyun 		fint_max = ti_clk_get_features()->fint_max;
84*4882a593Smuzhiyun 	}
85*4882a593Smuzhiyun 
86*4882a593Smuzhiyun 	if (!fint_min || !fint_max) {
87*4882a593Smuzhiyun 		WARN(1, "No fint limits available!\n");
88*4882a593Smuzhiyun 		return DPLL_FINT_INVALID;
89*4882a593Smuzhiyun 	}
90*4882a593Smuzhiyun 
91*4882a593Smuzhiyun 	if (fint < ti_clk_get_features()->fint_min) {
92*4882a593Smuzhiyun 		pr_debug("rejecting n=%d due to Fint failure, lowering max_divider\n",
93*4882a593Smuzhiyun 			 n);
94*4882a593Smuzhiyun 		dd->max_divider = n;
95*4882a593Smuzhiyun 		ret = DPLL_FINT_UNDERFLOW;
96*4882a593Smuzhiyun 	} else if (fint > ti_clk_get_features()->fint_max) {
97*4882a593Smuzhiyun 		pr_debug("rejecting n=%d due to Fint failure, boosting min_divider\n",
98*4882a593Smuzhiyun 			 n);
99*4882a593Smuzhiyun 		dd->min_divider = n;
100*4882a593Smuzhiyun 		ret = DPLL_FINT_INVALID;
101*4882a593Smuzhiyun 	} else if (fint > ti_clk_get_features()->fint_band1_max &&
102*4882a593Smuzhiyun 		   fint < ti_clk_get_features()->fint_band2_min) {
103*4882a593Smuzhiyun 		pr_debug("rejecting n=%d due to Fint failure\n", n);
104*4882a593Smuzhiyun 		ret = DPLL_FINT_INVALID;
105*4882a593Smuzhiyun 	}
106*4882a593Smuzhiyun 
107*4882a593Smuzhiyun 	return ret;
108*4882a593Smuzhiyun }
109*4882a593Smuzhiyun 
_dpll_compute_new_rate(unsigned long parent_rate,unsigned int m,unsigned int n)110*4882a593Smuzhiyun static unsigned long _dpll_compute_new_rate(unsigned long parent_rate,
111*4882a593Smuzhiyun 					    unsigned int m, unsigned int n)
112*4882a593Smuzhiyun {
113*4882a593Smuzhiyun 	unsigned long long num;
114*4882a593Smuzhiyun 
115*4882a593Smuzhiyun 	num = (unsigned long long)parent_rate * m;
116*4882a593Smuzhiyun 	do_div(num, n);
117*4882a593Smuzhiyun 	return num;
118*4882a593Smuzhiyun }
119*4882a593Smuzhiyun 
120*4882a593Smuzhiyun /*
121*4882a593Smuzhiyun  * _dpll_test_mult - test a DPLL multiplier value
122*4882a593Smuzhiyun  * @m: pointer to the DPLL m (multiplier) value under test
123*4882a593Smuzhiyun  * @n: current DPLL n (divider) value under test
124*4882a593Smuzhiyun  * @new_rate: pointer to storage for the resulting rounded rate
125*4882a593Smuzhiyun  * @target_rate: the desired DPLL rate
126*4882a593Smuzhiyun  * @parent_rate: the DPLL's parent clock rate
127*4882a593Smuzhiyun  *
128*4882a593Smuzhiyun  * This code tests a DPLL multiplier value, ensuring that the
129*4882a593Smuzhiyun  * resulting rate will not be higher than the target_rate, and that
130*4882a593Smuzhiyun  * the multiplier value itself is valid for the DPLL.  Initially, the
131*4882a593Smuzhiyun  * integer pointed to by the m argument should be prescaled by
132*4882a593Smuzhiyun  * multiplying by DPLL_SCALE_FACTOR.  The code will replace this with
133*4882a593Smuzhiyun  * a non-scaled m upon return.  This non-scaled m will result in a
134*4882a593Smuzhiyun  * new_rate as close as possible to target_rate (but not greater than
135*4882a593Smuzhiyun  * target_rate) given the current (parent_rate, n, prescaled m)
136*4882a593Smuzhiyun  * triple. Returns DPLL_MULT_UNDERFLOW in the event that the
137*4882a593Smuzhiyun  * non-scaled m attempted to underflow, which can allow the calling
138*4882a593Smuzhiyun  * function to bail out early; or 0 upon success.
139*4882a593Smuzhiyun  */
_dpll_test_mult(int * m,int n,unsigned long * new_rate,unsigned long target_rate,unsigned long parent_rate)140*4882a593Smuzhiyun static int _dpll_test_mult(int *m, int n, unsigned long *new_rate,
141*4882a593Smuzhiyun 			   unsigned long target_rate,
142*4882a593Smuzhiyun 			   unsigned long parent_rate)
143*4882a593Smuzhiyun {
144*4882a593Smuzhiyun 	int r = 0, carry = 0;
145*4882a593Smuzhiyun 
146*4882a593Smuzhiyun 	/* Unscale m and round if necessary */
147*4882a593Smuzhiyun 	if (*m % DPLL_SCALE_FACTOR >= DPLL_ROUNDING_VAL)
148*4882a593Smuzhiyun 		carry = 1;
149*4882a593Smuzhiyun 	*m = (*m / DPLL_SCALE_FACTOR) + carry;
150*4882a593Smuzhiyun 
151*4882a593Smuzhiyun 	/*
152*4882a593Smuzhiyun 	 * The new rate must be <= the target rate to avoid programming
153*4882a593Smuzhiyun 	 * a rate that is impossible for the hardware to handle
154*4882a593Smuzhiyun 	 */
155*4882a593Smuzhiyun 	*new_rate = _dpll_compute_new_rate(parent_rate, *m, n);
156*4882a593Smuzhiyun 	if (*new_rate > target_rate) {
157*4882a593Smuzhiyun 		(*m)--;
158*4882a593Smuzhiyun 		*new_rate = 0;
159*4882a593Smuzhiyun 	}
160*4882a593Smuzhiyun 
161*4882a593Smuzhiyun 	/* Guard against m underflow */
162*4882a593Smuzhiyun 	if (*m < DPLL_MIN_MULTIPLIER) {
163*4882a593Smuzhiyun 		*m = DPLL_MIN_MULTIPLIER;
164*4882a593Smuzhiyun 		*new_rate = 0;
165*4882a593Smuzhiyun 		r = DPLL_MULT_UNDERFLOW;
166*4882a593Smuzhiyun 	}
167*4882a593Smuzhiyun 
168*4882a593Smuzhiyun 	if (*new_rate == 0)
169*4882a593Smuzhiyun 		*new_rate = _dpll_compute_new_rate(parent_rate, *m, n);
170*4882a593Smuzhiyun 
171*4882a593Smuzhiyun 	return r;
172*4882a593Smuzhiyun }
173*4882a593Smuzhiyun 
174*4882a593Smuzhiyun /**
175*4882a593Smuzhiyun  * _omap2_dpll_is_in_bypass - check if DPLL is in bypass mode or not
176*4882a593Smuzhiyun  * @v: bitfield value of the DPLL enable
177*4882a593Smuzhiyun  *
178*4882a593Smuzhiyun  * Checks given DPLL enable bitfield to see whether the DPLL is in bypass
179*4882a593Smuzhiyun  * mode or not. Returns 1 if the DPLL is in bypass, 0 otherwise.
180*4882a593Smuzhiyun  */
_omap2_dpll_is_in_bypass(u32 v)181*4882a593Smuzhiyun static int _omap2_dpll_is_in_bypass(u32 v)
182*4882a593Smuzhiyun {
183*4882a593Smuzhiyun 	u8 mask, val;
184*4882a593Smuzhiyun 
185*4882a593Smuzhiyun 	mask = ti_clk_get_features()->dpll_bypass_vals;
186*4882a593Smuzhiyun 
187*4882a593Smuzhiyun 	/*
188*4882a593Smuzhiyun 	 * Each set bit in the mask corresponds to a bypass value equal
189*4882a593Smuzhiyun 	 * to the bitshift. Go through each set-bit in the mask and
190*4882a593Smuzhiyun 	 * compare against the given register value.
191*4882a593Smuzhiyun 	 */
192*4882a593Smuzhiyun 	while (mask) {
193*4882a593Smuzhiyun 		val = __ffs(mask);
194*4882a593Smuzhiyun 		mask ^= (1 << val);
195*4882a593Smuzhiyun 		if (v == val)
196*4882a593Smuzhiyun 			return 1;
197*4882a593Smuzhiyun 	}
198*4882a593Smuzhiyun 
199*4882a593Smuzhiyun 	return 0;
200*4882a593Smuzhiyun }
201*4882a593Smuzhiyun 
202*4882a593Smuzhiyun /* Public functions */
omap2_init_dpll_parent(struct clk_hw * hw)203*4882a593Smuzhiyun u8 omap2_init_dpll_parent(struct clk_hw *hw)
204*4882a593Smuzhiyun {
205*4882a593Smuzhiyun 	struct clk_hw_omap *clk = to_clk_hw_omap(hw);
206*4882a593Smuzhiyun 	u32 v;
207*4882a593Smuzhiyun 	struct dpll_data *dd;
208*4882a593Smuzhiyun 
209*4882a593Smuzhiyun 	dd = clk->dpll_data;
210*4882a593Smuzhiyun 	if (!dd)
211*4882a593Smuzhiyun 		return -EINVAL;
212*4882a593Smuzhiyun 
213*4882a593Smuzhiyun 	v = ti_clk_ll_ops->clk_readl(&dd->control_reg);
214*4882a593Smuzhiyun 	v &= dd->enable_mask;
215*4882a593Smuzhiyun 	v >>= __ffs(dd->enable_mask);
216*4882a593Smuzhiyun 
217*4882a593Smuzhiyun 	/* Reparent the struct clk in case the dpll is in bypass */
218*4882a593Smuzhiyun 	if (_omap2_dpll_is_in_bypass(v))
219*4882a593Smuzhiyun 		return 1;
220*4882a593Smuzhiyun 
221*4882a593Smuzhiyun 	return 0;
222*4882a593Smuzhiyun }
223*4882a593Smuzhiyun 
224*4882a593Smuzhiyun /**
225*4882a593Smuzhiyun  * omap2_get_dpll_rate - returns the current DPLL CLKOUT rate
226*4882a593Smuzhiyun  * @clk: struct clk * of a DPLL
227*4882a593Smuzhiyun  *
228*4882a593Smuzhiyun  * DPLLs can be locked or bypassed - basically, enabled or disabled.
229*4882a593Smuzhiyun  * When locked, the DPLL output depends on the M and N values.  When
230*4882a593Smuzhiyun  * bypassed, on OMAP2xxx, the output rate is either the 32KiHz clock
231*4882a593Smuzhiyun  * or sys_clk.  Bypass rates on OMAP3 depend on the DPLL: DPLLs 1 and
232*4882a593Smuzhiyun  * 2 are bypassed with dpll1_fclk and dpll2_fclk respectively
233*4882a593Smuzhiyun  * (generated by DPLL3), while DPLL 3, 4, and 5 bypass rates are sys_clk.
234*4882a593Smuzhiyun  * Returns the current DPLL CLKOUT rate (*not* CLKOUTX2) if the DPLL is
235*4882a593Smuzhiyun  * locked, or the appropriate bypass rate if the DPLL is bypassed, or 0
236*4882a593Smuzhiyun  * if the clock @clk is not a DPLL.
237*4882a593Smuzhiyun  */
omap2_get_dpll_rate(struct clk_hw_omap * clk)238*4882a593Smuzhiyun unsigned long omap2_get_dpll_rate(struct clk_hw_omap *clk)
239*4882a593Smuzhiyun {
240*4882a593Smuzhiyun 	u64 dpll_clk;
241*4882a593Smuzhiyun 	u32 dpll_mult, dpll_div, v;
242*4882a593Smuzhiyun 	struct dpll_data *dd;
243*4882a593Smuzhiyun 
244*4882a593Smuzhiyun 	dd = clk->dpll_data;
245*4882a593Smuzhiyun 	if (!dd)
246*4882a593Smuzhiyun 		return 0;
247*4882a593Smuzhiyun 
248*4882a593Smuzhiyun 	/* Return bypass rate if DPLL is bypassed */
249*4882a593Smuzhiyun 	v = ti_clk_ll_ops->clk_readl(&dd->control_reg);
250*4882a593Smuzhiyun 	v &= dd->enable_mask;
251*4882a593Smuzhiyun 	v >>= __ffs(dd->enable_mask);
252*4882a593Smuzhiyun 
253*4882a593Smuzhiyun 	if (_omap2_dpll_is_in_bypass(v))
254*4882a593Smuzhiyun 		return clk_hw_get_rate(dd->clk_bypass);
255*4882a593Smuzhiyun 
256*4882a593Smuzhiyun 	v = ti_clk_ll_ops->clk_readl(&dd->mult_div1_reg);
257*4882a593Smuzhiyun 	dpll_mult = v & dd->mult_mask;
258*4882a593Smuzhiyun 	dpll_mult >>= __ffs(dd->mult_mask);
259*4882a593Smuzhiyun 	dpll_div = v & dd->div1_mask;
260*4882a593Smuzhiyun 	dpll_div >>= __ffs(dd->div1_mask);
261*4882a593Smuzhiyun 
262*4882a593Smuzhiyun 	dpll_clk = (u64)clk_hw_get_rate(dd->clk_ref) * dpll_mult;
263*4882a593Smuzhiyun 	do_div(dpll_clk, dpll_div + 1);
264*4882a593Smuzhiyun 
265*4882a593Smuzhiyun 	return dpll_clk;
266*4882a593Smuzhiyun }
267*4882a593Smuzhiyun 
268*4882a593Smuzhiyun /* DPLL rate rounding code */
269*4882a593Smuzhiyun 
270*4882a593Smuzhiyun /**
271*4882a593Smuzhiyun  * omap2_dpll_round_rate - round a target rate for an OMAP DPLL
272*4882a593Smuzhiyun  * @clk: struct clk * for a DPLL
273*4882a593Smuzhiyun  * @target_rate: desired DPLL clock rate
274*4882a593Smuzhiyun  *
275*4882a593Smuzhiyun  * Given a DPLL and a desired target rate, round the target rate to a
276*4882a593Smuzhiyun  * possible, programmable rate for this DPLL.  Attempts to select the
277*4882a593Smuzhiyun  * minimum possible n.  Stores the computed (m, n) in the DPLL's
278*4882a593Smuzhiyun  * dpll_data structure so set_rate() will not need to call this
279*4882a593Smuzhiyun  * (expensive) function again.  Returns ~0 if the target rate cannot
280*4882a593Smuzhiyun  * be rounded, or the rounded rate upon success.
281*4882a593Smuzhiyun  */
omap2_dpll_round_rate(struct clk_hw * hw,unsigned long target_rate,unsigned long * parent_rate)282*4882a593Smuzhiyun long omap2_dpll_round_rate(struct clk_hw *hw, unsigned long target_rate,
283*4882a593Smuzhiyun 			   unsigned long *parent_rate)
284*4882a593Smuzhiyun {
285*4882a593Smuzhiyun 	struct clk_hw_omap *clk = to_clk_hw_omap(hw);
286*4882a593Smuzhiyun 	int m, n, r, scaled_max_m;
287*4882a593Smuzhiyun 	int min_delta_m = INT_MAX, min_delta_n = INT_MAX;
288*4882a593Smuzhiyun 	unsigned long scaled_rt_rp;
289*4882a593Smuzhiyun 	unsigned long new_rate = 0;
290*4882a593Smuzhiyun 	struct dpll_data *dd;
291*4882a593Smuzhiyun 	unsigned long ref_rate;
292*4882a593Smuzhiyun 	long delta;
293*4882a593Smuzhiyun 	long prev_min_delta = LONG_MAX;
294*4882a593Smuzhiyun 	const char *clk_name;
295*4882a593Smuzhiyun 
296*4882a593Smuzhiyun 	if (!clk || !clk->dpll_data)
297*4882a593Smuzhiyun 		return ~0;
298*4882a593Smuzhiyun 
299*4882a593Smuzhiyun 	dd = clk->dpll_data;
300*4882a593Smuzhiyun 
301*4882a593Smuzhiyun 	if (dd->max_rate && target_rate > dd->max_rate)
302*4882a593Smuzhiyun 		target_rate = dd->max_rate;
303*4882a593Smuzhiyun 
304*4882a593Smuzhiyun 	ref_rate = clk_hw_get_rate(dd->clk_ref);
305*4882a593Smuzhiyun 	clk_name = clk_hw_get_name(hw);
306*4882a593Smuzhiyun 	pr_debug("clock: %s: starting DPLL round_rate, target rate %lu\n",
307*4882a593Smuzhiyun 		 clk_name, target_rate);
308*4882a593Smuzhiyun 
309*4882a593Smuzhiyun 	scaled_rt_rp = target_rate / (ref_rate / DPLL_SCALE_FACTOR);
310*4882a593Smuzhiyun 	scaled_max_m = dd->max_multiplier * DPLL_SCALE_FACTOR;
311*4882a593Smuzhiyun 
312*4882a593Smuzhiyun 	dd->last_rounded_rate = 0;
313*4882a593Smuzhiyun 
314*4882a593Smuzhiyun 	for (n = dd->min_divider; n <= dd->max_divider; n++) {
315*4882a593Smuzhiyun 		/* Is the (input clk, divider) pair valid for the DPLL? */
316*4882a593Smuzhiyun 		r = _dpll_test_fint(clk, n);
317*4882a593Smuzhiyun 		if (r == DPLL_FINT_UNDERFLOW)
318*4882a593Smuzhiyun 			break;
319*4882a593Smuzhiyun 		else if (r == DPLL_FINT_INVALID)
320*4882a593Smuzhiyun 			continue;
321*4882a593Smuzhiyun 
322*4882a593Smuzhiyun 		/* Compute the scaled DPLL multiplier, based on the divider */
323*4882a593Smuzhiyun 		m = scaled_rt_rp * n;
324*4882a593Smuzhiyun 
325*4882a593Smuzhiyun 		/*
326*4882a593Smuzhiyun 		 * Since we're counting n up, a m overflow means we
327*4882a593Smuzhiyun 		 * can bail out completely (since as n increases in
328*4882a593Smuzhiyun 		 * the next iteration, there's no way that m can
329*4882a593Smuzhiyun 		 * increase beyond the current m)
330*4882a593Smuzhiyun 		 */
331*4882a593Smuzhiyun 		if (m > scaled_max_m)
332*4882a593Smuzhiyun 			break;
333*4882a593Smuzhiyun 
334*4882a593Smuzhiyun 		r = _dpll_test_mult(&m, n, &new_rate, target_rate,
335*4882a593Smuzhiyun 				    ref_rate);
336*4882a593Smuzhiyun 
337*4882a593Smuzhiyun 		/* m can't be set low enough for this n - try with a larger n */
338*4882a593Smuzhiyun 		if (r == DPLL_MULT_UNDERFLOW)
339*4882a593Smuzhiyun 			continue;
340*4882a593Smuzhiyun 
341*4882a593Smuzhiyun 		/* skip rates above our target rate */
342*4882a593Smuzhiyun 		delta = target_rate - new_rate;
343*4882a593Smuzhiyun 		if (delta < 0)
344*4882a593Smuzhiyun 			continue;
345*4882a593Smuzhiyun 
346*4882a593Smuzhiyun 		if (delta < prev_min_delta) {
347*4882a593Smuzhiyun 			prev_min_delta = delta;
348*4882a593Smuzhiyun 			min_delta_m = m;
349*4882a593Smuzhiyun 			min_delta_n = n;
350*4882a593Smuzhiyun 		}
351*4882a593Smuzhiyun 
352*4882a593Smuzhiyun 		pr_debug("clock: %s: m = %d: n = %d: new_rate = %lu\n",
353*4882a593Smuzhiyun 			 clk_name, m, n, new_rate);
354*4882a593Smuzhiyun 
355*4882a593Smuzhiyun 		if (delta == 0)
356*4882a593Smuzhiyun 			break;
357*4882a593Smuzhiyun 	}
358*4882a593Smuzhiyun 
359*4882a593Smuzhiyun 	if (prev_min_delta == LONG_MAX) {
360*4882a593Smuzhiyun 		pr_debug("clock: %s: cannot round to rate %lu\n",
361*4882a593Smuzhiyun 			 clk_name, target_rate);
362*4882a593Smuzhiyun 		return ~0;
363*4882a593Smuzhiyun 	}
364*4882a593Smuzhiyun 
365*4882a593Smuzhiyun 	dd->last_rounded_m = min_delta_m;
366*4882a593Smuzhiyun 	dd->last_rounded_n = min_delta_n;
367*4882a593Smuzhiyun 	dd->last_rounded_rate = target_rate - prev_min_delta;
368*4882a593Smuzhiyun 
369*4882a593Smuzhiyun 	return dd->last_rounded_rate;
370*4882a593Smuzhiyun }
371