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) {
50 set_irn_op(node, op_Tuple);
51 if (get_irn_arity(node) == arity) {
54 /* don't use get_nodes_block here, we allow turn_into_tuple for unpinned nodes */
55 ir_node *block = get_irn_n(node, -1);
56 /* Allocate new array, don't free old in_array, it's on the obstack. */
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_irn_n(node, -1, 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) {
74 assert(old != nw && "Exchanging node with itself is not allowed");
76 irg = get_irn_irg(old);
77 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
79 hook_replace(old, nw);
82 * If new outs are on, we can skip the id node creation and reroute
83 * the edges from the old node to the new directly.
85 if (edges_activated(irg)) {
86 /* copy all dependencies from old to new */
87 add_irn_deps(nw, old);
89 edges_reroute(old, nw, irg);
90 edges_reroute_kind(old, nw, EDGE_KIND_DEP, irg);
91 edges_node_deleted(old, irg);
94 /* Else, do it the old-fashioned way. */
97 assert(get_irn_op(old)->opar != oparity_dynamic);
99 hook_turn_into_id(old);
103 block = is_Block(nw) ? nw : get_nodes_block(nw);
108 assert(0 && "cannot find legal block for id");
113 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
119 /*--------------------------------------------------------------------*/
120 /* Functionality for collect_phis */
121 /*--------------------------------------------------------------------*/
124 * Walker: links all Phi nodes to their Blocks and
125 * all Proj nodes to there predecessors
127 static void collect(ir_node *n, void *env) {
131 set_irn_link(n, get_irn_link(get_nodes_block(n)));
132 set_irn_link(get_nodes_block(n), 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) {
145 irg_walk_graph(irg, firm_clear_link, collect, NULL);
149 /*--------------------------------------------------------------------*/
150 /* Functionality for part_block */
151 /*--------------------------------------------------------------------*/
154 * Moves node and all predecessors of node from from_bl to to_bl.
155 * Does not move predecessors of Phi nodes (or block nodes).
157 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl) {
159 ir_node *proj, *pred;
162 set_nodes_block(node, to_bl);
165 if (get_irn_mode(node) == mode_T) {
166 proj = get_irn_link(node);
168 if (get_nodes_block(proj) == from_bl)
169 set_nodes_block(proj, to_bl);
170 proj = get_irn_link(proj);
175 if (get_irn_op(node) == op_Phi) return;
177 arity = get_irn_arity(node);
178 for (i = 0; i < arity; i++) {
179 pred = get_irn_n(node, i);
180 if (get_nodes_block(pred) == from_bl)
181 move(pred, from_bl, to_bl);
185 void part_block(ir_node *node) {
190 /* Turn off optimizations so that blocks are not merged again. */
191 int rem_opt = get_opt_optimize();
194 /* Transform the control flow */
195 old_block = get_nodes_block(node);
196 new_block = new_Block(get_Block_n_cfgpreds(old_block),
197 get_Block_cfgpred_arr(old_block));
198 set_irg_current_block(current_ir_graph, new_block);
200 ir_node *jmp = new_Jmp();
201 set_irn_in(old_block, 1, &jmp);
202 irn_vrfy_irg(old_block, current_ir_graph);
205 /* move node and its predecessors to new_block */
206 move(node, old_block, new_block);
208 /* move Phi nodes to new_block */
209 phi = get_irn_link(old_block);
210 set_irn_link(new_block, phi);
211 set_irn_link(old_block, NULL);
213 if(get_nodes_block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
214 obey this condition. How do they get into
215 the list??? Example: InterfaceIII */
216 set_nodes_block(phi, new_block);
217 phi = get_irn_link(phi);
220 set_optimize(rem_opt);