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);
117 /*--------------------------------------------------------------------*/
118 /* Functionality for collect_phis */
119 /*--------------------------------------------------------------------*/
122 * Walker: links all Phi nodes to their Blocks lists,
123 * all Proj nodes to there predecessors.
125 static void collect_phiprojs_walker(ir_node *n, void *env)
131 ir_node *block = get_nodes_block(n);
132 add_Block_phi(block, n);
133 } else if (is_Proj(n)) {
136 pred = get_Proj_pred(pred);
137 } while (is_Proj(pred));
139 set_irn_link(n, get_irn_link(pred));
140 set_irn_link(pred, n);
144 void collect_phiprojs(ir_graph *irg)
146 assert((ir_resources_reserved(irg) & (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST)) ==
147 (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST));
148 irg_walk_graph(irg, firm_clear_node_and_phi_links, collect_phiprojs_walker, NULL);
151 /*--------------------------------------------------------------------*/
152 /* Functionality for part_block */
153 /*--------------------------------------------------------------------*/
156 * Moves node and all predecessors of node from from_bl to to_bl.
157 * Does not move predecessors of Phi nodes (or block nodes).
159 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl)
164 set_nodes_block(node, to_bl);
167 if (get_irn_mode(node) == mode_T) {
168 ir_node *proj = (ir_node*)get_irn_link(node);
170 if (get_nodes_block(proj) == from_bl)
171 set_nodes_block(proj, to_bl);
172 proj = (ir_node*)get_irn_link(proj);
180 arity = get_irn_arity(node);
181 for (i = 0; i < arity; i++) {
182 ir_node *pred = get_irn_n(node, i);
183 if (get_nodes_block(pred) == from_bl)
184 move(pred, from_bl, to_bl);
189 * Moves node and all predecessors of node from from_bl to to_bl.
190 * Does not move predecessors of Phi nodes (or block nodes).
192 static void move_edges(ir_node *node, ir_node *from_bl, ir_node *to_bl)
197 set_nodes_block(node, to_bl);
200 if (get_irn_mode(node) == mode_T) {
201 const ir_edge_t *edge;
202 foreach_out_edge(node, edge) {
203 ir_node *proj = get_edge_src_irn(edge);
204 set_nodes_block(proj, to_bl);
208 /* We must not move predecessors of Phi nodes, even if they are in
209 * from_bl. (because these are values from an earlier loop iteration
210 * which are not predecessors of node here)
216 arity = get_irn_arity(node);
217 for (i = 0; i < arity; i++) {
218 ir_node *pred = get_irn_n(node, i);
219 if (get_nodes_block(pred) == from_bl)
220 move_edges(pred, from_bl, to_bl);
224 void part_block(ir_node *node)
226 ir_graph *irg = get_irn_irg(node);
227 ir_node *new_block, *old_block;
230 /* Turn off optimizations so that blocks are not merged again. */
231 int rem_opt = get_opt_optimize();
234 /* Transform the control flow */
235 old_block = get_nodes_block(node);
236 new_block = new_r_Block(irg, get_Block_n_cfgpreds(old_block),
237 get_Block_cfgpred_arr(old_block));
239 /* create a jump from new_block to old_block, which is now the lower one */
240 jmp = new_r_Jmp(new_block);
241 set_irn_in(old_block, 1, &jmp);
243 /* move node and its predecessors to new_block */
244 move(node, old_block, new_block);
246 /* move Phi nodes to new_block */
247 phi = get_Block_phis(old_block);
248 set_Block_phis(new_block, phi);
249 set_Block_phis(old_block, NULL);
251 set_nodes_block(phi, new_block);
252 phi = get_Phi_next(phi);
255 set_optimize(rem_opt);
258 ir_node *part_block_edges(ir_node *node)
260 ir_graph *irg = get_irn_irg(node);
261 ir_node *old_block = get_nodes_block(node);
262 ir_node *new_block = new_r_Block(irg,
263 get_Block_n_cfgpreds(old_block),
264 get_Block_cfgpred_arr(old_block));
265 const ir_edge_t *edge;
266 const ir_edge_t *next;
268 /* old_block has no predecessors anymore for now */
269 set_irn_in(old_block, 0, NULL);
271 /* move node and its predecessors to new_block */
272 move_edges(node, old_block, new_block);
274 /* move Phi nodes to new_block */
275 foreach_out_edge_safe(old_block, edge, next) {
276 ir_node *phi = get_edge_src_irn(edge);
279 set_nodes_block(phi, new_block);
285 void kill_node(ir_node *node)
287 ir_graph *irg = get_irn_irg(node);
289 if (edges_activated(irg)) {
290 edges_node_deleted(node);
292 /* noone is allowed to reference this node anymore */
293 set_irn_op(node, op_Deleted);