jumpthreading.c 18.8 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
/**
 * Add the new predecessor x to node node, which is either a Block or a Phi
 */
Matthias Braun's avatar
Matthias Braun committed
40
static void add_pred(ir_node *node, ir_node *x)
Christoph Mallon's avatar
Christoph Mallon committed
41
{
Matthias Braun's avatar
Matthias Braun committed
42
43
44
	int        const n   = get_Block_n_cfgpreds(node);
	ir_node  **const ins = ALLOCAN(ir_node*, n+1);
	foreach_irn_in(node, i, pred) {
45
		ins[i] = pred;
Matthias Braun's avatar
Matthias Braun committed
46
	}
Christoph Mallon's avatar
Christoph Mallon committed
47
48
49
50
	ins[n] = x;
	set_irn_in(node, n + 1, ins);
}

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,
Matthias Braun's avatar
Matthias Braun committed
55
                                           bool first)
Christoph Mallon's avatar
Christoph Mallon committed
56
{
57
	assert(is_Block(block));
58

59
60
61
	/* 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
62
	 * So we keep a flag that indicated whether we walked at least 1 block
63
	 * away and may use the alternative definition */
Matthias Braun's avatar
Matthias Braun committed
64
	if (block == ssa_second_def_block && !first)
65
66
		return ssa_second_def;

67
	/* already processed this block? */
68
	if (irn_visited(block)) {
69
70
71
72
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

Matthias Braun's avatar
Matthias Braun committed
73
	ir_graph *irg = get_irn_irg(block);
Matthias Braun's avatar
Matthias Braun committed
74
75
	assert(block != get_irg_start_block(irg));

Christoph Mallon's avatar
Christoph Mallon committed
76
	/* a Block with only 1 predecessor needs no Phi */
Matthias Braun's avatar
Matthias Braun committed
77
	int n_cfgpreds = get_Block_n_cfgpreds(block);
78
	if (n_cfgpreds == 1) {
79
		ir_node *pred_block = get_Block_cfgpred_block(block, 0);
80
81
82
83
84
85
86
		ir_node *value;
		if (pred_block == NULL) {
			ir_graph *irg = get_irn_irg(block);
			value = new_r_Bad(irg, mode);
		} else {
			value = search_def_and_create_phis(pred_block, mode, false);
		}
87
88
89
90
91
		set_irn_link(block, value);
		mark_irn_visited(block);
		return value;
	}

92
	/* create a new Phi */
Matthias Braun's avatar
Matthias Braun committed
93
94
	ir_node **in    = ALLOCAN(ir_node*, n_cfgpreds);
	ir_node  *dummy = new_r_Dummy(irg, mode);
Matthias Braun's avatar
Matthias Braun committed
95
	for (int i = 0; i < n_cfgpreds; ++i) {
96
		in[i] = dummy;
Matthias Braun's avatar
Matthias Braun committed
97
	}
98

99
100
101
	/* we might have created a potential endless loop, and need a PhiLoop */
	ir_node *phi = mode == mode_M ? new_r_Phi_loop(block, n_cfgpreds, in)
	                              : new_r_Phi(block, n_cfgpreds, in, mode);
102
103
104
	set_irn_link(block, phi);
	mark_irn_visited(block);

105
	/* set Phi predecessors */
Matthias Braun's avatar
Matthias Braun committed
106
	for (int i = 0; i < n_cfgpreds; ++i) {
107
		ir_node *pred_block = get_Block_cfgpred_block(block, i);
108
109
110
111
112
113
114
		ir_node *pred_val;
		if (pred_block == NULL) {
			ir_graph *irg = get_irn_irg(block);
			pred_val = new_r_Bad(irg, mode);
		} else {
			pred_val = search_def_and_create_phis(pred_block, mode, false);
		}
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
	/* no need to do anything */
130
	if (orig_val == second_val && !(is_Phi(orig_val) && get_Phi_loop(orig_val)))
131
132
		return;

Matthias Braun's avatar
Matthias Braun committed
133
	ir_graph *irg = get_irn_irg(orig_val);
134
135
	inc_irg_visited(irg);

Matthias Braun's avatar
Matthias Braun committed
136
	ir_mode *mode = get_irn_mode(orig_val);
137
138
	set_irn_link(orig_block, orig_val);
	mark_irn_visited(orig_block);
139

140
141
142
143
144
145
146
	if (orig_val == second_val) {
		/* In the loop-phi case setting a 2nd def is wrong */
		ssa_second_def_block = NULL;
	} else {
		ssa_second_def_block = second_block;
		ssa_second_def       = second_val;
	}
147

148
	/* Only fix the users of the first, i.e. the original node */
149
	foreach_out_edge_safe(orig_val, edge) {
150
		ir_node *user = get_edge_src_irn(edge);
151
152
		/* ignore keeps */
		if (is_End(user))
153
			continue;
154

Matthias Braun's avatar
Matthias Braun committed
155
156
157
		int j = get_edge_src_pos(edge);
		DB((dbg, LEVEL_3, ">>> Fixing user %+F (pred %d == %+F)\n", user, j,
		    get_irn_n(user, j)));
158

Matthias Braun's avatar
Matthias Braun committed
159
160
		ir_node *user_block = get_nodes_block(user);
		ir_node *newval;
161
		if (is_Phi(user)) {
162
			ir_node *pred_block = get_Block_cfgpred_block(user_block, j);
163
164
165
166
167
168
			if (pred_block == NULL) {
				ir_graph *irg = get_irn_irg(user_block);
				newval = new_r_Bad(irg, mode);
			} else {
				newval = search_def_and_create_phis(pred_block, mode, true);
			}
169
		} else {
Matthias Braun's avatar
Matthias Braun committed
170
			newval = search_def_and_create_phis(user_block, mode, true);
171
172
		}

173
		/* don't fix newly created Phis from the SSA construction */
174
		if (newval != user) {
Matthias Braun's avatar
Matthias Braun committed
175
176
			DB((dbg, LEVEL_4, ">>>> Setting input %d of %+F to %+F\n", j, user,
			    newval));
177
			set_irn_n(user, j, newval);
178
179
180
181
182
			if (is_Phi(user) && get_irn_mode(user) == mode_M && !get_Phi_loop(user)) {
				set_Phi_loop(user, true);
				keep_alive(user);
				keep_alive(user_block);
			}
183
184
185
186
		}
	}
}

187
188
189
190
191
192
193
194
195
196
/**
 * jumpthreading produces critical edges, e.g. B-C:
 *     A         A
 *  \ /       \  |
 *   B    =>   B |
 *  / \       / \|
 *     C         C
 *
 * By splitting this critical edge more threadings might be possible.
 */
197
198
static void split_critical_edge(ir_node *block, int pos)
{
Matthias Braun's avatar
Matthias Braun committed
199
200
201
202
	ir_graph *irg       = get_irn_irg(block);
	ir_node  *in[]      = { get_Block_cfgpred(block, pos) };
	ir_node  *new_block = new_r_Block(irg, ARRAY_SIZE(in), in);
	ir_node  *new_jmp   = new_r_Jmp(new_block);
203
204
205
	set_Block_cfgpred(block, pos, new_jmp);
}

206
typedef struct jumpthreading_env_t {
207
208
209
210
	ir_node      *true_block;  /**< Block we try to thread into */
	ir_node      *cmp;         /**< The Compare node that might be partial
	                                evaluated */
	ir_relation   relation;    /**< The Compare mode of the Compare node. */
Matthias Braun's avatar
Matthias Braun committed
211
212
213
214
215
216
	ir_node      *cnst;
	ir_tarval    *tv;
	ir_visited_t  visited_nr;
	ir_node      *cnst_pred;   /**< the block before the constant */
	int           cnst_pos;    /**< the pos to the constant block (needed to
	                                kill that edge later) */
217
} jumpthreading_env_t;
Christoph Mallon's avatar
Christoph Mallon committed
218

219
220
221
222
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
223
	/* we can evaluate Phis right now, all other nodes get copied */
Matthias Braun's avatar
Matthias Braun committed
224
	ir_node *copy;
Matthias Braun's avatar
Matthias Braun committed
225
226
	if (is_Phi(node)) {
		copy = get_Phi_pred(node, j);
227
		/* we might have to evaluate a Phi-cascade */
Matthias Braun's avatar
Matthias Braun committed
228
		if (get_irn_visited(copy) >= env->visited_nr)
229
			copy = (ir_node*)get_irn_link(copy);
Matthias Braun's avatar
Matthias Braun committed
230
231
232
233
234
	} else {
		copy = exact_copy(node);
		set_nodes_block(copy, copy_block);
		assert(get_irn_mode(copy) != mode_X);

235
		foreach_irn_in(copy, i, pred) {
236
			if (get_nodes_block(pred) != block)
Matthias Braun's avatar
Matthias Braun committed
237
238
				continue;

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

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

255
256
257
static void copy_and_fix(const jumpthreading_env_t *env, ir_node *block,
                         ir_node *copy_block, int j)
{
Matthias Braun's avatar
Matthias Braun committed
258
	/* Look at all nodes in the cond_block and copy them into copy_block */
259
260
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
Andreas Zwinkau's avatar
Andreas Zwinkau committed
261
		if (is_End(node)) {
262
			/* edge is a Keep edge. If the end block is unreachable via normal
Matthias Braun's avatar
Matthias Braun committed
263
			 * control flow, we must maintain end's reachability with Keeps. */
Andreas Zwinkau's avatar
Andreas Zwinkau committed
264
265
266
			keep_alive(copy_block);
			continue;
		}
267
		/* ignore control flow */
Matthias Braun's avatar
Matthias Braun committed
268
		ir_mode *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
			ir_node *const pred = get_Proj_pred(node);
277
			unsigned const pn   = get_Proj_num(node);
278

279
			foreach_out_edge_safe(node, edge) {
280
281
				ir_node *user       = get_edge_src_irn(edge);
				ir_node *user_block = get_nodes_block(user);
282
				if (user_block == block)
283
284
					continue;

Matthias Braun's avatar
Matthias Braun committed
285
286
				int      pos      = get_edge_src_pos(edge);
				ir_node *cmp_copy = exact_copy(pred);
287
				set_nodes_block(cmp_copy, user_block);
Matthias Braun's avatar
Matthias Braun committed
288
				ir_node *copy = new_r_Proj(cmp_copy, mode_b, pn);
289
290
291
292
				set_irn_n(user, pos, copy);
			}
			continue;
		}
293
#endif
Matthias Braun's avatar
Matthias Braun committed
294
		ir_node *copy = copy_and_fix_node(env, block, copy_block, j, node);
295
296

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

306
307
308
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
Matthias Braun's avatar
Matthias Braun committed
309
		ir_mode *mode = get_irn_mode(node);
Matthias Braun's avatar
Matthias Braun committed
310
		if (mode == mode_X || is_Cond(node) || is_Switch(node))
311
			continue;
312
#ifdef AVOID_PHIB
313
		if (mode == mode_b)
314
			continue;
315
#endif
316

Matthias Braun's avatar
Matthias Braun committed
317
		ir_node *copy_node = (ir_node*)get_irn_link(node);
318
		DB((dbg, LEVEL_2, ">> Fixing users of %+F (copy %+F)\n", node, copy_node));
319
		construct_ssa(block, node, copy_block, copy_node);
320
	}
321

322
	/* make sure copied PhiM nodes are kept alive if old nodes were */
323
324
325
326
327
328
329
	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);
330
331
		/* exact copy does not reproduce the keep alive edges */
		if (is_Phi(copy) && get_Phi_loop(copy))
332
			add_End_keepalive(end, copy);
333
	}
334
335
}

