jumpthreading.c 19.7 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
/*
2
 * Copyright (C) 1995-2010 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
/**
 * @file
22
 * @brief   Path-Sensitive Jump Threading
Michael Beck's avatar
Michael Beck committed
23
24
25
 * @date    10. Sep. 2006
 * @author  Christoph Mallon, Matthias Braun
 * @version $Id$
26
 */
27
28
#include "config.h"

29
30
#include "iroptimize.h"

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

50
#undef AVOID_PHIB
51

52
53
DEBUG_ONLY(static firm_dbg_module_t *dbg);

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

73
74
75
76
77
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
78
{
79
80
81
82
83
	int i;
	int n_cfgpreds;
	ir_graph *irg;
	ir_node *phi;
	ir_node **in;
84
	ir_node *dummy;
85

86
87
	/* In case of a bad input to a block we need to return the bad value */
	if (is_Bad(block)) {
88
		ir_graph *irg = get_irn_irg(block);
Matthias Braun's avatar
Matthias Braun committed
89
		return new_r_Bad(irg, mode);
90
	}
91

92
93
94
	/* 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.
Michael Beck's avatar
Michael Beck committed
95
	 * So we keep a flag that indicated whether we walked at least 1 block
96
97
98
99
100
	 * away and may use the alternative definition */
	if (block == ssa_second_def_block && !first) {
		return ssa_second_def;
	}

101
	/* already processed this block? */
102
	if (irn_visited(block)) {
103
104
105
106
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

Matthias Braun's avatar
Matthias Braun committed
107
108
109
	irg = get_irn_irg(block);
	assert(block != get_irg_start_block(irg));

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

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

121
	/* create a new Phi */
Christoph Mallon's avatar
Christoph Mallon committed
122
	NEW_ARR_A(ir_node*, in, n_cfgpreds);
123
	dummy = new_r_Dummy(irg, mode);
124
	for (i = 0; i < n_cfgpreds; ++i)
125
		in[i] = dummy;
126

127
	phi = new_r_Phi(block, n_cfgpreds, in, mode);
128
129
130
	set_irn_link(block, phi);
	mark_irn_visited(block);

131
	/* set Phi predecessors */
132
	for (i = 0; i < n_cfgpreds; ++i) {
133
		ir_node *pred_block = get_Block_cfgpred_block(block, i);
134
		ir_node *pred_val   = search_def_and_create_phis(pred_block, mode, 0);
135
136
137
138
139
140
141
142

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

/**
143
144
145
 * 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.
146
 */
147
148
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
149
{
150
151
	ir_graph *irg;
	ir_mode *mode;
152
153
	const ir_edge_t *edge;
	const ir_edge_t *next;
154

155
156
157
158
	/* no need to do anything */
	if (orig_val == second_val)
		return;

159
	irg = get_irn_irg(orig_val);
160
161
	inc_irg_visited(irg);

162
163
164
	mode = get_irn_mode(orig_val);
	set_irn_link(orig_block, orig_val);
	mark_irn_visited(orig_block);
165

166
167
	ssa_second_def_block = second_block;
	ssa_second_def       = second_val;
168

169
	/* Only fix the users of the first, i.e. the original node */
170
	foreach_out_edge_safe(orig_val, edge, next) {
171
172
173
174
		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;
175

176
177
		/* ignore keeps */
		if (is_End(user))
178
			continue;
179
180
181

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

182
		if (is_Phi(user)) {
183
			ir_node *pred_block = get_Block_cfgpred_block(user_block, j);
184
			newval = search_def_and_create_phis(pred_block, mode, 1);
185
		} else {
186
			newval = search_def_and_create_phis(user_block, mode, 1);
187
188
		}

189
		/* don't fix newly created Phis from the SSA construction */
190
191
192
		if (newval != user) {
			DB((dbg, LEVEL_4, ">>>> Setting input %d of %+F to %+F\n", j, user, newval));
			set_irn_n(user, j, newval);
193
194
195
196
		}
	}
}

197
198
199
200
201
202
203
204
205
206
207
208
209
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;

	in[0] = get_Block_cfgpred(block, pos);
	new_block = new_r_Block(irg, 1, in);
	new_jmp = new_r_Jmp(new_block);
	set_Block_cfgpred(block, pos, new_jmp);
}

210
typedef struct jumpthreading_env_t {
211
	ir_node       *true_block;
212
	ir_node       *cmp;        /**< The Compare node that might be partial evaluated */
213
	ir_relation    relation;   /**< The Compare mode of the Compare node. */
214
	ir_node       *cnst;
Matthias Braun's avatar
Matthias Braun committed
215
	ir_tarval     *tv;
216
	ir_visited_t   visited_nr;
217
218
219
220

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

223
224
225
226
static ir_node *copy_and_fix_node(const jumpthreading_env_t *env,
                                  ir_node *block, ir_node *copy_block, int j,
                                  ir_node *node)
{
Matthias Braun's avatar
Matthias Braun committed
227
228
229
230
231
232
	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);
233
		/* we might have to evaluate a Phi-cascade */
234
		if (get_irn_visited(copy) >= env->visited_nr) {
235
			copy = (ir_node*)get_irn_link(copy);
Matthias Braun's avatar
Matthias Braun committed
236
237
238
239
240
241
242
243
		}
	} else {
		copy = exact_copy(node);
		set_nodes_block(copy, copy_block);

		assert(get_irn_mode(copy) != mode_X);

		arity = get_irn_arity(copy);
244
		for (i = 0; i < arity; ++i) {
Matthias Braun's avatar
Matthias Braun committed
245
246
247
			ir_node *pred     = get_irn_n(copy, i);
			ir_node *new_pred;

248
			if (get_nodes_block(pred) != block)
Matthias Braun's avatar
Matthias Braun committed
249
250
				continue;

251
			if (get_irn_visited(pred) >= env->visited_nr) {
252
				new_pred = (ir_node*)get_irn_link(pred);
Matthias Braun's avatar
Matthias Braun committed
253
254
255
			} else {
				new_pred = copy_and_fix_node(env, block, copy_block, j, pred);
			}
256
			DB((dbg, LEVEL_2, ">> Set Pred of %+F to %+F\n", copy, new_pred));
Matthias Braun's avatar
Matthias Braun committed
257
258
259
260
261
262
263
264
265
266
			set_irn_n(copy, i, new_pred);
		}
	}

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

	return copy;
}

267
268
269
static void copy_and_fix(const jumpthreading_env_t *env, ir_node *block,
                         ir_node *copy_block, int j)
{
270
271
272
273
274
275
	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;
276
277
		ir_mode *mode;

Andreas Zwinkau's avatar
Andreas Zwinkau committed
278
279
280
281
282
283
284
		if (is_End(node)) {
			/* edge is a Keep edge. If the end block is unreachable via normal control flow,
			 * we must maintain end's reachability with Keeps.
			 */
			keep_alive(copy_block);
			continue;
		}
285
		/* ignore control flow */
286
		mode = get_irn_mode(node);
287
		if (mode == mode_X || is_Cond(node))
288
			continue;
289
#ifdef AVOID_PHIB
290
		/* we may not copy mode_b nodes, because this could produce Phi with
291
		 * mode_bs which can't be handled in all backends. Instead we duplicate
Christoph Mallon's avatar
Christoph Mallon committed
292
		 * the node and move it to its users */
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
		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);

309
				if (user_block == block)
310
311
312
313
					continue;

				cmp_copy = exact_copy(pred);
				set_nodes_block(cmp_copy, user_block);
314
				copy = new_r_Proj(cmp_copy, mode_b, pn);
315
316
317
318
				set_irn_n(user, pos, copy);
			}
			continue;
		}
