condeval.c 18.1 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Christian Würdig's avatar
Christian Würdig committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 *
 * 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
#include "array_t.h"
35
36
#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
#include "tv.h"
47
#include "opt_confirms.h"
48

49
#undef AVOID_PHIB
50

51
52
DEBUG_ONLY(static firm_dbg_module_t *dbg);

Christoph Mallon's avatar
Christoph Mallon committed
53
54
55
56
57
58
59
60
61
62
63
64
65
/**
 * 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);
66
67
	for (i = 0; i < n; i++)
		ins[i] = get_irn_n(node, i);
Christoph Mallon's avatar
Christoph Mallon committed
68
69
70
71
	ins[n] = x;
	set_irn_in(node, n + 1, ins);
}

72
73
74
75
76
static ir_node *ssa_second_def;
static ir_node *ssa_second_def_block;

static ir_node *search_def_and_create_phis(ir_node *block, ir_mode *mode,
                                           int first)
Christoph Mallon's avatar
Christoph Mallon committed
77
{
78
79
80
81
82
83
	int i;
	int n_cfgpreds;
	ir_graph *irg;
	ir_node *phi;
	ir_node **in;

84
	/* This is needed because we create bads sometimes */
85
86
	if(is_Bad(block))
		return new_Bad();
87

88
	/* already processed this block? */
89
90
91
92
93
	if(irn_visited(block)) {
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

94
95
96
97
98
99
100
101
102
	/* the other defs can't be marked for cases where a user of the original
	 * value is in the same block as the alternative definition.
	 * In this case we mustn't use the alternative definition.
	 * So we keep a flag that indicated wether we walked at least 1 block
	 * away and may use the alternative definition */
	if (block == ssa_second_def_block && !first) {
		return ssa_second_def;
	}

Matthias Braun's avatar
Matthias Braun committed
103
104
105
	irg = get_irn_irg(block);
	assert(block != get_irg_start_block(irg));

Christoph Mallon's avatar
Christoph Mallon committed
106
	/* a Block with only 1 predecessor needs no Phi */
107
108
109
	n_cfgpreds = get_Block_n_cfgpreds(block);
	if(n_cfgpreds == 1) {
		ir_node *pred_block = get_Block_cfgpred_block(block, 0);
110
		ir_node *value      = search_def_and_create_phis(pred_block, mode, 0);
111
112
113
114
115
116

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

117
	/* create a new Phi */
Christoph Mallon's avatar
Christoph Mallon committed
118
	NEW_ARR_A(ir_node*, in, n_cfgpreds);
119
120
121
122
123
124
125
	for(i = 0; i < n_cfgpreds; ++i)
		in[i] = new_Unknown(mode);

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

126
	/* set Phi predecessors */
127
128
	for(i = 0; i < n_cfgpreds; ++i) {
		ir_node *pred_block = get_Block_cfgpred_block(block, i);
129
		ir_node *pred_val   = search_def_and_create_phis(pred_block, mode, 0);
130
131
132
133
134
135
136
137

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

/**
138
139
140
 * 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.
141
 */
142
143
static void construct_ssa(ir_node *orig_block, ir_node *orig_val,
                          ir_node *second_block, ir_node *second_val)
Christoph Mallon's avatar
Christoph Mallon committed
144
{
145
146
	ir_graph *irg;
	ir_mode *mode;
147
148
	const ir_edge_t *edge;
	const ir_edge_t *next;
149

150
	irg = get_irn_irg(orig_val);
151
152
	inc_irg_visited(irg);

153
154
155
	mode = get_irn_mode(orig_val);
	set_irn_link(orig_block, orig_val);
	mark_irn_visited(orig_block);
156

157
158
	ssa_second_def_block = second_block;
	ssa_second_def       = second_val;
159

160
	/* Only fix the users of the first, i.e. the original node */
161
	foreach_out_edge_safe(orig_val, edge, next) {
162
163
164
165
		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;
166

167
168
		/* ignore keeps */
		if (is_End(user))
169
			continue;
170
171
172
173
174

		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);
175
			newval = search_def_and_create_phis(pred_block, mode, 1);
176
		} else {
177
			newval = search_def_and_create_phis(user_block, mode, 1);
178
179
		}

180
		/* don't fix newly created Phis from the SSA construction */
181
182
183
		if (newval != user) {
			DB((dbg, LEVEL_4, ">>>> Setting input %d of %+F to %+F\n", j, user, newval));
			set_irn_n(user, j, newval);
184
185
186
187
		}
	}
}

188
189
190
191
192
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
193

194
195
196
197
	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
198
199
}