336
/**
Matthias Braun's avatar
Matthias Braun committed
337
 * Returns whether the cmp evaluates to true or false, or can't be evaluated!
338
 *
339
 * @param relation  the compare mode of the Compare
340
341
 * @param tv_left   the left tarval
 * @param tv_right  the right tarval
Matthias Braun's avatar
Matthias Braun committed
342
 * @returns 1: true, 0: false, -1: can't evaluate
343
 */
344
345
static int eval_cmp_tv(ir_relation relation, ir_tarval *tv_left,
                       ir_tarval *tv_right)
346
{
347
	/* does the compare evaluate to true? */
Matthias Braun's avatar
Matthias Braun committed
348
	ir_relation cmp_result = tarval_cmp(tv_left, tv_right);
349
	if (cmp_result == ir_relation_false)
350
		return -1;
351
352
	if ((cmp_result & relation) != 0)
		return 1;
353

354
	return 0;
355
356
}

357
/**
Matthias Braun's avatar
Matthias Braun committed
358
 * Returns whether the cmp evaluates to true or false, or can't be evaluated!
359
360
361
 *
 * @param env      the environment
 * @param cand     the candidate node, either a Const or a Confirm
Matthias Braun's avatar
Matthias Braun committed
362
 * @returns 1: true, 0: false, -1: can't evaluate
363
 */
