Author | Tokens | Token Proportion | Commits | Commit Proportion |
---|---|---|---|---|
Tero Kristo | 2778 | 87.08% | 7 | 38.89% |
J Keerthy | 155 | 4.86% | 1 | 5.56% |
Russ Dill | 138 | 4.33% | 1 | 5.56% |
Dan Carpenter | 45 | 1.41% | 1 | 5.56% |
Arnd Bergmann | 21 | 0.66% | 1 | 5.56% |
Nishanth Menon | 18 | 0.56% | 1 | 5.56% |
Tomi Valkeinen | 16 | 0.50% | 1 | 5.56% |
Kees Cook | 10 | 0.31% | 1 | 5.56% |
Stephen Boyd | 6 | 0.19% | 2 | 11.11% |
Rob Herring | 2 | 0.06% | 1 | 5.56% |
Behan Webster | 1 | 0.03% | 1 | 5.56% |
Total | 3190 | 18 |
/* * TI Divider Clock * * Copyright (C) 2013 Texas Instruments, Inc. * * Tero Kristo <t-kristo@ti.com> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * 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/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> #include "clock.h" #undef pr_fmt #define pr_fmt(fmt) "%s: " fmt, __func__ #define div_mask(d) ((1 << ((d)->width)) - 1) static unsigned int _get_table_maxdiv(const struct clk_div_table *table) { unsigned int maxdiv = 0; const struct clk_div_table *clkt; for (clkt = table; clkt->div; clkt++) if (clkt->div > maxdiv) maxdiv = clkt->div; return maxdiv; } static unsigned int _get_maxdiv(struct clk_omap_divider *divider) { if (divider->flags & CLK_DIVIDER_ONE_BASED) return div_mask(divider); if (divider->flags & CLK_DIVIDER_POWER_OF_TWO) return 1 << div_mask(divider); if (divider->table) return _get_table_maxdiv(divider->table); return div_mask(divider) + 1; } 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; } static unsigned int _get_div(struct clk_omap_divider *divider, unsigned int val) { 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; } static unsigned int _get_val(struct clk_omap_divider *divider, u8 div) { 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) { struct clk_omap_divider *divider = to_clk_omap_divider(hw); unsigned int div, val; val = ti_clk_ll_ops->clk_readl(÷r->reg) >> divider->shift; val &= div_mask(divider); 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", clk_hw_get_name(hw)); return parent_rate; } return DIV_ROUND_UP(parent_rate, div); } /* * 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; } static bool _is_valid_div(struct clk_omap_divider *divider, unsigned int div) { 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; } 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); } static int ti_clk_divider_bestdiv(struct clk_hw *hw, unsigned long rate, unsigned long *best_parent_rate) { struct clk_omap_divider *divider = to_clk_omap_divider(hw); int i, bestdiv = 0; unsigned long parent_rate, best = 0, now, maxdiv; unsigned long parent_rate_saved = *best_parent_rate; if (!rate) rate = 1; maxdiv = _get_maxdiv(divider); if (!(clk_hw_get_flags(hw) & CLK_SET_RATE_PARENT)) { parent_rate = *best_parent_rate; bestdiv = _div_round(divider->table, parent_rate, rate); 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; } parent_rate = clk_hw_round_rate(clk_hw_get_parent(hw), MULT_ROUND_UP(rate, i)); now = DIV_ROUND_UP(parent_rate, i); if (now <= rate && now > best) { bestdiv = i; best = now; *best_parent_rate = parent_rate; } } if (!bestdiv) { bestdiv = _get_maxdiv(divider); *best_parent_rate = clk_hw_round_rate(clk_hw_get_parent(hw), 1); } 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); return DIV_ROUND_UP(*prate, div); } static int ti_clk_divider_set_rate(struct clk_hw *hw, unsigned long rate, unsigned long parent_rate) { struct clk_omap_divider *divider; unsigned int div, value; u32 val; if (!hw || !rate) return -EINVAL; divider = to_clk_omap_divider(hw); div = DIV_ROUND_UP(parent_rate, rate); value = _get_val(divider, div); if (value > div_mask(divider)) value = div_mask(divider); if (divider->flags & CLK_DIVIDER_HIWORD_MASK) { val = div_mask(divider) << (divider->shift + 16); } else { val = ti_clk_ll_ops->clk_readl(÷r->reg); val &= ~(div_mask(divider) << divider->shift); } val |= value << divider->shift; ti_clk_ll_ops->clk_writel(val, ÷r->reg); ti_clk_latch(÷r->reg, divider->latch); return 0; } /** * 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; divider->context = val & div_mask(divider); 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); val &= ~(div_mask(divider) << divider->shift); val |= divider->context << divider->shift; ti_clk_ll_ops->clk_writel(val, ÷r->reg); } 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, .save_context = clk_divider_save_context, .restore_context = clk_divider_restore_context, }; static struct clk *_register_divider(struct device *dev, const char *name, const char *parent_name, unsigned long flags, struct clk_omap_reg *reg, u8 shift, u8 width, s8 latch, u8 clk_divider_flags, const struct clk_div_table *table) { struct clk_omap_divider *div; struct clk *clk; struct clk_init_data init; if (clk_divider_flags & CLK_DIVIDER_HIWORD_MASK) { if (width + shift > 16) { pr_warn("divider value exceeds LOWORD field\n"); return ERR_PTR(-EINVAL); } } /* allocate the divider */ div = kzalloc(sizeof(*div), GFP_KERNEL); if (!div) return ERR_PTR(-ENOMEM); init.name = name; init.ops = &ti_clk_divider_ops; init.flags = flags; init.parent_names = (parent_name ? &parent_name : NULL); init.num_parents = (parent_name ? 1 : 0); /* struct clk_divider assignments */ memcpy(&div->reg, reg, sizeof(*reg)); div->shift = shift; div->width = width; div->latch = latch; div->flags = clk_divider_flags; div->hw.init = &init; div->table = table; /* register the clock */ clk = ti_clk_register(dev, &div->hw, name); if (IS_ERR(clk)) kfree(div); return clk; } int ti_clk_parse_divider_data(int *div_table, int num_dividers, int max_div, u8 flags, u8 *width, const struct clk_div_table **table) { int valid_div = 0; u32 val; int div; int i; struct clk_div_table *tmp; if (!div_table) { if (flags & CLKF_INDEX_STARTS_AT_ONE) val = 1; else val = 0; div = 1; while (div < max_div) { if (flags & CLKF_INDEX_POWER_OF_TWO) div <<= 1; else div++; val++; } *width = fls(val); *table = NULL; return 0; } i = 0; while (!num_dividers || i < num_dividers) { if (div_table[i] == -1) break; if (div_table[i]) valid_div++; i++; } num_dividers = i; tmp = kcalloc(valid_div + 1, sizeof(*tmp), GFP_KERNEL); if (!tmp) { *table = ERR_PTR(-ENOMEM); return -ENOMEM; } valid_div = 0; *width = 0; for (i = 0; i < num_dividers; i++) if (div_table[i] > 0) { tmp[valid_div].div = div_table[i]; tmp[valid_div].val = i; valid_div++; *width = i; } *width = fls(*width); *table = tmp; return 0; } static const struct clk_div_table * _get_div_table_from_setup(struct ti_clk_divider *setup, u8 *width) { const struct clk_div_table *table = NULL; ti_clk_parse_divider_data(setup->dividers, setup->num_dividers, setup->max_div, setup->flags, width, &table); return table; } struct clk_hw *ti_clk_build_component_div(struct ti_clk_divider *setup) { struct clk_omap_divider *div; struct clk_omap_reg *reg; int ret; if (!setup) return NULL; div = kzalloc(sizeof(*div), GFP_KERNEL); if (!div) return ERR_PTR(-ENOMEM); reg = (struct clk_omap_reg *)&div->reg; reg->index = setup->module; reg->offset = setup->reg; if (setup->flags & CLKF_INDEX_STARTS_AT_ONE) div->flags |= CLK_DIVIDER_ONE_BASED; if (setup->flags & CLKF_INDEX_POWER_OF_TWO) div->flags |= CLK_DIVIDER_POWER_OF_TWO; div->table = _get_div_table_from_setup(setup, &div->width); if (IS_ERR(div->table)) { ret = PTR_ERR(div->table); kfree(div); return ERR_PTR(ret); } div->shift = setup->bit_shift; div->latch = -EINVAL; return &div->hw; } struct clk *ti_clk_register_divider(struct ti_clk *setup) { struct ti_clk_divider *div = setup->data; struct clk_omap_reg reg = { .index = div->module, .offset = div->reg, }; u8 width; u32 flags = 0; u8 div_flags = 0; const struct clk_div_table *table; struct clk *clk; if (div->flags & CLKF_INDEX_STARTS_AT_ONE) div_flags |= CLK_DIVIDER_ONE_BASED; if (div->flags & CLKF_INDEX_POWER_OF_TWO) div_flags |= CLK_DIVIDER_POWER_OF_TWO; if (div->flags & CLKF_SET_RATE_PARENT) flags |= CLK_SET_RATE_PARENT; table = _get_div_table_from_setup(div, &width); if (IS_ERR(table)) return (struct clk *)table; clk = _register_divider(NULL, setup->name, div->parent, flags, ®, div->bit_shift, width, -EINVAL, div_flags, table); if (IS_ERR(clk)) kfree(table); return clk; } static struct clk_div_table * __init ti_clk_get_div_table(struct device_node *node) { 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) return NULL; 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) { pr_err("no valid dividers for %pOFn table\n", node); return ERR_PTR(-EINVAL); } table = kcalloc(valid_div + 1, sizeof(*table), GFP_KERNEL); if (!table) return ERR_PTR(-ENOMEM); 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++; } } return table; } static int _get_divider_width(struct device_node *node, const struct clk_div_table *table, u8 flags) { u32 min_div; u32 max_div; u32 val = 0; u32 div; if (!table) { /* 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)) { pr_err("no max-div for %pOFn!\n", node); return -EINVAL; } /* Determine bit width for the field */ if (flags & CLK_DIVIDER_ONE_BASED) val = 1; div = min_div; while (div < max_div) { if (flags & CLK_DIVIDER_POWER_OF_TWO) div <<= 1; else div++; val++; } } else { div = 0; while (table[div].div) { val = table[div].val; div++; } } return fls(val); } static int __init ti_clk_divider_populate(struct device_node *node, struct clk_omap_reg *reg, const struct clk_div_table **table, u32 *flags, u8 *div_flags, u8 *width, u8 *shift, s8 *latch) { u32 val; int ret; ret = ti_clk_get_reg_addr(node, 0, reg); if (ret) return ret; if (!of_property_read_u32(node, "ti,bit-shift", &val)) *shift = val; else *shift = 0; if (latch) { if (!of_property_read_u32(node, "ti,latch-bit", &val)) *latch = val; else *latch = -EINVAL; } *flags = 0; *div_flags = 0; if (of_property_read_bool(node, "ti,index-starts-at-one")) *div_flags |= CLK_DIVIDER_ONE_BASED; if (of_property_read_bool(node, "ti,index-power-of-two")) *div_flags |= CLK_DIVIDER_POWER_OF_TWO; if (of_property_read_bool(node, "ti,set-rate-parent")) *flags |= CLK_SET_RATE_PARENT; *table = ti_clk_get_div_table(node); if (IS_ERR(*table)) return PTR_ERR(*table); *width = _get_divider_width(node, *table, *div_flags); return 0; } /** * 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; const char *parent_name; struct clk_omap_reg reg; u8 clk_divider_flags = 0; u8 width = 0; u8 shift = 0; s8 latch = -EINVAL; const struct clk_div_table *table = NULL; u32 flags = 0; parent_name = of_clk_get_parent_name(node, 0); if (ti_clk_divider_populate(node, ®, &table, &flags, &clk_divider_flags, &width, &shift, &latch)) goto cleanup; clk = _register_divider(NULL, node->name, parent_name, flags, ®, shift, width, latch, clk_divider_flags, table); if (!IS_ERR(clk)) { of_clk_add_provider(node, of_clk_src_simple_get, clk); of_ti_clk_autoidle_setup(node); return; } cleanup: kfree(table); } 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) { struct clk_omap_divider *div; u32 val; div = kzalloc(sizeof(*div), GFP_KERNEL); if (!div) return; if (ti_clk_divider_populate(node, &div->reg, &div->table, &val, &div->flags, &div->width, &div->shift, NULL) < 0) 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);
Information contained on this website is for historical information purposes only and does not indicate or represent copyright ownership.
Created with Cregit http://github.com/cregit/cregit
Version 2.0-RC1