jumpthreading.c 20.1 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
#include "firmstat_t.h"
50

51
#undef AVOID_PHIB
52

53
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
54

Christoph Mallon's avatar
Christoph Mallon committed
55
56
57
58
59
60
61
62
63
/**
 * 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;

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

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

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

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

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

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

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

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

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

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

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

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

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

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

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

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

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

165
166
	ssa_second_def_block = second_block;
	ssa_second_def       = second_val;
167

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

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

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

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

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

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

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

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

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

		assert(get_irn_mode(copy) != mode_X);

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

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

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

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

	return copy;
}

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

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

			assert(is_Proj(node));

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

309
			foreach_out_edge_safe(node, edge) {
310
311
312
313
314
				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);

315
				if (user_block == block)
316
317
318
319
					continue;

				cmp_copy = exact_copy(pred);
				set_nodes_block(cmp_copy, user_block);
320
				copy = new_r_Proj(cmp_copy, mode_b, pn);
321
322
323
324
				set_irn_n(user, pos, copy);
			}
			continue;
		}
325
#endif
Christoph Mallon's avatar
Christoph Mallon committed
326

Matthias Braun's avatar
Matthias Braun committed
327
		copy = copy_and_fix_node(env, block, copy_block, j, node);
328
329

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

339
340
341
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
342
		ir_node *copy_node;
343
344
345
		ir_mode *mode;

		mode = get_irn_mode(node);
Matthias Braun's avatar
Matthias Braun committed
346
		if (mode == mode_X || is_Cond(node) || is_Switch(node))
347
			continue;
348
#ifdef AVOID_PHIB
349
		if (mode == mode_b)
350
			continue;
351
#endif
352

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

355
		copy_node = (ir_node*)get_irn_link(node);
356
		construct_ssa(block, node, copy_block, copy_node);
357
	}
358
359
360
361
362
363
364
365
366
367
368

	/* make sure new nodes are kept alive if old nodes were */
	ir_graph *irg = get_irn_irg(block);
	ir_node  *end = get_irg_end(irg);
	for (int i = 0, arity = get_End_n_keepalives(end); i < arity; ++i) {
		ir_node *keep = get_End_keepalive(end, i);
		if (get_irn_visited(keep) < env->visited_nr || is_Block(keep))
			continue;
		ir_node *copy = get_irn_link(keep);
		add_End_keepalive(end, copy);
	}
369
370
}

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

384
	/* does the compare evaluate to true? */
385
	if (cmp_result == ir_relation_false)
386
		return -1;
387
388
	if ((cmp_result & relation) != 0)
		return 1;
389

390
	return 0;
391
392
}

393
394
395
#if 0
/* Matze: disabled, check first if the compare still is correct */

396
397
398
399
400
/**
 * 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
 *
401
402
403
 * @param relation  the compare mode of the Compare
 * @param left      the left node
 * @param right     the right node
404
 */
405
static int eval_cmp_vrp(ir_relation relation, ir_node *left, ir_node *right)
406
{
407
	ir_relation cmp_result = vrp_cmp(left, right);
408
	/* does the compare evaluate to true? */
409
	if (cmp_result == ir_relation_false)
410
		return -1;
411
412
413

	if ((cmp_result & relation) != cmp_result) {
		if ((cmp_result & relation) != 0) {
414
415
			return -1;
		}
416
		return 0;
417
	}
418
419
	return 1;
}
420
421
#endif

422
/**
423
424
425
426
427
 * 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
428
 */
429
430
static int eval_cmp(jumpthreading_env_t *env, ir_node *cand)
{
431
	if (is_Const(cand)) {
432
433
		ir_tarval *tv_cand = get_Const_tarval(cand);
		ir_tarval *tv_cmp  = get_Const_tarval(env->cnst);
434

435
		return eval_cmp_tv(env->relation, tv_cand, tv_cmp);
436
	} else { /* a Confirm */
437
		ir_tarval *res = computed_value_Cmp_Confirm(env->cmp, cand, env->cnst, env->relation);
438
439
440
441

		if (res == tarval_bad)
			return -1;
		return res == tarval_b_true;
442
	}
443
444
445
446
447
}