364
365
static int eval_cmp(jumpthreading_env_t *env, ir_node *cand)
{
366
	if (is_Const(cand)) {
367
368
369
		ir_tarval *tv_cand = get_Const_tarval(cand);
		ir_tarval *tv_cmp  = get_Const_tarval(env->cnst);
		return eval_cmp_tv(env->relation, tv_cand, tv_cmp);
Matthias Braun's avatar
Matthias Braun committed
370
371
372
373
	} else {
		assert(is_Confirm(cand));
		ir_tarval *res = computed_value_Cmp_Confirm(env->cmp, cand, env->cnst,
		                                            env->relation);
374
		if (!tarval_is_constant(res))
375
376
			return -1;
		return res == tarval_b_true;
377
	}
378
379
380
381
382
}

/**
 * Check for Const or Confirm with Const.
 */
Matthias Braun's avatar
Matthias Braun committed
383
static bool is_Const_or_Confirm(const ir_node *node)
384
{
385
386
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
387
388
389
390
	return is_Const(node);
}

/**
391
 * get the tarval of a Const or Confirm with
392
 */
Matthias Braun's avatar
Matthias Braun committed
393
static ir_tarval *get_Const_or_Confirm_tarval(const ir_node *node)
394
{
Matthias Braun's avatar
Matthias Braun committed
395
396
	if (is_Confirm(node))
		node = get_Confirm_bound(node);
397
398
399
	return get_Const_tarval(node);
}

