betranshlp.c 12.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
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 "betranshlp.h"
44
#include "belive.h"
45
#include "benode.h"
46
47
48
49
50

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 */
51
	ir_node  *old_anchor;  /**< the old anchor node in the old irg */
52
53
54
55
56
} be_transform_env_t;


static be_transform_env_t env;

57
58
void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
{
59
	set_irn_link(old_node, new_node);
60
	mark_irn_visited(old_node);
61
62
}

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

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

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

91
void be_dep_on_frame(ir_node* node)
92
93
94
95
96
97
98
{
	ir_graph *const irg = current_ir_graph;

	if (get_irg_start_block(irg) == get_nodes_block(node))
		add_irn_dep(node, get_irg_frame(irg));
}

99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
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;
}

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_Barrier,  be_duplicate_node);
	be_set_transform_function(op_be_Copy,     be_duplicate_node);
	be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
116
	be_set_transform_function(op_be_IncSP,    be_duplicate_node);
117
	be_set_transform_function(op_be_Keep,     be_duplicate_node);
118
119
120
121
122
123
	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_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);
124
125
}

126
127
ir_node *be_duplicate_node(ir_node *node)
{
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
	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 {
145
		ir_node **ins = ALLOCAN(ir_node*, arity);
146
147
148
149
150
151
152
153
		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);
	}

154
	copy_node_attr(irg, node, new_node);
155
156
157
158
159
160
	be_duplicate_deps(node, new_node);

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

161
162
ir_node *be_transform_node(ir_node *node)
{
Michael Beck's avatar
Michael Beck committed
163
164
165
	ir_op             *op;
	ir_node           *new_node = be_get_transformed_node(node);
	be_transform_func *transform;
166

167
	if (new_node != NULL)
168
169
170
171
172
		return new_node;

	DEBUG_ONLY(be_set_transformed_node(node, NULL));

	op = get_irn_op(node);
173
174
	if (op->ops.generic == NULL) {
		panic("No transform function registered for node %+F.", node);
175
	}
Michael Beck's avatar
Michael Beck committed
176
	transform = (be_transform_func *)op->ops.generic;
177
178
179

	new_node = transform(node);
	assert(new_node != NULL);
180
181
182
183
184
185

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

186
187
void be_enqueue_preds(ir_node *node)
{
188
189
190
191
192
193
194
195
196
197
198
199
200
	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.
 */
201
202
static void fix_loops(ir_node *node)
{
203
	int i, arity;
204
	int changed;
205

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

208
	if (irn_visited_else_mark(node))
209
210
		return;

211
	changed = 0;
212
213
214
215
216
217
218
	if (! is_Block(node)) {
		ir_node *block     = get_nodes_block(node);
		ir_node *new_block = get_irn_link(block);

		if (new_block != NULL) {
			set_nodes_block(node, new_block);
			block = new_block;
219
			changed = 1;
220
221
222
223
224
225
226
227
228
229
230
231
232
		}

		fix_loops(block);
	}

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

		if (nw != NULL && nw != in) {
			set_irn_n(node, i, nw);
			in = nw;
233
			changed = 1;
234
235
236
237
		}

		fix_loops(in);
	}
238
	/* fix proj block */
239
	if (is_Proj(node)) {
240
		set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
241
		changed = 1;
242
	}
243
244
245
246
247
248
249
250
251

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

		if (nw != NULL && nw != in) {
			set_irn_dep(node, i, nw);
			in = nw;
252
			changed = 1;
253
254
255
256
		}

		fix_loops(in);
	}
257

258
	if (changed) {
259
		identify_remember(node);
260
	}
261
262
}

263
264
ir_node *be_pre_transform_node(ir_node *place)
{
265
266
267
268
269
270
	if (place == NULL)
		return NULL;

	return be_transform_node(place);
}

271
272
273
274
275
276
277
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);
}

278
279
280
281
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);
282
	if (old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
283
284
285
286
		set_irn_n(env.old_anchor, anchor, old_bad);
	}
}

287
288
static ir_node *new_be_Anchor(ir_graph *irg)
{
289
	struct obstack *obst = be_get_be_obst(irg);
290
291
292
293
294
	backend_info_t *info;
	ir_node        *new_anchor;

	/* Hack: some places in the code ask the Anchor for its register
	   requirements */
295
	new_anchor = new_r_Anchor(irg);
296
297
298
299
300
301
302
303
	info = be_get_info(new_anchor);
	info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
	memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
	info->out_infos[0].req = arch_no_register_req;

	return new_anchor;
}

304
305
306
/**
 * Transforms all nodes. Deletes the old obstack and creates a new one.
 */
