jumpthreading.c 19.8 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
 * @date    10. Sep. 2006
 * @author  Christoph Mallon, Matthias Braun
25
 */
26
27
#include "config.h"

28
29
#include "iroptimize.h"

30
#include <assert.h>
31
#include <stdbool.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
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
53

Christoph Mallon's avatar
Christoph Mallon committed
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;

63
	assert(is_Block(node));
Christoph Mallon's avatar
Christoph Mallon committed
64
65
66

	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
/**
 * jumpthreading produces critical edges, e.g. B-C:
 *     A         A
 *  \ /       \  |
 *   B    =>   B |
 *  / \       / \|
 *     C         C
 *
 * By splitting this critical edge more threadings might be possible.
 */
207
208
209
210
211
212
213
214
215
216
217
218
219
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);
}

220
typedef struct jumpthreading_env_t {
221
	ir_node       *true_block;
222
	ir_node       *cmp;        /**< The Compare node that might be partial evaluated */
223
	ir_relation    relation;   /**< The Compare mode of the Compare node. */
224
	ir_node       *cnst;
Matthias Braun's avatar
Matthias Braun committed
225
	ir_tarval     *tv;
226
	ir_visited_t   visited_nr;
227
228
229
230

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

233
234
235
236
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
237
238
239
240
241
242
	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);
243
		/* we might have to evaluate a Phi-cascade */
244
		if (get_irn_visited(copy) >= env->visited_nr) {
245
			copy = (ir_node*)get_irn_link(copy);
Matthias Braun's avatar
Matthias Braun committed
246
247
248
249
250
251
252
253
		}
	} else {
		copy = exact_copy(node);
		set_nodes_block(copy, copy_block);

		assert(get_irn_mode(copy) != mode_X);

		arity = get_irn_arity(copy);
254
		for (i = 0; i < arity; ++i) {
Matthias Braun's avatar
Matthias Braun committed
255
256
257
			ir_node *pred     = get_irn_n(copy, i);
			ir_node *new_pred;

258
			if (get_nodes_block(pred) != block)
Matthias Braun's avatar
Matthias Braun committed
259
260
				continue;

261
			if (get_irn_visited(pred) >= env->visited_nr) {
262
				new_pred = (ir_node*)get_irn_link(pred);
Matthias Braun's avatar
Matthias Braun committed
263
264
265
			} else {
				new_pred = copy_and_fix_node(env, block, copy_block, j, pred);
			}
266
			DB((dbg, LEVEL_2, ">> Set Pred of %+F to %+F\n", copy, new_pred));
Matthias Braun's avatar
Matthias Braun committed
267
268
269
270
271
272
273
274
275
276
			set_irn_n(copy, i, new_pred);
		}
	}

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

	return copy;
}

277
278
279
static void copy_and_fix(const jumpthreading_env_t *env, ir_node *block,
                         ir_node *copy_block, int j)
{
280
281
282
283
284
285
	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;
286
287
		ir_mode *mode;

Andreas Zwinkau's avatar
Andreas Zwinkau committed
288
289
290
291
292
293
294
		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;
		}
295
		/* ignore control flow */
296
		mode = get_irn_mode(node);
Matthias Braun's avatar
Matthias Braun committed
297
		if (mode == mode_X || is_Cond(node) || is_Switch(node))
298
			continue;
299
#ifdef AVOID_PHIB
300
		/* we may not copy mode_b nodes, because this could produce Phi with
301
		 * mode_bs which can't be handled in all backends. Instead we duplicate
Christoph Mallon's avatar
Christoph Mallon committed
302
		 * the node and move it to its users */
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
		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);

319
				if (user_block == block)
320
321
322
323
					continue;

				cmp_copy = exact_copy(pred);
				set_nodes_block(cmp_copy, user_block);
324
				copy = new_r_Proj(cmp_copy, mode_b, pn);
325
326
327
328
				set_irn_n(user, pos, copy);
			}
			continue;
		}
329
#endif
Christoph Mallon's avatar
Christoph Mallon committed
330

Matthias Braun's avatar
Matthias Braun committed
331
		copy = copy_and_fix_node(env, block, copy_block, j, node);
