2018-09-25 09:34:05 +02:00
// SPDX-License-Identifier: GPL-2.0
2014-03-07 17:00:37 +01:00
/*
2017-10-12 10:54:22 +02:00
* RZ / A1 Core CPG Clocks
2014-03-07 17:00:37 +01:00
*
* Copyright ( C ) 2013 Ideas On Board SPRL
* Copyright ( C ) 2014 Wolfram Sang , Sang Engineering < wsa @ sang - engineering . com >
*/
# include <linux/clk-provider.h>
2016-03-08 09:42:07 +09:00
# include <linux/clk/renesas.h>
2014-03-07 17:00:37 +01:00
# include <linux/init.h>
2019-04-18 15:20:22 -07:00
# include <linux/io.h>
2014-03-07 17:00:37 +01:00
# include <linux/kernel.h>
# include <linux/of.h>
# include <linux/of_address.h>
# include <linux/slab.h>
struct rz_cpg {
struct clk_onecell_data data ;
void __iomem * reg ;
} ;
# define CPG_FRQCR 0x10
# define CPG_FRQCR2 0x14
2016-09-01 22:32:25 -04:00
# define PPR0 0xFCFE3200
# define PIBC0 0xFCFE7000
# define MD_CLK(x) ((x >> 2) & 1) /* P0_2 */
2014-03-07 17:00:37 +01:00
/* -----------------------------------------------------------------------------
* Initialization
*/
2016-09-01 22:32:25 -04:00
static u16 __init rz_cpg_read_mode_pins ( void )
{
void __iomem * ppr0 , * pibc0 ;
u16 modes ;
ppr0 = ioremap_nocache ( PPR0 , 2 ) ;
pibc0 = ioremap_nocache ( PIBC0 , 2 ) ;
BUG_ON ( ! ppr0 | | ! pibc0 ) ;
iowrite16 ( 4 , pibc0 ) ; /* enable input buffer */
modes = ioread16 ( ppr0 ) ;
iounmap ( ppr0 ) ;
iounmap ( pibc0 ) ;
return modes ;
}
2014-03-07 17:00:37 +01:00
static struct clk * __init
rz_cpg_register_clock ( struct device_node * np , struct rz_cpg * cpg , const char * name )
{
u32 val ;
unsigned mult ;
static const unsigned frqcr_tab [ 4 ] = { 3 , 2 , 0 , 1 } ;
if ( strcmp ( name , " pll " ) = = 0 ) {
2016-09-01 22:32:25 -04:00
unsigned int cpg_mode = MD_CLK ( rz_cpg_read_mode_pins ( ) ) ;
2014-03-07 17:00:37 +01:00
const char * parent_name = of_clk_get_parent_name ( np , cpg_mode ) ;
mult = cpg_mode ? ( 32 / 4 ) : 30 ;
return clk_register_fixed_factor ( NULL , name , parent_name , 0 , mult , 1 ) ;
}
/* If mapping regs failed, skip non-pll clocks. System will boot anyhow */
if ( ! cpg - > reg )
return ERR_PTR ( - ENXIO ) ;
/* FIXME:"i" and "g" are variable clocks with non-integer dividers (e.g. 2/3)
* and the constraint that always g < = i . To get the rz platform started ,
* let them run at fixed current speed and implement the details later .
*/
if ( strcmp ( name , " i " ) = = 0 )
2018-03-15 10:44:19 +01:00
val = ( readl ( cpg - > reg + CPG_FRQCR ) > > 8 ) & 3 ;
2014-03-07 17:00:37 +01:00
else if ( strcmp ( name , " g " ) = = 0 )
2018-03-15 10:44:19 +01:00
val = readl ( cpg - > reg + CPG_FRQCR2 ) & 3 ;
2014-03-07 17:00:37 +01:00
else
return ERR_PTR ( - EINVAL ) ;
mult = frqcr_tab [ val ] ;
return clk_register_fixed_factor ( NULL , name , " pll " , 0 , mult , 3 ) ;
}
static void __init rz_cpg_clocks_init ( struct device_node * np )
{
struct rz_cpg * cpg ;
struct clk * * clks ;
unsigned i ;
int num_clks ;
num_clks = of_property_count_strings ( np , " clock-output-names " ) ;
if ( WARN ( num_clks < = 0 , " can't count CPG clocks \n " ) )
return ;
cpg = kzalloc ( sizeof ( * cpg ) , GFP_KERNEL ) ;
treewide: kzalloc() -> kcalloc()
The kzalloc() function has a 2-factor argument form, kcalloc(). This
patch replaces cases of:
kzalloc(a * b, gfp)
with:
kcalloc(a * b, gfp)
as well as handling cases of:
kzalloc(a * b * c, gfp)
with:
kzalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kzalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kzalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kzalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kzalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kzalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kzalloc
+ kcalloc
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kzalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kzalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kzalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kzalloc(sizeof(THING) * C2, ...)
|
kzalloc(sizeof(TYPE) * C2, ...)
|
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(C1 * C2, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * E2
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 14:03:40 -07:00
clks = kcalloc ( num_clks , sizeof ( * clks ) , GFP_KERNEL ) ;
2014-03-07 17:00:37 +01:00
BUG_ON ( ! cpg | | ! clks ) ;
cpg - > data . clks = clks ;
cpg - > data . clk_num = num_clks ;
cpg - > reg = of_iomap ( np , 0 ) ;
for ( i = 0 ; i < num_clks ; + + i ) {
const char * name ;
struct clk * clk ;
of_property_read_string_index ( np , " clock-output-names " , i , & name ) ;
clk = rz_cpg_register_clock ( np , cpg , name ) ;
if ( IS_ERR ( clk ) )
2018-08-28 10:44:29 -05:00
pr_err ( " %s: failed to register %pOFn %s clock (%ld) \n " ,
__func__ , np , name , PTR_ERR ( clk ) ) ;
2014-03-07 17:00:37 +01:00
else
cpg - > data . clks [ i ] = clk ;
}
of_clk_add_provider ( np , of_clk_src_onecell_get , & cpg - > data ) ;
2015-08-04 14:28:06 +02:00
cpg_mstp_add_clk_domain ( np ) ;
2014-03-07 17:00:37 +01:00
}
CLK_OF_DECLARE ( rz_cpg_clks , " renesas,rz-cpg-clocks " , rz_cpg_clocks_init ) ;