307
static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
308
309
{
	int       i;
310
	ir_node  *old_end, *new_anchor;
311
312
313
314
315
316
317

	hook_dead_node_elim(irg, 1);

	inc_irg_visited(irg);

	env.irg         = irg;
	env.worklist    = new_waitq();
318
	env.old_anchor  = irg->anchor;
319
320
321
322

	old_end = get_irg_end(irg);

	/* put all anchor nodes in the worklist */
323
324
	for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
		ir_node *anchor = get_irg_anchor(irg, i);
325
326
327
328
329
330

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

331
	new_anchor  = new_be_Anchor(irg);
332
	irg->anchor = new_anchor;
333

334
335
	/* pre transform some anchors (so they are available in the other transform
	 * functions) */
336
337
338
339
340
	pre_transform_anchor(anchor_bad);
	pre_transform_anchor(anchor_no_mem);
	pre_transform_anchor(anchor_start_block);
	pre_transform_anchor(anchor_start);
	pre_transform_anchor(anchor_frame);
341
	kill_unused_anchor(anchor_tls);
342
343

	if (pre_transform)
344
		pre_transform();
345
346
347
348
349
350
351
352
353

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

	/* fix loops and set new anchors*/
	inc_irg_visited(irg);
354
	for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
355
		ir_node *anchor = get_irn_n(env.old_anchor, i);
356
357
358
359
360
361

		if (anchor == NULL)
			continue;

		anchor = get_irn_link(anchor);
		fix_loops(anchor);
362
		set_irn_n(new_anchor, i, anchor);
363
364
365
366
367
368
369
	}

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

370
371
372
/**
 * Transform helper for blocks.
 */
373
374
static ir_node *gen_Block(ir_node *node)
{
375
376
	ir_graph *irg             = current_ir_graph;
	dbg_info *dbgi            = get_irn_dbg_info(node);
377
378
379
380
	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);
381
	copy_node_attr(irg, node, block);
382
	block->node_nr = node->node_nr;
383

384
385
386
387
388
389
	/* put the preds in the worklist */
	be_enqueue_preds(node);

	return block;
}

390
391
static ir_node *gen_End(ir_node *node)
{
392
393
394
395
396
397
398
399
	/* 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);
400
	copy_node_attr(irg, node, new_end);
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
	be_duplicate_deps(node, new_end);

	set_irg_end(irg, new_end);

	/* transform preds */
	arity = get_irn_arity(node);
	for (i = 0; i < arity; ++i) {
		ir_node *in     = get_irn_n(node, i);
		ir_node *new_in = be_transform_node(in);

		add_End_keepalive(new_end, new_in);
	}

	return new_end;
}

417
void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
418
419
420
421
422
423
424
425
426
{
	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;
427
	new_obst = XMALLOC(struct obstack);
428
429
430
431
	obstack_init(new_obst);
	irg->obst = new_obst;
	irg->last_node_idx = 0;

432
433
434
435
436
	/* 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);

437
	/* create new value table for CSE */
438
	new_identities(irg);
439

440
441
442
443
	/* enter special helper */
	op_Block->ops.generic = (op_func)gen_Block;
	op_End->ops.generic   = (op_func)gen_End;

444
	/* do the main transformation */
445
	transform_nodes(irg, func);
446
447
448
449
450
451
452
453

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

	/* restore state */
	current_ir_graph = old_current_ir_graph;

454
455
456
457
458
459
460
	/* 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);

461
	be_liveness_invalidate(be_get_irg_liveness(irg));
462
	/* Hack for now, something is buggy with invalidate liveness... */
463
	be_birg_from_irg(irg)->lv = NULL;
464
	be_invalidate_dom_front(irg);
465

466
467
468
469
	/* recalculate edges */
	edges_deactivate(irg);
	edges_activate(irg);
}
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
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544

int be_mux_is_abs(ir_node *sel, ir_node *mux_true, ir_node *mux_false)
{
	ir_node *cmp_left;
	ir_node *cmp_right;
	ir_node *cmp;
	ir_mode *mode;
	pn_Cmp   pnc;

	if (!is_Proj(sel))
		return 0;
	cmp = get_Proj_pred(sel);
	if (!is_Cmp(cmp))
		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 <, <=, >=, > */
	pnc = get_Proj_proj(sel);
	switch (pnc) {
	case pn_Cmp_Ge:
	case pn_Cmp_Gt:
	case pn_Cmp_Le:
	case pn_Cmp_Lt:
	case pn_Cmp_Uge:
	case pn_Cmp_Ug:
	case pn_Cmp_Ul:
	case pn_Cmp_Ule:
		break;
	default:
		return 0;
	}

	if (!is_negated_value(mux_true, mux_false))
		return 0;

	/* must be x cmp 0 */
	cmp_right = get_Cmp_right(cmp);
	if (!is_Const(cmp_right) || !is_Const_null(cmp_right))
		return 0;

	cmp_left = get_Cmp_left(cmp);
	if (cmp_left == mux_false) {
		if (pnc & pn_Cmp_Lt) {
			return 1;
		} else {
			assert(pnc & pn_Cmp_Gt);
			return -1;
		}
	} else if (cmp_left == mux_true) {
		if (pnc & pn_Cmp_Lt) {
			return -1;
		} else {
			assert(pnc & pn_Cmp_Gt);
			return 1;
		}
	}

	return 0;
}

ir_node *be_get_abs_op(ir_node *sel)
{
	ir_node *cmp      = get_Proj_pred(sel);
	ir_node *cmp_left = get_Cmp_left(cmp);
	return cmp_left;
}