Lines Matching defs:table
29 static unsigned int _get_table_div(const struct clk_div_table *table,
34 for (clkt = table; clkt->div; clkt++)
46 if (divider->table) {
49 for (clkt = divider->table; clkt->div; clkt++)
74 if (divider->table)
75 return _get_table_div(divider->table, val);
79 static unsigned int _get_table_val(const struct clk_div_table *table,
84 for (clkt = table; clkt->div; clkt++)
96 if (divider->table)
97 return _get_table_val(divider->table, div);
127 static bool _is_valid_table_div(const struct clk_div_table *table,
132 for (clkt = table; clkt->div; clkt++)
142 if (divider->table)
143 return _is_valid_table_div(divider->table, div);
147 static int _div_round_up(const struct clk_div_table *table,
154 for (clkt = table; clkt->div; clkt++) {
167 static int _div_round(const struct clk_div_table *table,
170 if (!table)
173 return _div_round_up(table, parent_rate, rate);
191 bestdiv = _div_round(divider->table, parent_rate, rate);
385 divider->table = tmp;
394 struct clk_div_table *table;
410 /* Determine required size for divider table */
418 pr_err("no valid dividers for %pOFn table\n", node);
422 table = kcalloc(valid_div + 1, sizeof(*table), GFP_KERNEL);
423 if (!table)
431 table[valid_div].div = val;
432 table[valid_div].val = i;
437 div->table = table;
450 if (!divider->table) {
451 /* Clk divider table not provided, determine min/max divs */
461 for (clkt = divider->table; clkt->div; clkt++) {
544 kfree(div->table);
565 kfree(div->table);