jumpthreading.c 18.2 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
/*
 * This file is part of libFirm.
3
 * Copyright (C) 2012 University of Karlsruhe.
Christian Würdig's avatar
Christian Würdig committed
4
5
 */

Michael Beck's avatar
Michael Beck committed
6
7
/**
 * @file
8
 * @brief   Path-Sensitive Jump Threading
Michael Beck's avatar
Michael Beck committed
9
10
 * @date    10. Sep. 2006
 * @author  Christoph Mallon, Matthias Braun
11
 */
12
13
#include "iroptimize.h"

14
#include <assert.h>
15
#include <stdbool.h>
16
#include "array.h"
17
18
#include "debug.h"
#include "ircons.h"
Christoph Mallon's avatar
Christoph Mallon committed
19
20
#include "irgmod.h"
#include "irgopt.h"
21
22
#include "irgwalk.h"
#include "irnode.h"
23
#include "irnode_t.h"
24
#include "iredges.h"
25
#include "iredges_t.h"
26
#include "irtools.h"
27
#include "tv.h"
28
#include "iroptimize.h"
29
#include "iropt_dbg.h"
30
#include "vrp.h"
31
#include "firmstat_t.h"
32

33
#undef AVOID_PHIB
34

35
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
36

Christoph Mallon's avatar
Christoph Mallon committed
37
38
39
40
41
/**
 * 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)
{
42
43
	int const  n   = get_Block_n_cfgpreds(node);
	ir_node  **ins = ALLOCAN(ir_node*, n+1);
44
	for (int i = 0; i < n; i++)
45
		ins[i] = get_irn_n(node, i);
Christoph Mallon's avatar
Christoph Mallon committed
46
47
48
49
	ins[n] = x;
	set_irn_in(node, n + 1, ins);
}

50
51
52
53
54
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
55
{
56
57
58
59
	int i;
	int n_cfgpreds;
	ir_graph *irg;
	ir_node *phi;
60
	ir_node *dummy;
61

62
63
	/* In case of a bad input to a block we need to return the bad value */
	if (is_Bad(block)) {
64
		ir_graph *irg = get_irn_irg(block);
Matthias Braun's avatar
Matthias Braun committed
65
		return new_r_Bad(irg, mode);
66
	}
67

68
69
70
	/* 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
71
	 * So we keep a flag that indicated whether we walked at least 1 block
72
73
74
75
76
	 * away and may use the alternative definition */
	if (block == ssa_second_def_block && !first) {
		return ssa_second_def;
	}

77
	/* already processed this block? */
