betranshlp.c 10.8 KB
Newer Older
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2010 University of Karlsruhe.  All right reserved.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 *
 * 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.
 */

/**
 * @file
 * @brief       be transform helper extracted from the ia32 backend.
Michael Beck's avatar
Michael Beck committed
23
 * @author      Matthias Braun, Michael Beck
24
25
26
27
28
29
30
31
32
33
 * @date        14.06.2007
 * @version     $Id$
 */
#include "config.h"

#include "pdeq.h"
#include "irop_t.h"
#include "iropt_t.h"
#include "irnode_t.h"
#include "irgraph_t.h"
34
#include "ircons_t.h"
35
36
37
38
39
40
41
#include "irhooks.h"
#include "iredges.h"
#include "irouts.h"
#include "trouts.h"
#include "cgana.h"
#include "debug.h"

42
#include "beirg.h"
43
#include "beabi.h"
44
#include "betranshlp.h"
45
#include "belive.h"
46
#include "benode.h"
47
48
49
50
51

typedef struct be_transform_env_t {
	ir_graph *irg;         /**< The irg, the node should be created in */
	waitq    *worklist;    /**< worklist of nodes that still need to be
	                            transformed */
52
	ir_node  *old_anchor;  /**< the old anchor node in the old irg */
53
54
55
56
57
} be_transform_env_t;


static be_transform_env_t env;

58
59
void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
{
60
61
	ir_graph *irg = get_irn_irg(old_node);

62
	set_irn_link(old_node, new_node);
63
	mark_irn_visited(old_node);
64
	hook_dead_node_elim_subst(irg, old_node, new_node);
65
66
}

67
68
int be_is_transformed(const ir_node *node)
{
69
70
71
	return irn_visited(node);
}

72
73
static inline ir_node *be_get_transformed_node(ir_node *old_node)
{
74
	if (irn_visited(old_node)) {
75
		ir_node *new_node = (ir_node*)get_irn_link(old_node);
76
77
78
79
		assert(new_node != NULL);
		return new_node;
	}
	return NULL;
80
81
}

82
83
void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
{
84
85
86
87
88
89
90
91
92
93
94
	int i;
	int deps = get_irn_deps(old_node);

	for (i = 0; i < deps; ++i) {
		ir_node *dep     = get_irn_dep(old_node, i);
		ir_node *new_dep = be_transform_node(dep);

		add_irn_dep(new_node, new_dep);
	}
}

95
96
97
98
99
100
101
102
103
void be_set_transform_function(ir_op *op, be_transform_func func)
{
	/* shouldn't be assigned twice (except for exchanging the default
	 * be_duplicate_node entries) */
	assert(op->ops.generic == NULL
			|| op->ops.generic == (op_func) be_duplicate_node);
	op->ops.generic = (op_func) func;
}

104
105
106
107
108
/**
 * Transform helper for blocks.
 */
static ir_node *transform_block(ir_node *node)
{
109
110
	ir_graph *irg  = get_irn_irg(node);
	dbg_info *dbgi = get_irn_dbg_info(node);
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
	ir_node  *block;

	block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
	                    get_irn_arity(node), get_irn_in(node) + 1);
	copy_node_attr(irg, node, block);
	block->node_nr = node->node_nr;

	/* put the preds in the worklist */
	be_enqueue_preds(node);

	return block;
}

static ir_node *transform_end(ir_node *node)
{
	/* end has to be duplicated manually because we need a dynamic in array */
127
	ir_graph *irg   = get_irn_irg(node);
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
	dbg_info *dbgi  = get_irn_dbg_info(node);
	ir_node  *block = be_transform_node(get_nodes_block(node));
	int      i, arity;
	ir_node  *new_end;

	new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
	copy_node_attr(irg, node, new_end);
	be_duplicate_deps(node, new_end);

	set_irg_end(irg, new_end);

	/* do not transform predecessors yet to keep the pre-transform
	 * phase from visiting all the graph */
	arity = get_irn_arity(node);
	for (i = 0; i < arity; ++i) {
		ir_node *in = get_irn_n(node, i);
		add_End_keepalive(new_end, in);
	}
	be_enqueue_preds(node);

	return new_end;
}