319
#endif
Christoph Mallon's avatar
Christoph Mallon committed
320

Matthias Braun's avatar
Matthias Braun committed
321
		copy = copy_and_fix_node(env, block, copy_block, j, node);
322
323

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

333
334
335
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
336
		ir_node *copy_node;
337
338
339
		ir_mode *mode;

		mode = get_irn_mode(node);
340
		if (mode == mode_X || is_Cond(node))
341
			continue;
342
#ifdef AVOID_PHIB
343
		if (mode == mode_b)
344
			continue;
345
#endif
346

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

349
		copy_node = (ir_node*)get_irn_link(node);
350
		construct_ssa(block, node, copy_block, copy_node);
351
352
353
	}
}

354
/**
Michael Beck's avatar
Michael Beck committed
355
 * returns whether the cmp evaluates to true or false, or can't be evaluated!
356
 * 1: true, 0: false, -1: can't evaluate
357
 *
358
 * @param relation  the compare mode of the Compare
359
360
 * @param tv_left   the left tarval
 * @param tv_right  the right tarval
361
 */
362
363
static int eval_cmp_tv(ir_relation relation, ir_tarval *tv_left,
                       ir_tarval *tv_right)
364
{
365
	ir_relation cmp_result = tarval_cmp(tv_left, tv_right);
366

367
	/* does the compare evaluate to true? */
368
	if (cmp_result == ir_relation_false)
369
		return -1;
370
371
	if ((cmp_result & relation) != 0)
		return 1;
372

373
	return 0;
374
375
}

