summaryrefslogtreecommitdiffhomepage
path: root/ir/ana/irconsconfirm.c
blob: 15d5e16bba3bd424a5003dc3e3a6384200d3c0b8 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
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
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
/*
 * This file is part of libFirm.
 * Copyright (C) 2012 University of Karlsruhe.
 */

/**
 * @file
 * @brief    Construction of Confirm nodes
 * @author   Michael Beck
 * @date     6.2005
 */
#include "irconsconfirm.h"

#include "array.h"
#include "debug.h"
#include "ircons_t.h"
#include "iredges_t.h"
#include "irflag.h"
#include "irgmod.h"
#include "irgopt.h"
#include "irgraph_t.h"
#include "irgwalk.h"
#include "irnode_t.h"
#include "iropt_dbg.h"
#include "irtools.h"

/**
 * Walker environment.
 */
typedef struct env_t {
	bool optimize;          /**< Do other optimizations as well as inserting Confirms. */
	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. */
} env_t;

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

/**
 * Return the effective use block of a node and its predecessor on
 * position pos.
 *
 * @param node  the node
 * @param pos   the position of the used input
 *
 * This handles correctly Phi nodes.
 */
static ir_node *get_effective_use_block(ir_node *node, int pos)
{
	if (is_Phi(node)) {
		/* the effective use of a Phi argument is in its predecessor block */
		node = get_nodes_block(node);
		return get_Block_cfgpred_block(node, pos);
	}
	return get_nodes_block(node);
}

static ir_node *get_case_value(ir_node *switchn, unsigned pn)
{
	ir_graph              *irg       = get_irn_irg(switchn);
	const ir_switch_table *table     = get_Switch_table(switchn);
	size_t                 n_entries = ir_switch_table_get_n_entries(table);
	ir_tarval             *val       = NULL;
	for (size_t e = 0; e < n_entries; ++e) {
		const ir_switch_table_entry *entry
			= ir_switch_table_get_entry_const(table, e);
		if (entry->pn != pn)
			continue;
		/* multiple matching entries gets too complicated for a single
		 * Confirm */
		if (val != NULL)
			return NULL;
		/* case ranges are too complicated too */
		if (entry->min != entry->max)
			return NULL;
		val = entry->min;
	}
	assert(val != NULL);
	return new_r_Const(irg, val);
}

/**
 * Handle a CASE-branch.
 *
 * Branch labels are a simple case. We can replace the value
 * by a Const with the branch label.
 */
static void handle_case(ir_node *block, ir_node *switchn, unsigned pn, env_t *env)
{
	if (!env->optimize) {
		return;
	}

	ir_node *c        = NULL;
	ir_node *selector = get_Switch_selector(switchn);

	/* we can't do useful things with the default label */
	if (pn == pn_Switch_default)
		return;

	foreach_out_edge_safe(selector, edge) {
		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 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 == NULL) {
				c = get_case_value(switchn, pn);
				if (c == NULL)
					return;
			}

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

			env->num_consts += 1;
		}
	}
}

/**
 * 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
 */