332
333

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

343
344
345
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
346
		ir_node *copy_node;
347
348
349
		ir_mode *mode;

		mode = get_irn_mode(node);
Matthias Braun's avatar
Matthias Braun committed
350
		if (mode == mode_X || is_Cond(node) || is_Switch(node))
351
			continue;
352
#ifdef AVOID_PHIB
353
		if (mode == mode_b)
354
			continue;
355
#endif
356

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

359
		copy_node = (ir_node*)get_irn_link(node);
360
		construct_ssa(block, node, copy_block, copy_node);
361
362
363
	}
}

364
/**
Michael Beck's avatar
Michael Beck committed
365
 * returns whether the cmp evaluates to true or false, or can't be evaluated!
366
 * 1: true, 0: false, -1: can't evaluate
367
 *
368
 * @param relation  the compare mode of the Compare
369
370
 * @param tv_left   the left tarval
 * @param tv_right  the right tarval
371
 */
372
373
static int eval_cmp_tv(ir_relation relation, ir_tarval *tv_left,
                       ir_tarval *tv_right)
374
{
375
	ir_relation cmp_result = tarval_cmp(tv_left, tv_right);
376

377
	/* does the compare evaluate to true? */
378
	if (cmp_result == ir_relation_false)
379
		return -1;
380
381
	if ((cmp_result & relation) != 0)
		return 1;
382

383
	return 0;
384
385
}

386
387
388
#if 0
/* Matze: disabled, check first if the compare still is correct */

389
390
391
392
393
/**
 * 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
 *
394
395
396
 * @param relation  the compare mode of the Compare
 * @param left      the left node
 * @param right     the right node
397
 */
398
static int eval_cmp_vrp(ir_relation relation, ir_node *left, ir_node *right)
399
{
400
	ir_relation cmp_result = vrp_cmp(left, right);
401
	/* does the compare evaluate to true? */
402
	if (cmp_result == ir_relation_false)
403
		return -1;
404
405
406

	if ((cmp_result & relation) != cmp_result) {
		if ((cmp_result & relation) != 0) {
407
408
			return -1;
		}
409
		return 0;
410
	}
411
412
	return 1;
}
413
414
#endif

415
/**
416
417
418
419
420
 * 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
421
 */
422
423
static int eval_cmp(jumpthreading_env_t *env, ir_node *cand)
{
424
	if (is_Const(cand)) {
425
426
		ir_tarval *tv_cand = get_Const_tarval(cand);
		ir_tarval *tv_cmp  = get_Const_tarval(env->cnst);
427

428
		return eval_cmp_tv(env->relation, tv_cand, tv_cmp);
429
	} else { /* a Confirm */
430
		ir_tarval *res = computed_value_Cmp_Confirm(env->cmp, cand, env->cnst, env->relation);
431
432
433
434

		if (res == tarval_bad)
			return -1;
		return res == tarval_b_true;
435
	}
436
437
438
439
440
}

/**
 * Check for Const or Confirm with Const.
 */
441
442
static int is_Const_or_Confirm(const ir_node *node)
{
443
444
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
445
446
447
448
	return is_Const(node);
}

/**
449
 * get the tarval of a Const or Confirm with
450
 */
Matthias Braun's avatar
Matthias Braun committed
451
static ir_tarval *get_Const_or_Confirm_tarval(const ir_node *node)
452
{
453
	if (is_Confirm(node)) {
454
		if (get_Confirm_bound(node))
455
456
457
458
459
			node = get_Confirm_bound(node);
	}
	return get_Const_tarval(node);
}

460
461
static ir_node *find_const_or_confirm(jumpthreading_env_t *env, ir_node *jump,
                                      ir_node *value)
462
{
463
464
	ir_node *block = get_nodes_block(jump);

465
	if (irn_visited_else_mark(value))
466
467
		return NULL;

468
	if (is_Const_or_Confirm(value)) {
469
		if (eval_cmp(env, value) <= 0)
470
			return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
471
472
473

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
474
			"> Found jump threading candidate %+F->%+F\n",
475
			env->true_block, block
Christoph Mallon's avatar
Christoph Mallon committed
476
477
		));

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

