2017-02-08 00:58:55 +03:00
/*
* CPU frequency scaling for Broadcom BMIPS SoCs
*
* Copyright ( c ) 2017 Broadcom
*
* This program is free software ; you can redistribute it and / or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation version 2.
*
* This program is distributed " as is " WITHOUT ANY WARRANTY of any
* kind , whether express or implied ; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE . See the
* GNU General Public License for more details .
*/
# include <linux/cpufreq.h>
# include <linux/module.h>
# include <linux/of_address.h>
# include <linux/slab.h>
/* for mips_hpt_frequency */
# include <asm/time.h>
# define BMIPS_CPUFREQ_PREFIX "bmips"
# define BMIPS_CPUFREQ_NAME BMIPS_CPUFREQ_PREFIX "-cpufreq"
# define TRANSITION_LATENCY (25 * 1000) /* 25 us */
# define BMIPS5_CLK_DIV_SET_SHIFT 0x7
# define BMIPS5_CLK_DIV_SHIFT 0x4
# define BMIPS5_CLK_DIV_MASK 0xf
enum bmips_type {
BMIPS5000 ,
BMIPS5200 ,
} ;
struct cpufreq_compat {
const char * compatible ;
unsigned int bmips_type ;
unsigned int clk_mult ;
unsigned int max_freqs ;
} ;
# define BMIPS(c, t, m, f) { \
. compatible = c , \
. bmips_type = ( t ) , \
. clk_mult = ( m ) , \
. max_freqs = ( f ) , \
}
static struct cpufreq_compat bmips_cpufreq_compat [ ] = {
BMIPS ( " brcm,bmips5000 " , BMIPS5000 , 8 , 4 ) ,
BMIPS ( " brcm,bmips5200 " , BMIPS5200 , 8 , 4 ) ,
{ }
} ;
static struct cpufreq_compat * priv ;
static int htp_freq_to_cpu_freq ( unsigned int clk_mult )
{
return mips_hpt_frequency * clk_mult / 1000 ;
}
static struct cpufreq_frequency_table *
bmips_cpufreq_get_freq_table ( const struct cpufreq_policy * policy )
{
struct cpufreq_frequency_table * table ;
unsigned long cpu_freq ;
int i ;
cpu_freq = htp_freq_to_cpu_freq ( priv - > clk_mult ) ;
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(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 tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- 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;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- 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;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- 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;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- 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;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- 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;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- 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;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 23:55:00 +03:00
table = kmalloc_array ( priv - > max_freqs + 1 , sizeof ( * table ) , GFP_KERNEL ) ;
2017-02-08 00:58:55 +03:00
if ( ! table )
return ERR_PTR ( - ENOMEM ) ;
for ( i = 0 ; i < priv - > max_freqs ; i + + ) {
table [ i ] . frequency = cpu_freq / ( 1 < < i ) ;
table [ i ] . driver_data = i ;
}
table [ i ] . frequency = CPUFREQ_TABLE_END ;
return table ;
}
static unsigned int bmips_cpufreq_get ( unsigned int cpu )
{
unsigned int div ;
uint32_t mode ;
switch ( priv - > bmips_type ) {
case BMIPS5200 :
case BMIPS5000 :
mode = read_c0_brcm_mode ( ) ;
div = ( ( mode > > BMIPS5_CLK_DIV_SHIFT ) & BMIPS5_CLK_DIV_MASK ) ;
break ;
default :
div = 0 ;
}
return htp_freq_to_cpu_freq ( priv - > clk_mult ) / ( 1 < < div ) ;
}
static int bmips_cpufreq_target_index ( struct cpufreq_policy * policy ,
unsigned int index )
{
unsigned int div = policy - > freq_table [ index ] . driver_data ;
switch ( priv - > bmips_type ) {
case BMIPS5200 :
case BMIPS5000 :
change_c0_brcm_mode ( BMIPS5_CLK_DIV_MASK < < BMIPS5_CLK_DIV_SHIFT ,
( 1 < < BMIPS5_CLK_DIV_SET_SHIFT ) |
( div < < BMIPS5_CLK_DIV_SHIFT ) ) ;
break ;
default :
return - ENOTSUPP ;
}
return 0 ;
}
static int bmips_cpufreq_exit ( struct cpufreq_policy * policy )
{
kfree ( policy - > freq_table ) ;
return 0 ;
}
static int bmips_cpufreq_init ( struct cpufreq_policy * policy )
{
struct cpufreq_frequency_table * freq_table ;
freq_table = bmips_cpufreq_get_freq_table ( policy ) ;
if ( IS_ERR ( freq_table ) ) {
2019-07-16 07:06:08 +03:00
pr_err ( " %s: couldn't determine frequency table (%ld). \n " ,
BMIPS_CPUFREQ_NAME , PTR_ERR ( freq_table ) ) ;
return PTR_ERR ( freq_table ) ;
2017-02-08 00:58:55 +03:00
}
2019-07-16 07:06:08 +03:00
cpufreq_generic_init ( policy , freq_table , TRANSITION_LATENCY ) ;
pr_info ( " %s: registered \n " , BMIPS_CPUFREQ_NAME ) ;
2017-02-08 00:58:55 +03:00
2019-07-16 07:06:08 +03:00
return 0 ;
2017-02-08 00:58:55 +03:00
}
static struct cpufreq_driver bmips_cpufreq_driver = {
. flags = CPUFREQ_NEED_INITIAL_FREQ_CHECK ,
. verify = cpufreq_generic_frequency_table_verify ,
. target_index = bmips_cpufreq_target_index ,
. get = bmips_cpufreq_get ,
. init = bmips_cpufreq_init ,
. exit = bmips_cpufreq_exit ,
. attr = cpufreq_generic_attr ,
. name = BMIPS_CPUFREQ_PREFIX ,
} ;
static int __init bmips_cpufreq_probe ( void )
{
struct cpufreq_compat * cc ;
struct device_node * np ;
for ( cc = bmips_cpufreq_compat ; cc - > compatible ; cc + + ) {
np = of_find_compatible_node ( NULL , " cpu " , cc - > compatible ) ;
if ( np ) {
of_node_put ( np ) ;
priv = cc ;
break ;
}
}
/* We hit the guard element of the array. No compatible CPU found. */
if ( ! cc - > compatible )
return - ENODEV ;
return cpufreq_register_driver ( & bmips_cpufreq_driver ) ;
}
device_initcall ( bmips_cpufreq_probe ) ;
MODULE_AUTHOR ( " Markus Mayer <mmayer@broadcom.com> " ) ;
MODULE_DESCRIPTION ( " CPUfreq driver for Broadcom BMIPS SoCs " ) ;
MODULE_LICENSE ( " GPL " ) ;