betranshlp.c 13.9 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
 * @date        14.06.2007
 */
#include "config.h"

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

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
	int deps = get_irn_deps(old_node);
Matthias Braun's avatar
Matthias Braun committed
82
	for (int i = 0; i < deps; ++i) {
83
84
85
86
87
88
89
		ir_node *dep     = get_irn_dep(old_node, i);
		ir_node *new_dep = be_transform_node(dep);

		add_irn_dep(new_node, new_dep);
	}
}

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

99
100
101
102
103
/**
 * Transform helper for blocks.
 */
static ir_node *transform_block(ir_node *node)
{
Matthias Braun's avatar
Matthias Braun committed
104
105
106
107
108
	ir_graph *irg   = get_irn_irg(node);
	dbg_info *dbgi  = get_irn_dbg_info(node);
	ir_mode  *mode  = get_irn_mode(node);
	ir_node  *block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), mode,
	                              get_irn_arity(node), get_irn_in(node) + 1);
109
110
111
	copy_node_attr(irg, node, block);
	block->node_nr = node->node_nr;

112
113
114
115
	/* transfer execfreq value */
	double execfreq = get_block_execfreq(node);
	set_block_execfreq(block, execfreq);

116
117
118
119
120
121
122
123
124
	/* 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 */
Matthias Braun's avatar
Matthias Braun committed
125
126
127
128
	ir_graph *irg     = get_irn_irg(node);
	dbg_info *dbgi    = get_irn_dbg_info(node);
	ir_node  *block   = be_transform_node(get_nodes_block(node));
	ir_node  *new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
129
130
131
132
133
134
135
	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 */
Matthias Braun's avatar
Matthias Braun committed
136
137
	int arity = get_irn_arity(node);
	for (int i = 0; i < arity; ++i) {
138
139
140
141
142
143
144
145
		ir_node *in = get_irn_n(node, i);
		add_End_keepalive(new_end, in);
	}
	be_enqueue_preds(node);

	return new_end;
}

146
147
ir_node *be_duplicate_node(ir_node *node)
{
148
149
150
151
152
153
	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);

Matthias Braun's avatar
Matthias Braun committed
154
155
	ir_node *new_node;
	int      arity = get_irn_arity(node);
156
157
	if (op->opar == oparity_dynamic) {
		new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
Matthias Braun's avatar
Matthias Braun committed
158
		for (int i = 0; i < arity; ++i) {
159
160
161
162
163
			ir_node *in = get_irn_n(node, i);
			in = be_transform_node(in);
			add_irn_n(new_node, in);
		}
	} else {
164
		ir_node **ins = ALLOCAN(ir_node*, arity);
Matthias Braun's avatar
Matthias Braun committed
165
		for (int i = 0; i < arity; ++i) {
166
167
168
169
170
171
172
			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);
	}

173
	copy_node_attr(irg, node, new_node);
174
175
176
177
178
179
	be_duplicate_deps(node, new_node);

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

180
181
ir_node *be_transform_node(ir_node *node)
{
Matthias Braun's avatar
Matthias Braun committed
182
	ir_node *new_node = be_get_transformed_node(node);
183
	if (new_node != NULL)
184
185
		return new_node;

186
	DEBUG_ONLY(be_set_transformed_node(node, NULL);)
187

Matthias Braun's avatar
Matthias Braun committed
188
	ir_op *op = get_irn_op(node);
189
190
	if (op->ops.generic == NULL) {
		panic("No transform function registered for node %+F.", node);
191
	}
Matthias Braun's avatar
Matthias Braun committed
192
	be_transform_func *transform = (be_transform_func *)op->ops.generic;
193
194
195

	new_node = transform(node);
	assert(new_node != NULL);
196
197
198
199
200

	be_set_transformed_node(node, new_node);
	return new_node;
}

