jumpthreading.c 18.6 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Christian Würdig's avatar
Christian Würdig committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 *
 * This file is part of libFirm.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 2 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * Licensees holding valid libFirm Professional Edition licenses may use
 * this file in accordance with the libFirm Commercial License.
 * Agreement provided with the Software.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE.
 */

Michael Beck's avatar
Michael Beck committed
20
21
/**
 * @file
22
 * @brief   Path-Sensitive Jump Threading
Michael Beck's avatar
Michael Beck committed
23
24
25
 * @date    10. Sep. 2006
 * @author  Christoph Mallon, Matthias Braun
 * @version $Id$
26
 */
27
28
#include "config.h"

29
30
#include "iroptimize.h"

31
#include <assert.h>
32
#include "array_t.h"
33
34
#include "debug.h"
#include "ircons.h"
Christoph Mallon's avatar
Christoph Mallon committed
35
36
#include "irgmod.h"
#include "irgopt.h"
37
38
#include "irgwalk.h"
#include "irnode.h"
39
#include "irnode_t.h"
40
#include "iredges.h"
41
#include "iredges_t.h"
42
#include "irtools.h"
43
#include "irgraph.h"
44
#include "tv.h"
45
#include "opt_confirms.h"
46
#include "iropt_dbg.h"
47
#include "irtools.h"
48

49
#undef AVOID_PHIB
50

51
52
DEBUG_ONLY(static firm_dbg_module_t *dbg);

Christoph Mallon's avatar
Christoph Mallon committed
53
54
55
56
57
58
59
60
61
62
63
64
65
/**
 * Add the new predecessor x to node node, which is either a Block or a Phi
 */
static void add_pred(ir_node* node, ir_node* x)
{
	ir_node** ins;
	int n;
	int i;

	assert(is_Block(node) || is_Phi(node));

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

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

84
	/* This is needed because we create bads sometimes */
85
	if (is_Bad(block))
86
		return new_Bad();
87

88
89
90
91
92
93
94
95
96
	/* the other defs can't be marked for cases where a user of the original
	 * value is in the same block as the alternative definition.
	 * In this case we mustn't use the alternative definition.
	 * So we keep a flag that indicated wether we walked at least 1 block
	 * away and may use the alternative definition */
	if (block == ssa_second_def_block && !first) {
		return ssa_second_def;
	}

97
	/* already processed this block? */
98
	if (irn_visited(block)) {
99
100
101
102
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

Matthias Braun's avatar
Matthias Braun committed
103
104
105
	irg = get_irn_irg(block);
	assert(block != get_irg_start_block(irg));

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

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

117
	/* create a new Phi */
Christoph Mallon's avatar
Christoph Mallon committed
118
	NEW_ARR_A(ir_node*, in, n_cfgpreds);
119
120
121
	for(i = 0; i < n_cfgpreds; ++i)
		in[i] = new_Unknown(mode);

122
	phi = new_r_Phi(block, n_cfgpreds, in, mode);
123
124
125
	set_irn_link(block, phi);
	mark_irn_visited(block);

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

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

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

150
151
152
153
	/* no need to do anything */
	if (orig_val == second_val)
		return;

154
	irg = get_irn_irg(orig_val);
155
156
	inc_irg_visited(irg);

157
158
159
	mode = get_irn_mode(orig_val);
	set_irn_link(orig_block, orig_val);
	mark_irn_visited(orig_block);
160

161
162
	ssa_second_def_block = second_block;
	ssa_second_def       = second_val;
163

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

171
172
		/* ignore keeps */
		if (is_End(user))
173
			continue;
174
175
176

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

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

184
		/* don't fix newly created Phis from the SSA construction */
185
186
187
		if (newval != user) {
			DB((dbg, LEVEL_4, ">>>> Setting input %d of %+F to %+F\n", j, user, newval));
			set_irn_n(user, j, newval);
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;
Christoph Mallon's avatar
Christoph Mallon committed
197

198
199
	in[0] = get_Block_cfgpred(block, pos);
	new_block = new_r_Block(irg, 1, in);
200
	new_jmp = new_r_Jmp(new_block);
201
	set_Block_cfgpred(block, pos, new_jmp);
Christoph Mallon's avatar
Christoph Mallon committed
202
203
}

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

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

217
218
219
220
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
221
222
223
224
225
226
	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);
227
		/* we might have to evaluate a Phi-cascade */
228
		if (get_irn_visited(copy) >= env->visited_nr) {
Matthias Braun's avatar
Matthias Braun committed
229
230
231
232
233
234
235
236
237
238
239
240
241
			copy = get_irn_link(copy);
		}
	} else {
		copy = exact_copy(node);
		set_nodes_block(copy, copy_block);

		assert(get_irn_mode(copy) != mode_X);

		arity = get_irn_arity(copy);
		for(i = 0; i < arity; ++i) {
			ir_node *pred     = get_irn_n(copy, i);
			ir_node *new_pred;

242
			if (get_nodes_block(pred) != block)
Matthias Braun's avatar
Matthias Braun committed
243
244
				continue;

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

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

	return copy;
}

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

		if (is_Block(node)) {
			/* Block->Block edge, should be the MacroBlock edge */
			assert(get_Block_MacroBlock(node) == block && "Block->Block edge found");
			continue;
		}
277
278

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

302
				if (user_block == block)
303
304
305
306
307
308
309
310
311
					continue;

				cmp_copy = exact_copy(pred);
				set_nodes_block(cmp_copy, user_block);
				copy = new_r_Proj(current_ir_graph, user_block, cmp_copy, mode_b, pn);
				set_irn_n(user, pos, copy);
			}
			continue;
		}