static void handle_modeb(ir_node *block, ir_node *selector, pn_Cond pnc, env_t *env)
{
	if (!env->optimize) {
		return;
	}

	ir_node *other_blk = NULL;
	ir_node *con       = NULL;
	ir_node *c_b       = NULL;
	ir_node *c_o       = NULL;

	foreach_out_edge_safe(selector, edge) {
		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);

		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) {
				ir_graph *irg = get_irn_irg(block);
				con = new_r_Const(irg, pnc == pn_Cond_true ? tarval_b_true : tarval_b_false);
			}
			ir_node *old = get_irn_n(user, pos);
			set_irn_n(user, pos, con);
			DBG_OPT_CONFIRM_C(old, con);

			DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, con));

			env->num_consts += 1;
		} else {
			/* get the other block */
			if (other_blk == NULL) {
				/* we have already tested, that block has only ONE Cond predecessor */
				ir_node *const cond = get_Proj_pred(get_Block_cfgpred(block, 0));
				ir_node *const proj = get_Proj_for_pn(cond, pn_Cond_false + pn_Cond_true - pnc);
				assert(proj);
				other_blk = get_edge_src_irn(get_irn_out_edge_first(proj));

				/*
				 * 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 ...
				 *
				 * Best would be to introduce a block here, removing this critical edge.
				 * 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 ...
				 */
			}

			int 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.
			 */
			int i;
			for (i = n; i-- > 0; ) {
				ir_node *pred_blk = get_Block_cfgpred_block(user_blk, i);

				if (!block_dominates(block, pred_blk) &&
				    !block_dominates(other_blk, pred_blk)) {
					/* can't do anything */
					break;
				}
			}
			if (i < 0 && n > 0) {
				ir_node **in = ALLOCAN(ir_node*, n);
				/* ok, ALL predecessors are either dominated by block OR other block */
				if (c_b == NULL) {
					ir_graph *irg     = get_irn_irg(block);
					ir_node  *c_true  = new_r_Const(irg, tarval_b_true);
					ir_node  *c_false = new_r_Const(irg, tarval_b_false);
					env->num_consts += 2;
					if (pnc == pn_Cond_true) {
						c_b = c_true;
						c_o = c_false;
					} else {
						c_b = c_false;
						c_o = c_true;
					}
				}
				for (i = n; i-- > 0; ) {
					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;
				}
				ir_node *phi = new_r_Phi(user_blk, n, in, mode_b);
				set_irn_n(user, pos, phi);
				env->num_eq += 1;
			}
		}
	}
}

/**
 * Handle an IF-branch.
 *
 * @param block   the block which is entered by the branch
 * @param cmp     the Cmp node expressing the branch condition
 * @param rel     the Compare relation for taking this branch
 * @param env     statistical environment
 */
static void handle_if(ir_node *block, ir_node *cmp, ir_relation rel, env_t *env)
{
	/* Beware of Bads */
	ir_node *left  = get_Cmp_left(cmp);
	ir_node *right = get_Cmp_right(cmp);
	if (is_Bad(left) || is_Bad(right))
		return;

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

	/* try to place the constant on the right side for a Confirm */
	switch (get_irn_opcode(left)) {
	case iro_Address:
	case iro_Align:
	case iro_Const:
	case iro_Offset:
	case iro_Size: {
		ir_node *t = left;
		left  = right;
		right = t;

		rel = get_inversed_relation(rel);
		break;
	}

	default:
		break;
	}

	/*
	 * First case: both values are identical.
	 * replace the left one by the right (potentially const) one.
	 */
	if (env->optimize && rel == ir_relation_equal) {
		ir_node *cond_block = get_Block_cfgpred_block(block, 0);
		foreach_out_edge_safe(left, edge) {
			ir_node *user = get_edge_src_irn(edge);
			int     pos   = get_edge_src_pos(edge);
			ir_node *blk  = get_effective_use_block(user, 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 right.
				 */
				set_irn_n(user, pos, right);
				DBG_OPT_CONFIRM(left, right);

				DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, right));

				env->num_eq += 1;
			} else if (block_dominates(blk, cond_block)
			           && is_Const(right) && !get_irn_pinned(user)) {
				/*
				 * left == Const and we found a movable user of left in a
				 * dominator of the Cond block
				 */
				foreach_out_edge_safe(user, user_edge) {
					ir_node *usr_of_usr = get_edge_src_irn(user_edge);
					int      npos       = get_edge_src_pos(user_edge);
					ir_node *user_blk   = get_effective_use_block(usr_of_usr, npos);

					if (block_dominates(block, user_blk)) {
						/*
						 * The user of the user is dominated by our true/false
						 * block. So, create a copy of user WITH the constant
						 * replacing its 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;
					}
				}
			}
		}
	} else { /* not ir_relation_equal cases */
		ir_node *c = NULL;

		foreach_out_edge_safe(left, edge) {
			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 == NULL)
					c = new_r_Confirm(block, left, right, rel);

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

				env->num_confirms += 1;
			}
		}

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

			rel = get_inversed_relation(rel);
			foreach_out_edge_safe(right, edge) {
				ir_node *succ = get_edge_src_irn(edge);
				if (succ == c)
					continue;

				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 right in a block
					 * dominated by the branch block.
					 * We can replace the input with a Confirm(right, rel^-1, left).
					 */
					if (rc == NULL)
						rc = new_r_Confirm(block, right, left, rel);

					if (succ != rc) {
						set_irn_n(succ, pos, rc);
						DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, rc));
					}

					env->num_confirms += 1;
				}
			}
		}
	}
}