151
152
153
154
155
156
157
void be_start_transform_setup(void)
{
	clear_irp_opcodes_generic_func();

	be_set_transform_function(op_Bad,         be_duplicate_node);
	be_set_transform_function(op_be_Copy,     be_duplicate_node);
	be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
158
	be_set_transform_function(op_be_IncSP,    be_duplicate_node);
159
	be_set_transform_function(op_be_Keep,     be_duplicate_node);
160
161
	be_set_transform_function(op_be_Return,   be_duplicate_node);
	be_set_transform_function(op_be_Start,    be_duplicate_node);
162
163
	be_set_transform_function(op_Block,       transform_block);
	be_set_transform_function(op_End,         transform_end);
164
165
166
167
	be_set_transform_function(op_NoMem,       be_duplicate_node);
	be_set_transform_function(op_Pin,         be_duplicate_node);
	be_set_transform_function(op_Start,       be_duplicate_node);
	be_set_transform_function(op_Sync,        be_duplicate_node);
168
169
}

170
171
ir_node *be_duplicate_node(ir_node *node)
{
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
	ir_node  *block = be_transform_node(get_nodes_block(node));
	ir_graph *irg   = env.irg;
	dbg_info *dbgi  = get_irn_dbg_info(node);
	ir_mode  *mode  = get_irn_mode(node);
	ir_op    *op    = get_irn_op(node);
	ir_node  *new_node;
	int      i, arity;

	arity = get_irn_arity(node);
	if (op->opar == oparity_dynamic) {
		new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
		for (i = 0; i < arity; ++i) {
			ir_node *in = get_irn_n(node, i);
			in = be_transform_node(in);
			add_irn_n(new_node, in);
		}
	} else {
189
		ir_node **ins = ALLOCAN(ir_node*, arity);
190
191
192
193
194
195
196
197
		for (i = 0; i < arity; ++i) {
			ir_node *in = get_irn_n(node, i);
			ins[i] = be_transform_node(in);
		}

		new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
	}

198
	copy_node_attr(irg, node, new_node);
199
200
201
202
203
204
	be_duplicate_deps(node, new_node);

	new_node->node_nr = node->node_nr;
	return new_node;
}

205
206
ir_node *be_transform_node(ir_node *node)
{
Michael Beck's avatar
Michael Beck committed
207
208
209
	ir_op             *op;
	ir_node           *new_node = be_get_transformed_node(node);
	be_transform_func *transform;
210

211
	if (new_node != NULL)
212
213
		return new_node;

214
	DEBUG_ONLY(be_set_transformed_node(node, NULL);)
215
216

	op = get_irn_op(node);
217
218
	if (op->ops.generic == NULL) {
		panic("No transform function registered for node %+F.", node);
219
	}
Michael Beck's avatar
Michael Beck committed
220
	transform = (be_transform_func *)op->ops.generic;
221
222
223

	new_node = transform(node);
	assert(new_node != NULL);
224
225
226
227
228

	be_set_transformed_node(node, new_node);
	return new_node;
}

229
230
void be_enqueue_preds(ir_node *node)
{
231
232
233
234
235
236
237
238
239
240
241
242
243
	int i, arity;

	/* put the preds in the worklist */
	arity = get_irn_arity(node);
	for (i = 0; i < arity; ++i) {
		ir_node *pred = get_irn_n(node, i);
		pdeq_putr(env.worklist, pred);
	}
}

/**
 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
 */
244
245
static void fix_loops(ir_node *node)
{
246
	int i, arity;
247
	int changed;
248

Matthias Braun's avatar
Matthias Braun committed
249
250
	assert(node_is_in_irgs_storage(env.irg, node));

251
	if (irn_visited_else_mark(node))
252
253
		return;

254
	changed = 0;
255
256
	if (! is_Block(node)) {
		ir_node *block     = get_nodes_block(node);
257
		ir_node *new_block = (ir_node*)get_irn_link(block);
258
259
260
261

		if (new_block != NULL) {
			set_nodes_block(node, new_block);
			block = new_block;
262
			changed = 1;
263
264
265
266
267
268
269
270
		}

		fix_loops(block);
	}

	arity = get_irn_arity(node);
	for (i = 0; i < arity; ++i) {
		ir_node *in = get_irn_n(node, i);
271
		ir_node *nw = (ir_node*)get_irn_link(in);
272
273
274
275

		if (nw != NULL && nw != in) {
			set_irn_n(node, i, nw);
			in = nw;
276
			changed = 1;
277
278
279
280
		}

		fix_loops(in);
	}
281
	/* fix proj block */
282
	if (is_Proj(node)) {
283
		set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
284
		changed = 1;
285
	}
286
287
288
289

	arity = get_irn_deps(node);
	for (i = 0; i < arity; ++i) {
		ir_node *in = get_irn_dep(node, i);
290
		ir_node *nw = (ir_node*)get_irn_link(in);
291
292
293
294

		if (nw != NULL && nw != in) {
			set_irn_dep(node, i, nw);
			in = nw;
295
			changed = 1;
296
297
298
299
		}

		fix_loops(in);
	}
300

301
	if (changed) {
302
		identify_remember(node);
303
	}
304
305
}

