condeval.c 13.6 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.
 */

Michael Beck's avatar
Michael Beck committed
20
21
22
23
24
25
/**
 * @file
 * @brief   Partial condition evaluation
 * @date    10. Sep. 2006
 * @author  Christoph Mallon, Matthias Braun
 * @version $Id$
26
 */
27
28
29
30
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

31
32
#include "iroptimize.h"

33
#include <assert.h>
34
35
36
#include "array.h"
#include "debug.h"
#include "ircons.h"
Christoph Mallon's avatar
Christoph Mallon committed
37
38
#include "irgmod.h"
#include "irgopt.h"
39
40
#include "irgwalk.h"
#include "irnode.h"
41
#include "irnode_t.h"
42
#include "iredges.h"
43
#include "iredges_t.h"
44
#include "irtools.h"
45
#include "irgraph.h"
46
47
48
49
#include "tv.h"

DEBUG_ONLY(static firm_dbg_module_t *dbg);

Christoph Mallon's avatar
Christoph Mallon committed
50
51
52
53
54
55
56
57
58
59
60
61
62
/**
 * Add the new predecessor x to node node, which is either a Block or a Phi
 */
static void add_pred(ir_node* node, ir_node* x)
{
	ir_node** ins;
	int n;
	int i;

	assert(is_Block(node) || is_Phi(node));

	n = get_irn_arity(node);
	NEW_ARR_A(ir_node*, ins, n + 1);
63
64
	for (i = 0; i < n; i++)
		ins[i] = get_irn_n(node, i);
Christoph Mallon's avatar
Christoph Mallon committed
65
66
67
68
69
70
	ins[n] = x;
	set_irn_in(node, n + 1, ins);
}

