irconsconfirm.c 16.8 KB
Newer Older
Michael Beck's avatar
Michael Beck committed
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Matthias Braun's avatar
Matthias Braun committed
3
4
 *
 * This file is part of libFirm.
Michael Beck's avatar
Michael Beck committed
5
 *
Matthias Braun's avatar
Matthias Braun committed
6
7
8
9
 * 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.
Michael Beck's avatar
Michael Beck committed
10
 *
Matthias Braun's avatar
Matthias Braun committed
11
12
13
14
15
16
17
 * 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
18
 */
19

Matthias Braun's avatar
Matthias Braun committed
20
21
22
23
24
25
26
/**
 * @file
 * @brief    Construction of Confirm nodes
 * @author   Michael Beck
 * @date     6.2005
 * @version  $Id$
 */
Matthias Braun's avatar
Matthias Braun committed
27
#include "config.h"
28

29
30
#include "irconsconfirm.h"

Michael Beck's avatar
Michael Beck committed
31
32
33
34
35
36
#include "irgraph_t.h"
#include "irnode_t.h"
#include "ircons_t.h"
#include "irgmod.h"
#include "iropt_dbg.h"
#include "iredges_t.h"
Michael Beck's avatar
Michael Beck committed
37
#include "irgwalk.h"
Michael Beck's avatar
Michael Beck committed
38
#include "irprintf.h"
39
#include "irgopt.h"
40
#include "irpass.h"
Matthias Braun's avatar
Matthias Braun committed
41
#include "irtools.h"
42
#include "array_t.h"
43
44
#include "debug.h"
#include "irflag.h"
Michael Beck's avatar
Michael Beck committed
45
46
47
48

/**
 * Walker environment.
 */
49
typedef struct env_t {
50
51
52
53
	unsigned num_confirms;  /**< Number of inserted Confirm nodes. */
	unsigned num_consts;    /**< Number of constants placed. */
	unsigned num_eq;        /**< Number of equalities placed. */
	unsigned num_non_null;  /**< Number of non-null Confirms. */
Michael Beck's avatar
Michael Beck committed
54
55
} env_t;

56
57
58
/** The debug handle. */
DEBUG_ONLY(static firm_dbg_module_t *dbg;)

59
60
61
62
63
64
65
66
67
/**
 * Return the effective use block of a node and it's predecessor on
 * position pos.
 *
 * @param node  the node
 * @param pos   the position of the used input
 *
 * This handles correctly Phi nodes.
 */
68
69
static ir_node *get_effective_use_block(ir_node *node, int pos)
{
70
	if (is_Phi(node)) {
71
72
73
		/* the effective use of a Phi argument is in its predecessor block */
		node = get_nodes_block(node);
		return get_Block_cfgpred_block(node, pos);
74
75
	}
	return get_nodes_block(node);
76
77
}

Michael Beck's avatar
Michael Beck committed
78
79
80
81
82
/**
 * Handle a CASE-branch.
 *
 * @param block   the block which is entered by the branch
 * @param irn     the node expressing the switch value
Michael Beck's avatar
Michael Beck committed
83
 * @param nr      the branch label
Michael Beck's avatar
Michael Beck committed
84
85
86
87
88
 * @param env     statistical environment
 *
 * Branch labels are a simple case. We can replace the value
 * by a Const with the branch label.
 */
89
90
static void handle_case(ir_node *block, ir_node *irn, long nr, env_t *env)
{
Michael Beck's avatar
Michael Beck committed
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
	const ir_edge_t *edge, *next;
	ir_node *c = NULL;

	if (is_Bad(irn))
		return;

	for (edge = get_irn_out_edge_first(irn); edge; edge = next) {
		ir_node *succ = get_edge_src_irn(edge);
		int     pos   = get_edge_src_pos(edge);
		ir_node *blk  = get_effective_use_block(succ, pos);

		next = get_irn_out_edge_next(irn, edge);

		if (block_dominates(block, blk)) {
			/*
			 * Ok, we found a user of irn that is placed
			 * in a block dominated by the branch block.
			 * We can replace the input with the Constant
			 * branch label.
			 */

			if (! c) {
				ir_mode *mode = get_irn_mode(irn);
				ir_type *tp   = get_irn_type(irn);
				tarval *tv    = new_tarval_from_long(nr, mode);
116
				c = new_r_Const_type(current_ir_graph, tv, tp);
Michael Beck's avatar
Michael Beck committed
117
118
119
120
			}

			set_irn_n(succ, pos, c);
			DBG_OPT_CONFIRM_C(irn, c);
121
			DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
Michael Beck's avatar
Michael Beck committed
122
123
124
125

			env->num_consts += 1;
		}
	}
126
}  /* handle_case */
Michael Beck's avatar
Michael Beck committed
127