/**
 * Pre-block-walker: Called for every block to insert Confirm nodes
 */
static void insert_Confirm_in_block(ir_node *block, void *data)
{
	/*
	 * we can only handle blocks with only ONE control flow
	 * predecessor yet.
	 */
	if (get_Block_n_cfgpreds(block) != 1)
		return;

	ir_node *proj = get_Block_cfgpred(block, 0);
	if (!is_Proj(proj))
		return;

	env_t   *env = (env_t*)data;
	ir_node *cond = get_Proj_pred(proj);
	if (is_Switch(cond)) {
		unsigned proj_nr = get_Proj_num(proj);
		handle_case(block, cond, proj_nr, env);
	} else if (is_Cond(cond)) {
		ir_node *selector = get_Cond_selector(cond);
		handle_modeb(block, selector, (pn_Cond) get_Proj_num(proj), env);
		if (!is_Cmp(selector))
			return;

		ir_relation rel = get_Cmp_relation(selector);

		/* it's the false branch */
		if (get_Proj_num(proj) != pn_Cond_true)
			rel = get_negated_relation(rel);
		DB((dbg, LEVEL_2, "At %+F using %+F Confirm %=\n", block, selector, rel));

		handle_if(block, selector, rel, env);
	}
}

/**
 * Checks if a node is a non-null Confirm.
 */
static bool is_non_null_Confirm(const ir_node *ptr)
{
	for (;;) {
		if (!is_Confirm(ptr))
			break;
		if (get_Confirm_relation(ptr) == ir_relation_less_greater) {
			ir_node *bound = get_Confirm_bound(ptr);

			if (is_irn_null(bound))
				return true;
		}
		ptr = get_Confirm_value(ptr);
	}
	/*
	 * While an Address is not a Confirm, it is non-null
	 * anyway. This helps to reduce the number of
	 * constructed Confirms.
	 */
	if (is_Address(ptr))
		return true;
	return false;
}

/**
 * The given pointer will be dereferenced, add non-null Confirms.
 *
 * @param ptr    a node representing an address
 * @param block  the block of the dereferencing instruction
 * @param env    environment
 */
static void insert_non_null(ir_node *ptr, ir_node *block, env_t *env)
{
	ir_node *c = NULL;

	foreach_out_edge_safe(ptr, edge) {
		/* for now, we place a Confirm only in front of a Cmp */
		ir_node *succ = get_edge_src_irn(edge);
		if (!is_Cmp(succ))
			continue;

		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 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);
				ir_graph *irg  = get_irn_irg(block);
				c = new_r_Const_null(irg, mode);
				c = new_r_Confirm(block, ptr, c, ir_relation_less_greater);
			}

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

			env->num_non_null += 1;
			env->num_confirms += 1;
		}
	}
}

/**
 * Pre-walker: Called for every node to insert Confirm nodes
 */
static void insert_Confirm(ir_node *node, void *data)
{
	env_t *env = (env_t*)data;
	switch (get_irn_opcode(node)) {
	case iro_Block:
		insert_Confirm_in_block(node, env);
		break;
	case iro_Load: {
		ir_node *ptr = get_Load_ptr(node);
		if (!is_non_null_Confirm(ptr))
			insert_non_null(ptr, get_nodes_block(node), env);
		break;
	}
	case iro_Store: {
		ir_node *ptr = get_Store_ptr(node);
		if (!is_non_null_Confirm(ptr))
			insert_non_null(ptr, get_nodes_block(node), env);
		break;
	}
	default:
		break;
	}
}

/**
 * Look for Phis with Confirms/Consts on all their inputs. If
 * possible, add a Confirm for their output.
 *
 * Only handles int modes.
 */
