irgmod.c 5.22 KB
Newer Older
Götz Lindenmaier's avatar
Götz Lindenmaier committed
1
2
/*
 * Project:     libFIRM
Michael Beck's avatar
Michael Beck committed
3
 * File name:   ir/ir/irgmod.c
Götz Lindenmaier's avatar
Götz Lindenmaier committed
4
5
6
7
8
9
10
11
 * Purpose:     Support for ir graph modification.
 * Author:      Martin Trapp, Christian Schaefer
 * Modified by: Goetz Lindenmaier
 * Created:
 * CVS-ID:      $Id$
 * Copyright:   (c) 1998-2003 Universitt Karlsruhe
 * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 */
Boris Boesler's avatar
Boris Boesler committed
12

Boris Boesler's avatar
added    
Boris Boesler committed
13
#ifdef HAVE_CONFIG_H
Michael Beck's avatar
Michael Beck committed
14
# include "config.h"
Boris Boesler's avatar
added    
Boris Boesler committed
15
16
#endif

17
# include "irvrfy.h"
18
# include "irflag_t.h"
19
# include "irgwalk.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
20
# include "irnode_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
21
# include "irgraph_t.h"
Christian Schäfer's avatar
Christian Schäfer committed
22
# include "irgmod.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
23
# include "array.h"
24
# include "ircons.h"
25
# include "irhooks.h"
26
# include "iredges_t.h"
Christian Schäfer's avatar
Christian Schäfer committed
27

Götz Lindenmaier's avatar
Götz Lindenmaier committed
28
29
30
31
/* Turns a node into a "useless" Tuple.  The Tuple just forms a tuple
   from several inputs.
   This is useful if a node returning a tuple is removed, but the Projs
   extracting values from the tuple are not available. */
Christian Schäfer's avatar
Christian Schäfer committed
32
33
34
35
36
void
turn_into_tuple (ir_node *node, int arity)
{
  assert(node);
  set_irn_op(node, op_Tuple);
37
  if (get_irn_arity(node) == arity) {
Christian Schäfer's avatar
Christian Schäfer committed
38
39
    /* keep old array */
  } else {
Götz Lindenmaier's avatar
Götz Lindenmaier committed
40
    /* Allocate new array, don't free old in_array, it's on the obstack. */
41
    ir_node *block = get_nodes_block(node);
Christian Schäfer's avatar
Christian Schäfer committed
42
    node->in = NEW_ARR_D (ir_node *, current_ir_graph->obst, arity+1);
43
		edges_invalidate(node, current_ir_graph);
44
    set_nodes_block(node, block);
Christian Schäfer's avatar
Christian Schäfer committed
45
46
47
48
49
50
  }
}

/* Insert irnode `new' in place of irnode `old'
   Since `new' may be bigger than `old' replace `old'
   by an op_Id which is smaller than everything */
51
void
Götz Lindenmaier's avatar
Götz Lindenmaier committed
52
exchange (ir_node *old, ir_node *nw)
Christian Schäfer's avatar
Christian Schäfer committed
53
{
54
55
56
57
	/*
	 * If new outs are on, we can skip the id node creation and reroute
	 * the edges from the old node to the new directly.
	 */
58
	if (edges_activated(current_ir_graph)) {
59
60
		edges_reroute(old, nw, current_ir_graph);
	}
61
62
  else {
    /* Else, do it the old-fashioned way. */
63

64
65
		ir_graph *irg = get_irn_irg (old);
		ir_node *block;
66

67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
		assert(old != nw);
		assert (irg);
		assert(get_irn_op(old)->opar != oparity_dynamic);

		hook_turn_into_id(old);

		block = old->in[0];
		if (!block) {
			block = is_Block(nw) ? nw : get_nodes_block(nw);

			if (!block) {
				DDMN(old);
				DDMN(nw);
				assert(0 && "cannot find legal block for id");
			}
		}
Christian Schäfer's avatar
Christian Schäfer committed
83

84
85
86
87
88
		old->op = op_Id;
		old->in = NEW_ARR_D (ir_node *, irg->obst, 2);
		old->in[0] = block;
		old->in[1] = nw;
	}
Christian Schäfer's avatar
Christian Schäfer committed
89
}
90