128
129
130
131
132
133
134
135
/**
 * Handle a mode_b input of Cond nodes.
 *
 * @param block     the block which is entered by the branch
 * @param selector  the mode_b node expressing the branch condition
 * @param pnc       the true/false condition branch
 * @param env       statistical environment
 */
136
137
static void handle_modeb(ir_node *block, ir_node *selector, pn_Cond pnc, env_t *env)
{
138
	ir_node *cond, *old, *other_blk = NULL, *con = NULL;
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
	ir_node *c_b = NULL, *c_o = NULL;
	const ir_edge_t *edge, *next;

	for (edge = get_irn_out_edge_first(selector); edge; edge = next) {
		ir_node *user     = get_edge_src_irn(edge);
		int     pos       = get_edge_src_pos(edge);
		ir_node *user_blk = get_effective_use_block(user, pos);

		next = get_irn_out_edge_next(selector, edge);
		if (block_dominates(block, user_blk)) {
			/*
			 * Ok, we found a usage of selector in a block
			 * dominated by the branch block.
			 * We can replace the input with true/false.
			 */
			if (con == NULL) {
155
				con = new_Const(pnc == pn_Cond_true ? tarval_b_true : tarval_b_false);
156
157
158
159
160
			}
			old = get_irn_n(user, pos);
			set_irn_n(user, pos, con);
			DBG_OPT_CONFIRM_C(old, con);

161
			DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, con));
162
163
164
165
166
167
168
169
170
171
172

			env->num_consts += 1;
		} else {
			int i, n;

			/* get the other block */
			if (other_blk == NULL) {
				/* we have already tested, that block has only ONE Cond predecessor */
				cond = get_Proj_pred(get_Block_cfgpred(block, 0));
				foreach_out_edge(cond, edge) {
					ir_node *proj = get_edge_src_irn(edge);
173
					if (get_Proj_proj(proj) == (long)pnc)
174
175
176
177
178
179
						continue;
					edge = get_irn_out_edge_first(proj);
					other_blk = get_edge_src_irn(edge);
					break;
				}
				assert(other_blk);
180

181
				/*
182
183
184
185
				 * Note the special case here: if block is a then, there might be no else
				 * block. In that case the other_block is the user_blk itself and pred_block
				 * is the cond_block ...
				 *
186
				 * Best would be to introduce a block here, removing this critical edge.
187
188
189
190
				 * For some reasons I cannot repair dominance here, so I have to remove
				 * ALL critical edges...
				 * FIXME: This should not be needed if we could repair dominance ...
				 */
191
192
193
194
195
196
197
198
199
200
201
202
			}

			n = get_Block_n_cfgpreds(user_blk);

			/*
			 * We have found a user in a non-dominated block:
			 * check, if all its block predecessors are dominated.
			 * If yes, place a Phi.
			 */
			for (i = n - 1; i >= 0; --i) {
				ir_node *pred_blk = get_Block_cfgpred_block(user_blk, i);

203
204
				if (!block_dominates(block, pred_blk) &&
				    !block_dominates(other_blk, pred_blk)) {
205
206
207
208
209
210
211
212
213
214
					/* can't do anything */
					break;
				}
			}
			if (i < 0) {
				ir_node *phi, **in;

				NEW_ARR_A(ir_node *, in, n);
				/* ok, ALL predecessors are either dominated by block OR other block */
				if (c_b == NULL) {
215
216
					ir_node *c_true  = new_Const(tarval_b_true);
					ir_node *c_false = new_Const(tarval_b_false);
217
					env->num_consts += 2;
218
219
220
221
222
223
224
					if (pnc == pn_Cond_true) {
						c_b = c_true;
						c_o = c_false;
					} else {
						c_b = c_false;
						c_o = c_true;
					}
225
226
227
228
229
230
231
232
233
				}
				for (i = n - 1; i >= 0; --i) {
					ir_node *pred_blk = get_Block_cfgpred_block(user_blk, i);

					if (block_dominates(block, pred_blk))
						in[i] = c_b;
					else
						in[i] = c_o;
				}
234
				phi = new_r_Phi(user_blk, n, in, mode_b);
235
				set_irn_n(user, pos, phi);
236
				env->num_eq += 1;
237
238
239
240
241
			}
		}
	}
}