78
	if (irn_visited(block)) {
79
80
81
82
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

Matthias Braun's avatar
Matthias Braun committed
83
84
85
	irg = get_irn_irg(block);
	assert(block != get_irg_start_block(irg));

Christoph Mallon's avatar
Christoph Mallon committed
86
	/* a Block with only 1 predecessor needs no Phi */
87
	n_cfgpreds = get_Block_n_cfgpreds(block);
88
	if (n_cfgpreds == 1) {
89
		ir_node *pred_block = get_Block_cfgpred_block(block, 0);
90
		ir_node *value      = search_def_and_create_phis(pred_block, mode, 0);
91
92
93
94
95
96

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

97
	/* create a new Phi */
98
	ir_node **in = ALLOCAN(ir_node*, n_cfgpreds);
99
	dummy = new_r_Dummy(irg, mode);
100
	for (i = 0; i < n_cfgpreds; ++i)
101
		in[i] = dummy;
102

103
	phi = new_r_Phi(block, n_cfgpreds, in, mode);
104
105
106
	set_irn_link(block, phi);
	mark_irn_visited(block);

107
	/* set Phi predecessors */
108
	for (i = 0; i < n_cfgpreds; ++i) {
109
		ir_node *pred_block = get_Block_cfgpred_block(block, i);
110
		ir_node *pred_val   = search_def_and_create_phis(pred_block, mode, 0);
111
112
113
114
115
116
117
118

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

/**
119
120
121
 * 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.
122
 */
123
124
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
125
{
126
127
128
	ir_graph *irg;
	ir_mode *mode;

129
130
131
132
	/* no need to do anything */
	if (orig_val == second_val)
		return;

133
	irg = get_irn_irg(orig_val);
134
135
	inc_irg_visited(irg);

136
137
138
	mode = get_irn_mode(orig_val);
	set_irn_link(orig_block, orig_val);
	mark_irn_visited(orig_block);
139

140
141
	ssa_second_def_block = second_block;
	ssa_second_def       = second_val;
142

143
	/* Only fix the users of the first, i.e. the original node */
144
	foreach_out_edge_safe(orig_val, edge) {
145
146
147
148
		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;
149

150
151
		/* ignore keeps */
		if (is_End(user))
152
			continue;
153
154
155

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

156
		if (is_Phi(user)) {
157
			ir_node *pred_block = get_Block_cfgpred_block(user_block, j);
158
			newval = search_def_and_create_phis(pred_block, mode, 1);
159
		} else {
160
			newval = search_def_and_create_phis(user_block, mode, 1);
161
162
		}

163
		/* don't fix newly created Phis from the SSA construction */
164
165
166
		if (newval != user) {
			DB((dbg, LEVEL_4, ">>>> Setting input %d of %+F to %+F\n", j, user, newval));
			set_irn_n(user, j, newval);
167
168
169
170
		}
	}
}

171
172
173
174
175
176
177
178
179
180
/**
 * jumpthreading produces critical edges, e.g. B-C:
 *     A         A
 *  \ /       \  |
 *   B    =>   B |
 *  / \       / \|
 *     C         C
 *
 * By splitting this critical edge more threadings might be possible.
 */
181
182
183
184
185
186
187
188
189
190
191
192
193
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);
}

194
typedef struct jumpthreading_env_t {
195
	ir_node       *true_block;
196
	ir_node       *cmp;        /**< The Compare node that might be partial evaluated */
197
	ir_relation    relation;   /**< The Compare mode of the Compare node. */
198
	ir_node       *cnst;
Matthias Braun's avatar
Matthias Braun committed
199
	ir_tarval     *tv;
200
	ir_visited_t   visited_nr;
201
202
203
204

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

207
208
209
210
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
211
212
213
214
215
216
	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);
217
		/* we might have to evaluate a Phi-cascade */
218
		if (get_irn_visited(copy) >= env->visited_nr) {
219
			copy = (ir_node*)get_irn_link(copy);
Matthias Braun's avatar
Matthias Braun committed
220
221
222
223
224
225
226
227
		}
	} else {
		copy = exact_copy(node);
		set_nodes_block(copy, copy_block);

		assert(get_irn_mode(copy) != mode_X);

		arity = get_irn_arity(copy);
228
		for (i = 0; i < arity; ++i) {
Matthias Braun's avatar
Matthias Braun committed
229
230
231
			ir_node *pred     = get_irn_n(copy, i);
			ir_node *new_pred;

232
			if (get_nodes_block(pred) != block)
Matthias Braun's avatar
Matthias Braun committed
233
234
				continue;

235
			if (get_irn_visited(pred) >= env->visited_nr) {
236
				new_pred = (ir_node*)get_irn_link(pred);
Matthias Braun's avatar
Matthias Braun committed
237
238
239
			} else {
				new_pred = copy_and_fix_node(env, block, copy_block, j, pred);
			}
240
			DB((dbg, LEVEL_2, ">> Set Pred of %+F to %+F\n", copy, new_pred));
Matthias Braun's avatar
Matthias Braun committed
241
242
243
244
245
246
247
248
249
250
			set_irn_n(copy, i, new_pred);
		}
	}

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

	return copy;
}

251
252
253
static void copy_and_fix(const jumpthreading_env_t *env, ir_node *block,
                         ir_node *copy_block, int j)
{
254
255
256
257
	/* 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;
258
259
		ir_mode *mode;

Andreas Zwinkau's avatar
Andreas Zwinkau committed
260
		if (is_End(node)) {
261
262
			/* 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
263
264
265
266
			 */
			keep_alive(copy_block);
			continue;
		}
267
		/* ignore control flow */
268
		mode = get_irn_mode(node);
Matthias Braun's avatar
Matthias Braun committed
269
		if (mode == mode_X || is_Cond(node) || is_Switch(node))
270
			continue;
271
#ifdef AVOID_PHIB
272
		/* we may not copy mode_b nodes, because this could produce Phi with
273
		 * mode_bs which can't be handled in all backends. Instead we duplicate
Christoph Mallon's avatar
Christoph Mallon committed
274
		 * the node and move it to its users */
275
		if (mode == mode_b) {
276
277
			ir_node *const pred = get_Proj_pred(node);
			long     const pn   = get_Proj_proj(node);
278

279
			foreach_out_edge_safe(node, edge) {
280
281
282
283
284
				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);

285
				if (user_block == block)
286
287
288
289
					continue;

				cmp_copy = exact_copy(pred);
				set_nodes_block(cmp_copy, user_block);
290
				copy = new_r_Proj(cmp_copy, mode_b, pn);
291
292
293
294
				set_irn_n(user, pos, copy);
			}
			continue;
		}