306
307
ir_node *be_pre_transform_node(ir_node *place)
{
308
309
310
311
312
313
	if (place == NULL)
		return NULL;

	return be_transform_node(place);
}

314
static void pre_transform_anchor(ir_graph *irg, int anchor)
315
316
317
{
	ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
	ir_node *transformed     = be_transform_node(old_anchor_node);
318
	set_irg_anchor(irg, anchor, transformed);
319
320
}

321
322
323
/**
 * Transforms all nodes. Deletes the old obstack and creates a new one.
 */
324
static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
325
326
{
	int       i;
327
	ir_node  *old_end, *new_anchor;
328
329
330
331
332

	hook_dead_node_elim(irg, 1);

	inc_irg_visited(irg);

333
334
335
	env.irg        = irg;
	env.worklist   = new_waitq();
	env.old_anchor = irg->anchor;
336
337
338
339

	old_end = get_irg_end(irg);

	/* put all anchor nodes in the worklist */
340
341
	for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
		ir_node *anchor = get_irg_anchor(irg, i);
342
343
344
345
346
347

		if (anchor == NULL)
			continue;
		waitq_put(env.worklist, anchor);
	}

348
	new_anchor  = new_r_Anchor(irg);
349
	irg->anchor = new_anchor;
350

351
352
	/* pre transform some anchors (so they are available in the other transform
	 * functions) */
353
354
355
356
357
358
	pre_transform_anchor(irg, anchor_no_mem);
	pre_transform_anchor(irg, anchor_end_block);
	pre_transform_anchor(irg, anchor_end);
	pre_transform_anchor(irg, anchor_start_block);
	pre_transform_anchor(irg, anchor_start);
	pre_transform_anchor(irg, anchor_frame);
359
360

	if (pre_transform)
361
		pre_transform();
362
363
364

	/* process worklist (this should transform all nodes in the graph) */
	while (! waitq_empty(env.worklist)) {
365
		ir_node *node = (ir_node*)waitq_get(env.worklist);
366
367
368
369
370
		be_transform_node(node);
	}

	/* fix loops and set new anchors*/
	inc_irg_visited(irg);
371
	for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
372
		ir_node *anchor = get_irn_n(env.old_anchor, i);
373
374
375
376

		if (anchor == NULL)
			continue;

377
		anchor = (ir_node*)get_irn_link(anchor);
378
		fix_loops(anchor);
379
		set_irn_n(new_anchor, i, anchor);
380
381
382
383
384
385
386
	}

	del_waitq(env.worklist);
	free_End(old_end);
	hook_dead_node_elim(irg, 0);
}

387
void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
388
389
390
391
392
393
394
395
396
{
	ir_graph *old_current_ir_graph = current_ir_graph;
	struct obstack *old_obst = NULL;
	struct obstack *new_obst = NULL;

	current_ir_graph = irg;

	/* create a new obstack */
	old_obst = irg->obst;
397
	new_obst = XMALLOC(struct obstack);
398
399
400
401
	obstack_init(new_obst);
	irg->obst = new_obst;
	irg->last_node_idx = 0;

402
403
404
405
406
	/* invalidate phase info as (at least vrp info) is used inside the
	 * equivalent/compute_value functions and might replace our newly
	 * created nodes with middleend nodes */
	irg_invalidate_phases(irg);

407
	/* create new value table for CSE */
408
	new_identities(irg);
409
410

	/* do the main transformation */
411
	transform_nodes(irg, func);
412
413
414
415
416
417
418
419

	/* free the old obstack */
	obstack_free(old_obst, 0);
	xfree(old_obst);

	/* restore state */
	current_ir_graph = old_current_ir_graph;

420
421
422
423
424
	/* most analysis info is wrong after transformation */
	free_callee_info(irg);
	free_irg_outs(irg);
	free_trouts();
	free_loop_information(irg);
425
	clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE);
426

427
	be_liveness_invalidate(be_get_irg_liveness(irg));
428
	/* Hack for now, something is buggy with invalidate liveness... */
429
	be_birg_from_irg(irg)->lv = NULL;
430
	be_invalidate_dom_front(irg);
431

432
433
434
435
	/* recalculate edges */
	edges_deactivate(irg);
	edges_activate(irg);
}