irgmod.c 8.03 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
#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"
38
#include "error.h"
Christian Schäfer's avatar
Christian Schäfer committed
39

Christian Würdig's avatar
Christian Würdig committed
40
41
42
43
44
45
/**
 * 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.
 */
46
47
void turn_into_tuple(ir_node *node, int arity)
{
48
49
50
51
52
53
54
	ir_graph *irg = get_irn_irg(node);
	ir_node **in  = ALLOCAN(ir_node*, arity);
	int       i;

	/* construct a new in array, with every input being bad */
	for (i = 0; i < arity; ++i) {
		in[i] = new_r_Bad(irg);
Christian Würdig's avatar
Christian Würdig committed
55
	}
56
57
	set_irn_in(node, arity, in);
	set_irn_op(node, op_Tuple);
Christian Schäfer's avatar
Christian Schäfer committed
58
59
}

Christian Würdig's avatar
Christian Würdig committed
60
61
62
63
64
/**
 * 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.
 */
65
66
void exchange(ir_node *old, ir_node *nw)
{
Christian Würdig's avatar
Christian Würdig committed
67
68
69
70
71
72
73
74
75
76
77
	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);

	/*
78
79
80
	 * 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
81
82
83
84
85
86
87
88
	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;
89
	} else {
Christian Würdig's avatar
Christian Würdig committed
90
91
92
93
94
95
96
97
98
99
		/* 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) {
100
				panic("cannot find legal block for id");
Christian Würdig's avatar
Christian Würdig committed
101
102
103
			}
		}

104
105
106
107
		if (get_irn_op(old)->opar == oparity_dynamic) {
			DEL_ARR_F(get_irn_in(old));
		}

Christian Würdig's avatar
Christian Würdig committed
108
109
110
111
112
		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
113
}
114

115
116
117
/*--------------------------------------------------------------------*/
/*  Functionality for collect_phis                                    */
/*--------------------------------------------------------------------*/
118

Michael Beck's avatar
Michael Beck committed
119
/**
120
121
122
 * 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
123
 */
124
125
static void collect_phiprojs_walker(ir_node *n, void *env)
{
Christian Würdig's avatar
Christian Würdig committed
126
	ir_node *pred;
127
	(void) env;
Christian Würdig's avatar
Christian Würdig committed
128
129

	if (is_Phi(n)) {
130
		ir_node *block = get_nodes_block(n);
Michael Beck's avatar
Michael Beck committed
131
		add_Block_phi(block, n);
132
	} else if (is_Proj(n)) {
Christian Würdig's avatar
Christian Würdig committed
133
134
135
136
137
138
139
		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);
140
141
142
143
144
145
146
	} 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
147
	}
148
149
}

150
151
void collect_phiprojs(ir_graph *irg)
{
152
	assert((ir_resources_reserved(irg) & (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST)) ==
153
		(IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST));
154
	irg_walk_graph(irg, firm_clear_node_and_phi_links, collect_phiprojs_walker, NULL);
155
156
}

157
158
159
/*--------------------------------------------------------------------*/
/*  Functionality for part_block                                      */
/*--------------------------------------------------------------------*/
160

Michael Beck's avatar
Michael Beck committed
161
162
163
164
/**
 * Moves node and all predecessors of node from from_bl to to_bl.
 * Does not move predecessors of Phi nodes (or block nodes).
 */
165
166
static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl)
{
Christian Würdig's avatar
Christian Würdig committed
167
	int i, arity;
168
169
170
171

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

Michael Beck's avatar
Michael Beck committed
172
	/* move its Projs */
173
	if (get_irn_mode(node) == mode_T) {
Michael Beck's avatar
Michael Beck committed
174
		ir_node *proj = get_irn_link(node);
175
176
177
178
179
180
		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
181
182

	/* recursion ... */
Michael Beck's avatar
Michael Beck committed
183
184
	if (is_Phi(node))
		return;
Christian Würdig's avatar
Christian Würdig committed
185
186
187

	arity = get_irn_arity(node);
	for (i = 0; i < arity; i++) {
Michael Beck's avatar
Michael Beck committed
188
		ir_node *pred = get_irn_n(node, i);
Christian Würdig's avatar
Christian Würdig committed
189
190
191
		if (get_nodes_block(pred) == from_bl)
			move(pred, from_bl, to_bl);
	}
192
193
}

194
195
void part_block(ir_node *node)
{
196
197
198
199
	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
200
201
202
203
	/* Turn off optimizations so that blocks are not merged again. */
	int rem_opt = get_opt_optimize();
	set_optimize(0);

204
205
	current_ir_graph = get_irn_irg(node);

Christian Würdig's avatar
Christian Würdig committed
206
207
	/* Transform the control flow */
	old_block = get_nodes_block(node);
208
	mbh       = get_Block_MacroBlock(old_block);
Christian Würdig's avatar
Christian Würdig committed
209
	new_block = new_Block(get_Block_n_cfgpreds(old_block),
210
	                      get_Block_cfgpred_arr(old_block));
211
212
213

	if (mbh != old_block) {
		/* we splitting a partBlock */
214
		set_Block_MacroBlock(new_block, mbh);
215
216
	} else {
		/* we are splitting a header: this creates a new header */
217
		set_Block_MacroBlock(new_block, new_block);
218
	}
219
220
221
222

	/* 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
223
224
225
226
227

	/* 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
228
229
230
	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
231
232
	while (phi) {
		set_nodes_block(phi, new_block);
Michael Beck's avatar
Michael Beck committed
233
		phi = get_Phi_next(phi);
Christian Würdig's avatar
Christian Würdig committed
234
235
	}

236
237
	/* rewire partBlocks: This is necessary, because old_block is a new MacroBlock
	   header now */
238
	if (mbh != old_block) {
239
240
241
242
		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
243

244
		/* mbh's list will be rebuild */
Michael Beck's avatar
Michael Beck committed
245
		set_irn_link(mbh, NULL);
246
		/* old_block is a new mbh */
247
		set_Block_MacroBlock(old_block, old_block);
248

Michael Beck's avatar
Michael Beck committed
249
250
		/* note that we must splice the list of partBlock here */
		for (; block != NULL; block = next) {
251
			ir_node *curr = block;
Michael Beck's avatar
Michael Beck committed
252
253
254
			assert(is_Block(curr));

			next = get_irn_link(block);
255

256
257
			if (block == old_block) {
				/* this effectively removed old_block from mbh's list */
258
				continue;
259
			}
260

261
			assert(get_Block_MacroBlock(curr) == mbh);
Michael Beck's avatar
Michael Beck committed
262

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

				assert(get_Block_n_cfgpreds(curr) == 1);
				curr = get_Block_cfgpred_block(curr, 0);
			}
		}
283
284
285
286
287
288
289
290
		/* 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 {
291
292
		/* old_block is the mbh, as well as new_block */
		set_Block_MacroBlock(new_block, new_block);
293
294
	}

Christian Würdig's avatar
Christian Würdig committed
295
	set_optimize(rem_opt);
296
	current_ir_graph = rem;
297
}
298
299

/* kill a node by setting its predecessors to Bad and finally exchange the node by Bad itself. */
300
301
void kill_node(ir_node *node)
{
302
303
304
305
306
307
308
309
310
	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);
}