312
#endif
Christoph Mallon's avatar
Christoph Mallon committed
313

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

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

326
327
328
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
329
		ir_node *copy_node;
330
331
332
333
334
335
336
		ir_mode *mode;

		if (is_Block(node)) {
			/* Block->Block edge, should be the MacroBlock edge */
			assert(get_Block_MacroBlock(node) == block && "Block->Block edge found");
			continue;
		}
337

338
		mode = get_irn_mode(node);
339
		if (mode == mode_X || is_Cond(node))
340
			continue;
341
#ifdef AVOID_PHIB
342
		if (mode == mode_b)
343
			continue;
344
#endif
345

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

348
349
		copy_node = get_irn_link(node);
		construct_ssa(block, node, copy_block, copy_node);
350
351
352
	}
}

353
/**
Michael Beck's avatar
Michael Beck committed
354
 * returns whether the cmp evaluates to true or false, or can't be evaluated!
355
 * 1: true, 0: false, -1: can't evaluate
356
357
358
359
 *
 * @param pnc       the compare mode of the Compare
 * @param tv_left   the left tarval
 * @param tv_right  the right tarval
360
 */
361
362
static int eval_cmp_tv(pn_Cmp pnc, tarval *tv_left, tarval *tv_right)
{
363
	pn_Cmp cmp_result = tarval_cmp(tv_left, tv_right);
364

365
366
	/* does the compare evaluate to true? */
	if (cmp_result == pn_Cmp_False)
367
		return -1;
368
	if ((cmp_result & pnc) != cmp_result)
369
370
371
372
373
		return 0;

	return 1;
}

374
/**
375
376
377
378
379
 * 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
380
 */
381
382
static int eval_cmp(jumpthreading_env_t *env, ir_node *cand)
{
383
384
385
386
387
388
389
390
391
392
393
	if (is_Const(cand)) {
		tarval *tv_cand   = get_Const_tarval(cand);
		tarval *tv_cmp    = get_Const_tarval(env->cnst);

		return eval_cmp_tv(env->pnc, tv_cand, tv_cmp);
	} else { /* a Confirm */
		tarval *res = computed_value_Cmp_Confirm(env->cmp, cand, env->cnst, env->pnc);

		if (res == tarval_bad)
			return -1;
		return res == tarval_b_true;
394
	}
395
396
397
398
399
}

/**
 * Check for Const or Confirm with Const.
 */
400
401
static int is_Const_or_Confirm(const ir_node *node)
{
402
403
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
404
405
406
407
	return is_Const(node);
}

/**
408
 * get the tarval of a Const or Confirm with
409
 */
410
411
static tarval *get_Const_or_Confirm_tarval(const ir_node *node)
{
412
	if (is_Confirm(node)) {
413
		if (get_Confirm_bound(node))
414
415
416
417
418
			node = get_Confirm_bound(node);
	}
	return get_Const_tarval(node);
}

419
420
static ir_node *find_const_or_confirm(jumpthreading_env_t *env, ir_node *jump,
                                      ir_node *value)
421
{
422
423
	ir_node *block = get_nodes_block(jump);

424
	if (irn_visited_else_mark(value))
425
426
		return NULL;

427
428
	if (is_Const_or_Confirm(value)) {
		if (eval_cmp(env, value) <= 0) {
429
			return NULL;
430
		}
Christoph Mallon's avatar
Christoph Mallon committed
431
432
433

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
434
			"> Found jump threading candidate %+F->%+F\n",
435
			env->true_block, block
Christoph Mallon's avatar
Christoph Mallon committed
436
437
		));

438
		/* adjust true_block to point directly towards our jump */
439
		add_pred(env->true_block, jump);
440

441
		split_critical_edge(env->true_block, 0);
442

443
		/* we need a bigger visited nr when going back */
444
		env->visited_nr++;
445

446
447
		return block;
	}
448