static ir_node *search_def_and_create_phis(ir_node *block, ir_mode *mode)
{
71
72
73
74
75
76
	int i;
	int n_cfgpreds;
	ir_graph *irg;
	ir_node *phi;
	ir_node **in;

77
78
79
	// This is needed because we create bads sometimes
	if(is_Bad(block))
		return new_Bad();
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98

	// already processed this block?
	if(irn_visited(block)) {
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

	// blocks with only 1 pred need no phi
	n_cfgpreds = get_Block_n_cfgpreds(block);
	if(n_cfgpreds == 1) {
		ir_node *pred_block = get_Block_cfgpred_block(block, 0);
		ir_node *value = search_def_and_create_phis(pred_block, mode);

		set_irn_link(block, value);
		mark_irn_visited(block);
		return value;
	}

	// create a new phi
Christoph Mallon's avatar
Christoph Mallon committed
99
	NEW_ARR_A(ir_node*, in, n_cfgpreds);
100
101
102
103
104
105
106
107
108
109
110
	for(i = 0; i < n_cfgpreds; ++i)
		in[i] = new_Unknown(mode);

	irg = get_irn_irg(block);
	phi = new_r_Phi(irg, block, n_cfgpreds, in, mode);
	set_irn_link(block, phi);
	mark_irn_visited(block);

	// set phi preds
	for(i = 0; i < n_cfgpreds; ++i) {
		ir_node *pred_block = get_Block_cfgpred_block(block, i);
Christoph Mallon's avatar
Christoph Mallon committed
111
		ir_node *pred_val = search_def_and_create_phis(pred_block, mode);
112
113
114
115
116
117
118
119

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

/**
120
121
122
 * Given a set of values this function constructs SSA-form for the users of the
 * first value (the users are determined through the out-edges of the value).
 * Uses the irn_visited flags. Works without using the dominance tree.
123
 */
124
static void construct_ssa(ir_node * const *blocks, ir_node * const *vals, int n_vals)
Christoph Mallon's avatar
Christoph Mallon committed
125
{
126
127
128
	int i;
	ir_graph *irg;
	ir_mode *mode;
129
130
131
	const ir_edge_t *edge;
	const ir_edge_t *next;
	ir_node *value;
132
133
134
135
136
137
138
139
140

	assert(n_vals > 0);

	irg = get_irn_irg(vals[0]);
	inc_irg_visited(irg);

	mode = get_irn_mode(vals[0]);
	for(i = 0; i < n_vals; ++i) {
		ir_node *value = vals[i];
141
		ir_node *value_block = blocks[i];
142
143
144
145
146
147
148

		assert(get_irn_mode(value) == mode);

		set_irn_link(value_block, value);
		mark_irn_visited(value_block);
	}

149
150
151
152
153
154
155
156
157
158
159
	// Only fix the users of the first, i.e. the original node
	value = vals[0];

	// this can happen when fixing phi preds, we mustn't fix the users
	if(get_nodes_block(value) != blocks[0]) return;

	foreach_out_edge_safe(value, edge, next) {
		ir_node *user = get_edge_src_irn(edge);
		int j = get_edge_src_pos(edge);
		ir_node *user_block = get_nodes_block(user);
		ir_node *newval;
160

161
162
		// ignore keeps
		if(get_irn_op(user) == op_End)
163
			continue;
164
165
166
167
168
169
170
171

		DB((dbg, LEVEL_3, ">>> Fixing user %+F (pred %d == %+F)\n", user, j, get_irn_n(user, j)));

		if(is_Phi(user)) {
			ir_node *pred_block = get_Block_cfgpred_block(user_block, j);
			newval = search_def_and_create_phis(pred_block, mode);
		} else {
			newval = search_def_and_create_phis(user_block, mode);
172
173
		}

174
175
176
177
		// don't fix newly created phis from the SSA construction
		if (newval != user) {
			DB((dbg, LEVEL_4, ">>>> Setting input %d of %+F to %+F\n", j, user, newval));
			set_irn_n(user, j, newval);
178
179
180
181
		}
	}
}

182
183
184
185
186
static void split_critical_edge(ir_node *block, int pos) {
	ir_graph *irg = get_irn_irg(block);
	ir_node *in[1];
	ir_node *new_block;
	ir_node *new_jmp;
Christoph Mallon's avatar
Christoph Mallon committed
187

188
189
190
191
	in[0] = get_Block_cfgpred(block, pos);
	new_block = new_r_Block(irg, 1, in);
	new_jmp = new_r_Jmp(irg, new_block);
	set_Block_cfgpred(block, pos, new_jmp);
Christoph Mallon's avatar
Christoph Mallon committed
192
193
}

194
195
196
197
198
199
200
201
202
203
typedef struct condeval_env_t {
	ir_node       *true_block;
	pn_Cmp         pnc;
	ir_node       *cnst;
	tarval        *tv;
	unsigned long  visited_nr;

	ir_node       *cnst_pred;   /**< the block before the constant */
	int            cnst_pos;    /**< the pos to the constant block (needed to
	                                  kill that edge later) */
204
} condeval_env_t;
Christoph Mallon's avatar
Christoph Mallon committed
205

206
207
static void copy_and_fix(const condeval_env_t *env, ir_node *block,
                         ir_node *copy_block, int j) {
208
209
210
211
212
213
	const ir_edge_t *edge;

	/* Look at all nodes in the cond_block and copy them into pred */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
		ir_node *copy;
214
		ir_mode *mode = get_irn_mode(node);
215
216

		/* ignore control flow */
217
		if (mode == mode_X || is_Cond(node))
218
			continue;
219
220
221
222
#if 1
		/* we may not copy mode_b nodes, because this could produce phi with
		 * mode_bs which can't be handled in all backends. Instead we duplicate
		 * the node and move it to it's users */
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
		if (mode == mode_b) {
			const ir_edge_t *edge, *next;
			ir_node *pred;
			int      pn;

			assert(is_Proj(node));

			pred = get_Proj_pred(node);
			pn   = get_Proj_proj(node);

			foreach_out_edge_safe(node, edge, next) {
				ir_node *cmp_copy;
				ir_node *user       = get_edge_src_irn(edge);
				int pos             = get_edge_src_pos(edge);
				ir_node *user_block = get_nodes_block(user);

				if(user_block == block)
					continue;

				cmp_copy = exact_copy(pred);
				set_nodes_block(cmp_copy, user_block);
				copy = new_r_Proj(current_ir_graph, user_block, cmp_copy, mode_b, pn);
				set_irn_n(user, pos, copy);
			}
			continue;
		}
249
#endif
Christoph Mallon's avatar
Christoph Mallon committed
250

251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
		/* we can evaluate Phis right now, all other nodes get copied */
		if (is_Phi(node)) {
			copy = get_Phi_pred(node, j);
		} else {
			copy = exact_copy(node);
			set_nodes_block(copy, copy_block);
		}

		set_irn_link(node, copy);
		set_irn_visited(node, env->visited_nr);

		/* we might hit values in blocks that have already been processed by a
		 * recursive find_phi_with_const call */
		assert(get_irn_visited(copy) <= env->visited_nr);
		if(get_irn_visited(copy) >= env->visited_nr) {
			ir_node *prev_copy = get_irn_link(copy);
			if(prev_copy != NULL)
				set_irn_link(node, prev_copy);
		}
	}
Christoph Mallon's avatar
Christoph Mallon committed
271

272
273
274
275
276
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *vals[2];
		ir_node *blocks[2];
		ir_node *node = get_edge_src_irn(edge);
277
		ir_mode *mode = get_irn_mode(node);
278

279
		if (mode == mode_X || is_Cond(node))
280
281
			continue;
		if (mode == mode_b)
282
283
			continue;

284
285
		DB((dbg, LEVEL_2, ">> Fixing users of %+F\n", node));

286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
		blocks[0] = block;
		vals[0] = node;
		blocks[1] = copy_block;
		vals[1] = get_irn_link(node);
		construct_ssa(blocks, vals, 2);
	}
}

static int eval_cmp(pn_Cmp pnc, tarval *tv1, tarval *tv2) {
	pn_Cmp cmp_result = tarval_cmp(tv1, tv2);

	// does the compare evaluate to true?
	if(cmp_result == pn_Cmp_False)
		return 0;
	if((cmp_result & pnc) != cmp_result)
		return 0;

	return 1;
}

306
307
static ir_node *find_const(condeval_env_t *env, ir_node *jump, ir_node *value)
{
308
309
310
311
312
313
314
315
	ir_node *block = get_nodes_block(jump);

	if(irn_visited(value))
		return NULL;
	mark_irn_visited(value);

	if(is_Const(value)) {
		tarval *tv_const = get_Const_tarval(env->cnst);
316
		tarval *tv       = get_Const_tarval(value);
317

318
		if(!eval_cmp(env->pnc, tv, tv_const)) {
319
			return NULL;
320
		}
Christoph Mallon's avatar
Christoph Mallon committed
321
322
323

		DB((
			dbg, LEVEL_1,
324
325
			"> Found condition evaluation candidate %+F->%+F\n",
			env->true_block, block
Christoph Mallon's avatar
Christoph Mallon committed
326
327
		));

328
329
		// adjust true_block to point directly towards our jump
		add_pred(env->true_block, jump);
330

331
		split_critical_edge(env->true_block, 0);
332

333
334
		// we need a bigger visited nr when going back
		env->visited_nr++;
335

336
337
		return block;
	}
338

339
340
	if(is_Phi(value)) {
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
341

342
		// the phi has to be in the same block as the jump
343
		if(get_nodes_block(value) != block) {
344
			return NULL;
345
		}
346

347
348
349
350
		arity = get_irn_arity(value);
		for(i = 0; i < arity; ++i) {
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
351
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
352

353
			copy_block = find_const(env, cfgpred, phi_pred);
354
			if(copy_block == NULL)
355
356
				continue;

357
			/* copy duplicated nodes in copy_block and fix SSA */
358
			copy_and_fix(env, block, copy_block, i);
359

360
361
			if(copy_block == get_nodes_block(cfgpred)) {
				env->cnst_pred = block;
362
				env->cnst_pos  = i;
363
			}
364

365
366
			// return now as we can't process more possibilities in 1 run
			return copy_block;
367
		}
Christoph Mallon's avatar
Christoph Mallon committed
368
	}
369

370
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
371
372
}

373
374
static ir_node *find_candidate(condeval_env_t *env, ir_node *jump,
                               ir_node *value)
375
{
376
377
378
379
	ir_node *block = get_nodes_block(jump);

	if(irn_visited(value)) {
		return NULL;
380
	}
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
	mark_irn_visited(value);

	if(is_Const(value)) {
		tarval *tv       = get_Const_tarval(value);

		if(tv != env->tv)
			return NULL;

		DB((
			dbg, LEVEL_1,
			"> Found condition evaluation candidate %+F->%+F\n",
			env->true_block, block
		));

		// adjust true_block to point directly towards our jump
		add_pred(env->true_block, jump);

		split_critical_edge(env->true_block, 0);
399

400
401
		// we need a bigger visited nr when going back
		env->visited_nr++;
402

403
		return block;
404
	}
405
406
	if(is_Phi(value)) {
		int i, arity;
407

408
409
410
		// the phi has to be in the same block as the jump
		if(get_nodes_block(value) != block)
			return NULL;
411

412
413
414
415
416
		arity = get_irn_arity(value);
		for(i = 0; i < arity; ++i) {
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
417

418
419
420
421
422
423
424
425
426
427
428
429
430
431
			copy_block = find_candidate(env, cfgpred, phi_pred);
			if(copy_block == NULL)
				continue;

			/* copy duplicated nodes in copy_block and fix SSA */
			copy_and_fix(env, block, copy_block, i);

			if(copy_block == get_nodes_block(cfgpred)) {
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

			// return now as we can't process more possibilities in 1 run
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
432
		}
433
434
435
436
437
438
439
440
	}
	if(is_Proj(value)) {
		ir_node *left;
		ir_node *right;
		int      pnc;
		ir_node *cmp = get_Proj_pred(value);
		if(!is_Cmp(cmp))
			return NULL;
441

442
443
444
		left  = get_Cmp_left(cmp);
		right = get_Cmp_right(cmp);
		pnc   = get_Proj_proj(value);
445

446
447
448
449
450
451
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
		if(is_Const(left)) {
			ir_node *t = left;
			left       = right;
			right      = t;
452

453
454
			pnc        = get_inversed_pnc(pnc);
		}
455

456
		if(!is_Const(right))
457
			return 0;
458

459
460
461
		if(get_nodes_block(left) != block) {
			return 0;
		}
462

463
464
465
		/* negate condition when we're looking for the false block */
		if(env->tv == get_tarval_b_false()) {
			pnc = get_negated_pnc(pnc, get_irn_mode(right));
466
		}
467

468
469
470
471
472
		// (recursively) look if a pred of a phi is a constant
		env->pnc  = pnc;
		env->cnst = right;

		return find_const(env, jump, left);
473
	}
474

475
476
	return NULL;
}
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
static void cond_eval(ir_node* block, void* data)
{
493
	condeval_env_t env;
494
	int *changed = data;
495
	ir_node *selector;
496
497
	ir_node *projx;
	ir_node *cond;
498
499
500
501
	ir_node *copy_block;
	const ir_edge_t *edge, *next;
	ir_node* bad;
	size_t   cnst_pos;
502
503
504
505
506
507
508
509
510
511
512
513
514

	if(get_Block_n_cfgpreds(block) != 1)
		return;

	projx = get_Block_cfgpred(block, 0);
	if (!is_Proj(projx))
		return;
	assert(get_irn_mode(projx) == mode_X);

	cond = get_Proj_pred(projx);
	if (!is_Cond(cond))
		return;

515
516
517
	selector = get_Cond_selector(cond);
	// TODO handle switch Conds
	if (get_irn_mode(selector) != mode_b)
518
		return;
519
520
521
522
523
524
525
526
527
528
529
530
531
532

	if (get_Proj_proj(projx) == pn_Cond_false) {
		env.tv = get_tarval_b_false();
	} else {
		env.tv = get_tarval_b_true();
	}

	// (recursively) look if a pred of a phi is a constant
	env.true_block = block;
	inc_irg_visited(current_ir_graph);
	env.visited_nr = get_irg_visited(current_ir_graph);

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
533
534
		return;

535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
	/* we have to remove the edge towards the pred as the pred now
	 * jumps into the true_block. We also have to shorten phis
	 * in our block because of this */
	bad      = new_Bad();
	cnst_pos = env.cnst_pos;

	/* shorten phis */
	foreach_out_edge_safe(env.cnst_pred, edge, next) {
		ir_node *node = get_edge_src_irn(edge);

		if(is_Phi(node))
			set_Phi_pred(node, cnst_pos, bad);
	}

	set_Block_cfgpred(env.cnst_pred, cnst_pos, bad);

	/* the graph is changed now */
	*changed = 1;
553
554
555
556
}

void opt_cond_eval(ir_graph* irg)
{
Michael Beck's avatar
Michael Beck committed
557
	int changed, rerun;
558

559
560
561
562
	FIRM_DBG_REGISTER(dbg, "firm.opt.condeval");

	DB((dbg, LEVEL_1, "===> Performing condition evaluation on %+F\n", irg));

Christoph Mallon's avatar
Christoph Mallon committed
563
	remove_critical_cf_edges(irg);
564
565
	normalize_proj_nodes(irg);

Michael Beck's avatar
Michael Beck committed
566
	edges_assure(irg);
567
568
569
	set_using_irn_link(irg);
	set_using_visited(irg);

Michael Beck's avatar
Michael Beck committed
570
	changed = 0;
571
	do {
Michael Beck's avatar
Michael Beck committed
572
573
574
575
576
577
578
		rerun = 0;
		irg_block_walk_graph(irg, cond_eval, NULL, &rerun);
		changed |= rerun;
	} while (rerun);

	if (changed) {
		/* control flow changed, some blocks may become dead */
579
		set_irg_outs_inconsistent(irg);
Michael Beck's avatar
Michael Beck committed
580
581
582
583
		set_irg_doms_inconsistent(irg);
		set_irg_extblk_inconsistent(irg);
		set_irg_loopinfo_inconsistent(irg);
	}
584
585
586

	clear_using_visited(irg);
	clear_using_irn_link(irg);
587
}