2022-06-07 22:11:32 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2013-09-13 17:02:15 +08:00
|
|
|
/*
|
|
|
|
* TI Divider Clock
|
|
|
|
*
|
|
|
|
* Copyright (C) 2013 Texas Instruments, Inc.
|
|
|
|
*
|
|
|
|
* Tero Kristo <t-kristo@ti.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/clk-provider.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/err.h>
|
|
|
|
#include <linux/of.h>
|
|
|
|
#include <linux/of_address.h>
|
|
|
|
#include <linux/clk/ti.h>
|
2014-12-17 00:20:50 +08:00
|
|
|
#include "clock.h"
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
#undef pr_fmt
|
|
|
|
#define pr_fmt(fmt) "%s: " fmt, __func__
|
|
|
|
|
|
|
|
static unsigned int _get_table_div(const struct clk_div_table *table,
|
|
|
|
unsigned int val)
|
|
|
|
{
|
|
|
|
const struct clk_div_table *clkt;
|
|
|
|
|
|
|
|
for (clkt = table; clkt->div; clkt++)
|
|
|
|
if (clkt->val == val)
|
|
|
|
return clkt->div;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
static void _setup_mask(struct clk_omap_divider *divider)
|
|
|
|
{
|
|
|
|
u16 mask;
|
|
|
|
u32 max_val;
|
|
|
|
const struct clk_div_table *clkt;
|
|
|
|
|
|
|
|
if (divider->table) {
|
|
|
|
max_val = 0;
|
|
|
|
|
|
|
|
for (clkt = divider->table; clkt->div; clkt++)
|
|
|
|
if (clkt->val > max_val)
|
|
|
|
max_val = clkt->val;
|
|
|
|
} else {
|
|
|
|
max_val = divider->max;
|
|
|
|
|
|
|
|
if (!(divider->flags & CLK_DIVIDER_ONE_BASED) &&
|
|
|
|
!(divider->flags & CLK_DIVIDER_POWER_OF_TWO))
|
|
|
|
max_val--;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
|
|
|
|
mask = fls(max_val) - 1;
|
|
|
|
else
|
|
|
|
mask = max_val;
|
|
|
|
|
|
|
|
divider->mask = (1 << fls(mask)) - 1;
|
|
|
|
}
|
|
|
|
|
2017-02-09 20:45:45 +08:00
|
|
|
static unsigned int _get_div(struct clk_omap_divider *divider, unsigned int val)
|
2013-09-13 17:02:15 +08:00
|
|
|
{
|
|
|
|
if (divider->flags & CLK_DIVIDER_ONE_BASED)
|
|
|
|
return val;
|
|
|
|
if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
|
|
|
|
return 1 << val;
|
|
|
|
if (divider->table)
|
|
|
|
return _get_table_div(divider->table, val);
|
|
|
|
return val + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int _get_table_val(const struct clk_div_table *table,
|
|
|
|
unsigned int div)
|
|
|
|
{
|
|
|
|
const struct clk_div_table *clkt;
|
|
|
|
|
|
|
|
for (clkt = table; clkt->div; clkt++)
|
|
|
|
if (clkt->div == div)
|
|
|
|
return clkt->val;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-02-09 20:45:45 +08:00
|
|
|
static unsigned int _get_val(struct clk_omap_divider *divider, u8 div)
|
2013-09-13 17:02:15 +08:00
|
|
|
{
|
|
|
|
if (divider->flags & CLK_DIVIDER_ONE_BASED)
|
|
|
|
return div;
|
|
|
|
if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
|
|
|
|
return __ffs(div);
|
|
|
|
if (divider->table)
|
|
|
|
return _get_table_val(divider->table, div);
|
|
|
|
return div - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned long ti_clk_divider_recalc_rate(struct clk_hw *hw,
|
|
|
|
unsigned long parent_rate)
|
|
|
|
{
|
2017-02-09 20:45:45 +08:00
|
|
|
struct clk_omap_divider *divider = to_clk_omap_divider(hw);
|
2013-09-13 17:02:15 +08:00
|
|
|
unsigned int div, val;
|
|
|
|
|
2017-02-09 17:24:37 +08:00
|
|
|
val = ti_clk_ll_ops->clk_readl(÷r->reg) >> divider->shift;
|
2019-10-02 20:06:10 +08:00
|
|
|
val &= divider->mask;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
div = _get_div(divider, val);
|
|
|
|
if (!div) {
|
|
|
|
WARN(!(divider->flags & CLK_DIVIDER_ALLOW_ZERO),
|
|
|
|
"%s: Zero divisor and CLK_DIVIDER_ALLOW_ZERO not set\n",
|
2015-07-31 08:20:57 +08:00
|
|
|
clk_hw_get_name(hw));
|
2013-09-13 17:02:15 +08:00
|
|
|
return parent_rate;
|
|
|
|
}
|
|
|
|
|
2014-02-13 18:04:00 +08:00
|
|
|
return DIV_ROUND_UP(parent_rate, div);
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The reverse of DIV_ROUND_UP: The maximum number which
|
|
|
|
* divided by m is r
|
|
|
|
*/
|
|
|
|
#define MULT_ROUND_UP(r, m) ((r) * (m) + (m) - 1)
|
|
|
|
|
|
|
|
static bool _is_valid_table_div(const struct clk_div_table *table,
|
|
|
|
unsigned int div)
|
|
|
|
{
|
|
|
|
const struct clk_div_table *clkt;
|
|
|
|
|
|
|
|
for (clkt = table; clkt->div; clkt++)
|
|
|
|
if (clkt->div == div)
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2017-02-09 20:45:45 +08:00
|
|
|
static bool _is_valid_div(struct clk_omap_divider *divider, unsigned int div)
|
2013-09-13 17:02:15 +08:00
|
|
|
{
|
|
|
|
if (divider->flags & CLK_DIVIDER_POWER_OF_TWO)
|
|
|
|
return is_power_of_2(div);
|
|
|
|
if (divider->table)
|
|
|
|
return _is_valid_table_div(divider->table, div);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2016-12-02 17:05:43 +08:00
|
|
|
static int _div_round_up(const struct clk_div_table *table,
|
|
|
|
unsigned long parent_rate, unsigned long rate)
|
|
|
|
{
|
|
|
|
const struct clk_div_table *clkt;
|
|
|
|
int up = INT_MAX;
|
|
|
|
int div = DIV_ROUND_UP_ULL((u64)parent_rate, rate);
|
|
|
|
|
|
|
|
for (clkt = table; clkt->div; clkt++) {
|
|
|
|
if (clkt->div == div)
|
|
|
|
return clkt->div;
|
|
|
|
else if (clkt->div < div)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if ((clkt->div - div) < (up - div))
|
|
|
|
up = clkt->div;
|
|
|
|
}
|
|
|
|
|
|
|
|
return up;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int _div_round(const struct clk_div_table *table,
|
|
|
|
unsigned long parent_rate, unsigned long rate)
|
|
|
|
{
|
|
|
|
if (!table)
|
|
|
|
return DIV_ROUND_UP(parent_rate, rate);
|
|
|
|
|
|
|
|
return _div_round_up(table, parent_rate, rate);
|
|
|
|
}
|
|
|
|
|
2013-09-13 17:02:15 +08:00
|
|
|
static int ti_clk_divider_bestdiv(struct clk_hw *hw, unsigned long rate,
|
|
|
|
unsigned long *best_parent_rate)
|
|
|
|
{
|
2017-02-09 20:45:45 +08:00
|
|
|
struct clk_omap_divider *divider = to_clk_omap_divider(hw);
|
2013-09-13 17:02:15 +08:00
|
|
|
int i, bestdiv = 0;
|
|
|
|
unsigned long parent_rate, best = 0, now, maxdiv;
|
|
|
|
unsigned long parent_rate_saved = *best_parent_rate;
|
|
|
|
|
|
|
|
if (!rate)
|
|
|
|
rate = 1;
|
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
maxdiv = divider->max;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2015-06-30 07:56:30 +08:00
|
|
|
if (!(clk_hw_get_flags(hw) & CLK_SET_RATE_PARENT)) {
|
2013-09-13 17:02:15 +08:00
|
|
|
parent_rate = *best_parent_rate;
|
2016-12-02 17:05:43 +08:00
|
|
|
bestdiv = _div_round(divider->table, parent_rate, rate);
|
2013-09-13 17:02:15 +08:00
|
|
|
bestdiv = bestdiv == 0 ? 1 : bestdiv;
|
|
|
|
bestdiv = bestdiv > maxdiv ? maxdiv : bestdiv;
|
|
|
|
return bestdiv;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The maximum divider we can use without overflowing
|
|
|
|
* unsigned long in rate * i below
|
|
|
|
*/
|
|
|
|
maxdiv = min(ULONG_MAX / rate, maxdiv);
|
|
|
|
|
|
|
|
for (i = 1; i <= maxdiv; i++) {
|
|
|
|
if (!_is_valid_div(divider, i))
|
|
|
|
continue;
|
|
|
|
if (rate * i == parent_rate_saved) {
|
|
|
|
/*
|
|
|
|
* It's the most ideal case if the requested rate can be
|
|
|
|
* divided from parent clock without needing to change
|
|
|
|
* parent rate, so return the divider immediately.
|
|
|
|
*/
|
|
|
|
*best_parent_rate = parent_rate_saved;
|
|
|
|
return i;
|
|
|
|
}
|
2015-07-31 08:20:57 +08:00
|
|
|
parent_rate = clk_hw_round_rate(clk_hw_get_parent(hw),
|
2013-09-13 17:02:15 +08:00
|
|
|
MULT_ROUND_UP(rate, i));
|
2014-02-13 18:04:00 +08:00
|
|
|
now = DIV_ROUND_UP(parent_rate, i);
|
2013-09-13 17:02:15 +08:00
|
|
|
if (now <= rate && now > best) {
|
|
|
|
bestdiv = i;
|
|
|
|
best = now;
|
|
|
|
*best_parent_rate = parent_rate;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!bestdiv) {
|
2019-10-02 20:06:10 +08:00
|
|
|
bestdiv = divider->max;
|
2013-09-13 17:02:15 +08:00
|
|
|
*best_parent_rate =
|
2015-07-31 08:20:57 +08:00
|
|
|
clk_hw_round_rate(clk_hw_get_parent(hw), 1);
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return bestdiv;
|
|
|
|
}
|
|
|
|
|
|
|
|
static long ti_clk_divider_round_rate(struct clk_hw *hw, unsigned long rate,
|
|
|
|
unsigned long *prate)
|
|
|
|
{
|
|
|
|
int div;
|
|
|
|
div = ti_clk_divider_bestdiv(hw, rate, prate);
|
|
|
|
|
2014-02-13 18:04:00 +08:00
|
|
|
return DIV_ROUND_UP(*prate, div);
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int ti_clk_divider_set_rate(struct clk_hw *hw, unsigned long rate,
|
|
|
|
unsigned long parent_rate)
|
|
|
|
{
|
2017-02-09 20:45:45 +08:00
|
|
|
struct clk_omap_divider *divider;
|
2013-09-13 17:02:15 +08:00
|
|
|
unsigned int div, value;
|
|
|
|
u32 val;
|
|
|
|
|
2014-08-19 00:56:54 +08:00
|
|
|
if (!hw || !rate)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2017-02-09 20:45:45 +08:00
|
|
|
divider = to_clk_omap_divider(hw);
|
2014-08-19 00:56:54 +08:00
|
|
|
|
2014-02-13 18:04:00 +08:00
|
|
|
div = DIV_ROUND_UP(parent_rate, rate);
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
if (div > divider->max)
|
|
|
|
div = divider->max;
|
|
|
|
if (div < divider->min)
|
|
|
|
div = divider->min;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
value = _get_val(divider, div);
|
|
|
|
|
|
|
|
val = ti_clk_ll_ops->clk_readl(÷r->reg);
|
|
|
|
val &= ~(divider->mask << divider->shift);
|
2013-09-13 17:02:15 +08:00
|
|
|
val |= value << divider->shift;
|
2017-02-09 17:24:37 +08:00
|
|
|
ti_clk_ll_ops->clk_writel(val, ÷r->reg);
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2018-02-15 15:49:27 +08:00
|
|
|
ti_clk_latch(÷r->reg, divider->latch);
|
|
|
|
|
2013-09-13 17:02:15 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-09-04 14:49:37 +08:00
|
|
|
/**
|
|
|
|
* clk_divider_save_context - Save the divider value
|
|
|
|
* @hw: pointer struct clk_hw
|
|
|
|
*
|
|
|
|
* Save the divider value
|
|
|
|
*/
|
|
|
|
static int clk_divider_save_context(struct clk_hw *hw)
|
|
|
|
{
|
|
|
|
struct clk_omap_divider *divider = to_clk_omap_divider(hw);
|
|
|
|
u32 val;
|
|
|
|
|
|
|
|
val = ti_clk_ll_ops->clk_readl(÷r->reg) >> divider->shift;
|
2019-10-02 20:06:10 +08:00
|
|
|
divider->context = val & divider->mask;
|
2018-09-04 14:49:37 +08:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* clk_divider_restore_context - restore the saved the divider value
|
|
|
|
* @hw: pointer struct clk_hw
|
|
|
|
*
|
|
|
|
* Restore the saved the divider value
|
|
|
|
*/
|
|
|
|
static void clk_divider_restore_context(struct clk_hw *hw)
|
|
|
|
{
|
|
|
|
struct clk_omap_divider *divider = to_clk_omap_divider(hw);
|
|
|
|
u32 val;
|
|
|
|
|
|
|
|
val = ti_clk_ll_ops->clk_readl(÷r->reg);
|
2019-10-02 20:06:10 +08:00
|
|
|
val &= ~(divider->mask << divider->shift);
|
2018-09-04 14:49:37 +08:00
|
|
|
val |= divider->context << divider->shift;
|
|
|
|
ti_clk_ll_ops->clk_writel(val, ÷r->reg);
|
|
|
|
}
|
|
|
|
|
2013-09-13 17:02:15 +08:00
|
|
|
const struct clk_ops ti_clk_divider_ops = {
|
|
|
|
.recalc_rate = ti_clk_divider_recalc_rate,
|
|
|
|
.round_rate = ti_clk_divider_round_rate,
|
|
|
|
.set_rate = ti_clk_divider_set_rate,
|
2018-09-04 14:49:37 +08:00
|
|
|
.save_context = clk_divider_save_context,
|
|
|
|
.restore_context = clk_divider_restore_context,
|
2013-09-13 17:02:15 +08:00
|
|
|
};
|
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
static struct clk *_register_divider(struct device_node *node,
|
|
|
|
u32 flags,
|
|
|
|
struct clk_omap_divider *div)
|
2013-09-13 17:02:15 +08:00
|
|
|
{
|
|
|
|
struct clk_init_data init;
|
2019-10-02 20:06:08 +08:00
|
|
|
const char *parent_name;
|
2022-02-04 15:14:49 +08:00
|
|
|
const char *name;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
parent_name = of_clk_get_parent_name(node, 0);
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2022-02-04 15:14:49 +08:00
|
|
|
name = ti_dt_clk_name(node);
|
|
|
|
init.name = name;
|
2013-09-13 17:02:15 +08:00
|
|
|
init.ops = &ti_clk_divider_ops;
|
2019-01-15 17:15:14 +08:00
|
|
|
init.flags = flags;
|
2013-09-13 17:02:15 +08:00
|
|
|
init.parent_names = (parent_name ? &parent_name : NULL);
|
|
|
|
init.num_parents = (parent_name ? 1 : 0);
|
|
|
|
|
|
|
|
div->hw.init = &init;
|
|
|
|
|
|
|
|
/* register the clock */
|
2023-10-02 15:04:36 +08:00
|
|
|
return of_ti_clk_register(node, &div->hw, name);
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
2017-02-09 20:46:53 +08:00
|
|
|
int ti_clk_parse_divider_data(int *div_table, int num_dividers, int max_div,
|
2019-10-02 20:06:09 +08:00
|
|
|
u8 flags, struct clk_omap_divider *divider)
|
2014-12-17 00:20:50 +08:00
|
|
|
{
|
|
|
|
int valid_div = 0;
|
2017-02-09 20:46:53 +08:00
|
|
|
int i;
|
|
|
|
struct clk_div_table *tmp;
|
2019-10-02 20:06:10 +08:00
|
|
|
u16 min_div = 0;
|
2014-12-17 00:20:50 +08:00
|
|
|
|
2017-02-09 20:46:53 +08:00
|
|
|
if (!div_table) {
|
2019-10-02 20:06:10 +08:00
|
|
|
divider->min = 1;
|
|
|
|
divider->max = max_div;
|
|
|
|
_setup_mask(divider);
|
2017-02-09 20:46:53 +08:00
|
|
|
return 0;
|
2014-12-17 00:20:50 +08:00
|
|
|
}
|
|
|
|
|
2017-02-09 20:46:53 +08:00
|
|
|
i = 0;
|
|
|
|
|
|
|
|
while (!num_dividers || i < num_dividers) {
|
|
|
|
if (div_table[i] == -1)
|
|
|
|
break;
|
|
|
|
if (div_table[i])
|
2014-12-17 00:20:50 +08:00
|
|
|
valid_div++;
|
2017-02-09 20:46:53 +08:00
|
|
|
i++;
|
|
|
|
}
|
2014-12-17 00:20:50 +08:00
|
|
|
|
2017-02-09 20:46:53 +08:00
|
|
|
num_dividers = i;
|
|
|
|
|
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-13 05:03:40 +08:00
|
|
|
tmp = kcalloc(valid_div + 1, sizeof(*tmp), GFP_KERNEL);
|
2019-10-02 20:06:09 +08:00
|
|
|
if (!tmp)
|
2017-02-09 20:46:53 +08:00
|
|
|
return -ENOMEM;
|
2014-12-17 00:20:50 +08:00
|
|
|
|
|
|
|
valid_div = 0;
|
|
|
|
|
2017-02-09 20:46:53 +08:00
|
|
|
for (i = 0; i < num_dividers; i++)
|
|
|
|
if (div_table[i] > 0) {
|
|
|
|
tmp[valid_div].div = div_table[i];
|
|
|
|
tmp[valid_div].val = i;
|
2014-12-17 00:20:50 +08:00
|
|
|
valid_div++;
|
2019-10-02 20:06:10 +08:00
|
|
|
if (div_table[i] > max_div)
|
|
|
|
max_div = div_table[i];
|
|
|
|
if (!min_div || div_table[i] < min_div)
|
|
|
|
min_div = div_table[i];
|
2014-12-17 00:20:50 +08:00
|
|
|
}
|
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
divider->min = min_div;
|
|
|
|
divider->max = max_div;
|
2019-10-02 20:06:09 +08:00
|
|
|
divider->table = tmp;
|
2019-10-02 20:06:10 +08:00
|
|
|
_setup_mask(divider);
|
2017-02-09 20:46:53 +08:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
static int __init ti_clk_get_div_table(struct device_node *node,
|
|
|
|
struct clk_omap_divider *div)
|
2013-09-13 17:02:15 +08:00
|
|
|
{
|
|
|
|
struct clk_div_table *table;
|
|
|
|
const __be32 *divspec;
|
|
|
|
u32 val;
|
|
|
|
u32 num_div;
|
|
|
|
u32 valid_div;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
divspec = of_get_property(node, "ti,dividers", &num_div);
|
|
|
|
|
|
|
|
if (!divspec)
|
2019-10-02 20:06:08 +08:00
|
|
|
return 0;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
num_div /= 4;
|
|
|
|
|
|
|
|
valid_div = 0;
|
|
|
|
|
|
|
|
/* Determine required size for divider table */
|
|
|
|
for (i = 0; i < num_div; i++) {
|
|
|
|
of_property_read_u32_index(node, "ti,dividers", i, &val);
|
|
|
|
if (val)
|
|
|
|
valid_div++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!valid_div) {
|
2018-08-28 23:44:29 +08:00
|
|
|
pr_err("no valid dividers for %pOFn table\n", node);
|
2019-10-02 20:06:08 +08:00
|
|
|
return -EINVAL;
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
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-13 05:03:40 +08:00
|
|
|
table = kcalloc(valid_div + 1, sizeof(*table), GFP_KERNEL);
|
2013-09-13 17:02:15 +08:00
|
|
|
if (!table)
|
2019-10-02 20:06:08 +08:00
|
|
|
return -ENOMEM;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
valid_div = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < num_div; i++) {
|
|
|
|
of_property_read_u32_index(node, "ti,dividers", i, &val);
|
|
|
|
if (val) {
|
|
|
|
table[valid_div].div = val;
|
|
|
|
table[valid_div].val = i;
|
|
|
|
valid_div++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
div->table = table;
|
|
|
|
|
|
|
|
return 0;
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
static int _populate_divider_min_max(struct device_node *node,
|
|
|
|
struct clk_omap_divider *divider)
|
2013-09-13 17:02:15 +08:00
|
|
|
{
|
2019-10-02 20:06:10 +08:00
|
|
|
u32 min_div = 0;
|
|
|
|
u32 max_div = 0;
|
|
|
|
u32 val;
|
|
|
|
const struct clk_div_table *clkt;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
if (!divider->table) {
|
2013-09-13 17:02:15 +08:00
|
|
|
/* Clk divider table not provided, determine min/max divs */
|
|
|
|
if (of_property_read_u32(node, "ti,min-div", &min_div))
|
|
|
|
min_div = 1;
|
|
|
|
|
|
|
|
if (of_property_read_u32(node, "ti,max-div", &max_div)) {
|
2018-08-28 23:44:29 +08:00
|
|
|
pr_err("no max-div for %pOFn!\n", node);
|
2013-09-13 17:02:15 +08:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
for (clkt = divider->table; clkt->div; clkt++) {
|
|
|
|
val = clkt->div;
|
|
|
|
if (val > max_div)
|
|
|
|
max_div = val;
|
|
|
|
if (!min_div || val < min_div)
|
|
|
|
min_div = val;
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
divider->min = min_div;
|
|
|
|
divider->max = max_div;
|
|
|
|
_setup_mask(divider);
|
|
|
|
|
|
|
|
return 0;
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int __init ti_clk_divider_populate(struct device_node *node,
|
2019-10-02 20:06:08 +08:00
|
|
|
struct clk_omap_divider *div,
|
|
|
|
u32 *flags)
|
2013-09-13 17:02:15 +08:00
|
|
|
{
|
|
|
|
u32 val;
|
2017-02-09 17:24:37 +08:00
|
|
|
int ret;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
ret = ti_clk_get_reg_addr(node, 0, &div->reg);
|
2017-02-09 17:24:37 +08:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2024-02-13 18:48:52 +08:00
|
|
|
div->shift = div->reg.bit;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
if (!of_property_read_u32(node, "ti,latch-bit", &val))
|
|
|
|
div->latch = val;
|
|
|
|
else
|
|
|
|
div->latch = -EINVAL;
|
2018-02-15 15:49:27 +08:00
|
|
|
|
2013-09-13 17:02:15 +08:00
|
|
|
*flags = 0;
|
2019-10-02 20:06:08 +08:00
|
|
|
div->flags = 0;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
if (of_property_read_bool(node, "ti,index-starts-at-one"))
|
2019-10-02 20:06:08 +08:00
|
|
|
div->flags |= CLK_DIVIDER_ONE_BASED;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
if (of_property_read_bool(node, "ti,index-power-of-two"))
|
2019-10-02 20:06:08 +08:00
|
|
|
div->flags |= CLK_DIVIDER_POWER_OF_TWO;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
if (of_property_read_bool(node, "ti,set-rate-parent"))
|
|
|
|
*flags |= CLK_SET_RATE_PARENT;
|
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
ret = ti_clk_get_div_table(node, div);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:10 +08:00
|
|
|
return _populate_divider_min_max(node, div);
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* of_ti_divider_clk_setup - Setup function for simple div rate clock
|
|
|
|
* @node: device node for this clock
|
|
|
|
*
|
|
|
|
* Sets up a basic divider clock.
|
|
|
|
*/
|
|
|
|
static void __init of_ti_divider_clk_setup(struct device_node *node)
|
|
|
|
{
|
|
|
|
struct clk *clk;
|
|
|
|
u32 flags = 0;
|
2019-10-02 20:06:08 +08:00
|
|
|
struct clk_omap_divider *div;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
div = kzalloc(sizeof(*div), GFP_KERNEL);
|
|
|
|
if (!div)
|
|
|
|
return;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
if (ti_clk_divider_populate(node, div, &flags))
|
2013-09-13 17:02:15 +08:00
|
|
|
goto cleanup;
|
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
clk = _register_divider(node, flags, div);
|
2013-09-13 17:02:15 +08:00
|
|
|
if (!IS_ERR(clk)) {
|
|
|
|
of_clk_add_provider(node, of_clk_src_simple_get, clk);
|
|
|
|
of_ti_clk_autoidle_setup(node);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
cleanup:
|
2019-10-02 20:06:08 +08:00
|
|
|
kfree(div->table);
|
|
|
|
kfree(div);
|
2013-09-13 17:02:15 +08:00
|
|
|
}
|
|
|
|
CLK_OF_DECLARE(divider_clk, "ti,divider-clock", of_ti_divider_clk_setup);
|
|
|
|
|
|
|
|
static void __init of_ti_composite_divider_clk_setup(struct device_node *node)
|
|
|
|
{
|
2017-02-09 20:45:45 +08:00
|
|
|
struct clk_omap_divider *div;
|
2019-10-02 20:06:08 +08:00
|
|
|
u32 tmp;
|
2013-09-13 17:02:15 +08:00
|
|
|
|
|
|
|
div = kzalloc(sizeof(*div), GFP_KERNEL);
|
|
|
|
if (!div)
|
|
|
|
return;
|
|
|
|
|
2019-10-02 20:06:08 +08:00
|
|
|
if (ti_clk_divider_populate(node, div, &tmp))
|
2013-09-13 17:02:15 +08:00
|
|
|
goto cleanup;
|
|
|
|
|
|
|
|
if (!ti_clk_add_component(node, &div->hw, CLK_COMPONENT_TYPE_DIVIDER))
|
|
|
|
return;
|
|
|
|
|
|
|
|
cleanup:
|
|
|
|
kfree(div->table);
|
|
|
|
kfree(div);
|
|
|
|
}
|
|
|
|
CLK_OF_DECLARE(ti_composite_divider_clk, "ti,composite-divider-clock",
|
|
|
|
of_ti_composite_divider_clk_setup);
|