295
#endif
Christoph Mallon's avatar
Christoph Mallon committed
296

Matthias Braun's avatar
Matthias Braun committed
297
		copy = copy_and_fix_node(env, block, copy_block, j, node);
298
299

		/* we might hit values in blocks that have already been processed by a
300
		 * recursive find_phi_with_const() call */
301
		assert(get_irn_visited(copy) <= env->visited_nr);
302
		if (get_irn_visited(copy) >= env->visited_nr) {
303
			ir_node *prev_copy = (ir_node*)get_irn_link(copy);
304
			if (prev_copy != NULL)
305
306
307
				set_irn_link(node, prev_copy);
		}
	}
Christoph Mallon's avatar
Christoph Mallon committed
308

309
310
311
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
312
		ir_node *copy_node;
313
314
315
		ir_mode *mode;

		mode = get_irn_mode(node);
Matthias Braun's avatar
Matthias Braun committed
316
		if (mode == mode_X || is_Cond(node) || is_Switch(node))
317
			continue;
318
#ifdef AVOID_PHIB
319
		if (mode == mode_b)
320
			continue;
321
#endif
322

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

325
		copy_node = (ir_node*)get_irn_link(node);
326
		construct_ssa(block, node, copy_block, copy_node);
327
	}
328
329
330
331
332
333
334
335
336
337
338

	/* 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);
	}
339
340
}

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

354
	/* does the compare evaluate to true? */
355
	if (cmp_result == ir_relation_false)
356
		return -1;
357
358
	if ((cmp_result & relation) != 0)
		return 1;
359

360
	return 0;
361
362
}

363
/**
364
365
366
367
368
 * 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
369
 */
370
371
static int eval_cmp(jumpthreading_env_t *env, ir_node *cand)
{
372
	if (is_Const(cand)) {
373
374
		ir_tarval *tv_cand = get_Const_tarval(cand);
		ir_tarval *tv_cmp  = get_Const_tarval(env->cnst);
375

376
		return eval_cmp_tv(env->relation, tv_cand, tv_cmp);
377
	} else { /* a Confirm */
378
		ir_tarval *res = computed_value_Cmp_Confirm(env->cmp, cand, env->cnst, env->relation);
379
380
381
382

		if (res == tarval_bad)
			return -1;
		return res == tarval_b_true;
383
	}
384
385
386
387
388
}

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

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

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

413
	if (irn_visited_else_mark(value))
414
415
		return NULL;

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

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

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

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

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

434
435
		return block;
	}
436

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

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

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

450
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
451
			if (copy_block == NULL)
452
453
				continue;

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

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

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

467
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
468
469
}

470
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
471
                               ir_node *value)
472
{
473
474
	ir_node *block = get_nodes_block(jump);

475
	if (irn_visited_else_mark(value)) {
476
		return NULL;
477
	}
478

479
	if (is_Const_or_Confirm(value)) {
Matthias Braun's avatar
Matthias Braun committed
480
		ir_tarval *tv = get_Const_or_Confirm_tarval(value);
481

482
		if (tv != env->tv)
483
484
485
486
			return NULL;

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
487
			"> Found jump threading candidate %+F->%+F\n",
488
			block, env->true_block
489
490
		));

491
		/* adjust true_block to point directly towards our jump */
492
493
		add_pred(env->true_block, jump);

494
495
		split_critical_edge(env->true_block, 0);

496
		/* we need a bigger visited nr when going back */
497
		env->visited_nr++;
498

499
		return block;
500
	}
