jumpthreading.c 19.2 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
/**
 * @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 "opt_confirms.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
84
	int i;
	int n_cfgpreds;
	ir_graph *irg;
	ir_node *phi;
	ir_node **in;

85
	/* This is needed because we create bads sometimes */
86
87
88
89
	if (is_Bad(block)) {
		ir_graph *irg = get_irn_irg(block);
		return new_r_Bad(irg);
	}
90

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

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

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

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

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

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

125
	phi = new_r_Phi(block, n_cfgpreds, in, mode);
126
127
128
	set_irn_link(block, phi);
	mark_irn_visited(block);

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

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

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

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

157
	irg = get_irn_irg(orig_val);
158
159
	inc_irg_visited(irg);

160
161
162
	mode = get_irn_mode(orig_val);
	set_irn_link(orig_block, orig_val);
	mark_irn_visited(orig_block);
163

164
165
	ssa_second_def_block = second_block;
	ssa_second_def       = second_val;
166

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

174
175
		/* ignore keeps */
		if (is_End(user))
176
			continue;
177
178
179

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

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

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

195
196
static void split_critical_edge(ir_node *block, int pos)
{
197
198
199
200
	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
201

202
203
	in[0] = get_Block_cfgpred(block, pos);
	new_block = new_r_Block(irg, 1, in);
204
	new_jmp = new_r_Jmp(new_block);
205
	set_Block_cfgpred(block, pos, new_jmp);
Christoph Mallon's avatar
Christoph Mallon committed
206
207
}

208
typedef struct jumpthreading_env_t {
209
	ir_node       *true_block;
210
	ir_node       *cmp;        /**< The Compare node that might be partial evaluated */
211
	pn_Cmp         pnc;        /**< The Compare mode of the Compare node. */
212
213
	ir_node       *cnst;
	tarval        *tv;
214
	ir_visited_t   visited_nr;
215
216
217
218

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

221
222
223
224
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
225
226
227
228
229
230
	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);
231
		/* we might have to evaluate a Phi-cascade */
232
		if (get_irn_visited(copy) >= env->visited_nr) {
Matthias Braun's avatar
Matthias Braun committed
233
234
235
236
237
238
239
240
241
			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);
242
		for (i = 0; i < arity; ++i) {
Matthias Braun's avatar
Matthias Braun committed
243
244
245
			ir_node *pred     = get_irn_n(copy, i);
			ir_node *new_pred;

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

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

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

	return copy;
}

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

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

300
				if (user_block == block)
301
302
303
304
					continue;

				cmp_copy = exact_copy(pred);
				set_nodes_block(cmp_copy, user_block);
305
				copy = new_r_Proj(cmp_copy, mode_b, pn);
306
307
308
309
				set_irn_n(user, pos, copy);
			}
			continue;
		}
310
#endif
Christoph Mallon's avatar
Christoph Mallon committed
311

Matthias Braun's avatar
Matthias Braun committed
312
		copy = copy_and_fix_node(env, block, copy_block, j, node);
313
314

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

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

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

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

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

345
/**
Michael Beck's avatar
Michael Beck committed
346
 * returns whether the cmp evaluates to true or false, or can't be evaluated!
347
 * 1: true, 0: false, -1: can't evaluate
348
349
350
351
 *
 * @param pnc       the compare mode of the Compare
 * @param tv_left   the left tarval
 * @param tv_right  the right tarval
352
 */
353
354
static int eval_cmp_tv(pn_Cmp pnc, tarval *tv_left, tarval *tv_right)
{
355
	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
372
373
374
375
376
377
378
/**
 * 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
 *
 * @param pnc       the compare mode of the Compare
 * @param left   the left node
 * @param right  the right node
 */
static int eval_cmp_vrp(pn_Cmp pnc, ir_node *left, ir_node *right)
{
	pn_Cmp cmp_result = vrp_cmp(left, right);
	/* does the compare evaluate to true? */
379
	if (cmp_result == pn_Cmp_False) {
380
		return -1;
381
382
383
384
385
	}
	if ((cmp_result & pnc) != cmp_result) {
		if ((cmp_result & pnc) != 0) {
			return -1;
		}
386
		return 0;
387
	}
388
389
	return 1;
}
390
/**
391
392
393
394
395
 * 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
396
 */
397
398
static int eval_cmp(jumpthreading_env_t *env, ir_node *cand)
{
399
400
401
402
403
404
405
406
407
408
409
	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;
410
	}
411
412
413
414
415
}

/**
 * Check for Const or Confirm with Const.
 */
416
417
static int is_Const_or_Confirm(const ir_node *node)
{
418
419
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
420
421
422
423
	return is_Const(node);
}