201
202
void be_enqueue_preds(ir_node *node)
{
203
	/* put the preds in the worklist */
Matthias Braun's avatar
Matthias Braun committed
204
205
	int arity = get_irn_arity(node);
	for (int i = 0; i < arity; ++i) {
206
207
208
209
210
211
212
213
		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.
 */
214
215
static void fix_loops(ir_node *node)
{
Matthias Braun's avatar
Matthias Braun committed
216
217
	assert(node_is_in_irgs_storage(env.irg, node));

218
	if (irn_visited_else_mark(node))
219
220
		return;

Matthias Braun's avatar
Matthias Braun committed
221
	bool changed = false;
222
223
	if (! is_Block(node)) {
		ir_node *block     = get_nodes_block(node);
224
		ir_node *new_block = (ir_node*)get_irn_link(block);
225
226
227
228

		if (new_block != NULL) {
			set_nodes_block(node, new_block);
			block = new_block;
Matthias Braun's avatar
Matthias Braun committed
229
			changed = true;
230
231
232
233
234
		}

		fix_loops(block);
	}

Matthias Braun's avatar
Matthias Braun committed
235
236
	int arity = get_irn_arity(node);
	for (int i = 0; i < arity; ++i) {
237
		ir_node *in = get_irn_n(node, i);
238
		ir_node *nw = (ir_node*)get_irn_link(in);
239
240
241
242

		if (nw != NULL && nw != in) {
			set_irn_n(node, i, nw);
			in = nw;
Matthias Braun's avatar
Matthias Braun committed
243
			changed = true;
244
245
246
247
		}

		fix_loops(in);
	}
248
	/* fix proj block */
249
	if (is_Proj(node)) {
250
		set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
Matthias Braun's avatar
Matthias Braun committed
251
		changed = true;
252
	}
253
254

	arity = get_irn_deps(node);
Matthias Braun's avatar
Matthias Braun committed
255
	for (int i = 0; i < arity; ++i) {
256
		ir_node *in = get_irn_dep(node, i);
257
		ir_node *nw = (ir_node*)get_irn_link(in);
258
259
260
261

		if (nw != NULL && nw != in) {
			set_irn_dep(node, i, nw);
			in = nw;
Matthias Braun's avatar
Matthias Braun committed
262
			changed = true;
263
264
265
266
		}

		fix_loops(in);
	}
267

268
	if (changed) {
269
		identify_remember(node);
270
	}
271
272
}

273
274
ir_node *be_pre_transform_node(ir_node *place)
{
275
276
277
278
279
280
	if (place == NULL)
		return NULL;

	return be_transform_node(place);
}

281
static void pre_transform_anchor(ir_graph *irg, int anchor)
282
283
284
{
	ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
	ir_node *transformed     = be_transform_node(old_anchor_node);
285
	set_irg_anchor(irg, anchor, transformed);
286
287
}

288
289
290
/**
 * Transforms all nodes. Deletes the old obstack and creates a new one.
 */
291
static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
292
{
293
294
295
296
	hook_dead_node_elim(irg, 1);

	inc_irg_visited(irg);

297
298
299
	env.irg        = irg;
	env.worklist   = new_waitq();
	env.old_anchor = irg->anchor;
300

Matthias Braun's avatar
Matthias Braun committed
301
	ir_node *old_end = get_irg_end(irg);
302
303

	/* put all anchor nodes in the worklist */
Matthias Braun's avatar
Matthias Braun committed
304
	for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
305
		ir_node *anchor = get_irg_anchor(irg, i);
306
307
308
309
310
311

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

Matthias Braun's avatar
Matthias Braun committed
312
	ir_node *new_anchor  = new_r_Anchor(irg);
313
	irg->anchor = new_anchor;
314

315
316
	/* pre transform some anchors (so they are available in the other transform
	 * functions) */
317
318
319
320
321
322
	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);
323
324

	if (pre_transform)
325
		pre_transform();
326
327
328

	/* process worklist (this should transform all nodes in the graph) */
	while (! waitq_empty(env.worklist)) {
329
		ir_node *node = (ir_node*)waitq_get(env.worklist);
330
331
332
333
334
		be_transform_node(node);
	}

	/* fix loops and set new anchors*/
	inc_irg_visited(irg);
Matthias Braun's avatar
Matthias Braun committed
335
	for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
336
		ir_node *anchor = get_irn_n(env.old_anchor, i);
337
338
339
340

		if (anchor == NULL)
			continue;

341
		anchor = (ir_node*)get_irn_link(anchor);
342
		fix_loops(anchor);
343
		set_irn_n(new_anchor, i, anchor);
344
345
346
347
348
349
350
	}

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

351
void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
352
353
354
355
356
{
	ir_graph *old_current_ir_graph = current_ir_graph;
	current_ir_graph = irg;

	/* create a new obstack */
Matthias Braun's avatar
Matthias Braun committed
357
358
	struct obstack *old_obst = irg->obst;
	struct obstack *new_obst = XMALLOC(struct obstack);
359
360
361
362
	obstack_init(new_obst);
	irg->obst = new_obst;
	irg->last_node_idx = 0;

363
	free_vrp_data(irg);
364

365
	/* create new value table for CSE */
366
	new_identities(irg);
367
368

	/* do the main transformation */
369
	transform_nodes(irg, func);
370
371
372
373
374
375
376
377

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

	/* restore state */
	current_ir_graph = old_current_ir_graph;

378
	/* most analysis info is wrong after transformation */
379
	be_invalidate_live_chk(irg);
Matthias Braun's avatar
Matthias Braun committed
380
	confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
381

382
383
384
	/* recalculate edges */
	edges_activate(irg);
}
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524

bool be_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	ir_op *op = get_irn_op(node);
	if (op->ops.generic1 == NULL)
		return false;
	upper_bits_clean_func func = (upper_bits_clean_func)op->ops.generic1;
	return func(node, mode);
}

