| commit | 0e2de78ecdc842218a2b6c422bb4a8ff4d85d11f | [log] [tgz] |
|---|---|---|
| author | Maxime COQUELIN <maxime.coquelin@st.com> | Wed Jan 29 17:24:08 2014 +0100 |
| committer | Mike Turquette <mturquette@linaro.org> | Wed Apr 30 11:51:27 2014 -0700 |
| tree | f73422d0e0433a890fe060b400fc528a2784d64b | |
| parent | 774b514390b1eb8476bc759262790762bd1ef45a [diff] |
clk: divider: Optimize clk_divider_bestdiv loop Currently, the for-loop used to try all the different dividers to find the one that best fit tries all the values from 1 to max_div, incrementing by one. In case of power-of-two, or table based divider, the loop isn't optimal. Instead of incrementing by one, this patch provides directly the next divider. Signed-off-by: Maxime Coquelin <maxime.coquelin@st.com> Signed-off-by: Mike Turquette <mturquette@linaro.org>