Michael Beck's avatar
Michael Beck committed
242
243
244
245
246
247
248
249
/**
 * Handle an IF-branch.
 *
 * @param block   the block which is entered by the branch
 * @param cmp     the Cmp node expressing the branch condition
 * @param pnc     the Compare relation for taking this branch
 * @param env     statistical environment
 */
250
251
static void handle_if(ir_node *block, ir_node *cmp, pn_Cmp pnc, env_t *env)
{
Michael Beck's avatar
Michael Beck committed
252
253
	ir_node *left  = get_Cmp_left(cmp);
	ir_node *right = get_Cmp_right(cmp);
254
	ir_node *cond_block;
Michael Beck's avatar
Michael Beck committed
255
256
257
258
	ir_op *op;
	const ir_edge_t *edge, *next;

	/* Beware of Bads */
259
	if (is_Bad(left) || is_Bad(right))
Michael Beck's avatar
Michael Beck committed
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
		return;

	op = get_irn_op(left);

	/* Do not create Confirm nodes for Cmp(Const, Const) constructs.
	   These are removed anyway */
	if (op == op_Const && is_Const(right))
		return;

	/* try to place the constant on the right side for a Confirm */
	if (op == op_Const || op == op_SymConst) {
		ir_node *t = left;

		left  = right;
		right = t;

		pnc = get_inversed_pnc(pnc);
	}

	/*
	 * First case: both values are identical.
	 * replace the left one by the right (potentially const) one.
	 */
	if (pnc == pn_Cmp_Eq) {
284
		cond_block = get_Block_cfgpred_block(block, 0);
Michael Beck's avatar
Michael Beck committed
285
		for (edge = get_irn_out_edge_first(left); edge; edge = next) {
286
			ir_node *user = get_edge_src_irn(edge);
Michael Beck's avatar
Michael Beck committed
287
			int     pos   = get_edge_src_pos(edge);
288
			ir_node *blk  = get_effective_use_block(user, pos);
Michael Beck's avatar
Michael Beck committed
289
290
291
292
293
294
295
296

			next = get_irn_out_edge_next(left, edge);
			if (block_dominates(block, blk)) {
				/*
				 * Ok, we found a usage of left in a block
				 * dominated by the branch block.
				 * We can replace the input with right.
				 */
297
				set_irn_n(user, pos, right);
Michael Beck's avatar
Michael Beck committed
298
299
				DBG_OPT_CONFIRM(left, right);

300
				DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, right));
Michael Beck's avatar
Michael Beck committed
301
302

				env->num_eq += 1;
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
			} else if (block_dominates(blk, cond_block)
					&& is_Const(right)
					&& get_irn_pinned(user) == op_pin_state_floats) {
				/*
				 * left == Const and we found a movable user of left in a
				 * dominator of the Cond block
				 */
				const ir_edge_t *edge, *next;
				for (edge = get_irn_out_edge_first(user); edge; edge = next) {
					ir_node *usr_of_usr = get_edge_src_irn(edge);
					int      npos = get_edge_src_pos(edge);
					ir_node *blk  = get_effective_use_block(usr_of_usr, npos);

					next = get_irn_out_edge_next(user, edge);
					if (block_dominates(block, blk)) {
						/*
						 * The user of the user is dominated by our true/false
						 * block. So, create a copy of user WITH the constant
						 * replacing it's pos'th input.
						 *
						 * This is always good for unop's and might be good
						 * for binops.
						 *
						 * If user has other user in the false/true block, code
						 * placement will move it down.
						 * If there are users in cond block or upper, we create
						 * "redundant ops", because one will have a const op,
						 * the other no const ...
						 */
						ir_node *new_op = exact_copy(user);
						set_nodes_block(new_op, block);
						set_irn_n(new_op, pos, right);
						set_irn_n(usr_of_usr, npos, new_op);
						env->num_eq += 1;
337
338
					}
				}
Michael Beck's avatar
Michael Beck committed
339
340
341
342
343
			}
		}
	} else { /* not pn_Cmp_Eq cases */
		ir_node *c = NULL;

344
		foreach_out_edge_safe(left, edge, next) {
Michael Beck's avatar
Michael Beck committed
345
346
347
348
349
350
351
352
353
354
355
			ir_node *succ = get_edge_src_irn(edge);
			int     pos   = get_edge_src_pos(edge);
			ir_node *blk  = get_effective_use_block(succ, pos);

			if (block_dominates(block, blk)) {
				/*
				 * Ok, we found a usage of left in a block
				 * dominated by the branch block.
				 * We can replace the input with a Confirm(left, pnc, right).
				 */
				if (! c)
356
					c = new_r_Confirm(block, left, right, pnc);
Michael Beck's avatar
Michael Beck committed
357
358
359

				pos = get_edge_src_pos(edge);
				set_irn_n(succ, pos, c);
360
				DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
Michael Beck's avatar
Michael Beck committed
361
362
363
364

				env->num_confirms += 1;
			}
		}
365
366
367

		if (! is_Const(right)) {
			/* also construct inverse Confirms */
368
369
			ir_node *rc = NULL;

370
			pnc = get_inversed_pnc(pnc);
371
			foreach_out_edge_safe(right, edge, next) {
372
				ir_node *succ = get_edge_src_irn(edge);
373
374
375
376
377
378
379
380
				int     pos;
				ir_node *blk;

				if (succ == c)
					continue;

				pos  = get_edge_src_pos(edge);
				blk  = get_effective_use_block(succ, pos);
381
382
383
384
385
386
387

				if (block_dominates(block, blk)) {
					/*
					 * Ok, we found a usage of right in a block
					 * dominated by the branch block.
					 * We can replace the input with a Confirm(right, pnc^-1, left).
					 */
388
					if (! rc)
389
						rc = new_r_Confirm(block, right, left, pnc);
390
391

					pos = get_edge_src_pos(edge);
392
393
					set_irn_n(succ, pos, rc);
					DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, rc));
394
395
396
397
398

					env->num_confirms += 1;
				}
			}
		}
