Re: [PATCH] sh: clk: Relax clk rate match test

2018-01-29 Thread Laurent Pinchart
Hi Jacopo, On Friday, 26 January 2018 18:24:54 EET jacopo mondi wrote: > On Thu, Jan 25, 2018 at 03:39:32PM +0100, Geert Uytterhoeven wrote: > > Hi Jacopo, > > [snip] > > --- > > drivers/sh/clk/core.c | 9 ++--- > 1 file changed, 6 insertions(+), 3 deletions(-) >

Re: [PATCH] sh: clk: Relax clk rate match test

2018-01-26 Thread jacopo mondi
Hi Geert, On Thu, Jan 25, 2018 at 03:39:32PM +0100, Geert Uytterhoeven wrote: > Hi Jacopo, [snip] > >> > --- > >> > drivers/sh/clk/core.c | 9 ++--- > >> > 1 file changed, 6 insertions(+), 3 deletions(-) > >> > > >> > diff --git a/drivers/sh/clk/core.c b/drivers/sh/clk/core.c > >> > index

Re: [PATCH] sh: clk: Relax clk rate match test

2018-01-25 Thread Geert Uytterhoeven
Hi Jacopo, On Thu, Jan 25, 2018 at 3:14 PM, jacopo mondi wrote: > On Thu, Jan 25, 2018 at 02:53:41PM +0100, Geert Uytterhoeven wrote: >> CC linux-clk (yes I know this is about the legacy SH clock framework, but >> the public API is/should be the same) >> >> On Thu, Jan 25,

Re: [PATCH] sh: clk: Relax clk rate match test

2018-01-25 Thread jacopo mondi
Hi Geert, On Thu, Jan 25, 2018 at 02:53:41PM +0100, Geert Uytterhoeven wrote: > Hi Jacopo, > > CC linux-clk (yes I know this is about the legacy SH clock framework, but > the public API is/should be the same) > > On Thu, Jan 25, 2018 at 12:24 PM, Jacopo Mondi > wrote:

Re: [PATCH] sh: clk: Relax clk rate match test

2018-01-25 Thread Geert Uytterhoeven
Hi Jacopo, CC linux-clk (yes I know this is about the legacy SH clock framework, but the public API is/should be the same) On Thu, Jan 25, 2018 at 12:24 PM, Jacopo Mondi wrote: > When asking for a clk rate to be set, the sh core clock matches only > exact rate values

[PATCH] sh: clk: Relax clk rate match test

2018-01-25 Thread Jacopo Mondi
When asking for a clk rate to be set, the sh core clock matches only exact rate values against the calculated frequency table entries. If the rate does not match exactly the test fails, and the whole frequency table is walked, resulting in selection of the last entry, corresponding to the lowest