/**
424
 * get the tarval of a Const or Confirm with
425
 */
426
427
static tarval *get_Const_or_Confirm_tarval(const ir_node *node)
{
428
	if (is_Confirm(node)) {
429
		if (get_Confirm_bound(node))
430
431
432
433
434
			node = get_Confirm_bound(node);
	}
	return get_Const_tarval(node);
}

435
436
static ir_node *find_const_or_confirm(jumpthreading_env_t *env, ir_node *jump,
                                      ir_node *value)
437
{
438
439
	ir_node *block = get_nodes_block(jump);

440
	if (irn_visited_else_mark(value))
441
442
		return NULL;

443
444
	if (is_Const_or_Confirm(value)) {
		if (eval_cmp(env, value) <= 0) {
445
			return NULL;
446
		}
Christoph Mallon's avatar
Christoph Mallon committed
447
448
449

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
450
			"> Found jump threading candidate %+F->%+F\n",
451
			env->true_block, block
Christoph Mallon's avatar
Christoph Mallon committed
452
453
		));

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

457
		split_critical_edge(env->true_block, 0);
458

459
		/* we need a bigger visited nr when going back */
460
		env->visited_nr++;
461

462
463
		return block;
	}
464

465
	if (is_Phi(value)) {
466
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
467

468
		/* the Phi has to be in the same Block as the Jmp */
469
		if (get_nodes_block(value) != block) {
470
			return NULL;
471
		}
472

473
		arity = get_irn_arity(value);
474
		for (i = 0; i < arity; ++i) {
475
476
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
477
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
478

479
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
480
			if (copy_block == NULL)
481
482
				continue;

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

486
			if (copy_block == get_nodes_block(cfgpred)) {
487
				env->cnst_pred = block;
488
				env->cnst_pos  = i;
489
			}
490

491
			/* return now as we can't process more possibilities in 1 run */
492
			return copy_block;
493
		}
Christoph Mallon's avatar
Christoph Mallon committed
494
	}
495

496
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
497
498
}

499
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
500
                               ir_node *value)
501
{
502
503
	ir_node *block = get_nodes_block(jump);

504
	if (irn_visited_else_mark(value)) {
505
		return NULL;
506
	}
507

508
	if (is_Const_or_Confirm(value)) {
509
		tarval *tv = get_Const_or_Confirm_tarval(value);
510

511
		if (tv != env->tv)
512
513
514
515
			return NULL;

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
516
			"> Found jump threading candidate %+F->%+F\n",
517
518
519
			env->true_block, block
		));

520
		/* adjust true_block to point directly towards our jump */
521
522
523
		add_pred(env->true_block, jump);

		split_critical_edge(env->true_block, 0);
524

525
		/* we need a bigger visited nr when going back */
526
		env->visited_nr++;
527

528
		return block;
529
	}
