irgmod.c 8.32 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Christian Würdig's avatar
Christian Würdig committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 *
 * This file is part of libFirm.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 2 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * Licensees holding valid libFirm Professional Edition licenses may use
 * this file in accordance with the libFirm Commercial License.
 * Agreement provided with the Software.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE.
 */

Matthias Braun's avatar
Matthias Braun committed
20
21
22
23
24
/**
 * @file
 * @brief    Support for ir graph modification.
 * @author   Martin Trapp, Christian Schaefer, Goetz Lindenmaier
 * @version  $Id$
Götz Lindenmaier's avatar
Götz Lindenmaier committed
25
 */
Matthias Braun's avatar
Matthias Braun committed
26
#include "config.h"
Boris Boesler's avatar
added    
Boris Boesler committed
27

Michael Beck's avatar
Michael Beck committed
28
29
30
31
32
33
34
35
36
37
38
#include "irvrfy.h"
#include "irflag_t.h"
#include "irgwalk.h"
#include "irnode_t.h"
#include "irgraph_t.h"
#include "irgmod.h"
#include "array.h"
#include "ircons.h"
#include "irhooks.h"
#include "iredges_t.h"
#include "irtools.h"
39
#include "error.h"
Christian Schäfer's avatar
Christian Schäfer committed
40

Christian Würdig's avatar
Christian Würdig committed
41
42
43
44
45
46
/**
 * 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.
 */
47
48
void turn_into_tuple(ir_node *node, int arity)
{
Christian Würdig's avatar
Christian Würdig committed
49
50
51
52
53
	assert(node);
	set_irn_op(node, op_Tuple);
	if (get_irn_arity(node) == arity) {
		/* keep old array */
	} else {
Michael Beck's avatar
Michael Beck committed
54
55
56
		ir_graph *irg = get_irn_irg(node);
		ir_node *block = get_nodes_block(node);
		edges_node_deleted(node, irg);
Michael Beck's avatar
Michael Beck committed
57
		/* Allocate new array, don't free old in_array, it's on the obstack. */
Michael Beck's avatar
Michael Beck committed
58
		node->in = NEW_ARR_D(ir_node *, irg->obst, arity+1);
Christian Würdig's avatar
Christian Würdig committed
59
60
		/* clear the new in array, else edge_notify tries to delete garbage */
		memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
Michael Beck's avatar
Michael Beck committed
61
		/* set the block back */
Michael Beck's avatar
Michael Beck committed
62
		set_nodes_block(node, block);
Christian Würdig's avatar
Christian Würdig committed
63
	}
Christian Schäfer's avatar
Christian Schäfer committed
64
65
}

Christian Würdig's avatar
Christian Würdig committed
66
67
68
69
70
/**
 * 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.
 */
71
72
void exchange(ir_node *old, ir_node *nw)
{
Christian Würdig's avatar
Christian Würdig committed
73
74
75
76
77
78
79
80
81
82
83
	ir_graph *irg;

	assert(old && nw);
	assert(old != nw && "Exchanging node with itself is not allowed");

	irg = get_irn_irg(old);
	assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");

	hook_replace(old, nw);

	/*
84
85
86
	 * If new outs are on, we can skip the id node creation and reroute
	 * the edges from the old node to the new directly.
	 */
Christian Würdig's avatar
Christian Würdig committed
87
88
89
90
91
92
93
94
	if (edges_activated(irg)) {
		/* copy all dependencies from old to new */
		add_irn_deps(nw, old);

		edges_reroute(old, nw, irg);
		edges_reroute_kind(old, nw, EDGE_KIND_DEP, irg);
		edges_node_deleted(old, irg);
		old->op = op_Bad;
95
	} else {
Christian Würdig's avatar
Christian Würdig committed
96
97
98
99
100
101
102
103
104
105
		/* Else, do it the old-fashioned way. */
		ir_node *block;

		hook_turn_into_id(old);

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

			if (! block) {
106
				panic("cannot find legal block for id");
Christian Würdig's avatar
Christian Würdig committed
107
108
109
			}
		}

110
111
112
113
		if (get_irn_op(old)->opar == oparity_dynamic) {
			DEL_ARR_F(get_irn_in(old));
		}

Christian Würdig's avatar
Christian Würdig committed
114
115
116
117
118
		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
119
}
120

