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_t.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
42
43
/**
 * 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;

44
	int const n = get_Block_n_cfgpreds(node);
Christoph Mallon's avatar
Christoph Mallon committed
45
	NEW_ARR_A(ir_node*, ins, n + 1);
46
	for (int i = 0; i < n; i++)
47
		ins[i] = get_irn_n(node, i);
Christoph Mallon's avatar
Christoph Mallon committed
48
49
50
51
	ins[n] = x;
	set_irn_in(node, n + 1, ins);
}

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

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

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

80
	/* already processed this block? */
81
	if (irn_visited(block)) {
82
83
84
85
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

Matthias Braun's avatar
Matthias Braun committed
86
87
88
	irg = get_irn_irg(block);
	assert(block != get_irg_start_block(irg));

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

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

100
	/* create a new Phi */
Christoph Mallon's avatar
Christoph Mallon committed
101
	NEW_ARR_A(ir_node*, in, n_cfgpreds);
102
	dummy = new_r_Dummy(irg, mode);
103
	for (i = 0; i < n_cfgpreds; ++i)
104
		in[i] = dummy;
105

106
	phi = new_r_Phi(block, n_cfgpreds, in, mode);
107
108
109
	set_irn_link(block, phi);
	mark_irn_visited(block);

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

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

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

132
133
134
135
	/* no need to do anything */
	if (orig_val == second_val)
		return;

136
	irg = get_irn_irg(orig_val);
137
138
	inc_irg_visited(irg);

139
140
141
	mode = get_irn_mode(orig_val);
	set_irn_link(orig_block, orig_val);
	mark_irn_visited(orig_block);
142

143
144
	ssa_second_def_block = second_block;
	ssa_second_def       = second_val;
145

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

153
154
		/* ignore keeps */
		if (is_End(user))
155
			continue;
156
157
158

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

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

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

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

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

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

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

		assert(get_irn_mode(copy) != mode_X);

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

235
			if (get_nodes_block(pred) != block)
Matthias Braun's avatar
Matthias Braun committed
236
237
				continue;

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

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

	return copy;
}

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

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

282
			foreach_out_edge_safe(node, edge) {
283
284
285
286
287
				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);

288
				if (user_block == block)
289
290
291
292
					continue;

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

Matthias Braun's avatar
Matthias Braun committed
300
		copy = copy_and_fix_node(env, block, copy_block, j, node);
301
302

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

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

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

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

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

	/* 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);
	}
342
343
}

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

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

363
	return 0;
364
365
}

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

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

		if (res == tarval_bad)
			return -1;
		return res == tarval_b_true;
386
	}
387
388
389
390
391
}

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

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

411
412
static ir_node *find_const_or_confirm(jumpthreading_env_t *env, ir_node *jump,
                                      ir_node *value)
413
{
414
415
	ir_node *block = get_nodes_block(jump);

416
	if (irn_visited_else_mark(value))
417
418
		return NULL;

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

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

429
		/* adjust true_block to point directly towards our jump */
430
		add_pred(env->true_block, jump);
431

432
433
		split_critical_edge(env->true_block, 0);

434
		/* we need a bigger visited nr when going back */
435
		env->visited_nr++;
436

437
438
		return block;
	}
439

440
	if (is_Phi(value)) {
441
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
442

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

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

453
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
454
			if (copy_block == NULL)
455
456
				continue;

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

460
			if (copy_block == get_nodes_block(cfgpred)) {
461
				env->cnst_pred = block;
462
				env->cnst_pos  = i;
463
			}
464

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

470
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
471
472
}

473
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
474
                               ir_node *value)
475
{
476
477
	ir_node *block = get_nodes_block(jump);

478
	if (irn_visited_else_mark(value)) {
479
		return NULL;
480
	}
481

482
	if (is_Const_or_Confirm(value)) {
Matthias Braun's avatar
Matthias Braun committed
483
		ir_tarval *tv = get_Const_or_Confirm_tarval(value);
484

485
		if (tv != env->tv)
486
487
488
489
			return NULL;

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

494
		/* adjust true_block to point directly towards our jump */
495
496
		add_pred(env->true_block, jump);

497
498
		split_critical_edge(env->true_block, 0);

499
		/* we need a bigger visited nr when going back */
500
		env->visited_nr++;
501

502
		return block;
503
	}
504
	if (is_Phi(value)) {
505
		int i, arity;
506

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

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

517
			copy_block = find_candidate(env, cfgpred, phi_pred);
518
			if (copy_block == NULL)
519
520
521
522
523
				continue;

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

524
			if (copy_block == get_nodes_block(cfgpred)) {
525
526
527
528
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

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

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

546
			relation   = get_inversed_relation(relation);
547
		}
548

549
		if (!is_Const(right))
550
			return NULL;
551

552
553
		if (get_nodes_block(left) != block)
			return NULL;
554

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

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

565
		return find_const_or_confirm(env, jump, left);
566
	}
567

568
569
	return NULL;
}
570
571
572
573
574
575
576
577
578
579
580
581
582
583

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

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

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

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

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

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

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

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

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
666
667
		return;

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

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

678
	/* shorten Phis */
679
	foreach_out_edge_safe(env.cnst_pred, edge) {
680
681
		ir_node *node = get_edge_src_irn(edge);

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

Matthias Braun's avatar
Matthias Braun committed
688
	set_Block_cfgpred(env.cnst_pred, cnst_pos, badX);
689
690

	/* the graph is changed now */
691
	*changed = true;
692
693
}

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

704
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
705

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

708
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
709

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

717
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
718

719
720
	confirm_irg_properties(irg,
		changed ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL);
721
}