irgmod.c 5.93 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/*
 * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
 *
 * 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
 */
Boris Boesler's avatar
added    
Boris Boesler committed
26
#ifdef HAVE_CONFIG_H
Michael Beck's avatar
Michael Beck committed
27
# include "config.h"
Boris Boesler's avatar
added    
Boris Boesler committed
28
29
#endif

Michael Beck's avatar
Michael Beck committed
30
31
32
33
34
35
36
37
38
39
40
#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"
Christian Schäfer's avatar
Christian Schäfer committed
41

Christian Würdig's avatar
Christian Würdig committed
42
43
44
45
46
47
/**
 * 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.
 */
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 {
54
55
		/* don't use get_nodes_block here, we allow turn_into_tuple for unpinned nodes */
		ir_node *block = get_irn_n(node, -1);
Christian Würdig's avatar
Christian Würdig committed
56
57
58
59
60
		/* Allocate new array, don't free old in_array, it's on the obstack. */
		edges_node_deleted(node, current_ir_graph);
		node->in = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity+1);
		/* clear the new in array, else edge_notify tries to delete garbage */
		memset(node->in, 0, (arity+1) * sizeof(node->in[0]));
61
		set_irn_n(node, -1, block);
Christian Würdig's avatar
Christian Würdig committed
62
	}
Christian Schäfer's avatar
Christian Schäfer committed
63
64
}

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

	/*
82
83
84
	 * 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
85
86
87
88
89
90
91
92
	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;
93
	} else {
Christian Würdig's avatar
Christian Würdig committed
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
		/* Else, do it the old-fashioned way. */
		ir_node *block;

		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");
			}
		}

		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
117
}
118

119
120
121
/*--------------------------------------------------------------------*/
/*  Functionality for collect_phis                                    */
/*--------------------------------------------------------------------*/
122

Michael Beck's avatar
Michael Beck committed
123
124
125
126
127
/**
 * Walker: links all Phi nodes to their Blocks and
 *         all Proj nodes to there predecessors
 */
static void collect(ir_node *n, void *env) {
Christian Würdig's avatar
Christian Würdig committed
128
129
130
131
132
	ir_node *pred;

	if (is_Phi(n)) {
		set_irn_link(n, get_irn_link(get_nodes_block(n)));
		set_irn_link(get_nodes_block(n), n);
133
	} else if (is_Proj(n)) {
Christian Würdig's avatar
Christian Würdig committed
134
135
136
137
138
139
140
141
		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);
	}
142
143
144
}

void collect_phiprojs(ir_graph *irg) {
Christian Würdig's avatar
Christian Würdig committed
145
	irg_walk_graph(irg, firm_clear_link, collect, NULL);
146
147
148
}


149
150
151
/*--------------------------------------------------------------------*/
/*  Functionality for part_block                                      */
/*--------------------------------------------------------------------*/
152

Michael Beck's avatar
Michael Beck committed
153
154
155
156
/**
 * Moves node and all predecessors of node from from_bl to to_bl.
 * Does not move predecessors of Phi nodes (or block nodes).
 */
Christian Würdig's avatar
Christian Würdig committed
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl) {
	int i, arity;
	ir_node *proj, *pred;

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

	/* move its projs */
	if (get_irn_mode(node) == mode_T) {
		proj = get_irn_link(node);
		while (proj) {
			if (get_nodes_block(proj) == from_bl)
				set_nodes_block(proj, to_bl);
			proj = get_irn_link(proj);
		}
	}

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

	arity = get_irn_arity(node);
	for (i = 0; i < arity; i++) {
		pred = get_irn_n(node, i);
		if (get_nodes_block(pred) == from_bl)
			move(pred, from_bl, to_bl);
	}
183
184
185
}

void part_block(ir_node *node) {
Christian Würdig's avatar
Christian Würdig committed
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
	ir_node *new_block;
	ir_node *old_block;
	ir_node *phi;

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

	/* Transform the control flow */
	old_block = get_nodes_block(node);
	new_block = new_Block(get_Block_n_cfgpreds(old_block),
		get_Block_cfgpred_arr(old_block));
	set_irg_current_block(current_ir_graph, new_block);
	{
		ir_node *jmp = new_Jmp();
		set_irn_in(old_block, 1, &jmp);
		irn_vrfy_irg(old_block, current_ir_graph);
	}

	/* 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) {
		if(get_nodes_block(phi) == old_block);   /* @@@ inlinening chokes on phis that don't
												 obey this condition.  How do they get into
												 the list??? Example: InterfaceIII */
		set_nodes_block(phi, new_block);
		phi = get_irn_link(phi);
	}

	set_optimize(rem_opt);
221
}