121
122
123
/*--------------------------------------------------------------------*/
/*  Functionality for collect_phis                                    */
/*--------------------------------------------------------------------*/
124

Michael Beck's avatar
Michael Beck committed
125
/**
126
127
128
 * Walker: links all Phi nodes to their Blocks lists,
 *         all Proj nodes to there predecessors and all
 *         partBlocks to there MacroBlock header.
Michael Beck's avatar
Michael Beck committed
129
 */
130
131
static void collect_phiprojs_walker(ir_node *n, void *env)
{
Christian Würdig's avatar
Christian Würdig committed
132
	ir_node *pred;
133
	(void) env;
Christian Würdig's avatar
Christian Würdig committed
134
135

	if (is_Phi(n)) {
136
		ir_node *block = get_nodes_block(n);
Michael Beck's avatar
Michael Beck committed
137
		add_Block_phi(block, n);
138
	} else if (is_Proj(n)) {
Christian Würdig's avatar
Christian Würdig committed
139
140
141
142
143
144
145
		pred = n;
		do {
			pred = get_Proj_pred(pred);
		} while (is_Proj(pred));

		set_irn_link(n, get_irn_link(pred));
		set_irn_link(pred, n);
146
147
148
149
150
151
152
	} else if (is_Block(n)) {
		ir_node *mbh = get_Block_MacroBlock(n);

		if (mbh != n) {
			set_irn_link(n, get_irn_link(mbh));
			set_irn_link(mbh, n);
		}
Christian Würdig's avatar
Christian Würdig committed
153
	}
154
155
}

156
157
void collect_phiprojs(ir_graph *irg)
{
158
	assert((ir_resources_reserved(irg) & (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST)) ==
159
		(IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST));
160
	irg_walk_graph(irg, firm_clear_node_and_phi_links, collect_phiprojs_walker, NULL);
161
162
}

163
164
165
/*--------------------------------------------------------------------*/
/*  Functionality for part_block                                      */
/*--------------------------------------------------------------------*/
166

Michael Beck's avatar
Michael Beck committed
167
168
169
170
/**
 * Moves node and all predecessors of node from from_bl to to_bl.
 * Does not move predecessors of Phi nodes (or block nodes).
 */
171
172
static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl)
{
Christian Würdig's avatar
Christian Würdig committed
173
	int i, arity;
174
175
176
177

	/* move this node */
	set_nodes_block(node, to_bl);

Michael Beck's avatar
Michael Beck committed
178
	/* move its Projs */
179
	if (get_irn_mode(node) == mode_T) {
Michael Beck's avatar
Michael Beck committed
180
		ir_node *proj = get_irn_link(node);
181
182
183
184
185
186
		while (proj) {
			if (get_nodes_block(proj) == from_bl)
				set_nodes_block(proj, to_bl);
			proj = get_irn_link(proj);
		}
	}
Christian Würdig's avatar
Christian Würdig committed
187
188

	/* recursion ... */
Michael Beck's avatar
Michael Beck committed
189
190
	if (is_Phi(node))
		return;
Christian Würdig's avatar
Christian Würdig committed
191
192
193

	arity = get_irn_arity(node);
	for (i = 0; i < arity; i++) {
Michael Beck's avatar
Michael Beck committed
194
		ir_node *pred = get_irn_n(node, i);
Christian Würdig's avatar
Christian Würdig committed
195
196
197
		if (get_nodes_block(pred) == from_bl)
			move(pred, from_bl, to_bl);
	}
198
199
}

