Lines Matching full:best
128 struct wrpll_rnp *best) in wrpll_update_rnp() argument
132 /* No best (r,n,p) yet */ in wrpll_update_rnp()
133 if (best->p == 0) { in wrpll_update_rnp()
134 best->p = p; in wrpll_update_rnp()
135 best->n2 = n2; in wrpll_update_rnp()
136 best->r2 = r2; in wrpll_update_rnp()
155 b = freq2k * budget * best->p * best->r2; in wrpll_update_rnp()
157 diff_best = ABS_DIFF((freq2k * best->p * best->r2), in wrpll_update_rnp()
158 (LC_FREQ_2K * best->n2)); in wrpll_update_rnp()
164 if (best->p * best->r2 * diff < p * r2 * diff_best) { in wrpll_update_rnp()
165 best->p = p; in wrpll_update_rnp()
166 best->n2 = n2; in wrpll_update_rnp()
167 best->r2 = r2; in wrpll_update_rnp()
171 best->p = p; in wrpll_update_rnp()
172 best->n2 = n2; in wrpll_update_rnp()
173 best->r2 = r2; in wrpll_update_rnp()
176 if (n2 * best->r2 * best->r2 > best->n2 * r2 * r2) { in wrpll_update_rnp()
177 best->p = p; in wrpll_update_rnp()
178 best->n2 = n2; in wrpll_update_rnp()
179 best->r2 = r2; in wrpll_update_rnp()
191 struct wrpll_rnp best = { 0, 0, 0 }; in wrpll_compute_rnp() local
241 r2, n2, p, &best); in wrpll_compute_rnp()
245 *n2_out = best.n2; in wrpll_compute_rnp()
246 *p_out = best.p; in wrpll_compute_rnp()
247 *r2_out = best.r2; in wrpll_compute_rnp()