Michael Beck's avatar
Michael Beck committed
399
	}
400
}  /* handle_if */
Michael Beck's avatar
Michael Beck committed
401
402

/**
403
 * Pre-block-walker: Called for every block to insert Confirm nodes
Michael Beck's avatar
Michael Beck committed
404
 */
405
406
static void insert_Confirm_in_block(ir_node *block, void *env)
{
Michael Beck's avatar
Michael Beck committed
407
408
409
410
411
412
413
414
415
416
417
	ir_node *cond, *proj, *selector;
	ir_mode *mode;

	/*
	 * we can only handle blocks with only ONE control flow
	 * predecessor yet.
	 */
	if (get_Block_n_cfgpreds(block) != 1)
		return;

	proj = get_Block_cfgpred(block, 0);
418
	if (! is_Proj(proj))
Michael Beck's avatar
Michael Beck committed
419
420
421
		return;

	cond = get_Proj_pred(proj);
422
	if (! is_Cond(cond))
Michael Beck's avatar
Michael Beck committed
423
424
425
426
427
428
429
430
431
		return;

	selector = get_Cond_selector(cond);
	mode = get_irn_mode(selector);

	if (mode == mode_b) {
		ir_node *cmp;
		pn_Cmp pnc;

432
		handle_modeb(block, selector, get_Proj_proj(proj), env);
433

Michael Beck's avatar
Michael Beck committed
434
		/* this should be an IF, check this */
435
		if (! is_Proj(selector))
Michael Beck's avatar
Michael Beck committed
436
437
438
			return;

		cmp = get_Proj_pred(selector);
439
		if (! is_Cmp(cmp))
Michael Beck's avatar
Michael Beck committed
440
441
442
443
444
445
			return;

		pnc = get_Proj_proj(selector);

		if (get_Proj_proj(proj) != pn_Cond_true) {
			/* it's the false branch */
446
			mode = get_irn_mode(get_Cmp_left(cmp));
Michael Beck's avatar
Michael Beck committed
447
448
			pnc = get_negated_pnc(pnc, mode);
		}
449
		DB((dbg, LEVEL_2, "At %+F using %+F Confirm %=\n", block, cmp, pnc));
Michael Beck's avatar
Michael Beck committed
450
451
452
453
454
455

		handle_if(block, cmp, pnc, env);
	} else if (mode_is_int(mode)) {
		long proj_nr = get_Proj_proj(proj);

		/* this is a CASE, but we cannot handle the default case */
456
		if (proj_nr == get_Cond_default_proj(cond))
Michael Beck's avatar
Michael Beck committed
457
458
459
460
			return;

		handle_case(block, get_Cond_selector(cond), proj_nr, env);
	}
461
462
}  /* insert_Confirm_in_block */

