2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief iropt --- optimizations intertwined with IR construction.
23 * @author Christian Schaefer, Goetz Lindenmaier, Michael Beck
33 #include "irgraph_t.h"
34 #include "iredges_t.h"
41 #include "dbginfo_t.h"
42 #include "iropt_dbg.h"
48 #include "opt_confirms.h"
49 #include "opt_polymorphy.h"
53 /* Make types visible to allow most efficient access */
57 * Returns the tarval of a Const node or tarval_bad for all other nodes.
59 static tarval *default_value_of(const ir_node *n) {
61 return get_Const_tarval(n); /* might return tarval_bad */
66 value_of_func value_of_ptr = default_value_of;
68 /* * Set a new value_of function. */
69 void set_value_of_func(value_of_func func) {
73 value_of_ptr = default_value_of;
77 * Return the value of a Constant.
79 static tarval *computed_value_Const(const ir_node *n) {
80 return get_Const_tarval(n);
81 } /* computed_value_Const */
84 * Return the value of a 'sizeof', 'alignof' or 'offsetof' SymConst.
86 static tarval *computed_value_SymConst(const ir_node *n) {
90 switch (get_SymConst_kind(n)) {
91 case symconst_type_size:
92 type = get_SymConst_type(n);
93 if (get_type_state(type) == layout_fixed)
94 return new_tarval_from_long(get_type_size_bytes(type), get_irn_mode(n));
96 case symconst_type_align:
97 type = get_SymConst_type(n);
98 if (get_type_state(type) == layout_fixed)
99 return new_tarval_from_long(get_type_alignment_bytes(type), get_irn_mode(n));
101 case symconst_ofs_ent:
102 ent = get_SymConst_entity(n);
103 type = get_entity_owner(ent);
104 if (get_type_state(type) == layout_fixed)
105 return new_tarval_from_long(get_entity_offset(ent), get_irn_mode(n));
111 } /* computed_value_SymConst */
114 * Return the value of an Add.
116 static tarval *computed_value_Add(const ir_node *n) {
117 ir_node *a = get_Add_left(n);
118 ir_node *b = get_Add_right(n);
120 tarval *ta = value_of(a);
121 tarval *tb = value_of(b);
123 if ((ta != tarval_bad) && (tb != tarval_bad))
124 return tarval_add(ta, tb);
127 } /* computed_value_Add */
130 * Return the value of a Sub.
131 * Special case: a - a
133 static tarval *computed_value_Sub(const ir_node *n) {
134 ir_mode *mode = get_irn_mode(n);
135 ir_node *a = get_Sub_left(n);
136 ir_node *b = get_Sub_right(n);
141 if (a == b && !is_Bad(a))
142 return get_mode_null(mode);
147 if ((ta != tarval_bad) && (tb != tarval_bad))
148 return tarval_sub(ta, tb, mode);
151 } /* computed_value_Sub */
154 * Return the value of a Carry.
155 * Special : a op 0, 0 op b
157 static tarval *computed_value_Carry(const ir_node *n) {
158 ir_node *a = get_binop_left(n);
159 ir_node *b = get_binop_right(n);
160 ir_mode *m = get_irn_mode(n);
162 tarval *ta = value_of(a);
163 tarval *tb = value_of(b);
165 if ((ta != tarval_bad) && (tb != tarval_bad)) {
167 return tarval_carry() ? get_mode_one(m) : get_mode_null(m);
169 if (tarval_is_null(ta) || tarval_is_null(tb))
170 return get_mode_null(m);
173 } /* computed_value_Carry */
176 * Return the value of a Borrow.
179 static tarval *computed_value_Borrow(const ir_node *n) {
180 ir_node *a = get_binop_left(n);
181 ir_node *b = get_binop_right(n);
182 ir_mode *m = get_irn_mode(n);
184 tarval *ta = value_of(a);
185 tarval *tb = value_of(b);
187 if ((ta != tarval_bad) && (tb != tarval_bad)) {
188 return tarval_cmp(ta, tb) == pn_Cmp_Lt ? get_mode_one(m) : get_mode_null(m);
189 } else if (tarval_is_null(ta)) {
190 return get_mode_null(m);
193 } /* computed_value_Borrow */
196 * Return the value of an unary Minus.
198 static tarval *computed_value_Minus(const ir_node *n) {
199 ir_node *a = get_Minus_op(n);
200 tarval *ta = value_of(a);
202 if (ta != tarval_bad)
203 return tarval_neg(ta);
206 } /* computed_value_Minus */
209 * Return the value of a Mul.
211 static tarval *computed_value_Mul(const ir_node *n) {
212 ir_node *a = get_Mul_left(n);
213 ir_node *b = get_Mul_right(n);
216 tarval *ta = value_of(a);
217 tarval *tb = value_of(b);
219 mode = get_irn_mode(n);
220 if (mode != get_irn_mode(a)) {
221 /* n * n = 2n bit multiplication */
222 ta = tarval_convert_to(ta, mode);
223 tb = tarval_convert_to(tb, mode);
226 if (ta != tarval_bad && tb != tarval_bad) {
227 return tarval_mul(ta, tb);
229 /* a*0 = 0 or 0*b = 0 */
230 if (ta == get_mode_null(mode))
232 if (tb == get_mode_null(mode))
236 } /* computed_value_Mul */
239 * Return the value of an Abs.
241 static tarval *computed_value_Abs(const ir_node *n) {
242 ir_node *a = get_Abs_op(n);
243 tarval *ta = value_of(a);
245 if (ta != tarval_bad)
246 return tarval_abs(ta);
249 } /* computed_value_Abs */
252 * Return the value of an And.
253 * Special case: a & 0, 0 & b
255 static tarval *computed_value_And(const ir_node *n) {
256 ir_node *a = get_And_left(n);
257 ir_node *b = get_And_right(n);
259 tarval *ta = value_of(a);
260 tarval *tb = value_of(b);
262 if ((ta != tarval_bad) && (tb != tarval_bad)) {
263 return tarval_and (ta, tb);
265 if (tarval_is_null(ta)) return ta;
266 if (tarval_is_null(tb)) return tb;
269 } /* computed_value_And */
272 * Return the value of an Or.
273 * Special case: a | 1...1, 1...1 | b
275 static tarval *computed_value_Or(const ir_node *n) {
276 ir_node *a = get_Or_left(n);
277 ir_node *b = get_Or_right(n);
279 tarval *ta = value_of(a);
280 tarval *tb = value_of(b);
282 if ((ta != tarval_bad) && (tb != tarval_bad)) {
283 return tarval_or (ta, tb);
285 if (tarval_is_all_one(ta)) return ta;
286 if (tarval_is_all_one(tb)) return tb;
289 } /* computed_value_Or */
292 * Return the value of an Eor.
294 static tarval *computed_value_Eor(const ir_node *n) {
295 ir_node *a = get_Eor_left(n);
296 ir_node *b = get_Eor_right(n);
301 return get_mode_null(get_irn_mode(n));
306 if ((ta != tarval_bad) && (tb != tarval_bad)) {
307 return tarval_eor (ta, tb);
310 } /* computed_value_Eor */
313 * Return the value of a Not.
315 static tarval *computed_value_Not(const ir_node *n) {
316 ir_node *a = get_Not_op(n);
317 tarval *ta = value_of(a);
319 if (ta != tarval_bad)
320 return tarval_not(ta);
323 } /* computed_value_Not */
326 * Return the value of a Shl.
328 static tarval *computed_value_Shl(const ir_node *n) {
329 ir_node *a = get_Shl_left(n);
330 ir_node *b = get_Shl_right(n);
332 tarval *ta = value_of(a);
333 tarval *tb = value_of(b);
335 if ((ta != tarval_bad) && (tb != tarval_bad)) {
336 return tarval_shl (ta, tb);
339 } /* computed_value_Shl */
342 * Return the value of a Shr.
344 static tarval *computed_value_Shr(const ir_node *n) {
345 ir_node *a = get_Shr_left(n);
346 ir_node *b = get_Shr_right(n);
348 tarval *ta = value_of(a);
349 tarval *tb = value_of(b);
351 if ((ta != tarval_bad) && (tb != tarval_bad)) {
352 return tarval_shr (ta, tb);
355 } /* computed_value_Shr */
358 * Return the value of a Shrs.
360 static tarval *computed_value_Shrs(const ir_node *n) {
361 ir_node *a = get_Shrs_left(n);
362 ir_node *b = get_Shrs_right(n);
364 tarval *ta = value_of(a);
365 tarval *tb = value_of(b);
367 if ((ta != tarval_bad) && (tb != tarval_bad)) {
368 return tarval_shrs (ta, tb);
371 } /* computed_value_Shrs */
374 * Return the value of a Rotl.
376 static tarval *computed_value_Rotl(const ir_node *n) {
377 ir_node *a = get_Rotl_left(n);
378 ir_node *b = get_Rotl_right(n);
380 tarval *ta = value_of(a);
381 tarval *tb = value_of(b);
383 if ((ta != tarval_bad) && (tb != tarval_bad)) {
384 return tarval_rotl(ta, tb);
387 } /* computed_value_Rotl */
390 * Return the value of a Conv.
392 static tarval *computed_value_Conv(const ir_node *n) {
393 ir_node *a = get_Conv_op(n);
394 tarval *ta = value_of(a);
396 if (ta != tarval_bad)
397 return tarval_convert_to(ta, get_irn_mode(n));
400 } /* computed_value_Conv */
403 * Calculate the value of a Mux: can be evaluated, if the
404 * sel and the right input are known.
406 static tarval *computed_value_Mux(const ir_node *n) {
407 ir_node *sel = get_Mux_sel(n);
408 tarval *ts = value_of(sel);
410 if (ts == get_tarval_b_true()) {
411 ir_node *v = get_Mux_true(n);
414 else if (ts == get_tarval_b_false()) {
415 ir_node *v = get_Mux_false(n);
419 } /* computed_value_Mux */
422 * Calculate the value of a Confirm: can be evaluated,
423 * if it has the form Confirm(x, '=', Const).
425 static tarval *computed_value_Confirm(const ir_node *n) {
427 * Beware: we might produce Phi(Confirm(x == true), Confirm(x == false)).
428 * Do NOT optimize them away (CondEval wants them), so wait until
429 * remove_confirm is activated.
431 if (get_opt_remove_confirm()) {
432 if (get_Confirm_cmp(n) == pn_Cmp_Eq) {
433 tarval *tv = value_of(get_Confirm_bound(n));
434 if (tv != tarval_bad)
438 return value_of(get_Confirm_value(n));
439 } /* computed_value_Confirm */
442 * Return the value of a Proj(Cmp).
444 * This performs a first step of unreachable code elimination.
445 * Proj can not be computed, but folding a Cmp above the Proj here is
446 * not as wasteful as folding a Cmp into a Tuple of 16 Consts of which
448 * There are several case where we can evaluate a Cmp node, see later.
450 static tarval *computed_value_Proj_Cmp(const ir_node *n) {
451 ir_node *a = get_Proj_pred(n);
452 ir_node *aa = get_Cmp_left(a);
453 ir_node *ab = get_Cmp_right(a);
454 long proj_nr = get_Proj_proj(n);
457 * BEWARE: a == a is NOT always True for floating Point values, as
458 * NaN != NaN is defined, so we must check this here.
461 !mode_is_float(get_irn_mode(aa)) || proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Gt)
464 /* This is a trick with the bits used for encoding the Cmp
465 Proj numbers, the following statement is not the same:
466 return new_tarval_from_long (proj_nr == pn_Cmp_Eq, mode_b) */
467 return new_tarval_from_long (proj_nr & pn_Cmp_Eq, mode_b);
470 tarval *taa = value_of(aa);
471 tarval *tab = value_of(ab);
472 ir_mode *mode = get_irn_mode(aa);
475 * The predecessors of Cmp are target values. We can evaluate
478 if ((taa != tarval_bad) && (tab != tarval_bad)) {
479 /* strange checks... */
480 pn_Cmp flags = tarval_cmp(taa, tab);
481 if (flags != pn_Cmp_False) {
482 return new_tarval_from_long (proj_nr & flags, mode_b);
485 /* for integer values, we can check against MIN/MAX */
486 else if (mode_is_int(mode)) {
487 /* MIN <=/> x. This results in true/false. */
488 if (taa == get_mode_min(mode)) {
489 /* a compare with the MIN value */
490 if (proj_nr == pn_Cmp_Le)
491 return get_tarval_b_true();
492 else if (proj_nr == pn_Cmp_Gt)
493 return get_tarval_b_false();
495 /* x >=/< MIN. This results in true/false. */
497 if (tab == get_mode_min(mode)) {
498 /* a compare with the MIN value */
499 if (proj_nr == pn_Cmp_Ge)
500 return get_tarval_b_true();
501 else if (proj_nr == pn_Cmp_Lt)
502 return get_tarval_b_false();
504 /* MAX >=/< x. This results in true/false. */
505 else if (taa == get_mode_max(mode)) {
506 if (proj_nr == pn_Cmp_Ge)
507 return get_tarval_b_true();
508 else if (proj_nr == pn_Cmp_Lt)
509 return get_tarval_b_false();
511 /* x <=/> MAX. This results in true/false. */
512 else if (tab == get_mode_max(mode)) {
513 if (proj_nr == pn_Cmp_Le)
514 return get_tarval_b_true();
515 else if (proj_nr == pn_Cmp_Gt)
516 return get_tarval_b_false();
520 * The predecessors are Allocs or (void*)(0) constants. Allocs never
521 * return NULL, they raise an exception. Therefore we can predict
525 ir_node *aaa = skip_Proj(aa);
526 ir_node *aba = skip_Proj(ab);
528 if ( ( (/* aa is ProjP and aaa is Alloc */
530 && mode_is_reference(get_irn_mode(aa))
532 && ( (/* ab is NULL */
533 mode_is_reference(get_irn_mode(ab))
534 && tarval_is_null(tab))
535 || (/* ab is other Alloc */
537 && mode_is_reference(get_irn_mode(ab))
540 || (/* aa is NULL and aba is Alloc */
541 mode_is_reference(get_irn_mode(aa))
542 && tarval_is_null(taa)
544 && mode_is_reference(get_irn_mode(ab))
547 return new_tarval_from_long(proj_nr & pn_Cmp_Lg, mode_b);
550 return computed_value_Cmp_Confirm(a, aa, ab, proj_nr);
551 } /* computed_value_Proj_Cmp */
554 * Return the value of a floating point Quot.
556 static tarval *do_computed_value_Quot(const ir_node *a, const ir_node *b) {
557 tarval *ta = value_of(a);
558 tarval *tb = value_of(b);
560 /* cannot optimize 0 / b = 0 because of NaN */
561 if (ta != tarval_bad && tb != tarval_bad)
562 return tarval_quo(ta, tb);
564 } /* do_computed_value_Quot */
567 * Calculate the value of an integer Div of two nodes.
568 * Special case: 0 / b
570 static tarval *do_computed_value_Div(const ir_node *a, const ir_node *b) {
571 tarval *ta = value_of(a);
573 const ir_node *dummy;
575 /* Compute c1 / c2 or 0 / a, a != 0 */
576 if (tarval_is_null(ta) && value_not_zero(b, &dummy))
577 return ta; /* 0 / b == 0 */
579 if (ta != tarval_bad && tb != tarval_bad)
580 return tarval_div(ta, tb);
582 } /* do_computed_value_Div */
585 * Calculate the value of an integer Mod of two nodes.
586 * Special case: a % 1
588 static tarval *do_computed_value_Mod(const ir_node *a, const ir_node *b) {
589 tarval *ta = value_of(a);
590 tarval *tb = value_of(b);
592 /* Compute a % 1 or c1 % c2 */
593 if (tarval_is_one(tb))
594 return get_mode_null(get_irn_mode(a));
595 if (ta != tarval_bad && tb != tarval_bad)
596 return tarval_mod(ta, tb);
598 } /* do_computed_value_Mod */
601 * Return the value of a Proj(DivMod).
603 static tarval *computed_value_Proj_DivMod(const ir_node *n) {
604 long proj_nr = get_Proj_proj(n);
606 /* compute either the Div or the Mod part */
607 if (proj_nr == pn_DivMod_res_div) {
608 const ir_node *a = get_Proj_pred(n);
609 return do_computed_value_Div(get_DivMod_left(a), get_DivMod_right(a));
610 } else if (proj_nr == pn_DivMod_res_mod) {
611 const ir_node *a = get_Proj_pred(n);
612 return do_computed_value_Mod(get_DivMod_left(a), get_DivMod_right(a));
615 } /* computed_value_Proj_DivMod */
618 * Return the value of a Proj(Div).
620 static tarval *computed_value_Proj_Div(const ir_node *n) {
621 long proj_nr = get_Proj_proj(n);
623 if (proj_nr == pn_Div_res) {
624 const ir_node *a = get_Proj_pred(n);
625 return do_computed_value_Div(get_Div_left(a), get_Div_right(a));
628 } /* computed_value_Proj_Div */
631 * Return the value of a Proj(Mod).
633 static tarval *computed_value_Proj_Mod(const ir_node *n) {
634 long proj_nr = get_Proj_proj(n);
636 if (proj_nr == pn_Mod_res) {
637 const ir_node *a = get_Proj_pred(n);
638 return do_computed_value_Mod(get_Mod_left(a), get_Mod_right(a));
641 } /* computed_value_Proj_Mod */
644 * Return the value of a Proj(Quot).
646 static tarval *computed_value_Proj_Quot(const ir_node *n) {
647 long proj_nr = get_Proj_proj(n);
649 if (proj_nr == pn_Quot_res) {
650 const ir_node *a = get_Proj_pred(n);
651 return do_computed_value_Quot(get_Quot_left(a), get_Quot_right(a));
654 } /* computed_value_Proj_Quot */
657 * Return the value of a Proj.
659 static tarval *computed_value_Proj(const ir_node *proj) {
660 ir_node *n = get_Proj_pred(proj);
662 if (n->op->ops.computed_value_Proj != NULL)
663 return n->op->ops.computed_value_Proj(proj);
665 } /* computed_value_Proj */
668 * If the parameter n can be computed, return its value, else tarval_bad.
669 * Performs constant folding.
671 * @param n The node this should be evaluated
673 tarval *computed_value(const ir_node *n) {
674 if (n->op->ops.computed_value)
675 return n->op->ops.computed_value(n);
677 } /* computed_value */
680 * Set the default computed_value evaluator in an ir_op_ops.
682 * @param code the opcode for the default operation
683 * @param ops the operations initialized
688 static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops)
692 ops->computed_value = computed_value_##a; \
694 #define CASE_PROJ(a) \
696 ops->computed_value_Proj = computed_value_Proj_##a; \
733 } /* firm_set_default_computed_value */
736 * Returns a equivalent block for another block.
737 * If the block has only one predecessor, this is
738 * the equivalent one. If the only predecessor of a block is
739 * the block itself, this is a dead block.
741 * If both predecessors of a block are the branches of a binary
742 * Cond, the equivalent block is Cond's block.
744 * If all predecessors of a block are bad or lies in a dead
745 * block, the current block is dead as well.
747 * Note, that blocks are NEVER turned into Bad's, instead
748 * the dead_block flag is set. So, never test for is_Bad(block),
749 * always use is_dead_Block(block).
751 static ir_node *equivalent_node_Block(ir_node *n)
756 /* don't optimize dead blocks */
757 if (is_Block_dead(n))
760 n_preds = get_Block_n_cfgpreds(n);
762 /* The Block constructor does not call optimize, but mature_immBlock()
763 calls the optimization. */
764 assert(get_Block_matured(n));
766 /* Straightening: a single entry Block following a single exit Block
767 can be merged, if it is not the Start block. */
768 /* !!! Beware, all Phi-nodes of n must have been optimized away.
769 This should be true, as the block is matured before optimize is called.
770 But what about Phi-cycles with the Phi0/Id that could not be resolved?
771 Remaining Phi nodes are just Ids. */
773 ir_node *pred = skip_Proj(get_Block_cfgpred(n, 0));
776 ir_node *predblock = get_nodes_block(pred);
777 if (predblock == oldn) {
778 /* Jmp jumps into the block it is in -- deal self cycle. */
779 n = set_Block_dead(n);
780 DBG_OPT_DEAD_BLOCK(oldn, n);
781 } else if (get_opt_control_flow_straightening()) {
783 DBG_OPT_STG(oldn, n);
785 } else if (is_Cond(pred)) {
786 ir_node *predblock = get_nodes_block(pred);
787 if (predblock == oldn) {
788 /* Jmp jumps into the block it is in -- deal self cycle. */
789 n = set_Block_dead(n);
790 DBG_OPT_DEAD_BLOCK(oldn, n);
793 } else if ((n_preds == 2) &&
794 (get_opt_control_flow_weak_simplification())) {
795 /* Test whether Cond jumps twice to this block
796 * The more general case which more than 2 predecessors is handles
797 * in optimize_cf(), we handle only this special case for speed here.
799 ir_node *a = get_Block_cfgpred(n, 0);
800 ir_node *b = get_Block_cfgpred(n, 1);
802 if (is_Proj(a) && is_Proj(b)) {
803 ir_node *cond = get_Proj_pred(a);
805 if (cond == get_Proj_pred(b) && is_Cond(cond) &&
806 get_irn_mode(get_Cond_selector(cond)) == mode_b) {
807 /* Also a single entry Block following a single exit Block. Phis have
808 twice the same operand and will be optimized away. */
809 n = get_nodes_block(cond);
810 DBG_OPT_IFSIM1(oldn, a, b, n);
813 } else if (get_opt_unreachable_code() &&
814 (n != get_irg_start_block(current_ir_graph)) &&
815 (n != get_irg_end_block(current_ir_graph)) ) {
818 /* If all inputs are dead, this block is dead too, except if it is
819 the start or end block. This is one step of unreachable code
821 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
822 ir_node *pred = get_Block_cfgpred(n, i);
825 if (is_Bad(pred)) continue;
826 pred_blk = get_nodes_block(skip_Proj(pred));
828 if (is_Block_dead(pred_blk)) continue;
831 /* really found a living input */
836 n = set_Block_dead(n);
837 DBG_OPT_DEAD_BLOCK(oldn, n);
842 } /* equivalent_node_Block */
845 * Returns a equivalent node for a Jmp, a Bad :-)
846 * Of course this only happens if the Block of the Jmp is dead.
848 static ir_node *equivalent_node_Jmp(ir_node *n) {
851 /* unreachable code elimination */
852 if (is_Block_dead(get_nodes_block(n))) {
853 n = get_irg_bad(current_ir_graph);
854 DBG_OPT_DEAD_BLOCK(oldn, n);
857 } /* equivalent_node_Jmp */
859 /** Raise is handled in the same way as Jmp. */
860 #define equivalent_node_Raise equivalent_node_Jmp
863 /* We do not evaluate Cond here as we replace it by a new node, a Jmp.
864 See transform_node_Proj_Cond(). */
867 * Optimize operations that are commutative and have neutral 0,
868 * so a op 0 = 0 op a = a.
870 static ir_node *equivalent_node_neutral_zero(ir_node *n) {
873 ir_node *a = get_binop_left(n);
874 ir_node *b = get_binop_right(n);
879 /* After running compute_node there is only one constant predecessor.
880 Find this predecessors value and remember the other node: */
881 if ((tv = value_of(a)) != tarval_bad) {
883 } else if ((tv = value_of(b)) != tarval_bad) {
888 /* If this predecessors constant value is zero, the operation is
889 * unnecessary. Remove it.
891 * Beware: If n is a Add, the mode of on and n might be different
892 * which happens in this rare construction: NULL + 3.
893 * Then, a Conv would be needed which we cannot include here.
895 if (tarval_is_null(tv) && get_irn_mode(on) == get_irn_mode(n)) {
898 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
902 } /* equivalent_node_neutral_zero */
905 * Eor is commutative and has neutral 0.
907 static ir_node *equivalent_node_Eor(ir_node *n) {
912 n = equivalent_node_neutral_zero(n);
913 if (n != oldn) return n;
916 b = get_Eor_right(n);
919 ir_node *aa = get_Eor_left(a);
920 ir_node *ab = get_Eor_right(a);
923 /* (a ^ b) ^ a -> b */
925 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
927 } else if (ab == b) {
928 /* (a ^ b) ^ b -> a */
930 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
935 ir_node *ba = get_Eor_left(b);
936 ir_node *bb = get_Eor_right(b);
939 /* a ^ (a ^ b) -> b */
941 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
943 } else if (bb == a) {
944 /* a ^ (b ^ a) -> b */
946 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
954 * Optimize a - 0 and (a - x) + x (for modes with wrap-around).
956 * The second one looks strange, but this construct
957 * is used heavily in the LCC sources :-).
959 * Beware: The Mode of an Add may be different than the mode of its
960 * predecessors, so we could not return a predecessors in all cases.
962 static ir_node *equivalent_node_Add(ir_node *n) {
964 ir_node *left, *right;
965 ir_mode *mode = get_irn_mode(n);
967 n = equivalent_node_neutral_zero(n);
971 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
972 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
975 left = get_Add_left(n);
976 right = get_Add_right(n);
979 if (get_Sub_right(left) == right) {
982 n = get_Sub_left(left);
983 if (mode == get_irn_mode(n)) {
984 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
990 if (get_Sub_right(right) == left) {
993 n = get_Sub_left(right);
994 if (mode == get_irn_mode(n)) {
995 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
1001 } /* equivalent_node_Add */
1004 * optimize operations that are not commutative but have neutral 0 on left,
1007 static ir_node *equivalent_node_left_zero(ir_node *n) {
1010 ir_node *a = get_binop_left(n);
1011 ir_node *b = get_binop_right(n);
1012 tarval *tb = value_of(b);
1014 if (tarval_is_null(tb)) {
1017 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
1020 } /* equivalent_node_left_zero */
1022 #define equivalent_node_Shl equivalent_node_left_zero
1023 #define equivalent_node_Shr equivalent_node_left_zero
1024 #define equivalent_node_Shrs equivalent_node_left_zero
1025 #define equivalent_node_Rotl equivalent_node_left_zero
1028 * Optimize a - 0 and (a + x) - x (for modes with wrap-around).
1030 * The second one looks strange, but this construct
1031 * is used heavily in the LCC sources :-).
1033 * Beware: The Mode of a Sub may be different than the mode of its
1034 * predecessors, so we could not return a predecessors in all cases.
1036 static ir_node *equivalent_node_Sub(ir_node *n) {
1039 ir_mode *mode = get_irn_mode(n);
1042 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
1043 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
1046 b = get_Sub_right(n);
1049 /* Beware: modes might be different */
1050 if (tarval_is_null(tb)) {
1051 ir_node *a = get_Sub_left(n);
1052 if (mode == get_irn_mode(a)) {
1055 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
1059 } /* equivalent_node_Sub */
1063 * Optimize an "self-inverse unary op", ie op(op(n)) = n.
1066 * -(-a) == a, but might overflow two times.
1067 * We handle it anyway here but the better way would be a
1068 * flag. This would be needed for Pascal for instance.
1070 static ir_node *equivalent_node_idempotent_unop(ir_node *n) {
1072 ir_node *pred = get_unop_op(n);
1074 /* optimize symmetric unop */
1075 if (get_irn_op(pred) == get_irn_op(n)) {
1076 n = get_unop_op(pred);
1077 DBG_OPT_ALGSIM2(oldn, pred, n, FS_OPT_IDEM_UNARY);
1080 } /* equivalent_node_idempotent_unop */
1082 /** Optimize Not(Not(x)) == x. */
1083 #define equivalent_node_Not equivalent_node_idempotent_unop
1085 /** -(-x) == x ??? Is this possible or can --x raise an
1086 out of bounds exception if min =! max? */
1087 #define equivalent_node_Minus equivalent_node_idempotent_unop
1090 * Optimize a * 1 = 1 * a = a.
1092 static ir_node *equivalent_node_Mul(ir_node *n) {
1094 ir_node *a = get_Mul_left(n);
1096 /* we can handle here only the n * n = n bit cases */
1097 if (get_irn_mode(n) == get_irn_mode(a)) {
1098 ir_node *b = get_Mul_right(n);
1102 * Mul is commutative and has again an other neutral element.
1103 * Constants are place right, so check this case first.
1106 if (tarval_is_one(tv)) {
1108 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1111 if (tarval_is_one(tv)) {
1113 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1118 } /* equivalent_node_Mul */
1121 * Use algebraic simplification a | a = a | 0 = 0 | a = a.
1123 static ir_node *equivalent_node_Or(ir_node *n) {
1126 ir_node *a = get_Or_left(n);
1127 ir_node *b = get_Or_right(n);
1131 n = a; /* Or has it's own neutral element */
1132 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_OR);
1135 /* constants are cormalized to right, check this site first */
1137 if (tarval_is_null(tv)) {
1139 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1143 if (tarval_is_null(tv)) {
1145 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1150 } /* equivalent_node_Or */
1153 * Optimize a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a.
1155 static ir_node *equivalent_node_And(ir_node *n) {
1158 ir_node *a = get_And_left(n);
1159 ir_node *b = get_And_right(n);
1163 n = a; /* And has it's own neutral element */
1164 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_AND);
1167 /* constants are cormalized to right, check this site first */
1169 if (tarval_is_all_one(tv)) {
1171 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1175 if (tarval_is_all_one(tv)) {
1177 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1181 if (b == get_Or_left(a) || b == get_Or_right(a)) {
1184 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1189 if (a == get_Or_left(b) || a == get_Or_right(b)) {
1192 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1197 } /* equivalent_node_And */
1200 * Try to remove useless Conv's:
1202 static ir_node *equivalent_node_Conv(ir_node *n) {
1204 ir_node *a = get_Conv_op(n);
1206 ir_mode *n_mode = get_irn_mode(n);
1207 ir_mode *a_mode = get_irn_mode(a);
1210 if (n_mode == a_mode) { /* No Conv necessary */
1211 if (get_Conv_strict(n)) {
1212 /* special case: the predecessor might be a also a Conv */
1214 if (! get_Conv_strict(a)) {
1215 /* first one is not strict, kick it */
1217 a_mode = get_irn_mode(a);
1221 /* else both are strict conv, second is superfluous */
1222 } else if (is_Proj(a)) {
1223 ir_node *pred = get_Proj_pred(a);
1224 if (is_Load(pred)) {
1225 /* loads always return with the exact precision of n_mode */
1226 assert(get_Load_mode(pred) == n_mode);
1229 /* leave strict floating point Conv's */
1232 /* leave strict floating point Conv's */
1237 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1238 } else if (is_Conv(a)) { /* Conv(Conv(b)) */
1239 ir_node *b = get_Conv_op(a);
1240 ir_mode *b_mode = get_irn_mode(b);
1242 if (get_Conv_strict(n) && get_Conv_strict(a)) {
1243 /* both are strict conv */
1244 if (smaller_mode(a_mode, n_mode)) {
1245 /* both are strict, but the first is smaller, so
1246 the second cannot remove more precision, remove the
1248 set_Conv_strict(n, 0);
1251 if (n_mode == b_mode) {
1252 if (! get_Conv_strict(n) && ! get_Conv_strict(a)) {
1253 if (n_mode == mode_b) {
1254 n = b; /* Convb(Conv*(xxxb(...))) == xxxb(...) */
1255 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1256 } else if (get_mode_arithmetic(n_mode) == get_mode_arithmetic(a_mode)) {
1257 if (smaller_mode(b_mode, a_mode)) {
1258 n = b; /* ConvS(ConvL(xxxS(...))) == xxxS(...) */
1259 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1263 if (mode_is_int(n_mode) && mode_is_float(a_mode)) {
1264 /* ConvI(ConvF(I)) -> I, iff float mantissa >= int mode */
1265 size_t int_mantissa = get_mode_size_bits(n_mode) - (mode_is_signed(n_mode) ? 1 : 0);
1266 size_t float_mantissa;
1267 /* FIXME There is no way to get the mantissa size of a mode */
1268 switch (get_mode_size_bits(a_mode)) {
1269 case 32: float_mantissa = 23 + 1; break; // + 1 for implicit 1
1270 case 64: float_mantissa = 52 + 1; break;
1271 case 80: float_mantissa = 64 + 1; break;
1272 default: float_mantissa = 0; break;
1274 if (float_mantissa != 0 && float_mantissa >= int_mantissa) {
1276 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1281 if (smaller_mode(b_mode, a_mode)) {
1282 if (get_Conv_strict(n))
1283 set_Conv_strict(b, 1);
1284 n = b; /* ConvA(ConvB(ConvA(...))) == ConvA(...) */
1285 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1291 } /* equivalent_node_Conv */
1294 * A Cast may be removed if the type of the previous node
1295 * is already the type of the Cast.
1297 static ir_node *equivalent_node_Cast(ir_node *n) {
1299 ir_node *pred = get_Cast_op(n);
1301 if (get_irn_type(pred) == get_Cast_type(n)) {
1303 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CAST);
1306 } /* equivalent_node_Cast */
1309 * - fold Phi-nodes, iff they have only one predecessor except
1312 static ir_node *equivalent_node_Phi(ir_node *n) {
1317 ir_node *first_val = NULL; /* to shutup gcc */
1319 if (!get_opt_normalize()) return n;
1321 n_preds = get_Phi_n_preds(n);
1323 block = get_nodes_block(n);
1324 if (is_Block_dead(block)) /* Control dead */
1325 return get_irg_bad(current_ir_graph);
1327 if (n_preds == 0) return n; /* Phi of dead Region without predecessors. */
1329 /* Find first non-self-referencing input */
1330 for (i = 0; i < n_preds; ++i) {
1331 first_val = get_Phi_pred(n, i);
1332 if ( (first_val != n) /* not self pointer */
1334 /* BEWARE: when the if is changed to 1, Phi's will ignore it's Bad
1335 * predecessors. Then, Phi nodes in dead code might be removed, causing
1336 * nodes pointing to themself (Add's for instance).
1337 * This is really bad and causes endless recursions in several
1338 * code pathes, so we do NOT optimize such a code.
1339 * This is not that bad as it sounds, optimize_cf() removes bad control flow
1340 * (and bad Phi predecessors), so live code is optimized later.
1342 && (! is_Bad(get_Block_cfgpred(block, i)))
1344 ) { /* value not dead */
1345 break; /* then found first value. */
1350 /* A totally Bad or self-referencing Phi (we didn't break the above loop) */
1351 return get_irg_bad(current_ir_graph);
1354 /* search for rest of inputs, determine if any of these
1355 are non-self-referencing */
1356 while (++i < n_preds) {
1357 ir_node *scnd_val = get_Phi_pred(n, i);
1358 if ( (scnd_val != n)
1359 && (scnd_val != first_val)
1362 && (! is_Bad(get_Block_cfgpred(block, i)))
1370 /* Fold, if no multiple distinct non-self-referencing inputs */
1372 DBG_OPT_PHI(oldn, n);
1375 } /* equivalent_node_Phi */
1378 * Several optimizations:
1379 * - fold Sync-nodes, iff they have only one predecessor except
1382 static ir_node *equivalent_node_Sync(ir_node *n) {
1383 int arity = get_Sync_n_preds(n);
1386 for (i = 0; i < arity;) {
1387 ir_node *pred = get_Sync_pred(n, i);
1390 /* Remove Bad predecessors */
1397 /* Remove duplicate predecessors */
1403 if (get_Sync_pred(n, j) == pred) {
1411 if (arity == 0) return get_irg_bad(current_ir_graph);
1412 if (arity == 1) return get_Sync_pred(n, 0);
1414 } /* equivalent_node_Sync */
1417 * Optimize Proj(Tuple).
1419 static ir_node *equivalent_node_Proj_Tuple(ir_node *proj) {
1420 ir_node *oldn = proj;
1421 ir_node *tuple = get_Proj_pred(proj);
1423 /* Remove the Tuple/Proj combination. */
1424 proj = get_Tuple_pred(tuple, get_Proj_proj(proj));
1425 DBG_OPT_TUPLE(oldn, tuple, proj);
1428 } /* equivalent_node_Proj_Tuple */
1431 * Optimize a / 1 = a.
1433 static ir_node *equivalent_node_Proj_Div(ir_node *proj) {
1434 ir_node *oldn = proj;
1435 ir_node *div = get_Proj_pred(proj);
1436 ir_node *b = get_Div_right(div);
1437 tarval *tb = value_of(b);
1439 /* Div is not commutative. */
1440 if (tarval_is_one(tb)) { /* div(x, 1) == x */
1441 switch (get_Proj_proj(proj)) {
1443 proj = get_Div_mem(div);
1444 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1448 proj = get_Div_left(div);
1449 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1453 /* we cannot replace the exception Proj's here, this is done in
1454 transform_node_Proj_Div() */
1459 } /* equivalent_node_Proj_Div */
1462 * Optimize a / 1.0 = a.
1464 static ir_node *equivalent_node_Proj_Quot(ir_node *proj) {
1465 ir_node *oldn = proj;
1466 ir_node *quot = get_Proj_pred(proj);
1467 ir_node *b = get_Quot_right(quot);
1468 tarval *tb = value_of(b);
1470 /* Div is not commutative. */
1471 if (tarval_is_one(tb)) { /* Quot(x, 1) == x */
1472 switch (get_Proj_proj(proj)) {
1474 proj = get_Quot_mem(quot);
1475 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1479 proj = get_Quot_left(quot);
1480 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1484 /* we cannot replace the exception Proj's here, this is done in
1485 transform_node_Proj_Quot() */
1490 } /* equivalent_node_Proj_Quot */
1493 * Optimize a / 1 = a.
1495 static ir_node *equivalent_node_Proj_DivMod(ir_node *proj) {
1496 ir_node *oldn = proj;
1497 ir_node *divmod = get_Proj_pred(proj);
1498 ir_node *b = get_DivMod_right(divmod);
1499 tarval *tb = value_of(b);
1501 /* Div is not commutative. */
1502 if (tarval_is_one(tb)) { /* div(x, 1) == x */
1503 switch (get_Proj_proj(proj)) {
1505 proj = get_DivMod_mem(divmod);
1506 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1509 case pn_DivMod_res_div:
1510 proj = get_DivMod_left(divmod);
1511 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1515 /* we cannot replace the exception Proj's here, this is done in
1516 transform_node_Proj_DivMod().
1517 Note further that the pn_DivMod_res_div case is handled in
1518 computed_value_Proj(). */
1523 } /* equivalent_node_Proj_DivMod */
1526 * Optimize CopyB(mem, x, x) into a Nop.
1528 static ir_node *equivalent_node_Proj_CopyB(ir_node *proj) {
1529 ir_node *oldn = proj;
1530 ir_node *copyb = get_Proj_pred(proj);
1531 ir_node *a = get_CopyB_dst(copyb);
1532 ir_node *b = get_CopyB_src(copyb);
1535 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
1536 switch (get_Proj_proj(proj)) {
1537 case pn_CopyB_M_regular:
1538 proj = get_CopyB_mem(copyb);
1539 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
1542 case pn_CopyB_M_except:
1543 case pn_CopyB_X_except:
1544 DBG_OPT_EXC_REM(proj);
1545 proj = get_irg_bad(current_ir_graph);
1550 } /* equivalent_node_Proj_CopyB */
1553 * Optimize Bounds(idx, idx, upper) into idx.
1555 static ir_node *equivalent_node_Proj_Bound(ir_node *proj) {
1556 ir_node *oldn = proj;
1557 ir_node *bound = get_Proj_pred(proj);
1558 ir_node *idx = get_Bound_index(bound);
1559 ir_node *pred = skip_Proj(idx);
1562 if (idx == get_Bound_lower(bound))
1564 else if (is_Bound(pred)) {
1566 * idx was Bounds checked in the same MacroBlock previously,
1567 * it is still valid if lower <= pred_lower && pred_upper <= upper.
1569 ir_node *lower = get_Bound_lower(bound);
1570 ir_node *upper = get_Bound_upper(bound);
1571 if (get_Bound_lower(pred) == lower &&
1572 get_Bound_upper(pred) == upper &&
1573 get_irn_MacroBlock(bound) == get_irn_MacroBlock(pred)) {
1575 * One could expect that we simply return the previous
1576 * Bound here. However, this would be wrong, as we could
1577 * add an exception Proj to a new location then.
1578 * So, we must turn in into a tuple.
1584 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
1585 switch (get_Proj_proj(proj)) {
1587 DBG_OPT_EXC_REM(proj);
1588 proj = get_Bound_mem(bound);
1590 case pn_Bound_X_except:
1591 DBG_OPT_EXC_REM(proj);
1592 proj = get_irg_bad(current_ir_graph);
1596 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
1599 /* cannot optimize pn_Bound_X_regular, handled in transform ... */
1604 } /* equivalent_node_Proj_Bound */
1607 * Optimize an Exception Proj(Load) with a non-null address.
1609 static ir_node *equivalent_node_Proj_Load(ir_node *proj) {
1610 if (get_opt_ldst_only_null_ptr_exceptions()) {
1611 if (get_irn_mode(proj) == mode_X) {
1612 ir_node *load = get_Proj_pred(proj);
1614 /* get the Load address */
1615 const ir_node *addr = get_Load_ptr(load);
1616 const ir_node *confirm;
1618 if (value_not_null(addr, &confirm)) {
1619 if (get_Proj_proj(proj) == pn_Load_X_except) {
1620 DBG_OPT_EXC_REM(proj);
1621 return get_irg_bad(current_ir_graph);
1627 } /* equivalent_node_Proj_Load */
1630 * Optimize an Exception Proj(Store) with a non-null address.
1632 static ir_node *equivalent_node_Proj_Store(ir_node *proj) {
1633 if (get_opt_ldst_only_null_ptr_exceptions()) {
1634 if (get_irn_mode(proj) == mode_X) {
1635 ir_node *store = get_Proj_pred(proj);
1637 /* get the load/store address */
1638 const ir_node *addr = get_Store_ptr(store);
1639 const ir_node *confirm;
1641 if (value_not_null(addr, &confirm)) {
1642 if (get_Proj_proj(proj) == pn_Store_X_except) {
1643 DBG_OPT_EXC_REM(proj);
1644 return get_irg_bad(current_ir_graph);
1650 } /* equivalent_node_Proj_Store */
1653 * Does all optimizations on nodes that must be done on it's Proj's
1654 * because of creating new nodes.
1656 static ir_node *equivalent_node_Proj(ir_node *proj) {
1657 ir_node *n = get_Proj_pred(proj);
1659 if (get_irn_mode(proj) == mode_X) {
1660 if (is_Block_dead(get_nodes_block(n))) {
1661 /* Remove dead control flow -- early gigo(). */
1662 return get_irg_bad(current_ir_graph);
1665 if (n->op->ops.equivalent_node_Proj)
1666 return n->op->ops.equivalent_node_Proj(proj);
1668 } /* equivalent_node_Proj */
1673 static ir_node *equivalent_node_Id(ir_node *n) {
1680 DBG_OPT_ID(oldn, n);
1682 } /* equivalent_node_Id */
1687 static ir_node *equivalent_node_Mux(ir_node *n)
1689 ir_node *oldn = n, *sel = get_Mux_sel(n);
1690 tarval *ts = value_of(sel);
1692 /* Mux(true, f, t) == t */
1693 if (ts == tarval_b_true) {
1694 n = get_Mux_true(n);
1695 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1697 /* Mux(false, f, t) == f */
1698 else if (ts == tarval_b_false) {
1699 n = get_Mux_false(n);
1700 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1702 /* Mux(v, x, x) == x */
1703 else if (get_Mux_false(n) == get_Mux_true(n)) {
1704 n = get_Mux_true(n);
1705 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1707 else if (is_Proj(sel) && !mode_honor_signed_zeros(get_irn_mode(n))) {
1708 ir_node *cmp = get_Proj_pred(sel);
1709 long proj_nr = get_Proj_proj(sel);
1710 ir_node *f = get_Mux_false(n);
1711 ir_node *t = get_Mux_true(n);
1714 * Note further that these optimization work even for floating point
1715 * with NaN's because -NaN == NaN.
1716 * However, if +0 and -0 is handled differently, we cannot use the first one.
1719 ir_node *const cmp_l = get_Cmp_left(cmp);
1720 ir_node *const cmp_r = get_Cmp_right(cmp);
1724 if ((cmp_l == t && cmp_r == f) || /* Mux(t == f, t, f) -> f */
1725 (cmp_l == f && cmp_r == t)) { /* Mux(f == t, t, f) -> f */
1727 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1734 if ((cmp_l == t && cmp_r == f) || /* Mux(t != f, t, f) -> t */
1735 (cmp_l == f && cmp_r == t)) { /* Mux(f != t, t, f) -> t */
1737 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1744 * Note: normalization puts the constant on the right side,
1745 * so we check only one case.
1747 if (cmp_l == t && tarval_is_null(value_of(cmp_r))) {
1748 /* Mux(t CMP 0, X, t) */
1749 if (is_Minus(f) && get_Minus_op(f) == t) {
1750 /* Mux(t CMP 0, -t, t) */
1751 if (proj_nr == pn_Cmp_Eq) {
1752 /* Mux(t == 0, -t, t) ==> -t */
1754 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1755 } else if (proj_nr == pn_Cmp_Lg || proj_nr == pn_Cmp_Ne) {
1756 /* Mux(t != 0, -t, t) ==> t */
1758 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1765 } /* equivalent_node_Mux */
1768 * Remove Confirm nodes if setting is on.
1769 * Replace Confirms(x, '=', Constlike) by Constlike.
1771 static ir_node *equivalent_node_Confirm(ir_node *n) {
1772 ir_node *pred = get_Confirm_value(n);
1773 pn_Cmp pnc = get_Confirm_cmp(n);
1775 while (is_Confirm(pred) && pnc == get_Confirm_cmp(pred)) {
1777 * rare case: two identical Confirms one after another,
1778 * replace the second one with the first.
1781 pred = get_Confirm_value(n);
1782 pnc = get_Confirm_cmp(n);
1784 if (get_opt_remove_confirm())
1785 return get_Confirm_value(n);
1790 * equivalent_node() returns a node equivalent to input n. It skips all nodes that
1791 * perform no actual computation, as, e.g., the Id nodes. It does not create
1792 * new nodes. It is therefore safe to free n if the node returned is not n.
1793 * If a node returns a Tuple we can not just skip it. If the size of the
1794 * in array fits, we transform n into a tuple (e.g., Div).
1796 ir_node *equivalent_node(ir_node *n) {
1797 if (n->op->ops.equivalent_node)
1798 return n->op->ops.equivalent_node(n);
1800 } /* equivalent_node */
1803 * Sets the default equivalent node operation for an ir_op_ops.
1805 * @param code the opcode for the default operation
1806 * @param ops the operations initialized
1811 static ir_op_ops *firm_set_default_equivalent_node(ir_opcode code, ir_op_ops *ops)
1815 ops->equivalent_node = equivalent_node_##a; \
1817 #define CASE_PROJ(a) \
1819 ops->equivalent_node_Proj = equivalent_node_Proj_##a; \
1861 } /* firm_set_default_equivalent_node */
1864 * Returns non-zero if a node is a Phi node
1865 * with all predecessors constant.
1867 static int is_const_Phi(ir_node *n) {
1870 if (! is_Phi(n) || get_irn_arity(n) == 0)
1872 for (i = get_irn_arity(n) - 1; i >= 0; --i)
1873 if (! is_Const(get_irn_n(n, i)))
1876 } /* is_const_Phi */
1878 typedef tarval *(*tarval_sub_type)(tarval *a, tarval *b, ir_mode *mode);
1879 typedef tarval *(*tarval_binop_type)(tarval *a, tarval *b);
1882 * Wrapper for the tarval binop evaluation, tarval_sub has one more parameter.
1884 static tarval *do_eval(tarval *(*eval)(), tarval *a, tarval *b, ir_mode *mode) {
1885 if (eval == tarval_sub) {
1886 tarval_sub_type func = (tarval_sub_type)eval;
1888 return func(a, b, mode);
1890 tarval_binop_type func = (tarval_binop_type)eval;
1897 * Apply an evaluator on a binop with a constant operators (and one Phi).
1899 * @param phi the Phi node
1900 * @param other the other operand
1901 * @param eval an evaluator function
1902 * @param mode the mode of the result, may be different from the mode of the Phi!
1903 * @param left if non-zero, other is the left operand, else the right
1905 * @return a new Phi node if the conversion was successful, NULL else
1907 static ir_node *apply_binop_on_phi(ir_node *phi, tarval *other, tarval *(*eval)(), ir_mode *mode, int left) {
1912 int i, n = get_irn_arity(phi);
1914 NEW_ARR_A(void *, res, n);
1916 for (i = 0; i < n; ++i) {
1917 pred = get_irn_n(phi, i);
1918 tv = get_Const_tarval(pred);
1919 tv = do_eval(eval, other, tv, mode);
1921 if (tv == tarval_bad) {
1922 /* folding failed, bad */
1928 for (i = 0; i < n; ++i) {
1929 pred = get_irn_n(phi, i);
1930 tv = get_Const_tarval(pred);
1931 tv = do_eval(eval, tv, other, mode);
1933 if (tv == tarval_bad) {
1934 /* folding failed, bad */
1940 irg = current_ir_graph;
1941 for (i = 0; i < n; ++i) {
1942 pred = get_irn_n(phi, i);
1943 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
1944 mode, res[i], get_Const_type(pred));
1946 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
1947 } /* apply_binop_on_phi */
1950 * Apply an evaluator on a binop with two constant Phi.
1952 * @param a the left Phi node
1953 * @param b the right Phi node
1954 * @param eval an evaluator function
1955 * @param mode the mode of the result, may be different from the mode of the Phi!
1957 * @return a new Phi node if the conversion was successful, NULL else
1959 static ir_node *apply_binop_on_2_phis(ir_node *a, ir_node *b, tarval *(*eval)(), ir_mode *mode) {
1960 tarval *tv_l, *tv_r, *tv;
1966 if (get_nodes_block(a) != get_nodes_block(b))
1969 n = get_irn_arity(a);
1970 NEW_ARR_A(void *, res, n);
1972 for (i = 0; i < n; ++i) {
1973 pred = get_irn_n(a, i);
1974 tv_l = get_Const_tarval(pred);
1975 pred = get_irn_n(b, i);
1976 tv_r = get_Const_tarval(pred);
1977 tv = do_eval(eval, tv_l, tv_r, mode);
1979 if (tv == tarval_bad) {
1980 /* folding failed, bad */
1985 irg = current_ir_graph;
1986 for (i = 0; i < n; ++i) {
1987 pred = get_irn_n(a, i);
1988 res[i] = new_r_Const_type(irg, get_irg_start_block(irg), mode, res[i], get_Const_type(pred));
1990 return new_r_Phi(irg, get_nodes_block(a), n, (ir_node **)res, mode);
1991 } /* apply_binop_on_2_phis */
1994 * Apply an evaluator on a unop with a constant operator (a Phi).
1996 * @param phi the Phi node
1997 * @param eval an evaluator function
1999 * @return a new Phi node if the conversion was successful, NULL else
2001 static ir_node *apply_unop_on_phi(ir_node *phi, tarval *(*eval)(tarval *)) {
2007 int i, n = get_irn_arity(phi);
2009 NEW_ARR_A(void *, res, n);
2010 for (i = 0; i < n; ++i) {
2011 pred = get_irn_n(phi, i);
2012 tv = get_Const_tarval(pred);
2015 if (tv == tarval_bad) {
2016 /* folding failed, bad */
2021 mode = get_irn_mode(phi);
2022 irg = current_ir_graph;
2023 for (i = 0; i < n; ++i) {
2024 pred = get_irn_n(phi, i);
2025 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
2026 mode, res[i], get_Const_type(pred));
2028 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
2029 } /* apply_unop_on_phi */
2032 * Apply a conversion on a constant operator (a Phi).
2034 * @param phi the Phi node
2036 * @return a new Phi node if the conversion was successful, NULL else
2038 static ir_node *apply_conv_on_phi(ir_node *phi, ir_mode *mode) {
2043 int i, n = get_irn_arity(phi);
2045 NEW_ARR_A(void *, res, n);
2046 for (i = 0; i < n; ++i) {
2047 pred = get_irn_n(phi, i);
2048 tv = get_Const_tarval(pred);
2049 tv = tarval_convert_to(tv, mode);
2051 if (tv == tarval_bad) {
2052 /* folding failed, bad */
2057 irg = current_ir_graph;
2058 for (i = 0; i < n; ++i) {
2059 pred = get_irn_n(phi, i);
2060 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
2061 mode, res[i], get_Const_type(pred));
2063 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
2064 } /* apply_conv_on_phi */
2067 * Transform AddP(P, ConvIs(Iu)), AddP(P, ConvIu(Is)) and
2068 * SubP(P, ConvIs(Iu)), SubP(P, ConvIu(Is)).
2069 * If possible, remove the Conv's.
2071 static ir_node *transform_node_AddSub(ir_node *n) {
2072 ir_mode *mode = get_irn_mode(n);
2074 if (mode_is_reference(mode)) {
2075 ir_node *left = get_binop_left(n);
2076 ir_node *right = get_binop_right(n);
2077 unsigned ref_bits = get_mode_size_bits(mode);
2079 if (is_Conv(left)) {
2080 ir_mode *lmode = get_irn_mode(left);
2081 unsigned bits = get_mode_size_bits(lmode);
2083 if (ref_bits == bits &&
2084 mode_is_int(lmode) &&
2085 get_mode_arithmetic(lmode) == irma_twos_complement) {
2086 ir_node *pre = get_Conv_op(left);
2087 ir_mode *pre_mode = get_irn_mode(pre);
2089 if (mode_is_int(pre_mode) &&
2090 get_mode_size_bits(pre_mode) == bits &&
2091 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
2092 /* ok, this conv just changes to sign, moreover the calculation
2093 * is done with same number of bits as our address mode, so
2094 * we can ignore the conv as address calculation can be viewed
2095 * as either signed or unsigned
2097 set_binop_left(n, pre);
2102 if (is_Conv(right)) {
2103 ir_mode *rmode = get_irn_mode(right);
2104 unsigned bits = get_mode_size_bits(rmode);
2106 if (ref_bits == bits &&
2107 mode_is_int(rmode) &&
2108 get_mode_arithmetic(rmode) == irma_twos_complement) {
2109 ir_node *pre = get_Conv_op(right);
2110 ir_mode *pre_mode = get_irn_mode(pre);
2112 if (mode_is_int(pre_mode) &&
2113 get_mode_size_bits(pre_mode) == bits &&
2114 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
2115 /* ok, this conv just changes to sign, moreover the calculation
2116 * is done with same number of bits as our address mode, so
2117 * we can ignore the conv as address calculation can be viewed
2118 * as either signed or unsigned
2120 set_binop_right(n, pre);
2125 /* let address arithmetic use unsigned modes */
2126 if (is_Const(right)) {
2127 ir_mode *rmode = get_irn_mode(right);
2129 if (mode_is_signed(rmode) && get_mode_arithmetic(rmode) == irma_twos_complement) {
2130 /* convert a AddP(P, *s) into AddP(P, *u) */
2131 ir_mode *nm = get_reference_mode_unsigned_eq(mode);
2133 ir_node *pre = new_r_Conv(current_ir_graph, get_nodes_block(n), right, nm);
2134 set_binop_right(n, pre);
2140 } /* transform_node_AddSub */
2142 #define HANDLE_BINOP_PHI(eval, a, b, c, mode) \
2144 if (is_Const(b) && is_const_Phi(a)) { \
2145 /* check for Op(Phi, Const) */ \
2146 c = apply_binop_on_phi(a, get_Const_tarval(b), eval, mode, 0);\
2148 else if (is_Const(a) && is_const_Phi(b)) { \
2149 /* check for Op(Const, Phi) */ \
2150 c = apply_binop_on_phi(b, get_Const_tarval(a), eval, mode, 1);\
2152 else if (is_const_Phi(a) && is_const_Phi(b)) { \
2153 /* check for Op(Phi, Phi) */ \
2154 c = apply_binop_on_2_phis(a, b, eval, mode); \
2157 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
2161 #define HANDLE_UNOP_PHI(eval, a, c) \
2163 if (is_const_Phi(a)) { \
2164 /* check for Op(Phi) */ \
2165 c = apply_unop_on_phi(a, eval); \
2167 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
2173 * Do the AddSub optimization, then Transform
2174 * Constant folding on Phi
2175 * Add(a,a) -> Mul(a, 2)
2176 * Add(Mul(a, x), a) -> Mul(a, x+1)
2177 * if the mode is integer or float.
2178 * Transform Add(a,-b) into Sub(a,b).
2179 * Reassociation might fold this further.
2181 static ir_node *transform_node_Add(ir_node *n) {
2183 ir_node *a, *b, *c, *oldn = n;
2185 n = transform_node_AddSub(n);
2187 a = get_Add_left(n);
2188 b = get_Add_right(n);
2190 mode = get_irn_mode(n);
2192 if (mode_is_reference(mode)) {
2193 ir_mode *lmode = get_irn_mode(a);
2195 if (is_Const(b) && is_Const_null(b) && mode_is_int(lmode)) {
2196 /* an Add(a, NULL) is a hidden Conv */
2197 dbg_info *dbg = get_irn_dbg_info(n);
2198 return new_rd_Conv(dbg, current_ir_graph, get_nodes_block(n), a, mode);
2202 HANDLE_BINOP_PHI(tarval_add, a, b, c, mode);
2204 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2205 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2208 if (mode_is_num(mode)) {
2209 /* the following code leads to endless recursion when Mul are replaced by a simple instruction chain */
2210 if (!is_arch_dep_running() && a == b && mode_is_int(mode)) {
2211 ir_node *block = get_nodes_block(n);
2214 get_irn_dbg_info(n),
2218 new_r_Const_long(current_ir_graph, block, mode, 2),
2220 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_A);
2225 get_irn_dbg_info(n),
2231 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
2236 get_irn_dbg_info(n),
2242 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
2245 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2246 /* Here we rely on constants be on the RIGHT side */
2248 ir_node *op = get_Not_op(a);
2250 if (is_Const(b) && is_Const_one(b)) {
2252 ir_node *blk = get_nodes_block(n);
2253 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, op, mode);
2254 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_PLUS_1);
2259 ir_node *blk = get_nodes_block(n);
2260 n = new_r_Const(current_ir_graph, blk, mode, get_mode_minus_one(mode));
2261 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X);
2266 ir_node *op = get_Not_op(b);
2270 ir_node *blk = get_nodes_block(n);
2271 n = new_r_Const(current_ir_graph, blk, mode, get_mode_minus_one(mode));
2272 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X);
2279 } /* transform_node_Add */
2282 * returns -cnst or NULL if impossible
2284 static ir_node *const_negate(ir_node *cnst) {
2285 tarval *tv = tarval_neg(get_Const_tarval(cnst));
2286 dbg_info *dbgi = get_irn_dbg_info(cnst);
2287 ir_graph *irg = get_irn_irg(cnst);
2288 ir_node *block = get_nodes_block(cnst);
2289 ir_mode *mode = get_irn_mode(cnst);
2290 if (tv == tarval_bad) return NULL;
2291 return new_rd_Const(dbgi, irg, block, mode, tv);
2295 * Do the AddSub optimization, then Transform
2296 * Constant folding on Phi
2297 * Sub(0,a) -> Minus(a)
2298 * Sub(Mul(a, x), a) -> Mul(a, x-1)
2299 * Sub(Sub(x, y), b) -> Sub(x, Add(y,b))
2300 * Sub(Add(a, x), x) -> a
2301 * Sub(x, Add(x, a)) -> -a
2302 * Sub(x, Const) -> Add(x, -Const)
2304 static ir_node *transform_node_Sub(ir_node *n) {
2309 n = transform_node_AddSub(n);
2311 a = get_Sub_left(n);
2312 b = get_Sub_right(n);
2314 mode = get_irn_mode(n);
2316 if (mode_is_int(mode)) {
2317 ir_mode *lmode = get_irn_mode(a);
2319 if (is_Const(b) && is_Const_null(b) && mode_is_reference(lmode)) {
2320 /* a Sub(a, NULL) is a hidden Conv */
2321 dbg_info *dbg = get_irn_dbg_info(n);
2322 n = new_rd_Conv(dbg, current_ir_graph, get_nodes_block(n), a, mode);
2323 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_CONV);
2327 if (mode == lmode &&
2328 get_mode_arithmetic(mode) == irma_twos_complement &&
2330 get_Const_tarval(a) == get_mode_minus_one(mode)) {
2332 dbg_info *dbg = get_irn_dbg_info(n);
2333 n = new_rd_Not(dbg, current_ir_graph, get_nodes_block(n), b, mode);
2334 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_NOT);
2340 HANDLE_BINOP_PHI(tarval_sub, a, b, c, mode);
2342 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2343 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2346 if (is_Const(b) && get_irn_mode(b) != mode_P) {
2347 /* a - C -> a + (-C) */
2348 ir_node *cnst = const_negate(b);
2350 ir_node *block = get_nodes_block(n);
2351 dbg_info *dbgi = get_irn_dbg_info(n);
2352 ir_graph *irg = get_irn_irg(n);
2354 n = new_rd_Add(dbgi, irg, block, a, cnst, mode);
2355 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2360 if (is_Minus(a)) { /* (-a) - b -> -(a + b) */
2361 ir_graph *irg = current_ir_graph;
2362 dbg_info *dbg = get_irn_dbg_info(n);
2363 ir_node *block = get_nodes_block(n);
2364 ir_node *left = get_Minus_op(a);
2365 ir_node *add = new_rd_Add(dbg, irg, block, left, b, mode);
2367 n = new_rd_Minus(dbg, irg, block, add, mode);
2368 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2370 } else if (is_Minus(b)) { /* a - (-b) -> a + b */
2371 ir_graph *irg = current_ir_graph;
2372 dbg_info *dbg = get_irn_dbg_info(n);
2373 ir_node *block = get_nodes_block(n);
2374 ir_node *right = get_Minus_op(b);
2376 n = new_rd_Add(dbg, irg, block, a, right, mode);
2377 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MINUS);
2379 } else if (is_Sub(b)) {
2380 /* a - (b - c) -> a + (c - b)
2381 * -> (a - b) + c iff (b - c) is a pointer */
2382 ir_graph *irg = current_ir_graph;
2383 dbg_info *s_dbg = get_irn_dbg_info(b);
2384 ir_node *s_block = get_nodes_block(b);
2385 ir_node *s_left = get_Sub_left(b);
2386 ir_node *s_right = get_Sub_right(b);
2387 ir_mode *s_mode = get_irn_mode(b);
2388 if (s_mode == mode_P) {
2389 ir_node *sub = new_rd_Sub(s_dbg, irg, s_block, a, s_left, mode);
2390 dbg_info *a_dbg = get_irn_dbg_info(n);
2391 ir_node *a_block = get_nodes_block(n);
2394 s_right = new_r_Conv(irg, a_block, s_right, mode);
2395 n = new_rd_Add(a_dbg, irg, a_block, sub, s_right, mode);
2397 ir_node *sub = new_rd_Sub(s_dbg, irg, s_block, s_right, s_left, s_mode);
2398 dbg_info *a_dbg = get_irn_dbg_info(n);
2399 ir_node *a_block = get_nodes_block(n);
2401 n = new_rd_Add(a_dbg, irg, a_block, a, sub, mode);
2403 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2405 } else if (is_Mul(b)) { /* a - (b * C) -> a + (b * -C) */
2406 ir_node *m_right = get_Mul_right(b);
2407 if (is_Const(m_right)) {
2408 ir_node *cnst2 = const_negate(m_right);
2409 if (cnst2 != NULL) {
2410 ir_graph *irg = current_ir_graph;
2411 dbg_info *m_dbg = get_irn_dbg_info(b);
2412 ir_node *m_block = get_nodes_block(b);
2413 ir_node *m_left = get_Mul_left(b);
2414 ir_mode *m_mode = get_irn_mode(b);
2415 ir_node *mul = new_rd_Mul(m_dbg, irg, m_block, m_left, cnst2, m_mode);
2416 dbg_info *a_dbg = get_irn_dbg_info(n);
2417 ir_node *a_block = get_nodes_block(n);
2419 n = new_rd_Add(a_dbg, irg, a_block, a, mul, mode);
2420 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2426 /* Beware of Sub(P, P) which cannot be optimized into a simple Minus ... */
2427 if (mode_is_num(mode) && mode == get_irn_mode(a) && is_Const(a) && is_Const_null(a)) {
2429 get_irn_dbg_info(n),
2434 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_0_A);
2438 if (mode_wrap_around(mode)) {
2439 ir_node *left = get_Add_left(a);
2440 ir_node *right = get_Add_right(a);
2442 /* FIXME: Does the Conv's work only for two complement or generally? */
2444 if (mode != get_irn_mode(right)) {
2445 /* This Sub is an effective Cast */
2446 right = new_r_Conv(get_irn_irg(n), get_nodes_block(n), right, mode);
2449 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2451 } else if (right == b) {
2452 if (mode != get_irn_mode(left)) {
2453 /* This Sub is an effective Cast */
2454 left = new_r_Conv(get_irn_irg(n), get_nodes_block(n), left, mode);
2457 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2463 if (mode_wrap_around(mode)) {
2464 ir_node *left = get_Add_left(b);
2465 ir_node *right = get_Add_right(b);
2467 /* FIXME: Does the Conv's work only for two complement or generally? */
2469 ir_mode *r_mode = get_irn_mode(right);
2471 n = new_r_Minus(get_irn_irg(n), get_nodes_block(n), right, r_mode);
2472 if (mode != r_mode) {
2473 /* This Sub is an effective Cast */
2474 n = new_r_Conv(get_irn_irg(n), get_nodes_block(n), n, mode);
2476 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2478 } else if (right == a) {
2479 ir_mode *l_mode = get_irn_mode(left);
2481 n = new_r_Minus(get_irn_irg(n), get_nodes_block(n), left, l_mode);
2482 if (mode != l_mode) {
2483 /* This Sub is an effective Cast */
2484 n = new_r_Conv(get_irn_irg(n), get_nodes_block(n), n, mode);
2486 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2491 if (mode_is_int(mode) && is_Conv(a) && is_Conv(b)) {
2492 ir_mode *mode = get_irn_mode(a);
2494 if (mode == get_irn_mode(b)) {
2496 ir_node *op_a = get_Conv_op(a);
2497 ir_node *op_b = get_Conv_op(b);
2499 /* check if it's allowed to skip the conv */
2500 ma = get_irn_mode(op_a);
2501 mb = get_irn_mode(op_b);
2503 if (mode_is_reference(ma) && mode_is_reference(mb)) {
2504 /* SubInt(ConvInt(aP), ConvInt(bP)) -> SubInt(aP,bP) */
2507 set_Sub_right(n, b);
2513 /* do NOT execute this code if reassociation is enabled, it does the inverse! */
2514 if (!is_reassoc_running() && is_Mul(a)) {
2515 ir_node *ma = get_Mul_left(a);
2516 ir_node *mb = get_Mul_right(a);
2519 ir_node *blk = get_nodes_block(n);
2521 get_irn_dbg_info(n),
2522 current_ir_graph, blk,
2525 get_irn_dbg_info(n),
2526 current_ir_graph, blk,
2528 new_r_Const_long(current_ir_graph, blk, mode, 1),
2531 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2533 } else if (mb == b) {
2534 ir_node *blk = get_nodes_block(n);
2536 get_irn_dbg_info(n),
2537 current_ir_graph, blk,
2540 get_irn_dbg_info(n),
2541 current_ir_graph, blk,
2543 new_r_Const_long(current_ir_graph, blk, mode, 1),
2546 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2550 if (is_Sub(a)) { /* (x - y) - b -> x - (y + b) */
2551 ir_node *x = get_Sub_left(a);
2552 ir_node *y = get_Sub_right(a);
2553 ir_node *blk = get_nodes_block(n);
2554 ir_mode *m_b = get_irn_mode(b);
2555 ir_mode *m_y = get_irn_mode(y);
2559 /* Determine the right mode for the Add. */
2562 else if (mode_is_reference(m_b))
2564 else if (mode_is_reference(m_y))
2568 * Both modes are different but none is reference,
2569 * happens for instance in SubP(SubP(P, Iu), Is).
2570 * We have two possibilities here: Cast or ignore.
2571 * Currently we ignore this case.
2576 add = new_r_Add(current_ir_graph, blk, y, b, add_mode);
2578 n = new_rd_Sub(get_irn_dbg_info(n), current_ir_graph, blk, x, add, mode);
2579 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_SUB_X_Y_Z);
2583 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2584 if (is_Const(a) && is_Not(b)) {
2585 /* c - ~X = X + (c+1) */
2586 tarval *tv = get_Const_tarval(a);
2588 tv = tarval_add(tv, get_mode_one(mode));
2589 if (tv != tarval_bad) {
2590 ir_node *blk = get_nodes_block(n);
2591 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
2592 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, blk, get_Not_op(b), c, mode);
2593 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_C_NOT_X);
2599 } /* transform_node_Sub */
2602 * Several transformation done on n*n=2n bits mul.
2603 * These transformations must be done here because new nodes may be produced.
2605 static ir_node *transform_node_Mul2n(ir_node *n, ir_mode *mode) {
2607 ir_node *a = get_Mul_left(n);
2608 ir_node *b = get_Mul_right(n);
2609 tarval *ta = value_of(a);
2610 tarval *tb = value_of(b);
2611 ir_mode *smode = get_irn_mode(a);
2613 if (ta == get_mode_one(smode)) {
2614 /* (L)1 * (L)b = (L)b */
2615 ir_node *blk = get_nodes_block(n);
2616 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, b, mode);
2617 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2620 else if (ta == get_mode_minus_one(smode)) {
2621 /* (L)-1 * (L)b = (L)b */
2622 ir_node *blk = get_nodes_block(n);
2623 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, b, smode);
2624 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, n, mode);
2625 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2628 if (tb == get_mode_one(smode)) {
2629 /* (L)a * (L)1 = (L)a */
2630 ir_node *blk = get_irn_n(a, -1);
2631 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, a, mode);
2632 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2635 else if (tb == get_mode_minus_one(smode)) {
2636 /* (L)a * (L)-1 = (L)-a */
2637 ir_node *blk = get_nodes_block(n);
2638 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, a, smode);
2639 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, n, mode);
2640 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2647 * Transform Mul(a,-1) into -a.
2648 * Do constant evaluation of Phi nodes.
2649 * Do architecture dependent optimizations on Mul nodes
2651 static ir_node *transform_node_Mul(ir_node *n) {
2652 ir_node *c, *oldn = n;
2653 ir_mode *mode = get_irn_mode(n);
2654 ir_node *a = get_Mul_left(n);
2655 ir_node *b = get_Mul_right(n);
2657 if (is_Bad(a) || is_Bad(b))
2660 if (mode != get_irn_mode(a))
2661 return transform_node_Mul2n(n, mode);
2663 HANDLE_BINOP_PHI(tarval_mul, a, b, c, mode);
2665 if (mode_is_signed(mode)) {
2668 if (value_of(a) == get_mode_minus_one(mode))
2670 else if (value_of(b) == get_mode_minus_one(mode))
2673 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n), r, mode);
2674 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2679 if (is_Const(b)) { /* (-a) * const -> a * -const */
2680 ir_node *cnst = const_negate(b);
2682 dbg_info *dbgi = get_irn_dbg_info(n);
2683 ir_node *block = get_nodes_block(n);
2684 n = new_rd_Mul(dbgi, current_ir_graph, block, get_Minus_op(a), cnst, mode);
2685 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2688 } else if (is_Minus(b)) { /* (-a) * (-b) -> a * b */
2689 dbg_info *dbgi = get_irn_dbg_info(n);
2690 ir_node *block = get_nodes_block(n);
2691 n = new_rd_Mul(dbgi, current_ir_graph, block, get_Minus_op(a), get_Minus_op(b), mode);
2692 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_MINUS);
2694 } else if (is_Sub(b)) { /* (-a) * (b - c) -> a * (c - b) */
2695 ir_node *sub_l = get_Sub_left(b);
2696 ir_node *sub_r = get_Sub_right(b);
2697 dbg_info *dbgi = get_irn_dbg_info(n);
2698 ir_graph *irg = current_ir_graph;
2699 ir_node *block = get_nodes_block(n);
2700 ir_node *new_b = new_rd_Sub(dbgi, irg, block, sub_r, sub_l, mode);
2701 n = new_rd_Mul(dbgi, irg, block, get_Minus_op(a), new_b, mode);
2702 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
2705 } else if (is_Minus(b)) {
2706 if (is_Sub(a)) { /* (a - b) * (-c) -> (b - a) * c */
2707 ir_node *sub_l = get_Sub_left(a);
2708 ir_node *sub_r = get_Sub_right(a);
2709 dbg_info *dbgi = get_irn_dbg_info(n);
2710 ir_graph *irg = current_ir_graph;
2711 ir_node *block = get_nodes_block(n);
2712 ir_node *new_a = new_rd_Sub(dbgi, irg, block, sub_r, sub_l, mode);
2713 n = new_rd_Mul(dbgi, irg, block, new_a, get_Minus_op(b), mode);
2714 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
2718 if (get_mode_arithmetic(mode) == irma_ieee754) {
2720 tarval *tv = get_Const_tarval(a);
2721 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)) {
2722 /* 2.0 * b = b + b */
2723 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n), b, b, mode);
2724 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2728 else if (is_Const(b)) {
2729 tarval *tv = get_Const_tarval(b);
2730 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)) {
2731 /* a * 2.0 = a + a */
2732 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n), a, a, mode);
2733 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2738 return arch_dep_replace_mul_with_shifts(n);
2739 } /* transform_node_Mul */
2742 * Transform a Div Node.
2744 static ir_node *transform_node_Div(ir_node *n) {
2745 ir_mode *mode = get_Div_resmode(n);
2746 ir_node *a = get_Div_left(n);
2747 ir_node *b = get_Div_right(n);
2751 if (is_Const(b) && is_const_Phi(a)) {
2752 /* check for Div(Phi, Const) */
2753 value = apply_binop_on_phi(a, get_Const_tarval(b), tarval_div, mode, 0);
2755 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2759 else if (is_Const(a) && is_const_Phi(b)) {
2760 /* check for Div(Const, Phi) */
2761 value = apply_binop_on_phi(b, get_Const_tarval(a), tarval_div, mode, 1);
2763 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2767 else if (is_const_Phi(a) && is_const_Phi(b)) {
2768 /* check for Div(Phi, Phi) */
2769 value = apply_binop_on_2_phis(a, b, tarval_div, mode);
2771 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2778 if (tv != tarval_bad) {
2779 value = new_Const(get_tarval_mode(tv), tv);
2781 DBG_OPT_CSTEVAL(n, value);
2784 ir_node *a = get_Div_left(n);
2785 ir_node *b = get_Div_right(n);
2786 const ir_node *dummy;
2788 if (a == b && value_not_zero(a, &dummy)) {
2789 /* BEWARE: we can optimize a/a to 1 only if this cannot cause a exception */
2790 value = new_Const(mode, get_mode_one(mode));
2791 DBG_OPT_CSTEVAL(n, value);
2794 if (mode_is_signed(mode) && is_Const(b)) {
2795 tarval *tv = get_Const_tarval(b);
2797 if (tv == get_mode_minus_one(mode)) {
2799 value = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n), a, mode);
2800 DBG_OPT_CSTEVAL(n, value);
2804 /* Try architecture dependent optimization */
2805 value = arch_dep_replace_div_by_const(n);
2813 /* Turn Div into a tuple (mem, jmp, bad, value) */
2814 mem = get_Div_mem(n);
2815 blk = get_nodes_block(n);
2817 /* skip a potential Pin */
2818 mem = skip_Pin(mem);
2819 turn_into_tuple(n, pn_Div_max);
2820 set_Tuple_pred(n, pn_Div_M, mem);
2821 set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(current_ir_graph, blk));
2822 set_Tuple_pred(n, pn_Div_X_except, new_Bad());
2823 set_Tuple_pred(n, pn_Div_res, value);
2826 } /* transform_node_Div */
2829 * Transform a Mod node.
2831 static ir_node *transform_node_Mod(ir_node *n) {
2832 ir_mode *mode = get_Mod_resmode(n);
2833 ir_node *a = get_Mod_left(n);
2834 ir_node *b = get_Mod_right(n);
2838 if (is_Const(b) && is_const_Phi(a)) {
2839 /* check for Div(Phi, Const) */
2840 value = apply_binop_on_phi(a, get_Const_tarval(b), tarval_mod, mode, 0);
2842 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2846 else if (is_Const(a) && is_const_Phi(b)) {
2847 /* check for Div(Const, Phi) */
2848 value = apply_binop_on_phi(b, get_Const_tarval(a), tarval_mod, mode, 1);
2850 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2854 else if (is_const_Phi(a) && is_const_Phi(b)) {
2855 /* check for Div(Phi, Phi) */
2856 value = apply_binop_on_2_phis(a, b, tarval_mod, mode);
2858 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2865 if (tv != tarval_bad) {
2866 value = new_Const(get_tarval_mode(tv), tv);
2868 DBG_OPT_CSTEVAL(n, value);
2871 ir_node *a = get_Mod_left(n);
2872 ir_node *b = get_Mod_right(n);
2873 const ir_node *dummy;
2875 if (a == b && value_not_zero(a, &dummy)) {
2876 /* BEWARE: we can optimize a%a to 0 only if this cannot cause a exception */
2877 value = new_Const(mode, get_mode_null(mode));
2878 DBG_OPT_CSTEVAL(n, value);
2881 if (mode_is_signed(mode) && is_Const(b)) {
2882 tarval *tv = get_Const_tarval(b);
2884 if (tv == get_mode_minus_one(mode)) {
2886 value = new_Const(mode, get_mode_null(mode));
2887 DBG_OPT_CSTEVAL(n, value);
2891 /* Try architecture dependent optimization */
2892 value = arch_dep_replace_mod_by_const(n);
2900 /* Turn Mod into a tuple (mem, jmp, bad, value) */
2901 mem = get_Mod_mem(n);
2902 blk = get_nodes_block(n);
2904 /* skip a potential Pin */
2905 mem = skip_Pin(mem);
2906 turn_into_tuple(n, pn_Mod_max);
2907 set_Tuple_pred(n, pn_Mod_M, mem);
2908 set_Tuple_pred(n, pn_Mod_X_regular, new_r_Jmp(current_ir_graph, blk));
2909 set_Tuple_pred(n, pn_Mod_X_except, new_Bad());
2910 set_Tuple_pred(n, pn_Mod_res, value);
2913 } /* transform_node_Mod */
2916 * Transform a DivMod node.
2918 static ir_node *transform_node_DivMod(ir_node *n) {
2919 const ir_node *dummy;
2920 ir_node *a = get_DivMod_left(n);
2921 ir_node *b = get_DivMod_right(n);
2922 ir_mode *mode = get_DivMod_resmode(n);
2927 if (is_Const(b) && is_const_Phi(a)) {
2928 /* check for Div(Phi, Const) */
2929 va = apply_binop_on_phi(a, get_Const_tarval(b), tarval_div, mode, 0);
2930 vb = apply_binop_on_phi(a, get_Const_tarval(b), tarval_mod, mode, 0);
2932 DBG_OPT_ALGSIM0(n, va, FS_OPT_CONST_PHI);
2933 DBG_OPT_ALGSIM0(n, vb, FS_OPT_CONST_PHI);
2937 else if (is_Const(a) && is_const_Phi(b)) {
2938 /* check for Div(Const, Phi) */
2939 va = apply_binop_on_phi(b, get_Const_tarval(a), tarval_div, mode, 1);
2940 vb = apply_binop_on_phi(b, get_Const_tarval(a), tarval_mod, mode, 1);
2942 DBG_OPT_ALGSIM0(n, va, FS_OPT_CONST_PHI);
2943 DBG_OPT_ALGSIM0(n, vb, FS_OPT_CONST_PHI);
2947 else if (is_const_Phi(a) && is_const_Phi(b)) {
2948 /* check for Div(Phi, Phi) */
2949 va = apply_binop_on_2_phis(a, b, tarval_div, mode);
2950 vb = apply_binop_on_2_phis(a, b, tarval_mod, mode);
2952 DBG_OPT_ALGSIM0(n, va, FS_OPT_CONST_PHI);
2953 DBG_OPT_ALGSIM0(n, vb, FS_OPT_CONST_PHI);
2960 if (tb != tarval_bad) {
2961 if (tb == get_mode_one(get_tarval_mode(tb))) {
2963 vb = new_Const(mode, get_mode_null(mode));
2964 DBG_OPT_CSTEVAL(n, vb);
2966 } else if (ta != tarval_bad) {
2967 tarval *resa, *resb;
2968 resa = tarval_div(ta, tb);
2969 if (resa == tarval_bad) return n; /* Causes exception!!! Model by replacing through
2970 Jmp for X result!? */
2971 resb = tarval_mod(ta, tb);
2972 if (resb == tarval_bad) return n; /* Causes exception! */
2973 va = new_Const(mode, resa);
2974 vb = new_Const(mode, resb);
2975 DBG_OPT_CSTEVAL(n, va);
2976 DBG_OPT_CSTEVAL(n, vb);
2978 } else if (mode_is_signed(mode) && tb == get_mode_minus_one(mode)) {
2979 va = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n), a, mode);
2980 vb = new_Const(mode, get_mode_null(mode));
2981 DBG_OPT_CSTEVAL(n, va);
2982 DBG_OPT_CSTEVAL(n, vb);
2984 } else { /* Try architecture dependent optimization */
2987 arch_dep_replace_divmod_by_const(&va, &vb, n);
2988 evaluated = va != NULL;
2990 } else if (a == b) {
2991 if (value_not_zero(a, &dummy)) {
2993 va = new_Const(mode, get_mode_one(mode));
2994 vb = new_Const(mode, get_mode_null(mode));
2995 DBG_OPT_CSTEVAL(n, va);
2996 DBG_OPT_CSTEVAL(n, vb);
2999 /* BEWARE: it is NOT possible to optimize a/a to 1, as this may cause a exception */
3002 } else if (ta == get_mode_null(mode) && value_not_zero(b, &dummy)) {
3003 /* 0 / non-Const = 0 */
3008 if (evaluated) { /* replace by tuple */
3012 mem = get_DivMod_mem(n);
3013 /* skip a potential Pin */
3014 mem = skip_Pin(mem);
3016 blk = get_nodes_block(n);
3017 turn_into_tuple(n, pn_DivMod_max);
3018 set_Tuple_pred(n, pn_DivMod_M, mem);
3019 set_Tuple_pred(n, pn_DivMod_X_regular, new_r_Jmp(current_ir_graph, blk));
3020 set_Tuple_pred(n, pn_DivMod_X_except, new_Bad()); /* no exception */
3021 set_Tuple_pred(n, pn_DivMod_res_div, va);
3022 set_Tuple_pred(n, pn_DivMod_res_mod, vb);
3026 } /* transform_node_DivMod */
3029 * Optimize x / c to x * (1/c)
3031 static ir_node *transform_node_Quot(ir_node *n) {
3032 ir_mode *mode = get_Quot_resmode(n);
3035 if (get_mode_arithmetic(mode) == irma_ieee754) {
3036 ir_node *b = get_Quot_right(n);
3037 tarval *tv = value_of(b);
3039 if (tv != tarval_bad) {
3043 * Floating point constant folding might be disabled here to
3045 * However, as we check for exact result, doing it is safe.
3048 rem = tarval_enable_fp_ops(1);
3049 tv = tarval_quo(get_mode_one(mode), tv);
3050 (void)tarval_enable_fp_ops(rem);
3052 /* Do the transformation if the result is either exact or we are not
3053 using strict rules. */
3054 if (tv != tarval_bad &&
3055 (tarval_ieee754_get_exact() || (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic) == 0)) {
3056 ir_node *blk = get_nodes_block(n);
3057 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
3058 ir_node *a = get_Quot_left(n);
3059 ir_node *m = new_rd_Mul(get_irn_dbg_info(n), current_ir_graph, blk, a, c, mode);
3060 ir_node *mem = get_Quot_mem(n);
3062 /* skip a potential Pin */
3063 mem = skip_Pin(mem);
3064 turn_into_tuple(n, pn_Quot_max);
3065 set_Tuple_pred(n, pn_Quot_M, mem);
3066 set_Tuple_pred(n, pn_Quot_X_regular, new_r_Jmp(current_ir_graph, blk));
3067 set_Tuple_pred(n, pn_Quot_X_except, new_r_Bad(current_ir_graph));
3068 set_Tuple_pred(n, pn_Quot_res, m);
3069 DBG_OPT_ALGSIM1(oldn, a, b, m, FS_OPT_FP_INV_MUL);
3074 } /* transform_node_Quot */
3077 * Optimize Abs(x) into x if x is Confirmed >= 0
3078 * Optimize Abs(x) into -x if x is Confirmed <= 0
3079 * Optimize Abs(-x) int Abs(x)
3081 static ir_node *transform_node_Abs(ir_node *n) {
3082 ir_node *c, *oldn = n;
3083 ir_node *a = get_Abs_op(n);
3086 HANDLE_UNOP_PHI(tarval_abs, a, c);
3088 switch (classify_value_sign(a)) {
3089 case value_classified_negative:
3090 mode = get_irn_mode(n);
3093 * We can replace the Abs by -x here.
3094 * We even could add a new Confirm here
3095 * (if not twos complement)
3097 * Note that -x would create a new node, so we could
3098 * not run it in the equivalent_node() context.
3100 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph,
3101 get_nodes_block(n), a, mode);
3103 DBG_OPT_CONFIRM(oldn, n);
3105 case value_classified_positive:
3106 /* n is positive, Abs is not needed */
3109 DBG_OPT_CONFIRM(oldn, n);
3115 /* Abs(-x) = Abs(x) */
3116 mode = get_irn_mode(n);
3117 n = new_rd_Abs(get_irn_dbg_info(n), current_ir_graph,
3118 get_nodes_block(n), get_Minus_op(a), mode);
3119 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ABS_MINUS_X);
3123 } /* transform_node_Abs */
3126 * Optimize -a CMP -b into b CMP a.
3127 * This works only for for modes where unary Minus
3129 * Note that two-complement integers can Overflow
3130 * so it will NOT work.
3132 * For == and != can be handled in Proj(Cmp)
3134 static ir_node *transform_node_Cmp(ir_node *n) {
3136 ir_node *left = get_Cmp_left(n);
3137 ir_node *right = get_Cmp_right(n);
3139 if (is_Minus(left) && is_Minus(right) &&
3140 !mode_overflow_on_unary_Minus(get_irn_mode(left))) {
3141 ir_node *const new_left = get_Minus_op(right);
3142 ir_node *const new_right = get_Minus_op(left);
3143 n = new_rd_Cmp(get_irn_dbg_info(n), current_ir_graph,
3144 get_nodes_block(n), new_left, new_right);
3145 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CMP_OP_OP);
3148 } /* transform_node_Cmp */
3152 * Transform a Cond node.
3154 * Replace the Cond by a Jmp if it branches on a constant
3157 static ir_node *transform_node_Cond(ir_node *n) {
3160 ir_node *a = get_Cond_selector(n);
3161 tarval *ta = value_of(a);
3163 /* we need block info which is not available in floating irgs */
3164 if (get_irg_pinned(current_ir_graph) == op_pin_state_floats)
3167 if ((ta != tarval_bad) &&
3168 (get_irn_mode(a) == mode_b) &&
3169 (get_opt_unreachable_code())) {
3170 /* It's a boolean Cond, branching on a boolean constant.
3171 Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
3172 ir_node *blk = get_nodes_block(n);
3173 jmp = new_r_Jmp(current_ir_graph, blk);
3174 turn_into_tuple(n, pn_Cond_max);
3175 if (ta == tarval_b_true) {
3176 set_Tuple_pred(n, pn_Cond_false, new_Bad());
3177 set_Tuple_pred(n, pn_Cond_true, jmp);
3179 set_Tuple_pred(n, pn_Cond_false, jmp);
3180 set_Tuple_pred(n, pn_Cond_true, new_Bad());
3182 /* We might generate an endless loop, so keep it alive. */
3183 add_End_keepalive(get_irg_end(current_ir_graph), blk);
3186 } /* transform_node_Cond */
3189 * Prototype of a recursive transform function
3190 * for bitwise distributive transformations.
3192 typedef ir_node* (*recursive_transform)(ir_node *n);
3195 * makes use of distributive laws for and, or, eor
3196 * and(a OP c, b OP c) -> and(a, b) OP c
3197 * note, might return a different op than n
3199 static ir_node *transform_bitwise_distributive(ir_node *n,
3200 recursive_transform trans_func)
3203 ir_node *a = get_binop_left(n);
3204 ir_node *b = get_binop_right(n);
3205 ir_op *op = get_irn_op(a);
3206 ir_op *op_root = get_irn_op(n);
3208 if(op != get_irn_op(b))
3211 if (op == op_Conv) {
3212 ir_node *a_op = get_Conv_op(a);
3213 ir_node *b_op = get_Conv_op(b);
3214 ir_mode *a_mode = get_irn_mode(a_op);
3215 ir_mode *b_mode = get_irn_mode(b_op);
3216 if(a_mode == b_mode && (mode_is_int(a_mode) || a_mode == mode_b)) {
3217 ir_node *blk = get_nodes_block(n);
3220 set_binop_left(n, a_op);
3221 set_binop_right(n, b_op);
3222 set_irn_mode(n, a_mode);
3224 n = new_r_Conv(current_ir_graph, blk, n, get_irn_mode(oldn));
3226 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
3232 /* nothing to gain here */
3236 if (op == op_Shrs || op == op_Shr || op == op_Shl
3237 || op == op_And || op == op_Or || op == op_Eor) {
3238 ir_node *a_left = get_binop_left(a);
3239 ir_node *a_right = get_binop_right(a);
3240 ir_node *b_left = get_binop_left(b);
3241 ir_node *b_right = get_binop_right(b);
3243 ir_node *op1 = NULL;
3244 ir_node *op2 = NULL;
3246 if (is_op_commutative(op)) {
3247 if (a_left == b_left) {
3251 } else if(a_left == b_right) {
3255 } else if(a_right == b_left) {
3261 if(a_right == b_right) {
3268 /* (a sop c) & (b sop c) => (a & b) sop c */
3269 ir_node *blk = get_nodes_block(n);
3271 ir_node *new_n = exact_copy(n);
3272 set_binop_left(new_n, op1);
3273 set_binop_right(new_n, op2);
3274 new_n = trans_func(new_n);
3276 if(op_root == op_Eor && op == op_Or) {
3277 dbg_info *dbgi = get_irn_dbg_info(n);
3278 ir_graph *irg = current_ir_graph;
3279 ir_mode *mode = get_irn_mode(c);
3281 c = new_rd_Not(dbgi, irg, blk, c, mode);
3282 n = new_rd_And(dbgi, irg, blk, new_n, c, mode);
3285 set_nodes_block(n, blk);
3286 set_binop_left(n, new_n);
3287 set_binop_right(n, c);
3288 add_identities(current_ir_graph->value_table, n);
3291 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
3302 static ir_node *transform_node_And(ir_node *n) {
3303 ir_node *c, *oldn = n;
3304 ir_node *a = get_And_left(n);
3305 ir_node *b = get_And_right(n);
3308 mode = get_irn_mode(n);
3309 HANDLE_BINOP_PHI(tarval_and, a, b, c, mode);
3311 /* we can evaluate 2 Projs of the same Cmp */
3312 if (mode == mode_b && is_Proj(a) && is_Proj(b)) {
3313 ir_node *pred_a = get_Proj_pred(a);
3314 ir_node *pred_b = get_Proj_pred(b);
3315 if (pred_a == pred_b) {
3316 dbg_info *dbgi = get_irn_dbg_info(n);
3317 ir_node *block = get_nodes_block(pred_a);
3318 pn_Cmp pn_a = get_Proj_proj(a);
3319 pn_Cmp pn_b = get_Proj_proj(b);
3320 /* yes, we can simply calculate with pncs */
3321 pn_Cmp new_pnc = pn_a & pn_b;
3323 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b, new_pnc);
3328 ir_node *op = get_Not_op(b);
3330 ir_node *ba = get_And_left(op);
3331 ir_node *bb = get_And_right(op);
3333 /* it's enough to test the following cases due to normalization! */
3334 if (get_Or_left(a) == ba && get_Or_right(a) == bb) {
3335 /* (a|b) & ~(a&b) = a^b */
3336 ir_node *block = get_nodes_block(n);
3338 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph, block, ba, bb, mode);
3339 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
3347 ir_node *op = get_Not_op(a);
3349 ir_node *aa = get_And_left(op);
3350 ir_node *ab = get_And_right(op);
3352 /* it's enough to test the following cases due to normalization! */
3353 if (get_Or_left(b) == aa && get_Or_right(b) == ab) {
3354 /* (a|b) & ~(a&b) = a^b */
3355 ir_node *block = get_nodes_block(n);
3357 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph, block, aa, ab, mode);
3358 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
3365 ir_node *al = get_Eor_left(a);
3366 ir_node *ar = get_Eor_right(a);
3369 /* (b ^ a) & b -> ~a & b */
3370 dbg_info *dbg = get_irn_dbg_info(n);
3371 ir_node *block = get_nodes_block(n);
3373 ar = new_rd_Not(dbg, current_ir_graph, block, ar, mode);
3374 n = new_rd_And(dbg, current_ir_graph, block, ar, b, mode);
3375 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3379 /* (a ^ b) & b -> ~a & b */
3380 dbg_info *dbg = get_irn_dbg_info(n);
3381 ir_node *block = get_nodes_block(n);
3383 al = new_rd_Not(dbg, current_ir_graph, block, al, mode);
3384 n = new_rd_And(dbg, current_ir_graph, block, al, b, mode);
3385 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3390 ir_node *bl = get_Eor_left(b);
3391 ir_node *br = get_Eor_right(b);
3394 /* a & (a ^ b) -> a & ~b */
3395 dbg_info *dbg = get_irn_dbg_info(n);
3396 ir_node *block = get_nodes_block(n);
3398 br = new_rd_Not(dbg, current_ir_graph, block, br, mode);
3399 n = new_rd_And(dbg, current_ir_graph, block, br, a, mode);
3400 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3404 /* a & (b ^ a) -> a & ~b */
3405 dbg_info *dbg = get_irn_dbg_info(n);
3406 ir_node *block = get_nodes_block(n);
3408 bl = new_rd_Not(dbg, current_ir_graph, block, bl, mode);
3409 n = new_rd_And(dbg, current_ir_graph, block, bl, a, mode);
3410 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3414 if (is_Not(a) && is_Not(b)) {
3415 /* ~a & ~b = ~(a|b) */
3416 ir_node *block = get_nodes_block(n);
3417 ir_mode *mode = get_irn_mode(n);
3421 n = new_rd_Or(get_irn_dbg_info(n), current_ir_graph, block, a, b, mode);
3422 n = new_rd_Not(get_irn_dbg_info(n), current_ir_graph, block, n, mode);
3423 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
3427 n = transform_bitwise_distributive(n, transform_node_And);
3430 } /* transform_node_And */
3435 static ir_node *transform_node_Eor(ir_node *n) {
3436 ir_node *c, *oldn = n;
3437 ir_node *a = get_Eor_left(n);
3438 ir_node *b = get_Eor_right(n);
3439 ir_mode *mode = get_irn_mode(n);
3441 HANDLE_BINOP_PHI(tarval_eor, a, b, c, mode);
3443 /* we can evaluate 2 Projs of the same Cmp */
3444 if (mode == mode_b && is_Proj(a) && is_Proj(b)) {
3445 ir_node *pred_a = get_Proj_pred(a);
3446 ir_node *pred_b = get_Proj_pred(b);
3447 if(pred_a == pred_b) {
3448 dbg_info *dbgi = get_irn_dbg_info(n);
3449 ir_node *block = get_nodes_block(pred_a);
3450 pn_Cmp pn_a = get_Proj_proj(a);
3451 pn_Cmp pn_b = get_Proj_proj(b);
3452 /* yes, we can simply calculate with pncs */
3453 pn_Cmp new_pnc = pn_a ^ pn_b;
3455 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b,
3462 n = new_rd_Const(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n),
3463 mode, get_mode_null(mode));
3464 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_A_A);
3465 } else if (mode == mode_b &&
3467 is_Const(b) && is_Const_one(b) &&
3468 is_Cmp(get_Proj_pred(a))) {
3469 /* The Eor negates a Cmp. The Cmp has the negated result anyways! */
3470 n = new_r_Proj(current_ir_graph, get_nodes_block(n), get_Proj_pred(a),
3471 mode_b, get_negated_pnc(get_Proj_proj(a), mode));
3473 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT_BOOL);
3474 } else if (is_Const(b)) {
3475 if (is_Not(a)) { /* ~x ^ const -> x ^ ~const */
3476 ir_node *cnst = new_Const(mode, tarval_not(get_Const_tarval(b)));
3477 ir_node *not_op = get_Not_op(a);
3478 dbg_info *dbg = get_irn_dbg_info(n);
3479 ir_graph *irg = current_ir_graph;
3480 ir_node *block = get_nodes_block(n);
3481 ir_mode *mode = get_irn_mode(n);
3482 n = new_rd_Eor(dbg, irg, block, not_op, cnst, mode);
3484 } else if (is_Const_all_one(b)) { /* x ^ 1...1 -> ~1 */
3485 n = new_r_Not(current_ir_graph, get_nodes_block(n), a, mode);
3486 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3489 n = transform_bitwise_distributive(n, transform_node_Eor);
3493 } /* transform_node_Eor */
3498 static ir_node *transform_node_Not(ir_node *n) {
3499 ir_node *c, *oldn = n;
3500 ir_node *a = get_Not_op(n);
3501 ir_mode *mode = get_irn_mode(n);
3503 HANDLE_UNOP_PHI(tarval_not,a,c);
3505 /* check for a boolean Not */
3506 if (mode == mode_b &&
3508 is_Cmp(get_Proj_pred(a))) {
3509 /* We negate a Cmp. The Cmp has the negated result anyways! */
3510 n = new_r_Proj(current_ir_graph, get_nodes_block(n), get_Proj_pred(a),
3511 mode_b, get_negated_pnc(get_Proj_proj(a), mode_b));
3512 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP);
3516 ir_node *eor_b = get_Eor_right(a);
3517 if (is_Const(eor_b)) { /* ~(x ^ const) -> x ^ ~const */
3518 ir_node *cnst = new_Const(mode, tarval_not(get_Const_tarval(eor_b)));
3519 ir_node *eor_a = get_Eor_left(a);
3520 dbg_info *dbg = get_irn_dbg_info(n);
3521 ir_graph *irg = current_ir_graph;
3522 ir_node *block = get_nodes_block(n);
3523 ir_mode *mode = get_irn_mode(n);
3524 n = new_rd_Eor(dbg, irg, block, eor_a, cnst, mode);
3528 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3529 if (is_Minus(a)) { /* ~-x -> x + -1 */
3530 dbg_info *dbg = get_irn_dbg_info(n);
3531 ir_graph *irg = current_ir_graph;
3532 ir_node *block = get_nodes_block(n);
3533 ir_node *add_l = get_Minus_op(a);
3534 ir_node *add_r = new_rd_Const(dbg, irg, block, mode, get_mode_minus_one(mode));
3535 n = new_rd_Add(dbg, irg, block, add_l, add_r, mode);
3536 } else if (is_Add(a)) {
3537 ir_node *add_r = get_Add_right(a);
3538 if (is_Const(add_r) && is_Const_all_one(add_r)) {
3539 /* ~(x + -1) = -x */
3540 ir_node *op = get_Add_left(a);
3541 ir_node *blk = get_nodes_block(n);
3542 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, op, get_irn_mode(n));
3543 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_MINUS_1);
3548 } /* transform_node_Not */
3551 * Transform a Minus.
3555 * -(a >>u (size-1)) = a >>s (size-1)
3556 * -(a >>s (size-1)) = a >>u (size-1)
3557 * -(a * const) -> a * -const
3559 static ir_node *transform_node_Minus(ir_node *n) {
3560 ir_node *c, *oldn = n;
3561 ir_node *a = get_Minus_op(n);
3564 HANDLE_UNOP_PHI(tarval_neg,a,c);
3566 mode = get_irn_mode(a);
3567 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3568 /* the following rules are only to twos-complement */
3571 ir_node *op = get_Not_op(a);
3572 tarval *tv = get_mode_one(mode);
3573 ir_node *blk = get_nodes_block(n);
3574 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
3575 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, blk, op, c, mode);
3576 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_NOT);
3580 ir_node *c = get_Shr_right(a);
3583 tarval *tv = get_Const_tarval(c);
3585 if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) {
3586 /* -(a >>u (size-1)) = a >>s (size-1) */
3587 ir_node *v = get_Shr_left(a);
3589 n = new_rd_Shrs(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n), v, c, mode);
3590 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3596 ir_node *c = get_Shrs_right(a);
3599 tarval *tv = get_Const_tarval(c);
3601 if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) {
3602 /* -(a >>s (size-1)) = a >>u (size-1) */
3603 ir_node *v = get_Shrs_left(a);
3605 n = new_rd_Shr(get_irn_dbg_info(n), current_ir_graph, get_nodes_block(n), v, c, mode);
3606 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3613 /* - (a-b) = b - a */
3614 ir_node *la = get_Sub_left(a);
3615 ir_node *ra = get_Sub_right(a);
3616 ir_node *blk = get_nodes_block(n);
3618 n = new_rd_Sub(get_irn_dbg_info(n), current_ir_graph, blk, ra, la, mode);
3619 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_SUB);
3623 if (is_Mul(a)) { /* -(a * const) -> a * -const */
3624 ir_node *mul_l = get_Mul_left(a);
3625 ir_node *mul_r = get_Mul_right(a);
3626 tarval *tv = value_of(mul_r);
3627 if (tv != tarval_bad) {
3628 tv = tarval_neg(tv);
3629 if (tv != tarval_bad) {
3630 ir_node *cnst = new_Const(mode, tv);
3631 dbg_info *dbg = get_irn_dbg_info(a);
3632 ir_graph *irg = current_ir_graph;
3633 ir_node *block = get_nodes_block(a);
3634 n = new_rd_Mul(dbg, irg, block, mul_l, cnst, mode);
3635 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_MUL_C);
3642 } /* transform_node_Minus */
3645 * Transform a Cast_type(Const) into a new Const_type
3647 static ir_node *transform_node_Cast(ir_node *n) {
3649 ir_node *pred = get_Cast_op(n);
3650 ir_type *tp = get_irn_type(n);
3652 if (is_Const(pred) && get_Const_type(pred) != tp) {
3653 n = new_rd_Const_type(NULL, current_ir_graph, get_irn_n(pred, -1), get_irn_mode(pred),
3654 get_Const_tarval(pred), tp);
3655 DBG_OPT_CSTEVAL(oldn, n);
3656 } else if (is_SymConst(pred) && get_SymConst_value_type(pred) != tp) {
3657 n = new_rd_SymConst_type(NULL, current_ir_graph, get_irn_n(pred, -1), get_irn_mode(pred),
3658 get_SymConst_symbol(pred), get_SymConst_kind(pred), tp);
3659 DBG_OPT_CSTEVAL(oldn, n);
3663 } /* transform_node_Cast */
3666 * Transform a Proj(Load) with a non-null address.
3668 static ir_node *transform_node_Proj_Load(ir_node *proj) {
3669 if (get_opt_ldst_only_null_ptr_exceptions()) {
3670 if (get_irn_mode(proj) == mode_X) {
3671 ir_node *load = get_Proj_pred(proj);
3673 /* get the Load address */
3674 const ir_node *addr = get_Load_ptr(load);
3675 const ir_node *confirm;
3677 if (value_not_null(addr, &confirm)) {
3678 if (confirm == NULL) {
3679 /* this node may float if it did not depend on a Confirm */
3680 set_irn_pinned(load, op_pin_state_floats);
3682 if (get_Proj_proj(proj) == pn_Load_X_except) {
3683 DBG_OPT_EXC_REM(proj);
3684 return get_irg_bad(current_ir_graph);
3686 ir_node *blk = get_nodes_block(load);
3687 return new_r_Jmp(current_ir_graph, blk);
3693 } /* transform_node_Proj_Load */
3696 * Transform a Proj(Store) with a non-null address.
3698 static ir_node *transform_node_Proj_Store(ir_node *proj) {
3699 if (get_opt_ldst_only_null_ptr_exceptions()) {
3700 if (get_irn_mode(proj) == mode_X) {
3701 ir_node *store = get_Proj_pred(proj);
3703 /* get the load/store address */
3704 const ir_node *addr = get_Store_ptr(store);
3705 const ir_node *confirm;
3707 if (value_not_null(addr, &confirm)) {
3708 if (confirm == NULL) {
3709 /* this node may float if it did not depend on a Confirm */
3710 set_irn_pinned(store, op_pin_state_floats);
3712 if (get_Proj_proj(proj) == pn_Store_X_except) {
3713 DBG_OPT_EXC_REM(proj);
3714 return get_irg_bad(current_ir_graph);
3716 ir_node *blk = get_nodes_block(store);
3717 return new_r_Jmp(current_ir_graph, blk);
3723 } /* transform_node_Proj_Store */
3726 * Transform a Proj(Div) with a non-zero value.
3727 * Removes the exceptions and routes the memory to the NoMem node.
3729 static ir_node *transform_node_Proj_Div(ir_node *proj) {
3730 ir_node *div = get_Proj_pred(proj);
3731 ir_node *b = get_Div_right(div);
3732 ir_node *res, *new_mem;
3733 const ir_node *confirm;
3736 if (value_not_zero(b, &confirm)) {
3737 /* div(x, y) && y != 0 */
3738 if (confirm == NULL) {
3739 /* we are sure we have a Const != 0 */
3740 new_mem = get_Div_mem(div);
3741 new_mem = skip_Pin(new_mem);
3742 set_Div_mem(div, new_mem);
3743 set_irn_pinned(div, op_pin_state_floats);
3746 proj_nr = get_Proj_proj(proj);
3748 case pn_Div_X_regular:
3749 return new_r_Jmp(current_ir_graph, get_irn_n(div, -1));
3751 case pn_Div_X_except:
3752 /* we found an exception handler, remove it */
3753 DBG_OPT_EXC_REM(proj);
3757 res = get_Div_mem(div);
3758 new_mem = get_irg_no_mem(current_ir_graph);
3761 /* This node can only float up to the Confirm block */
3762 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3764 set_irn_pinned(div, op_pin_state_floats);
3765 /* this is a Div without exception, we can remove the memory edge */
3766 set_Div_mem(div, new_mem);
3771 } /* transform_node_Proj_Div */
3774 * Transform a Proj(Mod) with a non-zero value.
3775 * Removes the exceptions and routes the memory to the NoMem node.
3777 static ir_node *transform_node_Proj_Mod(ir_node *proj) {
3778 ir_node *mod = get_Proj_pred(proj);
3779 ir_node *b = get_Mod_right(mod);
3780 ir_node *res, *new_mem;
3781 const ir_node *confirm;
3784 if (value_not_zero(b, &confirm)) {
3785 /* mod(x, y) && y != 0 */
3786 proj_nr = get_Proj_proj(proj);
3788 if (confirm == NULL) {
3789 /* we are sure we have a Const != 0 */
3790 new_mem = get_Mod_mem(mod);
3791 new_mem = skip_Pin(new_mem);
3792 set_Mod_mem(mod, new_mem);
3793 set_irn_pinned(mod, op_pin_state_floats);
3798 case pn_Mod_X_regular:
3799 return new_r_Jmp(current_ir_graph, get_irn_n(mod, -1));
3801 case pn_Mod_X_except:
3802 /* we found an exception handler, remove it */
3803 DBG_OPT_EXC_REM(proj);
3807 res = get_Mod_mem(mod);
3808 new_mem = get_irg_no_mem(current_ir_graph);
3811 /* This node can only float up to the Confirm block */
3812 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3814 /* this is a Mod without exception, we can remove the memory edge */
3815 set_Mod_mem(mod, new_mem);
3818 if (get_Mod_left(mod) == b) {
3819 /* a % a = 0 if a != 0 */
3820 ir_mode *mode = get_irn_mode(proj);
3821 ir_node *res = new_Const(mode, get_mode_null(mode));
3823 DBG_OPT_CSTEVAL(mod, res);
3829 } /* transform_node_Proj_Mod */
3832 * Transform a Proj(DivMod) with a non-zero value.
3833 * Removes the exceptions and routes the memory to the NoMem node.
3835 static ir_node *transform_node_Proj_DivMod(ir_node *proj) {
3836 ir_node *divmod = get_Proj_pred(proj);
3837 ir_node *b = get_DivMod_right(divmod);
3838 ir_node *res, *new_mem;
3839 const ir_node *confirm;
3842 if (value_not_zero(b, &confirm)) {
3843 /* DivMod(x, y) && y != 0 */
3844 proj_nr = get_Proj_proj(proj);
3846 if (confirm == NULL) {
3847 /* we are sure we have a Const != 0 */
3848 new_mem = get_DivMod_mem(divmod);
3849 new_mem = skip_Pin(new_mem);
3850 set_DivMod_mem(divmod, new_mem);
3851 set_irn_pinned(divmod, op_pin_state_floats);
3856 case pn_DivMod_X_regular:
3857 return new_r_Jmp(current_ir_graph, get_irn_n(divmod, -1));
3859 case pn_DivMod_X_except:
3860 /* we found an exception handler, remove it */
3861 DBG_OPT_EXC_REM(proj);
3865 res = get_DivMod_mem(divmod);
3866 new_mem = get_irg_no_mem(current_ir_graph);
3869 /* This node can only float up to the Confirm block */
3870 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3872 /* this is a DivMod without exception, we can remove the memory edge */
3873 set_DivMod_mem(divmod, new_mem);
3876 case pn_DivMod_res_mod:
3877 if (get_DivMod_left(divmod) == b) {
3878 /* a % a = 0 if a != 0 */
3879 ir_mode *mode = get_irn_mode(proj);
3880 ir_node *res = new_Const(mode, get_mode_null(mode));
3882 DBG_OPT_CSTEVAL(divmod, res);
3888 } /* transform_node_Proj_DivMod */
3891 * Optimizes jump tables (CondIs or CondIu) by removing all impossible cases.
3893 static ir_node *transform_node_Proj_Cond(ir_node *proj) {
3894 if (get_opt_unreachable_code()) {
3895 ir_node *n = get_Proj_pred(proj);
3896 ir_node *b = get_Cond_selector(n);
3898 if (mode_is_int(get_irn_mode(b))) {
3899 tarval *tb = value_of(b);
3901 if (tb != tarval_bad) {
3902 /* we have a constant switch */
3903 long num = get_Proj_proj(proj);
3905 if (num != get_Cond_defaultProj(n)) { /* we cannot optimize default Proj's yet */
3906 if (get_tarval_long(tb) == num) {
3907 /* Do NOT create a jump here, or we will have 2 control flow ops
3908 * in a block. This case is optimized away in optimize_cf(). */
3911 /* this case will NEVER be taken, kill it */
3912 return get_irg_bad(current_ir_graph);
3919 } /* transform_node_Proj_Cond */
3922 * Create a 0 constant of given mode.
3924 static ir_node *create_zero_const(ir_mode *mode) {
3925 tarval *tv = get_mode_null(mode);
3926 ir_node *cnst = new_Const(mode, tv);
3931 /* the order of the values is important! */
3932 typedef enum const_class {
3938 static const_class classify_const(const ir_node* n)
3940 if (is_Const(n)) return const_const;
3941 if (is_irn_constlike(n)) return const_like;
3946 * Determines whether r is more constlike or has a larger index (in that order)
3949 static int operands_are_normalized(const ir_node *l, const ir_node *r)
3951 const const_class l_order = classify_const(l);
3952 const const_class r_order = classify_const(r);
3954 l_order > r_order ||
3955 (l_order == r_order && get_irn_idx(l) <= get_irn_idx(r));
3959 * Normalizes and optimizes Cmp nodes.
3961 static ir_node *transform_node_Proj_Cmp(ir_node *proj) {
3962 ir_node *n = get_Proj_pred(proj);
3963 ir_node *left = get_Cmp_left(n);
3964 ir_node *right = get_Cmp_right(n);
3967 ir_mode *mode = NULL;
3968 long proj_nr = get_Proj_proj(proj);
3970 /* we can evaluate some cases directly */
3973 return new_Const(mode_b, get_tarval_b_false());
3975 return new_Const(mode_b, get_tarval_b_true());
3977 if (!mode_is_float(get_irn_mode(left)))
3978 return new_Const(mode_b, get_tarval_b_true());
3984 /* remove Casts of both sides */
3985 left = skip_Cast(left);
3986 right = skip_Cast(right);
3988 /* Remove unnecessary conversions */
3989 /* TODO handle constants */
3990 if (is_Conv(left) && is_Conv(right)) {
3991 ir_mode *mode = get_irn_mode(left);
3992 ir_node *op_left = get_Conv_op(left);
3993 ir_node *op_right = get_Conv_op(right);
3994 ir_mode *mode_left = get_irn_mode(op_left);
3995 ir_mode *mode_right = get_irn_mode(op_right);
3997 if (smaller_mode(mode_left, mode) && smaller_mode(mode_right, mode)
3998 && mode_left != mode_b && mode_right != mode_b) {
3999 ir_graph *irg = current_ir_graph;
4000 ir_node *block = get_nodes_block(n);
4002 if (mode_left == mode_right) {
4006 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV_CONV);
4007 } else if (smaller_mode(mode_left, mode_right)) {
4008 left = new_r_Conv(irg, block, op_left, mode_right);
4011 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4012 } else if (smaller_mode(mode_right, mode_left)) {
4014 right = new_r_Conv(irg, block, op_right, mode_left);
4016 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4021 /* remove operation on both sides if possible */
4022 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
4024 * The following operations are NOT safe for floating point operations, for instance
4025 * 1.0 + inf == 2.0 + inf, =/=> x == y
4027 if (mode_is_int(get_irn_mode(left))) {
4028 unsigned lop = get_irn_opcode(left);
4030 if (lop == get_irn_opcode(right)) {
4031 ir_node *ll, *lr, *rl, *rr;
4033 /* same operation on both sides, try to remove */
4037 /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */
4038 left = get_unop_op(left);
4039 right = get_unop_op(right);
4041 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4044 ll = get_Add_left(left);
4045 lr = get_Add_right(left);
4046 rl = get_Add_left(right);
4047 rr = get_Add_right(right);
4050 /* X + a CMP X + b ==> a CMP b */
4054 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4055 } else if (ll == rr) {
4056 /* X + a CMP b + X ==> a CMP b */
4060 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4061 } else if (lr == rl) {
4062 /* a + X CMP X + b ==> a CMP b */
4066 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4067 } else if (lr == rr) {
4068 /* a + X CMP b + X ==> a CMP b */
4072 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4076 ll = get_Sub_left(left);
4077 lr = get_Sub_right(left);
4078 rl = get_Sub_left(right);
4079 rr = get_Sub_right(right);
4082 /* X - a CMP X - b ==> a CMP b */
4086 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4087 } else if (lr == rr) {
4088 /* a - X CMP b - X ==> a CMP b */
4092 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4096 if (get_Rotl_right(left) == get_Rotl_right(right)) {
4097 /* a ROTL X CMP b ROTL X ==> a CMP b */
4098 left = get_Rotl_left(left);
4099 right = get_Rotl_left(right);
4101 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4109 /* X+A == A, A+X == A, A-X == A -> X == 0 */
4110 if (is_Add(left) || is_Sub(left)) {
4111 ir_node *ll = get_binop_left(left);
4112 ir_node *lr = get_binop_right(left);
4114 if (lr == right && is_Add(left)) {
4121 right = create_zero_const(get_irn_mode(left));
4123 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4126 if (is_Add(right) || is_Sub(right)) {
4127 ir_node *rl = get_binop_left(right);
4128 ir_node *rr = get_binop_right(right);
4130 if (rr == left && is_Add(right)) {
4137 right = create_zero_const(get_irn_mode(left));
4139 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4142 } /* mode_is_int(...) */
4143 } /* proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg */
4145 /* replace mode_b compares with ands/ors */
4146 if (get_irn_mode(left) == mode_b) {
4147 ir_graph *irg = current_ir_graph;
4148 ir_node *block = get_nodes_block(n);
4152 case pn_Cmp_Le: bres = new_r_Or( irg, block, new_r_Not(irg, block, left, mode_b), right, mode_b); break;
4153 case pn_Cmp_Lt: bres = new_r_And(irg, block, new_r_Not(irg, block, left, mode_b), right, mode_b); break;
4154 case pn_Cmp_Ge: bres = new_r_Or( irg, block, left, new_r_Not(irg, block, right, mode_b), mode_b); break;
4155 case pn_Cmp_Gt: bres = new_r_And(irg, block, left, new_r_Not(irg, block, right, mode_b), mode_b); break;
4156 case pn_Cmp_Lg: bres = new_r_Eor(irg, block, left, right, mode_b); break;
4157 case pn_Cmp_Eq: bres = new_r_Not(irg, block, new_r_Eor(irg, block, left, right, mode_b), mode_b); break;
4158 default: bres = NULL;
4161 DBG_OPT_ALGSIM0(n, bres, FS_OPT_CMP_TO_BOOL);
4167 * First step: normalize the compare op
4168 * by placing the constant on the right side
4169 * or moving the lower address node to the left.
4171 if (!operands_are_normalized(left, right)) {
4177 proj_nr = get_inversed_pnc(proj_nr);
4182 * Second step: Try to reduce the magnitude
4183 * of a constant. This may help to generate better code
4184 * later and may help to normalize more compares.
4185 * Of course this is only possible for integer values.
4187 tv = value_of(right);
4188 if (tv != tarval_bad) {
4189 mode = get_irn_mode(right);
4191 /* TODO extend to arbitrary constants */
4192 if (is_Conv(left) && tarval_is_null(tv)) {
4193 ir_node *op = get_Conv_op(left);
4194 ir_mode *op_mode = get_irn_mode(op);
4197 * UpConv(x) REL 0 ==> x REL 0
4199 if (get_mode_size_bits(mode) > get_mode_size_bits(op_mode) &&
4200 ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) ||
4201 mode_is_signed(mode) || !mode_is_signed(op_mode))) {
4202 tv = get_mode_null(op_mode);
4206 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4210 if (tv != tarval_bad) {
4211 /* the following optimization is possible on modes without Overflow
4212 * on Unary Minus or on == and !=:
4213 * -a CMP c ==> a swap(CMP) -c
4215 * Beware: for two-complement Overflow may occur, so only == and != can
4216 * be optimized, see this:
4217 * -MININT < 0 =/=> MININT > 0 !!!
4219 if (is_Minus(left) &&
4220 (!mode_overflow_on_unary_Minus(mode) ||
4221 (mode_is_int(mode) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)))) {
4222 tv = tarval_neg(tv);
4224 if (tv != tarval_bad) {
4225 left = get_Minus_op(left);
4226 proj_nr = get_inversed_pnc(proj_nr);
4228 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4230 } else if (is_Not(left) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)) {
4231 /* Not(a) ==/!= c ==> a ==/!= Not(c) */
4232 tv = tarval_not(tv);
4234 if (tv != tarval_bad) {
4235 left = get_Not_op(left);
4237 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4241 /* for integer modes, we have more */
4242 if (mode_is_int(mode)) {
4243 /* Ne includes Unordered which is not possible on integers.
4244 * However, frontends often use this wrong, so fix it here */
4245 if (proj_nr & pn_Cmp_Uo) {
4246 proj_nr &= ~pn_Cmp_Uo;
4247 set_Proj_proj(proj, proj_nr);
4250 /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */
4251 if ((proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Ge) &&
4252 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Gt) {
4253 tv = tarval_sub(tv, get_mode_one(mode), NULL);
4255 if (tv != tarval_bad) {
4256 proj_nr ^= pn_Cmp_Eq;
4258 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4261 /* c < 0 : a > c ==> a >= (c+1) a <= c ==> a < (c+1) */
4262 else if ((proj_nr == pn_Cmp_Gt || proj_nr == pn_Cmp_Le) &&
4263 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Lt) {
4264 tv = tarval_add(tv, get_mode_one(mode));
4266 if (tv != tarval_bad) {
4267 proj_nr ^= pn_Cmp_Eq;
4269 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4273 /* the following reassociations work only for == and != */
4274 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
4276 #if 0 /* Might be not that good in general */
4277 /* a-b == 0 ==> a == b, a-b != 0 ==> a != b */
4278 if (tarval_is_null(tv) && is_Sub(left)) {
4279 right = get_Sub_right(left);
4280 left = get_Sub_left(left);
4282 tv = value_of(right);
4284 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4288 if (tv != tarval_bad) {
4289 /* a-c1 == c2 ==> a == c2+c1, a-c1 != c2 ==> a != c2+c1 */
4291 ir_node *c1 = get_Sub_right(left);
4292 tarval *tv2 = value_of(c1);
4294 if (tv2 != tarval_bad) {
4295 tv2 = tarval_add(tv, value_of(c1));
4297 if (tv2 != tarval_bad) {
4298 left = get_Sub_left(left);
4301 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4305 /* a+c1 == c2 ==> a == c2-c1, a+c1 != c2 ==> a != c2-c1 */
4306 else if (is_Add(left)) {
4307 ir_node *a_l = get_Add_left(left);
4308 ir_node *a_r = get_Add_right(left);
4312 if (is_Const(a_l)) {
4314 tv2 = value_of(a_l);
4317 tv2 = value_of(a_r);
4320 if (tv2 != tarval_bad) {
4321 tv2 = tarval_sub(tv, tv2, NULL);
4323 if (tv2 != tarval_bad) {
4327 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4331 /* -a == c ==> a == -c, -a != c ==> a != -c */
4332 else if (is_Minus(left)) {
4333 tarval *tv2 = tarval_sub(get_mode_null(mode), tv, NULL);
4335 if (tv2 != tarval_bad) {
4336 left = get_Minus_op(left);
4339 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4344 /* the following reassociations work only for <= */
4345 else if (proj_nr == pn_Cmp_Le || proj_nr == pn_Cmp_Lt) {
4346 if (tv != tarval_bad) {
4347 /* c >= 0 : Abs(a) <= c ==> (unsigned)(a + c) <= 2*c */
4348 if (get_irn_op(left) == op_Abs) { // TODO something is missing here
4354 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
4355 switch (get_irn_opcode(left)) {
4359 c1 = get_And_right(left);
4362 * And(x, C1) == C2 ==> FALSE if C2 & C1 != C2
4363 * And(x, C1) != C2 ==> TRUE if C2 & C1 != C2
4365 tarval *mask = tarval_and(get_Const_tarval(c1), tv);
4367 /* TODO: move to constant evaluation */
4368 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4369 c1 = new_Const(mode_b, tv);
4370 DBG_OPT_CSTEVAL(proj, c1);
4374 if (tarval_is_single_bit(tv)) {
4376 * optimization for AND:
4378 * And(x, C) == C ==> And(x, C) != 0
4379 * And(x, C) != C ==> And(X, C) == 0
4381 * if C is a single Bit constant.
4384 /* check for Constant's match. We have check hare the tarvals,
4385 because our const might be changed */
4386 if (get_Const_tarval(c1) == tv) {
4387 /* fine: do the transformation */
4388 tv = get_mode_null(get_tarval_mode(tv));
4389 proj_nr ^= pn_Cmp_Leg;
4391 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4397 c1 = get_Or_right(left);
4398 if (is_Const(c1) && tarval_is_null(tv)) {
4400 * Or(x, C) == 0 && C != 0 ==> FALSE
4401 * Or(x, C) != 0 && C != 0 ==> TRUE
4403 if (! tarval_is_null(get_Const_tarval(c1))) {
4404 /* TODO: move to constant evaluation */
4405 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4406 c1 = new_Const(mode_b, tv);
4407 DBG_OPT_CSTEVAL(proj, c1);
4414 * optimize x << c1 == c into x & (-1 >>u c1) == c >> c1 if c & (-1 << c1) == c
4416 * optimize x << c1 != c into x & (-1 >>u c1) != c >> c1 if c & (-1 << c1) == c
4419 c1 = get_Shl_right(left);
4421 tarval *tv1 = get_Const_tarval(c1);
4422 ir_mode *mode = get_irn_mode(left);
4423 tarval *minus1 = get_mode_all_one(mode);
4424 tarval *amask = tarval_shr(minus1, tv1);
4425 tarval *cmask = tarval_shl(minus1, tv1);
4428 if (tarval_and(tv, cmask) != tv) {
4429 /* condition not met */
4430 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4431 c1 = new_Const(mode_b, tv);
4432 DBG_OPT_CSTEVAL(proj, c1);
4435 sl = get_Shl_left(left);
4436 blk = get_nodes_block(n);
4437 left = new_rd_And(get_irn_dbg_info(left), current_ir_graph, blk, sl, new_Const(mode, amask), mode);
4438 tv = tarval_shr(tv, tv1);
4440 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4445 * optimize x >>u c1 == c into x & (-1 << c1) == c << c1 if c & (-1 >>u c1) == c
4447 * optimize x >>u c1 != c into x & (-1 << c1) != c << c1 if c & (-1 >>u c1) == c
4450 c1 = get_Shr_right(left);
4452 tarval *tv1 = get_Const_tarval(c1);
4453 ir_mode *mode = get_irn_mode(left);
4454 tarval *minus1 = get_mode_all_one(mode);
4455 tarval *amask = tarval_shl(minus1, tv1);
4456 tarval *cmask = tarval_shr(minus1, tv1);
4459 if (tarval_and(tv, cmask) != tv) {
4460 /* condition not met */
4461 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4462 c1 = new_Const(mode_b, tv);
4463 DBG_OPT_CSTEVAL(proj, c1);
4466 sl = get_Shr_left(left);
4467 blk = get_nodes_block(n);
4468 left = new_rd_And(get_irn_dbg_info(left), current_ir_graph, blk, sl, new_Const(mode, amask), mode);
4469 tv = tarval_shl(tv, tv1);
4471 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4476 * optimize x >>s c1 == c into x & (-1 << c1) == c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4478 * optimize x >>s c1 != c into x & (-1 << c1) != c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4481 c1 = get_Shrs_right(left);
4483 tarval *tv1 = get_Const_tarval(c1);
4484 ir_mode *mode = get_irn_mode(left);
4485 tarval *minus1 = get_mode_all_one(mode);
4486 tarval *amask = tarval_shl(minus1, tv1);
4487 tarval *cond = new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(tv1));
4490 cond = tarval_sub(cond, tv1, NULL);
4491 cond = tarval_shrs(tv, cond);
4493 if (!tarval_is_all_one(cond) && !tarval_is_null(cond)) {
4494 /* condition not met */
4495 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4496 c1 = new_Const(mode_b, tv);
4497 DBG_OPT_CSTEVAL(proj, c1);
4500 sl = get_Shrs_left(left);
4501 blk = get_nodes_block(n);
4502 left = new_rd_And(get_irn_dbg_info(left), current_ir_graph, blk, sl, new_Const(mode, amask), mode);
4503 tv = tarval_shl(tv, tv1);
4505 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4510 } /* tarval != bad */
4513 if (changed & 2) /* need a new Const */
4514 right = new_Const(mode, tv);
4516 if ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) && is_Const(right) && is_Const_null(right) && is_Proj(left)) {
4517 ir_node *op = get_Proj_pred(left);
4519 if ((is_Mod(op) && get_Proj_proj(left) == pn_Mod_res) ||
4520 (is_DivMod(op) && get_Proj_proj(left) == pn_DivMod_res_mod)) {
4521 ir_node *c = get_binop_right(op);
4524 tarval *tv = get_Const_tarval(c);
4526 if (tarval_is_single_bit(tv)) {
4527 /* special case: (x % 2^n) CMP 0 ==> x & (2^n-1) CMP 0 */
4528 ir_node *v = get_binop_left(op);
4529 ir_node *blk = get_irn_n(op, -1);
4530 ir_mode *mode = get_irn_mode(v);
4532 tv = tarval_sub(tv, get_mode_one(mode), NULL);
4533 left = new_rd_And(get_irn_dbg_info(op), current_ir_graph, blk, v, new_Const(mode, tv), mode);
4535 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_MOD_TO_AND);
4542 ir_node *block = get_nodes_block(n);
4544 /* create a new compare */
4545 n = new_rd_Cmp(get_irn_dbg_info(n), current_ir_graph, block, left, right);
4546 proj = new_rd_Proj(get_irn_dbg_info(proj), current_ir_graph, block, n, get_irn_mode(proj), proj_nr);
4550 } /* transform_node_Proj_Cmp */
4553 * Optimize CopyB(mem, x, x) into a Nop.
4555 static ir_node *transform_node_Proj_CopyB(ir_node *proj) {
4556 ir_node *copyb = get_Proj_pred(proj);
4557 ir_node *a = get_CopyB_dst(copyb);
4558 ir_node *b = get_CopyB_src(copyb);
4561 switch (get_Proj_proj(proj)) {
4562 case pn_CopyB_X_regular:
4563 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
4564 DBG_OPT_EXC_REM(proj);
4565 proj = new_r_Jmp(current_ir_graph, get_nodes_block(copyb));
4567 case pn_CopyB_M_except:
4568 case pn_CopyB_X_except:
4569 DBG_OPT_EXC_REM(proj);
4570 proj = get_irg_bad(current_ir_graph);
4577 } /* transform_node_Proj_CopyB */
4580 * Optimize Bounds(idx, idx, upper) into idx.
4582 static ir_node *transform_node_Proj_Bound(ir_node *proj) {
4583 ir_node *oldn = proj;
4584 ir_node *bound = get_Proj_pred(proj);
4585 ir_node *idx = get_Bound_index(bound);
4586 ir_node *pred = skip_Proj(idx);
4589 if (idx == get_Bound_lower(bound))
4591 else if (is_Bound(pred)) {
4593 * idx was Bounds checked in the same MacroBlock previously,
4594 * it is still valid if lower <= pred_lower && pred_upper <= upper.
4596 ir_node *lower = get_Bound_lower(bound);
4597 ir_node *upper = get_Bound_upper(bound);
4598 if (get_Bound_lower(pred) == lower &&
4599 get_Bound_upper(pred) == upper &&
4600 get_irn_MacroBlock(bound) == get_irn_MacroBlock(pred)) {
4602 * One could expect that we simply return the previous
4603 * Bound here. However, this would be wrong, as we could
4604 * add an exception Proj to a new location then.
4605 * So, we must turn in into a tuple.
4611 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
4612 switch (get_Proj_proj(proj)) {
4614 DBG_OPT_EXC_REM(proj);
4615 proj = get_Bound_mem(bound);
4617 case pn_Bound_X_except:
4618 DBG_OPT_EXC_REM(proj);
4619 proj = get_irg_bad(current_ir_graph);
4623 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
4625 case pn_Bound_X_regular:
4626 DBG_OPT_EXC_REM(proj);
4627 proj = new_r_Jmp(current_ir_graph, get_nodes_block(bound));
4634 } /* transform_node_Proj_Bound */
4637 * Does all optimizations on nodes that must be done on it's Proj's
4638 * because of creating new nodes.
4640 static ir_node *transform_node_Proj(ir_node *proj) {
4641 ir_node *n = get_Proj_pred(proj);
4643 if (n->op->ops.transform_node_Proj)
4644 return n->op->ops.transform_node_Proj(proj);
4646 } /* transform_node_Proj */
4649 * Move Confirms down through Phi nodes.
4651 static ir_node *transform_node_Phi(ir_node *phi) {
4653 ir_mode *mode = get_irn_mode(phi);
4655 if (mode_is_reference(mode)) {
4656 n = get_irn_arity(phi);
4658 /* Beware of Phi0 */
4660 ir_node *pred = get_irn_n(phi, 0);
4661 ir_node *bound, *new_Phi, *block, **in;
4664 if (! is_Confirm(pred))
4667 bound = get_Confirm_bound(pred);
4668 pnc = get_Confirm_cmp(pred);
4670 NEW_ARR_A(ir_node *, in, n);
4671 in[0] = get_Confirm_value(pred);
4673 for (i = 1; i < n; ++i) {
4674 pred = get_irn_n(phi, i);
4676 if (! is_Confirm(pred) ||
4677 get_Confirm_bound(pred) != bound ||
4678 get_Confirm_cmp(pred) != pnc)
4680 in[i] = get_Confirm_value(pred);
4682 /* move the Confirm nodes "behind" the Phi */
4683 block = get_irn_n(phi, -1);
4684 new_Phi = new_r_Phi(current_ir_graph, block, n, in, get_irn_mode(phi));
4685 return new_r_Confirm(current_ir_graph, block, new_Phi, bound, pnc);
4689 } /* transform_node_Phi */
4692 * Returns the operands of a commutative bin-op, if one operand is
4693 * a const, it is returned as the second one.
4695 static void get_comm_Binop_Ops(ir_node *binop, ir_node **a, ir_node **c) {
4696 ir_node *op_a = get_binop_left(binop);
4697 ir_node *op_b = get_binop_right(binop);
4699 assert(is_op_commutative(get_irn_op(binop)));
4701 if (is_Const(op_a)) {
4708 } /* get_comm_Binop_Ops */
4711 * Optimize a Or(And(Or(And(v,c4),c3),c2),c1) pattern if possible.
4712 * Such pattern may arise in bitfield stores.
4714 * value c4 value c4 & c2
4715 * AND c3 AND c1 | c3
4722 * AND c1 ===> OR if (c1 | c2) == 0x111..11
4725 static ir_node *transform_node_Or_bf_store(ir_node *or) {
4728 ir_node *and_l, *c3;
4729 ir_node *value, *c4;
4730 ir_node *new_and, *new_const, *block;
4731 ir_mode *mode = get_irn_mode(or);
4733 tarval *tv1, *tv2, *tv3, *tv4, *tv, *n_tv4, *n_tv2;
4736 get_comm_Binop_Ops(or, &and, &c1);
4737 if (!is_Const(c1) || !is_And(and))
4740 get_comm_Binop_Ops(and, &or_l, &c2);
4744 tv1 = get_Const_tarval(c1);
4745 tv2 = get_Const_tarval(c2);
4747 tv = tarval_or(tv1, tv2);
4748 if (tarval_is_all_one(tv)) {
4749 /* the AND does NOT clear a bit with isn't set by the OR */
4750 set_Or_left(or, or_l);
4751 set_Or_right(or, c1);
4753 /* check for more */
4760 get_comm_Binop_Ops(or_l, &and_l, &c3);
4761 if (!is_Const(c3) || !is_And(and_l))
4764 get_comm_Binop_Ops(and_l, &value, &c4);
4768 /* ok, found the pattern, check for conditions */
4769 assert(mode == get_irn_mode(and));
4770 assert(mode == get_irn_mode(or_l));
4771 assert(mode == get_irn_mode(and_l));
4773 tv3 = get_Const_tarval(c3);
4774 tv4 = get_Const_tarval(c4);
4776 tv = tarval_or(tv4, tv2);
4777 if (!tarval_is_all_one(tv)) {
4778 /* have at least one 0 at the same bit position */
4782 n_tv4 = tarval_not(tv4);
4783 if (tv3 != tarval_and(tv3, n_tv4)) {
4784 /* bit in the or_mask is outside the and_mask */
4788 n_tv2 = tarval_not(tv2);
4789 if (tv1 != tarval_and(tv1, n_tv2)) {
4790 /* bit in the or_mask is outside the and_mask */
4794 /* ok, all conditions met */
4795 block = get_irn_n(or, -1);
4797 new_and = new_r_And(current_ir_graph, block,
4798 value, new_r_Const(current_ir_graph, block, mode, tarval_and(tv4, tv2)), mode);
4800 new_const = new_r_Const(current_ir_graph, block, mode, tarval_or(tv3, tv1));
4802 set_Or_left(or, new_and);
4803 set_Or_right(or, new_const);
4805 /* check for more */
4807 } /* transform_node_Or_bf_store */
4810 * Optimize an Or(shl(x, c), shr(x, bits - c)) into a Rotl
4812 static ir_node *transform_node_Or_Rotl(ir_node *or) {
4813 ir_mode *mode = get_irn_mode(or);
4814 ir_node *shl, *shr, *block;
4815 ir_node *irn, *x, *c1, *c2, *v, *sub, *n, *rotval;
4818 if (! mode_is_int(mode))
4821 shl = get_binop_left(or);
4822 shr = get_binop_right(or);
4831 } else if (!is_Shl(shl)) {
4833 } else if (!is_Shr(shr)) {
4836 x = get_Shl_left(shl);
4837 if (x != get_Shr_left(shr))
4840 c1 = get_Shl_right(shl);
4841 c2 = get_Shr_right(shr);
4842 if (is_Const(c1) && is_Const(c2)) {
4843 tv1 = get_Const_tarval(c1);
4844 if (! tarval_is_long(tv1))
4847 tv2 = get_Const_tarval(c2);
4848 if (! tarval_is_long(tv2))
4851 if (get_tarval_long(tv1) + get_tarval_long(tv2)
4852 != (int) get_mode_size_bits(mode))
4855 /* yet, condition met */
4856 block = get_nodes_block(or);
4858 n = new_r_Rotl(current_ir_graph, block, x, c1, mode);
4860 DBG_OPT_ALGSIM1(or, shl, shr, n, FS_OPT_OR_SHFT_TO_ROTL);
4867 rotval = sub; /* a Rot right is not supported, so use a rot left */
4868 } else if (is_Sub(c2)) {
4874 if (get_Sub_right(sub) != v)
4877 c1 = get_Sub_left(sub);
4881 tv1 = get_Const_tarval(c1);
4882 if (! tarval_is_long(tv1))
4885 if (get_tarval_long(tv1) != (int) get_mode_size_bits(mode))
4888 /* yet, condition met */
4889 block = get_nodes_block(or);
4891 n = new_r_Rotl(current_ir_graph, block, x, rotval, mode);
4893 DBG_OPT_ALGSIM0(or, n, FS_OPT_OR_SHFT_TO_ROTL);
4895 } /* transform_node_Or_Rotl */
4900 static ir_node *transform_node_Or(ir_node *n) {
4901 ir_node *c, *oldn = n;
4902 ir_node *a = get_Or_left(n);
4903 ir_node *b = get_Or_right(n);
4906 if (is_Not(a) && is_Not(b)) {
4907 /* ~a | ~b = ~(a&b) */
4908 ir_node *block = get_nodes_block(n);
4910 mode = get_irn_mode(n);
4913 n = new_rd_And(get_irn_dbg_info(n), current_ir_graph, block, a, b, mode);
4914 n = new_rd_Not(get_irn_dbg_info(n), current_ir_graph, block, n, mode);
4915 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
4919 /* we can evaluate 2 Projs of the same Cmp */
4920 if (get_irn_mode(n) == mode_b && is_Proj(a) && is_Proj(b)) {
4921 ir_node *pred_a = get_Proj_pred(a);
4922 ir_node *pred_b = get_Proj_pred(b);
4923 if (pred_a == pred_b) {
4924 dbg_info *dbgi = get_irn_dbg_info(n);
4925 ir_node *block = get_nodes_block(pred_a);
4926 pn_Cmp pn_a = get_Proj_proj(a);
4927 pn_Cmp pn_b = get_Proj_proj(b);
4928 /* yes, we can simply calculate with pncs */
4929 pn_Cmp new_pnc = pn_a | pn_b;
4931 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b,
4936 mode = get_irn_mode(n);
4937 HANDLE_BINOP_PHI(tarval_or, a, b, c, mode);
4939 n = transform_node_Or_bf_store(n);
4940 n = transform_node_Or_Rotl(n);
4944 n = transform_bitwise_distributive(n, transform_node_Or);
4947 } /* transform_node_Or */
4951 static ir_node *transform_node(ir_node *n);
4954 * Optimize (a >> c1) >> c2), works for Shr, Shrs, Shl, Rotl.
4956 * Should be moved to reassociation?
4958 static ir_node *transform_node_shift(ir_node *n) {
4959 ir_node *left, *right;
4961 tarval *tv1, *tv2, *res;
4962 ir_node *in[2], *irn, *block;
4964 left = get_binop_left(n);
4966 /* different operations */
4967 if (get_irn_op(left) != get_irn_op(n))
4970 right = get_binop_right(n);
4971 tv1 = value_of(right);
4972 if (tv1 == tarval_bad)
4975 tv2 = value_of(get_binop_right(left));
4976 if (tv2 == tarval_bad)
4979 res = tarval_add(tv1, tv2);
4980 mode = get_irn_mode(n);
4982 /* beware: a simple replacement works only, if res < modulo shift */
4984 int modulo_shf = get_mode_modulo_shift(mode);
4985 assert(modulo_shf >= (int) get_mode_size_bits(mode));
4986 if (modulo_shf > 0) {
4987 tarval *modulo = new_tarval_from_long(modulo_shf,
4988 get_tarval_mode(res));
4990 /* shifting too much */
4991 if (!(tarval_cmp(res, modulo) & pn_Cmp_Lt)) {
4993 ir_graph *irg = get_irn_irg(n);
4994 ir_node *block = get_nodes_block(n);
4995 dbg_info *dbgi = get_irn_dbg_info(n);
4996 ir_node *cnst = new_Const(mode_Iu, new_tarval_from_long(get_mode_size_bits(mode)-1, mode_Iu));
4997 return new_rd_Shrs(dbgi, irg, block, get_binop_left(left),
5001 return new_Const(mode, get_mode_null(mode));
5005 res = tarval_mod(res, new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(res)));
5008 /* ok, we can replace it */
5009 block = get_nodes_block(n);
5011 in[0] = get_binop_left(left);
5012 in[1] = new_r_Const(current_ir_graph, block, get_tarval_mode(res), res);
5014 irn = new_ir_node(NULL, current_ir_graph, block, get_irn_op(n), mode, 2, in);
5016 DBG_OPT_ALGSIM0(n, irn, FS_OPT_REASSOC_SHIFT);
5018 return transform_node(irn);
5019 } /* transform_node_shift */
5022 * normalisation: (x & c1) >> c2 to (x >> c2) & (c1 >> c2)
5024 * - and, or, xor instead of &
5025 * - Shl, Shr, Shrs, rotl instead of >>
5026 * (with a special case for Or/Xor + Shrs)
5028 static ir_node *transform_node_bitop_shift(ir_node *n) {
5030 ir_node *right = get_binop_right(n);
5031 ir_mode *mode = get_irn_mode(n);
5032 ir_node *bitop_left;
5033 ir_node *bitop_right;
5045 assert(is_Shrs(n) || is_Shr(n) || is_Shl(n) || is_Rotl(n));
5047 if (!is_Const(right))
5050 left = get_binop_left(n);
5051 op_left = get_irn_op(left);
5052 if (op_left != op_And && op_left != op_Or && op_left != op_Eor)
5055 /* doing it with Shrs is not legal if the Or/Eor affects the topmost bit */
5056 if (is_Shrs(n) && (op_left == op_Or || op_left == op_Eor)) {
5057 /* TODO: test if sign bit is affectes */
5061 bitop_right = get_binop_right(left);
5062 if (!is_Const(bitop_right))
5065 bitop_left = get_binop_left(left);
5067 irg = get_irn_irg(n);
5068 block = get_nodes_block(n);
5069 dbgi = get_irn_dbg_info(n);
5070 tv1 = get_Const_tarval(bitop_right);
5071 tv2 = get_Const_tarval(right);
5073 assert(get_tarval_mode(tv1) == mode);
5076 new_shift = new_rd_Shl(dbgi, irg, block, bitop_left, right, mode);
5077 tv_shift = tarval_shl(tv1, tv2);
5078 } else if(is_Shr(n)) {
5079 new_shift = new_rd_Shr(dbgi, irg, block, bitop_left, right, mode);
5080 tv_shift = tarval_shr(tv1, tv2);
5081 } else if(is_Shrs(n)) {
5082 new_shift = new_rd_Shrs(dbgi, irg, block, bitop_left, right, mode);
5083 tv_shift = tarval_shrs(tv1, tv2);
5086 new_shift = new_rd_Rotl(dbgi, irg, block, bitop_left, right, mode);
5087 tv_shift = tarval_rotl(tv1, tv2);
5090 assert(get_tarval_mode(tv_shift) == mode);
5091 new_const = new_Const(mode, tv_shift);
5093 if (op_left == op_And) {
5094 new_bitop = new_rd_And(dbgi, irg, block, new_shift, new_const, mode);
5095 } else if(op_left == op_Or) {
5096 new_bitop = new_rd_Or(dbgi, irg, block, new_shift, new_const, mode);
5098 assert(op_left == op_Eor);
5099 new_bitop = new_rd_Eor(dbgi, irg, block, new_shift, new_const, mode);
5107 * (x << c1) >> c2 <=> x OP (c2-c1) & ((-1 << c1) >> c2)
5109 * (x >> c1) << c2 <=> x OP (c2-c1) & ((-1 >> c1) << c2)
5110 * (also with x >>s c1 when c1>=c2)
5112 static ir_node *transform_node_shl_shr(ir_node *n) {
5114 ir_node *right = get_binop_right(n);
5130 assert(is_Shl(n) || is_Shr(n) || is_Shrs(n));
5132 if (!is_Const(right))
5135 left = get_binop_left(n);
5136 mode = get_irn_mode(n);
5137 if (is_Shl(n) && (is_Shr(left) || is_Shrs(left))) {
5138 ir_node *shr_right = get_binop_right(left);
5140 if (!is_Const(shr_right))
5143 x = get_binop_left(left);
5144 tv_shr = get_Const_tarval(shr_right);
5145 tv_shl = get_Const_tarval(right);
5147 if (is_Shrs(left)) {
5148 /* shrs variant only allowed if c1 >= c2 */
5149 if (! (tarval_cmp(tv_shl, tv_shr) & pn_Cmp_Ge))
5152 tv_mask = tarval_shrs(get_mode_all_one(mode), tv_shr);
5155 tv_mask = tarval_shr(get_mode_all_one(mode), tv_shr);
5157 tv_mask = tarval_shl(tv_mask, tv_shl);
5158 } else if(is_Shr(n) && is_Shl(left)) {
5159 ir_node *shl_right = get_Shl_right(left);
5161 if (!is_Const(shl_right))
5164 x = get_Shl_left(left);
5165 tv_shr = get_Const_tarval(right);
5166 tv_shl = get_Const_tarval(shl_right);
5168 tv_mask = tarval_shl(get_mode_all_one(mode), tv_shl);
5169 tv_mask = tarval_shr(tv_mask, tv_shr);
5174 assert(get_tarval_mode(tv_shl) == get_tarval_mode(tv_shr));
5175 assert(tv_mask != tarval_bad);
5176 assert(get_tarval_mode(tv_mask) == mode);
5178 irg = get_irn_irg(n);
5179 block = get_nodes_block(n);
5180 dbgi = get_irn_dbg_info(n);
5182 pnc = tarval_cmp(tv_shl, tv_shr);
5183 if (pnc == pn_Cmp_Lt || pnc == pn_Cmp_Eq) {
5184 tv_shift = tarval_sub(tv_shr, tv_shl, NULL);
5185 new_const = new_Const(get_tarval_mode(tv_shift), tv_shift);
5187 new_shift = new_rd_Shrs(dbgi, irg, block, x, new_const, mode);
5189 new_shift = new_rd_Shr(dbgi, irg, block, x, new_const, mode);
5192 assert(pnc == pn_Cmp_Gt);
5193 tv_shift = tarval_sub(tv_shl, tv_shr, NULL);
5194 new_const = new_Const(get_tarval_mode(tv_shift), tv_shift);
5195 new_shift = new_rd_Shl(dbgi, irg, block, x, new_const, mode);
5198 new_const = new_Const(mode, tv_mask);
5199 new_and = new_rd_And(dbgi, irg, block, new_shift, new_const, mode);
5207 static ir_node *transform_node_Shr(ir_node *n) {
5208 ir_node *c, *oldn = n;
5209 ir_node *left = get_Shr_left(n);
5210 ir_node *right = get_Shr_right(n);
5211 ir_mode *mode = get_irn_mode(n);
5213 HANDLE_BINOP_PHI(tarval_shr, left, right, c, mode);
5214 n = transform_node_shift(n);
5217 n = transform_node_shl_shr(n);
5219 n = transform_node_bitop_shift(n);
5222 } /* transform_node_Shr */
5227 static ir_node *transform_node_Shrs(ir_node *n) {
5228 ir_node *c, *oldn = n;
5229 ir_node *a = get_Shrs_left(n);
5230 ir_node *b = get_Shrs_right(n);
5231 ir_mode *mode = get_irn_mode(n);
5233 HANDLE_BINOP_PHI(tarval_shrs, a, b, c, mode);
5234 n = transform_node_shift(n);
5237 n = transform_node_bitop_shift(n);
5240 } /* transform_node_Shrs */
5245 static ir_node *transform_node_Shl(ir_node *n) {
5246 ir_node *c, *oldn = n;
5247 ir_node *a = get_Shl_left(n);
5248 ir_node *b = get_Shl_right(n);
5249 ir_mode *mode = get_irn_mode(n);
5251 HANDLE_BINOP_PHI(tarval_shl, a, b, c, mode);
5252 n = transform_node_shift(n);
5255 n = transform_node_shl_shr(n);
5257 n = transform_node_bitop_shift(n);
5260 } /* transform_node_Shl */
5265 static ir_node *transform_node_Rotl(ir_node *n) {
5266 ir_node *c, *oldn = n;
5267 ir_node *a = get_Rotl_left(n);
5268 ir_node *b = get_Rotl_right(n);
5269 ir_mode *mode = get_irn_mode(n);
5271 HANDLE_BINOP_PHI(tarval_rotl, a, b, c, mode);
5272 n = transform_node_shift(n);
5275 n = transform_node_bitop_shift(n);
5278 } /* transform_node_Rotl */
5283 static ir_node *transform_node_Conv(ir_node *n) {
5284 ir_node *c, *oldn = n;
5285 ir_node *a = get_Conv_op(n);
5287 if (is_const_Phi(a)) {
5288 c = apply_conv_on_phi(a, get_irn_mode(n));
5290 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI);
5295 if (is_Unknown(a)) { /* Conv_A(Unknown_B) -> Unknown_A */
5296 ir_mode *mode = get_irn_mode(n);
5297 return new_r_Unknown(current_ir_graph, mode);
5301 } /* transform_node_Conv */
5304 * Remove dead blocks and nodes in dead blocks
5305 * in keep alive list. We do not generate a new End node.
5307 static ir_node *transform_node_End(ir_node *n) {
5308 int i, j, n_keepalives = get_End_n_keepalives(n);
5311 NEW_ARR_A(ir_node *, in, n_keepalives);
5313 for (i = j = 0; i < n_keepalives; ++i) {
5314 ir_node *ka = get_End_keepalive(n, i);
5316 if (! is_Block_dead(ka)) {
5320 } else if (is_irn_pinned_in_irg(ka) && is_Block_dead(get_nodes_block(ka))) {
5323 /* FIXME: beabi need to keep a Proj(M) */
5324 if (is_Phi(ka) || is_irn_keep(ka) || is_Proj(ka))
5327 if (j != n_keepalives)
5328 set_End_keepalives(n, j, in);
5330 } /* transform_node_End */
5332 /** returns 1 if a == -b */
5333 static int is_negated_value(ir_node *a, ir_node *b) {
5334 if (is_Minus(a) && get_Minus_op(a) == b)
5336 if (is_Minus(b) && get_Minus_op(b) == a)
5338 if (is_Sub(a) && is_Sub(b)) {
5339 ir_node *a_left = get_Sub_left(a);
5340 ir_node *a_right = get_Sub_right(a);
5341 ir_node *b_left = get_Sub_left(b);
5342 ir_node *b_right = get_Sub_right(b);
5344 if (a_left == b_right && a_right == b_left)
5352 * Optimize a Mux into some simpler cases.
5354 static ir_node *transform_node_Mux(ir_node *n) {
5355 ir_node *oldn = n, *sel = get_Mux_sel(n);
5356 ir_mode *mode = get_irn_mode(n);
5357 ir_node *t = get_Mux_true(n);
5358 ir_node *f = get_Mux_false(n);
5359 ir_graph *irg = current_ir_graph;
5361 /* first normalization step: move a possible zero to the false case */
5363 ir_node *cmp = get_Proj_pred(sel);
5366 if (is_Const(t) && is_Const_null(t)) {
5369 /* Mux(x, 0, y) => Mux(x, y, 0) */
5370 pn_Cmp pnc = get_Proj_proj(sel);
5371 sel = new_r_Proj(irg, get_nodes_block(cmp), cmp, mode_b,
5372 get_negated_pnc(pnc, get_irn_mode(get_Cmp_left(cmp))));
5373 n = new_rd_Mux(get_irn_dbg_info(n), irg, get_nodes_block(n), sel, t, f, mode);
5381 /* note: after normalization, false can only happen on default */
5382 if (mode == mode_b) {
5383 dbg_info *dbg = get_irn_dbg_info(n);
5384 ir_node *block = get_nodes_block(n);
5385 ir_graph *irg = current_ir_graph;
5388 tarval *tv_t = get_Const_tarval(t);
5389 if (tv_t == tarval_b_true) {
5391 /* Muxb(sel, true, false) = sel */
5392 assert(get_Const_tarval(f) == tarval_b_false);
5393 DBG_OPT_ALGSIM0(oldn, sel, FS_OPT_MUX_BOOL);
5396 /* Muxb(sel, true, x) = Or(sel, x) */
5397 n = new_rd_Or(dbg, irg, block, sel, f, mode_b);
5398 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_OR_BOOL);
5402 } else if (is_Const(f)) {
5403 tarval *tv_f = get_Const_tarval(f);
5404 if (tv_f == tarval_b_true) {
5405 /* Muxb(sel, x, true) = Or(Not(sel), x) */
5406 ir_node* not_sel = new_rd_Not(dbg, irg, block, sel, mode_b);
5407 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_ORNOT_BOOL);
5408 n = new_rd_Or(dbg, irg, block, not_sel, t, mode_b);
5411 /* Muxb(sel, x, false) = And(sel, x) */
5412 assert(tv_f == tarval_b_false);
5413 n = new_rd_And(dbg, irg, block, sel, t, mode_b);
5414 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_AND_BOOL);
5420 /* more normalization: try to normalize Mux(x, C1, C2) into Mux(x, +1/-1, 0) op C2 */
5421 if (is_Const(t) && is_Const(f) && mode_is_int(mode)) {
5422 tarval *a = get_Const_tarval(t);
5423 tarval *b = get_Const_tarval(f);
5424 tarval *null = get_tarval_null(mode);
5427 if (tarval_cmp(a, b) & pn_Cmp_Gt) {
5428 diff = tarval_sub(a, b, NULL);
5431 diff = tarval_sub(b, a, NULL);
5435 if (diff == get_tarval_one(mode) && min != null) {
5436 dbg_info *dbg = get_irn_dbg_info(n);
5437 ir_node *block = get_nodes_block(n);
5438 ir_graph *irg = current_ir_graph;
5439 ir_node *t = new_Const(mode, tarval_sub(a, min, NULL));
5440 ir_node *f = new_Const(mode, tarval_sub(b, min, NULL));
5441 n = new_rd_Mux(dbg, irg, block, sel, f, t, mode);
5442 n = new_rd_Add(dbg, irg, block, n, new_Const(mode, min), mode);
5448 ir_node *cmp = get_Proj_pred(sel);
5449 long pn = get_Proj_proj(sel);
5452 * Note: normalization puts the constant on the right side,
5453 * so we check only one case.
5455 * Note further that these optimization work even for floating point
5456 * with NaN's because -NaN == NaN.
5457 * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
5461 ir_node *cmp_r = get_Cmp_right(cmp);
5462 if (is_Const(cmp_r) && is_Const_null(cmp_r)) {
5463 ir_node *block = get_nodes_block(n);
5464 ir_node *cmp_l = get_Cmp_left(cmp);
5466 if (!mode_honor_signed_zeros(mode) && is_negated_value(f, t)) {
5469 if ( (cmp_l == t && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt))
5470 || (cmp_l == f && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt)))
5472 /* Mux(a >/>= 0, a, -a) = Mux(a </<= 0, -a, a) ==> Abs(a) */
5473 n = new_rd_Abs(get_irn_dbg_info(n), current_ir_graph, block,
5475 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
5477 } else if ((cmp_l == t && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt))
5478 || (cmp_l == f && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt)))
5480 /* Mux(a </<= 0, a, -a) = Mux(a >/>= 0, -a, a) ==> -Abs(a) */
5481 n = new_rd_Abs(get_irn_dbg_info(n), current_ir_graph, block,
5483 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph,
5485 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
5490 if (mode_is_int(mode)) {
5492 if ((pn == pn_Cmp_Lg || pn == pn_Cmp_Eq) && is_And(cmp_l)) {
5493 /* Mux((a & b) != 0, c, 0) */
5494 ir_node *and_r = get_And_right(cmp_l);
5497 if (and_r == t && f == cmp_r) {
5498 if (is_Const(t) && tarval_is_single_bit(get_Const_tarval(t))) {
5499 if (pn == pn_Cmp_Lg) {
5500 /* Mux((a & 2^C) != 0, 2^C, 0) */
5503 /* Mux((a & 2^C) == 0, 2^C, 0) */
5504 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph,
5505 block, cmp_l, t, mode);
5510 if (is_Shl(and_r)) {
5511 ir_node *shl_l = get_Shl_left(and_r);
5512 if (is_Const(shl_l) && is_Const_one(shl_l)) {
5513 if (and_r == t && f == cmp_r) {
5514 if (pn == pn_Cmp_Lg) {
5515 /* (a & (1 << n)) != 0, (1 << n), 0) */
5518 /* (a & (1 << n)) == 0, (1 << n), 0) */
5519 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph,
5520 block, cmp_l, t, mode);
5526 and_l = get_And_left(cmp_l);
5527 if (is_Shl(and_l)) {
5528 ir_node *shl_l = get_Shl_left(and_l);
5529 if (is_Const(shl_l) && is_Const_one(shl_l)) {
5530 if (and_l == t && f == cmp_r) {
5531 if (pn == pn_Cmp_Lg) {
5532 /* ((1 << n) & a) != 0, (1 << n), 0) */
5535 /* ((1 << n) & a) == 0, (1 << n), 0) */
5536 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph,
5537 block, cmp_l, t, mode);
5548 return arch_transform_node_Mux(n);
5549 } /* transform_node_Mux */
5552 * optimize Sync nodes that have other syncs as input we simply add the inputs
5553 * of the other sync to our own inputs
5555 static ir_node *transform_node_Sync(ir_node *n) {
5556 int arity = get_Sync_n_preds(n);
5559 for (i = 0; i < arity;) {
5560 ir_node *pred = get_Sync_pred(n, i);
5564 if (!is_Sync(pred)) {
5572 pred_arity = get_Sync_n_preds(pred);
5573 for (j = 0; j < pred_arity; ++j) {
5574 ir_node *pred_pred = get_Sync_pred(pred, j);
5579 add_irn_n(n, pred_pred);
5583 if (get_Sync_pred(n, k) == pred_pred) break;
5588 /* rehash the sync node */
5589 add_identities(current_ir_graph->value_table, n);
5595 * Tries several [inplace] [optimizing] transformations and returns an
5596 * equivalent node. The difference to equivalent_node() is that these
5597 * transformations _do_ generate new nodes, and thus the old node must
5598 * not be freed even if the equivalent node isn't the old one.
5600 static ir_node *transform_node(ir_node *n) {
5604 * Transform_node is the only "optimizing transformation" that might
5605 * return a node with a different opcode. We iterate HERE until fixpoint
5606 * to get the final result.
5610 if (n->op->ops.transform_node)
5611 n = n->op->ops.transform_node(n);
5612 } while (oldn != n);
5615 } /* transform_node */
5618 * Sets the default transform node operation for an ir_op_ops.
5620 * @param code the opcode for the default operation
5621 * @param ops the operations initialized
5626 static ir_op_ops *firm_set_default_transform_node(ir_opcode code, ir_op_ops *ops)
5630 ops->transform_node = transform_node_##a; \
5632 #define CASE_PROJ(a) \
5634 ops->transform_node_Proj = transform_node_Proj_##a; \
5636 #define CASE_PROJ_EX(a) \
5638 ops->transform_node = transform_node_##a; \
5639 ops->transform_node_Proj = transform_node_Proj_##a; \
5648 CASE_PROJ_EX(DivMod);
5682 } /* firm_set_default_transform_node */
5685 /* **************** Common Subexpression Elimination **************** */
5687 /** The size of the hash table used, should estimate the number of nodes
5689 #define N_IR_NODES 512
5691 /** Compares the attributes of two Const nodes. */
5692 static int node_cmp_attr_Const(ir_node *a, ir_node *b) {
5693 return (get_Const_tarval(a) != get_Const_tarval(b))
5694 || (get_Const_type(a) != get_Const_type(b));
5695 } /* node_cmp_attr_Const */
5697 /** Compares the attributes of two Proj nodes. */
5698 static int node_cmp_attr_Proj(ir_node *a, ir_node *b) {
5699 return get_irn_proj_attr(a) != get_irn_proj_attr(b);
5700 } /* node_cmp_attr_Proj */
5702 /** Compares the attributes of two Filter nodes. */
5703 static int node_cmp_attr_Filter(ir_node *a, ir_node *b) {
5704 return get_Filter_proj(a) != get_Filter_proj(b);
5705 } /* node_cmp_attr_Filter */
5707 /** Compares the attributes of two Alloc nodes. */
5708 static int node_cmp_attr_Alloc(ir_node *a, ir_node *b) {
5709 const alloc_attr *pa = get_irn_alloc_attr(a);
5710 const alloc_attr *pb = get_irn_alloc_attr(b);
5711 return (pa->where != pb->where) || (pa->type != pb->type);
5712 } /* node_cmp_attr_Alloc */
5714 /** Compares the attributes of two Free nodes. */
5715 static int node_cmp_attr_Free(ir_node *a, ir_node *b) {
5716 const free_attr *pa = get_irn_free_attr(a);
5717 const free_attr *pb = get_irn_free_attr(b);
5718 return (pa->where != pb->where) || (pa->type != pb->type);
5719 } /* node_cmp_attr_Free */
5721 /** Compares the attributes of two SymConst nodes. */
5722 static int node_cmp_attr_SymConst(ir_node *a, ir_node *b) {
5723 const symconst_attr *pa = get_irn_symconst_attr(a);
5724 const symconst_attr *pb = get_irn_symconst_attr(b);
5725 return (pa->kind != pb->kind)
5726 || (pa->sym.type_p != pb->sym.type_p)
5727 || (pa->tp != pb->tp);
5728 } /* node_cmp_attr_SymConst */
5730 /** Compares the attributes of two Call nodes. */
5731 static int node_cmp_attr_Call(ir_node *a, ir_node *b) {
5732 return get_irn_call_attr(a) != get_irn_call_attr(b);
5733 } /* node_cmp_attr_Call */
5735 /** Compares the attributes of two Sel nodes. */
5736 static int node_cmp_attr_Sel(ir_node *a, ir_node *b) {
5737 const ir_entity *a_ent = get_Sel_entity(a);
5738 const ir_entity *b_ent = get_Sel_entity(b);
5740 (a_ent->kind != b_ent->kind) ||
5741 (a_ent->name != b_ent->name) ||
5742 (a_ent->owner != b_ent->owner) ||
5743 (a_ent->ld_name != b_ent->ld_name) ||
5744 (a_ent->type != b_ent->type);
5745 } /* node_cmp_attr_Sel */
5747 /** Compares the attributes of two Phi nodes. */
5748 static int node_cmp_attr_Phi(ir_node *a, ir_node *b) {
5749 /* we can only enter this function if both nodes have the same number of inputs,
5750 hence it is enough to check if one of them is a Phi0 */
5752 /* check the Phi0 pos attribute */
5753 return get_irn_phi_attr(a)->u.pos != get_irn_phi_attr(b)->u.pos;
5756 } /* node_cmp_attr_Phi */
5758 /** Compares the attributes of two Conv nodes. */
5759 static int node_cmp_attr_Conv(ir_node *a, ir_node *b) {
5760 return get_Conv_strict(a) != get_Conv_strict(b);
5761 } /* node_cmp_attr_Conv */
5763 /** Compares the attributes of two Cast nodes. */
5764 static int node_cmp_attr_Cast(ir_node *a, ir_node *b) {
5765 return get_Cast_type(a) != get_Cast_type(b);
5766 } /* node_cmp_attr_Cast */
5768 /** Compares the attributes of two Load nodes. */
5769 static int node_cmp_attr_Load(ir_node *a, ir_node *b) {
5770 if (get_Load_volatility(a) == volatility_is_volatile ||
5771 get_Load_volatility(b) == volatility_is_volatile)
5772 /* NEVER do CSE on volatile Loads */
5774 /* do not CSE Loads with different alignment. Be conservative. */
5775 if (get_Load_align(a) != get_Load_align(b))
5778 return get_Load_mode(a) != get_Load_mode(b);
5779 } /* node_cmp_attr_Load */
5781 /** Compares the attributes of two Store nodes. */
5782 static int node_cmp_attr_Store(ir_node *a, ir_node *b) {
5783 /* do not CSE Stores with different alignment. Be conservative. */
5784 if (get_Store_align(a) != get_Store_align(b))
5787 /* NEVER do CSE on volatile Stores */
5788 return (get_Store_volatility(a) == volatility_is_volatile ||
5789 get_Store_volatility(b) == volatility_is_volatile);
5790 } /* node_cmp_attr_Store */
5792 /** Compares two exception attributes */
5793 static int node_cmp_exception(ir_node *a, ir_node *b) {
5794 const except_attr *ea = get_irn_except_attr(a);
5795 const except_attr *eb = get_irn_except_attr(b);
5797 return ea->pin_state != eb->pin_state;
5800 #define node_cmp_attr_Bound node_cmp_exception
5802 /** Compares the attributes of two Div nodes. */
5803 static int node_cmp_attr_Div(ir_node *a, ir_node *b) {
5804 const divmod_attr *ma = get_irn_divmod_attr(a);
5805 const divmod_attr *mb = get_irn_divmod_attr(b);
5806 return ma->exc.pin_state != mb->exc.pin_state ||
5807 ma->res_mode != mb->res_mode ||
5808 ma->no_remainder != mb->no_remainder;
5809 } /* node_cmp_attr_Div */
5811 /** Compares the attributes of two DivMod nodes. */
5812 static int node_cmp_attr_DivMod(ir_node *a, ir_node *b) {
5813 const divmod_attr *ma = get_irn_divmod_attr(a);
5814 const divmod_attr *mb = get_irn_divmod_attr(b);
5815 return ma->exc.pin_state != mb->exc.pin_state ||
5816 ma->res_mode != mb->res_mode;
5817 } /* node_cmp_attr_DivMod */
5819 /** Compares the attributes of two Mod nodes. */
5820 static int node_cmp_attr_Mod(ir_node *a, ir_node *b) {
5821 const divmod_attr *ma = get_irn_divmod_attr(a);
5822 const divmod_attr *mb = get_irn_divmod_attr(b);
5823 return ma->exc.pin_state != mb->exc.pin_state ||
5824 ma->res_mode != mb->res_mode;
5825 } /* node_cmp_attr_Mod */
5827 /** Compares the attributes of two Quot nodes. */
5828 static int node_cmp_attr_Quot(ir_node *a, ir_node *b) {
5829 const divmod_attr *ma = get_irn_divmod_attr(a);
5830 const divmod_attr *mb = get_irn_divmod_attr(b);
5831 return ma->exc.pin_state != mb->exc.pin_state ||
5832 ma->res_mode != mb->res_mode;
5833 } /* node_cmp_attr_Quot */
5835 /** Compares the attributes of two Confirm nodes. */
5836 static int node_cmp_attr_Confirm(ir_node *a, ir_node *b) {
5837 return (get_Confirm_cmp(a) != get_Confirm_cmp(b));
5838 } /* node_cmp_attr_Confirm */
5840 /** Compares the attributes of two ASM nodes. */
5841 static int node_cmp_attr_ASM(ir_node *a, ir_node *b) {
5843 const ir_asm_constraint *ca;
5844 const ir_asm_constraint *cb;
5847 if (get_ASM_text(a) != get_ASM_text(b))
5850 /* Should we really check the constraints here? Should be better, but is strange. */
5851 n = get_ASM_n_input_constraints(a);
5852 if (n != get_ASM_n_input_constraints(b))
5855 ca = get_ASM_input_constraints(a);
5856 cb = get_ASM_input_constraints(b);
5857 for (i = 0; i < n; ++i) {
5858 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
5862 n = get_ASM_n_output_constraints(a);
5863 if (n != get_ASM_n_output_constraints(b))
5866 ca = get_ASM_output_constraints(a);
5867 cb = get_ASM_output_constraints(b);
5868 for (i = 0; i < n; ++i) {
5869 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
5873 n = get_ASM_n_clobbers(a);
5874 if (n != get_ASM_n_clobbers(b))
5877 cla = get_ASM_clobbers(a);
5878 clb = get_ASM_clobbers(b);
5879 for (i = 0; i < n; ++i) {
5880 if (cla[i] != clb[i])
5884 } /* node_cmp_attr_ASM */
5887 * Set the default node attribute compare operation for an ir_op_ops.
5889 * @param code the opcode for the default operation
5890 * @param ops the operations initialized
5895 static ir_op_ops *firm_set_default_node_cmp_attr(ir_opcode code, ir_op_ops *ops)
5899 ops->node_cmp_attr = node_cmp_attr_##a; \
5930 } /* firm_set_default_node_cmp_attr */
5933 * Compare function for two nodes in the value table. Gets two
5934 * nodes as parameters. Returns 0 if the nodes are a Common Sub Expression.
5936 int identities_cmp(const void *elt, const void *key) {
5937 ir_node *a = (ir_node *)elt;
5938 ir_node *b = (ir_node *)key;
5941 if (a == b) return 0;
5943 if ((get_irn_op(a) != get_irn_op(b)) ||
5944 (get_irn_mode(a) != get_irn_mode(b))) return 1;
5946 /* compare if a's in and b's in are of equal length */
5947 irn_arity_a = get_irn_intra_arity(a);
5948 if (irn_arity_a != get_irn_intra_arity(b))
5951 if (get_irn_pinned(a) == op_pin_state_pinned) {
5952 /* for pinned nodes, the block inputs must be equal */
5953 if (get_irn_intra_n(a, -1) != get_irn_intra_n(b, -1))
5955 } else if (! get_opt_global_cse()) {
5956 /* for block-local CSE both nodes must be in the same MacroBlock */
5957 if (get_irn_MacroBlock(a) != get_irn_MacroBlock(b))
5961 /* compare a->in[0..ins] with b->in[0..ins] */
5962 for (i = 0; i < irn_arity_a; i++)
5963 if (get_irn_intra_n(a, i) != get_irn_intra_n(b, i))
5967 * here, we already now that the nodes are identical except their
5970 if (a->op->ops.node_cmp_attr)
5971 return a->op->ops.node_cmp_attr(a, b);
5974 } /* identities_cmp */
5977 * Calculate a hash value of a node.
5979 * @param node The IR-node
5981 unsigned ir_node_hash(const ir_node *node) {
5982 return node->op->ops.hash(node);
5983 } /* ir_node_hash */
5986 pset *new_identities(void) {
5987 return new_pset(identities_cmp, N_IR_NODES);
5988 } /* new_identities */
5990 void del_identities(pset *value_table) {
5991 del_pset(value_table);
5992 } /* del_identities */
5995 * Normalize a node by putting constants (and operands with larger
5996 * node index) on the right (operator side).
5998 * @param n The node to normalize
6000 static void normalize_node(ir_node *n) {
6001 if (is_op_commutative(get_irn_op(n))) {
6002 ir_node *l = get_binop_left(n);
6003 ir_node *r = get_binop_right(n);
6005 /* For commutative operators perform a OP b == b OP a but keep
6006 * constants on the RIGHT side. This helps greatly in some
6007 * optimizations. Moreover we use the idx number to make the form
6009 if (!operands_are_normalized(l, r)) {
6010 set_binop_left(n, r);
6011 set_binop_right(n, l);
6014 } /* normalize_node */
6017 * Update the nodes after a match in the value table. If both nodes have
6018 * the same MacroBlock but different Blocks, we must ensure that the node
6019 * with the dominating Block (the node that is near to the MacroBlock header
6020 * is stored in the table.
6021 * Because a MacroBlock has only one "non-exception" flow, we don't need
6022 * dominance info here: We known, that one block must dominate the other and
6023 * following the only block input will allow to find it.
6025 static void update_known_irn(ir_node *known_irn, const ir_node *new_ir_node) {
6026 ir_node *known_blk, *new_block, *block, *mbh;
6028 if (get_opt_global_cse()) {
6029 /* Block inputs are meaning less */
6032 known_blk = get_irn_n(known_irn, -1);
6033 new_block = get_irn_n(new_ir_node, -1);
6034 if (known_blk == new_block) {
6035 /* already in the same block */
6039 * We expect the typical case when we built the graph. In that case, the
6040 * known_irn is already the upper one, so checking this should be faster.
6043 mbh = get_Block_MacroBlock(new_block);
6045 if (block == known_blk) {
6046 /* ok, we have found it: known_block dominates new_block as expected */
6051 * We have reached the MacroBlock header NOT founding
6052 * the known_block. new_block must dominate known_block.
6055 set_irn_n(known_irn, -1, new_block);
6058 assert(get_Block_n_cfgpreds(block) == 1);
6059 block = get_Block_cfgpred_block(block, 0);
6061 } /* update_value_table */
6064 * Return the canonical node computing the same value as n.
6065 * Looks up the node in a hash table, enters it in the table
6066 * if it isn't there yet.
6068 * @param value_table the HashSet containing all nodes in the
6070 * @param n the node to look up
6072 * @return a node that computes the same value as n or n if no such
6073 * node could be found
6075 ir_node *identify_remember(pset *value_table, ir_node *n) {
6078 if (!value_table) return n;
6081 /* lookup or insert in hash table with given hash key. */
6082 o = pset_insert(value_table, n, ir_node_hash(n));
6085 update_known_irn(o, n);
6090 } /* identify_remember */
6093 * During construction we set the op_pin_state_pinned flag in the graph right when the
6094 * optimization is performed. The flag turning on procedure global cse could
6095 * be changed between two allocations. This way we are safe.
6097 * @param value_table The value table
6098 * @param n The node to lookup
6100 static INLINE ir_node *identify_cons(pset *value_table, ir_node *n) {
6103 n = identify_remember(value_table, n);
6104 if (n != old && get_irn_MacroBlock(old) != get_irn_MacroBlock(n))
6105 set_irg_pinned(current_ir_graph, op_pin_state_floats);
6107 } /* identify_cons */
6109 /* Add a node to the identities value table. */
6110 void add_identities(pset *value_table, ir_node *node) {
6111 if (get_opt_cse() && is_no_Block(node))
6112 identify_remember(value_table, node);
6113 } /* add_identities */
6115 /* Visit each node in the value table of a graph. */
6116 void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env) {
6118 ir_graph *rem = current_ir_graph;
6120 current_ir_graph = irg;
6121 foreach_pset(irg->value_table, node)
6123 current_ir_graph = rem;
6124 } /* visit_all_identities */
6127 * Garbage in, garbage out. If a node has a dead input, i.e., the
6128 * Bad node is input to the node, return the Bad node.
6130 static ir_node *gigo(ir_node *node) {
6132 ir_op *op = get_irn_op(node);
6134 /* remove garbage blocks by looking at control flow that leaves the block
6135 and replacing the control flow by Bad. */
6136 if (get_irn_mode(node) == mode_X) {
6137 ir_node *block = get_nodes_block(skip_Proj(node));
6139 /* Don't optimize nodes in immature blocks. */
6140 if (!get_Block_matured(block))
6142 /* Don't optimize End, may have Bads. */
6143 if (op == op_End) return node;
6145 if (is_Block(block)) {
6146 if (is_Block_dead(block)) {
6147 /* control flow from dead block is dead */
6151 for (i = get_irn_arity(block) - 1; i >= 0; --i) {
6152 if (!is_Bad(get_irn_n(block, i)))
6156 ir_graph *irg = get_irn_irg(block);
6157 /* the start block is never dead */
6158 if (block != get_irg_start_block(irg)
6159 && block != get_irg_end_block(irg)) {
6161 * Do NOT kill control flow without setting
6162 * the block to dead of bad things can happen:
6163 * We get a Block that is not reachable be irg_block_walk()
6164 * but can be found by irg_walk()!
6166 set_Block_dead(block);
6173 /* Blocks, Phis and Tuples may have dead inputs, e.g., if one of the
6174 blocks predecessors is dead. */
6175 if (op != op_Block && op != op_Phi && op != op_Tuple) {
6176 irn_arity = get_irn_arity(node);
6179 * Beware: we can only read the block of a non-floating node.
6181 if (is_irn_pinned_in_irg(node) &&
6182 is_Block_dead(get_nodes_block(skip_Proj(node))))
6185 for (i = 0; i < irn_arity; i++) {
6186 ir_node *pred = get_irn_n(node, i);
6191 /* Propagating Unknowns here seems to be a bad idea, because
6192 sometimes we need a node as a input and did not want that
6194 However, it might be useful to move this into a later phase
6195 (if you think that optimizing such code is useful). */
6196 if (is_Unknown(pred) && mode_is_data(get_irn_mode(node)))
6197 return new_Unknown(get_irn_mode(node));
6202 /* With this code we violate the agreement that local_optimize
6203 only leaves Bads in Block, Phi and Tuple nodes. */
6204 /* If Block has only Bads as predecessors it's garbage. */
6205 /* If Phi has only Bads as predecessors it's garbage. */
6206 if ((op == op_Block && get_Block_matured(node)) || op == op_Phi) {
6207 irn_arity = get_irn_arity(node);
6208 for (i = 0; i < irn_arity; i++) {
6209 if (!is_Bad(get_irn_n(node, i))) break;
6211 if (i == irn_arity) node = new_Bad();
6218 * These optimizations deallocate nodes from the obstack.
6219 * It can only be called if it is guaranteed that no other nodes
6220 * reference this one, i.e., right after construction of a node.
6222 * @param n The node to optimize
6224 * current_ir_graph must be set to the graph of the node!
6226 ir_node *optimize_node(ir_node *n) {
6229 ir_opcode iro = get_irn_opcode(n);
6231 /* Always optimize Phi nodes: part of the construction. */
6232 if ((!get_opt_optimize()) && (iro != iro_Phi)) return n;
6234 /* constant expression evaluation / constant folding */
6235 if (get_opt_constant_folding()) {
6236 /* neither constants nor Tuple values can be evaluated */
6237 if (iro != iro_Const && (get_irn_mode(n) != mode_T)) {
6238 unsigned fp_model = get_irg_fp_model(current_ir_graph);
6239 int old_fp_mode = tarval_enable_fp_ops((fp_model & fp_strict_algebraic) == 0);
6240 /* try to evaluate */
6241 tv = computed_value(n);
6242 if (tv != tarval_bad) {
6244 ir_type *old_tp = get_irn_type(n);
6245 int i, arity = get_irn_arity(n);
6249 * Try to recover the type of the new expression.
6251 for (i = 0; i < arity && !old_tp; ++i)
6252 old_tp = get_irn_type(get_irn_n(n, i));
6255 * we MUST copy the node here temporary, because it's still needed
6256 * for DBG_OPT_CSTEVAL
6258 node_size = offsetof(ir_node, attr) + n->op->attr_size;
6259 oldn = alloca(node_size);
6261 memcpy(oldn, n, node_size);
6262 CLONE_ARR_A(ir_node *, oldn->in, n->in);
6264 /* ARG, copy the in array, we need it for statistics */
6265 memcpy(oldn->in, n->in, ARR_LEN(n->in) * sizeof(n->in[0]));
6267 /* note the inplace edges module */
6268 edges_node_deleted(n, current_ir_graph);
6270 /* evaluation was successful -- replace the node. */
6271 irg_kill_node(current_ir_graph, n);
6272 nw = new_Const(get_tarval_mode(tv), tv);
6274 if (old_tp && get_type_mode(old_tp) == get_tarval_mode(tv))
6275 set_Const_type(nw, old_tp);
6276 DBG_OPT_CSTEVAL(oldn, nw);
6277 tarval_enable_fp_ops(old_fp_mode);
6280 tarval_enable_fp_ops(old_fp_mode);
6284 /* remove unnecessary nodes */
6285 if (get_opt_algebraic_simplification() ||
6286 (iro == iro_Phi) || /* always optimize these nodes. */
6288 (iro == iro_Proj) ||
6289 (iro == iro_Block) ) /* Flags tested local. */
6290 n = equivalent_node(n);
6292 /* Common Subexpression Elimination.
6294 * Checks whether n is already available.
6295 * The block input is used to distinguish different subexpressions. Right
6296 * now all nodes are op_pin_state_pinned to blocks, i.e., the CSE only finds common
6297 * subexpressions within a block.
6300 n = identify_cons(current_ir_graph->value_table, n);
6303 edges_node_deleted(oldn, current_ir_graph);
6305 /* We found an existing, better node, so we can deallocate the old node. */
6306 irg_kill_node(current_ir_graph, oldn);
6310 /* Some more constant expression evaluation that does not allow to
6312 iro = get_irn_opcode(n);
6313 if (get_opt_algebraic_simplification() ||
6314 (iro == iro_Cond) ||
6315 (iro == iro_Proj)) /* Flags tested local. */
6316 n = transform_node(n);
6318 /* Remove nodes with dead (Bad) input.
6319 Run always for transformation induced Bads. */
6322 /* Now we have a legal, useful node. Enter it in hash table for CSE */
6323 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block)) {
6324 n = identify_remember(current_ir_graph->value_table, n);
6328 } /* optimize_node */
6332 * These optimizations never deallocate nodes (in place). This can cause dead
6333 * nodes lying on the obstack. Remove these by a dead node elimination,
6334 * i.e., a copying garbage collection.
6336 ir_node *optimize_in_place_2(ir_node *n) {
6339 ir_opcode iro = get_irn_opcode(n);
6341 if (!get_opt_optimize() && !is_Phi(n)) return n;
6343 /* constant expression evaluation / constant folding */
6344 if (get_opt_constant_folding()) {
6345 /* neither constants nor Tuple values can be evaluated */
6346 if (iro != iro_Const && get_irn_mode(n) != mode_T) {
6347 unsigned fp_model = get_irg_fp_model(current_ir_graph);
6348 int old_fp_mode = tarval_enable_fp_ops((fp_model & fp_strict_algebraic) == 0);
6349 /* try to evaluate */
6350 tv = computed_value(n);
6351 if (tv != tarval_bad) {
6352 /* evaluation was successful -- replace the node. */
6353 ir_type *old_tp = get_irn_type(n);
6354 int i, arity = get_irn_arity(n);
6357 * Try to recover the type of the new expression.
6359 for (i = 0; i < arity && !old_tp; ++i)
6360 old_tp = get_irn_type(get_irn_n(n, i));
6362 n = new_Const(get_tarval_mode(tv), tv);
6364 if (old_tp && get_type_mode(old_tp) == get_tarval_mode(tv))
6365 set_Const_type(n, old_tp);
6367 DBG_OPT_CSTEVAL(oldn, n);
6368 tarval_enable_fp_ops(old_fp_mode);
6371 tarval_enable_fp_ops(old_fp_mode);
6375 /* remove unnecessary nodes */
6376 if (get_opt_constant_folding() ||
6377 (iro == iro_Phi) || /* always optimize these nodes. */
6378 (iro == iro_Id) || /* ... */
6379 (iro == iro_Proj) || /* ... */
6380 (iro == iro_Block) ) /* Flags tested local. */
6381 n = equivalent_node(n);
6383 /** common subexpression elimination **/
6384 /* Checks whether n is already available. */
6385 /* The block input is used to distinguish different subexpressions. Right
6386 now all nodes are op_pin_state_pinned to blocks, i.e., the cse only finds common
6387 subexpressions within a block. */
6388 if (get_opt_cse()) {
6389 n = identify_remember(current_ir_graph->value_table, n);
6392 /* Some more constant expression evaluation. */
6393 iro = get_irn_opcode(n);
6394 if (get_opt_constant_folding() ||
6395 (iro == iro_Cond) ||
6396 (iro == iro_Proj)) /* Flags tested local. */
6397 n = transform_node(n);
6399 /* Remove nodes with dead (Bad) input.
6400 Run always for transformation induced Bads. */
6403 /* Now we can verify the node, as it has no dead inputs any more. */
6406 /* Now we have a legal, useful node. Enter it in hash table for cse.
6407 Blocks should be unique anyways. (Except the successor of start:
6408 is cse with the start block!) */
6409 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block))
6410 n = identify_remember(current_ir_graph->value_table, n);
6413 } /* optimize_in_place_2 */
6416 * Wrapper for external use, set proper status bits after optimization.
6418 ir_node *optimize_in_place(ir_node *n) {
6419 /* Handle graph state */
6420 assert(get_irg_phase_state(current_ir_graph) != phase_building);
6422 if (get_opt_global_cse())
6423 set_irg_pinned(current_ir_graph, op_pin_state_floats);
6424 if (get_irg_outs_state(current_ir_graph) == outs_consistent)
6425 set_irg_outs_inconsistent(current_ir_graph);
6427 /* FIXME: Maybe we could also test whether optimizing the node can
6428 change the control graph. */
6429 set_irg_doms_inconsistent(current_ir_graph);
6430 return optimize_in_place_2(n);
6431 } /* optimize_in_place */
6434 * Calculate a hash value of a Const node.
6436 static unsigned hash_Const(const ir_node *node) {
6439 /* special value for const, as they only differ in their tarval. */
6440 h = HASH_PTR(node->attr.con.tv);
6441 h = 9*h + HASH_PTR(get_irn_mode(node));
6447 * Calculate a hash value of a SymConst node.
6449 static unsigned hash_SymConst(const ir_node *node) {
6452 /* special value for const, as they only differ in their symbol. */
6453 h = HASH_PTR(node->attr.symc.sym.type_p);
6454 h = 9*h + HASH_PTR(get_irn_mode(node));
6457 } /* hash_SymConst */
6460 * Set the default hash operation in an ir_op_ops.
6462 * @param code the opcode for the default operation
6463 * @param ops the operations initialized
6468 static ir_op_ops *firm_set_default_hash(ir_opcode code, ir_op_ops *ops)
6472 ops->hash = hash_##a; \
6475 /* hash function already set */
6476 if (ops->hash != NULL)
6483 /* use input/mode default hash if no function was given */
6484 ops->hash = firm_default_hash;
6492 * Sets the default operation for an ir_ops.
6494 ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops) {
6495 ops = firm_set_default_hash(code, ops);
6496 ops = firm_set_default_computed_value(code, ops);
6497 ops = firm_set_default_equivalent_node(code, ops);
6498 ops = firm_set_default_transform_node(code, ops);
6499 ops = firm_set_default_node_cmp_attr(code, ops);
6500 ops = firm_set_default_get_type(code, ops);
6501 ops = firm_set_default_get_type_attr(code, ops);
6502 ops = firm_set_default_get_entity_attr(code, ops);
6505 } /* firm_set_default_operations */