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_invalidate(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 hook_replace(old, nw);
60 * If new outs are on, we can skip the id node creation and reroute
61 * the edges from the old node to the new directly.
63 if (edges_activated(current_ir_graph)) {
64 edges_reroute(old, nw, current_ir_graph);
67 /* Else, do it the old-fashioned way. */
69 ir_graph *irg = get_irn_irg (old);
74 assert(get_irn_op(old)->opar != oparity_dynamic);
76 hook_turn_into_id(old);
80 block = is_Block(nw) ? nw : get_nodes_block(nw);
85 assert(0 && "cannot find legal block for id");
90 old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
96 /*--------------------------------------------------------------------*/
97 /* Functionality for collect_phis */
98 /*--------------------------------------------------------------------*/
101 collect (ir_node *n, void *env) {
103 if (get_irn_op(n) == op_Phi) {
104 set_irn_link(n, get_irn_link(get_nodes_block(n)));
105 set_irn_link(get_nodes_block(n), n);
107 if (get_irn_op(n) == op_Proj) {
109 while (get_irn_op(pred) == op_Proj)
110 pred = get_Proj_pred(pred);
111 set_irn_link(n, get_irn_link(pred));
112 set_irn_link(pred, n);
116 void collect_phiprojs(ir_graph *irg) {
119 /* Remember external state of current_ir_graph. */
120 rem = current_ir_graph;
121 current_ir_graph = irg;
123 irg_walk(get_irg_end(current_ir_graph), firm_clear_link, collect, NULL);
125 current_ir_graph = rem;
129 /*--------------------------------------------------------------------*/
130 /* Functionality for part_block */
131 /*--------------------------------------------------------------------*/
134 * Moves node and all predecessors of node from from_bl to to_bl.
135 * Does not move predecessors of Phi nodes (or block nodes).
137 static void move (ir_node *node, ir_node *from_bl, ir_node *to_bl) {
139 ir_node *proj, *pred;
142 set_nodes_block(node, to_bl);
145 if (get_irn_mode(node) == mode_T) {
146 proj = get_irn_link(node);
148 if (get_nodes_block(proj) == from_bl)
149 set_nodes_block(proj, to_bl);
150 proj = get_irn_link(proj);
155 if (get_irn_op(node) == op_Phi) return;
157 arity = get_irn_arity(node);
158 for (i = 0; i < arity; i++) {
159 pred = get_irn_n(node, i);
160 if (get_nodes_block(pred) == from_bl)
161 move(pred, from_bl, to_bl);
165 void part_block(ir_node *node) {
170 /* Turn off optimizations so that blocks are not merged again. */
171 int rem_opt = get_opt_optimize();
174 /* Transform the control flow */
175 old_block = get_nodes_block(node);
176 new_block = new_Block(get_Block_n_cfgpreds(old_block),
177 get_Block_cfgpred_arr(old_block));
178 set_irg_current_block(current_ir_graph, new_block);
180 ir_node *jmp = new_Jmp();
181 set_irn_in(old_block, 1, &jmp);
182 irn_vrfy_irg(old_block, current_ir_graph);
185 /* move node and its predecessors to new_block */
186 move(node, old_block, new_block);
188 /* move Phi nodes to new_block */
189 phi = get_irn_link(old_block);
190 set_irn_link(new_block, phi);
191 set_irn_link(old_block, NULL);
193 if(get_nodes_block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
194 obey this condition. How do they get into
195 the list??? Example: InterfaceIII */
196 set_nodes_block(phi, new_block);
197 phi = get_irn_link(phi);
200 set_optimize(rem_opt);