481
482
		split_critical_edge(env->true_block, 0);

483
		/* we need a bigger visited nr when going back */
484
		env->visited_nr++;
485

486
487
		return block;
	}
488

489
	if (is_Phi(value)) {
490
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
491

492
		/* the Phi has to be in the same Block as the Jmp */
493
		if (get_nodes_block(value) != block)
494
			return NULL;
495

496
		arity = get_irn_arity(value);
497
		for (i = 0; i < arity; ++i) {
498
499
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
500
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
501

502
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
503
			if (copy_block == NULL)
504
505
				continue;

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

509
			if (copy_block == get_nodes_block(cfgpred)) {
510
				env->cnst_pred = block;
511
				env->cnst_pos  = i;
512
			}
513

514
			/* return now as we can't process more possibilities in 1 run */
515
			return copy_block;
516
		}
Christoph Mallon's avatar
Christoph Mallon committed
517
	}
518

519
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
520
521
}

522
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
523
                               ir_node *value)
524
{
525
526
	ir_node *block = get_nodes_block(jump);

527
	if (irn_visited_else_mark(value)) {
528
		return NULL;
529
	}
530

531
	if (is_Const_or_Confirm(value)) {
Matthias Braun's avatar
Matthias Braun committed
532
		ir_tarval *tv = get_Const_or_Confirm_tarval(value);
533

534
		if (tv != env->tv)
535
536
537
538
			return NULL;

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
539
			"> Found jump threading candidate %+F->%+F\n",
540
541
542
			env->true_block, block
		));

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

546
547
		split_critical_edge(env->true_block, 0);

548
		/* we need a bigger visited nr when going back */
549
		env->visited_nr++;
550

551
		return block;
552
	}
553
	if (is_Phi(value)) {
554
		int i, arity;
555

556
		/* the Phi has to be in the same Block as the Jmp */
557
		if (get_nodes_block(value) != block)
558
			return NULL;
559

560
		arity = get_irn_arity(value);
561
		for (i = 0; i < arity; ++i) {
562
563
564
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
565

566
			copy_block = find_candidate(env, cfgpred, phi_pred);
567
			if (copy_block == NULL)
568
569
570
571
572
				continue;

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

573
			if (copy_block == get_nodes_block(cfgpred)) {
574
575
576
577
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

578
			/* return now as we can't process more possibilities in 1 run */
579
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
580
		}
581
	}
582
583
584
585
586
	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);
587

588
589
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
590
		if (is_Const(left)) {
591
592
593
			ir_node *t = left;
			left       = right;
			right      = t;
594

595
			relation   = get_inversed_relation(relation);
596
		}
597

598
		if (!is_Const(right))
599
			return NULL;
600

601
602
		if (get_nodes_block(left) != block)
			return NULL;
603

604
		/* negate condition when we're looking for the false block */
605
		if (env->tv == tarval_b_false) {
606
			relation = get_negated_relation(relation);
607
		}
608

609
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
610
611
612
		env->cmp      = cmp;
		env->relation = relation;
		env->cnst     = right;
613

614
		return find_const_or_confirm(env, jump, left);
615
	}
616

617
618
	return NULL;
}
619
620
621
622
623
624
625
626
627
628
629
630
631
632

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
633
static void thread_jumps(ir_node* block, void* data)
634
{
635
	jumpthreading_env_t env;
636
	bool *changed = (bool*)data;
637
	ir_node *selector;
638
639
	ir_node *projx;
	ir_node *cond;
640
	ir_node *copy_block;
641
	int      selector_evaluated;
642
	const ir_edge_t *edge, *next;
643
	ir_graph *irg;
Matthias Braun's avatar
Matthias Braun committed
644
	ir_node *badX;
645
	int      cnst_pos;
646

647
	/* we do not deal with Phis, so restrict this to exactly one cfgpred */
648
	if (get_Block_n_cfgpreds(block) != 1)
649
650
651
652
653
654
655
656
		return;

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

	cond = get_Proj_pred(projx);
657
	/* TODO handle switch Conds */
Matthias Braun's avatar
Matthias Braun committed
658
	if (!is_Cond(cond))
659
		return;
660

Michael Beck's avatar
Michael Beck committed
661
	/* handle cases that can be immediately evaluated */
Matthias Braun's avatar
Matthias Braun committed
662
	selector = get_Cond_selector(cond);
663
	selector_evaluated = -1;
664
665
666
667
668
669
670
671
672
	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);
