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
30 #include "irgraph_t.h"
35 #include "iredges_t.h"
40 * Turns a node into a "useless" Tuple. The Tuple just forms a tuple
41 * from several inputs.
42 * This is useful if a node returning a tuple is removed, but the Projs
43 * extracting values from the tuple are not available.
45 void turn_into_tuple(ir_node *node, int arity)
47 ir_graph *irg = get_irn_irg(node);
48 ir_node **in = ALLOCAN(ir_node*, arity);
49 ir_node *bad = new_r_Bad(irg, mode_ANY);
52 /* construct a new in array, with every input being bad */
53 for (i = 0; i < arity; ++i) {
56 set_irn_in(node, arity, in);
57 set_irn_op(node, op_Tuple);
61 * Insert irnode `new' in place of irnode `old'
62 * Since `new' may be bigger than `old' replace `old'
63 * by an op_Id which is smaller than everything.
65 void exchange(ir_node *old, ir_node *nw)
70 assert(old != nw && "Exchanging node with itself is not allowed");
72 irg = get_irn_irg(old);
73 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
75 hook_replace(old, nw);
78 * If new outs are on, we can skip the id node creation and reroute
79 * the edges from the old node to the new directly.
81 if (edges_activated(irg)) {
82 /* copy all dependencies from old to new */
83 add_irn_deps(nw, old);
85 edges_reroute(old, nw);
86 edges_reroute_kind(old, nw, EDGE_KIND_DEP);
87 edges_node_deleted(old);
88 /* noone is allowed to reference this node anymore */
89 set_irn_op(old, op_Deleted);
91 /* Else, do it the old-fashioned way. */
94 hook_turn_into_id(old);
98 block = is_Block(nw) ? nw : get_nodes_block(nw);
101 panic("cannot find legal block for id");
105 if (get_irn_op(old)->opar == oparity_dynamic) {
106 DEL_ARR_F(get_irn_in(old));
110 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
115 /* update irg flags */
116 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS
117 | IR_GRAPH_STATE_CONSISTENT_LOOPINFO);
120 /*--------------------------------------------------------------------*/
121 /* Functionality for collect_phis */
122 /*--------------------------------------------------------------------*/
125 * Walker: links all Phi nodes to their Blocks lists,
126 * all Proj nodes to there predecessors.
128 static void collect_phiprojs_walker(ir_node *n, void *env)
134 ir_node *block = get_nodes_block(n);
135 add_Block_phi(block, n);
136 } else if (is_Proj(n)) {
139 pred = get_Proj_pred(pred);
140 } while (is_Proj(pred));
142 set_irn_link(n, get_irn_link(pred));
143 set_irn_link(pred, n);
147 void collect_phiprojs(ir_graph *irg)
149 assert((ir_resources_reserved(irg) & (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST)) ==
150 (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST));
151 irg_walk_graph(irg, firm_clear_node_and_phi_links, collect_phiprojs_walker, NULL);
154 /*--------------------------------------------------------------------*/
155 /* Functionality for part_block */
156 /*--------------------------------------------------------------------*/
159 * Moves node and all predecessors of node from from_bl to to_bl.
160 * Does not move predecessors of Phi nodes (or block nodes).
162 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl)
167 set_nodes_block(node, to_bl);
170 if (get_irn_mode(node) == mode_T) {
171 ir_node *proj = (ir_node*)get_irn_link(node);
173 if (get_nodes_block(proj) == from_bl)
174 set_nodes_block(proj, to_bl);
175 proj = (ir_node*)get_irn_link(proj);
183 arity = get_irn_arity(node);
184 for (i = 0; i < arity; i++) {
185 ir_node *pred = get_irn_n(node, i);
186 if (get_nodes_block(pred) == from_bl)
187 move(pred, from_bl, to_bl);
191 static void move_projs(const ir_node *node, ir_node *to_bl)
193 const ir_edge_t *edge;
195 if (get_irn_mode(node) != mode_T)
198 foreach_out_edge(node, edge) {
199 ir_node *proj = get_edge_src_irn(edge);
202 set_nodes_block(proj, to_bl);
203 move_projs(proj, to_bl);
208 * Moves node and all predecessors of node from from_bl to to_bl.
209 * Does not move predecessors of Phi nodes (or block nodes).
211 static void move_edges(ir_node *node, ir_node *from_bl, ir_node *to_bl)
216 set_nodes_block(node, to_bl);
219 move_projs(node, to_bl);
221 /* We must not move predecessors of Phi nodes, even if they are in
222 * from_bl. (because these are values from an earlier loop iteration
223 * which are not predecessors of node here)
229 arity = get_irn_arity(node);
230 for (i = 0; i < arity; i++) {
231 ir_node *pred = get_irn_n(node, i);
232 if (get_nodes_block(pred) == from_bl)
233 move_edges(pred, from_bl, to_bl);
237 void part_block(ir_node *node)
239 ir_graph *irg = get_irn_irg(node);
240 ir_node *new_block, *old_block;
243 /* Turn off optimizations so that blocks are not merged again. */
244 int rem_opt = get_opt_optimize();
247 /* Transform the control flow */
248 old_block = get_nodes_block(node);
249 new_block = new_r_Block(irg, get_Block_n_cfgpreds(old_block),
250 get_Block_cfgpred_arr(old_block));
252 /* create a jump from new_block to old_block, which is now the lower one */
253 jmp = new_r_Jmp(new_block);
254 set_irn_in(old_block, 1, &jmp);
256 /* move node and its predecessors to new_block */
257 move(node, old_block, new_block);
259 /* move Phi nodes to new_block */
260 phi = get_Block_phis(old_block);
261 set_Block_phis(new_block, phi);
262 set_Block_phis(old_block, NULL);
264 set_nodes_block(phi, new_block);
265 phi = get_Phi_next(phi);
268 set_optimize(rem_opt);
271 ir_node *part_block_edges(ir_node *node)
273 ir_graph *irg = get_irn_irg(node);
274 ir_node *old_block = get_nodes_block(node);
275 ir_node *new_block = new_r_Block(irg,
276 get_Block_n_cfgpreds(old_block),
277 get_Block_cfgpred_arr(old_block));
278 const ir_edge_t *edge;
279 const ir_edge_t *next;
281 /* old_block has no predecessors anymore for now */
282 set_irn_in(old_block, 0, NULL);
284 /* move node and its predecessors to new_block */
285 move_edges(node, old_block, new_block);
287 /* move Phi nodes to new_block */
288 foreach_out_edge_safe(old_block, edge, next) {
289 ir_node *phi = get_edge_src_irn(edge);
292 set_nodes_block(phi, new_block);
298 void kill_node(ir_node *node)
300 ir_graph *irg = get_irn_irg(node);
302 if (edges_activated(irg)) {
303 edges_node_deleted(node);
305 /* noone is allowed to reference this node anymore */
306 set_irn_op(node, op_Deleted);