449
	if (is_Phi(value)) {
450
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
451

452
		/* the Phi has to be in the same Block as the Jmp */
453
		if (get_nodes_block(value) != block) {
454
			return NULL;
455
		}
456

457
458
459
460
		arity = get_irn_arity(value);
		for(i = 0; i < arity; ++i) {
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
461
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
462

463
			copy_block = find_const_or_confirm(env, cfgpred, phi_pred);
464
			if (copy_block == NULL)
465
466
				continue;

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

470
			if (copy_block == get_nodes_block(cfgpred)) {
471
				env->cnst_pred = block;
472
				env->cnst_pos  = i;
473
			}
474

475
			/* return now as we can't process more possibilities in 1 run */
476
			return copy_block;
477
		}
Christoph Mallon's avatar
Christoph Mallon committed
478
	}
479

480
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
481
482
}

483
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
484
                               ir_node *value)
485
{
486
487
	ir_node *block = get_nodes_block(jump);

488
	if (irn_visited_else_mark(value)) {
489
		return NULL;
490
	}
491

492
	if (is_Const_or_Confirm(value)) {
493
		tarval *tv = get_Const_or_Confirm_tarval(value);
494

495
		if (tv != env->tv)
496
497
498
499
			return NULL;

		DB((
			dbg, LEVEL_1,
yb9976's avatar
yb9976 committed
500
			"> Found jump threading candidate %+F->%+F\n",
501
502
503
			env->true_block, block
		));

504
		/* adjust true_block to point directly towards our jump */
505
506
507
		add_pred(env->true_block, jump);

		split_critical_edge(env->true_block, 0);
508

509
		/* we need a bigger visited nr when going back */
510
		env->visited_nr++;
511

512
		return block;
513
	}
514
	if (is_Phi(value)) {
515
		int i, arity;
516

517
		/* the Phi has to be in the same Block as the Jmp */
518
		if (get_nodes_block(value) != block)
519
			return NULL;
520

521
522
523
524
525
		arity = get_irn_arity(value);
		for(i = 0; i < arity; ++i) {
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred  = get_Block_cfgpred(block, i);
526

527
			copy_block = find_candidate(env, cfgpred, phi_pred);
528
			if (copy_block == NULL)
529
530
531
532
533
				continue;

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

534
			if (copy_block == get_nodes_block(cfgpred)) {
535
536
537
538
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

539
			/* return now as we can't process more possibilities in 1 run */
540
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
541
		}
542
	}
543
	if (is_Proj(value)) {
544
545
546
547
		ir_node *left;
		ir_node *right;
		int      pnc;
		ir_node *cmp = get_Proj_pred(value);
548
		if (!is_Cmp(cmp))
549
			return NULL;
550

551
552
553
		left  = get_Cmp_left(cmp);
		right = get_Cmp_right(cmp);
		pnc   = get_Proj_proj(value);
554

555
556
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
557
		if (is_Const(left)) {
558
559
560
			ir_node *t = left;
			left       = right;
			right      = t;
561

562
563
			pnc        = get_inversed_pnc(pnc);
		}
564

565
		if (!is_Const(right))
566
			return 0;
567

568
		if (get_nodes_block(left) != block) {
569
570
			return 0;
		}
571

572
		/* negate condition when we're looking for the false block */
573
		if (env->tv == tarval_b_false) {
574
			pnc = get_negated_pnc(pnc, get_irn_mode(right));
575
		}
576

577
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
578
		env->cmp  = cmp;
579
580
581
		env->pnc  = pnc;
		env->cnst = right;

582
		return find_const_or_confirm(env, jump, left);
583
	}
584

585
586
	return NULL;
}
587
588
589
590
591
592
593
594
595
596
597
598
599
600

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
601
static void thread_jumps(ir_node* block, void* data)
602
{
603
	jumpthreading_env_t env;
604
	int *changed = data;
605
	ir_node *selector;
606
607
	ir_node *projx;
	ir_node *cond;
608
	ir_node *copy_block;
609
	int      selector_evaluated;
610
	const ir_edge_t *edge, *next;
611
	ir_node *bad;
612
	size_t   cnst_pos;
613

614
	if (get_Block_n_cfgpreds(block) != 1)
615
616
617
618
619
620
621
622
623
624
625
		return;

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

	cond = get_Proj_pred(projx);
	if (!is_Cond(cond))
		return;

626
	selector = get_Cond_selector(cond);
627
	/* TODO handle switch Conds */
628
	if (get_irn_mode(selector) != mode_b)
629
		return;
630

Michael Beck's avatar
Michael Beck committed
631
	/* handle cases that can be immediately evaluated */
632
	selector_evaluated = -1;
633
	if (is_Proj(selector)) {
634
		ir_node *cmp = get_Proj_pred(selector);
635
		if (is_Cmp(cmp)) {
636
637
			ir_node *left  = get_Cmp_left(cmp);
			ir_node *right = get_Cmp_right(cmp);
638
			if (is_Const(left) && is_Const(right)) {
639
640
641
642
				int     pnc      = get_Proj_proj(selector);
				tarval *tv_left  = get_Const_tarval(left);
				tarval *tv_right = get_Const_tarval(right);

643
				selector_evaluated = eval_cmp_tv(pnc, tv_left, tv_right);
644
				if (selector_evaluated < 0)
645
					return;
646
647
			}
		}
648
	} else if (is_Const_or_Confirm(selector)) {
649
		tarval *tv = get_Const_or_Confirm_tarval(selector);
650
		if (tv == tarval_b_true) {
651
652
			selector_evaluated = 1;
		} else {
653
			assert(tv == tarval_b_false);
654
655
656
657
658
			selector_evaluated = 0;
		}
	}

	env.cnst_pred = NULL;
659
	if (get_Proj_proj(projx) == pn_Cond_false) {
660
		env.tv = tarval_b_false;
661
		if (selector_evaluated >= 0)
662
			selector_evaluated = !selector_evaluated;
663
	} else {
664
		env.tv = tarval_b_true;
665
666
	}

667
	if (selector_evaluated == 0) {
668
669
670
671
		bad = new_Bad();
		exchange(projx, bad);
		*changed = 1;
		return;
672
	} else if (selector_evaluated == 1) {
673
		dbg_info *dbgi = get_irn_dbg_info(selector);
674
		ir_node  *jmp  = new_rd_Jmp(dbgi, get_nodes_block(projx));
yb9976's avatar
yb9976 committed
675
		DBG_OPT_JUMPTHREADING(projx, jmp);
676
677
678
679
680
		exchange(projx, jmp);
		*changed = 1;
		return;
	}

681
	/* (recursively) look if a pred of a Phi is a constant or a Confirm */
682
683
684
685
686
687
	env.true_block = block;
	inc_irg_visited(current_ir_graph);
	env.visited_nr = get_irg_visited(current_ir_graph);

	copy_block = find_candidate(&env, projx, selector);
	if (copy_block == NULL)
688
689
		return;

690
	/* we have to remove the edge towards the pred as the pred now
691
	 * jumps into the true_block. We also have to shorten Phis
692
693
694
695
	 * in our block because of this */
	bad      = new_Bad();
	cnst_pos = env.cnst_pos;

696
	/* shorten Phis */
697
698
699
	foreach_out_edge_safe(env.cnst_pred, edge, next) {
		ir_node *node = get_edge_src_irn(edge);

700
		if (is_Phi(node))
701
702
703
704
705
706
707
			set_Phi_pred(node, cnst_pos, bad);
	}

	set_Block_cfgpred(env.cnst_pred, cnst_pos, bad);

	/* the graph is changed now */
	*changed = 1;
708
709
}

710
void opt_jumpthreading(ir_graph* irg)
711
{
Michael Beck's avatar
Michael Beck committed
712
	int changed, rerun;
713

714
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
715

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

Christoph Mallon's avatar
Christoph Mallon committed
718
	remove_critical_cf_edges(irg);
719

Michael Beck's avatar
Michael Beck committed
720
	edges_assure(irg);
721
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
722

Michael Beck's avatar
Michael Beck committed
723
	changed = 0;
724
	do {
Michael Beck's avatar
Michael Beck committed
725
		rerun = 0;
726
		irg_block_walk_graph(irg, thread_jumps, NULL, &rerun);
Michael Beck's avatar
Michael Beck committed
727
728
729
		changed |= rerun;
	} while (rerun);

730
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
731

Michael Beck's avatar
Michael Beck committed
732
733
	if (changed) {
		/* control flow changed, some blocks may become dead */
734
		set_irg_outs_inconsistent(irg);
Michael Beck's avatar
Michael Beck committed
735
736
737
		set_irg_doms_inconsistent(irg);
		set_irg_extblk_inconsistent(irg);
		set_irg_loopinfo_inconsistent(irg);
738
		set_irg_entity_usage_state(irg, ir_entity_usage_not_computed);
739
740
741
742

		/* Dead code might be created. Optimize it away as it is dangerous
		 * to call optimize_df() an dead code. */
		optimize_cf(irg);
Michael Beck's avatar
Michael Beck committed
743
	}
744
}
745
746
747
748
749
750

/* Creates an ir_graph pass for opt_jumpthreading. */
ir_graph_pass_t *opt_jumpthreading_pass(const char *name, int verify, int dump)
{
	return def_graph_pass(name ? name : "jumpthreading", verify, dump, opt_jumpthreading);
}  /* opt_jumpthreading_pass */