static bool bit_binop_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	return be_upper_bits_clean(get_binop_left(node), mode)
	    && be_upper_bits_clean(get_binop_right(node), mode);
}

static bool mux_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	return be_upper_bits_clean(get_Mux_true(node), mode)
	    && be_upper_bits_clean(get_Mux_false(node), mode);
}

static bool and_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	if (!mode_is_signed(mode)) {
		return be_upper_bits_clean(get_And_left(node), mode)
		    || be_upper_bits_clean(get_And_right(node), mode);
	} else {
		return bit_binop_upper_bits_clean(node, mode);
	}
}

static bool shr_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	if (mode_is_signed(mode)) {
		return false;
	} else {
		const ir_node *right = get_Shr_right(node);
		if (is_Const(right)) {
			ir_tarval *tv  = get_Const_tarval(right);
			long       val = get_tarval_long(tv);
			if (val >= 32 - (long)get_mode_size_bits(mode))
				return true;
		}
		return be_upper_bits_clean(get_Shr_left(node), mode);
	}
}

static bool shrs_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	return be_upper_bits_clean(get_Shrs_left(node), mode);
}

static bool const_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	ir_tarval *tv  = get_Const_tarval(node);
	long       val = get_tarval_long(tv);
	if (mode_is_signed(mode)) {
		long    shifted = val >> (get_mode_size_bits(mode)-1);
		return shifted == 0 || shifted == -1;
	} else {
		unsigned long shifted = (unsigned long)val;
		shifted >>= get_mode_size_bits(mode)-1;
		shifted >>= 1;
		return shifted == 0;
	}
}

static bool conv_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	ir_mode       *dest_mode = get_irn_mode(node);
	const ir_node *op        = get_Conv_op(node);
	ir_mode       *src_mode  = get_irn_mode(op);
	if (mode_is_float(src_mode))
		return true;

	unsigned src_bits  = get_mode_size_bits(src_mode);
	unsigned dest_bits = get_mode_size_bits(dest_mode);
	/* downconvs are a nop */
	if (src_bits >= dest_bits)
		return be_upper_bits_clean(op, mode);
	/* upconvs are fine if src is big enough or if sign matches */
	if (src_bits <= get_mode_size_bits(mode)
		&& mode_is_signed(src_mode) == mode_is_signed(mode))
		return true;
	return false;
}

static bool proj_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
	const ir_node *pred = get_Proj_pred(node);
	switch (get_irn_opcode(pred)) {
	case iro_Load: {
		ir_mode *load_mode = get_Load_mode(pred);
		unsigned load_bits = get_mode_size_bits(load_mode);
		if (load_bits > get_mode_size_bits(mode))
			return false;
		if (mode_is_signed(load_mode) != mode_is_signed(mode))
			return false;
		return true;
	}
	default:
		break;
	}
	return false;
}

void be_set_upper_bits_clean_function(ir_op *op, upper_bits_clean_func func)
{
	op->ops.generic1 = (op_func)func;
}

void be_start_transform_setup(void)
{
	ir_clear_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);
	be_set_transform_function(op_be_IncSP,    be_duplicate_node);
	be_set_transform_function(op_be_Keep,     be_duplicate_node);
	be_set_transform_function(op_be_Return,   be_duplicate_node);
	be_set_transform_function(op_be_Start,    be_duplicate_node);
	be_set_transform_function(op_Block,       transform_block);
	be_set_transform_function(op_End,         transform_end);
	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);

	be_set_upper_bits_clean_function(op_And,   and_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Const, const_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Conv,  conv_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Eor,   bit_binop_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Mux,   mux_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Or,    bit_binop_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Proj,  proj_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Shr,   shr_upper_bits_clean);
	be_set_upper_bits_clean_function(op_Shrs,  shrs_upper_bits_clean);
}