betranshlp.c 12.4 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
	set_irn_link(old_node, new_node);
61
	mark_irn_visited(old_node);
62
63
}

64
65
int be_is_transformed(const ir_node *node)
{
66
67
68
	return irn_visited(node);
}

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

79
80
void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
{
81
82
83
84
85
86
87
88
89
90
91
	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);
	}
}

92
93
94
95
96
97
98
99
100
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;
}

101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
/**
 * Transform helper for blocks.
 */
static ir_node *transform_block(ir_node *node)
{
	ir_graph *irg             = current_ir_graph;
	dbg_info *dbgi            = get_irn_dbg_info(node);
	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 */
	ir_graph *irg   = current_ir_graph;
	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;
}

148
149
150
151
152
153
154
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);
155
	be_set_transform_function(op_be_IncSP,    be_duplicate_node);
156
	be_set_transform_function(op_be_Keep,     be_duplicate_node);
157
158
	be_set_transform_function(op_be_Return,   be_duplicate_node);
	be_set_transform_function(op_be_Start,    be_duplicate_node);
159
160
	be_set_transform_function(op_Block,       transform_block);
	be_set_transform_function(op_End,         transform_end);
161
162
163
164
	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);
165
166
}

167
168
ir_node *be_duplicate_node(ir_node *node)
{
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
	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 {
186
		ir_node **ins = ALLOCAN(ir_node*, arity);
187
188
189
190
191
192
193
194
		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);
	}

195
	copy_node_attr(irg, node, new_node);
196
197
198
199
200
201
	be_duplicate_deps(node, new_node);

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

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

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

	DEBUG_ONLY(be_set_transformed_node(node, NULL));

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

	new_node = transform(node);
	assert(new_node != NULL);
221
222
223
224
225
226

	be_set_transformed_node(node, new_node);
	hook_dead_node_elim_subst(current_ir_graph, node, new_node);
	return new_node;
}

227
228
void be_enqueue_preds(ir_node *node)
{
229
230
231
232
233
234
235
236
237
238
239
240
241
	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.
 */
242
243
static void fix_loops(ir_node *node)
{
244
	int i, arity;
245
	int changed;
246

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

249
	if (irn_visited_else_mark(node))
250
251
		return;

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

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

		fix_loops(block);
	}

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

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

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

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

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

		fix_loops(in);
	}
298

299
	if (changed) {
300
		identify_remember(node);
301
	}
302
303
}

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

	return be_transform_node(place);
}

312
313
314
315
316
317
318
static void pre_transform_anchor(int anchor)
{
	ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
	ir_node *transformed     = be_transform_node(old_anchor_node);
	set_irg_anchor(current_ir_graph, anchor, transformed);
}

319
320
321
322
static void kill_unused_anchor(int anchor)
{
	ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
	ir_node *old_bad         = get_irn_n(env.old_anchor, anchor_bad);
323
	if (old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
324
325
326
327
		set_irn_n(env.old_anchor, anchor, old_bad);
	}
}

328
329
330
/**
 * Transforms all nodes. Deletes the old obstack and creates a new one.
 */