673
		}
674
675
676
677
678
679
680
681
682
#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
683
	} else if (is_Const_or_Confirm(selector)) {
Matthias Braun's avatar
Matthias Braun committed
684
		ir_tarval *tv = get_Const_or_Confirm_tarval(selector);
685
		if (tv == tarval_b_true) {
686
687
			selector_evaluated = 1;
		} else {
688
			assert(tv == tarval_b_false);
689
690
691
692
693
			selector_evaluated = 0;
		}
	}

	env.cnst_pred = NULL;
694
	if (get_Proj_proj(projx) == pn_Cond_false) {
695
		env.tv = tarval_b_false;
696
		if (selector_evaluated >= 0)
697
			selector_evaluated = !selector_evaluated;
698
	} else {
699
		env.tv = tarval_b_true;
700
701
	}

702
	if (selector_evaluated == 0) {
703
		ir_graph *irg = get_irn_irg(block);
Matthias Braun's avatar
Matthias Braun committed
704
		ir_node  *bad = new_r_Bad(irg, mode_X);
705
		exchange(projx, bad);
706
		*changed = true;
707
		return;
708
	} else if (selector_evaluated == 1) {
709
		dbg_info *dbgi = get_irn_dbg_info(selector);
710
		ir_node  *jmp  = new_rd_Jmp(dbgi, get_nodes_block(projx));
yb9976's avatar
yb9976 committed
711
		DBG_OPT_JUMPTHREADING(projx, jmp);
712
		exchange(projx, jmp);
713
		*changed = true;
714
715
716
		return;
	}

717
	/* (recursively) look if a pred of a Phi is a constant or a Confirm */
718
	env.true_block = block;
719
720
721
	irg = get_irn_irg(block);
	inc_irg_visited(irg);
	env.visited_nr = get_irg_visited(irg);
722
723
724

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
725
726
		return;

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

731
	/* we have to remove the edge towards the pred as the pred now
732
	 * jumps into the true_block. We also have to shorten Phis
733
	 * in our block because of this */
Matthias Braun's avatar
Matthias Braun committed
734
	badX     = new_r_Bad(irg, mode_X);
735
736
	cnst_pos = env.cnst_pos;

737
	/* shorten Phis */
738
739
740
	foreach_out_edge_safe(env.cnst_pred, edge, next) {
		ir_node *node = get_edge_src_irn(edge);

Matthias Braun's avatar
Matthias Braun committed
741
742
		if (is_Phi(node)) {
			ir_node *bad = new_r_Bad(irg, get_irn_mode(node));
743
			set_Phi_pred(node, cnst_pos, bad);
Matthias Braun's avatar
Matthias Braun committed
744
		}
745
746
	}

Matthias Braun's avatar
Matthias Braun committed
747
	set_Block_cfgpred(env.cnst_pred, cnst_pos, badX);
748
749

	/* the graph is changed now */
750
	*changed = true;
751
752
}

753
void opt_jumpthreading(ir_graph* irg)
754
{
755
756
757
758
759
760
761
	bool changed;
	bool rerun;

	assure_irg_properties(irg,
		IR_GRAPH_PROPERTY_NO_UNREACHABLE_CODE
		| IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES
		| IR_GRAPH_PROPERTY_NO_CRITICAL_EDGES);
762

763
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
764

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

767
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
768

769
	changed = false;
770
	do {
771
		rerun = false;
772
		irg_block_walk_graph(irg, thread_jumps, NULL, &rerun);
Michael Beck's avatar
Michael Beck committed
773
774
775
		changed |= rerun;
	} while (rerun);

776
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
777

778
779
	confirm_irg_properties(irg,
		changed ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL);
780
}
781
782

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