static void push_through_Phi(ir_node *phi, void *data)
{
	if (!is_Phi(phi) || !mode_is_int(get_irn_mode(phi))) {
		return;
	}

	DB((dbg, LEVEL_3, "Trying to push confirms through %+F\n", phi));

	ir_relation relation;
	ir_node *bound;

	ir_node *pred0 = get_Phi_pred(phi, 0);
	if (is_Const(pred0)) {
		relation = ir_relation_equal;
		bound = pred0;
	} else if (is_Confirm(pred0)) {
		relation = get_Confirm_relation(pred0);
		bound = get_Confirm_bound(pred0);

		if ((relation & ir_relation_less_greater) == ir_relation_less_greater) {
			DB((dbg, LEVEL_3, "Relation !=, giving up\n"));
			return;
		}
	} else {
		DB((dbg, LEVEL_3, "Pred 0 is unsuitable: %+F\n", pred0));
		return;
	}

	DB((dbg, LEVEL_3, "Bound after pred 0: %s %+F\n", get_relation_string(relation), bound));

	size_t n_preds = get_Phi_n_preds(phi);
	for (size_t i = 1; i < n_preds; i++) {
		ir_node *pred = get_Phi_pred(phi, i);

		ir_node *new_bound;
		ir_tarval *new_tv;
		ir_relation new_relation;

		if (is_Const(pred)) {
			new_bound = pred;
			new_tv = get_Const_tarval(pred);
			new_relation = ir_relation_equal;
			DB((dbg, LEVEL_3, "New bound %d: %s %+F\n", i, get_relation_string(new_relation), new_bound));

		} else if (is_Confirm(pred)) {
			new_relation = get_Confirm_relation(pred);
			new_bound = get_Confirm_bound(pred);
			DB((dbg, LEVEL_3, "New bound %d: %s %+F\n", i, get_relation_string(new_relation), new_bound));

			if ((new_relation & ir_relation_less_greater) == ir_relation_less_greater) {
				DB((dbg, LEVEL_3, "Relation !=, giving up\n"));
				return;
			}

			if (!is_Const(new_bound)) {
				if (new_bound != bound) {
					DB((dbg, LEVEL_3, "New bound not constant and different\n", i, get_relation_string(new_relation), new_bound));
					return;
				}

				// We have two confirms with the same bound.
				// Even though it is not constant, we can merge the relations.
				DB((dbg, LEVEL_3, "New bound not constant but same\n", i, get_relation_string(new_relation), new_bound));
				relation |= new_relation;
				DB((dbg, LEVEL_3, "Bound after pred %d: %s %+F\n", i, get_relation_string(relation), bound));
				continue;
			}

			new_tv = get_Const_tarval(new_bound);
		} else {
			DB((dbg, LEVEL_3, "Pred %d is unsuitable: %+F\n", i, pred));
			return;
		}

		if (!is_Const(bound)) {
			DB((dbg, LEVEL_3, "Old bound %+F is not Const\n", bound));
			return;
		}
		ir_tarval *bound_tv = get_Const_tarval(bound);

		ir_relation new_cmp_bound = tarval_cmp(new_tv, bound_tv);
		bool update;

		switch (relation) {
		case ir_relation_less:
			update = new_cmp_bound & ir_relation_greater_equal;
			goto update_less_or_less_equal;

		case ir_relation_less_equal:
			update = new_cmp_bound & ir_relation_greater;

		update_less_or_less_equal:
			if (update) {
				bound = new_bound;

				switch (new_relation) {
				case ir_relation_less:
				case ir_relation_less_equal:
					relation = new_relation;
					break;

				case ir_relation_equal:
					relation = ir_relation_less_equal;
					break;

				case ir_relation_greater_equal:
				case ir_relation_greater:
					DB((dbg, LEVEL_3, "%s u %s = T\n", get_relation_string(relation), get_relation_string(new_relation)));
					return;

				default:
					panic("Unhandled new_relation %s\n", get_relation_string(new_relation));
				}
			}
			break;

		case ir_relation_greater:
			update = new_cmp_bound & ir_relation_less_equal;
			goto update_greater_or_greater_equal;

		case ir_relation_greater_equal:
			update = new_cmp_bound & ir_relation_less;

		update_greater_or_greater_equal:
			if (update) {
				bound = new_bound;

				switch (new_relation) {
				case ir_relation_less:
				case ir_relation_less_equal:
					DB((dbg, LEVEL_3, "%s u %s = T\n", get_relation_string(relation), get_relation_string(new_relation)));
					return;

				case ir_relation_equal:
					relation = ir_relation_greater_equal;
					break;

				case ir_relation_greater_equal:
				case ir_relation_greater:
					relation = new_relation;
					break;

				default:
					panic("Unhandled new_relation %s\n", get_relation_string(new_relation));
				}
			}
			break;


		case ir_relation_equal:
			switch (new_relation) {
			case ir_relation_less:
				if (new_cmp_bound & ir_relation_greater) {
					relation = ir_relation_less;
					bound = new_bound;
				} else {
					relation = ir_relation_less_equal;
					// bound stays
				}
				break;

			case ir_relation_less_equal:
				if (new_cmp_bound & ir_relation_greater_equal) {
					relation = ir_relation_less_equal;
					bound = new_bound;
				} else {
					relation = ir_relation_less_equal;
					// bound stays
				}
				break;

			case ir_relation_equal:
				// Special case: Don't lose information if the bounds are equal
				if (new_cmp_bound & ir_relation_equal) {
					// Nothing to do
				} else if (new_cmp_bound & ir_relation_greater) {
					relation = ir_relation_less_equal;
					bound = new_bound;
				} else {
					relation = ir_relation_less_equal;
					// bound stays
				}
				break;

			case ir_relation_greater_equal:
				if (new_cmp_bound & ir_relation_less_equal) {
					relation = ir_relation_greater_equal;
					bound = new_bound;
				} else {
					relation = ir_relation_greater_equal;
					// bound stays
				}
				break;

			case ir_relation_greater:
				if (new_cmp_bound & ir_relation_less) {
					relation = ir_relation_greater;
					bound = new_bound;
				} else {
					relation = ir_relation_greater_equal;
					// bound stays
				}
				break;

			default:
				panic("Unhandled new_relation %s\n", get_relation_string(new_relation));
			}
			break;

		default:
			panic("Unhandled relation %s\n", get_relation_string(relation));
		}

		DB((dbg, LEVEL_3, "Bound after pred %d: %s %+F\n", i, get_relation_string(relation), bound));
	}

	// If we get here, we have a valid bound that covers all of the Phi's preds.
	// Confirm that bound for the Phi's users.
	ir_node *phi_block = get_nodes_block(phi);
	ir_node *confirm = new_r_Confirm(phi_block, phi, bound, relation);
	edges_reroute_except(phi, confirm, confirm);

	env_t *env = (env_t*) data;
	env->num_confirms += 1;

	DB((dbg, LEVEL_2, "Pushed confirms through %+F: new %+F\n", phi, confirm));
}

