Cross Reference: /drivers/clk/clk.c

Lines Matching refs:new
142 	struct rb_node **new = &(freq_stats_table->rb_node), *parent = NULL;
145 	/* Figure out where to put new node */
146 	while (*new) {
147 		this = rb_entry(*new, struct freq_stats, node);
148 		parent = *new;
151 			new = &((*new)->rb_left);
153 			new = &((*new)->rb_right);
161 	/* Add new node and rebalance tree. */
162 	rb_link_node(&this->node, parent, new);
1242  * @new_rate: new clk rate
1407 	 * find index of new parent clock using cached parent ptrs,
1458 	 * If the clock is prepared, migrate the prepared state to the new
1460 	 * forcing the clock and the new parent on.  This ensures that all
1576 	/* include clk in new parent's PRE_RATE_CHANGE notifications */
1588  * calculate the new rates returning the topmost clock that has to be
1635 	/* try finding the new parent index */
1683 	/* handle the new child who might not be in clk->children yet */
1694  * walk down a subtree and set the new rates notifying the rate
1773 	/* handle the new child who might not be in clk->children yet */
1779  * clk_set_rate - specify a new rate for clk
1781  * @rate: the new rate for clk
1789  * *parent_rate comes back with a new rate for clk's parent then we propagate
1819 	/* calculate new rates and get the topmost changed clock */
1926  * @parent: the new input to clk
1928  * Re-parent clk to use parent as its new input source.  If clk is in
1965 	/* try finding the new parent index */
2164 	 * Every time a new clk is clk_init'd then we walk the list of orphan
2296  * clk_register - allocate a new clock, register it and return an opaque cookie
2300  * clk_register is the primary interface for populating the clock tree with new
2574  * clk_notifier_data.old_rate and the new frequency is passed via struct
2597 	/* if clk wasn't in the notifier list, allocate new clk_notifier */