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
34 #include "irgraph_t.h"
39 #include "iredges_t.h"
44 * Turns a node into a "useless" Tuple. The Tuple just forms a tuple
45 * from several inputs.
46 * This is useful if a node returning a tuple is removed, but the Projs
47 * extracting values from the tuple are not available.
49 void turn_into_tuple(ir_node *node, int arity) {
51 set_irn_op(node, op_Tuple);
52 if (get_irn_arity(node) == arity) {
55 ir_graph *irg = get_irn_irg(node);
56 ir_node *block = get_nodes_block(node);
57 edges_node_deleted(node, irg);
58 /* Allocate new array, don't free old in_array, it's on the obstack. */
59 node->in = NEW_ARR_D(ir_node *, irg->obst, arity+1);
60 /* clear the new in array, else edge_notify tries to delete garbage */
61 memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
62 /* set the block back */
63 set_nodes_block(node, block);
68 * Insert irnode `new' in place of irnode `old'
69 * Since `new' may be bigger than `old' replace `old'
70 * by an op_Id which is smaller than everything.
72 void exchange(ir_node *old, ir_node *nw) {
76 assert(old != nw && "Exchanging node with itself is not allowed");
78 irg = get_irn_irg(old);
79 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
81 hook_replace(old, nw);
84 * If new outs are on, we can skip the id node creation and reroute
85 * the edges from the old node to the new directly.
87 if (edges_activated(irg)) {
88 /* copy all dependencies from old to new */
89 add_irn_deps(nw, old);
91 edges_reroute(old, nw, irg);
92 edges_reroute_kind(old, nw, EDGE_KIND_DEP, irg);
93 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);
108 panic("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 lists,
125 * all Proj nodes to there predecessors and all
126 * partBlocks to there MacroBlock header.
128 static void collect_phiprojs_walker(ir_node *n, void *env) {
133 ir_node *block = get_nodes_block(n);
134 set_Phi_next(n, get_Block_phis(block));
135 set_Block_phis(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);
144 } else if (is_Block(n)) {
145 ir_node *mbh = get_Block_MacroBlock(n);
148 set_irn_link(n, get_irn_link(mbh));
149 set_irn_link(mbh, n);
155 * clear all links, including the Phi list of blocks and Phi nodes.
157 static void clear_node_and_phis_links(ir_node *n, void *env) {
160 set_irn_link(n, NULL);
162 set_Block_phis(n, NULL);
164 set_Phi_next(n, NULL);
167 void collect_phiprojs(ir_graph *irg) {
168 irg_walk_graph(irg, clear_node_and_phis_links, collect_phiprojs_walker, NULL);
171 /*--------------------------------------------------------------------*/
172 /* Functionality for part_block */
173 /*--------------------------------------------------------------------*/
176 * Moves node and all predecessors of node from from_bl to to_bl.
177 * Does not move predecessors of Phi nodes (or block nodes).
179 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl) {
183 set_nodes_block(node, to_bl);
186 if (get_irn_mode(node) == mode_T) {
187 ir_node *proj = get_irn_link(node);
189 if (get_nodes_block(proj) == from_bl)
190 set_nodes_block(proj, to_bl);
191 proj = get_irn_link(proj);
199 arity = get_irn_arity(node);
200 for (i = 0; i < arity; i++) {
201 ir_node *pred = get_irn_n(node, i);
202 if (get_nodes_block(pred) == from_bl)
203 move(pred, from_bl, to_bl);
207 void part_block(ir_node *node) {
213 /* Turn off optimizations so that blocks are not merged again. */
214 int rem_opt = get_opt_optimize();
217 /* Transform the control flow */
218 old_block = get_nodes_block(node);
219 mbh = get_Block_MacroBlock(old_block);
220 new_block = new_Block(get_Block_n_cfgpreds(old_block),
221 get_Block_cfgpred_arr(old_block));
223 if (mbh != old_block) {
224 /* we splitting a partBlock */
225 set_Block_MacroBlock(new_block, mbh);
227 /* we are splitting a header: this creates a new header */
228 set_Block_MacroBlock(new_block, new_block);
230 set_irg_current_block(current_ir_graph, new_block);
232 ir_node *jmp = new_Jmp();
233 set_irn_in(old_block, 1, &jmp);
234 irn_vrfy_irg(old_block, current_ir_graph);
237 /* move node and its predecessors to new_block */
238 move(node, old_block, new_block);
240 /* move Phi nodes to new_block */
241 phi = get_Block_phis(old_block);
242 set_Block_phis(new_block, phi);
243 set_Block_phis(old_block, NULL);
245 set_nodes_block(phi, new_block);
246 phi = get_Phi_next(phi);
249 /* rewire partBlocks */
250 if (mbh != old_block) {
251 ir_node *next, *block = get_irn_link(mbh);
253 set_irn_link(mbh, NULL);
254 set_irn_link(old_block, NULL);
256 /* note that we must splice the list of partBlock here */
257 for (; block != NULL; block = next) {
258 ir_node *curr = block;
259 assert(is_Block(curr));
261 next = get_irn_link(block);
262 assert(get_Block_MacroBlock(curr) == mbh);
265 if (curr == old_block) {
266 /* old_block dominates the block, so old_block will be
267 the new macro block header */
268 set_Block_MacroBlock(block, old_block);
269 set_irn_link(block, get_irn_link(old_block));
270 set_irn_link(old_block, block);
274 /* leave it in the mbh */
275 set_irn_link(block, get_irn_link(mbh));
276 set_irn_link(mbh, block);
280 assert(get_Block_n_cfgpreds(curr) == 1);
281 curr = get_Block_cfgpred_block(curr, 0);
286 set_optimize(rem_opt);
289 /* kill a node by setting its predecessors to Bad and finally exchange the node by Bad itself. */
290 void kill_node(ir_node *node) {
291 ir_graph *irg = get_irn_irg(node);
292 ir_node *bad = get_irg_bad(irg);
295 for (i = get_irn_arity(node) - 1; i >= -1; --i) {
296 set_irn_n(node, i, bad);