2 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
3 ** All rights reserved.
5 ** Authors: Martin Trapp, Christian Schaefer
7 ** irgmod: ir graph modification
16 # include "irnode_t.h"
17 # include "irgraph_t.h"
22 /* Turns a node into a "useless" Tuple. The Tuple just forms a tuple
24 This is useful if a node returning a tuple is removed, but the Projs
25 extracting values from the tuple are not available. */
27 turn_into_tuple (ir_node *node, int arity)
30 set_irn_op(node, op_Tuple);
31 if (get_irn_arity(node) == arity) {
34 /* Allocate new array, don't free old in_array, it's on the obstack. */
35 ir_node *block = get_nodes_Block(node);
36 node->in = NEW_ARR_D (ir_node *, current_ir_graph->obst, arity+1);
37 set_nodes_Block(node, block);
41 /* Insert irnode `new' in place of irnode `old'
42 Since `new' may be bigger than `old' replace `old'
43 by an op_Id which is smaller than everything */
45 exchange (ir_node *old, ir_node *new)
47 ir_node *block = old->in[0];
50 old->in = NEW_ARR_D (ir_node *, current_ir_graph->obst, 2);
56 /**********************************************************************/
57 /* Funcionality for collect_phis */
58 /**********************************************************************/
61 clear_link (ir_node *n, void *env) {
62 set_irn_link(n, NULL);
66 collect (ir_node *n, void *env) {
68 if (get_irn_op(n) == op_Phi) {
69 set_irn_link(n, get_irn_link(get_nodes_Block(n)));
70 set_irn_link(get_nodes_Block(n), n);
72 if (get_irn_op(n) == op_Proj) {
74 while (get_irn_op(pred) == op_Proj)
75 pred = get_Proj_pred(pred);
76 set_irn_link(n, get_irn_link(pred));
77 set_irn_link(pred, n);
81 void collect_phiprojs(ir_graph *irg) {
84 /* Remember external state of current_ir_graph. */
85 rem = current_ir_graph;
86 current_ir_graph = irg;
88 irg_walk(get_irg_end(current_ir_graph), clear_link, collect, NULL);
90 current_ir_graph = rem;
94 /**********************************************************************/
95 /* Funcionality for part_block */
96 /**********************************************************************/
98 /* Moves node and all predecessors of node from from_bl to to_bl.
99 Does not move predecessors of Phi nodes (or block nodes). */
101 void move (ir_node *node, ir_node *from_bl, ir_node *to_bl) {
103 ir_node *proj, *pred;
106 set_nodes_Block(node, to_bl);
109 if (get_irn_mode(node) == mode_T) {
110 proj = get_irn_link(node);
112 if (get_nodes_Block(proj) == from_bl)
113 set_nodes_Block(proj, to_bl);
114 proj = get_irn_link(proj);
119 if (get_irn_op(node) == op_Phi) return;
121 for (i = 0; i < get_irn_arity(node); i++) {
122 pred = get_irn_n(node, i);
123 if (get_nodes_Block(pred) == from_bl)
124 move(pred, from_bl, to_bl);
128 void part_block(ir_node *node) {
133 /* Transform the control flow */
134 old_block = get_nodes_Block(node);
135 new_block = new_Block(get_Block_n_cfgpreds(old_block),
136 get_Block_cfgpred_arr(old_block));
137 set_irg_current_block(current_ir_graph, new_block);
141 set_irn_in(old_block, 1, in);
145 /* move node and its predecessors to new_block */
146 move(node, old_block, new_block);
148 /* move Phi nodes to new_block */
149 phi = get_irn_link(old_block);
150 set_irn_link(new_block, phi);
151 set_irn_link(old_block, NULL);
153 set_nodes_Block(phi, new_block);
154 phi = get_irn_link(phi);