/**
 * Check for Const or Confirm with Const.
 */
448
449
static int is_Const_or_Confirm(const ir_node *node)
{
450
451
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
452
453
454
455
	return is_Const(node);
}

/**
456
 * get the tarval of a Const or Confirm with
457
 */
Matthias Braun's avatar
Matthias Braun committed
458
static ir_tarval *get_Const_or_Confirm_tarval(const ir_node *node)
459
{
460
	if (is_Confirm(node)) {
461
		if (get_Confirm_bound(node))
462
463
464
465
466
			node = get_Confirm_bound(node);
	}
	return get_Const_tarval(node);
}

467
468
static ir_node *find_const_or_confirm(jumpthreading_env_t *env, ir_node *jump,
                                      ir_node *value)
469
{
470
471
	ir_node *block = get_nodes_block(jump);

472
	if (irn_visited_else_mark(value))
473
474
		return NULL;

475
	if (is_Const_or_Confirm(value)) {
476
		if (eval_cmp(env, value) <= 0)
477
			return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
478
479
480

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
481
			"> Found jump threading candidate %+F->%+F\n",
482
			block, env->true_block
Christoph Mallon's avatar
Christoph Mallon committed
483
484
		));

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

488
489
		split_critical_edge(env->true_block, 0);

490
		/* we need a bigger visited nr when going back */
491
		env->visited_nr++;
492

493
494
		return block;
	}
495

496
	if (is_Phi(value)) {
497
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
498

499
		/* the Phi has to be in the same Block as the Jmp */
500
		if (get_nodes_block(value) != block)
501
			return NULL;
502

503
		arity = get_irn_arity(value);
504
		for (i = 0; i < arity; ++i) {
505
506
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
507
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
508

509
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
510
			if (copy_block == NULL)
511
512
				continue;

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

516
			if (copy_block == get_nodes_block(cfgpred)) {
517
				env->cnst_pred = block;
518
				env->cnst_pos  = i;
519
			}
520

521
			/* return now as we can't process more possibilities in 1 run */
522
			return copy_block;
523
		}
Christoph Mallon's avatar
Christoph Mallon committed
524
	}
525

526
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
527
528
}

529
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
530
                               ir_node *value)
531
{
532
533
	ir_node *block = get_nodes_block(jump);

534
	if (irn_visited_else_mark(value)) {
535
		return NULL;
536
	}
537

538
	if (is_Const_or_Confirm(value)) {
Matthias Braun's avatar
Matthias Braun committed
539
		ir_tarval *tv = get_Const_or_Confirm_tarval(value);
540

541
		if (tv != env->tv)
542
543
544
545
			return NULL;

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
546
			"> Found jump threading candidate %+F->%+F\n",
547
			block, env->true_block
548
549
		));

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

553
554
		split_critical_edge(env->true_block, 0);

555
		/* we need a bigger visited nr when going back */
556
		env->visited_nr++;
557

558
		return block;
559
	}
560
	if (is_Phi(value)) {
561
		int i, arity;
562

563
		/* the Phi has to be in the same Block as the Jmp */
564
		if (get_nodes_block(value) != block)
565
			return NULL;
566

567
		arity = get_irn_arity(value);
568
		for (i = 0; i < arity; ++i) {
569
570
571
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
572

573
			copy_block = find_candidate(env, cfgpred, phi_pred);
574
			if (copy_block == NULL)
575
576
577
578
579
				continue;

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

580
			if (copy_block == get_nodes_block(cfgpred)) {
581
582
583
584
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

585
			/* return now as we can't process more possibilities in 1 run */
586
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
587
		}
588
	}
589
590
591
592
593
	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);
594

595
596
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
597
		if (is_Const(left)) {
598
599
600
			ir_node *t = left;
			left       = right;
			right      = t;
601

602
			relation   = get_inversed_relation(relation);
603
		}