400
401
static ir_node *find_const_or_confirm(jumpthreading_env_t *env, ir_node *jump,
                                      ir_node *value)
402
{
403
	if (irn_visited_else_mark(value))
404
405
		return NULL;

Matthias Braun's avatar
Matthias Braun committed
406
	ir_node *block = get_nodes_block(jump);
407
	if (is_Const_or_Confirm(value)) {
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
		int evaluated = eval_cmp(env, value);
		if (evaluated < 0)
			return NULL;
		/* maybe we could evaluate the condition completely without any
		 * partial tracking along paths. */
		if (block == get_nodes_block(env->cmp)) {
			if (evaluated == 0) {
				ir_graph *irg = get_irn_irg(block);
				ir_node  *bad = new_r_Bad(irg, mode_X);
				exchange(jump, bad);
			} else if (evaluated == 1) {
				dbg_info *dbgi = get_irn_dbg_info(skip_Proj(jump));
				ir_node  *jmp  = new_rd_Jmp(dbgi, get_nodes_block(jump));
				exchange(jump, jmp);
			}
Matthias Braun's avatar
Matthias Braun committed
423
424
			/* we need a bigger visited nr when going back */
			env->visited_nr++;
425
426
427
			return block;
		}
		if (evaluated <= 0)
428
			return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
429

Matthias Braun's avatar
Matthias Braun committed
430
431
		DB((dbg, LEVEL_1, "> Found jump threading candidate %+F->%+F\n",
			block, env->true_block));
Christoph Mallon's avatar
Christoph Mallon committed
432

433
		/* adjust true_block to point directly towards our jump */
434
		add_pred(env->true_block, jump);
435

436
437
		split_critical_edge(env->true_block, 0);

438
		/* we need a bigger visited nr when going back */
439
440
441
		env->visited_nr++;
		return block;
	}
442

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

448
		foreach_irn_in(value, i, phi_pred) {
Matthias Braun's avatar
Matthias Braun committed
449
450
			ir_node *cfgpred    = get_Block_cfgpred(block, i);
			ir_node *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
			if (copy_block == get_nodes_block(cfgpred)) {
457
				env->cnst_pred = block;
458
				env->cnst_pos  = i;
459
			}
460

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

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

469
static ir_node *find_candidate(jumpthreading_env_t *env, ir_node *jump,
470
                               ir_node *value)
471
{
Matthias Braun's avatar
Matthias Braun committed
472
	if (irn_visited_else_mark(value))
473
474
		return NULL;

Matthias Braun's avatar
Matthias Braun committed
475
	ir_node *block = get_nodes_block(jump);
476
	if (is_Const_or_Confirm(value)) {
Matthias Braun's avatar
Matthias Braun committed
477
		ir_tarval *tv = get_Const_or_Confirm_tarval(value);
478
		if (tv != env->tv)
479
480
			return NULL;

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

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

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

489
		/* we need a bigger visited nr when going back */
490
491
		env->visited_nr++;
		return block;
492
	}
493
	if (is_Phi(value)) {
494
		/* the Phi has to be in the same Block as the Jmp */
495
		if (get_nodes_block(value) != block)
496
			return NULL;
497

498
		foreach_irn_in(value, i, phi_pred) {
Matthias Braun's avatar
Matthias Braun committed
499
500
			ir_node *cfgpred    = get_Block_cfgpred(block, i);
			ir_node *copy_block = find_candidate(env, cfgpred, phi_pred);
501
			if (copy_block == NULL)
502
503
504
505
				continue;

			/* copy duplicated nodes in copy_block and fix SSA */
			copy_and_fix(env, block, copy_block, i);
506
			if (copy_block == get_nodes_block(cfgpred)) {
507
508
509
510
				env->cnst_pred = block;
				env->cnst_pos  = i;
			}

511
			/* return now as we can't process more possibilities in 1 run */
512
			return copy_block;
Christoph Mallon's avatar
Christoph Mallon committed
513
		}
514
	}
515
516
517
518
519
	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);
520

521
522
		/* we assume that the constant is on the right side, swap left/right
		 * if needed */
523
		if (is_Const(left)) {
524
525
526
			ir_node *t = left;
			left       = right;
			right      = t;
527

528
			relation   = get_inversed_relation(relation);
529
		}
530

531
		if (!is_Const(right))
532
533
534
			return NULL;
		if (get_nodes_block(left) != block)
			return NULL;
535
		/* negate condition when we're looking for the false block */
Matthias Braun's avatar
Matthias Braun committed
536
		if (env->tv == tarval_b_false)
537
			relation = get_negated_relation(relation);
538

539
		/* (recursively) look if a pred of a Phi is a constant or a Confirm */
540
541
542
		env->cmp      = cmp;
		env->relation = relation;
		env->cnst     = right;
543
		return find_const_or_confirm(env, jump, left);
544
	}
545

546
547
	return NULL;
}
548
549
550
551
552
553
554
555
556
557
558
559
560
561