530
	if (is_Phi(value)) {
531
		int i, arity;
532

533
		/* the Phi has to be in the same Block as the Jmp */
534
		if (get_nodes_block(value) != block)
535
			return NULL;
536

537
		arity = get_irn_arity(value);
538
		for (i = 0; i < arity; ++i) {
539
540
541
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
542

543
			copy_block = find_candidate(env, cfgpred, phi_pred);
544
			if (copy_block == NULL)
545
546
547
548
549
				continue;

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

550
			if (copy_block == get_nodes_block(cfgpred)) {
551
552
553
554
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

555
			/* return now as we can't process more possibilities in 1 run */
556
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
557
		}
558
	}
559
	if (is_Proj(value)) {
560
561
562
563
		ir_node *left;
		ir_node *right;
		int      pnc;
		ir_node *cmp = get_Proj_pred(value);
564
		if (!is_Cmp(cmp))
565
			return NULL;
566

567
568
569
		left  = get_Cmp_left(cmp);
		right = get_Cmp_right(cmp);
		pnc   = get_Proj_proj(value);
570

571
572
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
573
		if (is_Const(left)) {
574
575
576
			ir_node *t = left;
			left       = right;
			right      = t;
577

578
579
			pnc        = get_inversed_pnc(pnc);
		}
580

581
		if (!is_Const(right))
582
			return 0;
583

584
		if (get_nodes_block(left) != block) {
585
586
			return 0;
		}
587

588
		/* negate condition when we're looking for the false block */
589
		if (env->tv == tarval_b_false) {
590
			pnc = get_negated_pnc(pnc, get_irn_mode(right));
591
		}
592

593
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
594
		env->cmp  = cmp;
595
596
597
		env->pnc  = pnc;
		env->cnst = right;

598
		return find_const_or_confirm(env, jump, left);
599
	}
600

601
602
	return NULL;
}
603
604
605
606
607
608
609
610
611
612
613
614
615
616

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
617
static void thread_jumps(ir_node* block, void* data)
618
{
619
	jumpthreading_env_t env;
620
	int *changed = data;
621
	ir_node *selector;
622
623
	ir_node *projx;
	ir_node *cond;
624
	ir_node *copy_block;
625
	int      selector_evaluated;
626
	const ir_edge_t *edge, *next;
627
	ir_graph *irg;
628
	ir_node *bad;
629
	size_t   cnst_pos;
630

631
	if (get_Block_n_cfgpreds(block) != 1)
632
633
634
635
636
637
638
639
640
641
642
		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;

643
	selector = get_Cond_selector(cond);
644
	/* TODO handle switch Conds */
645
	if (get_irn_mode(selector) != mode_b)
646
		return;
647

Michael Beck's avatar
Michael Beck committed
648
	/* handle cases that can be immediately evaluated */
649
	selector_evaluated = -1;
650
	if (is_Proj(selector)) {
651
		ir_node *cmp = get_Proj_pred(selector);
652
		if (is_Cmp(cmp)) {
653
654
			ir_node *left  = get_Cmp_left(cmp);
			ir_node *right = get_Cmp_right(cmp);
655
			if (is_Const(left) && is_Const(right)) {
656
657
658
659
				int     pnc      = get_Proj_proj(selector);
				tarval *tv_left  = get_Const_tarval(left);
				tarval *tv_right = get_Const_tarval(right);

660
				selector_evaluated = eval_cmp_tv(pnc, tv_left, tv_right);
661
662
663
664
665
666
667
668
669
			}
			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.
				 */
				int pnc = get_Proj_proj(selector);

				selector_evaluated = eval_cmp_vrp(pnc, left, right);
670
671
			}
		}
672
	} else if (is_Const_or_Confirm(selector)) {
673
		tarval *tv = get_Const_or_Confirm_tarval(selector);
674
		if (tv == tarval_b_true) {
675
676
			selector_evaluated = 1;
		} else {
677
			assert(tv == tarval_b_false);
678
679
680
681
682
			selector_evaluated = 0;
		}
	}

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

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

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

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
714
715
		return;

716
	/* we have to remove the edge towards the pred as the pred now
717
	 * jumps into the true_block. We also have to shorten Phis
718
	 * in our block because of this */
719
	bad      = new_r_Bad(irg);
720
721
	cnst_pos = env.cnst_pos;

722
	/* shorten Phis */
723
724
725
	foreach_out_edge_safe(env.cnst_pred, edge, next) {
		ir_node *node = get_edge_src_irn(edge);

726
		if (is_Phi(node))
727
728
729
730
731
732
733
			set_Phi_pred(node, cnst_pos, bad);
	}

	set_Block_cfgpred(env.cnst_pred, cnst_pos, bad);

	/* the graph is changed now */
	*changed = 1;
734
735
}

736
void opt_jumpthreading(ir_graph* irg)
737
{
Michael Beck's avatar
Michael Beck committed
738
	int changed, rerun;
739

740
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
741

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

Christoph Mallon's avatar
Christoph Mallon committed
744
	remove_critical_cf_edges(irg);
745

Michael Beck's avatar
Michael Beck committed
746
	edges_assure(irg);
747
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
748

Michael Beck's avatar
Michael Beck committed
749
	changed = 0;
750
	do {
Michael Beck's avatar
Michael Beck committed
751
		rerun = 0;
752
		irg_block_walk_graph(irg, thread_jumps, NULL, &rerun);
Michael Beck's avatar
Michael Beck committed
753
754
755
		changed |= rerun;
	} while (rerun);

756
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
757

Michael Beck's avatar
Michael Beck committed
758
759
	if (changed) {
		/* control flow changed, some blocks may become dead */
760
		set_irg_outs_inconsistent(irg);
Michael Beck's avatar
Michael Beck committed
761
762
763
		set_irg_doms_inconsistent(irg);
		set_irg_extblk_inconsistent(irg);
		set_irg_loopinfo_inconsistent(irg);
764
		set_irg_entity_usage_state(irg, ir_entity_usage_not_computed);
765
766
767
768

		/* 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
769
	}
770
}
771
772

/* Creates an ir_graph pass for opt_jumpthreading. */
773
ir_graph_pass_t *opt_jumpthreading_pass(const char *name)
774
{
775
	return def_graph_pass(name ? name : "jumpthreading", opt_jumpthreading);
776
}  /* opt_jumpthreading_pass */