2 * Copyright (C) 1995-2007 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 * File name: ir/ir/irgmod.c
23 * Purpose: Support for ir graph modification.
24 * Author: Martin Trapp, Christian Schaefer
25 * Modified by: Goetz Lindenmaier
28 * Copyright: (c) 1998-2003 Universität Karlsruhe
39 #include "irgraph_t.h"
44 #include "iredges_t.h"
48 * Turns a node into a "useless" Tuple. The Tuple just forms a tuple
49 * from several inputs.
50 * This is useful if a node returning a tuple is removed, but the Projs
51 * extracting values from the tuple are not available.
53 void turn_into_tuple (ir_node *node, int arity)
56 set_irn_op(node, op_Tuple);
57 if (get_irn_arity(node) == arity) {
60 /* Allocate new array, don't free old in_array, it's on the obstack. */
61 ir_node *block = get_nodes_block(node);
62 edges_node_deleted(node, current_ir_graph);
63 node->in = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity+1);
64 /* clear the new in array, else edge_notify tries to delete garbage */
65 memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
66 set_nodes_block(node, block);
71 * Insert irnode `new' in place of irnode `old'
72 * Since `new' may be bigger than `old' replace `old'
73 * by an op_Id which is smaller than everything.
75 void exchange(ir_node *old, ir_node *nw)
80 assert(old != nw && "Exchanging node with itself is not allowed");
82 irg = get_irn_irg(old);
83 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
85 hook_replace(old, nw);
88 * If new outs are on, we can skip the id node creation and reroute
89 * the edges from the old node to the new directly.
91 if (edges_activated(irg)) {
92 /* copy all dependencies from old to new */
93 add_irn_deps(nw, old);
95 edges_reroute(old, nw, irg);
96 edges_reroute_kind(old, nw, EDGE_KIND_DEP, irg);
97 edges_node_deleted(old, irg);
101 /* Else, do it the old-fashioned way. */
104 assert(get_irn_op(old)->opar != oparity_dynamic);
106 hook_turn_into_id(old);
110 block = is_Block(nw) ? nw : get_nodes_block(nw);
115 assert(0 && "cannot find legal block for id");
120 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
126 /*--------------------------------------------------------------------*/
127 /* Functionality for collect_phis */
128 /*--------------------------------------------------------------------*/
131 * Walker: links all Phi nodes to their Blocks and
132 * all Proj nodes to there predecessors
134 static void collect(ir_node *n, void *env) {
138 set_irn_link(n, get_irn_link(get_nodes_block(n)));
139 set_irn_link(get_nodes_block(n), n);
141 else if (is_Proj(n)) {
144 pred = get_Proj_pred(pred);
145 } while (is_Proj(pred));
147 set_irn_link(n, get_irn_link(pred));
148 set_irn_link(pred, n);
152 void collect_phiprojs(ir_graph *irg) {
153 irg_walk_graph(irg, firm_clear_link, collect, NULL);
157 /*--------------------------------------------------------------------*/
158 /* Functionality for part_block */
159 /*--------------------------------------------------------------------*/
162 * Moves node and all predecessors of node from from_bl to to_bl.
163 * Does not move predecessors of Phi nodes (or block nodes).
165 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl) {
167 ir_node *proj, *pred;
170 set_nodes_block(node, to_bl);
173 if (get_irn_mode(node) == mode_T) {
174 proj = get_irn_link(node);
176 if (get_nodes_block(proj) == from_bl)
177 set_nodes_block(proj, to_bl);
178 proj = get_irn_link(proj);
183 if (get_irn_op(node) == op_Phi) return;
185 arity = get_irn_arity(node);
186 for (i = 0; i < arity; i++) {
187 pred = get_irn_n(node, i);
188 if (get_nodes_block(pred) == from_bl)
189 move(pred, from_bl, to_bl);
193 void part_block(ir_node *node) {
198 /* Turn off optimizations so that blocks are not merged again. */
199 int rem_opt = get_opt_optimize();
202 /* Transform the control flow */
203 old_block = get_nodes_block(node);
204 new_block = new_Block(get_Block_n_cfgpreds(old_block),
205 get_Block_cfgpred_arr(old_block));
206 set_irg_current_block(current_ir_graph, new_block);
208 ir_node *jmp = new_Jmp();
209 set_irn_in(old_block, 1, &jmp);
210 irn_vrfy_irg(old_block, current_ir_graph);
213 /* move node and its predecessors to new_block */
214 move(node, old_block, new_block);
216 /* move Phi nodes to new_block */
217 phi = get_irn_link(old_block);
218 set_irn_link(new_block, phi);
219 set_irn_link(old_block, NULL);
221 if(get_nodes_block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
222 obey this condition. How do they get into
223 the list??? Example: InterfaceIII */
224 set_nodes_block(phi, new_block);
225 phi = get_irn_link(phi);
228 set_optimize(rem_opt);