diff options
| author | Axel Lin <axel.lin@gmail.com> | 2012-01-01 18:36:14 +0800 |
|---|---|---|
| committer | Mark Brown <broonie@opensource.wolfsonmicro.com> | 2012-01-03 21:18:32 +0000 |
| commit | 7a748e4318909e680b3900e3b97ea42a92724c68 (patch) | |
| tree | 0769a57dd4077484e4bdb91fa52bfa14322407da /COPYING | |
| parent | a500231da461cfe29541cb4b8422eb9bf59aa6ac (diff) | |
ASoC: sta32x: Optimize the array work to find rate_min and rate_max
For a given ir and fs, there is at most one possible match for the case
mclk_ratios[ir][j].ratio * fs == freq.
Thus we can break from the inner loop once a match is found.
Signed-off-by: Axel Lin <axel.lin@gmail.com>
Acked-by: Johannes Stezenbach <js@sig21.net>
Signed-off-by: Mark Brown <broonie@opensource.wolfsonmicro.com>
Diffstat (limited to 'COPYING')
0 files changed, 0 insertions, 0 deletions