Lines Matching defs:table
21 static unsigned int _get_table_div(const struct clk_div_table *table,
26 for (clkt = table; clkt->div; clkt++)
38 if (divider->table) {
41 for (clkt = divider->table; clkt->div; clkt++)
66 if (divider->table)
67 return _get_table_div(divider->table, val);
71 static unsigned int _get_table_val(const struct clk_div_table *table,
76 for (clkt = table; clkt->div; clkt++)
88 if (divider->table)
89 return _get_table_val(divider->table, div);
119 static bool _is_valid_table_div(const struct clk_div_table *table,
124 for (clkt = table; clkt->div; clkt++)
134 if (divider->table)
135 return _is_valid_table_div(divider->table, div);
139 static int _div_round_up(const struct clk_div_table *table,
146 for (clkt = table; clkt->div; clkt++) {
159 static int _div_round(const struct clk_div_table *table,
162 if (!table)
165 return _div_round_up(table, parent_rate, rate);
183 bestdiv = _div_round(divider->table, parent_rate, rate);
377 divider->table = tmp;
386 struct clk_div_table *table;
402 /* Determine required size for divider table */
410 pr_err("no valid dividers for %pOFn table\n", node);
414 table = kcalloc(valid_div + 1, sizeof(*table), GFP_KERNEL);
415 if (!table)
423 table[valid_div].div = val;
424 table[valid_div].val = i;
429 div->table = table;
442 if (!divider->table) {
443 /* Clk divider table not provided, determine min/max divs */
453 for (clkt = divider->table; clkt->div; clkt++) {
536 kfree(div->table);
557 kfree(div->table);