604

605
		if (!is_Const(right))
606
			return NULL;
607

608
609
		if (get_nodes_block(left) != block)
			return NULL;
610

611
		/* negate condition when we're looking for the false block */
612
		if (env->tv == tarval_b_false) {
613
			relation = get_negated_relation(relation);
614
		}
615

616
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
617
618
619
		env->cmp      = cmp;
		env->relation = relation;
		env->cnst     = right;
620

621
		return find_const_or_confirm(env, jump, left);
622
	}
623

624
625
	return NULL;
}
626
627
628
629
630
631
632
633
634
635
636
637
638
639

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
640
static void thread_jumps(ir_node* block, void* data)
641
{
642
	jumpthreading_env_t env;
643
	bool *changed = (bool*)data;
644
	ir_node *selector;
645
646
	ir_node *projx;
	ir_node *cond;
647
	ir_node *copy_block;
648
	int      selector_evaluated;
649
	ir_graph *irg;
Matthias Braun's avatar
Matthias Braun committed
650
	ir_node *badX;
651
	int      cnst_pos;
652

653
	/* we do not deal with Phis, so restrict this to exactly one cfgpred */
654
	if (get_Block_n_cfgpreds(block) != 1)
655
656
657
658
659
660
661
662
		return;

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

	cond = get_Proj_pred(projx);
663
	/* TODO handle switch Conds */
Matthias Braun's avatar
Matthias Braun committed
664
	if (!is_Cond(cond))
665
		return;
666

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

	env.cnst_pred = NULL;
700
	if (get_Proj_proj(projx) == pn_Cond_false) {
701
		env.tv = tarval_b_false;
702
		if (selector_evaluated >= 0)
703
			selector_evaluated = !selector_evaluated;
704
	} else {
705
		env.tv = tarval_b_true;
706
707
	}

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

723
	/* (recursively) look if a pred of a Phi is a constant or a Confirm */
724
	env.true_block = block;
725
726
727
	irg = get_irn_irg(block);
	inc_irg_visited(irg);
	env.visited_nr = get_irg_visited(irg);
728
729
730

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
731
732
		return;

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

737
	/* we have to remove the edge towards the pred as the pred now
738
	 * jumps into the true_block. We also have to shorten Phis
739
	 * in our block because of this */
Matthias Braun's avatar
Matthias Braun committed
740
	badX     = new_r_Bad(irg, mode_X);
741
742
	cnst_pos = env.cnst_pos;

743
	/* shorten Phis */
744
	foreach_out_edge_safe(env.cnst_pred, edge) {
745
746
		ir_node *node = get_edge_src_irn(edge);

Matthias Braun's avatar
Matthias Braun committed
747
748
		if (is_Phi(node)) {
			ir_node *bad = new_r_Bad(irg, get_irn_mode(node));
749
			set_Phi_pred(node, cnst_pos, bad);
Matthias Braun's avatar
Matthias Braun committed
750
		}
751
752
	}

Matthias Braun's avatar
Matthias Braun committed
753
	set_Block_cfgpred(env.cnst_pred, cnst_pos, badX);
754
755

	/* the graph is changed now */
756
	*changed = true;
757
758
}

759
void opt_jumpthreading(ir_graph* irg)
760
{
761
762
763
764
765
766
767
	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);
768

769
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
770

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

773
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
774

775
	changed = false;
776
	do {
777
		rerun = false;
778
		irg_block_walk_graph(irg, thread_jumps, NULL, &rerun);
Michael Beck's avatar
Michael Beck committed
779
780
781
		changed |= rerun;
	} while (rerun);

782
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
783

784
785
	confirm_irg_properties(irg,
		changed ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL);
786
}
787
788

/* Creates an ir_graph pass for opt_jumpthreading. */
789
ir_graph_pass_t *opt_jumpthreading_pass(const char *name)
790
{
791
	return def_graph_pass(name ? name : "jumpthreading", opt_jumpthreading);
792
}  /* opt_jumpthreading_pass */