331
static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
332
333
{
	int       i;
334
	ir_node  *old_end, *new_anchor;
335
336
337
338
339

	hook_dead_node_elim(irg, 1);

	inc_irg_visited(irg);

340
341
342
	env.irg        = irg;
	env.worklist   = new_waitq();
	env.old_anchor = irg->anchor;
343
344
345
346

	old_end = get_irg_end(irg);

	/* put all anchor nodes in the worklist */
347
348
	for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
		ir_node *anchor = get_irg_anchor(irg, i);
349
350
351
352
353
354

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

355
	new_anchor  = new_r_Anchor(irg);
356
	irg->anchor = new_anchor;
357

358
359
	/* pre transform some anchors (so they are available in the other transform
	 * functions) */
360
361
	pre_transform_anchor(anchor_bad);
	pre_transform_anchor(anchor_no_mem);
362
363
	pre_transform_anchor(anchor_end_block);
	pre_transform_anchor(anchor_end);
364
365
366
	pre_transform_anchor(anchor_start_block);
	pre_transform_anchor(anchor_start);
	pre_transform_anchor(anchor_frame);
367
	kill_unused_anchor(anchor_tls);
368
369

	if (pre_transform)
370
		pre_transform();
371
372
373

	/* process worklist (this should transform all nodes in the graph) */
	while (! waitq_empty(env.worklist)) {
374
		ir_node *node = (ir_node*)waitq_get(env.worklist);
375
376
377
		be_transform_node(node);
	}

378
379
380
381
	/* let beabi grab new nodes */
	be_abi_transform_fixup(irg);
	assert(waitq_empty(env.worklist)); // let's hope this didn't trigger new transforms

382
383
	/* fix loops and set new anchors*/
	inc_irg_visited(irg);
384
	for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
385
		ir_node *anchor = get_irn_n(env.old_anchor, i);
386
387
388
389

		if (anchor == NULL)
			continue;

390
		anchor = (ir_node*)get_irn_link(anchor);
391
		fix_loops(anchor);
392
		set_irn_n(new_anchor, i, anchor);
393
394
395
396
397
398
399
	}

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

400
void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
401
402
403
404
405
406
407
408
409
{
	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;
410
	new_obst = XMALLOC(struct obstack);
411
412
413
414
	obstack_init(new_obst);
	irg->obst = new_obst;
	irg->last_node_idx = 0;

415
416
417
418
419
	/* 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);

420
	/* create new value table for CSE */
421
	new_identities(irg);
422
423

	/* do the main transformation */
424
	transform_nodes(irg, func);
425
426
427
428
429
430
431
432

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

	/* restore state */
	current_ir_graph = old_current_ir_graph;

433
434
435
436
437
438
439
	/* most analysis info is wrong after transformation */
	free_callee_info(irg);
	free_irg_outs(irg);
	free_trouts();
	free_loop_information(irg);
	set_irg_doms_inconsistent(irg);

440
	be_liveness_invalidate(be_get_irg_liveness(irg));
441
	/* Hack for now, something is buggy with invalidate liveness... */
442
	be_birg_from_irg(irg)->lv = NULL;
443
	be_invalidate_dom_front(irg);
444

445
446
447
448
	/* recalculate edges */
	edges_deactivate(irg);
	edges_activate(irg);
}
449
450
451

int be_mux_is_abs(ir_node *sel, ir_node *mux_true, ir_node *mux_false)
{
452
453
454
455
	ir_node    *cmp_left;
	ir_node    *cmp_right;
	ir_mode    *mode;
	ir_relation relation;
456

457
	if (!is_Cmp(sel))
458
459
460
461
462
463
464
465
466
467
468
469
470
		return 0;

	/**
	 * Note further that these optimization work even for floating point
	 * with NaN's because -NaN == NaN.
	 * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
	 * transformations.
	 */
	mode = get_irn_mode(mux_true);
	if (mode_honor_signed_zeros(mode))
		return 0;

	/* must be <, <=, >=, > */
471
472
	relation = get_Cmp_relation(sel);
	if ((relation & ir_relation_less_greater) == 0)
473
474
		return 0;

475
	if (!ir_is_negated_value(mux_true, mux_false))
476
477
478
		return 0;

	/* must be x cmp 0 */
479
	cmp_right = get_Cmp_right(sel);
480
481
482
	if (!is_Const(cmp_right) || !is_Const_null(cmp_right))
		return 0;

483
	cmp_left = get_Cmp_left(sel);
484
	if (cmp_left == mux_false) {
485
		if (relation & ir_relation_less) {
486
487
			return 1;
		} else {
488
			assert(relation & ir_relation_greater);
489
490
491
			return -1;
		}
	} else if (cmp_left == mux_true) {
492
		if (relation & ir_relation_less) {
493
494
			return -1;
		} else {
495
			assert(relation & ir_relation_greater);
496
497
498
499
500
501
502
503
504
			return 1;
		}
	}

	return 0;
}

ir_node *be_get_abs_op(ir_node *sel)
{
505
	ir_node *cmp_left = get_Cmp_left(sel);
506
507
	return cmp_left;
}