200
201
typedef struct condeval_env_t {
	ir_node       *true_block;
202
	ir_node       *cmp;        /**< The Compare node that might be partial evaluated */
203
	pn_Cmp         pnc;        /**< The Compare mode of the Compare node. */
204
205
	ir_node       *cnst;
	tarval        *tv;
206
	ir_visited_t   visited_nr;
207
208
209
210

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

Matthias Braun's avatar
Matthias Braun committed
213
214
215
216
217
218
219
220
static ir_node *copy_and_fix_node(const condeval_env_t *env, ir_node *block,
                                  ir_node *copy_block, int j, ir_node *node) {
	int      i, arity;
	ir_node *copy;

	/* we can evaluate Phis right now, all other nodes get copied */
	if (is_Phi(node)) {
		copy = get_Phi_pred(node, j);
221
		/* we might have to evaluate a Phi-cascade */
Matthias Braun's avatar
Matthias Braun committed
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
		if(get_irn_visited(copy) >= env->visited_nr) {
			copy = get_irn_link(copy);
		}
	} else {
		copy = exact_copy(node);
		set_nodes_block(copy, copy_block);

		assert(get_irn_mode(copy) != mode_X);

		arity = get_irn_arity(copy);
		for(i = 0; i < arity; ++i) {
			ir_node *pred     = get_irn_n(copy, i);
			ir_node *new_pred;

			if(get_nodes_block(pred) != block)
				continue;

			if(get_irn_visited(pred) >= env->visited_nr) {
				new_pred = get_irn_link(pred);
			} else {
				new_pred = copy_and_fix_node(env, block, copy_block, j, pred);
			}
244
			DB((dbg, LEVEL_2, ">> Set Pred of %+F to %+F\n", copy, new_pred));
Matthias Braun's avatar
Matthias Braun committed
245
246
247
248
249
250
251
252
253
254
			set_irn_n(copy, i, new_pred);
		}
	}

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

	return copy;
}

255
256
static void copy_and_fix(const condeval_env_t *env, ir_node *block,
                         ir_node *copy_block, int j) {
257
258
259
260
261
262
	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;
263
264
265
266
267
268
269
		ir_mode *mode;

		if (is_Block(node)) {
			/* Block->Block edge, should be the MacroBlock edge */
			assert(get_Block_MacroBlock(node) == block && "Block->Block edge found");
			continue;
		}
270
271

		/* ignore control flow */
272
		mode = get_irn_mode(node);
273
		if (mode == mode_X || is_Cond(node))
274
			continue;
275
#ifdef AVOID_PHIB
276
		/* we may not copy mode_b nodes, because this could produce Phi with
277
		 * mode_bs which can't be handled in all backends. Instead we duplicate
Christoph Mallon's avatar
Christoph Mallon committed
278
		 * the node and move it to its users */
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
		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;
		}
305
#endif
Christoph Mallon's avatar
Christoph Mallon committed
306

Matthias Braun's avatar
Matthias Braun committed
307
		copy = copy_and_fix_node(env, block, copy_block, j, node);
308
309

		/* we might hit values in blocks that have already been processed by a
310
		 * recursive find_phi_with_const() call */
311
312
313
314
315
316
317
		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
318

319
320
321
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
322
		ir_node *copy_node;
323
324
325
326
327
328
329
		ir_mode *mode;

		if (is_Block(node)) {
			/* Block->Block edge, should be the MacroBlock edge */
			assert(get_Block_MacroBlock(node) == block && "Block->Block edge found");
			continue;
		}
330

331
		mode = get_irn_mode(node);
332
		if (mode == mode_X || is_Cond(node))
333
			continue;
334
#ifdef AVOID_PHIB
335
		if (mode == mode_b)
336
			continue;
337
#endif
338

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

341
342
		copy_node = get_irn_link(node);
		construct_ssa(block, node, copy_block, copy_node);
343
344
345
	}
}

346
/**
Michael Beck's avatar
Michael Beck committed
347
 * returns whether the cmp evaluates to true or false, or can't be evaluated!
348
 * 1: true, 0: false, -1: can't evaluate
349
350
351
352
 *
 * @param pnc       the compare mode of the Compare
 * @param tv_left   the left tarval
 * @param tv_right  the right tarval
353
 */
354
355
static int eval_cmp_tv(pn_Cmp pnc, tarval *tv_left, tarval *tv_right) {
	pn_Cmp cmp_result = tarval_cmp(tv_left, tv_right);
356

357
358
	/* does the compare evaluate to true? */
	if (cmp_result == pn_Cmp_False)
359
		return -1;
360
	if ((cmp_result & pnc) != cmp_result)
361
362
363
364
365
		return 0;

	return 1;
}

366
/**
367
368
369
370
371
 * returns whether the cmp evaluates to true or false, or can't be evaluated!
 * 1: true, 0: false, -1: can't evaluate
 *
 * @param env      the environment
 * @param cand     the candidate node, either a Const or a Confirm
372
 */