463
464
465
/**
 * Checks if a node is a non-null Confirm.
 */
466
467
static int is_non_null_Confirm(const ir_node *ptr)
{
468
469
	for (;;) {
		if (! is_Confirm(ptr))
470
			break;
471
472
473
474
475
476
477
478
		if (get_Confirm_cmp(ptr) == pn_Cmp_Lg) {
			ir_node *bound = get_Confirm_bound(ptr);

			if (is_Const(bound) && is_Const_null(bound))
				return 1;
		}
		ptr = get_Confirm_value(ptr);
	}
479
480
481
482
483
484
485
486
	/*
	 * While a SymConst is not a Confirm, it is non-null
	 * anyway. This helps to reduce the number of
	 * constructed Confirms.
	 */
	if (is_SymConst_addr_ent(ptr))
		return 1;
	return 0;
487
488
}  /* is_non_null_Confirm */

489
/**
490
 * The given pointer will be dereferenced, add non-null Confirms.
491
492
493
494
495
 *
 * @param ptr    a node representing an address
 * @param block  the block of the dereferencing instruction
 * @param env    environment
 */
496
497
static void insert_non_null(ir_node *ptr, ir_node *block, env_t *env)
{
498
499
500
501
502
503
504
505
506
	const ir_edge_t *edge, *next;
	ir_node         *c = NULL;

	foreach_out_edge_safe(ptr, edge, next) {
		ir_node *succ = get_edge_src_irn(edge);
		int     pos;
		ir_node *blk;


507
508
		/* for now, we place a Confirm only in front of a Cmp */
		if (! is_Cmp(succ))
509
			continue;
510
511
512
513

		pos = get_edge_src_pos(edge);
		blk = get_effective_use_block(succ, pos);

514
		if (block_dominates(block, blk)) {
515
516
517
518
519
520
521
			/*
			 * Ok, we found a usage of ptr in a block
			 * dominated by the Load/Store block.
			 * We can replace the input with a Confirm(ptr, !=, NULL).
			 */
			if (c == NULL) {
				ir_mode *mode = get_irn_mode(ptr);
522
				c = new_Const(get_mode_null(mode));
523

524
				c = new_r_Confirm(block, ptr, c, pn_Cmp_Lg);
525
526
527
			}

			set_irn_n(succ, pos, c);
528
			DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
529

530
			env->num_non_null += 1;
531
532
533
534
535
536
537
538
			env->num_confirms += 1;
		}
	}
}  /* insert_non_null */

/**
 * Pre-walker: Called for every node to insert Confirm nodes
 */
539
540
static void insert_Confirm(ir_node *node, void *env)
{
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
	ir_node *ptr;

	switch (get_irn_opcode(node)) {
	case iro_Block:
		insert_Confirm_in_block(node, env);
		break;
	case iro_Load:
		ptr = get_Load_ptr(node);
		if (! is_non_null_Confirm(ptr))
			insert_non_null(ptr, get_nodes_block(node), env);
		break;
	case iro_Store:
		ptr = get_Store_ptr(node);
		if (! is_non_null_Confirm(ptr))
			insert_non_null(ptr, get_nodes_block(node), env);
		break;
	default:
		break;
	}
560
}  /* insert_Confirm */
Michael Beck's avatar
Michael Beck committed
561
562
563
564