501
	if (is_Phi(value)) {
502
		int i, arity;
503

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

508
		arity = get_irn_arity(value);
509
		for (i = 0; i < arity; ++i) {
510
511
512
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
513

514
			copy_block = find_candidate(env, cfgpred, phi_pred);
515
			if (copy_block == NULL)
516
517
518
519
520
				continue;

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

521
			if (copy_block == get_nodes_block(cfgpred)) {
522
523
524
525
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

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

536
537
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
538
		if (is_Const(left)) {
539
540
541
			ir_node *t = left;
			left       = right;
			right      = t;
542

543
			relation   = get_inversed_relation(relation);
544
		}
545

546
		if (!is_Const(right))
547
			return NULL;
548

549
550
		if (get_nodes_block(left) != block)
			return NULL;
551

552
		/* negate condition when we're looking for the false block */
553
		if (env->tv == tarval_b_false) {
554
			relation = get_negated_relation(relation);
555
		}
556

557
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
558
559
560
		env->cmp      = cmp;
		env->relation = relation;
		env->cnst     = right;
561

562
		return find_const_or_confirm(env, jump, left);
563
	}
564

565
566
	return NULL;
}
567
568
569
570
571
572
573
574
575
576
577
578
579
580

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
581
static void thread_jumps(ir_node* block, void* data)
582
{
583
	jumpthreading_env_t env;
584
	bool *changed = (bool*)data;
585
	ir_node *selector;
586
587
	ir_node *projx;
	ir_node *cond;
588
	ir_node *copy_block;
589
	int      selector_evaluated;
590
	ir_graph *irg;
Matthias Braun's avatar
Matthias Braun committed
591
	ir_node *badX;
592
	int      cnst_pos;
593

594
	/* we do not deal with Phis, so restrict this to exactly one cfgpred */
595
	if (get_Block_n_cfgpreds(block) != 1)
596
597
598
599
600
601
602
603
		return;

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

	cond = get_Proj_pred(projx);
604
	/* TODO handle switch Conds */
Matthias Braun's avatar
Matthias Braun committed
605
	if (!is_Cond(cond))
606
		return;
607

Michael Beck's avatar
Michael Beck committed
608
	/* handle cases that can be immediately evaluated */
Matthias Braun's avatar
Matthias Braun committed
609
	selector = get_Cond_selector(cond);
610
	selector_evaluated = -1;
611
612
613
614
615
616
617
618
619
	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);
620
		}
621
	} else if (is_Const_or_Confirm(selector)) {
Matthias Braun's avatar
Matthias Braun committed
622
		ir_tarval *tv = get_Const_or_Confirm_tarval(selector);
623
		if (tv == tarval_b_true) {
624
625
			selector_evaluated = 1;
		} else {
626
			assert(tv == tarval_b_false);
627
628
629
630
631
			selector_evaluated = 0;
		}
	}

	env.cnst_pred = NULL;
632
	if (get_Proj_proj(projx) == pn_Cond_false) {
633
		env.tv = tarval_b_false;
634
		if (selector_evaluated >= 0)
635
			selector_evaluated = !selector_evaluated;
636
	} else {
637
		env.tv = tarval_b_true;
638
639
	}

640
	if (selector_evaluated == 0) {
641
		ir_graph *irg = get_irn_irg(block);
Matthias Braun's avatar
Matthias Braun committed
642
		ir_node  *bad = new_r_Bad(irg, mode_X);
643
		exchange(projx, bad);
644
		*changed = true;
645
		return;
646
	} else if (selector_evaluated == 1) {
647
		dbg_info *dbgi = get_irn_dbg_info(selector);
648
		ir_node  *jmp  = new_rd_Jmp(dbgi, get_nodes_block(projx));
yb9976's avatar
yb9976 committed
649
		DBG_OPT_JUMPTHREADING(projx, jmp);
650
		exchange(projx, jmp);
651
		*changed = true;
652
653
654
		return;
	}

655
	/* (recursively) look if a pred of a Phi is a constant or a Confirm */
656
	env.true_block = block;
657
658
659
	irg = get_irn_irg(block);
	inc_irg_visited(irg);
	env.visited_nr = get_irg_visited(irg);
660
661
662

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
663
664
		return;

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

669
	/* we have to remove the edge towards the pred as the pred now
670
	 * jumps into the true_block. We also have to shorten Phis
671
	 * in our block because of this */
Matthias Braun's avatar
Matthias Braun committed
672
	badX     = new_r_Bad(irg, mode_X);
673
674
	cnst_pos = env.cnst_pos;

675
	/* shorten Phis */
676
	foreach_out_edge_safe(env.cnst_pred, edge) {
677
678
		ir_node *node = get_edge_src_irn(edge);

Matthias Braun's avatar
Matthias Braun committed
679
680
		if (is_Phi(node)) {
			ir_node *bad = new_r_Bad(irg, get_irn_mode(node));
681
			set_Phi_pred(node, cnst_pos, bad);
Matthias Braun's avatar
Matthias Braun committed
682
		}
683
684
	}

Matthias Braun's avatar
Matthias Braun committed
685
	set_Block_cfgpred(env.cnst_pred, cnst_pos, badX);
686
687

	/* the graph is changed now */
688
	*changed = true;
689
690
}

691
void opt_jumpthreading(ir_graph* irg)
692
{
693
694
695
696
697
698
699
	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);
700

701
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
702

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

705
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
706

707
	changed = false;
708
	do {
709
		rerun = false;
710
		irg_block_walk_graph(irg, thread_jumps, NULL, &rerun);
Michael Beck's avatar
Michael Beck committed
711
712
713
		changed |= rerun;
	} while (rerun);

714
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
715

716
717
	confirm_irg_properties(irg,
		changed ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL);
718
}