373
374
375
376
377
378
379
380
381
382
383
384
static int eval_cmp(condeval_env_t *env, ir_node *cand) {
	if (is_Const(cand)) {
		tarval *tv_cand   = get_Const_tarval(cand);
		tarval *tv_cmp    = get_Const_tarval(env->cnst);

		return eval_cmp_tv(env->pnc, tv_cand, tv_cmp);
	} else { /* a Confirm */
		tarval *res = computed_value_Cmp_Confirm(env->cmp, cand, env->cnst, env->pnc);

		if (res == tarval_bad)
			return -1;
		return res == tarval_b_true;
385
	}
386
387
388
389
390
391
392
393
}

/**
 * Check for Const or Confirm with Const.
 */
static int is_Const_or_Confirm(const ir_node *node) {
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
394
395
396
397
	return is_Const(node);
}

/**
398
 * get the tarval of a Const or Confirm with
399
400
401
 */
static tarval *get_Const_or_Confirm_tarval(const ir_node *node) {
	if (is_Confirm(node)) {
402
		if (get_Confirm_bound(node))
403
404
405
406
407
			node = get_Confirm_bound(node);
	}
	return get_Const_tarval(node);
}

408
static ir_node *find_const_or_confirm(condeval_env_t *env, ir_node *jump, ir_node *value)
409
{
410
411
	ir_node *block = get_nodes_block(jump);

412
	if (irn_visited(value))
413
414
415
		return NULL;
	mark_irn_visited(value);

416
417
	if (is_Const_or_Confirm(value)) {
		if (eval_cmp(env, value) <= 0) {
418
			return NULL;
419
		}
Christoph Mallon's avatar
Christoph Mallon committed
420
421
422

		DB((
			dbg, LEVEL_1,
423
424
			"> Found condition evaluation candidate %+F->%+F\n",
			env->true_block, block
Christoph Mallon's avatar
Christoph Mallon committed
425
426
		));

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

430
		split_critical_edge(env->true_block, 0);
431

432
		/* we need a bigger visited nr when going back */
433
		env->visited_nr++;
434

435
436
		return block;
	}
437

438
439
	if(is_Phi(value)) {
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
440

441
		/* the Phi has to be in the same Block as the Jmp */
442
		if(get_nodes_block(value) != block) {
443
			return NULL;
444
		}
445

446
447
448
449
		arity = get_irn_arity(value);
		for(i = 0; i < arity; ++i) {
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
450
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
451

452
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
453
			if(copy_block == NULL)
454
455
				continue;

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

459
460
			if(copy_block == get_nodes_block(cfgpred)) {
				env->cnst_pred = block;
461
				env->cnst_pos  = i;
462
			}
463

464
			/* return now as we can't process more possibilities in 1 run */
465
			return copy_block;
466
		}
Christoph Mallon's avatar
Christoph Mallon committed
467
	}
468

469
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
470
471
}

472
473
static ir_node *find_candidate(condeval_env_t *env, ir_node *jump,
                               ir_node *value)
474
{
475
476
477
478
	ir_node *block = get_nodes_block(jump);

	if(irn_visited(value)) {
		return NULL;
479
	}
480
481
	mark_irn_visited(value);

482
	if (is_Const_or_Confirm(value)) {
483
		tarval *tv = get_Const_or_Confirm_tarval(value);
484

485
		if (tv != env->tv)
486
487
488
489
490
491
492
493
			return NULL;

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

494
		/* adjust true_block to point directly towards our jump */
495
496
497
		add_pred(env->true_block, jump);

		split_critical_edge(env->true_block, 0);
498

499
		/* we need a bigger visited nr when going back */
500
		env->visited_nr++;
501

502
		return block;
503
	}
504
505
	if(is_Phi(value)) {
		int i, arity;
506

507
		/* the Phi has to be in the same Block as the Jmp */
508
509
		if(get_nodes_block(value) != block)
			return NULL;
510

511
512
513
514
515
		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);
516

517
518
519
520
521
522
523
524
525
526
527
528
			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;
			}

529
			/* return now as we can't process more possibilities in 1 run */
530
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
531
		}
532
533
534
535
536
537
538
539
	}
	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;
540

541
542
543
		left  = get_Cmp_left(cmp);
		right = get_Cmp_right(cmp);
		pnc   = get_Proj_proj(value);
544

545
546
547
548
549
550
		/* 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;
551

552
553
			pnc        = get_inversed_pnc(pnc);
		}
554

555
		if(!is_Const(right))
556
			return 0;
557

558
559
560
		if(get_nodes_block(left) != block) {
			return 0;
		}
561

562
		/* negate condition when we're looking for the false block */
