2 * Copyright (C) 1995-2011 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
31 #include "irgraph_t.h"
32 #include "iredges_t.h"
38 #include "iroptimize.h"
40 #include "dbginfo_t.h"
41 #include "iropt_dbg.h"
50 #include "firm_types.h"
51 #include "bitfiddle.h"
54 #include "firmstat_t.h"
58 static bool is_Or_Eor_Add(const ir_node *node)
60 if (is_Or(node) || is_Eor(node) || is_Add(node)) {
61 ir_node *left = get_binop_left(node);
62 ir_node *right = get_binop_right(node);
63 vrp_attr *vrp_left = vrp_get_info(left);
64 vrp_attr *vrp_right = vrp_get_info(right);
65 if (vrp_left != NULL && vrp_right != NULL) {
67 = tarval_and(vrp_left->bits_not_set, vrp_right->bits_not_set);
68 return tarval_is_null(vrp_val);
75 * Returns the tarval of a Const node or tarval_bad for all other nodes.
77 static ir_tarval *default_value_of(const ir_node *n)
80 return get_Const_tarval(n); /* might return tarval_bad */
85 value_of_func value_of_ptr = default_value_of;
87 void set_value_of_func(value_of_func func)
92 value_of_ptr = default_value_of;
96 * Return the value of a Constant.
98 static ir_tarval *computed_value_Const(const ir_node *n)
100 return get_Const_tarval(n);
104 * Return the value of a 'sizeof', 'alignof' or 'offsetof' SymConst.
106 static ir_tarval *computed_value_SymConst(const ir_node *n)
111 switch (get_SymConst_kind(n)) {
112 case symconst_type_size:
113 type = get_SymConst_type(n);
114 if (get_type_state(type) == layout_fixed)
115 return new_tarval_from_long(get_type_size_bytes(type), get_irn_mode(n));
117 case symconst_type_align:
118 type = get_SymConst_type(n);
119 if (get_type_state(type) == layout_fixed)
120 return new_tarval_from_long(get_type_alignment_bytes(type), get_irn_mode(n));
122 case symconst_ofs_ent:
123 ent = get_SymConst_entity(n);
124 type = get_entity_owner(ent);
125 if (get_type_state(type) == layout_fixed)
126 return new_tarval_from_long(get_entity_offset(ent), get_irn_mode(n));
135 * Return the value of an Add.
137 static ir_tarval *computed_value_Add(const ir_node *n)
139 ir_node *a = get_Add_left(n);
140 ir_node *b = get_Add_right(n);
142 ir_tarval *ta = value_of(a);
143 ir_tarval *tb = value_of(b);
145 if ((ta != tarval_bad) && (tb != tarval_bad))
146 return tarval_add(ta, tb);
149 if ((is_Not(a) && get_Not_op(a) == b)
150 || (is_Not(b) && get_Not_op(b) == a)) {
151 return get_mode_all_one(get_irn_mode(n));
158 * Return the value of a Sub.
159 * Special case: a - a
161 static ir_tarval *computed_value_Sub(const ir_node *n)
163 ir_mode *mode = get_irn_mode(n);
164 ir_node *a = get_Sub_left(n);
165 ir_node *b = get_Sub_right(n);
170 if (! mode_is_float(mode)) {
173 return get_mode_null(mode);
179 if ((ta != tarval_bad) && (tb != tarval_bad))
180 return tarval_sub(ta, tb, mode);
186 * Return the value of a Carry.
187 * Special : a op 0, 0 op b
189 static ir_tarval *computed_value_Carry(const ir_node *n)
191 ir_node *a = get_binop_left(n);
192 ir_node *b = get_binop_right(n);
193 ir_mode *m = get_irn_mode(n);
194 ir_tarval *ta = value_of(a);
195 ir_tarval *tb = value_of(b);
197 if ((ta != tarval_bad) && (tb != tarval_bad)) {
199 return tarval_carry() ? get_mode_one(m) : get_mode_null(m);
201 if (tarval_is_null(ta) || tarval_is_null(tb))
202 return get_mode_null(m);
208 * Return the value of a Borrow.
211 static ir_tarval *computed_value_Borrow(const ir_node *n)
213 ir_node *a = get_binop_left(n);
214 ir_node *b = get_binop_right(n);
215 ir_mode *m = get_irn_mode(n);
216 ir_tarval *ta = value_of(a);
217 ir_tarval *tb = value_of(b);
219 if ((ta != tarval_bad) && (tb != tarval_bad)) {
220 return tarval_cmp(ta, tb) == ir_relation_less ? get_mode_one(m) : get_mode_null(m);
221 } else if (tarval_is_null(ta)) {
222 return get_mode_null(m);
228 * Return the value of an unary Minus.
230 static ir_tarval *computed_value_Minus(const ir_node *n)
232 ir_node *a = get_Minus_op(n);
233 ir_tarval *ta = value_of(a);
235 if (ta != tarval_bad)
236 return tarval_neg(ta);
242 * Return the value of a Mul.
244 static ir_tarval *computed_value_Mul(const ir_node *n)
246 ir_node *a = get_Mul_left(n);
247 ir_node *b = get_Mul_right(n);
248 ir_tarval *ta = value_of(a);
249 ir_tarval *tb = value_of(b);
252 mode = get_irn_mode(n);
253 if (mode != get_irn_mode(a)) {
254 /* n * n = 2n bit multiplication */
255 ta = tarval_convert_to(ta, mode);
256 tb = tarval_convert_to(tb, mode);
259 if (ta != tarval_bad && tb != tarval_bad) {
260 return tarval_mul(ta, tb);
262 /* a * 0 != 0 if a == NaN or a == Inf */
263 if (!mode_is_float(mode)) {
264 /* a*0 = 0 or 0*b = 0 */
265 if (ta == get_mode_null(mode))
267 if (tb == get_mode_null(mode))
275 * Return the value of an And.
276 * Special case: a & 0, 0 & b
278 static ir_tarval *computed_value_And(const ir_node *n)
280 ir_node *a = get_And_left(n);
281 ir_node *b = get_And_right(n);
282 ir_tarval *ta = value_of(a);
283 ir_tarval *tb = value_of(b);
285 if ((ta != tarval_bad) && (tb != tarval_bad)) {
286 return tarval_and (ta, tb);
289 if (tarval_is_null(ta)) return ta;
290 if (tarval_is_null(tb)) return tb;
293 if ((is_Not(a) && get_Not_op(a) == b)
294 || (is_Not(b) && get_Not_op(b) == a)) {
295 return get_mode_null(get_irn_mode(n));
302 * Return the value of an Or.
303 * Special case: a | 1...1, 1...1 | b
305 static ir_tarval *computed_value_Or(const ir_node *n)
307 ir_node *a = get_Or_left(n);
308 ir_node *b = get_Or_right(n);
309 ir_tarval *ta = value_of(a);
310 ir_tarval *tb = value_of(b);
312 if ((ta != tarval_bad) && (tb != tarval_bad)) {
313 return tarval_or (ta, tb);
316 if (tarval_is_all_one(ta)) return ta;
317 if (tarval_is_all_one(tb)) return tb;
320 if ((is_Not(a) && get_Not_op(a) == b)
321 || (is_Not(b) && get_Not_op(b) == a)) {
322 return get_mode_all_one(get_irn_mode(n));
328 * Return the value of an Eor.
330 static ir_tarval *computed_value_Eor(const ir_node *n)
332 ir_node *a = get_Eor_left(n);
333 ir_node *b = get_Eor_right(n);
338 return get_mode_null(get_irn_mode(n));
340 if ((is_Not(a) && get_Not_op(a) == b)
341 || (is_Not(b) && get_Not_op(b) == a)) {
342 return get_mode_all_one(get_irn_mode(n));
348 if ((ta != tarval_bad) && (tb != tarval_bad)) {
349 return tarval_eor(ta, tb);
355 * Return the value of a Not.
357 static ir_tarval *computed_value_Not(const ir_node *n)
359 ir_node *a = get_Not_op(n);
360 ir_tarval *ta = value_of(a);
362 if (ta != tarval_bad)
363 return tarval_not(ta);
369 * Tests whether a shift shifts more bits than available in the mode
371 static bool is_oversize_shift(const ir_node *n)
373 ir_node *count = get_binop_right(n);
374 ir_mode *mode = get_irn_mode(n);
375 ir_tarval *tv = value_of(count);
378 if (tv == tarval_bad)
380 if (!tarval_is_long(tv))
382 shiftval = get_tarval_long(tv);
383 modulo_shift = get_mode_modulo_shift(mode);
384 if (shiftval < 0 || (modulo_shift > 0 && shiftval >= modulo_shift))
387 return shiftval >= (long)get_mode_size_bits(mode);
391 * Return the value of a Shl.
393 static ir_tarval *computed_value_Shl(const ir_node *n)
395 ir_node *a = get_Shl_left(n);
396 ir_node *b = get_Shl_right(n);
398 ir_tarval *ta = value_of(a);
399 ir_tarval *tb = value_of(b);
401 if ((ta != tarval_bad) && (tb != tarval_bad)) {
402 return tarval_shl(ta, tb);
405 if (is_oversize_shift(n))
406 return get_mode_null(get_irn_mode(n));
412 * Return the value of a Shr.
414 static ir_tarval *computed_value_Shr(const ir_node *n)
416 ir_node *a = get_Shr_left(n);
417 ir_node *b = get_Shr_right(n);
419 ir_tarval *ta = value_of(a);
420 ir_tarval *tb = value_of(b);
422 if ((ta != tarval_bad) && (tb != tarval_bad)) {
423 return tarval_shr(ta, tb);
425 if (is_oversize_shift(n))
426 return get_mode_null(get_irn_mode(n));
432 * Return the value of a Shrs.
434 static ir_tarval *computed_value_Shrs(const ir_node *n)
436 ir_node *a = get_Shrs_left(n);
437 ir_node *b = get_Shrs_right(n);
439 ir_tarval *ta = value_of(a);
440 ir_tarval *tb = value_of(b);
442 if ((ta != tarval_bad) && (tb != tarval_bad)) {
443 return tarval_shrs(ta, tb);
449 * Return the value of a Rotl.
451 static ir_tarval *computed_value_Rotl(const ir_node *n)
453 ir_node *a = get_Rotl_left(n);
454 ir_node *b = get_Rotl_right(n);
456 ir_tarval *ta = value_of(a);
457 ir_tarval *tb = value_of(b);
459 if ((ta != tarval_bad) && (tb != tarval_bad)) {
460 return tarval_rotl(ta, tb);
465 bool ir_zero_when_converted(const ir_node *node, ir_mode *dest_mode)
467 ir_mode *mode = get_irn_mode(node);
468 if (get_mode_arithmetic(mode) != irma_twos_complement
469 || get_mode_arithmetic(dest_mode) != irma_twos_complement)
473 ir_node *count = get_Shl_right(node);
474 if (is_Const(count)) {
475 ir_tarval *tv = get_Const_tarval(count);
476 if (tarval_is_long(tv)) {
477 long shiftval = get_tarval_long(tv);
478 long destbits = get_mode_size_bits(dest_mode);
479 if (shiftval >= destbits
480 && shiftval < (long)get_mode_modulo_shift(mode))
486 ir_node *right = get_And_right(node);
487 if (is_Const(right)) {
488 ir_tarval *tv = get_Const_tarval(right);
489 ir_tarval *conved = tarval_convert_to(tv, dest_mode);
490 return tarval_is_null(conved);
497 * Return the value of a Conv.
499 static ir_tarval *computed_value_Conv(const ir_node *n)
501 ir_node *a = get_Conv_op(n);
502 ir_tarval *ta = value_of(a);
503 ir_mode *mode = get_irn_mode(n);
505 if (ta != tarval_bad)
506 return tarval_convert_to(ta, get_irn_mode(n));
508 if (ir_zero_when_converted(a, mode))
509 return get_mode_null(mode);
515 * Calculate the value of a Mux: can be evaluated, if the
516 * sel and the right input are known.
518 static ir_tarval *computed_value_Mux(const ir_node *n)
520 ir_node *sel = get_Mux_sel(n);
521 ir_tarval *ts = value_of(sel);
523 if (ts == get_tarval_b_true()) {
524 ir_node *v = get_Mux_true(n);
527 else if (ts == get_tarval_b_false()) {
528 ir_node *v = get_Mux_false(n);
535 * Calculate the value of a Confirm: can be evaluated,
536 * if it has the form Confirm(x, '=', Const).
538 static ir_tarval *computed_value_Confirm(const ir_node *n)
540 if (get_Confirm_relation(n) == ir_relation_equal) {
541 ir_tarval *tv = value_of(get_Confirm_bound(n));
542 if (tv != tarval_bad)
545 return value_of(get_Confirm_value(n));
549 * gives a (conservative) estimation of possible relation when comparing
552 ir_relation ir_get_possible_cmp_relations(const ir_node *left,
553 const ir_node *right)
555 ir_relation possible = ir_relation_true;
556 ir_tarval *tv_l = value_of(left);
557 ir_tarval *tv_r = value_of(right);
558 ir_mode *mode = get_irn_mode(left);
559 ir_tarval *min = mode == mode_b ? tarval_b_false : get_mode_min(mode);
560 ir_tarval *max = mode == mode_b ? tarval_b_true : get_mode_max(mode);
562 /* both values known - evaluate them */
563 if ((tv_l != tarval_bad) && (tv_r != tarval_bad)) {
564 possible = tarval_cmp(tv_l, tv_r);
565 /* we can return now, won't get any better */
568 /* a == a is never less or greater (but might be equal or unordered) */
570 possible &= ~ir_relation_less_greater;
571 /* unordered results only happen for float compares */
572 if (!mode_is_float(mode))
573 possible &= ~ir_relation_unordered;
574 /* values can never be less than the least representable number or
575 * greater than the greatest representable number */
577 possible &= ~ir_relation_greater;
579 possible &= ~ir_relation_less;
581 possible &= ~ir_relation_greater;
583 possible &= ~ir_relation_less;
584 /* maybe vrp can tell us more */
585 possible &= vrp_cmp(left, right);
586 /* Alloc nodes never return null (but throw an exception) */
587 if (is_Alloc(left) && tarval_is_null(tv_r))
588 possible &= ~ir_relation_equal;
589 /* stuff known through confirm nodes */
590 if (is_Confirm(left) && get_Confirm_bound(left) == right) {
591 possible &= get_Confirm_relation(left);
593 if (is_Confirm(right) && get_Confirm_bound(right) == left) {
594 ir_relation relation = get_Confirm_relation(right);
595 relation = get_inversed_relation(relation);
596 possible &= relation;
602 static ir_tarval *compute_cmp(const ir_node *cmp)
604 ir_node *left = get_Cmp_left(cmp);
605 ir_node *right = get_Cmp_right(cmp);
606 ir_relation possible = ir_get_possible_cmp_relations(left, right);
607 ir_relation relation = get_Cmp_relation(cmp);
609 /* if none of the requested relations is possible, return false */
610 if ((possible & relation) == ir_relation_false)
611 return tarval_b_false;
612 /* if possible relations are a subset of the requested ones return true */
613 if ((possible & ~relation) == ir_relation_false)
614 return tarval_b_true;
616 return computed_value_Cmp_Confirm(cmp, left, right, relation);
620 * some people want to call compute_cmp directly, in this case we have to
621 * test the constant folding flag again
623 static ir_tarval *compute_cmp_ext(const ir_node *cmp)
625 if (!get_opt_constant_folding())
627 return compute_cmp(cmp);
631 * Return the value of a Cmp.
633 * The basic idea here is to determine which relations are possible and which
634 * one are definitely impossible.
636 static ir_tarval *computed_value_Cmp(const ir_node *cmp)
638 /* we can't construct Constb after lowering mode_b nodes */
639 if (irg_is_constrained(get_irn_irg(cmp), IR_GRAPH_CONSTRAINT_MODEB_LOWERED))
642 return compute_cmp(cmp);
646 * Calculate the value of an integer Div.
647 * Special case: 0 / b
649 static ir_tarval *do_computed_value_Div(const ir_node *div)
651 const ir_node *a = get_Div_left(div);
652 const ir_node *b = get_Div_right(div);
653 const ir_mode *mode = get_Div_resmode(div);
654 ir_tarval *ta = value_of(a);
656 const ir_node *dummy;
658 /* cannot optimize 0 / b = 0 because of NaN */
659 if (!mode_is_float(mode)) {
660 if (tarval_is_null(ta) && value_not_zero(b, &dummy))
661 return ta; /* 0 / b == 0 if b != 0 */
664 if (ta != tarval_bad && tb != tarval_bad)
665 return tarval_div(ta, tb);
670 * Calculate the value of an integer Mod of two nodes.
671 * Special case: a % 1
673 static ir_tarval *do_computed_value_Mod(const ir_node *a, const ir_node *b)
675 ir_tarval *ta = value_of(a);
676 ir_tarval *tb = value_of(b);
678 /* Compute a % 1 or c1 % c2 */
679 if (tarval_is_one(tb))
680 return get_mode_null(get_irn_mode(a));
681 if (ta != tarval_bad && tb != tarval_bad)
682 return tarval_mod(ta, tb);
687 * Return the value of a Proj(Div).
689 static ir_tarval *computed_value_Proj_Div(const ir_node *n)
691 long proj_nr = get_Proj_proj(n);
692 if (proj_nr != pn_Div_res)
695 return do_computed_value_Div(get_Proj_pred(n));
699 * Return the value of a Proj(Mod).
701 static ir_tarval *computed_value_Proj_Mod(const ir_node *n)
703 long proj_nr = get_Proj_proj(n);
705 if (proj_nr == pn_Mod_res) {
706 const ir_node *mod = get_Proj_pred(n);
707 return do_computed_value_Mod(get_Mod_left(mod), get_Mod_right(mod));
713 * Return the value of a Proj.
715 static ir_tarval *computed_value_Proj(const ir_node *proj)
717 ir_node *n = get_Proj_pred(proj);
719 if (n->op->ops.computed_value_Proj != NULL)
720 return n->op->ops.computed_value_Proj(proj);
725 * If the parameter n can be computed, return its value, else tarval_bad.
726 * Performs constant folding.
728 * @param n The node this should be evaluated
730 ir_tarval *computed_value(const ir_node *n)
732 vrp_attr *vrp = vrp_get_info(n);
733 if (vrp != NULL && vrp->bits_set == vrp->bits_not_set)
734 return vrp->bits_set;
736 if (n->op->ops.computed_value)
737 return n->op->ops.computed_value(n);
742 * Optimize operations that are commutative and have neutral 0,
743 * so a op 0 = 0 op a = a.
745 static ir_node *equivalent_node_neutral_zero(ir_node *n)
749 ir_node *a = get_binop_left(n);
750 ir_node *b = get_binop_right(n);
755 /* After running compute_node there is only one constant predecessor.
756 Find this predecessors value and remember the other node: */
757 if ((tv = value_of(a)) != tarval_bad) {
759 } else if ((tv = value_of(b)) != tarval_bad) {
764 /* If this predecessors constant value is zero, the operation is
765 * unnecessary. Remove it.
767 * Beware: If n is a Add, the mode of on and n might be different
768 * which happens in this rare construction: NULL + 3.
769 * Then, a Conv would be needed which we cannot include here.
771 if (tarval_is_null(tv) && get_irn_mode(on) == get_irn_mode(n)) {
774 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
781 * Eor is commutative and has neutral 0.
783 static ir_node *equivalent_node_Eor(ir_node *n)
789 n = equivalent_node_neutral_zero(n);
790 if (n != oldn) return n;
793 b = get_Eor_right(n);
795 if (is_Eor(a) || is_Or_Eor_Add(a)) {
796 ir_node *aa = get_binop_left(a);
797 ir_node *ab = get_binop_right(a);
800 /* (a ^ b) ^ a -> b */
802 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
804 } else if (ab == b) {
805 /* (a ^ b) ^ b -> a */
807 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
811 if (is_Eor(b) || is_Or_Eor_Add(b)) {
812 ir_node *ba = get_binop_left(b);
813 ir_node *bb = get_binop_right(b);
816 /* a ^ (a ^ b) -> b */
818 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
820 } else if (bb == a) {
821 /* a ^ (b ^ a) -> b */
823 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
831 * Optimize a - 0 and (a - x) + x (for modes with wrap-around).
833 * The second one looks strange, but this construct
834 * is used heavily in the LCC sources :-).
836 * Beware: The Mode of an Add may be different than the mode of its
837 * predecessors, so we could not return a predecessors in all cases.
839 static ir_node *equivalent_node_Add(ir_node *n)
842 ir_node *left, *right;
843 ir_mode *mode = get_irn_mode(n);
845 n = equivalent_node_neutral_zero(n);
849 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
850 if (mode_is_float(mode)) {
851 ir_graph *irg = get_irn_irg(n);
852 if (get_irg_fp_model(irg) & fp_strict_algebraic)
856 left = get_Add_left(n);
857 right = get_Add_right(n);
860 if (get_Sub_right(left) == right) {
863 n = get_Sub_left(left);
864 if (mode == get_irn_mode(n)) {
865 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
871 if (get_Sub_right(right) == left) {
874 n = get_Sub_left(right);
875 if (mode == get_irn_mode(n)) {
876 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
885 * optimize operations that are not commutative but have neutral 0 on left,
888 static ir_node *equivalent_node_left_zero(ir_node *n)
892 ir_node *a = get_binop_left(n);
893 ir_node *b = get_binop_right(n);
894 ir_tarval *tb = value_of(b);
896 if (tarval_is_null(tb)) {
899 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
905 * Optimize a - 0 and (a + x) - x (for modes with wrap-around).
907 * The second one looks strange, but this construct
908 * is used heavily in the LCC sources :-).
910 * Beware: The Mode of a Sub may be different than the mode of its
911 * predecessors, so we could not return a predecessors in all cases.
913 static ir_node *equivalent_node_Sub(ir_node *n)
917 ir_mode *mode = get_irn_mode(n);
920 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
921 if (mode_is_float(mode)) {
922 ir_graph *irg = get_irn_irg(n);
923 if (get_irg_fp_model(irg) & fp_strict_algebraic)
927 b = get_Sub_right(n);
930 /* Beware: modes might be different */
931 if (tarval_is_null(tb)) {
932 ir_node *a = get_Sub_left(n);
933 if (mode == get_irn_mode(a)) {
936 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
944 * Optimize an "self-inverse unary op", i.e. op(op(n)) = n.
947 * -(-a) == a, but might overflow two times.
948 * We handle it anyway here but the better way would be a
949 * flag. This would be needed for Pascal for instance.
951 static ir_node *equivalent_node_involution(ir_node *n)
954 ir_node *pred = get_unop_op(n);
955 if (get_irn_op(pred) == get_irn_op(n)) {
956 n = get_unop_op(pred);
957 DBG_OPT_ALGSIM2(oldn, pred, n, FS_OPT_INVOLUTION);
963 * Optimize a * 1 = 1 * a = a.
965 static ir_node *equivalent_node_Mul(ir_node *n)
968 ir_node *a = get_Mul_left(n);
970 /* we can handle here only the n * n = n bit cases */
971 if (get_irn_mode(n) == get_irn_mode(a)) {
972 ir_node *b = get_Mul_right(n);
976 * Mul is commutative and has again an other neutral element.
977 * Constants are place right, so check this case first.
980 if (tarval_is_one(tv)) {
982 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
985 if (tarval_is_one(tv)) {
987 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
995 * Use algebraic simplification a | a = a | 0 = 0 | a = a.
997 static ir_node *equivalent_node_Or(ir_node *n)
1001 ir_node *a = get_Or_left(n);
1002 ir_node *b = get_Or_right(n);
1006 n = a; /* idempotence */
1007 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_OR);
1010 /* constants are normalized to right, check this side first */
1012 if (tarval_is_null(tv)) {
1014 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1018 if (tarval_is_null(tv)) {
1020 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1028 * Optimize a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a.
1030 static ir_node *equivalent_node_And(ir_node *n)
1034 ir_node *a = get_And_left(n);
1035 ir_node *b = get_And_right(n);
1039 n = a; /* idempotence */
1040 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_AND);
1043 /* constants are normalized to right, check this side first */
1045 if (tarval_is_all_one(tv)) {
1047 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1050 if (tv != get_tarval_bad()) {
1051 ir_mode *mode = get_irn_mode(n);
1052 if (!mode_is_signed(mode) && is_Conv(a)) {
1053 ir_node *convop = get_Conv_op(a);
1054 ir_mode *convopmode = get_irn_mode(convop);
1055 if (!mode_is_signed(convopmode)) {
1056 /* Check Conv(all_one) & Const = all_one */
1057 ir_tarval *one = get_mode_all_one(convopmode);
1058 ir_tarval *conv = tarval_convert_to(one, mode);
1059 ir_tarval *tand = tarval_and(conv, tv);
1061 if (tarval_is_all_one(tand)) {
1062 /* Conv(X) & Const = X */
1064 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1071 if (tarval_is_all_one(tv)) {
1073 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1077 if ((is_Or(a) || is_Or_Eor_Add(a))
1078 && (b == get_binop_left(a) || b == get_binop_right(a))) {
1080 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1084 if ((is_Or(b) || is_Or_Eor_Add(b))
1085 && (a == get_binop_left(b) || a == get_binop_right(b))) {
1087 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1094 * Try to remove useless Conv's:
1096 static ir_node *equivalent_node_Conv(ir_node *n)
1099 ir_node *a = get_Conv_op(n);
1101 ir_mode *n_mode = get_irn_mode(n);
1102 ir_mode *a_mode = get_irn_mode(a);
1104 if (n_mode == a_mode) { /* No Conv necessary */
1106 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1108 } else if (is_Conv(a)) { /* Conv(Conv(b)) */
1109 ir_node *b = get_Conv_op(a);
1110 ir_mode *b_mode = get_irn_mode(b);
1112 if (n_mode == b_mode && values_in_mode(b_mode, a_mode)) {
1114 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1122 * - fold Phi-nodes, iff they have only one predecessor except
1125 static ir_node *equivalent_node_Phi(ir_node *n)
1130 ir_node *first_val = NULL; /* to shutup gcc */
1132 if (!get_opt_optimize() &&
1133 !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION))
1136 n_preds = get_Phi_n_preds(n);
1138 /* Phi of dead Region without predecessors. */
1142 /* Find first non-self-referencing input */
1143 for (i = 0; i < n_preds; ++i) {
1144 first_val = get_Phi_pred(n, i);
1145 /* not self pointer */
1146 if (first_val != n) {
1147 /* then found first value. */
1152 /* search for rest of inputs, determine if any of these
1153 are non-self-referencing */
1154 while (++i < n_preds) {
1155 ir_node *scnd_val = get_Phi_pred(n, i);
1156 if (scnd_val != n && scnd_val != first_val) {
1161 if (i >= n_preds && !is_Dummy(first_val)) {
1162 /* Fold, if no multiple distinct non-self-referencing inputs */
1164 DBG_OPT_PHI(oldn, n);
1170 * Optimize Proj(Tuple).
1172 static ir_node *equivalent_node_Proj_Tuple(ir_node *proj)
1174 ir_node *oldn = proj;
1175 ir_node *tuple = get_Proj_pred(proj);
1177 /* Remove the Tuple/Proj combination. */
1178 proj = get_Tuple_pred(tuple, get_Proj_proj(proj));
1179 DBG_OPT_TUPLE(oldn, tuple, proj);
1185 * Optimize a / 1 = a.
1187 static ir_node *equivalent_node_Proj_Div(ir_node *proj)
1189 ir_node *oldn = proj;
1190 ir_node *div = get_Proj_pred(proj);
1191 ir_node *b = get_Div_right(div);
1192 ir_tarval *tb = value_of(b);
1194 /* Div is not commutative. */
1195 if (tarval_is_one(tb)) { /* div(x, 1) == x */
1196 switch (get_Proj_proj(proj)) {
1198 proj = get_Div_mem(div);
1199 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1203 proj = get_Div_left(div);
1204 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1208 /* we cannot replace the exception Proj's here, this is done in
1209 transform_node_Proj_Div() */
1217 * Optimize CopyB(mem, x, x) into a Nop.
1219 static ir_node *equivalent_node_Proj_CopyB(ir_node *proj)
1221 ir_node *oldn = proj;
1222 ir_node *copyb = get_Proj_pred(proj);
1223 ir_node *a = get_CopyB_dst(copyb);
1224 ir_node *b = get_CopyB_src(copyb);
1227 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
1228 switch (get_Proj_proj(proj)) {
1230 proj = get_CopyB_mem(copyb);
1231 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
1239 * Optimize Bounds(idx, idx, upper) into idx.
1241 static ir_node *equivalent_node_Proj_Bound(ir_node *proj)
1243 ir_node *oldn = proj;
1244 ir_node *bound = get_Proj_pred(proj);
1245 ir_node *idx = get_Bound_index(bound);
1246 ir_node *pred = skip_Proj(idx);
1249 if (idx == get_Bound_lower(bound))
1251 else if (is_Bound(pred)) {
1253 * idx was Bounds checked previously, it is still valid if
1254 * lower <= pred_lower && pred_upper <= upper.
1256 ir_node *lower = get_Bound_lower(bound);
1257 ir_node *upper = get_Bound_upper(bound);
1258 if (get_Bound_lower(pred) == lower &&
1259 get_Bound_upper(pred) == upper) {
1261 * One could expect that we simply return the previous
1262 * Bound here. However, this would be wrong, as we could
1263 * add an exception Proj to a new location then.
1264 * So, we must turn in into a tuple.
1270 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
1271 switch (get_Proj_proj(proj)) {
1273 DBG_OPT_EXC_REM(proj);
1274 proj = get_Bound_mem(bound);
1278 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
1281 /* cannot optimize pn_Bound_X_regular, handled in transform ... */
1289 * Does all optimizations on nodes that must be done on its Projs
1290 * because of creating new nodes.
1292 static ir_node *equivalent_node_Proj(ir_node *proj)
1294 ir_node *n = get_Proj_pred(proj);
1295 if (n->op->ops.equivalent_node_Proj)
1296 return n->op->ops.equivalent_node_Proj(proj);
1303 static ir_node *equivalent_node_Id(ir_node *n)
1311 DBG_OPT_ID(oldn, n);
1318 static ir_node *equivalent_node_Mux(ir_node *n)
1320 ir_node *oldn = n, *sel = get_Mux_sel(n);
1322 ir_tarval *ts = value_of(sel);
1324 if (ts == tarval_bad && is_Cmp(sel)) {
1325 /* try again with a direct call to compute_cmp, as we don't care
1326 * about the MODEB_LOWERED flag here */
1327 ts = compute_cmp_ext(sel);
1330 /* Mux(true, f, t) == t */
1331 if (ts == tarval_b_true) {
1332 n = get_Mux_true(n);
1333 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1336 /* Mux(false, f, t) == f */
1337 if (ts == tarval_b_false) {
1338 n = get_Mux_false(n);
1339 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1342 n_t = get_Mux_true(n);
1343 n_f = get_Mux_false(n);
1345 /* Mux(v, x, T) == x */
1346 if (is_Unknown(n_f)) {
1348 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1351 /* Mux(v, T, x) == x */
1352 if (is_Unknown(n_t)) {
1354 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1358 /* Mux(v, x, x) == x */
1361 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1364 if (is_Cmp(sel) && !mode_honor_signed_zeros(get_irn_mode(n))) {
1365 ir_relation relation = get_Cmp_relation(sel);
1366 ir_node *f = get_Mux_false(n);
1367 ir_node *t = get_Mux_true(n);
1370 * Note further that these optimization work even for floating point
1371 * with NaN's because -NaN == NaN.
1372 * However, if +0 and -0 is handled differently, we cannot use the first one.
1374 ir_node *const cmp_l = get_Cmp_left(sel);
1375 ir_node *const cmp_r = get_Cmp_right(sel);
1378 case ir_relation_equal:
1379 if ((cmp_l == t && cmp_r == f) || /* Mux(t == f, t, f) -> f */
1380 (cmp_l == f && cmp_r == t)) { /* Mux(f == t, t, f) -> f */
1382 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1387 case ir_relation_less_greater:
1388 case ir_relation_unordered_less_greater:
1389 if ((cmp_l == t && cmp_r == f) || /* Mux(t != f, t, f) -> t */
1390 (cmp_l == f && cmp_r == t)) { /* Mux(f != t, t, f) -> t */
1392 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1401 * Note: normalization puts the constant on the right side,
1402 * so we check only one case.
1404 if (cmp_l == t && tarval_is_null(value_of(cmp_r))) {
1405 /* Mux(t CMP 0, X, t) */
1406 if (is_Minus(f) && get_Minus_op(f) == t) {
1407 /* Mux(t CMP 0, -t, t) */
1408 if (relation == ir_relation_equal) {
1409 /* Mux(t == 0, -t, t) ==> -t */
1411 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1412 } else if (relation == ir_relation_less_greater || relation == ir_relation_unordered_less_greater) {
1413 /* Mux(t != 0, -t, t) ==> t */
1415 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1425 * Remove Confirm nodes if setting is on.
1426 * Replace Confirms(x, '=', Constlike) by Constlike.
1428 static ir_node *equivalent_node_Confirm(ir_node *n)
1430 ir_node *pred = get_Confirm_value(n);
1431 ir_relation relation = get_Confirm_relation(n);
1433 while (is_Confirm(pred) && relation == get_Confirm_relation(pred)) {
1435 * rare case: two identical Confirms one after another,
1436 * replace the second one with the first.
1439 pred = get_Confirm_value(n);
1445 * equivalent_node() returns a node equivalent to input n. It skips all nodes that
1446 * perform no actual computation, as, e.g., the Id nodes. It does not create
1447 * new nodes. It is therefore safe to free n if the node returned is not n.
1448 * If a node returns a Tuple we can not just skip it. If the size of the
1449 * in array fits, we transform n into a tuple (e.g., Div).
1451 ir_node *equivalent_node(ir_node *n)
1453 if (n->op->ops.equivalent_node)
1454 return n->op->ops.equivalent_node(n);
1459 * Returns non-zero if a node is a Phi node
1460 * with all predecessors constant.
1462 static int is_const_Phi(ir_node *n)
1466 if (! is_Phi(n) || get_irn_arity(n) == 0)
1468 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1469 if (! is_Const(get_irn_n(n, i)))
1475 typedef ir_tarval *(*tarval_sub_type)(ir_tarval *a, ir_tarval *b, ir_mode *mode);
1476 typedef ir_tarval *(*tarval_binop_type)(ir_tarval *a, ir_tarval *b);
1479 * in reality eval_func should be tarval (*eval_func)() but incomplete
1480 * declarations are bad style and generate noisy warnings
1482 typedef void (*eval_func)(void);
1485 * Wrapper for the tarval binop evaluation, tarval_sub has one more parameter.
1487 static ir_tarval *do_eval(eval_func eval, ir_tarval *a, ir_tarval *b, ir_mode *mode)
1489 if (eval == (eval_func) tarval_sub) {
1490 tarval_sub_type func = (tarval_sub_type)eval;
1492 return func(a, b, mode);
1494 tarval_binop_type func = (tarval_binop_type)eval;
1501 * Apply an evaluator on a binop with a constant operators (and one Phi).
1503 * @param phi the Phi node
1504 * @param other the other operand
1505 * @param eval an evaluator function
1506 * @param mode the mode of the result, may be different from the mode of the Phi!
1507 * @param left if non-zero, other is the left operand, else the right
1509 * @return a new Phi node if the conversion was successful, NULL else
1511 static ir_node *apply_binop_on_phi(ir_node *phi, ir_tarval *other, eval_func eval, ir_mode *mode, int left)
1513 int n = get_irn_arity(phi);
1514 ir_tarval **tvs = ALLOCAN(ir_tarval*, n);
1516 for (int i = 0; i < n; ++i) {
1517 ir_node *pred = get_irn_n(phi, i);
1518 ir_tarval *tv = get_Const_tarval(pred);
1519 tv = do_eval(eval, other, tv, mode);
1521 if (tv == tarval_bad) {
1522 /* folding failed, bad */
1528 for (int i = 0; i < n; ++i) {
1529 ir_node *pred = get_irn_n(phi, i);
1530 ir_tarval *tv = get_Const_tarval(pred);
1531 tv = do_eval(eval, tv, other, mode);
1533 if (tv == tarval_bad) {
1534 /* folding failed, bad */
1540 ir_graph *irg = get_irn_irg(phi);
1541 ir_node **res = ALLOCAN(ir_node*, n);
1542 for (int i = 0; i < n; ++i) {
1543 res[i] = new_r_Const(irg, tvs[i]);
1545 ir_node *block = get_nodes_block(phi);
1546 return new_r_Phi(block, n, res, mode);
1550 * Apply an evaluator on a binop with two constant Phi.
1552 * @param a the left Phi node
1553 * @param b the right Phi node
1554 * @param eval an evaluator function
1555 * @param mode the mode of the result, may be different from the mode of the Phi!
1557 * @return a new Phi node if the conversion was successful, NULL else
1559 static ir_node *apply_binop_on_2_phis(ir_node *a, ir_node *b, eval_func eval, ir_mode *mode)
1561 if (get_nodes_block(a) != get_nodes_block(b))
1564 int n = get_irn_arity(a);
1565 ir_tarval **tvs = ALLOCAN(ir_tarval*, n);
1566 for (int i = 0; i < n; ++i) {
1567 ir_node *pred_a = get_irn_n(a, i);
1568 ir_tarval *tv_l = get_Const_tarval(pred_a);
1569 ir_node *pred_b = get_irn_n(b, i);
1570 ir_tarval *tv_r = get_Const_tarval(pred_b);
1571 ir_tarval *tv = do_eval(eval, tv_l, tv_r, mode);
1573 if (tv == tarval_bad) {
1574 /* folding failed, bad */
1579 ir_graph *irg = get_irn_irg(a);
1580 ir_node **res = ALLOCAN(ir_node*, n);
1581 for (int i = 0; i < n; ++i) {
1582 res[i] = new_r_Const(irg, tvs[i]);
1584 ir_node *block = get_nodes_block(a);
1585 return new_r_Phi(block, n, res, mode);
1589 * Apply an evaluator on a unop with a constant operator (a Phi).
1591 * @param phi the Phi node
1592 * @param eval an evaluator function
1594 * @return a new Phi node if the conversion was successful, NULL else
1596 static ir_node *apply_unop_on_phi(ir_node *phi, ir_tarval *(*eval)(ir_tarval *))
1598 int n = get_irn_arity(phi);
1599 ir_tarval **tvs = ALLOCAN(ir_tarval*, n);
1600 for (int i = 0; i < n; ++i) {
1601 ir_node *pred = get_irn_n(phi, i);
1602 ir_tarval *tv = get_Const_tarval(pred);
1605 if (tv == tarval_bad) {
1606 /* folding failed, bad */
1611 ir_graph *irg = get_irn_irg(phi);
1612 ir_node **res = ALLOCAN(ir_node*, n);
1613 for (int i = 0; i < n; ++i) {
1614 res[i] = new_r_Const(irg, tvs[i]);
1616 ir_node *block = get_nodes_block(phi);
1617 ir_mode *mode = get_irn_mode(phi);
1618 return new_r_Phi(block, n, res, mode);
1622 * Apply a conversion on a constant operator (a Phi).
1624 * @param phi the Phi node
1626 * @return a new Phi node if the conversion was successful, NULL else
1628 static ir_node *apply_conv_on_phi(ir_node *phi, ir_mode *mode)
1630 int n = get_irn_arity(phi);
1631 ir_tarval **tvs = ALLOCAN(ir_tarval*, n);
1632 for (int i = 0; i < n; ++i) {
1633 ir_node *pred = get_irn_n(phi, i);
1634 ir_tarval *tv = get_Const_tarval(pred);
1635 tv = tarval_convert_to(tv, mode);
1637 if (tv == tarval_bad) {
1638 /* folding failed, bad */
1643 ir_graph *irg = get_irn_irg(phi);
1644 ir_node **res = ALLOCAN(ir_node*, n);
1645 for (int i = 0; i < n; ++i) {
1646 res[i] = new_r_Const(irg, tvs[i]);
1648 ir_node *block = get_nodes_block(phi);
1649 return new_r_Phi(block, n, res, mode);
1653 * Transform AddP(P, ConvIs(Iu)), AddP(P, ConvIu(Is)) and
1654 * SubP(P, ConvIs(Iu)), SubP(P, ConvIu(Is)).
1655 * If possible, remove the Conv's.
1657 static ir_node *transform_node_AddSub(ir_node *n)
1659 ir_mode *mode = get_irn_mode(n);
1661 if (mode_is_reference(mode)) {
1662 ir_node *left = get_binop_left(n);
1663 ir_node *right = get_binop_right(n);
1664 unsigned ref_bits = get_mode_size_bits(mode);
1666 if (is_Conv(left)) {
1667 ir_mode *lmode = get_irn_mode(left);
1668 unsigned bits = get_mode_size_bits(lmode);
1670 if (ref_bits == bits &&
1671 mode_is_int(lmode) &&
1672 get_mode_arithmetic(lmode) == irma_twos_complement) {
1673 ir_node *pre = get_Conv_op(left);
1674 ir_mode *pre_mode = get_irn_mode(pre);
1676 if (mode_is_int(pre_mode) &&
1677 get_mode_size_bits(pre_mode) == bits &&
1678 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
1679 /* ok, this conv just changes to sign, moreover the calculation
1680 * is done with same number of bits as our address mode, so
1681 * we can ignore the conv as address calculation can be viewed
1682 * as either signed or unsigned
1684 set_binop_left(n, pre);
1689 if (is_Conv(right)) {
1690 ir_mode *rmode = get_irn_mode(right);
1691 unsigned bits = get_mode_size_bits(rmode);
1693 if (ref_bits == bits &&
1694 mode_is_int(rmode) &&
1695 get_mode_arithmetic(rmode) == irma_twos_complement) {
1696 ir_node *pre = get_Conv_op(right);
1697 ir_mode *pre_mode = get_irn_mode(pre);
1699 if (mode_is_int(pre_mode) &&
1700 get_mode_size_bits(pre_mode) == bits &&
1701 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
1702 /* ok, this conv just changes to sign, moreover the calculation
1703 * is done with same number of bits as our address mode, so
1704 * we can ignore the conv as address calculation can be viewed
1705 * as either signed or unsigned
1707 set_binop_right(n, pre);
1712 /* let address arithmetic use unsigned modes */
1713 if (is_Const(right)) {
1714 ir_mode *rmode = get_irn_mode(right);
1716 if (mode_is_signed(rmode) && get_mode_arithmetic(rmode) == irma_twos_complement) {
1717 /* convert a AddP(P, *s) into AddP(P, *u) */
1718 ir_mode *nm = get_reference_mode_unsigned_eq(mode);
1720 ir_node *pre = new_r_Conv(get_nodes_block(n), right, nm);
1721 set_binop_right(n, pre);
1729 #define HANDLE_BINOP_PHI(eval, a, b, c, mode) \
1732 if (is_Const(b) && is_const_Phi(a)) { \
1733 /* check for Op(Phi, Const) */ \
1734 c = apply_binop_on_phi(a, get_Const_tarval(b), eval, mode, 0);\
1736 else if (is_Const(a) && is_const_Phi(b)) { \
1737 /* check for Op(Const, Phi) */ \
1738 c = apply_binop_on_phi(b, get_Const_tarval(a), eval, mode, 1);\
1740 else if (is_const_Phi(a) && is_const_Phi(b)) { \
1741 /* check for Op(Phi, Phi) */ \
1742 c = apply_binop_on_2_phis(a, b, eval, mode); \
1745 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
1750 #define HANDLE_UNOP_PHI(eval, a, c) \
1753 if (is_const_Phi(a)) { \
1754 /* check for Op(Phi) */ \
1755 c = apply_unop_on_phi(a, eval); \
1757 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
1764 * Create a 0 constant of given mode.
1766 static ir_node *create_zero_const(ir_graph *irg, ir_mode *mode)
1768 ir_tarval *tv = get_mode_null(mode);
1769 ir_node *cnst = new_r_Const(irg, tv);
1774 static bool is_shiftop(const ir_node *n)
1776 return is_Shl(n) || is_Shr(n) || is_Shrs(n) || is_Rotl(n);
1779 /* the order of the values is important! */
1780 typedef enum const_class {
1786 static const_class classify_const(const ir_node* n)
1788 if (is_Const(n)) return const_const;
1789 if (is_irn_constlike(n)) return const_like;
1794 * Determines whether r is more constlike or has a larger index (in that order)
1797 static bool operands_are_normalized(const ir_node *l, const ir_node *r)
1799 const const_class l_order = classify_const(l);
1800 const const_class r_order = classify_const(r);
1802 l_order > r_order ||
1803 (l_order == r_order && get_irn_idx(l) <= get_irn_idx(r));
1806 static bool is_cmp_unequal(const ir_node *node)
1808 ir_relation relation = get_Cmp_relation(node);
1809 ir_node *left = get_Cmp_left(node);
1810 ir_node *right = get_Cmp_right(node);
1811 ir_mode *mode = get_irn_mode(left);
1813 if (relation == ir_relation_less_greater)
1816 if (!mode_is_signed(mode) && is_Const(right) && is_Const_null(right))
1817 return relation == ir_relation_greater;
1822 * returns true for Cmp(x == 0) or Cmp(x != 0)
1824 static bool is_cmp_equality_zero(const ir_node *node)
1826 ir_relation relation;
1827 ir_node *right = get_Cmp_right(node);
1829 if (!is_Const(right) || !is_Const_null(right))
1831 relation = get_Cmp_relation(node);
1832 return relation == ir_relation_equal
1833 || relation == ir_relation_less_greater
1834 || (!mode_is_signed(get_irn_mode(right))
1835 && relation == ir_relation_greater);
1839 * Optimize a Or(And(Or(And(v,c4),c3),c2),c1) pattern if possible.
1840 * Such pattern may arise in bitfield stores.
1842 * value c4 value c4 & c2
1843 * AND c3 AND c1 | c3
1850 * AND c1 ===> OR if (c1 | c2) == 0x111..11
1853 static ir_node *transform_node_Or_bf_store(ir_node *irn_or)
1855 ir_node *irn_and, *c1;
1857 ir_node *and_l, *c3;
1858 ir_node *value, *c4;
1859 ir_node *new_and, *new_const, *block;
1860 ir_mode *mode = get_irn_mode(irn_or);
1862 ir_tarval *tv1, *tv2, *tv3, *tv4, *tv;
1866 irn_and = get_binop_left(irn_or);
1867 c1 = get_binop_right(irn_or);
1868 if (!is_Const(c1) || !is_And(irn_and))
1871 or_l = get_binop_left(irn_and);
1872 c2 = get_binop_right(irn_and);
1876 tv1 = get_Const_tarval(c1);
1877 tv2 = get_Const_tarval(c2);
1879 tv = tarval_or(tv1, tv2);
1880 if (tarval_is_all_one(tv)) {
1881 /* the AND does NOT clear a bit with isn't set by the OR */
1882 set_binop_left(irn_or, or_l);
1883 set_binop_right(irn_or, c1);
1885 /* check for more */
1889 if (!is_Or(or_l) && !is_Or_Eor_Add(or_l))
1892 and_l = get_binop_left(or_l);
1893 c3 = get_binop_right(or_l);
1894 if (!is_Const(c3) || !is_And(and_l))
1897 value = get_binop_left(and_l);
1898 c4 = get_binop_right(and_l);
1902 /* ok, found the pattern, check for conditions */
1903 assert(mode == get_irn_mode(irn_and));
1904 assert(mode == get_irn_mode(or_l));
1905 assert(mode == get_irn_mode(and_l));
1907 tv3 = get_Const_tarval(c3);
1908 tv4 = get_Const_tarval(c4);
1910 tv = tarval_or(tv4, tv2);
1911 if (!tarval_is_all_one(tv)) {
1912 /* have at least one 0 at the same bit position */
1916 if (tv3 != tarval_andnot(tv3, tv4)) {
1917 /* bit in the or_mask is outside the and_mask */
1921 if (tv1 != tarval_andnot(tv1, tv2)) {
1922 /* bit in the or_mask is outside the and_mask */
1926 /* ok, all conditions met */
1927 block = get_nodes_block(irn_or);
1928 irg = get_irn_irg(block);
1930 new_and = new_r_And(block, value, new_r_Const(irg, tarval_and(tv4, tv2)), mode);
1932 new_const = new_r_Const(irg, tarval_or(tv3, tv1));
1934 set_binop_left(irn_or, new_and);
1935 set_binop_right(irn_or, new_const);
1937 /* check for more */
1942 * Optimize an Or(shl(x, c), shr(x, bits - c)) into a Rotl
1944 static ir_node *transform_node_Or_Rotl(ir_node *irn_or)
1946 ir_mode *mode = get_irn_mode(irn_or);
1947 ir_node *shl, *shr, *block;
1948 ir_node *irn, *x, *c1, *c2, *n;
1949 ir_tarval *tv1, *tv2;
1951 /* some backends can't handle rotl */
1952 if (!be_get_backend_param()->support_rotl)
1955 if (! mode_is_int(mode))
1958 shl = get_binop_left(irn_or);
1959 shr = get_binop_right(irn_or);
1968 } else if (!is_Shl(shl)) {
1970 } else if (!is_Shr(shr)) {
1973 x = get_Shl_left(shl);
1974 if (x != get_Shr_left(shr))
1977 c1 = get_Shl_right(shl);
1978 c2 = get_Shr_right(shr);
1979 if (is_Const(c1) && is_Const(c2)) {
1980 tv1 = get_Const_tarval(c1);
1981 if (! tarval_is_long(tv1))
1984 tv2 = get_Const_tarval(c2);
1985 if (! tarval_is_long(tv2))
1988 if (get_tarval_long(tv1) + get_tarval_long(tv2)
1989 != (int) get_mode_size_bits(mode))
1992 /* yet, condition met */
1993 block = get_nodes_block(irn_or);
1995 n = new_r_Rotl(block, x, c1, mode);
1997 DBG_OPT_ALGSIM1(irn_or, shl, shr, n, FS_OPT_OR_SHFT_TO_ROTL);
2001 /* Note: the obvious rot formulation (a << x) | (a >> (32-x)) gets
2002 * transformed to (a << x) | (a >> -x) by transform_node_shift_modulo() */
2003 if (!ir_is_negated_value(c1, c2)) {
2007 /* yet, condition met */
2008 block = get_nodes_block(irn_or);
2009 n = new_r_Rotl(block, x, c1, mode);
2010 DBG_OPT_ALGSIM0(irn_or, n, FS_OPT_OR_SHFT_TO_ROTL);
2015 * Prototype of a recursive transform function
2016 * for bitwise distributive transformations.
2018 typedef ir_node* (*recursive_transform)(ir_node *n);
2021 * makes use of distributive laws for and, or, eor
2022 * and(a OP c, b OP c) -> and(a, b) OP c
2023 * note, might return a different op than n
2025 static ir_node *transform_bitwise_distributive(ir_node *n,
2026 recursive_transform trans_func)
2029 ir_node *a = get_binop_left(n);
2030 ir_node *b = get_binop_right(n);
2031 ir_op *op = get_irn_op(a);
2032 ir_op *op_root = get_irn_op(n);
2034 if (op != get_irn_op(b))
2037 /* and(conv(a), conv(b)) -> conv(and(a,b)) */
2038 if (op == op_Conv) {
2039 ir_node *a_op = get_Conv_op(a);
2040 ir_node *b_op = get_Conv_op(b);
2041 ir_mode *a_mode = get_irn_mode(a_op);
2042 ir_mode *b_mode = get_irn_mode(b_op);
2043 if (a_mode == b_mode && (mode_is_int(a_mode) || a_mode == mode_b)) {
2044 ir_node *blk = get_nodes_block(n);
2047 set_binop_left(n, a_op);
2048 set_binop_right(n, b_op);
2049 set_irn_mode(n, a_mode);
2051 n = new_r_Conv(blk, n, get_irn_mode(oldn));
2053 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
2059 /* nothing to gain here */
2063 if (op == op_Shrs || op == op_Shr || op == op_Shl
2064 || op == op_And || op == op_Or || op == op_Eor) {
2065 ir_node *a_left = get_binop_left(a);
2066 ir_node *a_right = get_binop_right(a);
2067 ir_node *b_left = get_binop_left(b);
2068 ir_node *b_right = get_binop_right(b);
2070 ir_node *op1 = NULL;
2071 ir_node *op2 = NULL;
2073 if (is_op_commutative(op)) {
2074 if (a_left == b_left) {
2078 } else if (a_left == b_right) {
2082 } else if (a_right == b_left) {
2088 if (a_right == b_right) {
2095 /* (a sop c) & (b sop c) => (a & b) sop c */
2096 ir_node *blk = get_nodes_block(n);
2098 ir_node *new_n = exact_copy(n);
2099 set_binop_left(new_n, op1);
2100 set_binop_right(new_n, op2);
2101 new_n = trans_func(new_n);
2103 if (op_root == op_Eor && op == op_Or) {
2104 dbg_info *dbgi = get_irn_dbg_info(n);
2105 ir_mode *mode = get_irn_mode(c);
2107 c = new_rd_Not(dbgi, blk, c, mode);
2108 n = new_rd_And(dbgi, blk, new_n, c, mode);
2111 set_nodes_block(n, blk);
2112 set_binop_left(n, new_n);
2113 set_binop_right(n, c);
2117 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
2126 * normalisation: (x >> c1) & c2 to (x & (c2<<c1)) >> c1
2128 * - and, or, xor instead of &
2129 * - Shl, Shr, Shrs, rotl instead of >>
2130 * (with a special case for Or/Xor + Shrs)
2132 * This normalisation is usually good for the backend since << C can often be
2133 * matched as address-mode.
2135 static ir_node *transform_node_bitop_shift(ir_node *n)
2137 ir_graph *irg = get_irn_irg(n);
2138 ir_node *left = get_binop_left(n);
2139 ir_node *right = get_binop_right(n);
2140 ir_mode *mode = get_irn_mode(n);
2141 ir_node *shift_left;
2142 ir_node *shift_right;
2144 dbg_info *dbg_bitop;
2145 dbg_info *dbg_shift;
2151 ir_tarval *tv_bitop;
2153 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_NORMALISATION2))
2156 assert(is_And(n) || is_Or(n) || is_Eor(n) || is_Or_Eor_Add(n));
2157 if (!is_Const(right) || !is_shiftop(left))
2160 shift_left = get_binop_left(left);
2161 shift_right = get_binop_right(left);
2162 if (!is_Const(shift_right))
2165 /* doing it with Shrs is not legal if the Or/Eor affects the topmost bit */
2166 if (is_Shrs(left)) {
2167 /* TODO this could be improved */
2171 irg = get_irn_irg(n);
2172 block = get_nodes_block(n);
2173 dbg_bitop = get_irn_dbg_info(n);
2174 dbg_shift = get_irn_dbg_info(left);
2175 tv1 = get_Const_tarval(shift_right);
2176 tv2 = get_Const_tarval(right);
2177 assert(get_tarval_mode(tv2) == mode);
2180 tv_bitop = tarval_shr(tv2, tv1);
2182 /* Check whether we have lost some bits during the right shift. */
2184 ir_tarval *tv_back_again = tarval_shl(tv_bitop, tv1);
2186 if (tarval_cmp(tv_back_again, tv2) != ir_relation_equal)
2189 } else if (is_Shr(left)) {
2192 * TODO this can be improved by checking whether
2193 * the left shift produces an overflow
2197 tv_bitop = tarval_shl(tv2, tv1);
2199 assert(is_Rotl(left));
2200 tv_bitop = tarval_rotl(tv2, tarval_neg(tv1));
2202 new_const = new_r_Const(irg, tv_bitop);
2205 new_bitop = new_rd_And(dbg_bitop, block, shift_left, new_const, mode);
2206 } else if (is_Or(n) || is_Or_Eor_Add(n)) {
2207 new_bitop = new_rd_Or(dbg_bitop, block, shift_left, new_const, mode);
2210 new_bitop = new_rd_Eor(dbg_bitop, block, shift_left, new_const, mode);
2214 new_shift = new_rd_Shl(dbg_shift, block, new_bitop, shift_right, mode);
2215 } else if (is_Shr(left)) {
2216 new_shift = new_rd_Shr(dbg_shift, block, new_bitop, shift_right, mode);
2218 assert(is_Rotl(left));
2219 new_shift = new_rd_Rotl(dbg_shift, block, new_bitop, shift_right, mode);
2225 static bool complement_values(const ir_node *a, const ir_node *b)
2227 if (is_Not(a) && get_Not_op(a) == b)
2229 if (is_Not(b) && get_Not_op(b) == a)
2231 if (is_Const(a) && is_Const(b)) {
2232 ir_tarval *tv_a = get_Const_tarval(a);
2233 ir_tarval *tv_b = get_Const_tarval(b);
2234 return tarval_not(tv_a) == tv_b;
2239 typedef ir_tarval *(tv_fold_binop_func)(ir_tarval *a, ir_tarval *b);
2242 * for associative operations fold:
2243 * op(op(x, c0), c1) to op(x, op(c0, c1)) with constants folded.
2244 * This is a "light" version of the reassociation phase
2246 static ir_node *fold_constant_associativity(ir_node *node,
2247 tv_fold_binop_func fold)
2252 ir_node *right = get_binop_right(node);
2253 ir_node *left_right;
2260 if (!is_Const(right))
2263 op = get_irn_op(node);
2264 left = get_binop_left(node);
2265 if (get_irn_op(left) != op)
2268 left_right = get_binop_right(left);
2269 if (!is_Const(left_right))
2272 left_left = get_binop_left(left);
2273 c0 = get_Const_tarval(left_right);
2274 c1 = get_Const_tarval(right);
2275 irg = get_irn_irg(node);
2276 if (get_tarval_mode(c0) != get_tarval_mode(c1))
2278 new_c = fold(c0, c1);
2279 if (new_c == tarval_bad)
2281 new_const = new_r_Const(irg, new_c);
2282 new_node = exact_copy(node);
2283 set_binop_left(new_node, left_left);
2284 set_binop_right(new_node, new_const);
2291 static ir_node *transform_node_Or_(ir_node *n)
2294 ir_node *a = get_binop_left(n);
2295 ir_node *b = get_binop_right(n);
2299 n = fold_constant_associativity(n, tarval_or);
2303 if (is_Not(a) && is_Not(b)) {
2304 /* ~a | ~b = ~(a&b) */
2305 ir_node *block = get_nodes_block(n);
2307 mode = get_irn_mode(n);
2310 n = new_rd_And(get_irn_dbg_info(n), block, a, b, mode);
2311 n = new_rd_Not(get_irn_dbg_info(n), block, n, mode);
2312 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
2316 /* we can combine the relations of two compares with the same operands */
2317 if (is_Cmp(a) && is_Cmp(b)) {
2318 ir_node *a_left = get_Cmp_left(a);
2319 ir_node *a_right = get_Cmp_right(a);
2320 ir_node *b_left = get_Cmp_left(b);
2321 ir_node *b_right = get_Cmp_right(b);
2322 if (a_left == b_left && b_left == b_right) {
2323 dbg_info *dbgi = get_irn_dbg_info(n);
2324 ir_node *block = get_nodes_block(n);
2325 ir_relation a_relation = get_Cmp_relation(a);
2326 ir_relation b_relation = get_Cmp_relation(b);
2327 ir_relation new_relation = a_relation | b_relation;
2328 return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation);
2330 /* Cmp(a!=b) or Cmp(c!=d) => Cmp((a^b)|(c^d) != 0) */
2331 if (is_cmp_unequal(a) && is_cmp_unequal(b)
2332 && !mode_is_float(get_irn_mode(a_left))
2333 && !mode_is_float(get_irn_mode(b_left))) {
2334 if (values_in_mode(get_irn_mode(a_left), get_irn_mode(b_left))) {
2335 ir_graph *irg = get_irn_irg(n);
2336 dbg_info *dbgi = get_irn_dbg_info(n);
2337 ir_node *block = get_nodes_block(n);
2338 ir_mode *a_mode = get_irn_mode(a_left);
2339 ir_mode *b_mode = get_irn_mode(b_left);
2340 ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode);
2341 ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode);
2342 ir_node *conv = new_rd_Conv(dbgi, block, xora, b_mode);
2343 ir_node *orn = new_rd_Or(dbgi, block, conv, xorb, b_mode);
2344 ir_node *zero = create_zero_const(irg, b_mode);
2345 return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_less_greater);
2347 if (values_in_mode(get_irn_mode(b_left), get_irn_mode(a_left))) {
2348 ir_graph *irg = get_irn_irg(n);
2349 dbg_info *dbgi = get_irn_dbg_info(n);
2350 ir_node *block = get_nodes_block(n);
2351 ir_mode *a_mode = get_irn_mode(a_left);
2352 ir_mode *b_mode = get_irn_mode(b_left);
2353 ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode);
2354 ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode);
2355 ir_node *conv = new_rd_Conv(dbgi, block, xorb, a_mode);
2356 ir_node *orn = new_rd_Or(dbgi, block, xora, conv, a_mode);
2357 ir_node *zero = create_zero_const(irg, a_mode);
2358 return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_less_greater);
2363 mode = get_irn_mode(n);
2364 HANDLE_BINOP_PHI((eval_func) tarval_or, a, b, c, mode);
2366 n = transform_node_Or_bf_store(n);
2369 n = transform_node_Or_Rotl(n);
2373 n = transform_bitwise_distributive(n, transform_node_Or_);
2376 n = transform_node_bitop_shift(n);
2383 static ir_node *transform_node_Or(ir_node *n)
2385 if (is_Or_Eor_Add(n)) {
2386 dbg_info *dbgi = get_irn_dbg_info(n);
2387 ir_node *block = get_nodes_block(n);
2388 ir_node *left = get_Or_left(n);
2389 ir_node *right = get_Or_right(n);
2390 ir_mode *mode = get_irn_mode(n);
2391 return new_rd_Add(dbgi, block, left, right, mode);
2393 return transform_node_Or_(n);
2399 static ir_node *transform_node_Eor_(ir_node *n)
2402 ir_node *a = get_binop_left(n);
2403 ir_node *b = get_binop_right(n);
2404 ir_mode *mode = get_irn_mode(n);
2407 n = fold_constant_associativity(n, tarval_eor);
2411 /* we can combine the relations of two compares with the same operands */
2412 if (is_Cmp(a) && is_Cmp(b)) {
2413 ir_node *a_left = get_Cmp_left(a);
2414 ir_node *a_right = get_Cmp_left(a);
2415 ir_node *b_left = get_Cmp_left(b);
2416 ir_node *b_right = get_Cmp_right(b);
2417 if (a_left == b_left && b_left == b_right) {
2418 dbg_info *dbgi = get_irn_dbg_info(n);
2419 ir_node *block = get_nodes_block(n);
2420 ir_relation a_relation = get_Cmp_relation(a);
2421 ir_relation b_relation = get_Cmp_relation(b);
2422 ir_relation new_relation = a_relation ^ b_relation;
2423 return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation);
2427 HANDLE_BINOP_PHI((eval_func) tarval_eor, a, b, c, mode);
2429 /* normalize not nodes... ~a ^ b <=> a ^ ~b */
2430 if (is_Not(a) && operands_are_normalized(get_Not_op(a), b)) {
2431 dbg_info *dbg = get_irn_dbg_info(n);
2432 ir_node *block = get_nodes_block(n);
2433 ir_node *new_not = new_rd_Not(dbg, block, b, mode);
2434 ir_node *new_left = get_Not_op(a);
2435 n = new_rd_Eor(dbg, block, new_left, new_not, mode);
2436 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
2438 } else if (is_Not(b) && !operands_are_normalized(a, get_Not_op(b))) {
2439 dbg_info *dbg = get_irn_dbg_info(n);
2440 ir_node *block = get_nodes_block(n);
2441 ir_node *new_not = new_rd_Not(dbg, block, a, mode);
2442 ir_node *new_right = get_Not_op(b);
2443 n = new_rd_Eor(dbg, block, new_not, new_right, mode);
2444 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
2448 /* x ^ 1...1 -> ~1 */
2449 if (is_Const(b) && is_Const_all_one(b)) {
2450 n = new_r_Not(get_nodes_block(n), a, mode);
2451 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
2455 n = transform_bitwise_distributive(n, transform_node_Eor_);
2458 n = transform_node_bitop_shift(n);
2465 static ir_node *transform_node_Eor(ir_node *n)
2467 if (is_Or_Eor_Add(n)) {
2468 dbg_info *dbgi = get_irn_dbg_info(n);
2469 ir_node *block = get_nodes_block(n);
2470 ir_node *left = get_Eor_left(n);
2471 ir_node *right = get_Eor_right(n);
2472 ir_mode *mode = get_irn_mode(n);
2473 return new_rd_Add(dbgi, block, left, right, mode);
2475 return transform_node_Eor_(n);
2479 * Do the AddSub optimization, then Transform
2480 * Constant folding on Phi
2481 * Add(a,a) -> Mul(a, 2)
2482 * Add(Mul(a, x), a) -> Mul(a, x+1)
2483 * if the mode is integer or float.
2484 * Transform Add(a,-b) into Sub(a,b).
2485 * Reassociation might fold this further.
2487 static ir_node *transform_node_Add(ir_node *n)
2495 n = fold_constant_associativity(n, tarval_add);
2499 n = transform_node_AddSub(n);
2503 a = get_Add_left(n);
2504 b = get_Add_right(n);
2505 mode = get_irn_mode(n);
2507 if (mode_is_reference(mode)) {
2508 ir_mode *lmode = get_irn_mode(a);
2510 if (is_Const(b) && is_Const_null(b) && mode_is_int(lmode)) {
2511 /* an Add(a, NULL) is a hidden Conv */
2512 dbg_info *dbg = get_irn_dbg_info(n);
2513 return new_rd_Conv(dbg, get_nodes_block(n), a, mode);
2517 if (is_Const(b) && get_mode_arithmetic(mode) == irma_twos_complement) {
2518 ir_tarval *tv = get_Const_tarval(b);
2519 ir_tarval *min = get_mode_min(mode);
2520 /* if all bits are set, then this has the same effect as a Not.
2521 * Note that the following == gives false for different modes which
2522 * is exactly what we want */
2524 dbg_info *dbgi = get_irn_dbg_info(n);
2525 ir_graph *irg = get_irn_irg(n);
2526 ir_node *block = get_nodes_block(n);
2527 ir_node *cnst = new_r_Const(irg, min);
2528 return new_rd_Eor(dbgi, block, a, cnst, mode);
2532 HANDLE_BINOP_PHI((eval_func) tarval_add, a, b, c, mode);
2534 /* for FP the following optimizations are only allowed if
2535 * fp_strict_algebraic is disabled */
2536 if (mode_is_float(mode)) {
2537 ir_graph *irg = get_irn_irg(n);
2538 if (get_irg_fp_model(irg) & fp_strict_algebraic)
2542 if (mode_is_num(mode)) {
2543 ir_graph *irg = get_irn_irg(n);
2544 /* the following code leads to endless recursion when Mul are replaced
2545 * by a simple instruction chain */
2546 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_ARCH_DEP)
2547 && a == b && mode_is_int(mode)) {
2548 ir_node *block = get_nodes_block(n);
2551 get_irn_dbg_info(n),
2554 new_r_Const_long(irg, mode, 2),
2556 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_A);
2561 get_irn_dbg_info(n),
2566 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
2571 get_irn_dbg_info(n),
2576 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
2579 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2580 /* Here we rely on constants be on the RIGHT side */
2582 ir_node *op = get_Not_op(a);
2584 if (is_Const(b) && is_Const_one(b)) {
2586 ir_node *blk = get_nodes_block(n);
2587 n = new_rd_Minus(get_irn_dbg_info(n), blk, op, mode);
2588 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_PLUS_1);
2595 if (is_Or_Eor_Add(n)) {
2596 n = transform_node_Or_(n);
2599 n = transform_node_Eor_(n);
2608 * returns -cnst or NULL if impossible
2610 static ir_node *const_negate(ir_node *cnst)
2612 ir_tarval *tv = tarval_neg(get_Const_tarval(cnst));
2613 dbg_info *dbgi = get_irn_dbg_info(cnst);
2614 ir_graph *irg = get_irn_irg(cnst);
2615 if (tv == tarval_bad) return NULL;
2616 return new_rd_Const(dbgi, irg, tv);
2620 * Do the AddSub optimization, then Transform
2621 * Constant folding on Phi
2622 * Sub(0,a) -> Minus(a)
2623 * Sub(Mul(a, x), a) -> Mul(a, x-1)
2624 * Sub(Sub(x, y), b) -> Sub(x, Add(y,b))
2625 * Sub(Add(a, x), x) -> a
2626 * Sub(x, Add(x, a)) -> -a
2627 * Sub(x, Const) -> Add(x, -Const)
2629 static ir_node *transform_node_Sub(ir_node *n)
2635 n = transform_node_AddSub(n);
2637 a = get_Sub_left(n);
2638 b = get_Sub_right(n);
2640 mode = get_irn_mode(n);
2642 if (mode_is_int(mode)) {
2643 ir_mode *lmode = get_irn_mode(a);
2645 if (is_Const(b) && is_Const_null(b) && mode_is_reference(lmode)) {
2646 /* a Sub(a, NULL) is a hidden Conv */
2647 dbg_info *dbg = get_irn_dbg_info(n);
2648 n = new_rd_Conv(dbg, get_nodes_block(n), a, mode);
2649 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_CONV);
2653 if (mode == lmode &&
2654 get_mode_arithmetic(mode) == irma_twos_complement &&
2656 get_Const_tarval(a) == get_mode_minus_one(mode)) {
2658 dbg_info *dbg = get_irn_dbg_info(n);
2659 n = new_rd_Not(dbg, get_nodes_block(n), b, mode);
2660 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_NOT);
2666 HANDLE_BINOP_PHI((eval_func) tarval_sub, a, b, c, mode);
2668 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2669 if (mode_is_float(mode)) {
2670 ir_graph *irg = get_irn_irg(n);
2671 if (get_irg_fp_model(irg) & fp_strict_algebraic)
2675 if (is_Const(b) && !mode_is_reference(get_irn_mode(b))) {
2676 /* a - C -> a + (-C) */
2677 ir_node *cnst = const_negate(b);
2679 ir_node *block = get_nodes_block(n);
2680 dbg_info *dbgi = get_irn_dbg_info(n);
2682 n = new_rd_Add(dbgi, block, a, cnst, mode);
2683 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2688 if (is_Minus(a)) { /* (-a) - b -> -(a + b) */
2689 dbg_info *dbg = get_irn_dbg_info(n);
2690 ir_node *block = get_nodes_block(n);
2691 ir_node *left = get_Minus_op(a);
2692 ir_node *add = new_rd_Add(dbg, block, left, b, mode);
2694 n = new_rd_Minus(dbg, block, add, mode);
2695 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2697 } else if (is_Minus(b)) { /* a - (-b) -> a + b */
2698 dbg_info *dbg = get_irn_dbg_info(n);
2699 ir_node *block = get_nodes_block(n);
2700 ir_node *right = get_Minus_op(b);
2702 n = new_rd_Add(dbg, block, a, right, mode);
2703 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MINUS);
2705 } else if (is_Sub(b)) {
2706 /* a - (b - c) -> a + (c - b)
2707 * -> (a - b) + c iff (b - c) is a pointer */
2708 dbg_info *s_dbg = get_irn_dbg_info(b);
2709 ir_node *s_left = get_Sub_left(b);
2710 ir_node *s_right = get_Sub_right(b);
2711 ir_mode *s_mode = get_irn_mode(b);
2712 if (mode_is_reference(s_mode)) {
2713 ir_node *lowest_block = get_nodes_block(n); /* a and b are live here */
2714 ir_node *sub = new_rd_Sub(s_dbg, lowest_block, a, s_left, mode);
2715 dbg_info *a_dbg = get_irn_dbg_info(n);
2718 s_right = new_r_Conv(lowest_block, s_right, mode);
2719 n = new_rd_Add(a_dbg, lowest_block, sub, s_right, mode);
2721 ir_node *s_block = get_nodes_block(b);
2722 ir_node *sub = new_rd_Sub(s_dbg, s_block, s_right, s_left, s_mode);
2723 dbg_info *a_dbg = get_irn_dbg_info(n);
2724 ir_node *a_block = get_nodes_block(n);
2726 n = new_rd_Add(a_dbg, a_block, a, sub, mode);
2728 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2732 /* Beware of Sub(P, P) which cannot be optimized into a simple Minus ... */
2733 if (mode_is_num(mode) && mode == get_irn_mode(a) && is_Const(a) && is_Const_null(a)) {
2735 get_irn_dbg_info(n),
2739 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_0_A);
2742 if ((is_Add(a) || is_Or_Eor_Add(a)) && mode_wrap_around(mode)) {
2743 ir_node *left = get_binop_left(a);
2744 ir_node *right = get_binop_right(a);
2746 /* FIXME: Does the Conv's work only for two complement or generally? */
2748 if (mode != get_irn_mode(right)) {
2749 /* This Sub is an effective Cast */
2750 right = new_r_Conv(get_nodes_block(n), right, mode);
2753 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2755 } else if (right == b) {
2756 if (mode != get_irn_mode(left)) {
2757 /* This Sub is an effective Cast */
2758 left = new_r_Conv(get_nodes_block(n), left, mode);
2761 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2765 if ((is_Add(b) || is_Or_Eor_Add(b)) && mode_wrap_around(mode)) {
2766 ir_node *left = get_binop_left(b);
2767 ir_node *right = get_binop_right(b);
2769 /* FIXME: Does the Conv's work only for two complement or generally? */
2771 ir_mode *r_mode = get_irn_mode(right);
2773 n = new_r_Minus(get_nodes_block(n), right, r_mode);
2774 if (mode != r_mode) {
2775 /* This Sub is an effective Cast */
2776 n = new_r_Conv(get_nodes_block(n), n, mode);
2778 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2780 } else if (right == a) {
2781 ir_mode *l_mode = get_irn_mode(left);
2783 n = new_r_Minus(get_nodes_block(n), left, l_mode);
2784 if (mode != l_mode) {
2785 /* This Sub is an effective Cast */
2786 n = new_r_Conv(get_nodes_block(n), n, mode);
2788 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2792 if (mode_is_int(mode) && is_Conv(a) && is_Conv(b)) {
2793 ir_mode *mode = get_irn_mode(a);
2795 if (mode == get_irn_mode(b)) {
2797 ir_node *op_a = get_Conv_op(a);
2798 ir_node *op_b = get_Conv_op(b);
2800 /* check if it's allowed to skip the conv */
2801 ma = get_irn_mode(op_a);
2802 mb = get_irn_mode(op_b);
2804 if (mode_is_reference(ma) && mode_is_reference(mb)) {
2805 /* SubInt(ConvInt(aP), ConvInt(bP)) -> SubInt(aP,bP) */
2808 set_Sub_right(n, b);
2814 /* do NOT execute this code if reassociation is enabled, it does the inverse! */
2815 if (!is_reassoc_running() && is_Mul(a)) {
2816 ir_node *ma = get_Mul_left(a);
2817 ir_node *mb = get_Mul_right(a);
2820 ir_node *blk = get_nodes_block(n);
2821 ir_graph *irg = get_irn_irg(n);
2823 get_irn_dbg_info(n),
2827 get_irn_dbg_info(n),
2830 new_r_Const(irg, get_mode_one(mode)),
2833 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2835 } else if (mb == b) {
2836 ir_node *blk = get_nodes_block(n);
2837 ir_graph *irg = get_irn_irg(n);
2839 get_irn_dbg_info(n),
2843 get_irn_dbg_info(n),
2846 new_r_Const(irg, get_mode_one(mode)),
2849 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2853 if (is_Sub(a)) { /* (x - y) - b -> x - (y + b) */
2854 ir_node *x = get_Sub_left(a);
2855 ir_node *y = get_Sub_right(a);
2856 ir_node *blk = get_nodes_block(n);
2857 ir_mode *m_b = get_irn_mode(b);
2858 ir_mode *m_y = get_irn_mode(y);
2862 /* Determine the right mode for the Add. */
2865 else if (mode_is_reference(m_b))
2867 else if (mode_is_reference(m_y))
2871 * Both modes are different but none is reference,
2872 * happens for instance in SubP(SubP(P, Iu), Is).
2873 * We have two possibilities here: Cast or ignore.
2874 * Currently we ignore this case.
2879 add = new_r_Add(blk, y, b, add_mode);
2881 n = new_rd_Sub(get_irn_dbg_info(n), blk, x, add, mode);
2882 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_SUB_X_Y_Z);
2886 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2887 /* c - ~X = X + (c+1) */
2888 if (is_Const(a) && is_Not(b)) {
2889 ir_tarval *tv = get_Const_tarval(a);
2891 tv = tarval_add(tv, get_mode_one(mode));
2892 if (tv != tarval_bad) {
2893 ir_node *blk = get_nodes_block(n);
2894 ir_graph *irg = get_irn_irg(n);
2895 ir_node *c = new_r_Const(irg, tv);
2896 n = new_rd_Add(get_irn_dbg_info(n), blk, get_Not_op(b), c, mode);
2897 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_C_NOT_X);
2901 /* x-(x&y) = x & ~y */
2903 ir_node *and_left = get_And_left(b);
2904 ir_node *and_right = get_And_right(b);
2905 if (and_right == a) {
2906 ir_node *tmp = and_left;
2907 and_left = and_right;
2910 if (and_left == a) {
2911 dbg_info *dbgi = get_irn_dbg_info(n);
2912 ir_node *block = get_nodes_block(n);
2913 ir_mode *mode = get_irn_mode(n);
2914 ir_node *notn = new_rd_Not(dbgi, block, and_right, mode);
2915 ir_node *andn = new_rd_And(dbgi, block, a, notn, mode);
2924 * Several transformation done on n*n=2n bits mul.
2925 * These transformations must be done here because new nodes may be produced.
2927 static ir_node *transform_node_Mul2n(ir_node *n, ir_mode *mode)
2930 ir_node *a = get_Mul_left(n);
2931 ir_node *b = get_Mul_right(n);
2932 ir_tarval *ta = value_of(a);
2933 ir_tarval *tb = value_of(b);
2934 ir_mode *smode = get_irn_mode(a);
2936 if (ta == get_mode_one(smode)) {
2937 /* (L)1 * (L)b = (L)b */
2938 ir_node *blk = get_nodes_block(n);
2939 n = new_rd_Conv(get_irn_dbg_info(n), blk, b, mode);
2940 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2943 else if (ta == get_mode_minus_one(smode)) {
2944 /* (L)-1 * (L)b = (L)b */
2945 ir_node *blk = get_nodes_block(n);
2946 n = new_rd_Minus(get_irn_dbg_info(n), blk, b, smode);
2947 n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode);
2948 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2951 if (tb == get_mode_one(smode)) {
2952 /* (L)a * (L)1 = (L)a */
2953 ir_node *blk = get_nodes_block(a);
2954 n = new_rd_Conv(get_irn_dbg_info(n), blk, a, mode);
2955 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2958 else if (tb == get_mode_minus_one(smode)) {
2959 /* (L)a * (L)-1 = (L)-a */
2960 ir_node *blk = get_nodes_block(n);
2961 n = new_rd_Minus(get_irn_dbg_info(n), blk, a, smode);
2962 n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode);
2963 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2970 * Transform Mul(a,-1) into -a.
2971 * Do constant evaluation of Phi nodes.
2972 * Do architecture dependent optimizations on Mul nodes
2974 static ir_node *transform_node_Mul(ir_node *n)
2976 ir_node *c, *oldn = n;
2977 ir_mode *mode = get_irn_mode(n);
2978 ir_node *a = get_Mul_left(n);
2979 ir_node *b = get_Mul_right(n);
2981 n = fold_constant_associativity(n, tarval_mul);
2985 if (mode != get_irn_mode(a))
2986 return transform_node_Mul2n(n, mode);
2988 HANDLE_BINOP_PHI((eval_func) tarval_mul, a, b, c, mode);
2990 if (mode_is_signed(mode)) {
2993 if (value_of(a) == get_mode_minus_one(mode))
2995 else if (value_of(b) == get_mode_minus_one(mode))
2998 n = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), r, mode);
2999 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
3004 if (is_Const(b)) { /* (-a) * const -> a * -const */
3005 ir_node *cnst = const_negate(b);
3007 dbg_info *dbgi = get_irn_dbg_info(n);
3008 ir_node *block = get_nodes_block(n);
3009 n = new_rd_Mul(dbgi, block, get_Minus_op(a), cnst, mode);
3010 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
3013 } else if (is_Minus(b)) { /* (-a) * (-b) -> a * b */
3014 dbg_info *dbgi = get_irn_dbg_info(n);
3015 ir_node *block = get_nodes_block(n);
3016 n = new_rd_Mul(dbgi, block, get_Minus_op(a), get_Minus_op(b), mode);
3017 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_MINUS);
3019 } else if (is_Sub(b)) { /* (-a) * (b - c) -> a * (c - b) */
3020 ir_node *sub_l = get_Sub_left(b);
3021 ir_node *sub_r = get_Sub_right(b);
3022 dbg_info *dbgi = get_irn_dbg_info(n);
3023 ir_node *block = get_nodes_block(n);
3024 ir_node *new_b = new_rd_Sub(dbgi, block, sub_r, sub_l, mode);
3025 n = new_rd_Mul(dbgi, block, get_Minus_op(a), new_b, mode);
3026 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
3029 } else if (is_Minus(b)) {
3030 if (is_Sub(a)) { /* (a - b) * (-c) -> (b - a) * c */
3031 ir_node *sub_l = get_Sub_left(a);
3032 ir_node *sub_r = get_Sub_right(a);
3033 dbg_info *dbgi = get_irn_dbg_info(n);
3034 ir_node *block = get_nodes_block(n);
3035 ir_node *new_a = new_rd_Sub(dbgi, block, sub_r, sub_l, mode);
3036 n = new_rd_Mul(dbgi, block, new_a, get_Minus_op(b), mode);
3037 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
3040 } else if (is_Shl(a)) {
3041 ir_node *const shl_l = get_Shl_left(a);
3042 if (is_Const(shl_l) && is_Const_one(shl_l)) {
3043 /* (1 << x) * b -> b << x */
3044 dbg_info *const dbgi = get_irn_dbg_info(n);
3045 ir_node *const block = get_nodes_block(n);
3046 ir_node *const shl_r = get_Shl_right(a);
3047 n = new_rd_Shl(dbgi, block, b, shl_r, mode);
3048 // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT);
3051 } else if (is_Shl(b)) {
3052 ir_node *const shl_l = get_Shl_left(b);
3053 if (is_Const(shl_l) && is_Const_one(shl_l)) {
3054 /* a * (1 << x) -> a << x */
3055 dbg_info *const dbgi = get_irn_dbg_info(n);
3056 ir_node *const block = get_nodes_block(n);
3057 ir_node *const shl_r = get_Shl_right(b);
3058 n = new_rd_Shl(dbgi, block, a, shl_r, mode);
3059 // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT);
3063 if (get_mode_arithmetic(mode) == irma_ieee754
3064 || get_mode_arithmetic(mode) == irma_x86_extended_float) {
3066 ir_tarval *tv = get_Const_tarval(a);
3067 if (tarval_get_exponent(tv) == 1 && tarval_zero_mantissa(tv)
3068 && !tarval_is_negative(tv)) {
3069 /* 2.0 * b = b + b */
3070 n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), b, b, mode);
3071 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
3075 else if (is_Const(b)) {
3076 ir_tarval *tv = get_Const_tarval(b);
3077 if (tarval_get_exponent(tv) == 1 && tarval_zero_mantissa(tv)
3078 && !tarval_is_negative(tv)) {
3079 /* a * 2.0 = a + a */
3080 n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), a, a, mode);
3081 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
3086 return arch_dep_replace_mul_with_shifts(n);
3090 * Transform a Div Node.
3092 static ir_node *transform_node_Div(ir_node *n)
3094 ir_mode *mode = get_Div_resmode(n);
3095 ir_node *a = get_Div_left(n);
3096 ir_node *b = get_Div_right(n);
3098 const ir_node *dummy;
3100 if (mode_is_int(mode)) {
3101 if (is_Const(b) && is_const_Phi(a)) {
3102 /* check for Div(Phi, Const) */
3103 value = apply_binop_on_phi(a, get_Const_tarval(b), (eval_func) tarval_div, mode, 0);
3105 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
3108 } else if (is_Const(a) && is_const_Phi(b)) {
3109 /* check for Div(Const, Phi) */
3110 value = apply_binop_on_phi(b, get_Const_tarval(a), (eval_func) tarval_div, mode, 1);
3112 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
3115 } else if (is_const_Phi(a) && is_const_Phi(b)) {
3116 /* check for Div(Phi, Phi) */
3117 value = apply_binop_on_2_phis(a, b, (eval_func) tarval_div, mode);
3119 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
3124 if (a == b && value_not_zero(a, &dummy)) {
3125 ir_graph *irg = get_irn_irg(n);
3126 /* BEWARE: we can optimize a/a to 1 only if this cannot cause a exception */
3127 value = new_r_Const(irg, get_mode_one(mode));
3128 DBG_OPT_CSTEVAL(n, value);
3131 if (mode_is_signed(mode) && is_Const(b)) {
3132 ir_tarval *tv = get_Const_tarval(b);
3134 if (tv == get_mode_minus_one(mode)) {
3136 value = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), a, mode);
3137 DBG_OPT_CSTEVAL(n, value);
3141 /* Try architecture dependent optimization */
3142 value = arch_dep_replace_div_by_const(n);
3145 assert(mode_is_float(mode));
3147 /* Optimize x/c to x*(1/c) */
3148 ir_tarval *tv = value_of(b);
3150 if (tv != tarval_bad) {
3151 tv = tarval_div(get_mode_one(mode), tv);
3153 /* Do the transformation if the result is either exact or we are
3154 not using strict rules. */
3155 if (tv != tarval_bad &&
3156 (tarval_ieee754_get_exact() || (get_irg_fp_model(get_irn_irg(n)) & fp_strict_algebraic) == 0)) {
3157 ir_node *block = get_nodes_block(n);
3158 ir_graph *irg = get_irn_irg(block);
3159 ir_node *c = new_r_Const(irg, tv);
3160 dbg_info *dbgi = get_irn_dbg_info(n);
3161 value = new_rd_Mul(dbgi, block, a, c, mode);
3173 /* Turn Div into a tuple (mem, jmp, bad, value) */
3174 mem = get_Div_mem(n);
3175 blk = get_nodes_block(n);
3176 irg = get_irn_irg(blk);
3178 /* skip a potential Pin */
3179 mem = skip_Pin(mem);
3180 turn_into_tuple(n, pn_Div_max+1);
3181 set_Tuple_pred(n, pn_Div_M, mem);
3182 set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(blk));
3183 set_Tuple_pred(n, pn_Div_X_except, new_r_Bad(irg, mode_X));
3184 set_Tuple_pred(n, pn_Div_res, value);
3190 * Transform a Mod node.
3192 static ir_node *transform_node_Mod(ir_node *n)
3194 ir_mode *mode = get_Mod_resmode(n);
3195 ir_node *a = get_Mod_left(n);
3196 ir_node *b = get_Mod_right(n);
3201 if (is_Const(b) && is_const_Phi(a)) {
3202 /* check for Div(Phi, Const) */
3203 value = apply_binop_on_phi(a, get_Const_tarval(b), (eval_func) tarval_mod, mode, 0);
3205 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
3209 else if (is_Const(a) && is_const_Phi(b)) {
3210 /* check for Div(Const, Phi) */
3211 value = apply_binop_on_phi(b, get_Const_tarval(a), (eval_func) tarval_mod, mode, 1);
3213 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
3217 else if (is_const_Phi(a) && is_const_Phi(b)) {
3218 /* check for Div(Phi, Phi) */
3219 value = apply_binop_on_2_phis(a, b, (eval_func) tarval_mod, mode);
3221 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
3228 irg = get_irn_irg(n);
3229 if (tv != tarval_bad) {
3230 value = new_r_Const(irg, tv);
3232 DBG_OPT_CSTEVAL(n, value);
3235 ir_node *a = get_Mod_left(n);
3236 ir_node *b = get_Mod_right(n);
3237 const ir_node *dummy;
3239 if (a == b && value_not_zero(a, &dummy)) {
3240 /* BEWARE: we can optimize a%a to 0 only if this cannot cause a exception */
3241 value = new_r_Const(irg, get_mode_null(mode));
3242 DBG_OPT_CSTEVAL(n, value);
3245 if (mode_is_signed(mode) && is_Const(b)) {
3246 ir_tarval *tv = get_Const_tarval(b);
3248 if (tv == get_mode_minus_one(mode)) {
3250 value = new_r_Const(irg, get_mode_null(mode));
3251 DBG_OPT_CSTEVAL(n, value);
3255 /* Try architecture dependent optimization */
3256 value = arch_dep_replace_mod_by_const(n);
3265 /* Turn Mod into a tuple (mem, jmp, bad, value) */
3266 mem = get_Mod_mem(n);
3267 blk = get_nodes_block(n);
3268 irg = get_irn_irg(blk);
3270 /* skip a potential Pin */
3271 mem = skip_Pin(mem);
3272 turn_into_tuple(n, pn_Mod_max+1);
3273 set_Tuple_pred(n, pn_Mod_M, mem);
3274 set_Tuple_pred(n, pn_Mod_X_regular, new_r_Jmp(blk));
3275 set_Tuple_pred(n, pn_Mod_X_except, new_r_Bad(irg, mode_X));
3276 set_Tuple_pred(n, pn_Mod_res, value);
3282 * Transform a Cond node.
3284 * Replace the Cond by a Jmp if it branches on a constant
3287 static ir_node *transform_node_Cond(ir_node *n)
3289 ir_node *a = get_Cond_selector(n);
3290 ir_graph *irg = get_irn_irg(n);
3294 /* we need block info which is not available in floating irgs */
3295 if (get_irg_pinned(irg) == op_pin_state_floats)
3299 if (ta == tarval_bad && is_Cmp(a)) {
3300 /* try again with a direct call to compute_cmp, as we don't care
3301 * about the MODEB_LOWERED flag here */
3302 ta = compute_cmp_ext(a);
3305 if (ta != tarval_bad) {
3306 /* It's branching on a boolean constant.
3307 Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
3308 ir_node *blk = get_nodes_block(n);
3309 jmp = new_r_Jmp(blk);
3310 turn_into_tuple(n, pn_Cond_max+1);
3311 if (ta == tarval_b_true) {
3312 set_Tuple_pred(n, pn_Cond_false, new_r_Bad(irg, mode_X));
3313 set_Tuple_pred(n, pn_Cond_true, jmp);
3315 set_Tuple_pred(n, pn_Cond_false, jmp);
3316 set_Tuple_pred(n, pn_Cond_true, new_r_Bad(irg, mode_X));
3318 clear_irg_properties(irg, IR_GRAPH_PROPERTY_NO_UNREACHABLE_CODE);
3323 static ir_node *transform_node_Switch(ir_node *n)
3325 ir_node *op = get_Switch_selector(n);
3326 ir_tarval *val = value_of(op);
3327 if (val != tarval_bad) {
3328 dbg_info *dbgi = get_irn_dbg_info(n);
3329 ir_graph *irg = get_irn_irg(n);
3330 unsigned n_outs = get_Switch_n_outs(n);
3331 ir_node *block = get_nodes_block(n);
3332 ir_node *bad = new_r_Bad(irg, mode_X);
3333 ir_node **in = XMALLOCN(ir_node*, n_outs);
3334 const ir_switch_table *table = get_Switch_table(n);
3335 size_t n_entries = ir_switch_table_get_n_entries(table);
3339 for (i = 0; i < n_entries; ++i) {
3340 const ir_switch_table_entry *entry
3341 = ir_switch_table_get_entry_const(table, i);
3342 ir_tarval *min = entry->min;
3343 ir_tarval *max = entry->max;
3346 if ((min == max && min == val)
3347 || (tarval_cmp(val, min) != ir_relation_less
3348 && tarval_cmp(val, max) != ir_relation_greater)) {
3353 for (o = 0; o < n_outs; ++o) {
3354 if (o == (unsigned)jmp_pn) {
3355 in[o] = new_rd_Jmp(dbgi, block);
3360 return new_r_Tuple(block, (int)n_outs, in);
3366 * normalisation: (x & c1) >> c2 to (x >> c2) & (c1 >> c2)
3368 * - and, or, xor instead of &
3369 * - Shl, Shr, Shrs, rotl instead of >>
3370 * (with a special case for Or/Xor + Shrs)
3372 * This normalisation is good for things like x-(x&y) esp. in 186.crafty.
3374 static ir_node *transform_node_shift_bitop(ir_node *n)
3376 ir_graph *irg = get_irn_irg(n);
3377 ir_node *right = get_binop_right(n);
3378 ir_mode *mode = get_irn_mode(n);
3380 ir_node *bitop_left;
3381 ir_node *bitop_right;
3390 ir_tarval *tv_shift;
3392 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_NORMALISATION2))
3395 assert(is_Shrs(n) || is_Shr(n) || is_Shl(n) || is_Rotl(n));
3397 if (!is_Const(right))
3400 left = get_binop_left(n);
3401 op_left = get_irn_op(left);
3402 if (op_left != op_And && op_left != op_Or && op_left != op_Eor)
3405 /* doing it with Shrs is not legal if the Or/Eor affects the topmost bit */
3406 if (is_Shrs(n) && (op_left == op_Or || op_left == op_Eor)) {
3407 /* TODO: test if sign bit is affectes */
3411 bitop_right = get_binop_right(left);
3412 if (!is_Const(bitop_right))
3415 bitop_left = get_binop_left(left);
3417 block = get_nodes_block(n);
3418 dbgi = get_irn_dbg_info(n);
3419 tv1 = get_Const_tarval(bitop_right);
3420 tv2 = get_Const_tarval(right);
3422 assert(get_tarval_mode(tv1) == mode);
3425 new_shift = new_rd_Shl(dbgi, block, bitop_left, right, mode);
3426 tv_shift = tarval_shl(tv1, tv2);
3427 } else if (is_Shr(n)) {
3428 new_shift = new_rd_Shr(dbgi, block, bitop_left, right, mode);
3429 tv_shift = tarval_shr(tv1, tv2);
3430 } else if (is_Shrs(n)) {
3431 new_shift = new_rd_Shrs(dbgi, block, bitop_left, right, mode);
3432 tv_shift = tarval_shrs(tv1, tv2);
3435 new_shift = new_rd_Rotl(dbgi, block, bitop_left, right, mode);
3436 tv_shift = tarval_rotl(tv1, tv2);
3439 assert(get_tarval_mode(tv_shift) == mode);
3440 irg = get_irn_irg(n);
3441 new_const = new_r_Const(irg, tv_shift);
3443 if (op_left == op_And) {
3444 new_bitop = new_rd_And(dbgi, block, new_shift, new_const, mode);
3445 } else if (op_left == op_Or) {
3446 new_bitop = new_rd_Or(dbgi, block, new_shift, new_const, mode);
3448 assert(op_left == op_Eor);
3449 new_bitop = new_rd_Eor(dbgi, block, new_shift, new_const, mode);
3458 static ir_node *transform_node_And(ir_node *n)
3460 ir_node *c, *oldn = n;
3461 ir_node *a = get_And_left(n);
3462 ir_node *b = get_And_right(n);
3465 n = fold_constant_associativity(n, tarval_and);
3469 if (is_Cmp(a) && is_Cmp(b)) {
3470 ir_node *a_left = get_Cmp_left(a);
3471 ir_node *a_right = get_Cmp_right(a);
3472 ir_node *b_left = get_Cmp_left(b);
3473 ir_node *b_right = get_Cmp_right(b);
3474 ir_relation a_relation = get_Cmp_relation(a);
3475 ir_relation b_relation = get_Cmp_relation(b);
3476 /* we can combine the relations of two compares with the same
3478 if (a_left == b_left && b_left == b_right) {
3479 dbg_info *dbgi = get_irn_dbg_info(n);
3480 ir_node *block = get_nodes_block(n);
3481 ir_relation new_relation = a_relation & b_relation;
3482 return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation);
3484 /* Cmp(a==b) and Cmp(c==d) can be optimized to Cmp((a^b)|(c^d)==0) */
3485 if (a_relation == b_relation && a_relation == ir_relation_equal
3486 && !mode_is_float(get_irn_mode(a_left))
3487 && !mode_is_float(get_irn_mode(b_left))) {
3488 if (values_in_mode(get_irn_mode(a_left), get_irn_mode(b_left))) {
3489 dbg_info *dbgi = get_irn_dbg_info(n);
3490 ir_node *block = get_nodes_block(n);
3491 ir_mode *a_mode = get_irn_mode(a_left);
3492 ir_mode *b_mode = get_irn_mode(b_left);
3493 ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode);
3494 ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode);
3495 ir_node *conv = new_rd_Conv(dbgi, block, xora, b_mode);
3496 ir_node *orn = new_rd_Or(dbgi, block, conv, xorb, b_mode);
3497 ir_graph *irg = get_irn_irg(n);
3498 ir_node *zero = create_zero_const(irg, b_mode);
3499 return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_equal);
3501 if (values_in_mode(get_irn_mode(b_left), get_irn_mode(a_left))) {
3502 dbg_info *dbgi = get_irn_dbg_info(n);
3503 ir_node *block = get_nodes_block(n);
3504 ir_mode *a_mode = get_irn_mode(a_left);
3505 ir_mode *b_mode = get_irn_mode(b_left);
3506 ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode);
3507 ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode);
3508 ir_node *conv = new_rd_Conv(dbgi, block, xorb, a_mode);
3509 ir_node *orn = new_rd_Or(dbgi, block, xora, conv, a_mode);
3510 ir_graph *irg = get_irn_irg(n);
3511 ir_node *zero = create_zero_const(irg, a_mode);
3512 return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_equal);
3517 mode = get_irn_mode(n);
3518 HANDLE_BINOP_PHI((eval_func) tarval_and, a, b, c, mode);
3520 if (is_Or(a) || is_Or_Eor_Add(a)) {
3521 ir_node *or_left = get_binop_left(a);
3522 ir_node *or_right = get_binop_right(a);
3523 if (complement_values(or_left, b)) {
3524 /* (a|b) & ~a => b & ~a */
3525 dbg_info *dbgi = get_irn_dbg_info(n);
3526 ir_node *block = get_nodes_block(n);
3527 return new_rd_And(dbgi, block, or_right, b, mode);
3528 } else if (complement_values(or_right, b)) {
3529 /* (a|b) & ~b => a & ~b */
3530 dbg_info *dbgi = get_irn_dbg_info(n);
3531 ir_node *block = get_nodes_block(n);
3532 return new_rd_And(dbgi, block, or_left, b, mode);
3533 } else if (is_Not(b)) {
3534 ir_node *op = get_Not_op(b);
3536 ir_node *ba = get_And_left(op);
3537 ir_node *bb = get_And_right(op);
3539 /* it's enough to test the following cases due to normalization! */
3540 if (or_left == ba && or_right == bb) {
3541 /* (a|b) & ~(a&b) = a^b */
3542 ir_node *block = get_nodes_block(n);
3544 n = new_rd_Eor(get_irn_dbg_info(n), block, ba, bb, mode);
3545 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
3551 if (is_Or(b) || is_Or_Eor_Add(b)) {
3552 ir_node *or_left = get_binop_left(b);
3553 ir_node *or_right = get_binop_right(b);
3554 if (complement_values(or_left, a)) {
3555 /* (a|b) & ~a => b & ~a */
3556 dbg_info *dbgi = get_irn_dbg_info(n);
3557 ir_node *block = get_nodes_block(n);
3558 return new_rd_And(dbgi, block, or_right, a, mode);
3559 } else if (complement_values(or_right, a)) {
3560 /* (a|b) & ~b => a & ~b */
3561 dbg_info *dbgi = get_irn_dbg_info(n);
3562 ir_node *block = get_nodes_block(n);
3563 return new_rd_And(dbgi, block, or_left, a, mode);
3564 } else if (is_Not(a)) {
3565 ir_node *op = get_Not_op(a);
3567 ir_node *aa = get_And_left(op);
3568 ir_node *ab = get_And_right(op);
3570 /* it's enough to test the following cases due to normalization! */
3571 if (or_left == aa && or_right == ab) {
3572 /* (a|b) & ~(a&b) = a^b */
3573 ir_node *block = get_nodes_block(n);
3575 n = new_rd_Eor(get_irn_dbg_info(n), block, aa, ab, mode);
3576 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
3582 if (is_Eor(a) || is_Or_Eor_Add(a)) {
3583 ir_node *al = get_binop_left(a);
3584 ir_node *ar = get_binop_right(a);
3587 /* (b ^ a) & b -> ~a & b */
3588 dbg_info *dbg = get_irn_dbg_info(n);
3589 ir_node *block = get_nodes_block(n);
3591 ar = new_rd_Not(dbg, block, ar, mode);
3592 n = new_rd_And(dbg, block, ar, b, mode);
3593 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3597 /* (a ^ b) & b -> ~a & b */
3598 dbg_info *dbg = get_irn_dbg_info(n);
3599 ir_node *block = get_nodes_block(n);
3601 al = new_rd_Not(dbg, block, al, mode);
3602 n = new_rd_And(dbg, block, al, b, mode);
3603 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3607 if (is_Eor(b) || is_Or_Eor_Add(b)) {
3608 ir_node *bl = get_binop_left(b);
3609 ir_node *br = get_binop_right(b);
3612 /* a & (a ^ b) -> a & ~b */
3613 dbg_info *dbg = get_irn_dbg_info(n);
3614 ir_node *block = get_nodes_block(n);
3616 br = new_rd_Not(dbg, block, br, mode);
3617 n = new_rd_And(dbg, block, br, a, mode);
3618 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3622 /* a & (b ^ a) -> a & ~b */
3623 dbg_info *dbg = get_irn_dbg_info(n);
3624 ir_node *block = get_nodes_block(n);
3626 bl = new_rd_Not(dbg, block, bl, mode);
3627 n = new_rd_And(dbg, block, bl, a, mode);
3628 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3632 if (is_Not(a) && is_Not(b)) {
3633 /* ~a & ~b = ~(a|b) */
3634 ir_node *block = get_nodes_block(n);
3635 ir_mode *mode = get_irn_mode(n);
3639 n = new_rd_Or(get_irn_dbg_info(n), block, a, b, mode);
3640 n = new_rd_Not(get_irn_dbg_info(n), block, n, mode);
3641 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
3646 vrp_attr *b_vrp = vrp_get_info(b);
3647 ir_tarval *a_val = get_Const_tarval(a);
3648 if (b_vrp != NULL && tarval_or(a_val, b_vrp->bits_not_set) == a_val) {
3654 vrp_attr *a_vrp = vrp_get_info(a);
3655 ir_tarval *b_val = get_Const_tarval(b);
3656 if (a_vrp != NULL && tarval_or(b_val, a_vrp->bits_not_set) == b_val) {
3661 n = transform_bitwise_distributive(n, transform_node_And);
3663 n = transform_node_bitop_shift(n);
3671 static ir_node *transform_node_Not(ir_node *n)
3673 ir_node *c, *oldn = n;
3674 ir_node *a = get_Not_op(n);
3675 ir_mode *mode = get_irn_mode(n);
3677 HANDLE_UNOP_PHI(tarval_not,a,c);
3679 /* check for a boolean Not */
3681 dbg_info *dbgi = get_irn_dbg_info(a);
3682 ir_node *block = get_nodes_block(a);
3683 ir_relation relation = get_Cmp_relation(a);
3684 relation = get_negated_relation(relation);
3685 n = new_rd_Cmp(dbgi, block, get_Cmp_left(a), get_Cmp_right(a), relation);
3686 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP);
3690 /* normalize ~(a ^ b) => a ^ ~b */
3691 if (is_Eor(a) || is_Or_Eor_Add(a)) {
3692 dbg_info *dbg = get_irn_dbg_info(n);
3693 ir_node *block = get_nodes_block(n);
3694 ir_node *eor_right = get_binop_right(a);
3695 ir_node *eor_left = get_binop_left(a);
3696 eor_right = new_rd_Not(dbg, block, eor_right, mode);
3697 n = new_rd_Eor(dbg, block, eor_left, eor_right, mode);
3701 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3702 if (is_Minus(a)) { /* ~-x -> x + -1 */
3703 dbg_info *dbg = get_irn_dbg_info(n);
3704 ir_graph *irg = get_irn_irg(n);
3705 ir_node *block = get_nodes_block(n);
3706 ir_node *add_l = get_Minus_op(a);
3707 ir_node *add_r = new_rd_Const(dbg, irg, get_mode_minus_one(mode));
3708 n = new_rd_Add(dbg, block, add_l, add_r, mode);
3709 } else if (is_Add(a) || is_Or_Eor_Add(a)) {
3710 ir_node *add_r = get_binop_right(a);
3711 if (is_Const(add_r) && is_Const_all_one(add_r)) {
3712 /* ~(x + -1) = -x */
3713 ir_node *op = get_binop_left(a);
3714 ir_node *blk = get_nodes_block(n);
3715 n = new_rd_Minus(get_irn_dbg_info(n), blk, op, get_irn_mode(n));
3716 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_MINUS_1);
3724 * Transform a Minus.
3728 * -(a >>u (size-1)) = a >>s (size-1)
3729 * -(a >>s (size-1)) = a >>u (size-1)
3730 * -(a * const) -> a * -const
3732 static ir_node *transform_node_Minus(ir_node *n)
3734 ir_node *c, *oldn = n;
3735 ir_node *a = get_Minus_op(n);
3738 HANDLE_UNOP_PHI(tarval_neg,a,c);
3740 mode = get_irn_mode(a);
3741 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3742 /* the following rules are only to twos-complement */
3745 ir_node *op = get_Not_op(a);
3746 ir_tarval *tv = get_mode_one(mode);
3747 ir_node *blk = get_nodes_block(n);
3748 ir_graph *irg = get_irn_irg(blk);
3749 ir_node *c = new_r_Const(irg, tv);
3750 n = new_rd_Add(get_irn_dbg_info(n), blk, op, c, mode);
3751 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_NOT);
3755 ir_node *c = get_Shr_right(a);
3758 ir_tarval *tv = get_Const_tarval(c);
3760 if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) {
3761 /* -(a >>u (size-1)) = a >>s (size-1) */
3762 ir_node *v = get_Shr_left(a);
3764 n = new_rd_Shrs(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode);
3765 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3771 ir_node *c = get_Shrs_right(a);
3774 ir_tarval *tv = get_Const_tarval(c);
3776 if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) {
3777 /* -(a >>s (size-1)) = a >>u (size-1) */
3778 ir_node *v = get_Shrs_left(a);
3780 n = new_rd_Shr(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode);
3781 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3788 /* - (a-b) = b - a */
3789 ir_node *la = get_Sub_left(a);
3790 ir_node *ra = get_Sub_right(a);
3791 ir_node *blk = get_nodes_block(n);
3793 n = new_rd_Sub(get_irn_dbg_info(n), blk, ra, la, mode);
3794 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_SUB);
3798 if (is_Mul(a)) { /* -(a * const) -> a * -const */
3799 ir_node *mul_l = get_Mul_left(a);
3800 ir_node *mul_r = get_Mul_right(a);
3801 ir_tarval *tv = value_of(mul_r);
3802 if (tv != tarval_bad) {
3803 tv = tarval_neg(tv);
3804 if (tv != tarval_bad) {
3805 ir_graph *irg = get_irn_irg(n);
3806 ir_node *cnst = new_r_Const(irg, tv);
3807 dbg_info *dbg = get_irn_dbg_info(a);
3808 ir_node *block = get_nodes_block(a);
3809 n = new_rd_Mul(dbg, block, mul_l, cnst, mode);
3810 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_MUL_C);
3820 * Transform a Proj(Load) with a non-null address.
3822 static ir_node *transform_node_Proj_Load(ir_node *proj)
3824 if (get_irn_mode(proj) == mode_X) {
3825 ir_node *load = get_Proj_pred(proj);
3827 /* get the Load address */
3828 const ir_node *addr = get_Load_ptr(load);
3829 const ir_node *confirm;
3831 if (value_not_null(addr, &confirm)) {
3832 if (confirm == NULL) {
3833 /* this node may float if it did not depend on a Confirm */
3834 set_irn_pinned(load, op_pin_state_floats);
3836 if (get_Proj_proj(proj) == pn_Load_X_except) {
3837 ir_graph *irg = get_irn_irg(proj);
3838 DBG_OPT_EXC_REM(proj);
3839 return new_r_Bad(irg, mode_X);
3841 ir_node *blk = get_nodes_block(load);
3842 return new_r_Jmp(blk);
3850 * Transform a Proj(Store) with a non-null address.
3852 static ir_node *transform_node_Proj_Store(ir_node *proj)
3854 if (get_irn_mode(proj) == mode_X) {
3855 ir_node *store = get_Proj_pred(proj);
3857 /* get the load/store address */
3858 const ir_node *addr = get_Store_ptr(store);
3859 const ir_node *confirm;
3861 if (value_not_null(addr, &confirm)) {
3862 if (confirm == NULL) {
3863 /* this node may float if it did not depend on a Confirm */
3864 set_irn_pinned(store, op_pin_state_floats);
3866 if (get_Proj_proj(proj) == pn_Store_X_except) {
3867 ir_graph *irg = get_irn_irg(proj);
3868 DBG_OPT_EXC_REM(proj);
3869 return new_r_Bad(irg, mode_X);
3871 ir_node *blk = get_nodes_block(store);
3872 return new_r_Jmp(blk);
3880 * Transform a Proj(Div) with a non-zero value.
3881 * Removes the exceptions and routes the memory to the NoMem node.
3883 static ir_node *transform_node_Proj_Div(ir_node *proj)
3885 ir_node *div = get_Proj_pred(proj);
3886 ir_node *b = get_Div_right(div);
3887 ir_node *res, *new_mem;
3888 const ir_node *confirm;
3891 if (value_not_zero(b, &confirm)) {
3892 /* div(x, y) && y != 0 */
3893 if (confirm == NULL) {
3894 /* we are sure we have a Const != 0 */
3895 new_mem = get_Div_mem(div);
3896 new_mem = skip_Pin(new_mem);
3897 set_Div_mem(div, new_mem);
3898 set_irn_pinned(div, op_pin_state_floats);
3901 proj_nr = get_Proj_proj(proj);
3903 case pn_Div_X_regular:
3904 return new_r_Jmp(get_nodes_block(div));
3906 case pn_Div_X_except: {
3907 ir_graph *irg = get_irn_irg(proj);
3908 /* we found an exception handler, remove it */
3909 DBG_OPT_EXC_REM(proj);
3910 return new_r_Bad(irg, mode_X);
3914 ir_graph *irg = get_irn_irg(proj);
3915 res = get_Div_mem(div);
3916 new_mem = get_irg_no_mem(irg);
3919 /* This node can only float up to the Confirm block */
3920 new_mem = new_r_Pin(get_nodes_block(confirm), new_mem);
3922 set_irn_pinned(div, op_pin_state_floats);
3923 /* this is a Div without exception, we can remove the memory edge */
3924 set_Div_mem(div, new_mem);
3933 * Transform a Proj(Mod) with a non-zero value.
3934 * Removes the exceptions and routes the memory to the NoMem node.
3936 static ir_node *transform_node_Proj_Mod(ir_node *proj)
3938 ir_node *mod = get_Proj_pred(proj);
3939 ir_node *b = get_Mod_right(mod);
3940 ir_node *res, *new_mem;
3941 const ir_node *confirm;
3944 if (value_not_zero(b, &confirm)) {
3945 /* mod(x, y) && y != 0 */
3946 proj_nr = get_Proj_proj(proj);
3948 if (confirm == NULL) {
3949 /* we are sure we have a Const != 0 */
3950 new_mem = get_Mod_mem(mod);
3951 new_mem = skip_Pin(new_mem);
3952 set_Mod_mem(mod, new_mem);
3953 set_irn_pinned(mod, op_pin_state_floats);
3958 case pn_Mod_X_regular:
3959 return new_r_Jmp(get_nodes_block(mod));
3961 case pn_Mod_X_except: {
3962 ir_graph *irg = get_irn_irg(proj);
3963 /* we found an exception handler, remove it */
3964 DBG_OPT_EXC_REM(proj);
3965 return new_r_Bad(irg, mode_X);
3969 ir_graph *irg = get_irn_irg(proj);
3970 res = get_Mod_mem(mod);
3971 new_mem = get_irg_no_mem(irg);
3974 /* This node can only float up to the Confirm block */
3975 new_mem = new_r_Pin(get_nodes_block(confirm), new_mem);
3977 /* this is a Mod without exception, we can remove the memory edge */
3978 set_Mod_mem(mod, new_mem);
3982 if (get_Mod_left(mod) == b) {
3983 /* a % a = 0 if a != 0 */
3984 ir_graph *irg = get_irn_irg(proj);
3985 ir_mode *mode = get_irn_mode(proj);
3986 ir_node *res = new_r_Const(irg, get_mode_null(mode));
3988 DBG_OPT_CSTEVAL(mod, res);
3997 * return true if the operation returns a value with exactly 1 bit set
3999 static bool is_single_bit(const ir_node *node)
4001 /* a first implementation, could be extended with vrp and others... */
4003 ir_node *shl_l = get_Shl_left(node);
4004 ir_mode *mode = get_irn_mode(node);
4005 int modulo = get_mode_modulo_shift(mode);
4006 /* this works if we shift a 1 and we have modulo shift */
4007 if (is_Const(shl_l) && is_Const_one(shl_l)
4008 && 0 < modulo && modulo <= (int)get_mode_size_bits(mode)) {
4011 } else if (is_Const(node)) {
4012 ir_tarval *tv = get_Const_tarval(node);
4013 return tarval_is_single_bit(tv);
4019 * checks if node just flips a bit in another node and returns that other node
4020 * if so. @p tv should be a value having just 1 bit set
4022 static ir_node *flips_bit(const ir_node *node, ir_tarval *tv)
4025 return get_Not_op(node);
4027 ir_node *right = get_Eor_right(node);
4028 if (is_Const(right)) {
4029 ir_tarval *right_tv = get_Const_tarval(right);
4030 ir_mode *mode = get_irn_mode(node);
4031 if (tarval_and(right_tv, tv) != get_mode_null(mode))
4032 return get_Eor_left(node);
4039 * Normalizes and optimizes Cmp nodes.
4041 static ir_node *transform_node_Cmp(ir_node *n)
4043 ir_node *left = get_Cmp_left(n);
4044 ir_node *right = get_Cmp_right(n);
4045 ir_mode *mode = get_irn_mode(left);
4046 ir_tarval *tv = NULL;
4047 bool changed = false;
4048 bool changedc = false;
4049 ir_relation relation = get_Cmp_relation(n);
4050 ir_relation possible = ir_get_possible_cmp_relations(left, right);
4052 /* mask out impossible relations */
4053 ir_relation new_relation = relation & possible;
4054 if (new_relation != relation) {
4055 relation = new_relation;
4059 /* Remove unnecessary conversions */
4060 if (!mode_is_float(mode)
4061 || be_get_backend_param()->mode_float_arithmetic == NULL) {
4062 if (is_Conv(left) && is_Conv(right)) {
4063 ir_node *op_left = get_Conv_op(left);
4064 ir_node *op_right = get_Conv_op(right);
4065 ir_mode *mode_left = get_irn_mode(op_left);
4066 ir_mode *mode_right = get_irn_mode(op_right);
4068 if (smaller_mode(mode_left, mode) && smaller_mode(mode_right, mode)
4069 && mode_left != mode_b && mode_right != mode_b) {
4070 ir_node *block = get_nodes_block(n);
4072 if (mode_left == mode_right) {
4076 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV_CONV);
4077 } else if (smaller_mode(mode_left, mode_right)) {
4078 left = new_r_Conv(block, op_left, mode_right);
4081 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4082 } else if (smaller_mode(mode_right, mode_left)) {
4084 right = new_r_Conv(block, op_right, mode_left);
4086 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4088 mode = get_irn_mode(left);
4091 if (is_Conv(left) && is_Const(right)) {
4092 ir_node *op_left = get_Conv_op(left);
4093 ir_mode *mode_left = get_irn_mode(op_left);
4094 if (smaller_mode(mode_left, mode) && mode_left != mode_b) {
4095 ir_tarval *tv = get_Const_tarval(right);
4096 tarval_int_overflow_mode_t last_mode
4097 = tarval_get_integer_overflow_mode();
4099 tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD);
4100 new_tv = tarval_convert_to(tv, mode_left);
4101 tarval_set_integer_overflow_mode(last_mode);
4102 if (new_tv != tarval_bad) {
4103 ir_graph *irg = get_irn_irg(n);
4105 right = new_r_Const(irg, new_tv);
4106 mode = get_irn_mode(left);
4108 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4115 * Optimize -a CMP -b into b CMP a.
4116 * This works only for modes where unary Minus cannot Overflow.
4117 * Note that two-complement integers can Overflow so it will NOT work.
4119 if (!mode_overflow_on_unary_Minus(mode) &&
4120 is_Minus(left) && is_Minus(right)) {
4121 left = get_Minus_op(left);
4122 right = get_Minus_op(right);
4123 relation = get_inversed_relation(relation);
4125 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4128 /* remove operation on both sides if possible */
4129 if (relation == ir_relation_equal || relation == ir_relation_less_greater) {
4131 * The following operations are NOT safe for floating point operations, for instance
4132 * 1.0 + inf == 2.0 + inf, =/=> x == y
4134 if (mode_is_int(mode)) {
4135 unsigned lop = get_irn_opcode(left);
4137 if (lop == get_irn_opcode(right)) {
4138 ir_node *ll, *lr, *rl, *rr;
4140 /* same operation on both sides, try to remove */
4144 /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */
4145 left = get_unop_op(left);
4146 right = get_unop_op(right);
4148 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4151 ll = get_Add_left(left);
4152 lr = get_Add_right(left);
4153 rl = get_Add_left(right);
4154 rr = get_Add_right(right);
4157 /* X + a CMP X + b ==> a CMP b */
4161 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4162 } else if (ll == rr) {
4163 /* X + a CMP b + X ==> a CMP b */
4167 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4168 } else if (lr == rl) {
4169 /* a + X CMP X + b ==> a CMP b */
4173 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4174 } else if (lr == rr) {
4175 /* a + X CMP b + X ==> a CMP b */
4179 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4183 ll = get_Sub_left(left);
4184 lr = get_Sub_right(left);
4185 rl = get_Sub_left(right);
4186 rr = get_Sub_right(right);
4189 /* X - a CMP X - b ==> a CMP b */
4193 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4194 } else if (lr == rr) {
4195 /* a - X CMP b - X ==> a CMP b */
4199 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4203 if (get_Rotl_right(left) == get_Rotl_right(right)) {
4204 /* a ROTL X CMP b ROTL X ==> a CMP b */
4205 left = get_Rotl_left(left);
4206 right = get_Rotl_left(right);
4208 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4216 /* X+A == A, A+X == A, A-X == A -> X == 0 */
4217 if (is_Add(left) || is_Sub(left) || is_Or_Eor_Add(left)) {
4218 ir_node *ll = get_binop_left(left);
4219 ir_node *lr = get_binop_right(left);
4221 if (lr == right && (is_Add(left) || is_Or_Eor_Add(left))) {
4227 ir_graph *irg = get_irn_irg(n);
4229 right = create_zero_const(irg, mode);
4231 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4234 if (is_Add(right) || is_Sub(right) || is_Or_Eor_Add(right)) {
4235 ir_node *rl = get_binop_left(right);
4236 ir_node *rr = get_binop_right(right);
4238 if (rr == left && (is_Add(right) || is_Or_Eor_Add(right))) {
4244 ir_graph *irg = get_irn_irg(n);
4246 right = create_zero_const(irg, mode);
4248 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4252 if (is_And(left) && is_Const(right)) {
4253 ir_node *ll = get_binop_left(left);
4254 ir_node *lr = get_binop_right(left);
4255 if (is_Shr(ll) && is_Const(lr)) {
4256 /* Cmp((x >>u c1) & c2, c3) = Cmp(x & (c2 << c1), c3 << c1) */
4257 ir_node *block = get_nodes_block(n);
4258 ir_mode *mode = get_irn_mode(left);
4260 ir_node *llr = get_Shr_right(ll);
4261 if (is_Const(llr)) {
4262 dbg_info *dbg = get_irn_dbg_info(left);
4263 ir_graph *irg = get_irn_irg(left);
4265 ir_tarval *c1 = get_Const_tarval(llr);
4266 ir_tarval *c2 = get_Const_tarval(lr);
4267 ir_tarval *c3 = get_Const_tarval(right);
4268 ir_tarval *mask = tarval_shl(c2, c1);
4269 ir_tarval *value = tarval_shl(c3, c1);
4271 left = new_rd_And(dbg, block, get_Shr_left(ll), new_r_Const(irg, mask), mode);
4272 right = new_r_Const(irg, value);
4277 /* Cmp(Eor(x, y), 0) <=> Cmp(x, y) at least for the ==0,!=0
4279 if (is_Const(right) && is_Const_null(right) &&
4280 (is_Eor(left) || is_Or_Eor_Add(left))) {
4281 right = get_Eor_right(left);
4282 left = get_Eor_left(left);
4288 if (mode_is_int(mode) && is_And(left)) {
4289 /* a complicated Cmp(And(1bit, val), 1bit) "bit-testing" can be replaced
4290 * by the simpler Cmp(And(1bit, val), 0) negated pnc */
4291 if (relation == ir_relation_equal
4292 || (mode_is_signed(mode) && relation == ir_relation_less_greater)
4293 || (!mode_is_signed(mode) && (relation & ir_relation_less_equal) == ir_relation_less)) {
4294 ir_node *and0 = get_And_left(left);
4295 ir_node *and1 = get_And_right(left);
4296 if (and1 == right) {
4297 ir_node *tmp = and0;
4301 if (and0 == right && is_single_bit(and0)) {
4302 ir_graph *irg = get_irn_irg(n);
4304 relation == ir_relation_equal ? ir_relation_less_greater
4305 : ir_relation_equal;
4306 right = create_zero_const(irg, mode);
4312 if (is_Const(right) && is_Const_null(right) &&
4313 (relation == ir_relation_equal
4314 || (relation == ir_relation_less_greater)
4315 || (!mode_is_signed(mode) && relation == ir_relation_greater))) {
4317 /* instead of flipping the bit before the bit-test operation negate
4319 ir_node *and0 = get_And_left(left);
4320 ir_node *and1 = get_And_right(left);
4321 if (is_Const(and1)) {
4322 ir_tarval *tv = get_Const_tarval(and1);
4323 if (tarval_is_single_bit(tv)) {
4324 ir_node *flipped = flips_bit(and0, tv);
4325 if (flipped != NULL) {
4326 dbg_info *dbgi = get_irn_dbg_info(left);
4327 ir_node *block = get_nodes_block(left);
4328 relation = get_negated_relation(relation);
4329 left = new_rd_And(dbgi, block, flipped, and1, mode);
4338 /* replace mode_b compares with ands/ors */
4339 if (mode == mode_b) {
4340 ir_node *block = get_nodes_block(n);
4344 case ir_relation_less_equal:
4345 bres = new_r_Or(block, new_r_Not(block, left, mode_b), right, mode_b);
4347 case ir_relation_less:
4348 bres = new_r_And(block, new_r_Not(block, left, mode_b), right, mode_b);
4350 case ir_relation_greater_equal:
4351 bres = new_r_Or(block, left, new_r_Not(block, right, mode_b), mode_b);
4353 case ir_relation_greater:
4354 bres = new_r_And(block, left, new_r_Not(block, right, mode_b), mode_b);
4356 case ir_relation_less_greater:
4357 bres = new_r_Eor(block, left, right, mode_b);
4359 case ir_relation_equal:
4360 bres = new_r_Not(block, new_r_Eor(block, left, right, mode_b), mode_b);
4363 #ifdef DEBUG_libfirm
4364 ir_fprintf(stderr, "Optimisation warning, unexpected mode_b Cmp %+F\n", n);
4369 DBG_OPT_ALGSIM0(n, bres, FS_OPT_CMP_TO_BOOL);
4375 * First step: normalize the compare op
4376 * by placing the constant on the right side
4377 * or moving the lower address node to the left.
4379 if (!operands_are_normalized(left, right)) {
4384 relation = get_inversed_relation(relation);
4389 * Second step: Try to reduce the magnitude
4390 * of a constant. This may help to generate better code
4391 * later and may help to normalize more compares.
4392 * Of course this is only possible for integer values.
4394 tv = value_of(right);
4395 if (tv != tarval_bad) {
4396 ir_mode *mode = get_irn_mode(right);
4398 /* cmp(mux(x, cf, ct), c2) can be eliminated:
4399 * cmp(ct,c2) | cmp(cf,c2) | result
4400 * -----------|------------|--------
4401 * true | true | True
4402 * false | false | False
4404 * false | true | not(x)
4407 ir_node *mux_true = get_Mux_true(left);
4408 ir_node *mux_false = get_Mux_false(left);
4409 if (is_Const(mux_true) && is_Const(mux_false)) {
4410 /* we can fold true/false constant separately */
4411 ir_tarval *tv_true = get_Const_tarval(mux_true);
4412 ir_tarval *tv_false = get_Const_tarval(mux_false);
4413 ir_relation r_true = tarval_cmp(tv_true, tv);
4414 ir_relation r_false = tarval_cmp(tv_false, tv);
4415 if (r_true != ir_relation_false
4416 || r_false != ir_relation_false) {
4417 bool rel_true = (r_true & relation) != 0;
4418 bool rel_false = (r_false & relation) != 0;
4419 ir_node *cond = get_Mux_sel(left);
4420 if (rel_true == rel_false) {
4421 relation = rel_true ? ir_relation_true
4422 : ir_relation_false;
4423 } else if (rel_true) {
4426 dbg_info *dbgi = get_irn_dbg_info(n);
4427 ir_node *block = get_nodes_block(n);
4428 ir_node *notn = new_rd_Not(dbgi, block, cond, mode_b);
4435 /* TODO extend to arbitrary constants */
4436 if (is_Conv(left) && tarval_is_null(tv)) {
4437 ir_node *op = get_Conv_op(left);
4438 ir_mode *op_mode = get_irn_mode(op);
4441 * UpConv(x) REL 0 ==> x REL 0
4442 * Don't do this for float values as it's unclear whether it is a
4443 * win. (on the other side it makes detection/creation of fabs hard)
4445 if (get_mode_size_bits(mode) > get_mode_size_bits(op_mode) &&
4446 ((relation == ir_relation_equal || relation == ir_relation_less_greater) ||
4447 mode_is_signed(mode) || !mode_is_signed(op_mode)) &&
4448 !mode_is_float(mode)) {
4449 tv = get_mode_null(op_mode);
4453 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4457 if (tv != tarval_bad) {
4458 /* the following optimization is possible on modes without Overflow
4459 * on Unary Minus or on == and !=:
4460 * -a CMP c ==> a swap(CMP) -c
4462 * Beware: for two-complement Overflow may occur, so only == and != can
4463 * be optimized, see this:
4464 * -MININT < 0 =/=> MININT > 0 !!!
4466 if (is_Minus(left) &&
4467 (!mode_overflow_on_unary_Minus(mode) ||
4468 (mode_is_int(mode) && (relation == ir_relation_equal || relation == ir_relation_less_greater)))) {
4469 tv = tarval_neg(tv);
4471 if (tv != tarval_bad) {
4472 left = get_Minus_op(left);
4473 relation = get_inversed_relation(relation);
4475 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4477 } else if (is_Not(left) && (relation == ir_relation_equal || relation == ir_relation_less_greater)) {
4478 /* Not(a) ==/!= c ==> a ==/!= Not(c) */
4479 tv = tarval_not(tv);
4481 if (tv != tarval_bad) {
4482 left = get_Not_op(left);
4484 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4488 /* for integer modes, we have more */
4489 if (mode_is_int(mode) && !is_Const(left)) {
4490 /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */
4491 if ((relation == ir_relation_less || relation == ir_relation_greater_equal) &&
4492 tarval_cmp(tv, get_mode_null(mode)) == ir_relation_greater) {
4493 tv = tarval_sub(tv, get_mode_one(mode), NULL);
4495 if (tv != tarval_bad) {
4496 relation ^= ir_relation_equal;
4498 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4501 /* c < 0 : a > c ==> a >= (c+1) a <= c ==> a < (c+1) */
4502 else if ((relation == ir_relation_greater || relation == ir_relation_less_equal) &&
4503 tarval_cmp(tv, get_mode_null(mode)) == ir_relation_less) {
4504 tv = tarval_add(tv, get_mode_one(mode));
4506 if (tv != tarval_bad) {
4507 relation ^= ir_relation_equal;
4509 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4513 /* the following reassociations work only for == and != */
4514 if (relation == ir_relation_equal || relation == ir_relation_less_greater) {
4515 if (tv != tarval_bad) {
4516 /* a-c1 == c2 ==> a == c2+c1, a-c1 != c2 ==> a != c2+c1 */
4518 ir_node *c1 = get_Sub_right(left);
4519 ir_tarval *tv2 = value_of(c1);
4521 if (tv2 != tarval_bad) {
4522 tv2 = tarval_add(tv, value_of(c1));
4524 if (tv2 != tarval_bad) {
4525 left = get_Sub_left(left);
4528 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4532 /* a+c1 == c2 ==> a == c2-c1, a+c1 != c2 ==> a != c2-c1 */
4533 else if (is_Add(left) || is_Or_Eor_Add(left)) {
4534 ir_node *a_l = get_binop_left(left);
4535 ir_node *a_r = get_binop_right(left);
4539 if (is_Const(a_l)) {
4541 tv2 = value_of(a_l);
4544 tv2 = value_of(a_r);
4547 if (tv2 != tarval_bad) {
4548 tv2 = tarval_sub(tv, tv2, NULL);
4550 if (tv2 != tarval_bad) {
4554 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4558 /* -a == c ==> a == -c, -a != c ==> a != -c */
4559 else if (is_Minus(left)) {
4560 ir_tarval *tv2 = tarval_sub(get_mode_null(mode), tv, NULL);
4562 if (tv2 != tarval_bad) {
4563 left = get_Minus_op(left);
4566 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4573 if (relation == ir_relation_equal || relation == ir_relation_less_greater) {
4574 switch (get_irn_opcode(left)) {
4578 c1 = get_And_right(left);
4581 * And(x, C1) == C2 ==> FALSE if C2 & C1 != C2
4582 * And(x, C1) != C2 ==> TRUE if C2 & C1 != C2
4584 ir_tarval *mask = tarval_and(get_Const_tarval(c1), tv);
4586 /* TODO: move to constant evaluation */
4587 ir_graph *irg = get_irn_irg(n);
4588 tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true();
4589 c1 = new_r_Const(irg, tv);
4590 DBG_OPT_CSTEVAL(n, c1);
4594 if (tarval_is_single_bit(tv)) {
4596 * optimization for AND:
4598 * And(x, C) == C ==> And(x, C) != 0
4599 * And(x, C) != C ==> And(X, C) == 0
4601 * if C is a single Bit constant.
4604 /* check for Constant's match. We have check hare the tarvals,
4605 because our const might be changed */
4606 if (get_Const_tarval(c1) == tv) {
4607 /* fine: do the transformation */
4608 tv = get_mode_null(get_tarval_mode(tv));
4609 relation ^= ir_relation_less_equal_greater;
4611 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4617 c1 = get_Or_right(left);
4618 if (is_Const(c1) && tarval_is_null(tv)) {
4620 * Or(x, C) == 0 && C != 0 ==> FALSE
4621 * Or(x, C) != 0 && C != 0 ==> TRUE
4623 if (! tarval_is_null(get_Const_tarval(c1))) {
4624 /* TODO: move to constant evaluation */
4625 ir_graph *irg = get_irn_irg(n);
4626 tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true();
4627 c1 = new_r_Const(irg, tv);
4628 DBG_OPT_CSTEVAL(n, c1);
4635 * optimize x << c1 == c into x & (-1 >>u c1) == c >> c1 if c & (-1 << c1) == c
4637 * optimize x << c1 != c into x & (-1 >>u c1) != c >> c1 if c & (-1 << c1) == c
4640 c1 = get_Shl_right(left);
4642 ir_graph *irg = get_irn_irg(c1);
4643 ir_tarval *tv1 = get_Const_tarval(c1);
4644 ir_mode *mode = get_irn_mode(left);
4645 ir_tarval *minus1 = get_mode_all_one(mode);
4646 ir_tarval *amask = tarval_shr(minus1, tv1);
4647 ir_tarval *cmask = tarval_shl(minus1, tv1);
4650 if (tarval_and(tv, cmask) != tv) {
4651 /* condition not met */
4652 tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true();
4653 c1 = new_r_Const(irg, tv);
4654 DBG_OPT_CSTEVAL(n, c1);
4657 sl = get_Shl_left(left);
4658 blk = get_nodes_block(n);
4659 left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode);
4660 tv = tarval_shr(tv, tv1);
4662 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4667 * optimize x >>u c1 == c into x & (-1 << c1) == c << c1 if c & (-1 >>u c1) == c
4669 * optimize x >>u c1 != c into x & (-1 << c1) != c << c1 if c & (-1 >>u c1) == c
4672 c1 = get_Shr_right(left);
4674 ir_graph *irg = get_irn_irg(c1);
4675 ir_tarval *tv1 = get_Const_tarval(c1);
4676 ir_mode *mode = get_irn_mode(left);
4677 ir_tarval *minus1 = get_mode_all_one(mode);
4678 ir_tarval *amask = tarval_shl(minus1, tv1);
4679 ir_tarval *cmask = tarval_shr(minus1, tv1);
4682 if (tarval_and(tv, cmask) != tv) {
4683 /* condition not met */
4684 tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true();
4685 c1 = new_r_Const(irg, tv);
4686 DBG_OPT_CSTEVAL(n, c1);
4689 sl = get_Shr_left(left);
4690 blk = get_nodes_block(n);
4691 left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode);
4692 tv = tarval_shl(tv, tv1);
4694 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4699 * optimize x >>s c1 == c into x & (-1 << c1) == c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4701 * optimize x >>s c1 != c into x & (-1 << c1) != c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4704 c1 = get_Shrs_right(left);
4706 ir_graph *irg = get_irn_irg(c1);
4707 ir_tarval *tv1 = get_Const_tarval(c1);
4708 ir_mode *mode = get_irn_mode(left);
4709 ir_tarval *minus1 = get_mode_all_one(mode);
4710 ir_tarval *amask = tarval_shl(minus1, tv1);
4711 ir_tarval *cond = new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(tv1));
4714 cond = tarval_sub(cond, tv1, NULL);
4715 cond = tarval_shrs(tv, cond);
4717 if (!tarval_is_all_one(cond) && !tarval_is_null(cond)) {
4718 /* condition not met */
4719 tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true();
4720 c1 = new_r_Const(irg, tv);
4721 DBG_OPT_CSTEVAL(n, c1);
4724 sl = get_Shrs_left(left);
4725 blk = get_nodes_block(n);
4726 left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode);
4727 tv = tarval_shl(tv, tv1);
4729 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4737 if (changedc) { /* need a new Const */
4738 ir_graph *irg = get_irn_irg(n);
4739 right = new_r_Const(irg, tv);
4743 if ((relation == ir_relation_equal || relation == ir_relation_less_greater) && is_Const(right) && is_Const_null(right) && is_Proj(left)) {
4744 ir_node *op = get_Proj_pred(left);
4746 if (is_Mod(op) && get_Proj_proj(left) == pn_Mod_res) {
4747 ir_node *c = get_binop_right(op);
4750 ir_tarval *tv = get_Const_tarval(c);
4752 if (tarval_is_single_bit(tv)) {
4753 /* special case: (x % 2^n) CMP 0 ==> x & (2^n-1) CMP 0 */
4754 ir_node *v = get_binop_left(op);
4755 ir_node *blk = get_nodes_block(op);
4756 ir_graph *irg = get_irn_irg(op);
4757 ir_mode *mode = get_irn_mode(v);
4759 tv = tarval_sub(tv, get_mode_one(mode), NULL);
4760 left = new_rd_And(get_irn_dbg_info(op), blk, v, new_r_Const(irg, tv), mode);
4762 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_MOD_TO_AND);
4769 dbg_info *dbgi = get_irn_dbg_info(n);
4770 ir_node *block = get_nodes_block(n);
4772 /* create a new compare */
4773 n = new_rd_Cmp(dbgi, block, left, right, relation);
4780 * Optimize CopyB(mem, x, x) into a Nop.
4782 static ir_node *transform_node_Proj_CopyB(ir_node *proj)
4784 ir_node *copyb = get_Proj_pred(proj);
4785 ir_node *a = get_CopyB_dst(copyb);
4786 ir_node *b = get_CopyB_src(copyb);
4789 switch (get_Proj_proj(proj)) {
4790 case pn_CopyB_X_regular:
4791 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
4792 DBG_OPT_EXC_REM(proj);
4793 proj = new_r_Jmp(get_nodes_block(copyb));
4795 case pn_CopyB_X_except: {
4796 ir_graph *irg = get_irn_irg(proj);
4797 DBG_OPT_EXC_REM(proj);
4798 proj = new_r_Bad(irg, mode_X);
4809 * Optimize Bounds(idx, idx, upper) into idx.
4811 static ir_node *transform_node_Proj_Bound(ir_node *proj)
4813 ir_node *oldn = proj;
4814 ir_node *bound = get_Proj_pred(proj);
4815 ir_node *idx = get_Bound_index(bound);
4816 ir_node *pred = skip_Proj(idx);
4819 if (idx == get_Bound_lower(bound))
4821 else if (is_Bound(pred)) {
4823 * idx was Bounds checked previously, it is still valid if
4824 * lower <= pred_lower && pred_upper <= upper.
4826 ir_node *lower = get_Bound_lower(bound);
4827 ir_node *upper = get_Bound_upper(bound);
4828 if (get_Bound_lower(pred) == lower &&
4829 get_Bound_upper(pred) == upper) {
4831 * One could expect that we simply return the previous
4832 * Bound here. However, this would be wrong, as we could
4833 * add an exception Proj to a new location then.
4834 * So, we must turn in into a tuple.
4840 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
4841 switch (get_Proj_proj(proj)) {
4843 DBG_OPT_EXC_REM(proj);
4844 proj = get_Bound_mem(bound);
4846 case pn_Bound_X_except:
4847 DBG_OPT_EXC_REM(proj);
4848 proj = new_r_Bad(get_irn_irg(proj), mode_X);
4852 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
4854 case pn_Bound_X_regular:
4855 DBG_OPT_EXC_REM(proj);
4856 proj = new_r_Jmp(get_nodes_block(bound));
4866 * Does all optimizations on nodes that must be done on its Projs
4867 * because of creating new nodes.
4869 static ir_node *transform_node_Proj(ir_node *proj)
4871 ir_node *n = get_Proj_pred(proj);
4873 if (n->op->ops.transform_node_Proj)
4874 return n->op->ops.transform_node_Proj(proj);
4879 * Test whether a block is unreachable
4880 * Note: That this only returns true when
4881 * IR_GRAPH_CONSTRAINT_OPTIMIZE_UNREACHABLE_CODE is set.
4882 * This is important, as you easily end up producing invalid constructs in the
4883 * unreachable code when optimizing away edges into the unreachable code.
4884 * So only set this flag when you iterate localopts to the fixpoint.
4885 * When you reach the fixpoint then all unreachable code is dead
4886 * (= can't be reached by firm edges) and you won't see the invalid constructs
4889 static bool is_block_unreachable(const ir_node *block)
4891 const ir_graph *irg = get_irn_irg(block);
4892 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_OPTIMIZE_UNREACHABLE_CODE))
4894 return get_Block_dom_depth(block) < 0;
4897 static ir_node *transform_node_Block(ir_node *block)
4899 ir_graph *irg = get_irn_irg(block);
4900 int arity = get_irn_arity(block);
4901 ir_node *bad = NULL;
4904 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_OPTIMIZE_UNREACHABLE_CODE))
4907 for (i = 0; i < arity; ++i) {
4908 ir_node *const pred = get_Block_cfgpred(block, i);
4909 if (is_Bad(pred) || !is_block_unreachable(get_nodes_block(pred)))
4912 bad = new_r_Bad(irg, mode_X);
4913 set_irn_n(block, i, bad);
4919 static ir_node *transform_node_Phi(ir_node *phi)
4921 int n = get_irn_arity(phi);
4922 ir_mode *mode = get_irn_mode(phi);
4923 ir_node *block = get_nodes_block(phi);
4924 ir_graph *irg = get_irn_irg(phi);
4925 ir_node *bad = NULL;
4928 /* Set phi-operands for bad-block inputs to bad */
4929 for (i = 0; i < n; ++i) {
4930 if (!is_Bad(get_Phi_pred(phi, i))) {
4931 ir_node *pred = get_Block_cfgpred(block, i);
4932 if (is_Bad(pred) || is_block_unreachable(get_nodes_block(pred))) {
4934 bad = new_r_Bad(irg, mode);
4935 set_irn_n(phi, i, bad);
4940 /* Move Pin nodes down through Phi nodes. */
4941 if (mode == mode_M) {
4942 n = get_irn_arity(phi);
4944 /* Beware of Phi0 */
4948 bool has_pin = false;
4950 NEW_ARR_A(ir_node *, in, n);
4952 for (i = 0; i < n; ++i) {
4953 ir_node *pred = get_irn_n(phi, i);
4956 in[i] = get_Pin_op(pred);
4958 } else if (is_Bad(pred)) {
4968 /* Move the Pin nodes "behind" the Phi. */
4969 new_phi = new_r_Phi(block, n, in, mode_M);
4970 return new_r_Pin(block, new_phi);
4973 /* Move Confirms down through Phi nodes. */
4974 else if (mode_is_reference(mode)) {
4975 n = get_irn_arity(phi);
4977 /* Beware of Phi0 */
4979 ir_node *pred = get_irn_n(phi, 0);
4980 ir_node *bound, *new_phi, **in;
4981 ir_relation relation;
4982 bool has_confirm = false;
4984 if (! is_Confirm(pred))
4987 bound = get_Confirm_bound(pred);
4988 relation = get_Confirm_relation(pred);
4990 NEW_ARR_A(ir_node *, in, n);
4991 in[0] = get_Confirm_value(pred);
4993 for (i = 1; i < n; ++i) {
4994 pred = get_irn_n(phi, i);
4996 if (is_Confirm(pred) &&
4997 get_Confirm_bound(pred) == bound &&
4998 get_Confirm_relation(pred) == relation) {
4999 in[i] = get_Confirm_value(pred);
5001 } else if (is_Bad(pred)) {
5011 /* move the Confirm nodes "behind" the Phi */
5012 new_phi = new_r_Phi(block, n, in, get_irn_mode(phi));
5013 return new_r_Confirm(block, new_phi, bound, relation);
5020 * Optimize (a >> c1) >> c2), works for Shr, Shrs, Shl, Rotl.
5022 * Should be moved to reassociation?
5024 static ir_node *transform_node_shift(ir_node *n)
5026 ir_node *left, *right;
5028 ir_mode *count_mode;
5029 ir_tarval *tv1, *tv2, *res;
5030 ir_node *in[2], *irn, *block;
5034 left = get_binop_left(n);
5036 /* different operations */
5037 if (get_irn_op(left) != get_irn_op(n))
5040 right = get_binop_right(n);
5041 tv1 = value_of(right);
5042 if (tv1 == tarval_bad)
5045 tv2 = value_of(get_binop_right(left));
5046 if (tv2 == tarval_bad)
5049 count_mode = get_tarval_mode(tv1);
5050 if (get_tarval_mode(tv2) != count_mode) {
5051 /* TODO: search bigger mode or something and convert... */
5055 mode = get_irn_mode(n);
5056 modulo_shf = get_mode_modulo_shift(mode);
5058 if (modulo_shf > 0) {
5059 ir_tarval *modulo_mask = new_tarval_from_long(modulo_shf-1, count_mode);
5061 /* I'm not so sure what happens in one complement... */
5062 assert(get_mode_arithmetic(count_mode) == irma_twos_complement);
5063 /* modulo shifts should always be a power of 2 (otherwise modulo_mask
5064 * above will be invalid) */
5065 assert(modulo_shf<=0 || is_po2(modulo_shf));
5067 tv1 = tarval_and(tv1, modulo_mask);
5068 tv2 = tarval_and(tv2, modulo_mask);
5070 res = tarval_add(tv1, tv2);
5071 irg = get_irn_irg(n);
5073 /* beware: a simple replacement works only, if res < modulo shift */
5075 int bits = get_mode_size_bits(mode);
5076 ir_tarval *modulo = new_tarval_from_long(bits, count_mode);
5077 res = tarval_mod(res, modulo);
5079 long bits = get_mode_size_bits(mode);
5080 ir_tarval *mode_size = new_tarval_from_long(bits, count_mode);
5082 /* shifting too much */
5083 if (!(tarval_cmp(res, mode_size) & ir_relation_less)) {
5085 ir_node *block = get_nodes_block(n);
5086 dbg_info *dbgi = get_irn_dbg_info(n);
5087 ir_mode *smode = get_irn_mode(right);
5088 ir_node *cnst = new_r_Const_long(irg, smode, get_mode_size_bits(mode) - 1);
5089 return new_rd_Shrs(dbgi, block, get_binop_left(left), cnst, mode);
5092 return new_r_Const(irg, get_mode_null(mode));
5096 /* ok, we can replace it */
5097 assert(modulo_shf >= (int) get_mode_size_bits(mode));
5098 block = get_nodes_block(n);
5100 in[0] = get_binop_left(left);
5101 in[1] = new_r_Const(irg, res);
5103 irn = new_ir_node(NULL, get_Block_irg(block), block, get_irn_op(n), mode, 2, in);
5105 DBG_OPT_ALGSIM0(n, irn, FS_OPT_REASSOC_SHIFT);
5112 * (x << c1) >> c2 <=> x OP (c2-c1) & ((-1 << c1) >> c2)
5114 * (x >> c1) << c2 <=> x OP (c2-c1) & ((-1 >> c1) << c2)
5115 * (also with x >>s c1 when c1>=c2)
5117 static ir_node *transform_node_shl_shr(ir_node *n)
5120 ir_node *right = get_binop_right(n);
5130 ir_tarval *tv_shift;
5133 ir_relation relation;
5136 assert(is_Shl(n) || is_Shr(n) || is_Shrs(n));
5138 if (!is_Const(right))
5141 left = get_binop_left(n);
5142 mode = get_irn_mode(n);
5143 if (is_Shl(n) && (is_Shr(left) || is_Shrs(left))) {
5144 ir_node *shr_right = get_binop_right(left);
5146 if (!is_Const(shr_right))
5149 x = get_binop_left(left);
5150 tv_shr = get_Const_tarval(shr_right);
5151 tv_shl = get_Const_tarval(right);
5153 if (is_Shrs(left)) {
5154 /* shrs variant only allowed if c1 >= c2 */
5155 if (! (tarval_cmp(tv_shl, tv_shr) & ir_relation_greater_equal))
5158 tv_mask = tarval_shrs(get_mode_all_one(mode), tv_shr);
5161 tv_mask = tarval_shr(get_mode_all_one(mode), tv_shr);
5163 tv_mask = tarval_shl(tv_mask, tv_shl);
5164 } else if (is_Shr(n) && is_Shl(left)) {
5165 ir_node *shl_right = get_Shl_right(left);
5167 if (!is_Const(shl_right))
5170 x = get_Shl_left(left);
5171 tv_shr = get_Const_tarval(right);
5172 tv_shl = get_Const_tarval(shl_right);
5174 tv_mask = tarval_shl(get_mode_all_one(mode), tv_shl);
5175 tv_mask = tarval_shr(tv_mask, tv_shr);
5180 if (get_tarval_mode(tv_shl) != get_tarval_mode(tv_shr)) {
5181 tv_shl = tarval_convert_to(tv_shl, get_tarval_mode(tv_shr));
5184 assert(tv_mask != tarval_bad);
5185 assert(get_tarval_mode(tv_mask) == mode);
5187 block = get_nodes_block(n);
5188 irg = get_irn_irg(block);
5189 dbgi = get_irn_dbg_info(n);
5191 relation = tarval_cmp(tv_shl, tv_shr);
5192 if (relation == ir_relation_less || relation == ir_relation_equal) {
5193 tv_shift = tarval_sub(tv_shr, tv_shl, NULL);
5194 new_const = new_r_Const(irg, tv_shift);
5196 new_shift = new_rd_Shrs(dbgi, block, x, new_const, mode);
5198 new_shift = new_rd_Shr(dbgi, block, x, new_const, mode);
5201 assert(relation == ir_relation_greater);
5202 tv_shift = tarval_sub(tv_shl, tv_shr, NULL);
5203 new_const = new_r_Const(irg, tv_shift);
5204 new_shift = new_rd_Shl(dbgi, block, x, new_const, mode);
5207 new_const = new_r_Const(irg, tv_mask);
5208 new_and = new_rd_And(dbgi, block, new_shift, new_const, mode);
5213 static ir_tarval *get_modulo_tv_value(ir_tarval *tv, int modulo_val)
5215 ir_mode *mode = get_tarval_mode(tv);
5216 ir_tarval *modulo_tv = new_tarval_from_long(modulo_val, mode);
5217 return tarval_mod(tv, modulo_tv);
5220 typedef ir_node*(*new_shift_func)(dbg_info *dbgi, ir_node *block,
5221 ir_node *left, ir_node *right, ir_mode *mode);
5224 * Normalisation: if we have a shl/shr with modulo_shift behaviour
5225 * then we can use that to minimize the value of Add(x, const) or
5226 * Sub(Const, x). In particular this often avoids 1 instruction in some
5227 * backends for the Shift(x, Sub(Const, y)) case because it can be replaced
5228 * by Shift(x, Minus(y)) which does not need an explicit Const constructed.
5230 static ir_node *transform_node_shift_modulo(ir_node *n,
5231 new_shift_func new_shift)
5233 ir_mode *mode = get_irn_mode(n);
5234 int modulo = get_mode_modulo_shift(mode);
5235 ir_node *newop = NULL;
5236 ir_mode *mode_right;
5243 if (get_mode_arithmetic(mode) != irma_twos_complement)
5245 if (!is_po2(modulo))
5248 irg = get_irn_irg(n);
5249 block = get_nodes_block(n);
5250 right = get_binop_right(n);
5251 mode_right = get_irn_mode(right);
5252 if (is_Const(right)) {
5253 ir_tarval *tv = get_Const_tarval(right);
5254 ir_tarval *tv_mod = get_modulo_tv_value(tv, modulo);
5259 newop = new_r_Const(irg, tv_mod);
5260 } else if (is_Add(right) || is_Or_Eor_Add(right)) {
5261 ir_node *add_right = get_binop_right(right);
5262 if (is_Const(add_right)) {
5263 ir_tarval *tv = get_Const_tarval(add_right);
5264 ir_tarval *tv_mod = get_modulo_tv_value(tv, modulo);
5269 newconst = new_r_Const(irg, tv_mod);
5270 newop = new_r_Add(block, get_binop_left(right), newconst,
5273 } else if (is_Sub(right)) {
5274 ir_node *sub_left = get_Sub_left(right);
5275 if (is_Const(sub_left)) {
5276 ir_tarval *tv = get_Const_tarval(sub_left);
5277 ir_tarval *tv_mod = get_modulo_tv_value(tv, modulo);
5282 newconst = new_r_Const(irg, tv_mod);
5283 newop = new_r_Sub(block, newconst, get_Sub_right(right),
5290 if (newop != NULL) {
5291 dbg_info *dbgi = get_irn_dbg_info(n);
5292 ir_node *left = get_binop_left(n);
5293 return new_shift(dbgi, block, left, newop, mode);
5301 static ir_node *transform_node_Shr(ir_node *n)
5303 ir_node *c, *oldn = n;
5304 ir_node *left = get_Shr_left(n);
5305 ir_node *right = get_Shr_right(n);
5306 ir_mode *mode = get_irn_mode(n);
5308 HANDLE_BINOP_PHI((eval_func) tarval_shr, left, right, c, mode);
5309 n = transform_node_shift(n);
5312 n = transform_node_shift_modulo(n, new_rd_Shr);
5314 n = transform_node_shl_shr(n);
5316 n = transform_node_shift_bitop(n);
5324 static ir_node *transform_node_Shrs(ir_node *n)
5327 ir_node *a = get_Shrs_left(n);
5328 ir_node *b = get_Shrs_right(n);
5329 ir_mode *mode = get_irn_mode(n);
5333 if (is_oversize_shift(n)) {
5334 ir_node *block = get_nodes_block(n);
5335 dbg_info *dbgi = get_irn_dbg_info(n);
5336 ir_mode *cmode = get_irn_mode(b);
5337 long val = get_mode_size_bits(cmode)-1;
5338 ir_graph *irg = get_irn_irg(n);
5339 ir_node *cnst = new_r_Const_long(irg, cmode, val);
5340 return new_rd_Shrs(dbgi, block, a, cnst, mode);
5343 HANDLE_BINOP_PHI((eval_func) tarval_shrs, a, b, c, mode);
5344 n = transform_node_shift(n);
5348 n = transform_node_shift_modulo(n, new_rd_Shrs);
5351 n = transform_node_shift_bitop(n);
5355 /* normalisation: use Shr when sign bit is guaranteed to be cleared */
5356 attr = vrp_get_info(a);
5358 unsigned bits = get_mode_size_bits(mode);
5359 ir_tarval *scount = new_tarval_from_long(bits-1, mode_Iu);
5360 ir_tarval *sign = tarval_shl(get_mode_one(mode), scount);
5361 if (tarval_is_null(tarval_and(attr->bits_not_set, sign))) {
5362 dbg_info *dbgi = get_irn_dbg_info(n);
5363 ir_node *block = get_nodes_block(n);
5364 return new_rd_Shr(dbgi, block, a, b, mode);
5374 static ir_node *transform_node_Shl(ir_node *n)
5376 ir_node *c, *oldn = n;
5377 ir_node *a = get_Shl_left(n);
5378 ir_node *b = get_Shl_right(n);
5379 ir_mode *mode = get_irn_mode(n);
5381 HANDLE_BINOP_PHI((eval_func) tarval_shl, a, b, c, mode);
5382 n = transform_node_shift(n);
5385 n = transform_node_shift_modulo(n, new_rd_Shl);
5387 n = transform_node_shl_shr(n);
5389 n = transform_node_shift_bitop(n);
5397 static ir_node *transform_node_Rotl(ir_node *n)
5399 ir_node *c, *oldn = n;
5400 ir_node *a = get_Rotl_left(n);
5401 ir_node *b = get_Rotl_right(n);
5402 ir_mode *mode = get_irn_mode(n);
5404 HANDLE_BINOP_PHI((eval_func) tarval_rotl, a, b, c, mode);
5405 n = transform_node_shift(n);
5408 n = transform_node_shift_bitop(n);
5414 * returns mode size for may_leave_out_middle_mode
5416 static unsigned get_significand_size(ir_mode *mode)
5418 const ir_mode_arithmetic arithmetic = get_mode_arithmetic(mode);
5419 switch (arithmetic) {
5421 case irma_x86_extended_float:
5422 return get_mode_mantissa_size(mode) + 1;
5423 case irma_twos_complement:
5424 return get_mode_size_bits(mode);
5426 panic("Conv node with irma_none mode?");
5428 panic("unexpected mode_arithmetic in get_significand_size");
5432 * Returns true if a conversion from mode @p m0 to @p m1 has the same effect
5433 * as converting from @p m0 to @p m1 and then to @p m2.
5434 * Classifying the 3 modes as the big(b), middle(m) and small(s) mode this
5435 * gives the following truth table:
5436 * s -> b -> m : true
5437 * s -> m -> b : !signed(s) || signed(m)
5438 * m -> b -> s : true
5439 * m -> s -> b : false
5440 * b -> s -> m : false
5441 * b -> m -> s : true
5443 * s -> b -> b : true
5444 * s -> s -> b : false
5446 * additional float constraints:
5448 * F -> I -> I: signedness of Is must match
5449 * I -> F -> I: signedness of Is must match
5450 * I -> I -> F: signedness of Is must match
5454 * at least 1 float involved: signedness must match
5456 bool may_leave_out_middle_conv(ir_mode *m0, ir_mode *m1, ir_mode *m2)
5458 int n_floats = mode_is_float(m0) + mode_is_float(m1) + mode_is_float(m2);
5459 if (n_floats == 1) {
5460 /* because overflow gives strange results we don't touch this case */
5462 } else if (n_floats == 2 && !mode_is_float(m1)) {
5466 unsigned size0 = get_significand_size(m0);
5467 unsigned size1 = get_significand_size(m1);
5468 unsigned size2 = get_significand_size(m2);
5469 if (size1 < size2 && size0 >= size1)
5473 return !mode_is_signed(m0) || mode_is_signed(m1);
5479 static ir_node *transform_node_Conv(ir_node *n)
5481 ir_node *c, *oldn = n;
5482 ir_mode *mode = get_irn_mode(n);
5483 ir_node *a = get_Conv_op(n);
5486 ir_mode *a_mode = get_irn_mode(a);
5487 ir_node *b = get_Conv_op(a);
5488 ir_mode *b_mode = get_irn_mode(b);
5489 if (may_leave_out_middle_conv(b_mode, a_mode, mode)) {
5490 dbg_info *dbgi = get_irn_dbg_info(n);
5491 ir_node *block = get_nodes_block(n);
5492 return new_rd_Conv(dbgi, block, b, mode);
5496 if (mode != mode_b && is_const_Phi(a)) {
5497 /* Do NOT optimize mode_b Conv's, this leads to remaining
5498 * Phib nodes later, because the conv_b_lower operation
5499 * is instantly reverted, when it tries to insert a Convb.
5501 c = apply_conv_on_phi(a, mode);
5503 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI);
5508 if (is_Unknown(a)) { /* Conv_A(Unknown_B) -> Unknown_A */
5509 ir_graph *irg = get_irn_irg(n);
5510 return new_r_Unknown(irg, mode);
5513 if (mode_is_reference(mode) &&
5514 get_mode_size_bits(mode) == get_mode_size_bits(get_irn_mode(a)) &&
5516 ir_node *l = get_Add_left(a);
5517 ir_node *r = get_Add_right(a);
5518 dbg_info *dbgi = get_irn_dbg_info(a);
5519 ir_node *block = get_nodes_block(n);
5521 ir_node *lop = get_Conv_op(l);
5522 if (get_irn_mode(lop) == mode) {
5523 /* ConvP(AddI(ConvI(P), x)) -> AddP(P, x) */
5524 n = new_rd_Add(dbgi, block, lop, r, mode);
5529 ir_node *rop = get_Conv_op(r);
5530 if (get_irn_mode(rop) == mode) {
5531 /* ConvP(AddI(x, ConvI(P))) -> AddP(x, P) */
5532 n = new_rd_Add(dbgi, block, l, rop, mode);
5542 * Remove dead blocks and nodes in dead blocks
5543 * in keep alive list. We do not generate a new End node.
5545 static ir_node *transform_node_End(ir_node *n)
5547 int i, j, n_keepalives = get_End_n_keepalives(n);
5550 NEW_ARR_A(ir_node *, in, n_keepalives);
5552 for (i = j = 0; i < n_keepalives; ++i) {
5553 ir_node *ka = get_End_keepalive(n, i);
5555 /* no need to keep Bad */
5558 /* do not keep unreachable code */
5559 block = is_Block(ka) ? ka : get_nodes_block(ka);
5560 if (is_block_unreachable(block))
5564 if (j != n_keepalives)
5565 set_End_keepalives(n, j, in);
5569 int ir_is_negated_value(const ir_node *a, const ir_node *b)
5571 if (is_Minus(a) && get_Minus_op(a) == b)
5573 if (is_Minus(b) && get_Minus_op(b) == a)
5575 if (is_Sub(a) && is_Sub(b)) {
5576 ir_node *a_left = get_Sub_left(a);
5577 ir_node *a_right = get_Sub_right(a);
5578 ir_node *b_left = get_Sub_left(b);
5579 ir_node *b_right = get_Sub_right(b);
5581 if (a_left == b_right && a_right == b_left)
5588 static const ir_node *skip_upconv(const ir_node *node)
5590 while (is_Conv(node)) {
5591 ir_mode *mode = get_irn_mode(node);
5592 const ir_node *op = get_Conv_op(node);
5593 ir_mode *op_mode = get_irn_mode(op);
5594 if (!smaller_mode(op_mode, mode))
5601 int ir_mux_is_abs(const ir_node *sel, const ir_node *mux_false,
5602 const ir_node *mux_true)
5607 ir_relation relation;
5613 * Note further that these optimization work even for floating point
5614 * with NaN's because -NaN == NaN.
5615 * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
5618 mode = get_irn_mode(mux_true);
5619 if (mode_honor_signed_zeros(mode))
5622 /* must be <, <=, >=, > */
5623 relation = get_Cmp_relation(sel);
5624 if ((relation & ir_relation_less_greater) == 0)
5627 if (!ir_is_negated_value(mux_true, mux_false))
5630 mux_true = skip_upconv(mux_true);
5631 mux_false = skip_upconv(mux_false);
5633 /* must be x cmp 0 */
5634 cmp_right = get_Cmp_right(sel);
5635 if (!is_Const(cmp_right) || !is_Const_null(cmp_right))
5638 cmp_left = get_Cmp_left(sel);
5639 if (cmp_left == mux_false) {
5640 if (relation & ir_relation_less) {
5643 assert(relation & ir_relation_greater);
5646 } else if (cmp_left == mux_true) {
5647 if (relation & ir_relation_less) {
5650 assert(relation & ir_relation_greater);
5658 ir_node *ir_get_abs_op(const ir_node *sel, ir_node *mux_false,
5661 ir_node *cmp_left = get_Cmp_left(sel);
5662 return cmp_left == skip_upconv(mux_false) ? mux_false : mux_true;
5665 bool ir_is_optimizable_mux(const ir_node *sel, const ir_node *mux_false,
5666 const ir_node *mux_true)
5668 /* this code should return true each time transform_node_Mux would
5669 * optimize the Mux completely away */
5671 ir_mode *mode = get_irn_mode(mux_false);
5672 if (get_mode_arithmetic(mode) == irma_twos_complement
5673 && ir_mux_is_abs(sel, mux_false, mux_true))
5676 if (is_Cmp(sel) && mode_is_int(mode) && is_cmp_equality_zero(sel)) {
5677 const ir_node *cmp_r = get_Cmp_right(sel);
5678 const ir_node *cmp_l = get_Cmp_left(sel);
5679 const ir_node *f = mux_false;
5680 const ir_node *t = mux_true;
5682 if (is_Const(t) && is_Const_null(t)) {
5687 if (is_And(cmp_l) && f == cmp_r) {
5688 ir_node *and_r = get_And_right(cmp_l);
5691 if (and_r == t && is_single_bit(and_r))
5693 and_l = get_And_left(cmp_l);
5694 if (and_l == t && is_single_bit(and_l))
5703 * Optimize a Mux(c, 0, 1) node (sometimes called a "set" instruction)
5705 static ir_node *transform_Mux_set(ir_node *n)
5707 ir_node *cond = get_Mux_sel(n);
5712 ir_relation relation;
5726 left = get_Cmp_left(cond);
5727 mode = get_irn_mode(left);
5728 if (!mode_is_int(mode) && !mode_is_reference(mode))
5730 dest_mode = get_irn_mode(n);
5731 if (!mode_is_int(dest_mode) && !mode_is_reference(dest_mode))
5733 right = get_Cmp_right(cond);
5734 relation = get_Cmp_relation(cond) & ~ir_relation_unordered;
5735 if (get_mode_size_bits(mode) >= get_mode_size_bits(dest_mode)
5736 && !(mode_is_signed(mode) && is_Const(right) && is_Const_null(right)
5737 && relation != ir_relation_greater))
5742 case ir_relation_less:
5743 /* a < b -> (a - b) >> 31 */
5747 case ir_relation_less_equal:
5748 /* a <= b -> ~(a - b) >> 31 */
5753 case ir_relation_greater:
5754 /* a > b -> (b - a) >> 31 */
5758 case ir_relation_greater_equal:
5759 /* a >= b -> ~(a - b) >> 31 */
5768 dbgi = get_irn_dbg_info(n);
5769 block = get_nodes_block(n);
5770 irg = get_irn_irg(block);
5771 bits = get_mode_size_bits(dest_mode);
5772 tv = new_tarval_from_long(bits-1, mode_Iu);
5773 shift_cnt = new_rd_Const(dbgi, irg, tv);
5775 if (mode != dest_mode) {
5776 a = new_rd_Conv(dbgi, block, a, dest_mode);
5777 b = new_rd_Conv(dbgi, block, b, dest_mode);
5780 res = new_rd_Sub(dbgi, block, a, b, dest_mode);
5782 res = new_rd_Not(dbgi, block, res, dest_mode);
5784 res = new_rd_Shr(dbgi, block, res, shift_cnt, dest_mode);
5789 * Optimize a Mux into some simpler cases.
5791 static ir_node *transform_node_Mux(ir_node *n)
5794 ir_node *sel = get_Mux_sel(n);
5795 ir_mode *mode = get_irn_mode(n);
5796 ir_node *t = get_Mux_true(n);
5797 ir_node *f = get_Mux_false(n);
5798 ir_graph *irg = get_irn_irg(n);
5800 /* implement integer abs: abs(x) = x^(x >>s 31) - (x >>s 31) */
5801 if (get_mode_arithmetic(mode) == irma_twos_complement) {
5802 int abs = ir_mux_is_abs(sel, f, t);
5804 dbg_info *dbgi = get_irn_dbg_info(n);
5805 ir_node *block = get_nodes_block(n);
5806 ir_node *op = ir_get_abs_op(sel, f, t);
5807 int bits = get_mode_size_bits(mode);
5808 ir_node *shiftconst = new_r_Const_long(irg, mode_Iu, bits-1);
5809 ir_node *sext = new_rd_Shrs(dbgi, block, op, shiftconst, mode);
5810 ir_node *xorn = new_rd_Eor(dbgi, block, op, sext, mode);
5813 res = new_rd_Sub(dbgi, block, xorn, sext, mode);
5815 res = new_rd_Sub(dbgi, block, sext, xorn, mode);
5821 /* first normalization step: try to move a constant to the false side,
5822 * 0 preferred on false side too */
5823 if (is_Cmp(sel) && is_Const(t) &&
5824 (!is_Const(f) || (is_Const_null(t) && !is_Const_null(f)))) {
5825 dbg_info *seldbgi = get_irn_dbg_info(sel);
5826 ir_node *block = get_nodes_block(sel);
5827 ir_relation relation = get_Cmp_relation(sel);
5832 /* Mux(x, a, b) => Mux(not(x), b, a) */
5833 relation = get_negated_relation(relation);
5834 sel = new_rd_Cmp(seldbgi, block, get_Cmp_left(sel),
5835 get_Cmp_right(sel), relation);
5836 return new_rd_Mux(get_irn_dbg_info(n), get_nodes_block(n), sel, f, t, mode);
5839 if (is_Const(f) && is_Const_null(f) && is_Const(t) && is_Const_one(t)) {
5840 n = transform_Mux_set(n);
5845 /* the following optimisations create new mode_b nodes, so only do them
5846 * before mode_b lowering */
5847 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_MODEB_LOWERED)) {
5849 ir_node* block = get_nodes_block(n);
5851 ir_node* c1 = get_Mux_sel(t);
5852 ir_node* t1 = get_Mux_true(t);
5853 ir_node* f1 = get_Mux_false(t);
5855 /* Mux(cond0, Mux(cond1, x, y), y) => Mux(cond0 && cond1, x, y) */
5856 ir_node* and_ = new_r_And(block, c0, c1, mode_b);
5857 DBG_OPT_ALGSIM0(oldn, t1, FS_OPT_MUX_COMBINE);
5858 return new_r_Mux(block, and_, f1, t1, mode);
5859 } else if (f == t1) {
5860 /* Mux(cond0, Mux(cond1, x, y), x) */
5861 ir_node* not_c1 = new_r_Not(block, c1, mode_b);
5862 ir_node* and_ = new_r_And(block, c0, not_c1, mode_b);
5863 DBG_OPT_ALGSIM0(oldn, f1, FS_OPT_MUX_COMBINE);
5864 return new_r_Mux(block, and_, t1, f1, mode);
5866 } else if (is_Mux(f)) {
5867 ir_node* block = get_nodes_block(n);
5869 ir_node* c1 = get_Mux_sel(f);
5870 ir_node* t1 = get_Mux_true(f);
5871 ir_node* f1 = get_Mux_false(f);
5873 /* Mux(cond0, x, Mux(cond1, x, y)) -> typical if (cond0 || cond1) x else y */
5874 ir_node* or_ = new_r_Or(block, c0, c1, mode_b);
5875 DBG_OPT_ALGSIM0(oldn, f1, FS_OPT_MUX_COMBINE);
5876 return new_r_Mux(block, or_, f1, t1, mode);
5877 } else if (t == f1) {
5878 /* Mux(cond0, x, Mux(cond1, y, x)) */
5879 ir_node* not_c1 = new_r_Not(block, c1, mode_b);
5880 ir_node* or_ = new_r_Or(block, c0, not_c1, mode_b);
5881 DBG_OPT_ALGSIM0(oldn, t1, FS_OPT_MUX_COMBINE);
5882 return new_r_Mux(block, or_, t1, f1, mode);
5886 /* note: after normalization, false can only happen on default */
5887 if (mode == mode_b) {
5888 dbg_info *dbg = get_irn_dbg_info(n);
5889 ir_node *block = get_nodes_block(n);
5892 ir_tarval *tv_t = get_Const_tarval(t);
5893 if (tv_t == tarval_b_true) {
5895 /* Muxb(sel, true, false) = sel */
5896 assert(get_Const_tarval(f) == tarval_b_false);
5897 DBG_OPT_ALGSIM0(oldn, sel, FS_OPT_MUX_BOOL);
5900 /* Muxb(sel, true, x) = Or(sel, x) */
5901 n = new_rd_Or(dbg, block, sel, f, mode_b);
5902 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_OR_BOOL);
5906 } else if (is_Const(f)) {
5907 ir_tarval *tv_f = get_Const_tarval(f);
5908 if (tv_f == tarval_b_true) {
5909 /* Muxb(sel, x, true) = Or(Not(sel), x) */
5910 ir_node* not_sel = new_rd_Not(dbg, block, sel, mode_b);
5911 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_ORNOT_BOOL);
5912 n = new_rd_Or(dbg, block, not_sel, t, mode_b);
5915 /* Muxb(sel, x, false) = And(sel, x) */
5916 assert(tv_f == tarval_b_false);
5917 n = new_rd_And(dbg, block, sel, t, mode_b);
5918 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_AND_BOOL);
5925 if (is_Cmp(sel) && mode_is_int(mode) && is_cmp_equality_zero(sel)) {
5926 ir_relation relation = get_Cmp_relation(sel);
5927 ir_node *cmp_r = get_Cmp_right(sel);
5928 ir_node *cmp_l = get_Cmp_left(sel);
5929 ir_node *block = get_nodes_block(n);
5931 if (is_And(cmp_l) && f == cmp_r) {
5932 ir_node *and_r = get_And_right(cmp_l);
5935 if (and_r == t && is_single_bit(and_r)) {
5936 if (relation == ir_relation_equal) {
5937 /* Mux((a & (1<<n)) == 0, (1<<n), 0) == (a&(1<<n)) xor ((1<<n)) */
5938 n = new_rd_Eor(get_irn_dbg_info(n),
5939 block, cmp_l, t, mode);
5940 DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP);
5942 /* Mux((a & (1<<n)) != 0, (1<<n), 0) == a & (1<<n) */
5944 DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP);
5948 and_l = get_And_left(cmp_l);
5949 if (and_l == t && is_single_bit(and_l)) {
5950 if (relation == ir_relation_equal) {
5951 /* ((1 << n) & a) == 0, (1 << n), 0) */
5952 n = new_rd_Eor(get_irn_dbg_info(n),
5953 block, cmp_l, t, mode);
5954 DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP);
5956 /* ((1 << n) & a) != 0, (1 << n), 0) */
5958 DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP);
5969 * optimize Sync nodes that have other syncs as input we simply add the inputs
5970 * of the other sync to our own inputs
5972 static ir_node *transform_node_Sync(ir_node *n)
5974 int arity = get_Sync_n_preds(n);
5977 for (i = 0; i < arity;) {
5978 ir_node *pred = get_Sync_pred(n, i);
5982 /* Remove Bad predecessors */
5989 /* Remove duplicate predecessors */
5990 for (j = 0; j < i; ++j) {
5991 if (get_Sync_pred(n, j) == pred) {
6000 if (!is_Sync(pred)) {
6008 pred_arity = get_Sync_n_preds(pred);
6009 for (j = 0; j < pred_arity; ++j) {
6010 ir_node *pred_pred = get_Sync_pred(pred, j);
6015 add_irn_n(n, pred_pred);
6019 if (get_Sync_pred(n, k) == pred_pred)
6026 ir_graph *irg = get_irn_irg(n);
6027 return new_r_Bad(irg, mode_M);
6030 return get_Sync_pred(n, 0);
6033 /* rehash the sync node */
6038 static ir_node *create_load_replacement_tuple(ir_node *n, ir_node *mem,
6041 ir_node *block = get_nodes_block(n);
6042 ir_graph *irg = get_irn_irg(n);
6043 ir_node *in[pn_Load_max+1];
6045 in[pn_Load_M] = mem;
6046 in[pn_Load_res] = res;
6047 if (ir_throws_exception(n)) {
6048 in[pn_Load_X_regular] = new_r_Jmp(block);
6049 in[pn_Load_X_except] = new_r_Bad(irg, mode_X);
6051 assert(pn_Load_max == 4);
6053 ir_node *tuple = new_r_Tuple(block, n_in, in);
6057 static ir_node *transform_node_Load(ir_node *n)
6059 /* don't touch volatile loads */
6060 if (get_Load_volatility(n) == volatility_is_volatile)
6063 ir_node *ptr = get_Load_ptr(n);
6064 const ir_node *confirm;
6065 if (value_not_zero(ptr, &confirm) && confirm == NULL) {
6066 set_irn_pinned(n, op_pin_state_floats);
6069 /* if our memory predecessor is a load from the same address, then reuse the
6070 * previous result */
6071 ir_node *mem = get_Load_mem(n);
6074 ir_node *mem_pred = get_Proj_pred(mem);
6075 if (is_Load(mem_pred)) {
6076 ir_node *pred_load = mem_pred;
6078 /* conservatively compare the 2 loads. TODO: This could be less strict
6079 * with fixup code in some situations (like smaller/bigger modes) */
6080 if (get_Load_ptr(pred_load) != ptr)
6082 if (get_Load_mode(pred_load) != get_Load_mode(n))
6084 /* all combinations of aligned/unaligned pred/n should be fine so we do
6085 * not compare the unaligned attribute */
6086 ir_mode *mode = get_Load_mode(n);
6087 ir_node *res = new_r_Proj(pred_load, mode, pn_Load_res);
6088 return create_load_replacement_tuple(n, mem, res);
6089 } else if (is_Store(mem_pred)) {
6090 ir_node *pred_store = mem_pred;
6091 ir_node *value = get_Store_value(pred_store);
6093 if (get_Store_ptr(pred_store) != ptr)
6095 if (get_irn_mode(value) != get_Load_mode(n))
6097 /* all combinations of aligned/unaligned pred/n should be fine so we do
6098 * not compare the unaligned attribute */
6099 return create_load_replacement_tuple(n, mem, value);
6105 static ir_node *transform_node_Store(ir_node *n)
6107 /* don't touch volatile stores */
6108 if (get_Store_volatility(n) == volatility_is_volatile)
6111 ir_node *ptr = get_Store_ptr(n);
6112 const ir_node *confirm;
6113 if (value_not_zero(ptr, &confirm) && confirm == NULL) {
6114 set_irn_pinned(n, op_pin_state_floats);
6120 * optimize a trampoline Call into a direct Call
6122 static ir_node *transform_node_Call(ir_node *call)
6124 ir_node *callee = get_Call_ptr(call);
6125 ir_node *adr, *mem, *res, *bl, **in;
6126 ir_type *ctp, *mtp, *tp;
6130 size_t i, n_res, n_param;
6133 if (! is_Proj(callee))
6135 callee = get_Proj_pred(callee);
6136 if (! is_Builtin(callee))
6138 if (get_Builtin_kind(callee) != ir_bk_inner_trampoline)
6141 mem = get_Call_mem(call);
6143 if (skip_Proj(mem) == callee) {
6144 /* memory is routed to the trampoline, skip */
6145 mem = get_Builtin_mem(callee);
6148 /* build a new call type */
6149 mtp = get_Call_type(call);
6150 tdb = get_type_dbg_info(mtp);
6152 n_res = get_method_n_ress(mtp);
6153 n_param = get_method_n_params(mtp);
6154 ctp = new_d_type_method(n_param + 1, n_res, tdb);
6156 for (i = 0; i < n_res; ++i)
6157 set_method_res_type(ctp, i, get_method_res_type(mtp, i));
6159 NEW_ARR_A(ir_node *, in, n_param + 1);
6161 /* FIXME: we don't need a new pointer type in every step */
6162 irg = get_irn_irg(call);
6163 tp = get_irg_frame_type(irg);
6164 tp = new_type_pointer(tp);
6165 set_method_param_type(ctp, 0, tp);
6167 in[0] = get_Builtin_param(callee, 2);
6168 for (i = 0; i < n_param; ++i) {
6169 set_method_param_type(ctp, i + 1, get_method_param_type(mtp, i));
6170 in[i + 1] = get_Call_param(call, i);
6172 var = get_method_variadicity(mtp);
6173 set_method_variadicity(ctp, var);
6174 /* When we resolve a trampoline, the function must be called by a this-call */
6175 set_method_calling_convention(ctp, get_method_calling_convention(mtp) | cc_this_call);
6176 set_method_additional_properties(ctp, get_method_additional_properties(mtp));
6178 adr = get_Builtin_param(callee, 1);
6180 db = get_irn_dbg_info(call);
6181 bl = get_nodes_block(call);
6183 res = new_rd_Call(db, bl, mem, adr, n_param + 1, in, ctp);
6184 if (get_irn_pinned(call) == op_pin_state_floats)
6185 set_irn_pinned(res, op_pin_state_floats);
6190 * Tries several [inplace] [optimizing] transformations and returns an
6191 * equivalent node. The difference to equivalent_node() is that these
6192 * transformations _do_ generate new nodes, and thus the old node must
6193 * not be freed even if the equivalent node isn't the old one.
6195 static ir_node *transform_node(ir_node *n)
6201 iro = get_irn_opcode_(n);
6202 /* constant expression evaluation / constant folding */
6203 if (get_opt_constant_folding()) {
6204 /* neither constants nor Tuple values can be evaluated */
6205 if (iro != iro_Const && get_irn_mode(n) != mode_T) {
6206 /* try to evaluate */
6207 ir_tarval *tv = computed_value(n);
6208 if (tv != tarval_bad) {
6209 /* evaluation was successful -- replace the node. */
6210 ir_graph *irg = get_irn_irg(n);
6212 n = new_r_Const(irg, tv);
6214 DBG_OPT_CSTEVAL(old_n, n);
6220 /* remove unnecessary nodes */
6221 if (get_opt_constant_folding() ||
6222 (iro == iro_Phi) || /* always optimize these nodes. */
6223 (iro == iro_Id) || /* ... */
6224 (iro == iro_Proj) || /* ... */
6225 (iro == iro_Block)) { /* Flags tested local. */
6226 n = equivalent_node(n);
6231 /* Some more constant expression evaluation. */
6232 if (get_opt_algebraic_simplification() ||
6233 (iro == iro_Cond) ||
6234 (iro == iro_Proj)) { /* Flags tested local. */
6235 if (n->op->ops.transform_node != NULL) {
6236 n = n->op->ops.transform_node(n);
6246 static void register_computed_value_func(ir_op *op, computed_value_func func)
6248 assert(op->ops.computed_value == NULL || op->ops.computed_value == func);
6249 op->ops.computed_value = func;
6252 static void register_computed_value_func_proj(ir_op *op,
6253 computed_value_func func)
6255 assert(op->ops.computed_value_Proj == NULL
6256 || op->ops.computed_value_Proj == func);
6257 op->ops.computed_value_Proj = func;
6260 static void register_equivalent_node_func(ir_op *op, equivalent_node_func func)
6262 assert(op->ops.equivalent_node == NULL || op->ops.equivalent_node == func);
6263 op->ops.equivalent_node = func;
6266 static void register_equivalent_node_func_proj(ir_op *op,
6267 equivalent_node_func func)
6269 assert(op->ops.equivalent_node_Proj == NULL
6270 || op->ops.equivalent_node_Proj == func);
6271 op->ops.equivalent_node_Proj = func;
6274 static void register_transform_node_func(ir_op *op, transform_node_func func)
6276 assert(op->ops.transform_node == NULL || op->ops.transform_node == func);
6277 op->ops.transform_node = func;
6280 static void register_transform_node_func_proj(ir_op *op,
6281 transform_node_func func)
6283 assert(op->ops.transform_node_Proj == NULL
6284 || op->ops.transform_node_Proj == func);
6285 op->ops.transform_node_Proj = func;
6288 void ir_register_opt_node_ops(void)
6290 register_computed_value_func(op_Add, computed_value_Add);
6291 register_computed_value_func(op_And, computed_value_And);
6292 register_computed_value_func(op_Borrow, computed_value_Borrow);
6293 register_computed_value_func(op_Carry, computed_value_Carry);
6294 register_computed_value_func(op_Cmp, computed_value_Cmp);
6295 register_computed_value_func(op_Confirm, computed_value_Confirm);
6296 register_computed_value_func(op_Const, computed_value_Const);
6297 register_computed_value_func(op_Conv, computed_value_Conv);
6298 register_computed_value_func(op_Eor, computed_value_Eor);
6299 register_computed_value_func(op_Minus, computed_value_Minus);
6300 register_computed_value_func(op_Mul, computed_value_Mul);
6301 register_computed_value_func(op_Mux, computed_value_Mux);
6302 register_computed_value_func(op_Not, computed_value_Not);
6303 register_computed_value_func(op_Or, computed_value_Or);
6304 register_computed_value_func(op_Proj, computed_value_Proj);
6305 register_computed_value_func(op_Rotl, computed_value_Rotl);
6306 register_computed_value_func(op_Shl, computed_value_Shl);
6307 register_computed_value_func(op_Shr, computed_value_Shr);
6308 register_computed_value_func(op_Shrs, computed_value_Shrs);
6309 register_computed_value_func(op_Sub, computed_value_Sub);
6310 register_computed_value_func(op_SymConst, computed_value_SymConst);
6311 register_computed_value_func_proj(op_Div, computed_value_Proj_Div);
6312 register_computed_value_func_proj(op_Mod, computed_value_Proj_Mod);
6314 register_equivalent_node_func(op_Add, equivalent_node_Add);
6315 register_equivalent_node_func(op_And, equivalent_node_And);
6316 register_equivalent_node_func(op_Confirm, equivalent_node_Confirm);
6317 register_equivalent_node_func(op_Conv, equivalent_node_Conv);
6318 register_equivalent_node_func(op_Eor, equivalent_node_Eor);
6319 register_equivalent_node_func(op_Id, equivalent_node_Id);
6320 register_equivalent_node_func(op_Minus, equivalent_node_involution);
6321 register_equivalent_node_func(op_Mul, equivalent_node_Mul);
6322 register_equivalent_node_func(op_Mux, equivalent_node_Mux);
6323 register_equivalent_node_func(op_Not, equivalent_node_involution);
6324 register_equivalent_node_func(op_Or, equivalent_node_Or);
6325 register_equivalent_node_func(op_Phi, equivalent_node_Phi);
6326 register_equivalent_node_func(op_Proj, equivalent_node_Proj);
6327 register_equivalent_node_func(op_Rotl, equivalent_node_left_zero);
6328 register_equivalent_node_func(op_Shl, equivalent_node_left_zero);
6329 register_equivalent_node_func(op_Shr, equivalent_node_left_zero);
6330 register_equivalent_node_func(op_Shrs, equivalent_node_left_zero);
6331 register_equivalent_node_func(op_Sub, equivalent_node_Sub);
6332 register_equivalent_node_func_proj(op_Bound, equivalent_node_Proj_Bound);
6333 register_equivalent_node_func_proj(op_CopyB, equivalent_node_Proj_CopyB);
6334 register_equivalent_node_func_proj(op_Div, equivalent_node_Proj_Div);
6335 register_equivalent_node_func_proj(op_Tuple, equivalent_node_Proj_Tuple);
6337 register_transform_node_func(op_Add, transform_node_Add);
6338 register_transform_node_func(op_And, transform_node_And);
6339 register_transform_node_func(op_Block, transform_node_Block);
6340 register_transform_node_func(op_Call, transform_node_Call);
6341 register_transform_node_func(op_Cmp, transform_node_Cmp);
6342 register_transform_node_func(op_Cond, transform_node_Cond);
6343 register_transform_node_func(op_Conv, transform_node_Conv);
6344 register_transform_node_func(op_Div, transform_node_Div);
6345 register_transform_node_func(op_End, transform_node_End);
6346 register_transform_node_func(op_Eor, transform_node_Eor);
6347 register_transform_node_func(op_Load, transform_node_Load);
6348 register_transform_node_func(op_Minus, transform_node_Minus);
6349 register_transform_node_func(op_Mod, transform_node_Mod);
6350 register_transform_node_func(op_Mul, transform_node_Mul);
6351 register_transform_node_func(op_Mux, transform_node_Mux);
6352 register_transform_node_func(op_Not, transform_node_Not);
6353 register_transform_node_func(op_Or, transform_node_Or);
6354 register_transform_node_func(op_Phi, transform_node_Phi);
6355 register_transform_node_func(op_Proj, transform_node_Proj);
6356 register_transform_node_func(op_Rotl, transform_node_Rotl);
6357 register_transform_node_func(op_Shl, transform_node_Shl);
6358 register_transform_node_func(op_Shrs, transform_node_Shrs);
6359 register_transform_node_func(op_Shr, transform_node_Shr);
6360 register_transform_node_func(op_Store, transform_node_Store);
6361 register_transform_node_func(op_Sub, transform_node_Sub);
6362 register_transform_node_func(op_Switch, transform_node_Switch);
6363 register_transform_node_func(op_Sync, transform_node_Sync);
6364 register_transform_node_func_proj(op_Bound, transform_node_Proj_Bound);
6365 register_transform_node_func_proj(op_CopyB, transform_node_Proj_CopyB);
6366 register_transform_node_func_proj(op_Div, transform_node_Proj_Div);
6367 register_transform_node_func_proj(op_Load, transform_node_Proj_Load);
6368 register_transform_node_func_proj(op_Mod, transform_node_Proj_Mod);
6369 register_transform_node_func_proj(op_Store, transform_node_Proj_Store);
6372 /* **************** Common Subexpression Elimination **************** */
6374 /** The size of the hash table used, should estimate the number of nodes
6376 #define N_IR_NODES 512
6378 int identities_cmp(const void *elt, const void *key)
6380 ir_node *a = (ir_node *)elt;
6381 ir_node *b = (ir_node *)key;
6384 if (a == b) return 0;
6386 if ((get_irn_op(a) != get_irn_op(b)) ||
6387 (get_irn_mode(a) != get_irn_mode(b))) return 1;
6389 /* compare if a's in and b's in are of equal length */
6390 irn_arity_a = get_irn_arity(a);
6391 if (irn_arity_a != get_irn_arity(b))
6394 /* blocks are never the same */
6398 if (get_irn_pinned(a) == op_pin_state_pinned) {
6399 /* for pinned nodes, the block inputs must be equal */
6400 if (get_nodes_block(a) != get_nodes_block(b))
6403 ir_node *block_a = get_nodes_block(a);
6404 ir_node *block_b = get_nodes_block(b);
6405 if (! get_opt_global_cse()) {
6406 /* for block-local CSE both nodes must be in the same Block */
6407 if (block_a != block_b)
6410 /* The optimistic approach would be to do nothing here.
6411 * However doing GCSE optimistically produces a lot of partially dead code which appears
6412 * to be worse in practice than the missed opportunities.
6413 * So we use a very conservative variant here and only CSE if 1 value dominates the
6415 if (!block_dominates(block_a, block_b)
6416 && !block_dominates(block_b, block_a))
6418 /* respect the workaround rule: do not move nodes which are only
6419 * held by keepalive edges */
6420 if (only_used_by_keepalive(a) || only_used_by_keepalive(b))
6425 /* compare a->in[0..ins] with b->in[0..ins] */
6426 for (i = 0; i < irn_arity_a; ++i) {
6427 ir_node *pred_a = get_irn_n(a, i);
6428 ir_node *pred_b = get_irn_n(b, i);
6429 if (pred_a != pred_b) {
6430 /* if both predecessors are CSE neutral they might be different */
6431 if (!is_irn_cse_neutral(pred_a) || !is_irn_cse_neutral(pred_b))
6437 * here, we already now that the nodes are identical except their
6440 if (a->op->ops.node_cmp_attr)
6441 return a->op->ops.node_cmp_attr(a, b);
6446 unsigned ir_node_hash(const ir_node *node)
6448 return node->op->ops.hash(node);
6451 void new_identities(ir_graph *irg)
6453 if (irg->value_table != NULL)
6454 del_pset(irg->value_table);
6455 irg->value_table = new_pset(identities_cmp, N_IR_NODES);
6458 void del_identities(ir_graph *irg)
6460 if (irg->value_table != NULL)
6461 del_pset(irg->value_table);
6464 static int cmp_node_nr(const void *a, const void *b)
6466 ir_node **p1 = (ir_node**)a;
6467 ir_node **p2 = (ir_node**)b;
6468 long n1 = get_irn_node_nr(*p1);
6469 long n2 = get_irn_node_nr(*p2);
6470 return (n1>n2) - (n1<n2);
6473 void ir_normalize_node(ir_node *n)
6475 if (is_op_commutative(get_irn_op(n))) {
6476 ir_node *l = get_binop_left(n);
6477 ir_node *r = get_binop_right(n);
6479 /* For commutative operators perform a OP b == b OP a but keep
6480 * constants on the RIGHT side. This helps greatly in some
6481 * optimizations. Moreover we use the idx number to make the form
6483 if (!operands_are_normalized(l, r)) {
6484 set_binop_left(n, r);
6485 set_binop_right(n, l);
6488 } else if (is_Sync(n)) {
6489 /* we assume that most of the time the inputs of a Sync node are already
6490 * sorted, so check this first as a shortcut */
6491 bool ins_sorted = true;
6492 int arity = get_irn_arity(n);
6493 const ir_node *last = get_irn_n(n, 0);
6495 for (i = 1; i < arity; ++i) {
6496 const ir_node *node = get_irn_n(n, i);
6497 if (get_irn_node_nr(node) < get_irn_node_nr(last)) {
6505 ir_node **ins = get_irn_in(n)+1;
6506 ir_node **new_ins = XMALLOCN(ir_node*, arity);
6507 memcpy(new_ins, ins, arity*sizeof(ins[0]));
6508 qsort(new_ins, arity, sizeof(new_ins[0]), cmp_node_nr);
6509 set_irn_in(n, arity, new_ins);
6515 ir_node *identify_remember(ir_node *n)
6517 ir_graph *irg = get_irn_irg(n);
6518 pset *value_table = irg->value_table;
6521 if (value_table == NULL)
6524 ir_normalize_node(n);
6525 /* lookup or insert in hash table with given hash key. */
6526 nn = (ir_node*)pset_insert(value_table, n, ir_node_hash(n));
6529 /* n is reachable again */
6530 edges_node_revival(nn);
6537 * During construction we set the op_pin_state_pinned flag in the graph right
6538 * when the optimization is performed. The flag turning on procedure global
6539 * cse could be changed between two allocations. This way we are safe.
6541 * @param n The node to lookup
6543 static inline ir_node *identify_cons(ir_node *n)
6547 n = identify_remember(n);
6548 if (n != old && get_nodes_block(old) != get_nodes_block(n)) {
6549 ir_graph *irg = get_irn_irg(n);
6550 set_irg_pinned(irg, op_pin_state_floats);
6555 void add_identities(ir_node *node)
6562 identify_remember(node);
6565 void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env)
6567 ir_graph *rem = current_ir_graph;
6569 current_ir_graph = irg;
6570 foreach_pset(irg->value_table, ir_node, node) {
6573 current_ir_graph = rem;
6576 ir_node *optimize_node(ir_node *n)
6579 ir_graph *irg = get_irn_irg(n);
6580 unsigned iro = get_irn_opcode(n);
6583 /* Always optimize Phi nodes: part of the construction. */
6584 if ((!get_opt_optimize()) && (iro != iro_Phi)) return n;
6586 /* constant expression evaluation / constant folding */
6587 if (get_opt_constant_folding()) {
6588 /* neither constants nor Tuple values can be evaluated */
6589 if (iro != iro_Const && (get_irn_mode(n) != mode_T)) {
6590 /* try to evaluate */
6591 tv = computed_value(n);
6592 if (tv != tarval_bad) {
6597 * we MUST copy the node here temporarily, because it's still
6598 * needed for DBG_OPT_CSTEVAL
6600 node_size = offsetof(ir_node, attr) + n->op->attr_size;
6601 oldn = (ir_node*)alloca(node_size);
6603 memcpy(oldn, n, node_size);
6604 CLONE_ARR_A(ir_node *, oldn->in, n->in);
6606 /* ARG, copy the in array, we need it for statistics */
6607 memcpy(oldn->in, n->in, ARR_LEN(n->in) * sizeof(n->in[0]));
6609 /* note the inplace edges module */
6610 edges_node_deleted(n);
6612 /* evaluation was successful -- replace the node. */
6613 irg_kill_node(irg, n);
6614 nw = new_r_Const(irg, tv);
6616 DBG_OPT_CSTEVAL(oldn, nw);
6622 /* remove unnecessary nodes */
6623 if (get_opt_algebraic_simplification() ||
6624 (iro == iro_Phi) || /* always optimize these nodes. */
6626 (iro == iro_Proj) ||
6627 (iro == iro_Block) ) /* Flags tested local. */
6628 n = equivalent_node(n);
6630 /* Common Subexpression Elimination.
6632 * Checks whether n is already available.
6633 * The block input is used to distinguish different subexpressions. Right
6634 * now all nodes are op_pin_state_pinned to blocks, i.e., the CSE only finds common
6635 * subexpressions within a block.
6638 n = identify_cons(n);
6641 edges_node_deleted(oldn);
6643 /* We found an existing, better node, so we can deallocate the old node. */
6644 irg_kill_node(irg, oldn);
6648 /* Some more constant expression evaluation that does not allow to
6650 iro = get_irn_opcode(n);
6651 if (get_opt_algebraic_simplification() ||
6652 (iro == iro_Cond) ||
6653 (iro == iro_Proj)) { /* Flags tested local. */
6654 n = transform_node(n);
6657 /* Now we have a legal, useful node. Enter it in hash table for CSE */
6658 if (get_opt_cse()) {
6660 n = identify_remember(o);
6668 ir_node *optimize_in_place_2(ir_node *n)
6670 if (!get_opt_optimize() && !is_Phi(n)) return n;
6675 /** common subexpression elimination **/
6676 /* Checks whether n is already available. */
6677 /* The block input is used to distinguish different subexpressions.
6678 * Right now all nodes are op_pin_state_pinned to blocks, i.e., the cse
6679 * only finds common subexpressions within a block. */
6680 if (get_opt_cse()) {
6682 n = identify_remember(n);
6685 /* we have another existing node now, we do not optimize it here */
6690 n = transform_node(n);
6692 /* Now we can verify the node, as it has no dead inputs any more. */
6695 /* Now we have a legal, useful node. Enter it in hash table for cse.
6697 * Note: This is only necessary because some of the optimisations
6698 * operate in-place (set_XXX_bla, turn_into_tuple, ...) which is considered
6699 * bad practice and should be fixed sometime.
6701 if (get_opt_cse()) {
6703 n = identify_remember(o);
6711 ir_node *optimize_in_place(ir_node *n)
6713 ir_graph *irg = get_irn_irg(n);
6715 if (get_opt_global_cse())
6716 set_irg_pinned(irg, op_pin_state_floats);
6718 /* FIXME: Maybe we could also test whether optimizing the node can
6719 change the control graph. */
6720 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE);
6721 return optimize_in_place_2(n);