2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Support for ir graph modification.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier
31 #include "irgraph_t.h"
36 #include "iredges_t.h"
41 * Turns a node into a "useless" Tuple. The Tuple just forms a tuple
42 * from several inputs.
43 * This is useful if a node returning a tuple is removed, but the Projs
44 * extracting values from the tuple are not available.
46 void turn_into_tuple(ir_node *node, int arity)
48 ir_graph *irg = get_irn_irg(node);
49 ir_node **in = ALLOCAN(ir_node*, arity);
50 ir_node *bad = new_r_Bad(irg, mode_ANY);
53 /* construct a new in array, with every input being bad */
54 for (i = 0; i < arity; ++i) {
57 set_irn_in(node, arity, in);
58 set_irn_op(node, op_Tuple);
62 * Insert irnode `new' in place of irnode `old'
63 * Since `new' may be bigger than `old' replace `old'
64 * by an op_Id which is smaller than everything.
66 void exchange(ir_node *old, ir_node *nw)
71 assert(old != nw && "Exchanging node with itself is not allowed");
73 irg = get_irn_irg(old);
74 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
76 hook_replace(old, nw);
79 * If new outs are on, we can skip the id node creation and reroute
80 * the edges from the old node to the new directly.
82 if (edges_activated(irg)) {
83 /* copy all dependencies from old to new */
84 add_irn_deps(nw, old);
86 edges_reroute(old, nw);
87 edges_reroute_kind(old, nw, EDGE_KIND_DEP);
88 edges_node_deleted(old);
89 /* noone is allowed to reference this node anymore */
90 set_irn_op(old, op_Deleted);
92 /* Else, do it the old-fashioned way. */
95 hook_turn_into_id(old);
99 block = is_Block(nw) ? nw : get_nodes_block(nw);
102 panic("cannot find legal block for id");
106 if (get_irn_op(old)->opar == oparity_dynamic) {
107 DEL_ARR_F(get_irn_in(old));
111 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
116 /* update irg flags */
117 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
118 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO);
119 set_irg_loopinfo_inconsistent(irg);
122 /*--------------------------------------------------------------------*/
123 /* Functionality for collect_phis */
124 /*--------------------------------------------------------------------*/
127 * Walker: links all Phi nodes to their Blocks lists,
128 * all Proj nodes to there predecessors.
130 static void collect_phiprojs_walker(ir_node *n, void *env)
136 ir_node *block = get_nodes_block(n);
137 add_Block_phi(block, n);
138 } else if (is_Proj(n)) {
141 pred = get_Proj_pred(pred);
142 } while (is_Proj(pred));
144 set_irn_link(n, get_irn_link(pred));
145 set_irn_link(pred, n);
149 void collect_phiprojs(ir_graph *irg)
151 assert((ir_resources_reserved(irg) & (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST)) ==
152 (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST));
153 irg_walk_graph(irg, firm_clear_node_and_phi_links, collect_phiprojs_walker, NULL);
156 /*--------------------------------------------------------------------*/
157 /* Functionality for part_block */
158 /*--------------------------------------------------------------------*/
161 * Moves node and all predecessors of node from from_bl to to_bl.
162 * Does not move predecessors of Phi nodes (or block nodes).
164 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl)
169 set_nodes_block(node, to_bl);
172 if (get_irn_mode(node) == mode_T) {
173 ir_node *proj = (ir_node*)get_irn_link(node);
175 if (get_nodes_block(proj) == from_bl)
176 set_nodes_block(proj, to_bl);
177 proj = (ir_node*)get_irn_link(proj);
185 arity = get_irn_arity(node);
186 for (i = 0; i < arity; i++) {
187 ir_node *pred = get_irn_n(node, i);
188 if (get_nodes_block(pred) == from_bl)
189 move(pred, from_bl, to_bl);
193 static void move_projs(const ir_node *node, ir_node *to_bl)
195 const ir_edge_t *edge;
197 if (get_irn_mode(node) != mode_T)
200 foreach_out_edge(node, edge) {
201 ir_node *proj = get_edge_src_irn(edge);
204 set_nodes_block(proj, to_bl);
205 move_projs(proj, to_bl);
210 * Moves node and all predecessors of node from from_bl to to_bl.
211 * Does not move predecessors of Phi nodes (or block nodes).
213 static void move_edges(ir_node *node, ir_node *from_bl, ir_node *to_bl)
218 set_nodes_block(node, to_bl);
221 move_projs(node, to_bl);
223 /* We must not move predecessors of Phi nodes, even if they are in
224 * from_bl. (because these are values from an earlier loop iteration
225 * which are not predecessors of node here)
231 arity = get_irn_arity(node);
232 for (i = 0; i < arity; i++) {
233 ir_node *pred = get_irn_n(node, i);
234 if (get_nodes_block(pred) == from_bl)
235 move_edges(pred, from_bl, to_bl);
239 void part_block(ir_node *node)
241 ir_graph *irg = get_irn_irg(node);
242 ir_node *new_block, *old_block;
245 /* Turn off optimizations so that blocks are not merged again. */
246 int rem_opt = get_opt_optimize();
249 /* Transform the control flow */
250 old_block = get_nodes_block(node);
251 new_block = new_r_Block(irg, get_Block_n_cfgpreds(old_block),
252 get_Block_cfgpred_arr(old_block));
254 /* create a jump from new_block to old_block, which is now the lower one */
255 jmp = new_r_Jmp(new_block);
256 set_irn_in(old_block, 1, &jmp);
258 /* move node and its predecessors to new_block */
259 move(node, old_block, new_block);
261 /* move Phi nodes to new_block */
262 phi = get_Block_phis(old_block);
263 set_Block_phis(new_block, phi);
264 set_Block_phis(old_block, NULL);
266 set_nodes_block(phi, new_block);
267 phi = get_Phi_next(phi);
270 set_optimize(rem_opt);
273 ir_node *part_block_edges(ir_node *node)
275 ir_graph *irg = get_irn_irg(node);
276 ir_node *old_block = get_nodes_block(node);
277 ir_node *new_block = new_r_Block(irg,
278 get_Block_n_cfgpreds(old_block),
279 get_Block_cfgpred_arr(old_block));
280 const ir_edge_t *edge;
281 const ir_edge_t *next;
283 /* old_block has no predecessors anymore for now */
284 set_irn_in(old_block, 0, NULL);
286 /* move node and its predecessors to new_block */
287 move_edges(node, old_block, new_block);
289 /* move Phi nodes to new_block */
290 foreach_out_edge_safe(old_block, edge, next) {
291 ir_node *phi = get_edge_src_irn(edge);
294 set_nodes_block(phi, new_block);
300 void kill_node(ir_node *node)
302 ir_graph *irg = get_irn_irg(node);
304 if (edges_activated(irg)) {
305 edges_node_deleted(node);
307 /* noone is allowed to reference this node anymore */
308 set_irn_op(node, op_Deleted);