3 * File name: ir/ir/irgmod.c
4 * Purpose: Support for ir graph modification.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
21 #include "irgraph_t.h"
26 #include "iredges_t.h"
30 * Turns a node into a "useless" Tuple. The Tuple just forms a tuple
31 * from several inputs.
32 * This is useful if a node returning a tuple is removed, but the Projs
33 * extracting values from the tuple are not available.
35 void turn_into_tuple (ir_node *node, int arity)
38 set_irn_op(node, op_Tuple);
39 if (get_irn_arity(node) == arity) {
42 /* Allocate new array, don't free old in_array, it's on the obstack. */
43 ir_node *block = get_nodes_block(node);
44 edges_node_deleted(node, current_ir_graph);
45 node->in = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity+1);
46 /* clear the new in array, else edge_notify tries to delete garbage */
47 memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
48 set_nodes_block(node, block);
53 * Insert irnode `new' in place of irnode `old'
54 * Since `new' may be bigger than `old' replace `old'
55 * by an op_Id which is smaller than everything.
57 void exchange(ir_node *old, ir_node *nw)
62 assert(old != nw && "Exchanging node with itself is not allowed");
64 irg = get_irn_irg(old);
65 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
67 hook_replace(old, nw);
70 * If new outs are on, we can skip the id node creation and reroute
71 * the edges from the old node to the new directly.
73 if (edges_activated(irg)) {
74 /* copy all dependencies from old to new */
75 add_irn_deps(nw, old);
77 edges_reroute(old, nw, irg);
78 edges_reroute_kind(old, nw, EDGE_KIND_DEP, irg);
79 edges_node_deleted(old, irg);
83 /* Else, do it the old-fashioned way. */
86 assert(get_irn_op(old)->opar != oparity_dynamic);
88 hook_turn_into_id(old);
92 block = is_Block(nw) ? nw : get_nodes_block(nw);
97 assert(0 && "cannot find legal block for id");
102 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
108 /*--------------------------------------------------------------------*/
109 /* Functionality for collect_phis */
110 /*--------------------------------------------------------------------*/
113 * Walker: links all Phi nodes to their Blocks and
114 * all Proj nodes to there predecessors
116 static void collect(ir_node *n, void *env) {
120 set_irn_link(n, get_irn_link(get_nodes_block(n)));
121 set_irn_link(get_nodes_block(n), n);
123 else if (is_Proj(n)) {
126 pred = get_Proj_pred(pred);
127 } while (is_Proj(pred));
129 set_irn_link(n, get_irn_link(pred));
130 set_irn_link(pred, n);
134 void collect_phiprojs(ir_graph *irg) {
135 irg_walk_graph(irg, firm_clear_link, collect, NULL);
139 /*--------------------------------------------------------------------*/
140 /* Functionality for part_block */
141 /*--------------------------------------------------------------------*/
144 * Moves node and all predecessors of node from from_bl to to_bl.
145 * Does not move predecessors of Phi nodes (or block nodes).
147 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl) {
149 ir_node *proj, *pred;
152 set_nodes_block(node, to_bl);
155 if (get_irn_mode(node) == mode_T) {
156 proj = get_irn_link(node);
158 if (get_nodes_block(proj) == from_bl)
159 set_nodes_block(proj, to_bl);
160 proj = get_irn_link(proj);
165 if (get_irn_op(node) == op_Phi) return;
167 arity = get_irn_arity(node);
168 for (i = 0; i < arity; i++) {
169 pred = get_irn_n(node, i);
170 if (get_nodes_block(pred) == from_bl)
171 move(pred, from_bl, to_bl);
175 void part_block(ir_node *node) {
180 /* Turn off optimizations so that blocks are not merged again. */
181 int rem_opt = get_opt_optimize();
184 /* Transform the control flow */
185 old_block = get_nodes_block(node);
186 new_block = new_Block(get_Block_n_cfgpreds(old_block),
187 get_Block_cfgpred_arr(old_block));
188 set_irg_current_block(current_ir_graph, new_block);
190 ir_node *jmp = new_Jmp();
191 set_irn_in(old_block, 1, &jmp);
192 irn_vrfy_irg(old_block, current_ir_graph);
195 /* move node and its predecessors to new_block */
196 move(node, old_block, new_block);
198 /* move Phi nodes to new_block */
199 phi = get_irn_link(old_block);
200 set_irn_link(new_block, phi);
201 set_irn_link(old_block, NULL);
203 if(get_nodes_block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
204 obey this condition. How do they get into
205 the list??? Example: InterfaceIII */
206 set_nodes_block(phi, new_block);
207 phi = get_irn_link(phi);
210 set_optimize(rem_opt);