200
201
void part_block(ir_node *node)
{
202
203
204
205
	ir_node *new_block, *old_block, *mbh;
	ir_node *phi, *jmp, *next, *block;
	ir_graph *rem = current_ir_graph;

Christian Würdig's avatar
Christian Würdig committed
206
207
208
209
	/* Turn off optimizations so that blocks are not merged again. */
	int rem_opt = get_opt_optimize();
	set_optimize(0);

210
211
	current_ir_graph = get_irn_irg(node);

Christian Würdig's avatar
Christian Würdig committed
212
213
	/* Transform the control flow */
	old_block = get_nodes_block(node);
214
	mbh       = get_Block_MacroBlock(old_block);
Christian Würdig's avatar
Christian Würdig committed
215
	new_block = new_Block(get_Block_n_cfgpreds(old_block),
216
	                      get_Block_cfgpred_arr(old_block));
217
218
219

	if (mbh != old_block) {
		/* we splitting a partBlock */
220
		set_Block_MacroBlock(new_block, mbh);
221
222
	} else {
		/* we are splitting a header: this creates a new header */
223
		set_Block_MacroBlock(new_block, new_block);
224
	}
225
226
227
228

	/* create a jump from new_block to old_block, which is now the lower one */
	jmp = new_r_Jmp(new_block);
	set_irn_in(old_block, 1, &jmp);
Christian Würdig's avatar
Christian Würdig committed
229
230
231
232
233

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

	/* move Phi nodes to new_block */
Michael Beck's avatar
Michael Beck committed
234
235
236
	phi = get_Block_phis(old_block);
	set_Block_phis(new_block, phi);
	set_Block_phis(old_block, NULL);
Christian Würdig's avatar
Christian Würdig committed
237
238
	while (phi) {
		set_nodes_block(phi, new_block);
Michael Beck's avatar
Michael Beck committed
239
		phi = get_Phi_next(phi);
Christian Würdig's avatar
Christian Würdig committed
240
241
	}

242
243
	/* rewire partBlocks: This is necessary, because old_block is a new MacroBlock
	   header now */
244
	if (mbh != old_block) {
245
246
247
248
		ir_node *list = NULL;

		/* move blocks from mbh to old_block if old_block dominates them */
		block = get_irn_link(mbh);
Michael Beck's avatar
Michael Beck committed
249

250
		/* mbh's list will be rebuild */
Michael Beck's avatar
Michael Beck committed
251
		set_irn_link(mbh, NULL);
252
		/* old_block is a new mbh */
253
		set_Block_MacroBlock(old_block, old_block);
254

Michael Beck's avatar
Michael Beck committed
255
256
		/* note that we must splice the list of partBlock here */
		for (; block != NULL; block = next) {
257
			ir_node *curr = block;
Michael Beck's avatar
Michael Beck committed
258
259
260
			assert(is_Block(curr));

			next = get_irn_link(block);
261

262
263
			if (block == old_block) {
				/* this effectively removed old_block from mbh's list */
264
				continue;
265
			}
266

267
			assert(get_Block_MacroBlock(curr) == mbh);
Michael Beck's avatar
Michael Beck committed
268

269
270
271
272
			for (;;) {
				if (curr == old_block) {
					/* old_block dominates the block, so old_block will be
					   the new macro block header */
273
					set_Block_MacroBlock(block, old_block);
274
275
					set_irn_link(block, list);
					list = block;
276
277
					break;
				}
Michael Beck's avatar
Michael Beck committed
278
279
280
281
				if (curr == mbh) {
					/* leave it in the mbh */
					set_irn_link(block, get_irn_link(mbh));
					set_irn_link(mbh, block);
282
					break;
Michael Beck's avatar
Michael Beck committed
283
				}
284
285
286
287
288

				assert(get_Block_n_cfgpreds(curr) == 1);
				curr = get_Block_cfgpred_block(curr, 0);
			}
		}
289
290
291
292
293
294
295
296
		/* beware: do NOT directly manipulate old_block's list, as old_block is
		   in mbh's list and this would destroy the list! */
		set_irn_link(old_block, list);

		/* finally add new_block to mbh's list */
		set_irn_link(new_block, get_irn_link(mbh));
		set_irn_link(mbh, new_block);
	} else {
297
298
		/* old_block is the mbh, as well as new_block */
		set_Block_MacroBlock(new_block, new_block);
299
300
	}

Christian Würdig's avatar
Christian Würdig committed
301
	set_optimize(rem_opt);
302
	current_ir_graph = rem;
303
}
304
305

/* kill a node by setting its predecessors to Bad and finally exchange the node by Bad itself. */
306
307
void kill_node(ir_node *node)
{
308
309
310
311
312
313
314
315
316
	ir_graph *irg = get_irn_irg(node);
	ir_node *bad = get_irg_bad(irg);
	int i;

	for (i = get_irn_arity(node) - 1; i >= -1; --i) {
		set_irn_n(node, i, bad);
	}
	exchange(node, bad);
}