static void do_construct_confirms(ir_graph *irg, bool optimize)
{
	FIRM_DBG_REGISTER(dbg, "firm.ana.confirm");

	assure_irg_properties(irg,
		IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES
		| IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE
		| IR_GRAPH_PROPERTY_NO_BADS
		| IR_GRAPH_PROPERTY_NO_CRITICAL_EDGES);

	assert(get_irg_pinned(irg) == op_pin_state_pinned);

	env_t env;
	env.optimize     = optimize;
	env.num_confirms = 0;
	env.num_consts   = 0;
	env.num_eq       = 0;
	env.num_non_null = 0;

	if (get_opt_global_null_ptr_elimination()) {
		/* 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);
	}
	irg_walk_graph(irg, push_through_Phi, NULL, &env);

	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));
	DB((dbg, LEVEL_1, "# non-null Confirms : %u\n", env.num_non_null));

	confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_CONTROL_FLOW);
}

void construct_confirms(ir_graph *irg)
{
	do_construct_confirms(irg, true);
}

void construct_confirms_only(ir_graph *irg)
{
	do_construct_confirms(irg, false);
}

static void remove_confirm(ir_node *n, void *env)
{
	(void)env;
	if (!is_Confirm(n))
		return;

	ir_node *value = get_Confirm_value(n);
	exchange(n, value);
}

void remove_confirms(ir_graph *irg)
{
	irg_walk_graph(irg, NULL, remove_confirm, NULL);
	confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_CONTROL_FLOW);
}