/**
 * Block-walker: searches for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
 */
562
static void thread_jumps(ir_node* block, void* data)
563
{
564
	bool *changed = (bool*)data;
565

566
	/* we do not deal with Phis, so restrict this to exactly one cfgpred */
567
	if (get_Block_n_cfgpreds(block) != 1)
568
569
		return;

Matthias Braun's avatar
Matthias Braun committed
570
	ir_node *projx = get_Block_cfgpred(block, 0);
571
572
573
	if (!is_Proj(projx))
		return;

Matthias Braun's avatar
Matthias Braun committed
574
	ir_node *cond = get_Proj_pred(projx);
575
	/* TODO handle switch Conds */
Matthias Braun's avatar
Matthias Braun committed
576
	if (!is_Cond(cond))
577
		return;
578

579
	/* (recursively) look if a pred of a Phi is a constant or a Confirm */
580
581
	ir_node  *selector = get_Cond_selector(cond);
	ir_graph *irg      = get_irn_irg(block);
582
583
584
585
586
587
588
589
590
591
592
593
	if (is_Const(selector)) {
		const ir_tarval *tv = get_Const_tarval(selector);
		assert(tv == tarval_b_false || tv == tarval_b_true);
		ir_node    *const cond_block = get_nodes_block(cond);
		ir_node    *const jmp        = new_r_Jmp(cond_block);
		ir_node    *const bad        = new_r_Bad(irg, mode_X);
		const bool        is_true    = tv == tarval_b_true;
		ir_node *const in[] = {
			[pn_Cond_false] = is_true ? bad : jmp,
			[pn_Cond_true]  = is_true ? jmp : bad,
		};
		turn_into_tuple(cond, ARRAY_SIZE(in), in);
594
		*changed = true;
595
596
		return;
	}
597
	inc_irg_visited(irg);
598
599
	jumpthreading_env_t env;
	env.cnst_pred  = NULL;
600
	env.tv         = get_Proj_num(projx) == pn_Cond_false
601
602
	                 ? tarval_b_false : tarval_b_true;
	env.true_block = block;
603
	env.visited_nr = get_irg_visited(irg);
604

Matthias Braun's avatar
Matthias Braun committed
605
	ir_node *copy_block = find_candidate(&env, projx, selector);
606
	if (copy_block == NULL)
607
608
		return;

609
610
611
612
	if (copy_block != get_nodes_block(cond)) {
		/* We might thread the condition block of an infinite loop,
		 * such that there is no path to End anymore. */
		keep_alive(block);
Andreas Zwinkau's avatar
Andreas Zwinkau committed
613

614
615
616
617
618
		/* we have to remove the edge towards the pred as the pred now
		 * jumps into the true_block. We also have to shorten Phis
		 * in our block because of this */
		ir_node *badX     = new_r_Bad(irg, mode_X);
		int      cnst_pos = env.cnst_pos;
619

620
621
622
		/* shorten Phis */
		foreach_out_edge_safe(env.cnst_pred, edge) {
			ir_node *node = get_edge_src_irn(edge);
623

624
625
626
627
			if (is_Phi(node)) {
				ir_node *bad = new_r_Bad(irg, get_irn_mode(node));
				set_Phi_pred(node, cnst_pos, bad);
			}
Matthias Braun's avatar
Matthias Braun committed
628
		}
629

630
631
		set_Block_cfgpred(env.cnst_pred, cnst_pos, badX);
	}
632
633

	/* the graph is changed now */
634
	*changed = true;
635
636
}

637
void opt_jumpthreading(ir_graph* irg)
638
{
639
640
641
642
	assure_irg_properties(irg,
		IR_GRAPH_PROPERTY_NO_UNREACHABLE_CODE
		| IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES
		| IR_GRAPH_PROPERTY_NO_CRITICAL_EDGES);
643

644
	FIRM_DBG_REGISTER(dbg, "firm.opt.jumpthreading");
645

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

648
	ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
649

Matthias Braun's avatar
Matthias Braun committed
650
651
	bool changed = false;
	bool rerun;
652
	do {
653
		rerun = false;
654
		irg_block_walk_graph(irg, thread_jumps, NULL, &rerun);
Michael Beck's avatar
Michael Beck committed
655
656
657
		changed |= rerun;
	} while (rerun);

658
	ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_IRN_VISITED);
659

660
661
662
663
664
665
666
	if (changed) {
		/* we tend to produce alot of duplicated keep edges, remove them */
		remove_End_Bads_and_doublets(get_irg_end(irg));
		confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
	} else {
		confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_ALL);
	}
667
}