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 * @brief Support for ir graph modification.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier
34 #include "irgraph_t.h"
39 #include "iredges_t.h"
43 * Turns a node into a "useless" Tuple. The Tuple just forms a tuple
44 * from several inputs.
45 * This is useful if a node returning a tuple is removed, but the Projs
46 * extracting values from the tuple are not available.
48 void turn_into_tuple (ir_node *node, int arity)
51 set_irn_op(node, op_Tuple);
52 if (get_irn_arity(node) == arity) {
55 /* Allocate new array, don't free old in_array, it's on the obstack. */
56 ir_node *block = get_nodes_block(node);
57 edges_node_deleted(node, current_ir_graph);
58 node->in = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity+1);
59 /* clear the new in array, else edge_notify tries to delete garbage */
60 memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
61 set_nodes_block(node, block);
66 * Insert irnode `new' in place of irnode `old'
67 * Since `new' may be bigger than `old' replace `old'
68 * by an op_Id which is smaller than everything.
70 void exchange(ir_node *old, ir_node *nw)
75 assert(old != nw && "Exchanging node with itself is not allowed");
77 irg = get_irn_irg(old);
78 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
80 hook_replace(old, nw);
83 * If new outs are on, we can skip the id node creation and reroute
84 * the edges from the old node to the new directly.
86 if (edges_activated(irg)) {
87 /* copy all dependencies from old to new */
88 add_irn_deps(nw, old);
90 edges_reroute(old, nw, irg);
91 edges_reroute_kind(old, nw, EDGE_KIND_DEP, irg);
92 edges_node_deleted(old, irg);
96 /* Else, do it the old-fashioned way. */
99 assert(get_irn_op(old)->opar != oparity_dynamic);
101 hook_turn_into_id(old);
105 block = is_Block(nw) ? nw : get_nodes_block(nw);
110 assert(0 && "cannot find legal block for id");
115 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
121 /*--------------------------------------------------------------------*/
122 /* Functionality for collect_phis */
123 /*--------------------------------------------------------------------*/
126 * Walker: links all Phi nodes to their Blocks and
127 * all Proj nodes to there predecessors
129 static void collect(ir_node *n, void *env) {
133 set_irn_link(n, get_irn_link(get_nodes_block(n)));
134 set_irn_link(get_nodes_block(n), 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) {
148 irg_walk_graph(irg, firm_clear_link, collect, NULL);
152 /*--------------------------------------------------------------------*/
153 /* Functionality for part_block */
154 /*--------------------------------------------------------------------*/
157 * Moves node and all predecessors of node from from_bl to to_bl.
158 * Does not move predecessors of Phi nodes (or block nodes).
160 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl) {
162 ir_node *proj, *pred;
165 set_nodes_block(node, to_bl);
168 if (get_irn_mode(node) == mode_T) {
169 proj = get_irn_link(node);
171 if (get_nodes_block(proj) == from_bl)
172 set_nodes_block(proj, to_bl);
173 proj = get_irn_link(proj);
178 if (get_irn_op(node) == op_Phi) return;
180 arity = get_irn_arity(node);
181 for (i = 0; i < arity; i++) {
182 pred = get_irn_n(node, i);
183 if (get_nodes_block(pred) == from_bl)
184 move(pred, from_bl, to_bl);
188 void part_block(ir_node *node) {
193 /* Turn off optimizations so that blocks are not merged again. */
194 int rem_opt = get_opt_optimize();
197 /* Transform the control flow */
198 old_block = get_nodes_block(node);
199 new_block = new_Block(get_Block_n_cfgpreds(old_block),
200 get_Block_cfgpred_arr(old_block));
201 set_irg_current_block(current_ir_graph, new_block);
203 ir_node *jmp = new_Jmp();
204 set_irn_in(old_block, 1, &jmp);
205 irn_vrfy_irg(old_block, current_ir_graph);
208 /* move node and its predecessors to new_block */
209 move(node, old_block, new_block);
211 /* move Phi nodes to new_block */
212 phi = get_irn_link(old_block);
213 set_irn_link(new_block, phi);
214 set_irn_link(old_block, NULL);
216 if(get_nodes_block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
217 obey this condition. How do they get into
218 the list??? Example: InterfaceIII */
219 set_nodes_block(phi, new_block);
220 phi = get_irn_link(phi);
223 set_optimize(rem_opt);