/*
 * Construct Confirm nodes
 */
565
566
void construct_confirms(ir_graph *irg)
{
Michael Beck's avatar
Michael Beck committed
567
568
	env_t env;
	int edges_active = edges_activated(irg);
Michael Beck's avatar
Michael Beck committed
569

570
571
	FIRM_DBG_REGISTER(dbg, "firm.ana.confirm");

572
573
	remove_critical_cf_edges(irg);

Michael Beck's avatar
Michael Beck committed
574
575
	/* we need dominance info */
	assure_doms(irg);
Michael Beck's avatar
Michael Beck committed
576

Michael Beck's avatar
Michael Beck committed
577
578
	assert(get_irg_pinned(irg) == op_pin_state_pinned &&
	       "Nodes must be placed to insert Confirms");
Michael Beck's avatar
Michael Beck committed
579

Michael Beck's avatar
Michael Beck committed
580
581
582
583
	if (! edges_active) {
		/* We need edges */
		edges_activate(irg);
	}
Michael Beck's avatar
Michael Beck committed
584

Michael Beck's avatar
Michael Beck committed
585
586
587
	env.num_confirms = 0;
	env.num_consts   = 0;
	env.num_eq       = 0;
588
	env.num_non_null = 0;
Michael Beck's avatar
Michael Beck committed
589

590
	if (get_opt_global_null_ptr_elimination()) {
591
592
593
594
595
596
		/* do global NULL test elimination */
		irg_walk_graph(irg, insert_Confirm, NULL, &env);
	} else {
		/* now, visit all blocks and add Confirms where possible */
		irg_block_walk_graph(irg, insert_Confirm_in_block, NULL, &env);
	}
Michael Beck's avatar
Michael Beck committed
597

Michael Beck's avatar
Michael Beck committed
598
599
600
	if (env.num_confirms | env.num_consts | env.num_eq) {
		/* we have add nodes or changed DF edges */
		set_irg_outs_inconsistent(irg);
Michael Beck's avatar
Michael Beck committed
601

Michael Beck's avatar
Michael Beck committed
602
603
604
		/* the new nodes are not in the loop info */
		set_irg_loopinfo_inconsistent(irg);
	}
Michael Beck's avatar
Michael Beck committed
605

606
607
608
	DB((dbg, LEVEL_1, "# Confirms inserted : %u\n", env.num_confirms));
	DB((dbg, LEVEL_1, "# Const replacements: %u\n", env.num_consts));
	DB((dbg, LEVEL_1, "# node equalities   : %u\n", env.num_eq));
609
	DB((dbg, LEVEL_1, "# non-null Confirms : %u\n", env.num_non_null));
Michael Beck's avatar
Michael Beck committed
610

Michael Beck's avatar
Michael Beck committed
611
612
613
	/* deactivate edges if they where off */
	if (! edges_active)
		edges_deactivate(irg);
614
}  /* construct_confirms */
Michael Beck's avatar
Michael Beck committed
615

616
/* Construct a pass. */
617
618
ir_graph_pass_t *construct_confirms_pass(const char *name)
{
619
	return def_graph_pass(name ? name : "confirm", construct_confirms);
620
621
}  /* construct_confirms_pass */

622
static void remove_confirm(ir_node *n, void *env)
623
{
624
625
	ir_node *value;

Michael Beck's avatar
Michael Beck committed
626
	(void) env;
627
628
629
630
631
632
	if (!is_Confirm(n))
		return;

	value = get_Confirm_value(n);
	exchange(n, value);
}
Michael Beck's avatar
Michael Beck committed
633
634
635
636

/*
 * Remove all Confirm nodes from a graph.
 */
637
638
void remove_confirms(ir_graph *irg)
{
639
	irg_walk_graph(irg, NULL, remove_confirm, NULL);
640
}  /* remove_confirms */
641
642

/* Construct a pass. */
643
644
ir_graph_pass_t *remove_confirms_pass(const char *name)
{
645
	return def_graph_pass(name ? name : "rem_confirm", remove_confirms);
646
}  /* remove_confirms_pass */