3 * File name: ir/ir/irgmod.h
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.
18 # include "irflag_t.h"
20 # include "irnode_t.h"
21 # include "irgraph_t.h"
25 # include "firmstat.h"
27 /* Turns a node into a "useless" Tuple. The Tuple just forms a tuple
29 This is useful if a node returning a tuple is removed, but the Projs
30 extracting values from the tuple are not available. */
32 turn_into_tuple (ir_node *node, int arity)
35 set_irn_op(node, op_Tuple);
36 if (intern_get_irn_arity(node) == arity) {
39 /* Allocate new array, don't free old in_array, it's on the obstack. */
40 ir_node *block = get_nodes_Block(node);
41 node->in = NEW_ARR_D (ir_node *, current_ir_graph->obst, arity+1);
42 set_nodes_Block(node, block);
46 /* Insert irnode `new' in place of irnode `old'
47 Since `new' may be bigger than `old' replace `old'
48 by an op_Id which is smaller than everything */
50 exchange (ir_node *old, ir_node *nw)
54 assert(get_irn_op(old)->opar != oparity_dynamic);
56 stat_turn_into_id(old);
61 old->in = NEW_ARR_D (ir_node *, current_ir_graph->obst, 2);
66 /*--------------------------------------------------------------------*/
67 /* Functionality for collect_phis */
68 /*--------------------------------------------------------------------*/
71 clear_link (ir_node *n, void *env) {
72 set_irn_link(n, NULL);
76 collect (ir_node *n, void *env) {
78 if (intern_get_irn_op(n) == op_Phi) {
79 set_irn_link(n, get_irn_link(get_nodes_Block(n)));
80 set_irn_link(get_nodes_Block(n), n);
82 if (intern_get_irn_op(n) == op_Proj) {
84 while (intern_get_irn_op(pred) == op_Proj)
85 pred = get_Proj_pred(pred);
86 set_irn_link(n, get_irn_link(pred));
87 set_irn_link(pred, n);
91 void collect_phiprojs(ir_graph *irg) {
94 /* Remember external state of current_ir_graph. */
95 rem = current_ir_graph;
96 current_ir_graph = irg;
98 irg_walk(get_irg_end(current_ir_graph), clear_link, collect, NULL);
100 current_ir_graph = rem;
104 /*--------------------------------------------------------------------*/
105 /* Functionality for part_block */
106 /*--------------------------------------------------------------------*/
109 * Moves node and all predecessors of node from from_bl to to_bl.
110 * Does not move predecessors of Phi nodes (or block nodes).
112 static void move (ir_node *node, ir_node *from_bl, ir_node *to_bl) {
114 ir_node *proj, *pred;
117 set_nodes_Block(node, to_bl);
120 if (intern_get_irn_mode(node) == mode_T) {
121 proj = get_irn_link(node);
123 if (get_nodes_Block(proj) == from_bl)
124 set_nodes_Block(proj, to_bl);
125 proj = get_irn_link(proj);
130 if (intern_get_irn_op(node) == op_Phi) return;
132 for (i = 0; i < intern_get_irn_arity(node); i++) {
133 pred = get_irn_n(node, i);
134 if (get_nodes_Block(pred) == from_bl)
135 move(pred, from_bl, to_bl);
139 void part_block(ir_node *node) {
144 /* Turn off optimizations so that blocks are not merged again. */
145 int rem_opt = get_opt_optimize();
148 /* Transform the control flow */
149 old_block = get_nodes_Block(node);
150 new_block = new_Block(get_Block_n_cfgpreds(old_block),
151 get_Block_cfgpred_arr(old_block));
152 set_irg_current_block(current_ir_graph, new_block);
156 set_irn_in(old_block, 1, in);
157 irn_vrfy_irg(old_block, current_ir_graph);
160 /* move node and its predecessors to new_block */
161 move(node, old_block, new_block);
163 /* move Phi nodes to new_block */
164 phi = get_irn_link(old_block);
165 set_irn_link(new_block, phi);
166 set_irn_link(old_block, NULL);
168 if(get_nodes_Block(phi) == old_block); /* @@@ inlinening chokes on phis that don't
169 obey this condition. How do they get into
170 the list??? Example: InterfaceIII */
171 set_nodes_Block(phi, new_block);
172 phi = get_irn_link(phi);
175 set_optimize(rem_opt);