376
377
378
#if 0
/* Matze: disabled, check first if the compare still is correct */

379
380
381
382
383
/**
 * returns whether the cmp evaluates to true or false according to vrp
 * information , or can't be evaluated!
 * 1: true, 0: false, -1: can't evaluate
 *
384
385
386
 * @param relation  the compare mode of the Compare
 * @param left      the left node
 * @param right     the right node
387
 */
388
static int eval_cmp_vrp(ir_relation relation, ir_node *left, ir_node *right)
389
{
390
	ir_relation cmp_result = vrp_cmp(left, right);
391
	/* does the compare evaluate to true? */
392
	if (cmp_result == ir_relation_false)
393
		return -1;
394
395
396

	if ((cmp_result & relation) != cmp_result) {
		if ((cmp_result & relation) != 0) {
397
398
			return -1;
		}
399
		return 0;
400
	}
401
402
	return 1;
}
403
404
#endif

405
/**
406
407
408
409
410
 * 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
411
 */
412
413
static int eval_cmp(jumpthreading_env_t *env, ir_node *cand)
{
414
	if (is_Const(cand)) {
415
416
		ir_tarval *tv_cand = get_Const_tarval(cand);
		ir_tarval *tv_cmp  = get_Const_tarval(env->cnst);
417

418
		return eval_cmp_tv(env->relation, tv_cand, tv_cmp);
419
	} else { /* a Confirm */
420
		ir_tarval *res = computed_value_Cmp_Confirm(env->cmp, cand, env->cnst, env->relation);
421
422
423
424

		if (res == tarval_bad)
			return -1;
		return res == tarval_b_true;
425
	}
426
427
428
429
430
}

/**
 * Check for Const or Confirm with Const.
 */
431
432
static int is_Const_or_Confirm(const ir_node *node)
{
433
434
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
435
436
437
438
	return is_Const(node);
}

/**
439
 * get the tarval of a Const or Confirm with
440
 */
Matthias Braun's avatar
Matthias Braun committed
441
static ir_tarval *get_Const_or_Confirm_tarval(const ir_node *node)
442
{
443
	if (is_Confirm(node)) {
444
		if (get_Confirm_bound(node))
445
446
447
448
449
			node = get_Confirm_bound(node);
	}
	return get_Const_tarval(node);
}

450
451
static ir_node *find_const_or_confirm(jumpthreading_env_t *env, ir_node *jump,
                                      ir_node *value)
452
{
453
454
	ir_node *block = get_nodes_block(jump);

455
	if (irn_visited_else_mark(value))
456
457
		return NULL;

458
	if (is_Const_or_Confirm(value)) {
459
		if (eval_cmp(env, value) <= 0)
460
			return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
461
462
463

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
464
			"> Found jump threading candidate %+F->%+F\n",
465
			env->true_block, block
Christoph Mallon's avatar
Christoph Mallon committed
466
467
		));

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

471
472
		split_critical_edge(env->true_block, 0);

473
		/* we need a bigger visited nr when going back */
474
		env->visited_nr++;
475

476
477
		return block;
	}
478

479
	if (is_Phi(value)) {
480
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
481

482
		/* the Phi has to be in the same Block as the Jmp */
483
		if (get_nodes_block(value) != block)
484
			return NULL;
485

486
		arity = get_irn_arity(value);
487
		for (i = 0; i < arity; ++i) {
488
489
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
490
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
491

492
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
493
			if (copy_block == NULL)
494
495
				continue;

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

499
			if (copy_block == get_nodes_block(cfgpred)) {
500
				env->cnst_pred = block;
501
				env->cnst_pos  = i;
502
			}
503

504
			/* return now as we can't process more possibilities in 1 run */
505
			return copy_block;
506
		}
Christoph Mallon's avatar
Christoph Mallon committed
507
	}
508

509
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
510
511
}

512
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
513
                               ir_node *value)