563
		if(env->tv == tarval_b_false) {
564
			pnc = get_negated_pnc(pnc, get_irn_mode(right));
565
		}
566

567
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
568
		env->cmp  = cmp;
569
570
571
		env->pnc  = pnc;
		env->cnst = right;

572
		return find_const_or_confirm(env, jump, left);
573
	}
574

575
576
	return NULL;
}
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592

/**
 * 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)
{
593
	condeval_env_t env;
594
	int *changed = data;
595
	ir_node *selector;
596
597
	ir_node *projx;
	ir_node *cond;
598
	ir_node *copy_block;
599
	int      selector_evaluated;
600
601
602
	const ir_edge_t *edge, *next;
	ir_node* bad;
	size_t   cnst_pos;
603
604
605
606
607
608
609
610
611
612
613
614
615

	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;

616
	selector = get_Cond_selector(cond);
617
	/* TODO handle switch Conds */
618
	if (get_irn_mode(selector) != mode_b)
619
		return;
620

Michael Beck's avatar
Michael Beck committed
621
	/* handle cases that can be immediately evaluated */
622
623
624
625
626
627
628
629
630
631
632
	selector_evaluated = -1;
	if(is_Proj(selector)) {
		ir_node *cmp = get_Proj_pred(selector);
		if(is_Cmp(cmp)) {
			ir_node *left  = get_Cmp_left(cmp);
			ir_node *right = get_Cmp_right(cmp);
			if(is_Const(left) && is_Const(right)) {
				int     pnc      = get_Proj_proj(selector);
				tarval *tv_left  = get_Const_tarval(left);
				tarval *tv_right = get_Const_tarval(right);

633
				selector_evaluated = eval_cmp_tv(pnc, tv_left, tv_right);
634
635
				if(selector_evaluated < 0)
					return;
636
637
			}
		}
638
	} else if (is_Const_or_Confirm(selector)) {
639
		tarval *tv = get_Const_or_Confirm_tarval(selector);
640
		if(tv == tarval_b_true) {
641
642
			selector_evaluated = 1;
		} else {
643
			assert(tv == tarval_b_false);
644
645
646
647
648
			selector_evaluated = 0;
		}
	}

	env.cnst_pred = NULL;
649
	if (get_Proj_proj(projx) == pn_Cond_false) {
650
		env.tv = tarval_b_false;
651
652
		if(selector_evaluated >= 0)
			selector_evaluated = !selector_evaluated;
653
	} else {
654
		env.tv = tarval_b_true;
655
656
	}

657
658
659
660
661
662
663
664
665
666
667
668
669
	if(selector_evaluated == 0) {
		bad = new_Bad();
		exchange(projx, bad);
		*changed = 1;
		return;
	} else if(selector_evaluated == 1) {
		dbg_info *dbgi = get_irn_dbg_info(selector);
		ir_node  *jmp  = new_rd_Jmp(dbgi, current_ir_graph, get_nodes_block(projx));
		exchange(projx, jmp);
		*changed = 1;
		return;
	}

670
	/* (recursively) look if a pred of a Phi is a constant or a Confirm */
671
672
673
674
675
676
	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)
677
678
		return;

679
	/* we have to remove the edge towards the pred as the pred now
680
	 * jumps into the true_block. We also have to shorten Phis
681
682
683
684
	 * in our block because of this */
	bad      = new_Bad();
	cnst_pos = env.cnst_pos;

685
	/* shorten Phis */
686
687
688
689
690
691
692
693
694
695
696
	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;
697
698
699
700
}

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

703
704
705
706
	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
707
	remove_critical_cf_edges(irg);
708
	normalize_proj_nodes(irg);
709

Michael Beck's avatar
Michael Beck committed
710
	edges_assure(irg);
711
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
712

Michael Beck's avatar
Michael Beck committed
713
	changed = 0;
714
	do {
Michael Beck's avatar
Michael Beck committed
715
716
717
718
719
		rerun = 0;
		irg_block_walk_graph(irg, cond_eval, NULL, &rerun);
		changed |= rerun;
	} while (rerun);

720
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
721

Michael Beck's avatar
Michael Beck committed
722
723
	if (changed) {
		/* control flow changed, some blocks may become dead */
724
		set_irg_outs_inconsistent(irg);
Michael Beck's avatar
Michael Beck committed
725
726
727
		set_irg_doms_inconsistent(irg);
		set_irg_extblk_inconsistent(irg);
		set_irg_loopinfo_inconsistent(irg);
728
729
730
731

		/* Dead code might be created. Optimize it away as it is dangerous
		 * to call optimize_df() an dead code. */
		optimize_cf(irg);
Michael Beck's avatar
Michael Beck committed
732
	}
733
}