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"
29 /* Turns a node into a "useless" Tuple. The Tuple just forms a tuple
31 This is useful if a node returning a tuple is removed, but the Projs
32 extracting values from the tuple are not available. */
34 turn_into_tuple (ir_node *node, int arity)
37 set_irn_op(node, op_Tuple);
38 if (get_irn_arity(node) == arity) {
41 /* Allocate new array, don't free old in_array, it's on the obstack. */
42 ir_node *block = get_nodes_block(node);
43 edges_node_deleted(node, current_ir_graph);
44 node->in = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity+1);
45 /* clear the new in array, else edge_notify tries to delete garbage */
46 memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
47 set_nodes_block(node, block);
51 /* Insert irnode `new' in place of irnode `old'
52 Since `new' may be bigger than `old' replace `old'
53 by an op_Id which is smaller than everything */
55 exchange (ir_node *old, ir_node *nw)
57 assert(old != nw && "Exchanging node with itself is not allowed");
58 hook_replace(old, nw);
61 * If new outs are on, we can skip the id node creation and reroute
62 * the edges from the old node to the new directly.
64 if (edges_activated(current_ir_graph)) {
65 /* copy all dependencies from old to new */
66 add_irn_deps(nw, old);
68 edges_reroute(old, nw, current_ir_graph);
69 edges_reroute_kind(old, nw, EDGE_KIND_DEP, current_ir_graph);
70 edges_node_deleted(old, current_ir_graph);
74 /* Else, do it the old-fashioned way. */
76 ir_graph *irg = get_irn_irg (old);
81 assert(get_irn_op(old)->opar != oparity_dynamic);
83 hook_turn_into_id(old);
87 block = is_Block(nw) ? nw : get_nodes_block(nw);
92 assert(0 && "cannot find legal block for id");
97 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
103 /*--------------------------------------------------------------------*/
104 /* Functionality for collect_phis */
105 /*--------------------------------------------------------------------*/
108 * Walker: links all Phi nodes to their Blocks and
109 * all Proj nodes to there predecessors
111 static void collect(ir_node *n, void *env) {
115 set_irn_link(n, get_irn_link(get_nodes_block(n)));
116 set_irn_link(get_nodes_block(n), n);
118 else if (is_Proj(n)) {
121 pred = get_Proj_pred(pred);
122 } while (is_Proj(pred));
124 set_irn_link(n, get_irn_link(pred));
125 set_irn_link(pred, n);
129 void collect_phiprojs(ir_graph *irg) {
130 irg_walk_graph(irg, firm_clear_link, collect, NULL);
134 /*--------------------------------------------------------------------*/
135 /* Functionality for part_block */
136 /*--------------------------------------------------------------------*/
139 * Moves node and all predecessors of node from from_bl to to_bl.
140 * Does not move predecessors of Phi nodes (or block nodes).
142 static void move (ir_node *node, ir_node *from_bl, ir_node *to_bl) {
144 ir_node *proj, *pred;
147 set_nodes_block(node, to_bl);
150 if (get_irn_mode(node) == mode_T) {
151 proj = get_irn_link(node);
153 if (get_nodes_block(proj) == from_bl)
154 set_nodes_block(proj, to_bl);
155 proj = get_irn_link(proj);
160 if (get_irn_op(node) == op_Phi) return;
162 arity = get_irn_arity(node);
163 for (i = 0; i < arity; i++) {
164 pred = get_irn_n(node, i);
165 if (get_nodes_block(pred) == from_bl)
166 move(pred, from_bl, to_bl);
170 void part_block(ir_node *node) {
175 /* Turn off optimizations so that blocks are not merged again. */
176 int rem_opt = get_opt_optimize();
179 /* Transform the control flow */
180 old_block = get_nodes_block(node);
181 new_block = new_Block(get_Block_n_cfgpreds(old_block),
182 get_Block_cfgpred_arr(old_block));
183 set_irg_current_block(current_ir_graph, new_block);
185 ir_node *jmp = new_Jmp();
186 set_irn_in(old_block, 1, &jmp);
187 irn_vrfy_irg(old_block, current_ir_graph);
190 /* move node and its predecessors to new_block */
191 move(node, old_block, new_block);
193 /* move Phi nodes to new_block */
194 phi = get_irn_link(old_block);
195 set_irn_link(new_block, phi);
196 set_irn_link(old_block, NULL);
198 if(get_nodes_block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
199 obey this condition. How do they get into
200 the list??? Example: InterfaceIII */
201 set_nodes_block(phi, new_block);
202 phi = get_irn_link(phi);
205 set_optimize(rem_opt);