514
{
515
516
	ir_node *block = get_nodes_block(jump);

517
	if (irn_visited_else_mark(value)) {
518
		return NULL;
519
	}
520

521
	if (is_Const_or_Confirm(value)) {
Matthias Braun's avatar
Matthias Braun committed
522
		ir_tarval *tv = get_Const_or_Confirm_tarval(value);
523

524
		if (tv != env->tv)
525
526
527
528
			return NULL;

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
529
			"> Found jump threading candidate %+F->%+F\n",
530
531
532
			env->true_block, block
		));

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

536
537
		split_critical_edge(env->true_block, 0);

538
		/* we need a bigger visited nr when going back */
539
		env->visited_nr++;
540

541
		return block;
542
	}
543
	if (is_Phi(value)) {
544
		int i, arity;
545

546
		/* the Phi has to be in the same Block as the Jmp */
547
		if (get_nodes_block(value) != block)
548
			return NULL;
549

550
		arity = get_irn_arity(value);
551
		for (i = 0; i < arity; ++i) {
552
553
554
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
555

556
			copy_block = find_candidate(env, cfgpred, phi_pred);
557
			if (copy_block == NULL)
558
559
560
561
562
				continue;

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

563
			if (copy_block == get_nodes_block(cfgpred)) {
564
565
566
567
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

568
			/* return now as we can't process more possibilities in 1 run */
569
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
570
		}
571
	}
572
573
574
575
576
	if (is_Cmp(value)) {
		ir_node    *cmp      = value;
		ir_node    *left     = get_Cmp_left(cmp);
		ir_node    *right    = get_Cmp_right(cmp);
		ir_relation relation = get_Cmp_relation(cmp);
577

578
579
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
580
		if (is_Const(left)) {
581
582
583
			ir_node *t = left;
			left       = right;
			right      = t;
584

585
			relation   = get_inversed_relation(relation);
586
		}
587

588
		if (!is_Const(right))
589
			return NULL;
590

591
592
		if (get_nodes_block(left) != block)
			return NULL;
593

594
		/* negate condition when we're looking for the false block */
595
		if (env->tv == tarval_b_false) {
596
			relation = get_negated_relation(relation);
597
		}
598

599
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
600
601
602
		env->cmp      = cmp;
		env->relation = relation;
		env->cnst     = right;
603

604
		return find_const_or_confirm(env, jump, left);
605
	}
606

607
608
	return NULL;
}
609
610
611
612
613
614
615
616
617
618
619
620
621
622

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
623
static void thread_jumps(ir_node* block, void* data)
624
{
625
	jumpthreading_env_t env;
626
	int *changed = (int*)data;
627
	ir_node *selector;
628
629
	ir_node *projx;
	ir_node *cond;
630
	ir_node *copy_block;
631
	int      selector_evaluated;
632
	const ir_edge_t *edge, *next;
633
	ir_graph *irg;
Matthias Braun's avatar
Matthias Braun committed
634
	ir_node *badX;
635
	int      cnst_pos;
636

637
	if (get_Block_n_cfgpreds(block) != 1)
638
639
640
641
642
643
644
645
646
647
648
		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;

649
	selector = get_Cond_selector(cond);
650
	/* TODO handle switch Conds */
651
	if (get_irn_mode(selector) != mode_b)
652
		return;
653

Michael Beck's avatar
Michael Beck committed
654
	/* handle cases that can be immediately evaluated */
655
	selector_evaluated = -1;
656
657
658
659
660
661
662
663
664
	if (is_Cmp(selector)) {
		ir_node *left  = get_Cmp_left(selector);
		ir_node *right = get_Cmp_right(selector);
		if (is_Const(left) && is_Const(right)) {
			ir_relation relation = get_Cmp_relation(selector);
			ir_tarval  *tv_left  = get_Const_tarval(left);
			ir_tarval  *tv_right = get_Const_tarval(right);

			selector_evaluated = eval_cmp_tv(relation, tv_left, tv_right);
665
		}
666
667
668
669
670
671
672
673
674
#if 0
		if (selector_evaluated < 0) {
			/* This is only the case if the predecessor nodes are not
			 * constant or the comparison could not be evaluated.
			 * Try with VRP information now.
			 */
			selector_evaluated = eval_cmp_vrp(relation, left, right);
		}
#endif
675
	} else if (is_Const_or_Confirm(selector)) {
Matthias Braun's avatar
Matthias Braun committed
676
		ir_tarval *tv = get_Const_or_Confirm_tarval(selector);
677
		if (tv == tarval_b_true) {
678
679
			selector_evaluated = 1;
		} else {
680
			assert(tv == tarval_b_false);
681
682
683
684
685
			selector_evaluated = 0;
		}
	}

	env.cnst_pred = NULL;
686
	if (get_Proj_proj(projx) == pn_Cond_false) {
687
		env.tv = tarval_b_false;
688
		if (selector_evaluated >= 0)
689
			selector_evaluated = !selector_evaluated;
690
	} else {
691
		env.tv = tarval_b_true;
692
693
	}

694
	if (selector_evaluated == 0) {
695
		ir_graph *irg = get_irn_irg(block);
Matthias Braun's avatar
Matthias Braun committed
696
		ir_node  *bad = new_r_Bad(irg, mode_X);
697
698
699
		exchange(projx, bad);
		*changed = 1;
		return;
700
	} else if (selector_evaluated == 1) {
701
		dbg_info *dbgi = get_irn_dbg_info(selector);
702
		ir_node  *jmp  = new_rd_Jmp(dbgi, get_nodes_block(projx));
yb9976's avatar
yb9976 committed
703
		DBG_OPT_JUMPTHREADING(projx, jmp);
704
705
706
707
708
		exchange(projx, jmp);
		*changed = 1;
		return;
	}

709
	/* (recursively) look if a pred of a Phi is a constant or a Confirm */
710
	env.true_block = block;
711
712
713
	irg = get_irn_irg(block);
	inc_irg_visited(irg);
	env.visited_nr = get_irg_visited(irg);
714
715
716

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
717
718
		return;

Andreas Zwinkau's avatar
Andreas Zwinkau committed
719
720
721
722
	/* We might thread the condition block of an infinite loop,
	 * such that there is no path to End anymore. */
	keep_alive(block);

723
	/* we have to remove the edge towards the pred as the pred now
724
	 * jumps into the true_block. We also have to shorten Phis
725
	 * in our block because of this */
Matthias Braun's avatar
Matthias Braun committed
726
	badX     = new_r_Bad(irg, mode_X);
727
728
	cnst_pos = env.cnst_pos;

729
	/* shorten Phis */
730
731
732
	foreach_out_edge_safe(env.cnst_pred, edge, next) {
		ir_node *node = get_edge_src_irn(edge);

Matthias Braun's avatar
Matthias Braun committed
733
734
		if (is_Phi(node)) {
			ir_node *bad = new_r_Bad(irg, get_irn_mode(node));
735
			set_Phi_pred(node, cnst_pos, bad);
Matthias Braun's avatar
Matthias Braun committed
736
		}
737
738
	}

Matthias Braun's avatar
Matthias Braun committed
739
	set_Block_cfgpred(env.cnst_pred, cnst_pos, badX);
740
741
742

	/* the graph is changed now */
	*changed = 1;
743
744
}