91
92
93
/*--------------------------------------------------------------------*/
/*  Functionality for collect_phis                                    */
/*--------------------------------------------------------------------*/
94

95
static void
96
97
98
99
clear_link (ir_node *n, void *env) {
  set_irn_link(n, NULL);
}

100
static void
101
102
collect (ir_node *n, void *env) {
  ir_node *pred;
103
  if (get_irn_op(n) == op_Phi) {
104
105
    set_irn_link(n, get_irn_link(get_nodes_block(n)));
    set_irn_link(get_nodes_block(n), n);
106
  }
107
  if (get_irn_op(n) == op_Proj) {
108
    pred = n;
109
    while (get_irn_op(pred) == op_Proj)
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
      pred = get_Proj_pred(pred);
    set_irn_link(n, get_irn_link(pred));
    set_irn_link(pred, n);
  }
}

void collect_phiprojs(ir_graph *irg) {
  ir_graph *rem;

  /* Remember external state of current_ir_graph. */
  rem = current_ir_graph;
  current_ir_graph = irg;

  irg_walk(get_irg_end(current_ir_graph), clear_link, collect, NULL);

  current_ir_graph = rem;
}


129
130
131
/*--------------------------------------------------------------------*/
/*  Functionality for part_block                                      */
/*--------------------------------------------------------------------*/
132

Michael Beck's avatar
Michael Beck committed
133
134
135
136
/**
 * Moves node and all predecessors of node from from_bl to to_bl.
 * 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) {
138
  int i, arity;
139
140
141
  ir_node *proj, *pred;

  /* move this node */
142
  set_nodes_block(node, to_bl);
143
144

  /* move its projs */
145
  if (get_irn_mode(node) == mode_T) {
146
147
    proj = get_irn_link(node);
    while (proj) {
148
149
      if (get_nodes_block(proj) == from_bl)
	set_nodes_block(proj, to_bl);
150
151
152
153
154
      proj = get_irn_link(proj);
    }
  }

  /* recursion ... */
155
  if (get_irn_op(node) == op_Phi) return;
156

157
158
  arity = get_irn_arity(node);
  for (i = 0; i < arity; i++) {
159
    pred = get_irn_n(node, i);
160
    if (get_nodes_block(pred) == from_bl)
161
162
163
164
165
166
167
168
169
      move(pred, from_bl, to_bl);
  }
}

void part_block(ir_node *node) {
  ir_node *new_block;
  ir_node *old_block;
  ir_node *phi;

170
  /* Turn off optimizations so that blocks are not merged again. */
171
  int rem_opt = get_opt_optimize();
172
173
  set_optimize(0);

174
  /* Transform the control flow */
175
  old_block = get_nodes_block(node);
176
  new_block = new_Block(get_Block_n_cfgpreds(old_block),
Florian Liekweg's avatar
Florian Liekweg committed
177
            get_Block_cfgpred_arr(old_block));
178
179
180
181
182
  set_irg_current_block(current_ir_graph, new_block);
  {
    ir_node *in[1];
    in[0] = new_Jmp();
    set_irn_in(old_block, 1, in);
183
    irn_vrfy_irg(old_block, current_ir_graph);
184
185
186
187
188
189
190
191
192
193
  }

  /* move node and its predecessors to new_block */
  move(node, old_block, new_block);

  /* move Phi nodes to new_block */
  phi = get_irn_link(old_block);
  set_irn_link(new_block, phi);
  set_irn_link(old_block, NULL);
  while (phi) {
194
    if(get_nodes_block(phi) == old_block);   /* @@@ inlinening chokes on phis that don't
Florian Liekweg's avatar
Florian Liekweg committed
195
196
                           obey this condition.  How do they get into
                           the list??? Example: InterfaceIII */
197
      set_nodes_block(phi, new_block);
198
199
    phi = get_irn_link(phi);
  }
200
201

  set_optimize(rem_opt);
202
}