On 10/07, Maxime Ripard wrote: > On Mon, Oct 05, 2015 at 11:09:29AM -0700, Stephen Boyd wrote: > > On 10/05, Maxime Ripard wrote: > > > > > > Actually, the logic is also reversed. > > > > > > The divider driver will always try to find some rate that is higher > > > than the one we already have, without going above than the one > > > requested. > > > > > > Here, we're tring to be lower than the best rate, without going below > > > the requested rate. > > > > So then a tri-state flag that indicates, closest, less than, > > greater than? > > Still, the computation itself is different, and the only consolidation > we could possibly do is by not duplicating the ROUND_CLOSEST. We would > end up with two different code pathes in the same function, which I > feel would make it unnecessarily complex.
Ok. No worries. -- Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum, a Linux Foundation Collaborative Project -- You received this message because you are subscribed to the Google Groups "linux-sunxi" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