745
void opt_jumpthreading(ir_graph* irg)
746
{
Michael Beck's avatar
Michael Beck committed
747
	int changed, rerun;
748

749
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
750

751
	DB((dbg, LEVEL_1, "===> Performing jumpthreading on %+F\n", irg));
752

Christoph Mallon's avatar
Christoph Mallon committed
753
	remove_critical_cf_edges(irg);
754

Andreas Zwinkau's avatar
Andreas Zwinkau committed
755
756
757
758
	/* ugly: jump threading might get confused by garbage nodes
	 * of mode_X in copy_and_fix_node(), so remove all garbage edges. */
	edges_deactivate(irg);

Michael Beck's avatar
Michael Beck committed
759
	edges_assure(irg);
760
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
761

Michael Beck's avatar
Michael Beck committed
762
	changed = 0;
763
	do {
Michael Beck's avatar
Michael Beck committed
764
		rerun = 0;
765
		irg_block_walk_graph(irg, thread_jumps, NULL, &rerun);
Michael Beck's avatar
Michael Beck committed
766
767
768
		changed |= rerun;
	} while (rerun);

769
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
770

Michael Beck's avatar
Michael Beck committed
771
772
773
774
	if (changed) {
		/* control flow changed, some blocks may become dead */
		set_irg_doms_inconsistent(irg);
		set_irg_extblk_inconsistent(irg);
775
		set_irg_entity_usage_state(irg, ir_entity_usage_not_computed);
Michael Beck's avatar
Michael Beck committed
776
	}
777
}
778
779

/* Creates an ir_graph pass for opt_jumpthreading. */
780
ir_graph_pass_t *opt_jumpthreading_pass(const char *name)
781
{
782
	return def_graph_pass(name ? name : "jumpthreading", opt_jumpthreading);
783
}  /* opt_jumpthreading_pass */