2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief iropt --- optimizations intertwined with IR construction.
23 * @author Christian Schaefer, Goetz Lindenmaier, Michael Beck
33 #include "irgraph_t.h"
34 #include "iredges_t.h"
41 #include "dbginfo_t.h"
42 #include "iropt_dbg.h"
48 #include "opt_confirms.h"
49 #include "opt_polymorphy.h"
53 /* Make types visible to allow most efficient access */
57 * Return the value of a Constant.
59 static tarval *computed_value_Const(ir_node *n) {
60 return get_Const_tarval(n);
61 } /* computed_value_Const */
64 * Return the value of a 'sizeof', 'alignof' or 'offsetof' SymConst.
66 static tarval *computed_value_SymConst(ir_node *n) {
70 switch (get_SymConst_kind(n)) {
71 case symconst_type_size:
72 type = get_SymConst_type(n);
73 if (get_type_state(type) == layout_fixed)
74 return new_tarval_from_long(get_type_size_bytes(type), get_irn_mode(n));
76 case symconst_type_align:
77 type = get_SymConst_type(n);
78 if (get_type_state(type) == layout_fixed)
79 return new_tarval_from_long(get_type_alignment_bytes(type), get_irn_mode(n));
81 case symconst_ofs_ent:
82 ent = get_SymConst_entity(n);
83 type = get_entity_owner(ent);
84 if (get_type_state(type) == layout_fixed)
85 return new_tarval_from_long(get_entity_offset(ent), get_irn_mode(n));
91 } /* computed_value_SymConst */
94 * Return the value of an Add.
96 static tarval *computed_value_Add(ir_node *n) {
97 ir_node *a = get_Add_left(n);
98 ir_node *b = get_Add_right(n);
100 tarval *ta = value_of(a);
101 tarval *tb = value_of(b);
103 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b)))
104 return tarval_add(ta, tb);
107 } /* computed_value_Add */
110 * Return the value of a Sub.
111 * Special case: a - a
113 static tarval *computed_value_Sub(ir_node *n) {
114 ir_node *a = get_Sub_left(n);
115 ir_node *b = get_Sub_right(n);
120 if (a == b && !is_Bad(a))
121 return get_mode_null(get_irn_mode(n));
126 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b)))
127 return tarval_sub(ta, tb);
130 } /* computed_value_Sub */
133 * Return the value of a Carry.
134 * Special : a op 0, 0 op b
136 static tarval *computed_value_Carry(ir_node *n) {
137 ir_node *a = get_binop_left(n);
138 ir_node *b = get_binop_right(n);
139 ir_mode *m = get_irn_mode(n);
141 tarval *ta = value_of(a);
142 tarval *tb = value_of(b);
144 if ((ta != tarval_bad) && (tb != tarval_bad)) {
146 return tarval_carry() ? get_mode_one(m) : get_mode_null(m);
148 if (tarval_is_null(ta) || tarval_is_null(tb))
149 return get_mode_null(m);
152 } /* computed_value_Carry */
155 * Return the value of a Borrow.
158 static tarval *computed_value_Borrow(ir_node *n) {
159 ir_node *a = get_binop_left(n);
160 ir_node *b = get_binop_right(n);
161 ir_mode *m = get_irn_mode(n);
163 tarval *ta = value_of(a);
164 tarval *tb = value_of(b);
166 if ((ta != tarval_bad) && (tb != tarval_bad)) {
167 return tarval_cmp(ta, tb) == pn_Cmp_Lt ? get_mode_one(m) : get_mode_null(m);
168 } else if (tarval_is_null(ta)) {
169 return get_mode_null(m);
172 } /* computed_value_Borrow */
175 * Return the value of an unary Minus.
177 static tarval *computed_value_Minus(ir_node *n) {
178 ir_node *a = get_Minus_op(n);
179 tarval *ta = value_of(a);
181 if (ta != tarval_bad)
182 return tarval_neg(ta);
185 } /* computed_value_Minus */
188 * Return the value of a Mul.
190 static tarval *computed_value_Mul(ir_node *n) {
191 ir_node *a = get_Mul_left(n);
192 ir_node *b = get_Mul_right(n);
195 tarval *ta = value_of(a);
196 tarval *tb = value_of(b);
198 mode = get_irn_mode(n);
199 if (mode != get_irn_mode(a)) {
200 /* n * n = 2n bit multiplication */
201 ta = tarval_convert_to(ta, mode);
202 tb = tarval_convert_to(tb, mode);
205 if (ta != tarval_bad && tb != tarval_bad) {
206 return tarval_mul(ta, tb);
208 /* a*0 = 0 or 0*b = 0 */
209 if (ta == get_mode_null(mode))
211 if (tb == get_mode_null(mode))
215 } /* computed_value_Mul */
218 * Return the value of a floating point Quot.
220 static tarval *computed_value_Quot(ir_node *n) {
221 ir_node *a = get_Quot_left(n);
222 ir_node *b = get_Quot_right(n);
224 tarval *ta = value_of(a);
225 tarval *tb = value_of(b);
227 /* This was missing in original implementation. Why? */
228 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
229 if (tb != get_mode_null(get_tarval_mode(tb))) /* div by zero: return tarval_bad */
230 return tarval_quo(ta, tb);
233 } /* computed_value_Quot */
236 * Calculate the value of an integer Div of two nodes.
237 * Special case: 0 / b
239 static tarval *do_computed_value_Div(ir_node *a, ir_node *b) {
240 tarval *ta = value_of(a);
241 tarval *tb = value_of(b);
243 /* Compute c1 / c2 or 0 / a, a != 0 */
244 if (ta != tarval_bad) {
245 if ((tb != tarval_bad) && (tb != get_mode_null(get_irn_mode(b)))) /* div by zero: return tarval_bad */
246 return tarval_div(ta, tb);
247 else if (ta == get_mode_null(get_tarval_mode(ta))) /* 0 / b == 0 */
251 } /* do_computed_value_Div */
254 * Return the value of an integer Div.
256 static tarval *computed_value_Div(ir_node *n) {
257 return do_computed_value_Div(get_Div_left(n), get_Div_right(n));
258 } /* computed_value_Div */
261 * Calculate the value of an integer Mod of two nodes.
262 * Special case: a % 1
264 static tarval *do_computed_value_Mod(ir_node *a, ir_node *b) {
265 tarval *ta = value_of(a);
266 tarval *tb = value_of(b);
268 /* Compute c1 % c2 or a % 1 */
269 if (tb != tarval_bad) {
270 if ((ta != tarval_bad) && (tb != get_mode_null(get_tarval_mode(tb)))) /* div by zero: return tarval_bad */
271 return tarval_mod(ta, tb);
272 else if (tb == get_mode_one(get_tarval_mode(tb))) /* x mod 1 == 0 */
273 return get_mode_null(get_irn_mode(a));
276 } /* do_computed_value_Mod */
279 * Return the value of an integer Mod.
281 static tarval *computed_value_Mod(ir_node *n) {
282 return do_computed_value_Mod(get_Mod_left(n), get_Mod_right(n));
283 } /* computed_value_Mod */
286 * Return the value of an Abs.
288 static tarval *computed_value_Abs(ir_node *n) {
289 ir_node *a = get_Abs_op(n);
290 tarval *ta = value_of(a);
292 if (ta != tarval_bad)
293 return tarval_abs(ta);
296 } /* computed_value_Abs */
299 * Return the value of an And.
300 * Special case: a & 0, 0 & b
302 static tarval *computed_value_And(ir_node *n) {
303 ir_node *a = get_And_left(n);
304 ir_node *b = get_And_right(n);
306 tarval *ta = value_of(a);
307 tarval *tb = value_of(b);
309 if ((ta != tarval_bad) && (tb != tarval_bad)) {
310 return tarval_and (ta, tb);
312 if (tarval_is_null(ta)) return ta;
313 if (tarval_is_null(tb)) return tb;
316 } /* computed_value_And */
319 * Return the value of an Or.
320 * Special case: a | 1...1, 1...1 | b
322 static tarval *computed_value_Or(ir_node *n) {
323 ir_node *a = get_Or_left(n);
324 ir_node *b = get_Or_right(n);
326 tarval *ta = value_of(a);
327 tarval *tb = value_of(b);
329 if ((ta != tarval_bad) && (tb != tarval_bad)) {
330 return tarval_or (ta, tb);
332 if (tarval_is_all_one(ta)) return ta;
333 if (tarval_is_all_one(tb)) return tb;
336 } /* computed_value_Or */
339 * Return the value of an Eor.
341 static tarval *computed_value_Eor(ir_node *n) {
342 ir_node *a = get_Eor_left(n);
343 ir_node *b = get_Eor_right(n);
348 return get_mode_null(get_irn_mode(n));
353 if ((ta != tarval_bad) && (tb != tarval_bad)) {
354 return tarval_eor (ta, tb);
357 } /* computed_value_Eor */
360 * Return the value of a Not.
362 static tarval *computed_value_Not(ir_node *n) {
363 ir_node *a = get_Not_op(n);
364 tarval *ta = value_of(a);
366 if (ta != tarval_bad)
367 return tarval_not(ta);
370 } /* computed_value_Not */
373 * Return the value of a Shl.
375 static tarval *computed_value_Shl(ir_node *n) {
376 ir_node *a = get_Shl_left(n);
377 ir_node *b = get_Shl_right(n);
379 tarval *ta = value_of(a);
380 tarval *tb = value_of(b);
382 if ((ta != tarval_bad) && (tb != tarval_bad)) {
383 return tarval_shl (ta, tb);
386 } /* computed_value_Shl */
389 * Return the value of a Shr.
391 static tarval *computed_value_Shr(ir_node *n) {
392 ir_node *a = get_Shr_left(n);
393 ir_node *b = get_Shr_right(n);
395 tarval *ta = value_of(a);
396 tarval *tb = value_of(b);
398 if ((ta != tarval_bad) && (tb != tarval_bad)) {
399 return tarval_shr (ta, tb);
402 } /* computed_value_Shr */
405 * Return the value of a Shrs.
407 static tarval *computed_value_Shrs(ir_node *n) {
408 ir_node *a = get_Shrs_left(n);
409 ir_node *b = get_Shrs_right(n);
411 tarval *ta = value_of(a);
412 tarval *tb = value_of(b);
414 if ((ta != tarval_bad) && (tb != tarval_bad)) {
415 return tarval_shrs (ta, tb);
418 } /* computed_value_Shrs */
421 * Return the value of a Rot.
423 static tarval *computed_value_Rot(ir_node *n) {
424 ir_node *a = get_Rot_left(n);
425 ir_node *b = get_Rot_right(n);
427 tarval *ta = value_of(a);
428 tarval *tb = value_of(b);
430 if ((ta != tarval_bad) && (tb != tarval_bad)) {
431 return tarval_rot (ta, tb);
434 } /* computed_value_Rot */
437 * Return the value of a Conv.
439 static tarval *computed_value_Conv(ir_node *n) {
440 ir_node *a = get_Conv_op(n);
441 tarval *ta = value_of(a);
443 if (ta != tarval_bad)
444 return tarval_convert_to(ta, get_irn_mode(n));
447 } /* computed_value_Conv */
450 * Return the value of a Proj(Cmp).
452 * This performs a first step of unreachable code elimination.
453 * Proj can not be computed, but folding a Cmp above the Proj here is
454 * not as wasteful as folding a Cmp into a Tuple of 16 Consts of which
456 * There are several case where we can evaluate a Cmp node, see later.
458 static tarval *computed_value_Proj_Cmp(ir_node *n) {
459 ir_node *a = get_Proj_pred(n);
460 ir_node *aa = get_Cmp_left(a);
461 ir_node *ab = get_Cmp_right(a);
462 long proj_nr = get_Proj_proj(n);
465 * BEWARE: a == a is NOT always True for floating Point values, as
466 * NaN != NaN is defined, so we must check this here.
469 !mode_is_float(get_irn_mode(aa)) || proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Gt)
472 /* This is a trick with the bits used for encoding the Cmp
473 Proj numbers, the following statement is not the same:
474 return new_tarval_from_long (proj_nr == pn_Cmp_Eq, mode_b) */
475 return new_tarval_from_long (proj_nr & pn_Cmp_Eq, mode_b);
478 tarval *taa = value_of(aa);
479 tarval *tab = value_of(ab);
480 ir_mode *mode = get_irn_mode(aa);
483 * The predecessors of Cmp are target values. We can evaluate
486 if ((taa != tarval_bad) && (tab != tarval_bad)) {
487 /* strange checks... */
488 pn_Cmp flags = tarval_cmp(taa, tab);
489 if (flags != pn_Cmp_False) {
490 return new_tarval_from_long (proj_nr & flags, mode_b);
493 /* for integer values, we can check against MIN/MAX */
494 else if (mode_is_int(mode)) {
495 /* MIN <=/> x. This results in true/false. */
496 if (taa == get_mode_min(mode)) {
497 /* a compare with the MIN value */
498 if (proj_nr == pn_Cmp_Le)
499 return get_tarval_b_true();
500 else if (proj_nr == pn_Cmp_Gt)
501 return get_tarval_b_false();
503 /* x >=/< MIN. This results in true/false. */
505 if (tab == get_mode_min(mode)) {
506 /* a compare with the MIN value */
507 if (proj_nr == pn_Cmp_Ge)
508 return get_tarval_b_true();
509 else if (proj_nr == pn_Cmp_Lt)
510 return get_tarval_b_false();
512 /* MAX >=/< x. This results in true/false. */
513 else if (taa == get_mode_max(mode)) {
514 if (proj_nr == pn_Cmp_Ge)
515 return get_tarval_b_true();
516 else if (proj_nr == pn_Cmp_Lt)
517 return get_tarval_b_false();
519 /* x <=/> MAX. This results in true/false. */
520 else if (tab == get_mode_max(mode)) {
521 if (proj_nr == pn_Cmp_Le)
522 return get_tarval_b_true();
523 else if (proj_nr == pn_Cmp_Gt)
524 return get_tarval_b_false();
528 * The predecessors are Allocs or (void*)(0) constants. Allocs never
529 * return NULL, they raise an exception. Therefore we can predict
533 ir_node *aaa = skip_Id(skip_Proj(aa));
534 ir_node *aba = skip_Id(skip_Proj(ab));
536 if ( ( (/* aa is ProjP and aaa is Alloc */
538 && mode_is_reference(get_irn_mode(aa))
540 && ( (/* ab is NULL */
542 && mode_is_reference(get_irn_mode(ab))
543 && is_Const_null(ab))
544 || (/* ab is other Alloc */
546 && mode_is_reference(get_irn_mode(ab))
549 || (/* aa is NULL and aba is Alloc */
551 && mode_is_reference(get_irn_mode(aa))
554 && mode_is_reference(get_irn_mode(ab))
557 return new_tarval_from_long(proj_nr & pn_Cmp_Ne, mode_b);
560 return computed_value_Cmp_Confirm(a, aa, ab, proj_nr);
561 } /* computed_value_Proj_Cmp */
564 * Return the value of a Proj, handle Proj(Cmp), Proj(Div), Proj(Mod),
565 * Proj(DivMod) and Proj(Quot).
567 static tarval *computed_value_Proj(ir_node *n) {
568 ir_node *a = get_Proj_pred(n);
571 switch (get_irn_opcode(a)) {
573 return computed_value_Proj_Cmp(n);
576 /* compute either the Div or the Mod part */
577 proj_nr = get_Proj_proj(n);
578 if (proj_nr == pn_DivMod_res_div)
579 return do_computed_value_Div(get_DivMod_left(a), get_DivMod_right(a));
580 else if (proj_nr == pn_DivMod_res_mod)
581 return do_computed_value_Mod(get_DivMod_left(a), get_DivMod_right(a));
585 if (get_Proj_proj(n) == pn_Div_res)
586 return computed_value(a);
590 if (get_Proj_proj(n) == pn_Mod_res)
591 return computed_value(a);
595 if (get_Proj_proj(n) == pn_Quot_res)
596 return computed_value(a);
603 } /* computed_value_Proj */
606 * Calculate the value of a Mux: can be evaluated, if the
607 * sel and the right input are known.
609 static tarval *computed_value_Mux(ir_node *n) {
610 ir_node *sel = get_Mux_sel(n);
611 tarval *ts = value_of(sel);
613 if (ts == get_tarval_b_true()) {
614 ir_node *v = get_Mux_true(n);
617 else if (ts == get_tarval_b_false()) {
618 ir_node *v = get_Mux_false(n);
622 } /* computed_value_Mux */
625 * Calculate the value of a Psi: can be evaluated, if a condition is true
626 * and all previous conditions are false. If all conditions are false
627 * we evaluate to the default one.
629 static tarval *computed_value_Psi(ir_node *n) {
631 return computed_value_Mux(n);
633 } /* computed_value_Psi */
636 * Calculate the value of a Confirm: can be evaluated,
637 * if it has the form Confirm(x, '=', Const).
639 static tarval *computed_value_Confirm(ir_node *n) {
640 return get_Confirm_cmp(n) == pn_Cmp_Eq ?
641 value_of(get_Confirm_bound(n)) : tarval_bad;
642 } /* computed_value_Confirm */
645 * If the parameter n can be computed, return its value, else tarval_bad.
646 * Performs constant folding.
648 * @param n The node this should be evaluated
650 tarval *computed_value(ir_node *n) {
651 if (n->op->ops.computed_value)
652 return n->op->ops.computed_value(n);
654 } /* computed_value */
657 * Set the default computed_value evaluator in an ir_op_ops.
659 * @param code the opcode for the default operation
660 * @param ops the operations initialized
665 static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops)
669 ops->computed_value = computed_value_##a; \
704 } /* firm_set_default_computed_value */
707 * Returns a equivalent block for another block.
708 * If the block has only one predecessor, this is
709 * the equivalent one. If the only predecessor of a block is
710 * the block itself, this is a dead block.
712 * If both predecessors of a block are the branches of a binary
713 * Cond, the equivalent block is Cond's block.
715 * If all predecessors of a block are bad or lies in a dead
716 * block, the current block is dead as well.
718 * Note, that blocks are NEVER turned into Bad's, instead
719 * the dead_block flag is set. So, never test for is_Bad(block),
720 * always use is_dead_Block(block).
722 static ir_node *equivalent_node_Block(ir_node *n)
725 int n_preds = get_Block_n_cfgpreds(n);
727 /* The Block constructor does not call optimize, but mature_immBlock
728 calls the optimization. */
729 assert(get_Block_matured(n));
731 /* Straightening: a single entry Block following a single exit Block
732 can be merged, if it is not the Start block. */
733 /* !!! Beware, all Phi-nodes of n must have been optimized away.
734 This should be true, as the block is matured before optimize is called.
735 But what about Phi-cycles with the Phi0/Id that could not be resolved?
736 Remaining Phi nodes are just Ids. */
737 if (n_preds == 1 && is_Jmp(get_Block_cfgpred(n, 0))) {
738 ir_node *predblock = get_nodes_block(get_Block_cfgpred(n, 0));
739 if (predblock == oldn) {
740 /* Jmp jumps into the block it is in -- deal self cycle. */
741 n = set_Block_dead(n);
742 DBG_OPT_DEAD_BLOCK(oldn, n);
743 } else if (get_opt_control_flow_straightening()) {
745 DBG_OPT_STG(oldn, n);
747 } else if (n_preds == 1 && is_Cond(skip_Proj(get_Block_cfgpred(n, 0)))) {
748 ir_node *predblock = get_Block_cfgpred_block(n, 0);
749 if (predblock == oldn) {
750 /* Jmp jumps into the block it is in -- deal self cycle. */
751 n = set_Block_dead(n);
752 DBG_OPT_DEAD_BLOCK(oldn, n);
754 } else if ((n_preds == 2) &&
755 (get_opt_control_flow_weak_simplification())) {
756 /* Test whether Cond jumps twice to this block
757 * The more general case which more than 2 predecessors is handles
758 * in optimize_cf(), we handle only this special case for speed here.
760 ir_node *a = get_Block_cfgpred(n, 0);
761 ir_node *b = get_Block_cfgpred(n, 1);
765 (get_Proj_pred(a) == get_Proj_pred(b)) &&
766 is_Cond(get_Proj_pred(a)) &&
767 (get_irn_mode(get_Cond_selector(get_Proj_pred(a))) == mode_b)) {
768 /* Also a single entry Block following a single exit Block. Phis have
769 twice the same operand and will be optimized away. */
770 n = get_nodes_block(get_Proj_pred(a));
771 DBG_OPT_IFSIM1(oldn, a, b, n);
773 } else if (get_opt_unreachable_code() &&
774 (n != get_irg_start_block(current_ir_graph)) &&
775 (n != get_irg_end_block(current_ir_graph)) ) {
778 /* If all inputs are dead, this block is dead too, except if it is
779 the start or end block. This is one step of unreachable code
781 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
782 ir_node *pred = get_Block_cfgpred(n, i);
785 if (is_Bad(pred)) continue;
786 pred_blk = get_nodes_block(skip_Proj(pred));
788 if (is_Block_dead(pred_blk)) continue;
791 /* really found a living input */
796 n = set_Block_dead(n);
797 DBG_OPT_DEAD_BLOCK(oldn, n);
802 } /* equivalent_node_Block */
805 * Returns a equivalent node for a Jmp, a Bad :-)
806 * Of course this only happens if the Block of the Jmp is dead.
808 static ir_node *equivalent_node_Jmp(ir_node *n) {
809 /* unreachable code elimination */
810 if (is_Block_dead(get_nodes_block(n)))
814 } /* equivalent_node_Jmp */
816 /** Raise is handled in the same way as Jmp. */
817 #define equivalent_node_Raise equivalent_node_Jmp
820 /* We do not evaluate Cond here as we replace it by a new node, a Jmp.
821 See transform_node_Proj_Cond(). */
824 * Optimize operations that are commutative and have neutral 0,
825 * so a op 0 = 0 op a = a.
827 static ir_node *equivalent_node_neutral_zero(ir_node *n)
831 ir_node *a = get_binop_left(n);
832 ir_node *b = get_binop_right(n);
837 /* After running compute_node there is only one constant predecessor.
838 Find this predecessors value and remember the other node: */
839 if ((tv = value_of(a)) != tarval_bad) {
841 } else if ((tv = value_of(b)) != tarval_bad) {
846 /* If this predecessors constant value is zero, the operation is
847 * unnecessary. Remove it.
849 * Beware: If n is a Add, the mode of on and n might be different
850 * which happens in this rare construction: NULL + 3.
851 * Then, a Conv would be needed which we cannot include here.
853 if (tarval_is_null(tv) && get_irn_mode(on) == get_irn_mode(n)) {
856 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
860 } /* equivalent_node_neutral_zero */
863 * Eor is commutative and has neutral 0.
865 #define equivalent_node_Eor equivalent_node_neutral_zero
868 * Optimize a - 0 and (a - x) + x (for modes with wrap-around).
870 * The second one looks strange, but this construct
871 * is used heavily in the LCC sources :-).
873 * Beware: The Mode of an Add may be different than the mode of its
874 * predecessors, so we could not return a predecessors in all cases.
876 static ir_node *equivalent_node_Add(ir_node *n) {
878 ir_node *left, *right;
879 ir_mode *mode = get_irn_mode(n);
881 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
882 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
885 n = equivalent_node_neutral_zero(n);
889 left = get_Add_left(n);
890 right = get_Add_right(n);
893 if (get_Sub_right(left) == right) {
896 n = get_Sub_left(left);
897 if (mode == get_irn_mode(n)) {
898 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
904 if (get_Sub_right(right) == left) {
907 n = get_Sub_left(right);
908 if (mode == get_irn_mode(n)) {
909 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
915 } /* equivalent_node_Add */
918 * optimize operations that are not commutative but have neutral 0 on left,
921 static ir_node *equivalent_node_left_zero(ir_node *n) {
924 ir_node *a = get_binop_left(n);
925 ir_node *b = get_binop_right(n);
927 if (is_Const(b) && is_Const_null(b)) {
930 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
933 } /* equivalent_node_left_zero */
935 #define equivalent_node_Shl equivalent_node_left_zero
936 #define equivalent_node_Shr equivalent_node_left_zero
937 #define equivalent_node_Shrs equivalent_node_left_zero
938 #define equivalent_node_Rot equivalent_node_left_zero
941 * Optimize a - 0 and (a + x) - x (for modes with wrap-around).
943 * The second one looks strange, but this construct
944 * is used heavily in the LCC sources :-).
946 * Beware: The Mode of a Sub may be different than the mode of its
947 * predecessors, so we could not return a predecessors in all cases.
949 static ir_node *equivalent_node_Sub(ir_node *n) {
952 ir_mode *mode = get_irn_mode(n);
954 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
955 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
958 b = get_Sub_right(n);
960 /* Beware: modes might be different */
961 if (is_Const(b) && is_Const_null(b)) {
962 ir_node *a = get_Sub_left(n);
963 if (mode == get_irn_mode(a)) {
966 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
970 } /* equivalent_node_Sub */
974 * Optimize an "idempotent unary op", ie op(op(n)) = n.
977 * -(-a) == a, but might overflow two times.
978 * We handle it anyway here but the better way would be a
979 * flag. This would be needed for Pascal for instance.
981 static ir_node *equivalent_node_idempotent_unop(ir_node *n) {
983 ir_node *pred = get_unop_op(n);
985 /* optimize symmetric unop */
986 if (get_irn_op(pred) == get_irn_op(n)) {
987 n = get_unop_op(pred);
988 DBG_OPT_ALGSIM2(oldn, pred, n, FS_OPT_IDEM_UNARY);
991 } /* equivalent_node_idempotent_unop */
993 /** Optimize Not(Not(x)) == x. */
994 #define equivalent_node_Not equivalent_node_idempotent_unop
996 /** -(-x) == x ??? Is this possible or can --x raise an
997 out of bounds exception if min =! max? */
998 #define equivalent_node_Minus equivalent_node_idempotent_unop
1001 * Optimize a * 1 = 1 * a = a.
1003 static ir_node *equivalent_node_Mul(ir_node *n) {
1005 ir_node *a = get_Mul_left(n);
1007 /* we can handle here only the n * n = n bit cases */
1008 if (get_irn_mode(n) == get_irn_mode(a)) {
1009 ir_node *b = get_Mul_right(n);
1011 /* Mul is commutative and has again an other neutral element. */
1012 if (is_Const(a) && is_Const_one(a)) {
1014 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1015 } else if (is_Const(b) && is_Const_one(b)) {
1017 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1021 } /* equivalent_node_Mul */
1024 * Optimize a / 1 = a.
1026 static ir_node *equivalent_node_Div(ir_node *n) {
1027 ir_node *a = get_Div_left(n);
1028 ir_node *b = get_Div_right(n);
1030 /* Div is not commutative. */
1031 if (is_Const(b) && is_Const_one(b)) { /* div(x, 1) == x */
1032 /* Turn Div into a tuple (mem, bad, a) */
1033 ir_node *mem = get_Div_mem(n);
1034 ir_node *blk = get_irn_n(n, -1);
1035 turn_into_tuple(n, pn_Div_max);
1036 set_Tuple_pred(n, pn_Div_M, mem);
1037 set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(current_ir_graph, blk));
1038 set_Tuple_pred(n, pn_Div_X_except, new_Bad()); /* no exception */
1039 set_Tuple_pred(n, pn_Div_res, a);
1042 } /* equivalent_node_Div */
1045 * Optimize a / 1.0 = a.
1047 static ir_node *equivalent_node_Quot(ir_node *n) {
1048 ir_node *a = get_Quot_left(n);
1049 ir_node *b = get_Quot_right(n);
1051 /* Div is not commutative. */
1052 if (is_Const(b) && is_Const_one(b)) { /* Quot(x, 1) == x */
1053 /* Turn Quot into a tuple (mem, jmp, bad, a) */
1054 ir_node *mem = get_Quot_mem(n);
1055 ir_node *blk = get_irn_n(n, -1);
1056 turn_into_tuple(n, pn_Quot_max);
1057 set_Tuple_pred(n, pn_Quot_M, mem);
1058 set_Tuple_pred(n, pn_Quot_X_regular, new_r_Jmp(current_ir_graph, blk));
1059 set_Tuple_pred(n, pn_Quot_X_except, new_Bad()); /* no exception */
1060 set_Tuple_pred(n, pn_Quot_res, a);
1063 } /* equivalent_node_Quot */
1066 * Optimize a / 1 = a.
1068 static ir_node *equivalent_node_DivMod(ir_node *n) {
1069 ir_node *b = get_DivMod_right(n);
1071 /* Div is not commutative. */
1072 if (is_Const(b) && is_Const_one(b)) { /* div(x, 1) == x */
1073 /* Turn DivMod into a tuple (mem, jmp, bad, a, 0) */
1074 ir_node *a = get_DivMod_left(n);
1075 ir_node *mem = get_Div_mem(n);
1076 ir_node *blk = get_irn_n(n, -1);
1077 ir_mode *mode = get_DivMod_resmode(n);
1079 turn_into_tuple(n, pn_DivMod_max);
1080 set_Tuple_pred(n, pn_DivMod_M, mem);
1081 set_Tuple_pred(n, pn_DivMod_X_regular, new_r_Jmp(current_ir_graph, blk));
1082 set_Tuple_pred(n, pn_DivMod_X_except, new_Bad()); /* no exception */
1083 set_Tuple_pred(n, pn_DivMod_res_div, a);
1084 set_Tuple_pred(n, pn_DivMod_res_mod, new_Const(mode, get_mode_null(mode)));
1087 } /* equivalent_node_DivMod */
1090 * Use algebraic simplification a | a = a | 0 = 0 | a = a.
1092 static ir_node *equivalent_node_Or(ir_node *n) {
1095 ir_node *a = get_Or_left(n);
1096 ir_node *b = get_Or_right(n);
1099 n = a; /* Or has it's own neutral element */
1100 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_OR);
1101 } else if (is_Const(a) && is_Const_null(a)) {
1103 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1104 } else if (is_Const(b) && is_Const_null(b)) {
1106 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1110 } /* equivalent_node_Or */
1113 * Optimize a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a.
1115 static ir_node *equivalent_node_And(ir_node *n) {
1118 ir_node *a = get_And_left(n);
1119 ir_node *b = get_And_right(n);
1122 n = a; /* And has it's own neutral element */
1123 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_AND);
1126 if (is_Const(a) && is_Const_all_one(a)) {
1128 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1131 if (is_Const(b) && is_Const_all_one(b)) {
1133 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1137 if (b == get_Or_left(a) || b == get_Or_right(a)) {
1140 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1145 if (a == get_Or_left(b) || a == get_Or_right(b)) {
1148 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1154 } /* equivalent_node_And */
1157 * Try to remove useless Conv's:
1159 static ir_node *equivalent_node_Conv(ir_node *n) {
1161 ir_node *a = get_Conv_op(n);
1163 ir_mode *n_mode = get_irn_mode(n);
1164 ir_mode *a_mode = get_irn_mode(a);
1166 if (n_mode == a_mode) { /* No Conv necessary */
1167 if (get_Conv_strict(n)) {
1168 /* special case: the predecessor might be a also a Conv */
1170 if (! get_Conv_strict(a)) {
1171 /* first one is not strict, kick it */
1172 set_Conv_op(n, get_Conv_op(a));
1175 /* else both are strict conv, second is superflous */
1176 } else if(is_Proj(a)) {
1177 ir_node *pred = get_Proj_pred(a);
1179 /* loads always return with the exact precision of n_mode */
1180 assert(get_Load_mode(pred) == n_mode);
1185 /* leave strict floating point Conv's */
1189 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1190 } else if (is_Conv(a)) { /* Conv(Conv(b)) */
1191 ir_node *b = get_Conv_op(a);
1192 ir_mode *b_mode = get_irn_mode(b);
1194 if (n_mode == b_mode) {
1195 if (n_mode == mode_b) {
1196 n = b; /* Convb(Conv*(xxxb(...))) == xxxb(...) */
1197 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1198 } else if (mode_is_int(n_mode)) {
1199 if (get_mode_size_bits(b_mode) <= get_mode_size_bits(a_mode)) {
1200 n = b; /* ConvS(ConvL(xxxS(...))) == xxxS(...) */
1201 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1207 } /* equivalent_node_Conv */
1210 * A Cast may be removed if the type of the previous node
1211 * is already the type of the Cast.
1213 static ir_node *equivalent_node_Cast(ir_node *n) {
1215 ir_node *pred = get_Cast_op(n);
1217 if (get_irn_type(pred) == get_Cast_type(n)) {
1219 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CAST);
1222 } /* equivalent_node_Cast */
1225 * Several optimizations:
1226 * - no Phi in start block.
1227 * - remove Id operators that are inputs to Phi
1228 * - fold Phi-nodes, iff they have only one predecessor except
1231 static ir_node *equivalent_node_Phi(ir_node *n) {
1235 ir_node *block = NULL; /* to shutup gcc */
1236 ir_node *first_val = NULL; /* to shutup gcc */
1238 if (!get_opt_normalize()) return n;
1240 n_preds = get_Phi_n_preds(n);
1242 block = get_nodes_block(n);
1243 /* @@@ fliegt 'raus, sollte aber doch immer wahr sein!!!
1244 assert(get_irn_arity(block) == n_preds && "phi in wrong block!"); */
1245 if ((is_Block_dead(block)) || /* Control dead */
1246 (block == get_irg_start_block(current_ir_graph))) /* There should be no Phi nodes */
1247 return new_Bad(); /* in the Start Block. */
1249 if (n_preds == 0) return n; /* Phi of dead Region without predecessors. */
1251 /* If the Block has a Bad pred, we also have one. */
1252 for (i = 0; i < n_preds; ++i)
1253 if (is_Bad(get_Block_cfgpred(block, i)))
1254 set_Phi_pred(n, i, new_Bad());
1256 /* Find first non-self-referencing input */
1257 for (i = 0; i < n_preds; ++i) {
1258 first_val = get_Phi_pred(n, i);
1259 if ( (first_val != n) /* not self pointer */
1261 && (! is_Bad(first_val))
1263 ) { /* value not dead */
1264 break; /* then found first value. */
1269 /* A totally Bad or self-referencing Phi (we didn't break the above loop) */
1273 /* search for rest of inputs, determine if any of these
1274 are non-self-referencing */
1275 while (++i < n_preds) {
1276 ir_node *scnd_val = get_Phi_pred(n, i);
1277 if ( (scnd_val != n)
1278 && (scnd_val != first_val)
1280 && (! is_Bad(scnd_val))
1288 /* Fold, if no multiple distinct non-self-referencing inputs */
1290 DBG_OPT_PHI(oldn, n);
1293 } /* equivalent_node_Phi */
1296 * Several optimizations:
1297 * - no Sync in start block.
1298 * - fold Sync-nodes, iff they have only one predecessor except
1301 static ir_node *equivalent_node_Sync(ir_node *n) {
1305 ir_node *first_val = NULL; /* to shutup gcc */
1307 if (!get_opt_normalize()) return n;
1309 n_preds = get_Sync_n_preds(n);
1311 /* Find first non-self-referencing input */
1312 for (i = 0; i < n_preds; ++i) {
1313 first_val = get_Sync_pred(n, i);
1314 if ((first_val != n) /* not self pointer */ &&
1315 (! is_Bad(first_val))
1316 ) { /* value not dead */
1317 break; /* then found first value. */
1322 /* A totally Bad or self-referencing Sync (we didn't break the above loop) */
1325 /* search the rest of inputs, determine if any of these
1326 are non-self-referencing */
1327 while (++i < n_preds) {
1328 ir_node *scnd_val = get_Sync_pred(n, i);
1329 if ((scnd_val != n) &&
1330 (scnd_val != first_val) &&
1331 (! is_Bad(scnd_val))
1337 /* Fold, if no multiple distinct non-self-referencing inputs */
1339 DBG_OPT_SYNC(oldn, n);
1342 } /* equivalent_node_Sync */
1345 * Optimize Proj(Tuple) and gigo() for ProjX in Bad block,
1346 * ProjX(Load) and ProjX(Store).
1348 static ir_node *equivalent_node_Proj(ir_node *proj) {
1349 ir_node *oldn = proj;
1350 ir_node *a = get_Proj_pred(proj);
1353 /* Remove the Tuple/Proj combination. */
1354 if ( get_Proj_proj(proj) <= get_Tuple_n_preds(a) ) {
1355 proj = get_Tuple_pred(a, get_Proj_proj(proj));
1356 DBG_OPT_TUPLE(oldn, a, proj);
1358 /* This should not happen! */
1359 assert(! "found a Proj with higher number than Tuple predecessors");
1362 } else if (get_irn_mode(proj) == mode_X) {
1363 if (is_Block_dead(get_nodes_block(skip_Proj(proj)))) {
1364 /* Remove dead control flow -- early gigo(). */
1366 } else if (get_opt_ldst_only_null_ptr_exceptions()) {
1368 /* get the Load address */
1369 ir_node *addr = get_Load_ptr(a);
1370 ir_node *blk = get_irn_n(a, -1);
1373 if (value_not_null(addr, &confirm)) {
1374 if (confirm == NULL) {
1375 /* this node may float if it did not depend on a Confirm */
1376 set_irn_pinned(a, op_pin_state_floats);
1378 if (get_Proj_proj(proj) == pn_Load_X_except) {
1379 DBG_OPT_EXC_REM(proj);
1382 return new_r_Jmp(current_ir_graph, blk);
1384 } else if (is_Store(a)) {
1385 /* get the load/store address */
1386 ir_node *addr = get_Store_ptr(a);
1387 ir_node *blk = get_irn_n(a, -1);
1390 if (value_not_null(addr, &confirm)) {
1391 if (confirm == NULL) {
1392 /* this node may float if it did not depend on a Confirm */
1393 set_irn_pinned(a, op_pin_state_floats);
1395 if (get_Proj_proj(proj) == pn_Store_X_except) {
1396 DBG_OPT_EXC_REM(proj);
1399 return new_r_Jmp(current_ir_graph, blk);
1406 } /* equivalent_node_Proj */
1411 static ir_node *equivalent_node_Id(ir_node *n) {
1416 } while (get_irn_op(n) == op_Id);
1418 DBG_OPT_ID(oldn, n);
1420 } /* equivalent_node_Id */
1425 static ir_node *equivalent_node_Mux(ir_node *n)
1427 ir_node *oldn = n, *sel = get_Mux_sel(n);
1428 tarval *ts = value_of(sel);
1430 /* Mux(true, f, t) == t */
1431 if (ts == tarval_b_true) {
1432 n = get_Mux_true(n);
1433 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1435 /* Mux(false, f, t) == f */
1436 else if (ts == tarval_b_false) {
1437 n = get_Mux_false(n);
1438 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1440 /* Mux(v, x, x) == x */
1441 else if (get_Mux_false(n) == get_Mux_true(n)) {
1442 n = get_Mux_true(n);
1443 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1445 else if (is_Proj(sel) && !mode_honor_signed_zeros(get_irn_mode(n))) {
1446 ir_node *cmp = get_Proj_pred(sel);
1447 long proj_nr = get_Proj_proj(sel);
1448 ir_node *b = get_Mux_false(n);
1449 ir_node *a = get_Mux_true(n);
1452 * Note: normalization puts the constant on the right site,
1453 * so we check only one case.
1455 * Note further that these optimization work even for floating point
1456 * with NaN's because -NaN == NaN.
1457 * However, if +0 and -0 is handled differently, we cannot use the first one.
1459 if (is_Cmp(cmp) && get_Cmp_left(cmp) == a) {
1460 ir_node *cmp_r = get_Cmp_right(cmp);
1461 if (is_Const(cmp_r) && is_Const_null(cmp_r)) {
1462 /* Mux(a CMP 0, X, a) */
1463 if (is_Minus(b) && get_Minus_op(b) == a) {
1464 /* Mux(a CMP 0, -a, a) */
1465 if (proj_nr == pn_Cmp_Eq) {
1466 /* Mux(a == 0, -a, a) ==> -a */
1468 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1469 } else if (proj_nr == pn_Cmp_Lg || proj_nr == pn_Cmp_Ne) {
1470 /* Mux(a != 0, -a, a) ==> a */
1472 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1474 } else if (is_Const(b) && is_Const_null(b)) {
1475 /* Mux(a CMP 0, 0, a) */
1476 if (proj_nr == pn_Cmp_Lg || proj_nr == pn_Cmp_Ne) {
1477 /* Mux(a != 0, 0, a) ==> a */
1479 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1480 } else if (proj_nr == pn_Cmp_Eq) {
1481 /* Mux(a == 0, 0, a) ==> 0 */
1483 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1490 } /* equivalent_node_Mux */
1493 * Returns a equivalent node of a Psi: if a condition is true
1494 * and all previous conditions are false we know its value.
1495 * If all conditions are false its value is the default one.
1497 static ir_node *equivalent_node_Psi(ir_node *n) {
1499 return equivalent_node_Mux(n);
1501 } /* equivalent_node_Psi */
1504 * Optimize -a CMP -b into b CMP a.
1505 * This works only for for modes where unary Minus
1507 * Note that two-complement integers can Overflow
1508 * so it will NOT work.
1510 * For == and != can be handled in Proj(Cmp)
1512 static ir_node *equivalent_node_Cmp(ir_node *n) {
1513 ir_node *left = get_Cmp_left(n);
1514 ir_node *right = get_Cmp_right(n);
1516 if (is_Minus(left) && is_Minus(right) &&
1517 !mode_overflow_on_unary_Minus(get_irn_mode(left))) {
1518 left = get_Minus_op(left);
1519 right = get_Minus_op(right);
1520 set_Cmp_left(n, right);
1521 set_Cmp_right(n, left);
1524 } /* equivalent_node_Cmp */
1527 * Remove Confirm nodes if setting is on.
1528 * Replace Confirms(x, '=', Constlike) by Constlike.
1530 static ir_node *equivalent_node_Confirm(ir_node *n) {
1531 ir_node *pred = get_Confirm_value(n);
1532 pn_Cmp pnc = get_Confirm_cmp(n);
1534 if (is_Confirm(pred) && pnc == get_Confirm_cmp(pred)) {
1536 * rare case: two identical Confirms one after another,
1537 * replace the second one with the first.
1541 if (pnc == pn_Cmp_Eq) {
1542 ir_node *bound = get_Confirm_bound(n);
1545 * Optimize a rare case:
1546 * Confirm(x, '=', Constlike) ==> Constlike
1548 if (is_irn_constlike(bound)) {
1549 DBG_OPT_CONFIRM(n, bound);
1553 return get_opt_remove_confirm() ? get_Confirm_value(n) : n;
1557 * Optimize CopyB(mem, x, x) into a Nop.
1559 static ir_node *equivalent_node_CopyB(ir_node *n) {
1560 ir_node *a = get_CopyB_dst(n);
1561 ir_node *b = get_CopyB_src(n);
1564 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
1565 ir_node *mem = get_CopyB_mem(n);
1566 ir_node *blk = get_nodes_block(n);
1567 turn_into_tuple(n, pn_CopyB_max);
1568 set_Tuple_pred(n, pn_CopyB_M, mem);
1569 set_Tuple_pred(n, pn_CopyB_X_regular, new_r_Jmp(current_ir_graph, blk));
1570 set_Tuple_pred(n, pn_CopyB_X_except, new_Bad()); /* no exception */
1571 set_Tuple_pred(n, pn_CopyB_M_except, new_Bad());
1574 } /* equivalent_node_CopyB */
1577 * Optimize Bounds(idx, idx, upper) into idx.
1579 static ir_node *equivalent_node_Bound(ir_node *n) {
1580 ir_node *idx = get_Bound_index(n);
1581 ir_node *lower = get_Bound_lower(n);
1584 /* By definition lower < upper, so if idx == lower -->
1585 lower <= idx && idx < upper */
1587 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
1590 ir_node *pred = skip_Proj(idx);
1592 if (get_irn_op(pred) == op_Bound) {
1594 * idx was Bounds_check previously, it is still valid if
1595 * lower <= pred_lower && pred_upper <= upper.
1597 ir_node *upper = get_Bound_upper(n);
1598 if (get_Bound_lower(pred) == lower &&
1599 get_Bound_upper(pred) == upper) {
1601 * One could expect that we simply return the previous
1602 * Bound here. However, this would be wrong, as we could
1603 * add an exception Proj to a new location then.
1604 * So, we must turn in into a tuple.
1611 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
1612 ir_node *mem = get_Bound_mem(n);
1613 ir_node *blk = get_nodes_block(n);
1614 turn_into_tuple(n, pn_Bound_max);
1615 set_Tuple_pred(n, pn_Bound_M, mem);
1616 set_Tuple_pred(n, pn_Bound_X_regular, new_r_Jmp(current_ir_graph, blk)); /* no exception */
1617 set_Tuple_pred(n, pn_Bound_X_except, new_Bad()); /* no exception */
1618 set_Tuple_pred(n, pn_Bound_res, idx);
1621 } /* equivalent_node_Bound */
1624 * equivalent_node() returns a node equivalent to input n. It skips all nodes that
1625 * perform no actual computation, as, e.g., the Id nodes. It does not create
1626 * new nodes. It is therefore safe to free n if the node returned is not n.
1627 * If a node returns a Tuple we can not just skip it. If the size of the
1628 * in array fits, we transform n into a tuple (e.g., Div).
1630 ir_node *equivalent_node(ir_node *n) {
1631 if (n->op->ops.equivalent_node)
1632 return n->op->ops.equivalent_node(n);
1634 } /* equivalent_node */
1637 * Sets the default equivalent node operation for an ir_op_ops.
1639 * @param code the opcode for the default operation
1640 * @param ops the operations initialized
1645 static ir_op_ops *firm_set_default_equivalent_node(ir_opcode code, ir_op_ops *ops)
1649 ops->equivalent_node = equivalent_node_##a; \
1689 } /* firm_set_default_equivalent_node */
1692 * Returns non-zero if a node is a Phi node
1693 * with all predecessors constant.
1695 static int is_const_Phi(ir_node *n) {
1698 if (! is_Phi(n) || get_irn_arity(n) == 0)
1700 for (i = get_irn_arity(n) - 1; i >= 0; --i)
1701 if (! is_Const(get_irn_n(n, i)))
1704 } /* is_const_Phi */
1707 * Apply an evaluator on a binop with a constant operators (and one Phi).
1709 * @param phi the Phi node
1710 * @param other the other operand
1711 * @param eval an evaluator function
1712 * @param mode the mode of the result, may be different from the mode of the Phi!
1713 * @param left if non-zero, other is the left operand, else the right
1715 * @return a new Phi node if the conversion was successful, NULL else
1717 static ir_node *apply_binop_on_phi(ir_node *phi, tarval *other, tarval *(*eval)(tarval *, tarval *), ir_mode *mode, int left) {
1722 int i, n = get_irn_arity(phi);
1724 NEW_ARR_A(void *, res, n);
1726 for (i = 0; i < n; ++i) {
1727 pred = get_irn_n(phi, i);
1728 tv = get_Const_tarval(pred);
1729 tv = eval(other, tv);
1731 if (tv == tarval_bad) {
1732 /* folding failed, bad */
1738 for (i = 0; i < n; ++i) {
1739 pred = get_irn_n(phi, i);
1740 tv = get_Const_tarval(pred);
1741 tv = eval(tv, other);
1743 if (tv == tarval_bad) {
1744 /* folding failed, bad */
1750 irg = current_ir_graph;
1751 for (i = 0; i < n; ++i) {
1752 pred = get_irn_n(phi, i);
1753 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
1754 mode, res[i], get_Const_type(pred));
1756 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
1757 } /* apply_binop_on_phi */
1760 * Apply an evaluator on a unop with a constant operator (a Phi).
1762 * @param phi the Phi node
1763 * @param eval an evaluator function
1765 * @return a new Phi node if the conversion was successful, NULL else
1767 static ir_node *apply_unop_on_phi(ir_node *phi, tarval *(*eval)(tarval *)) {
1773 int i, n = get_irn_arity(phi);
1775 NEW_ARR_A(void *, res, n);
1776 for (i = 0; i < n; ++i) {
1777 pred = get_irn_n(phi, i);
1778 tv = get_Const_tarval(pred);
1781 if (tv == tarval_bad) {
1782 /* folding failed, bad */
1787 mode = get_irn_mode(phi);
1788 irg = current_ir_graph;
1789 for (i = 0; i < n; ++i) {
1790 pred = get_irn_n(phi, i);
1791 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
1792 mode, res[i], get_Const_type(pred));
1794 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
1795 } /* apply_unop_on_phi */
1798 * Apply a conversion on a constant operator (a Phi).
1800 * @param phi the Phi node
1802 * @return a new Phi node if the conversion was successful, NULL else
1804 static ir_node *apply_conv_on_phi(ir_node *phi, ir_mode *mode) {
1809 int i, n = get_irn_arity(phi);
1811 NEW_ARR_A(void *, res, n);
1812 for (i = 0; i < n; ++i) {
1813 pred = get_irn_n(phi, i);
1814 tv = get_Const_tarval(pred);
1815 tv = tarval_convert_to(tv, mode);
1817 if (tv == tarval_bad) {
1818 /* folding failed, bad */
1823 irg = current_ir_graph;
1824 for (i = 0; i < n; ++i) {
1825 pred = get_irn_n(phi, i);
1826 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
1827 mode, res[i], get_Const_type(pred));
1829 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
1830 } /* apply_conv_on_phi */
1833 * Transform AddP(P, ConvIs(Iu)), AddP(P, ConvIu(Is)) and
1834 * SubP(P, ConvIs(Iu)), SubP(P, ConvIu(Is)).
1835 * If possible, remove the Conv's.
1837 static ir_node *transform_node_AddSub(ir_node *n) {
1838 ir_mode *mode = get_irn_mode(n);
1840 if (mode_is_reference(mode)) {
1841 ir_node *left = get_binop_left(n);
1842 ir_node *right = get_binop_right(n);
1843 int ref_bits = get_mode_size_bits(mode);
1845 if (is_Conv(left)) {
1846 ir_mode *mode = get_irn_mode(left);
1847 int bits = get_mode_size_bits(mode);
1849 if (ref_bits == bits &&
1850 mode_is_int(mode) &&
1851 get_mode_arithmetic(mode) == irma_twos_complement) {
1852 ir_node *pre = get_Conv_op(left);
1853 ir_mode *pre_mode = get_irn_mode(pre);
1855 if (mode_is_int(pre_mode) &&
1856 get_mode_size_bits(pre_mode) == bits &&
1857 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
1858 /* ok, this conv just changes to sign, moreover the calculation
1859 * is done with same number of bits as our address mode, so
1860 * we can ignore the conv as address calculation can be viewed
1861 * as either signed or unsigned
1863 set_binop_left(n, pre);
1868 if (is_Conv(right)) {
1869 ir_mode *mode = get_irn_mode(right);
1870 int bits = get_mode_size_bits(mode);
1872 if (ref_bits == bits &&
1873 mode_is_int(mode) &&
1874 get_mode_arithmetic(mode) == irma_twos_complement) {
1875 ir_node *pre = get_Conv_op(right);
1876 ir_mode *pre_mode = get_irn_mode(pre);
1878 if (mode_is_int(pre_mode) &&
1879 get_mode_size_bits(pre_mode) == bits &&
1880 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
1881 /* ok, this conv just changes to sign, moreover the calculation
1882 * is done with same number of bits as our address mode, so
1883 * we can ignore the conv as address calculation can be viewed
1884 * as either signed or unsigned
1886 set_binop_right(n, pre);
1892 } /* transform_node_AddSub */
1894 #define HANDLE_BINOP_PHI(eval, a, b, c, mode) \
1896 if (is_Const(b) && is_const_Phi(a)) { \
1897 /* check for Op(Phi, Const) */ \
1898 c = apply_binop_on_phi(a, get_Const_tarval(b), eval, mode, 0);\
1900 else if (is_Const(a) && is_const_Phi(b)) { \
1901 /* check for Op(Const, Phi) */ \
1902 c = apply_binop_on_phi(b, get_Const_tarval(a), eval, mode, 1);\
1905 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
1909 #define HANDLE_UNOP_PHI(eval, a, c) \
1911 if (is_const_Phi(a)) { \
1912 /* check for Op(Phi) */ \
1913 c = apply_unop_on_phi(a, eval); \
1915 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
1921 * Do the AddSub optimization, then Transform
1922 * Constant folding on Phi
1923 * Add(a,a) -> Mul(a, 2)
1924 * Add(Mul(a, x), a) -> Mul(a, x+1)
1925 * if the mode is integer or float.
1926 * Transform Add(a,-b) into Sub(a,b).
1927 * Reassociation might fold this further.
1929 static ir_node *transform_node_Add(ir_node *n) {
1931 ir_node *a, *b, *c, *oldn = n;
1933 n = transform_node_AddSub(n);
1935 a = get_Add_left(n);
1936 b = get_Add_right(n);
1938 mode = get_irn_mode(n);
1939 HANDLE_BINOP_PHI(tarval_add, a, b, c, mode);
1941 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
1942 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
1945 if (mode_is_num(mode)) {
1946 /* the following code leads to endless recursion when Mul are replaced by a simple instruction chain */
1947 if (!is_arch_dep_running() && a == b && mode_is_int(mode)) {
1948 ir_node *block = get_irn_n(n, -1);
1951 get_irn_dbg_info(n),
1955 new_r_Const_long(current_ir_graph, block, mode, 2),
1957 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_A);
1962 get_irn_dbg_info(n),
1968 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
1973 get_irn_dbg_info(n),
1979 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
1982 if (! is_reassoc_running()) {
1983 /* do NOT execute this code if reassociation is enabled, it does the inverse! */
1985 ir_node *ma = get_Mul_left(a);
1986 ir_node *mb = get_Mul_right(a);
1989 ir_node *blk = get_irn_n(n, -1);
1991 get_irn_dbg_info(n), current_ir_graph, blk,
1994 get_irn_dbg_info(n), current_ir_graph, blk,
1996 new_r_Const_long(current_ir_graph, blk, mode, 1),
1999 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
2001 } else if (b == mb) {
2002 ir_node *blk = get_irn_n(n, -1);
2004 get_irn_dbg_info(n), current_ir_graph, blk,
2007 get_irn_dbg_info(n), current_ir_graph, blk,
2009 new_r_Const_long(current_ir_graph, blk, mode, 1),
2012 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
2017 ir_node *ma = get_Mul_left(b);
2018 ir_node *mb = get_Mul_right(b);
2021 ir_node *blk = get_irn_n(n, -1);
2023 get_irn_dbg_info(n), current_ir_graph, blk,
2026 get_irn_dbg_info(n), current_ir_graph, blk,
2028 new_r_Const_long(current_ir_graph, blk, mode, 1),
2031 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
2035 ir_node *blk = get_irn_n(n, -1);
2037 get_irn_dbg_info(n), current_ir_graph, blk,
2040 get_irn_dbg_info(n), current_ir_graph, blk,
2042 new_r_Const_long(current_ir_graph, blk, mode, 1),
2045 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
2050 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2051 /* Here we rely on constants be on the RIGHT side */
2053 ir_node *op = get_Not_op(a);
2055 if (is_Const(b) && is_Const_one(b)) {
2057 ir_node *blk = get_irn_n(n, -1);
2058 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, op, mode);
2059 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_PLUS_1);
2064 ir_node *blk = get_irn_n(n, -1);
2065 n = new_r_Const(current_ir_graph, blk, mode, get_mode_minus_one(mode));
2066 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X);
2071 ir_node *op = get_Not_op(b);
2075 ir_node *blk = get_irn_n(n, -1);
2076 n = new_r_Const(current_ir_graph, blk, mode, get_mode_minus_one(mode));
2077 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X);
2084 } /* transform_node_Add */
2087 * returns -cnst or NULL if impossible
2089 static ir_node *const_negate(ir_node *cnst) {
2090 tarval *tv = tarval_neg(get_Const_tarval(cnst));
2091 dbg_info *dbgi = get_irn_dbg_info(cnst);
2092 ir_graph *irg = get_irn_irg(cnst);
2093 ir_node *block = get_nodes_block(cnst);
2094 ir_mode *mode = get_irn_mode(cnst);
2095 if (tv == tarval_bad) return NULL;
2096 return new_rd_Const(dbgi, irg, block, mode, tv);
2100 * Do the AddSub optimization, then Transform
2101 * Constant folding on Phi
2102 * Sub(0,a) -> Minus(a)
2103 * Sub(Mul(a, x), a) -> Mul(a, x-1)
2104 * Sub(Sub(x, y), b) -> Sub(x, Add(y,b))
2105 * Sub(Add(a, x), x) -> a
2106 * Sub(x, Add(x, a)) -> -a
2107 * Sub(x, Const) -> Add(x, -Const)
2109 static ir_node *transform_node_Sub(ir_node *n) {
2114 n = transform_node_AddSub(n);
2116 a = get_Sub_left(n);
2117 b = get_Sub_right(n);
2119 mode = get_irn_mode(n);
2122 HANDLE_BINOP_PHI(tarval_sub, a, b, c, mode);
2124 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2125 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2128 if (is_Const(b) && get_irn_mode(b) != mode_P) {
2129 /* a - C -> a + (-C) */
2130 ir_node *cnst = const_negate(b);
2132 ir_node *block = get_nodes_block(n);
2133 dbg_info *dbgi = get_irn_dbg_info(n);
2134 ir_graph *irg = get_irn_irg(n);
2136 n = new_rd_Add(dbgi, irg, block, a, cnst, mode);
2137 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2142 if (is_Minus(a)) { /* (-a) - b -> -(a + b) */
2143 ir_graph *irg = current_ir_graph;
2144 dbg_info *dbg = get_irn_dbg_info(n);
2145 ir_node *block = get_nodes_block(n);
2146 ir_node *left = get_Minus_op(a);
2147 ir_node *add = new_rd_Add(dbg, irg, block, left, b, mode);
2149 n = new_rd_Minus(dbg, irg, block, add, mode);
2150 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2152 } else if (is_Minus(b)) { /* a - (-b) -> a + b */
2153 ir_graph *irg = current_ir_graph;
2154 dbg_info *dbg = get_irn_dbg_info(n);
2155 ir_node *block = get_nodes_block(n);
2156 ir_node *right = get_Minus_op(b);
2158 n = new_rd_Add(dbg, irg, block, a, right, mode);
2159 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MINUS);
2161 } else if (is_Sub(b)) { /* a - (b - c) -> a + (c - b) */
2162 ir_graph *irg = current_ir_graph;
2163 dbg_info *s_dbg = get_irn_dbg_info(b);
2164 ir_node *s_block = get_nodes_block(b);
2165 ir_node *s_left = get_Sub_right(b);
2166 ir_node *s_right = get_Sub_left(b);
2167 ir_mode *s_mode = get_irn_mode(b);
2168 ir_node *sub = new_rd_Sub(s_dbg, irg, s_block, s_left, s_right, s_mode);
2169 dbg_info *a_dbg = get_irn_dbg_info(n);
2170 ir_node *a_block = get_nodes_block(n);
2172 n = new_rd_Add(a_dbg, irg, a_block, a, sub, mode);
2173 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2175 } else if (is_Mul(b)) { /* a - (b * C) -> a + (b * -C) */
2176 ir_node *m_right = get_Mul_right(b);
2177 if (is_Const(m_right)) {
2178 ir_node *cnst2 = const_negate(m_right);
2179 if (cnst2 != NULL) {
2180 ir_graph *irg = current_ir_graph;
2181 dbg_info *m_dbg = get_irn_dbg_info(b);
2182 ir_node *m_block = get_nodes_block(b);
2183 ir_node *m_left = get_Mul_left(b);
2184 ir_mode *m_mode = get_irn_mode(b);
2185 ir_node *mul = new_rd_Mul(m_dbg, irg, m_block, m_left, cnst2, m_mode);
2186 dbg_info *a_dbg = get_irn_dbg_info(n);
2187 ir_node *a_block = get_nodes_block(n);
2189 n = new_rd_Add(a_dbg, irg, a_block, a, mul, mode);
2190 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2196 /* Beware of Sub(P, P) which cannot be optimized into a simple Minus ... */
2197 if (mode_is_num(mode) && mode == get_irn_mode(a) && is_Const(a) && is_Const_null(a)) {
2199 get_irn_dbg_info(n),
2204 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_0_A);
2208 if (mode_wrap_around(mode)) {
2209 ir_node *left = get_Add_left(a);
2210 ir_node *right = get_Add_right(a);
2212 /* FIXME: Does the Conv's work only for two complement or generally? */
2214 if (mode != get_irn_mode(right)) {
2215 /* This Sub is an effective Cast */
2216 right = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), right, mode);
2219 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2221 } else if (right == b) {
2222 if (mode != get_irn_mode(left)) {
2223 /* This Sub is an effective Cast */
2224 left = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), left, mode);
2227 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2233 if (mode_wrap_around(mode)) {
2234 ir_node *left = get_Add_left(b);
2235 ir_node *right = get_Add_right(b);
2237 /* FIXME: Does the Conv's work only for two complement or generally? */
2239 ir_mode *r_mode = get_irn_mode(right);
2241 n = new_r_Minus(get_irn_irg(n), get_irn_n(n, -1), right, r_mode);
2242 if (mode != r_mode) {
2243 /* This Sub is an effective Cast */
2244 n = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), n, mode);
2246 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2248 } else if (right == a) {
2249 ir_mode *l_mode = get_irn_mode(left);
2251 n = new_r_Minus(get_irn_irg(n), get_irn_n(n, -1), left, l_mode);
2252 if (mode != l_mode) {
2253 /* This Sub is an effective Cast */
2254 n = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), n, mode);
2256 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2261 if (mode_is_int(mode) && is_Conv(a) && is_Conv(b)) {
2262 ir_mode *mode = get_irn_mode(a);
2264 if (mode == get_irn_mode(b)) {
2270 /* check if it's allowed to skip the conv */
2271 ma = get_irn_mode(a);
2272 mb = get_irn_mode(b);
2274 if (mode_is_reference(ma) && mode_is_reference(mb)) {
2275 /* SubInt(ConvInt(aP), ConvInt(bP)) -> SubInt(aP,bP) */
2277 set_Sub_right(n, b);
2283 /* do NOT execute this code if reassociation is enabled, it does the inverse! */
2284 if (!is_reassoc_running() && is_Mul(a)) {
2285 ir_node *ma = get_Mul_left(a);
2286 ir_node *mb = get_Mul_right(a);
2289 ir_node *blk = get_irn_n(n, -1);
2291 get_irn_dbg_info(n),
2292 current_ir_graph, blk,
2295 get_irn_dbg_info(n),
2296 current_ir_graph, blk,
2298 new_r_Const_long(current_ir_graph, blk, mode, 1),
2301 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2303 } else if (mb == b) {
2304 ir_node *blk = get_irn_n(n, -1);
2306 get_irn_dbg_info(n),
2307 current_ir_graph, blk,
2310 get_irn_dbg_info(n),
2311 current_ir_graph, blk,
2313 new_r_Const_long(current_ir_graph, blk, mode, 1),
2316 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2320 if (is_Sub(a)) { /* (x - y) - b -> x - (y + b) */
2321 ir_node *x = get_Sub_left(a);
2322 ir_node *y = get_Sub_right(a);
2323 ir_node *blk = get_irn_n(n, -1);
2324 ir_mode *m_b = get_irn_mode(b);
2325 ir_mode *m_y = get_irn_mode(y);
2329 /* Determine the right mode for the Add. */
2332 else if (mode_is_reference(m_b))
2334 else if (mode_is_reference(m_y))
2338 * Both modes are different but none is reference,
2339 * happens for instance in SubP(SubP(P, Iu), Is).
2340 * We have two possibilities here: Cast or ignore.
2341 * Currently we ignore this case.
2346 add = new_r_Add(current_ir_graph, blk, y, b, add_mode);
2348 n = new_rd_Sub(get_irn_dbg_info(n), current_ir_graph, blk, x, add, mode);
2349 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_SUB_X_Y_Z);
2353 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2354 if (is_Const(a) && is_Not(b)) {
2355 /* c - ~X = X + (c+1) */
2356 tarval *tv = get_Const_tarval(a);
2358 tv = tarval_add(tv, get_mode_one(mode));
2359 if (tv != tarval_bad) {
2360 ir_node *blk = get_irn_n(n, -1);
2361 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
2362 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, blk, get_Not_op(b), c, mode);
2363 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_C_NOT_X);
2369 } /* transform_node_Sub */
2372 * Several transformation done on n*n=2n bits mul.
2373 * These transformations must be done here because new nodes may be produced.
2375 static ir_node *transform_node_Mul2n(ir_node *n, ir_mode *mode) {
2377 ir_node *a = get_Mul_left(n);
2378 ir_node *b = get_Mul_right(n);
2379 tarval *ta = value_of(a);
2380 tarval *tb = value_of(b);
2381 ir_mode *smode = get_irn_mode(a);
2383 if (ta == get_mode_one(smode)) {
2384 ir_node *blk = get_irn_n(n, -1);
2385 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, b, mode);
2386 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2389 else if (ta == get_mode_minus_one(smode)) {
2390 ir_node *blk = get_irn_n(n, -1);
2391 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, b, smode);
2392 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, n, mode);
2393 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2396 if (tb == get_mode_one(smode)) {
2397 ir_node *blk = get_irn_n(a, -1);
2398 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, a, mode);
2399 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2402 else if (tb == get_mode_minus_one(smode)) {
2403 ir_node *blk = get_irn_n(n, -1);
2404 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, a, smode);
2405 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, n, mode);
2406 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2413 * Transform Mul(a,-1) into -a.
2414 * Do constant evaluation of Phi nodes.
2415 * Do architecture dependent optimizations on Mul nodes
2417 static ir_node *transform_node_Mul(ir_node *n) {
2418 ir_node *c, *oldn = n;
2419 ir_mode *mode = get_irn_mode(n);
2420 ir_node *a = get_Mul_left(n);
2421 ir_node *b = get_Mul_right(n);
2423 if (is_Bad(a) || is_Bad(b))
2426 if (mode != get_irn_mode(a))
2427 return transform_node_Mul2n(n, mode);
2429 HANDLE_BINOP_PHI(tarval_mul, a, b, c, mode);
2431 if (mode_is_signed(mode)) {
2434 if (value_of(a) == get_mode_minus_one(mode))
2436 else if (value_of(b) == get_mode_minus_one(mode))
2439 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), r, mode);
2440 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2445 if (is_Const(b)) { /* (-a) * const -> a * -const */
2446 ir_node *cnst = const_negate(b);
2448 dbg_info *dbgi = get_irn_dbg_info(n);
2449 ir_node *block = get_nodes_block(n);
2450 n = new_rd_Mul(dbgi, current_ir_graph, block, get_Minus_op(a), cnst, mode);
2451 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2454 } else if (is_Minus(b)) { /* (-a) * (-b) -> a * b */
2455 dbg_info *dbgi = get_irn_dbg_info(n);
2456 ir_node *block = get_nodes_block(n);
2457 n = new_rd_Mul(dbgi, current_ir_graph, block, get_Minus_op(a), get_Minus_op(b), mode);
2458 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_MINUS);
2460 } else if (is_Sub(b)) { /* (-a) * (b - c) -> a * (c - b) */
2461 ir_node *sub_l = get_Sub_left(b);
2462 ir_node *sub_r = get_Sub_right(b);
2463 dbg_info *dbgi = get_irn_dbg_info(n);
2464 ir_graph *irg = current_ir_graph;
2465 ir_node *block = get_nodes_block(n);
2466 ir_node *new_b = new_rd_Sub(dbgi, irg, block, sub_r, sub_l, mode);
2467 n = new_rd_Mul(dbgi, irg, block, get_Minus_op(a), new_b, mode);
2468 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
2471 } else if (is_Minus(b)) {
2472 if (is_Sub(a)) { /* (a - b) * (-c) -> (b - a) * c */
2473 ir_node *sub_l = get_Sub_left(a);
2474 ir_node *sub_r = get_Sub_right(a);
2475 dbg_info *dbgi = get_irn_dbg_info(n);
2476 ir_graph *irg = current_ir_graph;
2477 ir_node *block = get_nodes_block(n);
2478 ir_node *new_a = new_rd_Sub(dbgi, irg, block, sub_r, sub_l, mode);
2479 n = new_rd_Mul(dbgi, irg, block, new_a, get_Minus_op(b), mode);
2480 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
2484 if (get_mode_arithmetic(mode) == irma_ieee754) {
2486 tarval *tv = get_Const_tarval(a);
2487 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)) {
2488 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), b, b, mode);
2489 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2493 else if (is_Const(b)) {
2494 tarval *tv = get_Const_tarval(b);
2495 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)) {
2496 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), a, a, mode);
2497 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2502 return arch_dep_replace_mul_with_shifts(n);
2503 } /* transform_node_Mul */
2506 * Transform a Div Node.
2508 static ir_node *transform_node_Div(ir_node *n) {
2509 tarval *tv = value_of(n);
2510 ir_mode *mode = get_Div_resmode(n);
2513 if (tv != tarval_bad) {
2514 value = new_Const(get_tarval_mode(tv), tv);
2516 DBG_OPT_CSTEVAL(n, value);
2519 ir_node *a = get_Div_left(n);
2520 ir_node *b = get_Div_right(n);
2523 if (a == b && value_not_zero(a, &dummy)) {
2524 /* BEWARE: we can optimize a/a to 1 only if this cannot cause a exception */
2525 value = new_Const(mode, get_mode_one(mode));
2526 DBG_OPT_CSTEVAL(n, value);
2529 if (mode_is_signed(mode) && is_Const(b)) {
2530 tarval *tv = get_Const_tarval(b);
2532 if (tv == get_mode_minus_one(mode)) {
2534 value = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), a, mode);
2535 DBG_OPT_CSTEVAL(n, value);
2539 /* Try architecture dependent optimization */
2540 value = arch_dep_replace_div_by_const(n);
2548 /* Turn Div into a tuple (mem, jmp, bad, value) */
2549 mem = get_Div_mem(n);
2550 blk = get_irn_n(n, -1);
2552 /* skip a potential Pin */
2554 mem = get_Pin_op(mem);
2555 turn_into_tuple(n, pn_Div_max);
2556 set_Tuple_pred(n, pn_Div_M, mem);
2557 set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(current_ir_graph, blk));
2558 set_Tuple_pred(n, pn_Div_X_except, new_Bad());
2559 set_Tuple_pred(n, pn_Div_res, value);
2562 } /* transform_node_Div */
2565 * Transform a Mod node.
2567 static ir_node *transform_node_Mod(ir_node *n) {
2568 tarval *tv = value_of(n);
2569 ir_mode *mode = get_Mod_resmode(n);
2572 if (tv != tarval_bad) {
2573 value = new_Const(get_tarval_mode(tv), tv);
2575 DBG_OPT_CSTEVAL(n, value);
2578 ir_node *a = get_Mod_left(n);
2579 ir_node *b = get_Mod_right(n);
2582 if (a == b && value_not_zero(a, &dummy)) {
2583 /* BEWARE: we can optimize a%a to 0 only if this cannot cause a exception */
2584 value = new_Const(mode, get_mode_null(mode));
2585 DBG_OPT_CSTEVAL(n, value);
2588 if (mode_is_signed(mode) && is_Const(b)) {
2589 tarval *tv = get_Const_tarval(b);
2591 if (tv == get_mode_minus_one(mode)) {
2593 value = new_Const(mode, get_mode_null(mode));
2594 DBG_OPT_CSTEVAL(n, value);
2598 /* Try architecture dependent optimization */
2599 value = arch_dep_replace_mod_by_const(n);
2607 /* Turn Mod into a tuple (mem, jmp, bad, value) */
2608 mem = get_Mod_mem(n);
2609 blk = get_irn_n(n, -1);
2611 /* skip a potential Pin */
2613 mem = get_Pin_op(mem);
2614 turn_into_tuple(n, pn_Mod_max);
2615 set_Tuple_pred(n, pn_Mod_M, mem);
2616 set_Tuple_pred(n, pn_Mod_X_regular, new_r_Jmp(current_ir_graph, blk));
2617 set_Tuple_pred(n, pn_Mod_X_except, new_Bad());
2618 set_Tuple_pred(n, pn_Mod_res, value);
2621 } /* transform_node_Mod */
2624 * Transform a DivMod node.
2626 static ir_node *transform_node_DivMod(ir_node *n) {
2628 ir_node *a = get_DivMod_left(n);
2629 ir_node *b = get_DivMod_right(n);
2630 ir_mode *mode = get_DivMod_resmode(n);
2631 tarval *ta = value_of(a);
2632 tarval *tb = value_of(b);
2635 if (tb != tarval_bad) {
2636 if (tb == get_mode_one(get_tarval_mode(tb))) {
2637 b = new_Const(mode, get_mode_null(mode));
2638 DBG_OPT_CSTEVAL(n, b);
2640 } else if (ta != tarval_bad) {
2641 tarval *resa, *resb;
2642 resa = tarval_div(ta, tb);
2643 if (resa == tarval_bad) return n; /* Causes exception!!! Model by replacing through
2644 Jmp for X result!? */
2645 resb = tarval_mod(ta, tb);
2646 if (resb == tarval_bad) return n; /* Causes exception! */
2647 a = new_Const(mode, resa);
2648 b = new_Const(mode, resb);
2649 DBG_OPT_CSTEVAL(n, a);
2650 DBG_OPT_CSTEVAL(n, b);
2652 } else if (mode_is_signed(mode) && tb == get_mode_minus_one(mode)) {
2653 a = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), a, mode);
2654 b = new_Const(mode, get_mode_null(mode));
2655 DBG_OPT_CSTEVAL(n, a);
2656 DBG_OPT_CSTEVAL(n, b);
2658 } else { /* Try architecture dependent optimization */
2659 arch_dep_replace_divmod_by_const(&a, &b, n);
2660 evaluated = a != NULL;
2662 } else if (a == b) {
2663 if (value_not_zero(a, &dummy)) {
2665 a = new_Const(mode, get_mode_one(mode));
2666 b = new_Const(mode, get_mode_null(mode));
2667 DBG_OPT_CSTEVAL(n, a);
2668 DBG_OPT_CSTEVAL(n, b);
2671 /* BEWARE: it is NOT possible to optimize a/a to 1, as this may cause a exception */
2674 } else if (ta == get_mode_null(mode) && value_not_zero(b, &dummy)) {
2675 /* 0 / non-Const = 0 */
2680 if (evaluated) { /* replace by tuple */
2684 mem = get_DivMod_mem(n);
2685 /* skip a potential Pin */
2687 mem = get_Pin_op(mem);
2689 blk = get_irn_n(n, -1);
2690 turn_into_tuple(n, pn_DivMod_max);
2691 set_Tuple_pred(n, pn_DivMod_M, mem);
2692 set_Tuple_pred(n, pn_DivMod_X_regular, new_r_Jmp(current_ir_graph, blk));
2693 set_Tuple_pred(n, pn_DivMod_X_except, new_Bad()); /* no exception */
2694 set_Tuple_pred(n, pn_DivMod_res_div, a);
2695 set_Tuple_pred(n, pn_DivMod_res_mod, b);
2699 } /* transform_node_DivMod */
2702 * Optimize x / c to x * (1/c)
2704 static ir_node *transform_node_Quot(ir_node *n) {
2705 ir_mode *mode = get_Quot_resmode(n);
2708 if (get_mode_arithmetic(mode) == irma_ieee754) {
2709 ir_node *b = get_Quot_right(n);
2712 tarval *tv = get_Const_tarval(b);
2714 tv = tarval_quo(get_mode_one(mode), tv);
2716 /* Do the transformation if the result is either exact or we are not
2717 using strict rules. */
2718 if (tv != tarval_bad &&
2719 (tarval_ieee754_get_exact() || (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic) == 0)) {
2720 ir_node *blk = get_irn_n(n, -1);
2721 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
2722 ir_node *a = get_Quot_left(n);
2723 ir_node *m = new_rd_Mul(get_irn_dbg_info(n), current_ir_graph, blk, a, c, mode);
2724 ir_node *mem = get_Quot_mem(n);
2726 /* skip a potential Pin */
2728 mem = get_Pin_op(mem);
2729 turn_into_tuple(n, pn_Quot_max);
2730 set_Tuple_pred(n, pn_Quot_M, mem);
2731 set_Tuple_pred(n, pn_Quot_X_regular, new_r_Jmp(current_ir_graph, blk));
2732 set_Tuple_pred(n, pn_Quot_X_except, new_r_Bad(current_ir_graph));
2733 set_Tuple_pred(n, pn_Quot_res, m);
2734 DBG_OPT_ALGSIM1(oldn, a, b, m, FS_OPT_FP_INV_MUL);
2739 } /* transform_node_Quot */
2742 * Optimize Abs(x) into x if x is Confirmed >= 0
2743 * Optimize Abs(x) into -x if x is Confirmed <= 0
2745 static ir_node *transform_node_Abs(ir_node *n) {
2746 ir_node *c, *oldn = n;
2747 ir_node *a = get_Abs_op(n);
2750 HANDLE_UNOP_PHI(tarval_abs, a, c);
2752 switch (classify_value_sign(a)) {
2753 case value_classified_negative:
2754 mode = get_irn_mode(n);
2757 * We can replace the Abs by -x here.
2758 * We even could add a new Confirm here.
2760 * Note that -x would create a new node, so we could
2761 * not run it in the equivalent_node() context.
2763 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph,
2764 get_irn_n(n, -1), a, mode);
2766 DBG_OPT_CONFIRM(oldn, n);
2768 case value_classified_positive:
2769 /* n is positive, Abs is not needed */
2772 DBG_OPT_CONFIRM(oldn, n);
2777 } /* transform_node_Abs */
2780 * Transform a Cond node.
2782 * Replace the Cond by a Jmp if it branches on a constant
2785 static ir_node *transform_node_Cond(ir_node *n) {
2788 ir_node *a = get_Cond_selector(n);
2789 tarval *ta = value_of(a);
2791 /* we need block info which is not available in floating irgs */
2792 if (get_irg_pinned(current_ir_graph) == op_pin_state_floats)
2795 if ((ta != tarval_bad) &&
2796 (get_irn_mode(a) == mode_b) &&
2797 (get_opt_unreachable_code())) {
2798 /* It's a boolean Cond, branching on a boolean constant.
2799 Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
2800 jmp = new_r_Jmp(current_ir_graph, get_nodes_block(n));
2801 turn_into_tuple(n, pn_Cond_max);
2802 if (ta == tarval_b_true) {
2803 set_Tuple_pred(n, pn_Cond_false, new_Bad());
2804 set_Tuple_pred(n, pn_Cond_true, jmp);
2806 set_Tuple_pred(n, pn_Cond_false, jmp);
2807 set_Tuple_pred(n, pn_Cond_true, new_Bad());
2809 /* We might generate an endless loop, so keep it alive. */
2810 add_End_keepalive(get_irg_end(current_ir_graph), get_nodes_block(n));
2813 } /* transform_node_Cond */
2815 typedef ir_node* (*recursive_transform) (ir_node *n);
2818 * makes use of distributive laws for and, or, eor
2819 * and(a OP c, b OP c) -> and(a, b) OP c
2820 * note, might return a different op than n
2822 static ir_node *transform_bitwise_distributive(ir_node *n,
2823 recursive_transform trans_func)
2826 ir_node *a = get_binop_left(n);
2827 ir_node *b = get_binop_right(n);
2828 ir_op *op = get_irn_op(a);
2829 ir_op *op_root = get_irn_op(n);
2831 if(op != get_irn_op(b))
2834 if (op == op_Conv) {
2835 ir_node *a_op = get_Conv_op(a);
2836 ir_node *b_op = get_Conv_op(b);
2837 ir_mode *a_mode = get_irn_mode(a_op);
2838 ir_mode *b_mode = get_irn_mode(b_op);
2839 if(a_mode == b_mode && (mode_is_int(a_mode) || a_mode == mode_b)) {
2840 ir_node *blk = get_irn_n(n, -1);
2843 set_binop_left(n, a_op);
2844 set_binop_right(n, b_op);
2845 set_irn_mode(n, a_mode);
2847 n = new_r_Conv(current_ir_graph, blk, n, get_irn_mode(oldn));
2849 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
2855 /* nothing to gain here */
2859 if (op == op_Shrs || op == op_Shr || op == op_Shl
2860 || op == op_And || op == op_Or || op == op_Eor) {
2861 ir_node *a_left = get_binop_left(a);
2862 ir_node *a_right = get_binop_right(a);
2863 ir_node *b_left = get_binop_left(b);
2864 ir_node *b_right = get_binop_right(b);
2868 if (is_op_commutative(op)) {
2869 if (a_left == b_left) {
2873 } else if(a_left == b_right) {
2877 } else if(a_right == b_left) {
2883 if(a_right == b_right) {
2890 /* (a sop c) & (b sop c) => (a & b) sop c */
2891 ir_node *blk = get_irn_n(n, -1);
2893 ir_node *new_n = exact_copy(n);
2894 set_binop_left(new_n, op1);
2895 set_binop_right(new_n, op2);
2896 new_n = trans_func(new_n);
2898 if(op_root == op_Eor && op == op_Or) {
2899 dbg_info *dbgi = get_irn_dbg_info(n);
2900 ir_graph *irg = current_ir_graph;
2901 ir_mode *mode = get_irn_mode(c);
2903 c = new_rd_Not(dbgi, irg, blk, c, mode);
2904 n = new_rd_And(dbgi, irg, blk, new_n, c, mode);
2907 set_irn_n(n, -1, blk);
2908 set_binop_left(n, new_n);
2909 set_binop_right(n, c);
2910 add_identities(current_ir_graph->value_table, n);
2913 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
2924 static ir_node *transform_node_And(ir_node *n) {
2925 ir_node *c, *oldn = n;
2926 ir_node *a = get_And_left(n);
2927 ir_node *b = get_And_right(n);
2930 mode = get_irn_mode(n);
2931 HANDLE_BINOP_PHI(tarval_and, a, b, c, mode);
2933 /* we can evaluate 2 Projs of the same Cmp */
2934 if (mode == mode_b && is_Proj(a) && is_Proj(b)) {
2935 ir_node *pred_a = get_Proj_pred(a);
2936 ir_node *pred_b = get_Proj_pred(b);
2937 if (pred_a == pred_b) {
2938 dbg_info *dbgi = get_irn_dbg_info(n);
2939 ir_node *block = get_nodes_block(pred_a);
2940 pn_Cmp pn_a = get_Proj_proj(a);
2941 pn_Cmp pn_b = get_Proj_proj(b);
2942 /* yes, we can simply calculate with pncs */
2943 pn_Cmp new_pnc = pn_a & pn_b;
2945 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b, new_pnc);
2950 ir_node *op = get_Not_op(b);
2952 ir_node *ba = get_And_left(op);
2953 ir_node *bb = get_And_right(op);
2955 /* it's enough to test the following cases due to normalization! */
2956 if (get_Or_left(a) == ba && get_Or_right(a) == bb) {
2957 /* (a|b) & ~(a&b) = a^b */
2958 ir_node *block = get_nodes_block(n);
2960 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph, block, ba, bb, mode);
2961 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
2969 ir_node *op = get_Not_op(a);
2971 ir_node *aa = get_And_left(op);
2972 ir_node *ab = get_And_right(op);
2974 /* it's enough to test the following cases due to normalization! */
2975 if (get_Or_left(b) == aa && get_Or_right(b) == ab) {
2976 /* (a|b) & ~(a&b) = a^b */
2977 ir_node *block = get_nodes_block(n);
2979 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph, block, aa, ab, mode);
2980 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
2987 ir_node *al = get_Eor_left(a);
2988 ir_node *ar = get_Eor_right(a);
2991 /* (b ^ a) & b -> ~a & b */
2992 dbg_info *dbg = get_irn_dbg_info(n);
2993 ir_node *block = get_nodes_block(n);
2995 ar = new_rd_Not(dbg, current_ir_graph, block, ar, mode);
2996 n = new_rd_And(dbg, current_ir_graph, block, ar, b, mode);
2997 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3001 /* (a ^ b) & b -> ~a & b */
3002 dbg_info *dbg = get_irn_dbg_info(n);
3003 ir_node *block = get_nodes_block(n);
3005 al = new_rd_Not(dbg, current_ir_graph, block, al, mode);
3006 n = new_rd_And(dbg, current_ir_graph, block, al, b, mode);
3007 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3012 ir_node *bl = get_Eor_left(b);
3013 ir_node *br = get_Eor_right(b);
3016 /* a & (a ^ b) -> a & ~b */
3017 dbg_info *dbg = get_irn_dbg_info(n);
3018 ir_node *block = get_nodes_block(n);
3020 br = new_rd_Not(dbg, current_ir_graph, block, br, mode);
3021 n = new_rd_And(dbg, current_ir_graph, block, br, a, mode);
3022 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3026 /* a & (b ^ a) -> a & ~b */
3027 dbg_info *dbg = get_irn_dbg_info(n);
3028 ir_node *block = get_nodes_block(n);
3030 bl = new_rd_Not(dbg, current_ir_graph, block, bl, mode);
3031 n = new_rd_And(dbg, current_ir_graph, block, bl, a, mode);
3032 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3036 if (is_Not(a) && is_Not(b)) {
3037 /* ~a & ~b = ~(a|b) */
3038 ir_node *block = get_nodes_block(n);
3039 ir_mode *mode = get_irn_mode(n);
3043 n = new_rd_Or(get_irn_dbg_info(n), current_ir_graph, block, a, b, mode);
3044 n = new_rd_Not(get_irn_dbg_info(n), current_ir_graph, block, n, mode);
3045 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
3049 n = transform_bitwise_distributive(n, transform_node_And);
3052 } /* transform_node_And */
3057 static ir_node *transform_node_Eor(ir_node *n) {
3058 ir_node *c, *oldn = n;
3059 ir_node *a = get_Eor_left(n);
3060 ir_node *b = get_Eor_right(n);
3061 ir_mode *mode = get_irn_mode(n);
3063 HANDLE_BINOP_PHI(tarval_eor, a, b, c, mode);
3065 /* we can evaluate 2 Projs of the same Cmp */
3066 if (mode == mode_b && is_Proj(a) && is_Proj(b)) {
3067 ir_node *pred_a = get_Proj_pred(a);
3068 ir_node *pred_b = get_Proj_pred(b);
3069 if(pred_a == pred_b) {
3070 dbg_info *dbgi = get_irn_dbg_info(n);
3071 ir_node *block = get_nodes_block(pred_a);
3072 pn_Cmp pn_a = get_Proj_proj(a);
3073 pn_Cmp pn_b = get_Proj_proj(b);
3074 /* yes, we can simply calculate with pncs */
3075 pn_Cmp new_pnc = pn_a ^ pn_b;
3077 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b,
3084 n = new_rd_Const(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1),
3085 mode, get_mode_null(mode));
3086 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_A_A);
3087 } else if (mode == mode_b &&
3089 is_Const(b) && is_Const_one(b) &&
3090 is_Cmp(get_Proj_pred(a))) {
3091 /* The Eor negates a Cmp. The Cmp has the negated result anyways! */
3092 n = new_r_Proj(current_ir_graph, get_irn_n(n, -1), get_Proj_pred(a),
3093 mode_b, get_negated_pnc(get_Proj_proj(a), mode));
3095 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT_BOOL);
3096 } else if (is_Const(b)) {
3097 if (is_Not(a)) { /* ~x ^ const -> x ^ ~const */
3098 ir_node *cnst = new_Const(mode, tarval_not(get_Const_tarval(b)));
3099 ir_node *not_op = get_Not_op(a);
3100 dbg_info *dbg = get_irn_dbg_info(n);
3101 ir_graph *irg = current_ir_graph;
3102 ir_node *block = get_nodes_block(n);
3103 ir_mode *mode = get_irn_mode(n);
3104 n = new_rd_Eor(dbg, irg, block, not_op, cnst, mode);
3106 } else if (is_Const_all_one(b)) { /* x ^ 1...1 -> ~1 */
3107 n = new_r_Not(current_ir_graph, get_nodes_block(n), a, mode);
3108 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3111 n = transform_bitwise_distributive(n, transform_node_Eor);
3115 } /* transform_node_Eor */
3120 static ir_node *transform_node_Not(ir_node *n) {
3121 ir_node *c, *oldn = n;
3122 ir_node *a = get_Not_op(n);
3123 ir_mode *mode = get_irn_mode(n);
3125 HANDLE_UNOP_PHI(tarval_not,a,c);
3127 /* check for a boolean Not */
3128 if (mode == mode_b &&
3130 is_Cmp(get_Proj_pred(a))) {
3131 /* We negate a Cmp. The Cmp has the negated result anyways! */
3132 n = new_r_Proj(current_ir_graph, get_irn_n(n, -1), get_Proj_pred(a),
3133 mode_b, get_negated_pnc(get_Proj_proj(a), mode_b));
3134 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP);
3138 ir_node *eor_b = get_Eor_right(a);
3139 if (is_Const(eor_b)) { /* ~(x ^ const) -> x ^ ~const */
3140 ir_node *cnst = new_Const(mode, tarval_not(get_Const_tarval(eor_b)));
3141 ir_node *eor_a = get_Eor_left(a);
3142 dbg_info *dbg = get_irn_dbg_info(n);
3143 ir_graph *irg = current_ir_graph;
3144 ir_node *block = get_nodes_block(n);
3145 ir_mode *mode = get_irn_mode(n);
3146 n = new_rd_Eor(dbg, irg, block, eor_a, cnst, mode);
3150 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3151 if (is_Minus(a)) { /* ~-x -> x + -1 */
3152 dbg_info *dbg = get_irn_dbg_info(n);
3153 ir_graph *irg = current_ir_graph;
3154 ir_node *block = get_nodes_block(n);
3155 ir_node *add_l = get_Minus_op(a);
3156 ir_node *add_r = new_rd_Const(dbg, irg, block, mode, get_mode_minus_one(mode));
3157 n = new_rd_Add(dbg, irg, block, add_l, add_r, mode);
3158 } else if (is_Add(a)) {
3159 ir_node *add_r = get_Add_right(a);
3160 if (is_Const(add_r) && is_Const_all_one(add_r)) {
3161 /* ~(x + -1) = -x */
3162 ir_node *op = get_Add_left(a);
3163 ir_node *blk = get_irn_n(n, -1);
3164 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, op, get_irn_mode(n));
3165 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_MINUS_1);
3170 } /* transform_node_Not */
3173 * Transform a Minus.
3177 * -(a >>u (size-1)) = a >>s (size-1)
3178 * -(a >>s (size-1)) = a >>u (size-1)
3179 * -(a * const) -> a * -const
3181 static ir_node *transform_node_Minus(ir_node *n) {
3182 ir_node *c, *oldn = n;
3183 ir_node *a = get_Minus_op(n);
3186 HANDLE_UNOP_PHI(tarval_neg,a,c);
3188 mode = get_irn_mode(a);
3189 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3190 /* the following rules are only to twos-complement */
3193 ir_node *op = get_Not_op(a);
3194 tarval *tv = get_mode_one(mode);
3195 ir_node *blk = get_irn_n(n, -1);
3196 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
3197 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, blk, op, c, mode);
3198 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_NOT);
3202 ir_node *c = get_Shr_right(a);
3205 tarval *tv = get_Const_tarval(c);
3207 if (tarval_is_long(tv) && get_tarval_long(tv) == get_mode_size_bits(mode) - 1) {
3208 /* -(a >>u (size-1)) = a >>s (size-1) */
3209 ir_node *v = get_Shr_left(a);
3211 n = new_rd_Shrs(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), v, c, mode);
3212 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3218 ir_node *c = get_Shrs_right(a);
3221 tarval *tv = get_Const_tarval(c);
3223 if (tarval_is_long(tv) && get_tarval_long(tv) == get_mode_size_bits(mode) - 1) {
3224 /* -(a >>s (size-1)) = a >>u (size-1) */
3225 ir_node *v = get_Shrs_left(a);
3227 n = new_rd_Shr(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), v, c, mode);
3228 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3235 /* - (a-b) = b - a */
3236 ir_node *la = get_Sub_left(a);
3237 ir_node *ra = get_Sub_right(a);
3238 ir_node *blk = get_irn_n(n, -1);
3240 n = new_rd_Sub(get_irn_dbg_info(n), current_ir_graph, blk, ra, la, mode);
3241 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_SUB);
3245 if (is_Mul(a)) { /* -(a * const) -> a * -const */
3246 ir_node *mul_l = get_Mul_left(a);
3247 ir_node *mul_r = get_Mul_right(a);
3248 if (is_Const(mul_r)) {
3249 tarval *tv = tarval_neg(get_Const_tarval(mul_r));
3250 ir_node *cnst = new_Const(mode, tv);
3251 dbg_info *dbg = get_irn_dbg_info(a);
3252 ir_graph *irg = current_ir_graph;
3253 ir_node *block = get_nodes_block(a);
3254 n = new_rd_Mul(dbg, irg, block, mul_l, cnst, mode);
3255 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_MUL_C);
3261 } /* transform_node_Minus */
3264 * Transform a Cast_type(Const) into a new Const_type
3266 static ir_node *transform_node_Cast(ir_node *n) {
3268 ir_node *pred = get_Cast_op(n);
3269 ir_type *tp = get_irn_type(n);
3271 if (is_Const(pred) && get_Const_type(pred) != tp) {
3272 n = new_rd_Const_type(NULL, current_ir_graph, get_irn_n(pred, -1), get_irn_mode(pred),
3273 get_Const_tarval(pred), tp);
3274 DBG_OPT_CSTEVAL(oldn, n);
3275 } else if (is_SymConst(pred) && get_SymConst_value_type(pred) != tp) {
3276 n = new_rd_SymConst_type(NULL, current_ir_graph, get_irn_n(pred, -1), get_SymConst_symbol(pred),
3277 get_SymConst_kind(pred), tp);
3278 DBG_OPT_CSTEVAL(oldn, n);
3282 } /* transform_node_Cast */
3285 * Transform a Proj(Div) with a non-zero value.
3286 * Removes the exceptions and routes the memory to the NoMem node.
3288 static ir_node *transform_node_Proj_Div(ir_node *proj) {
3289 ir_node *div = get_Proj_pred(proj);
3290 ir_node *b = get_Div_right(div);
3291 ir_node *confirm, *res, *new_mem;
3294 if (value_not_zero(b, &confirm)) {
3295 /* div(x, y) && y != 0 */
3296 if (confirm == NULL) {
3297 /* we are sure we have a Const != 0 */
3298 new_mem = get_Div_mem(div);
3299 if (is_Pin(new_mem))
3300 new_mem = get_Pin_op(new_mem);
3301 set_Div_mem(div, new_mem);
3302 set_irn_pinned(div, op_pin_state_floats);
3305 proj_nr = get_Proj_proj(proj);
3307 case pn_Div_X_regular:
3308 return new_r_Jmp(current_ir_graph, get_irn_n(div, -1));
3310 case pn_Div_X_except:
3311 /* we found an exception handler, remove it */
3312 DBG_OPT_EXC_REM(proj);
3316 res = get_Div_mem(div);
3317 new_mem = get_irg_no_mem(current_ir_graph);
3320 /* This node can only float up to the Confirm block */
3321 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3323 set_irn_pinned(div, op_pin_state_floats);
3324 /* this is a Div without exception, we can remove the memory edge */
3325 set_Div_mem(div, new_mem);
3330 } /* transform_node_Proj_Div */
3333 * Transform a Proj(Mod) with a non-zero value.
3334 * Removes the exceptions and routes the memory to the NoMem node.
3336 static ir_node *transform_node_Proj_Mod(ir_node *proj) {
3337 ir_node *mod = get_Proj_pred(proj);
3338 ir_node *b = get_Mod_right(mod);
3339 ir_node *confirm, *res, *new_mem;
3342 if (value_not_zero(b, &confirm)) {
3343 /* mod(x, y) && y != 0 */
3344 proj_nr = get_Proj_proj(proj);
3346 if (confirm == NULL) {
3347 /* we are sure we have a Const != 0 */
3348 new_mem = get_Mod_mem(mod);
3349 if (is_Pin(new_mem))
3350 new_mem = get_Pin_op(new_mem);
3351 set_Mod_mem(mod, new_mem);
3352 set_irn_pinned(mod, op_pin_state_floats);
3357 case pn_Mod_X_regular:
3358 return new_r_Jmp(current_ir_graph, get_irn_n(mod, -1));
3360 case pn_Mod_X_except:
3361 /* we found an exception handler, remove it */
3362 DBG_OPT_EXC_REM(proj);
3366 res = get_Mod_mem(mod);
3367 new_mem = get_irg_no_mem(current_ir_graph);
3370 /* This node can only float up to the Confirm block */
3371 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3373 /* this is a Mod without exception, we can remove the memory edge */
3374 set_Mod_mem(mod, new_mem);
3377 if (get_Mod_left(mod) == b) {
3378 /* a % a = 0 if a != 0 */
3379 ir_mode *mode = get_irn_mode(proj);
3380 ir_node *res = new_Const(mode, get_mode_null(mode));
3382 DBG_OPT_CSTEVAL(mod, res);
3388 } /* transform_node_Proj_Mod */
3391 * Transform a Proj(DivMod) with a non-zero value.
3392 * Removes the exceptions and routes the memory to the NoMem node.
3394 static ir_node *transform_node_Proj_DivMod(ir_node *proj) {
3395 ir_node *divmod = get_Proj_pred(proj);
3396 ir_node *b = get_DivMod_right(divmod);
3397 ir_node *confirm, *res, *new_mem;
3400 if (value_not_zero(b, &confirm)) {
3401 /* DivMod(x, y) && y != 0 */
3402 proj_nr = get_Proj_proj(proj);
3404 if (confirm == NULL) {
3405 /* we are sure we have a Const != 0 */
3406 new_mem = get_DivMod_mem(divmod);
3407 if (is_Pin(new_mem))
3408 new_mem = get_Pin_op(new_mem);
3409 set_DivMod_mem(divmod, new_mem);
3410 set_irn_pinned(divmod, op_pin_state_floats);
3415 case pn_DivMod_X_regular:
3416 return new_r_Jmp(current_ir_graph, get_irn_n(divmod, -1));
3418 case pn_DivMod_X_except:
3419 /* we found an exception handler, remove it */
3420 DBG_OPT_EXC_REM(proj);
3424 res = get_DivMod_mem(divmod);
3425 new_mem = get_irg_no_mem(current_ir_graph);
3428 /* This node can only float up to the Confirm block */
3429 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3431 /* this is a DivMod without exception, we can remove the memory edge */
3432 set_DivMod_mem(divmod, new_mem);
3435 case pn_DivMod_res_mod:
3436 if (get_DivMod_left(divmod) == b) {
3437 /* a % a = 0 if a != 0 */
3438 ir_mode *mode = get_irn_mode(proj);
3439 ir_node *res = new_Const(mode, get_mode_null(mode));
3441 DBG_OPT_CSTEVAL(divmod, res);
3447 } /* transform_node_Proj_DivMod */
3450 * Optimizes jump tables (CondIs or CondIu) by removing all impossible cases.
3452 static ir_node *transform_node_Proj_Cond(ir_node *proj) {
3453 if (get_opt_unreachable_code()) {
3454 ir_node *n = get_Proj_pred(proj);
3455 ir_node *b = get_Cond_selector(n);
3457 if (mode_is_int(get_irn_mode(b))) {
3458 tarval *tb = value_of(b);
3460 if (tb != tarval_bad) {
3461 /* we have a constant switch */
3462 long num = get_Proj_proj(proj);
3464 if (num != get_Cond_defaultProj(n)) { /* we cannot optimize default Proj's yet */
3465 if (get_tarval_long(tb) == num) {
3466 /* Do NOT create a jump here, or we will have 2 control flow ops
3467 * in a block. This case is optimized away in optimize_cf(). */
3470 /* this case will NEVER be taken, kill it */
3478 } /* transform_node_Proj_Cond */
3480 static ir_node *create_zero_const(ir_mode *mode)
3482 ir_graph *irg = current_ir_graph;
3483 tarval *tv = get_mode_null(mode);
3484 ir_node *block = get_irg_start_block(irg);
3485 ir_node *cnst = new_r_Const(irg, block, mode, tv);
3491 * Normalizes and optimizes Cmp nodes.
3493 static ir_node *transform_node_Proj_Cmp(ir_node *proj) {
3494 ir_node *n = get_Proj_pred(proj);
3495 ir_node *left = get_Cmp_left(n);
3496 ir_node *right = get_Cmp_right(n);
3500 ir_mode *mode = NULL;
3501 long proj_nr = get_Proj_proj(proj);
3503 /* we can evaluate this direct */
3506 return new_Const(mode_b, get_tarval_b_false());
3508 return new_Const(mode_b, get_tarval_b_true());
3510 if(!mode_is_float(get_irn_mode(left)))
3511 return new_Const(mode_b, get_tarval_b_true());
3519 left = get_Cast_op(left);
3521 right = get_Cast_op(right);
3523 /* Remove unnecessary conversions */
3524 /* TODO handle constants */
3525 if (is_Conv(left) && is_Conv(right)) {
3526 ir_mode *mode = get_irn_mode(left);
3527 ir_node *op_left = get_Conv_op(left);
3528 ir_node *op_right = get_Conv_op(right);
3529 ir_mode *mode_left = get_irn_mode(op_left);
3530 ir_mode *mode_right = get_irn_mode(op_right);
3532 if (smaller_mode(mode_left, mode) && smaller_mode(mode_right, mode)) {
3533 ir_graph *irg = current_ir_graph;
3534 ir_node *block = get_nodes_block(n);
3536 if (mode_left == mode_right) {
3540 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV_CONV);
3541 } else if (smaller_mode(mode_left, mode_right)) {
3542 left = new_r_Conv(irg, block, op_left, mode_right);
3545 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
3546 } else if (smaller_mode(mode_right, mode_left)) {
3548 right = new_r_Conv(irg, block, op_right, mode_left);
3550 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
3555 /* remove operation of both sides if possible */
3556 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
3557 ir_opcode lop = get_irn_opcode(left);
3559 if (lop == get_irn_opcode(right)) {
3560 ir_node *ll, *lr, *rl, *rr;
3562 /* same operation on both sides, try to remove */
3566 /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */
3567 left = get_unop_op(left);
3568 right = get_unop_op(right);
3570 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3573 ll = get_Add_left(left);
3574 lr = get_Add_right(left);
3575 rl = get_Add_left(right);
3576 rr = get_Add_right(right);
3579 /* X + a CMP X + b ==> a CMP b */
3583 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3584 } else if (ll == rr) {
3585 /* X + a CMP b + X ==> a CMP b */
3589 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3590 } else if (lr == rl) {
3591 /* a + X CMP X + b ==> a CMP b */
3595 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3596 } else if (lr == rr) {
3597 /* a + X CMP b + X ==> a CMP b */
3601 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3605 ll = get_Sub_left(left);
3606 lr = get_Sub_right(left);
3607 rl = get_Sub_left(right);
3608 rr = get_Sub_right(right);
3611 /* X - a CMP X - b ==> a CMP b */
3615 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3616 } else if (lr == rr) {
3617 /* a - X CMP b - X ==> a CMP b */
3621 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3625 if (get_Rot_right(left) == get_Rot_right(right)) {
3626 /* a ROT X CMP b ROT X */
3627 left = get_Rot_left(left);
3628 right = get_Rot_left(right);
3630 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
3639 /* X+A == A, A+X == A, A-X == A -> X == 0 */
3640 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
3641 if(is_Add(left) || is_Sub(left)) {
3642 ir_node *ll = get_binop_left(left);
3643 ir_node *lr = get_binop_right(left);
3645 if(lr == right && is_Add(left)) {
3652 right = create_zero_const(get_irn_mode(left));
3656 if(is_Add(right) || is_Sub(right)) {
3657 ir_node *rl = get_binop_left(right);
3658 ir_node *rr = get_binop_right(right);
3660 if(rr == left && is_Add(right)) {
3667 right = create_zero_const(get_irn_mode(left));
3673 /* replace mode_b compares with ands/ors */
3674 if (get_irn_mode(left) == mode_b) {
3675 ir_graph *irg = current_ir_graph;
3676 ir_node *block = get_nodes_block(n);
3680 case pn_Cmp_Le: bres = new_r_Or( irg, block, new_r_Not(irg, block, left, mode_b), right, mode_b); break;
3681 case pn_Cmp_Lt: bres = new_r_And(irg, block, new_r_Not(irg, block, left, mode_b), right, mode_b); break;
3682 case pn_Cmp_Ge: bres = new_r_Or( irg, block, left, new_r_Not(irg, block, right, mode_b), mode_b); break;
3683 case pn_Cmp_Gt: bres = new_r_And(irg, block, left, new_r_Not(irg, block, right, mode_b), mode_b); break;
3684 case pn_Cmp_Lg: bres = new_r_Eor(irg, block, left, right, mode_b); break;
3685 case pn_Cmp_Eq: bres = new_r_Not(irg, block, new_r_Eor(irg, block, left, right, mode_b), mode_b); break;
3686 default: bres = NULL;
3689 DBG_OPT_ALGSIM0(n, bres, FS_OPT_CMP_TO_BOOL);
3694 if (!get_opt_reassociation())
3698 * First step: normalize the compare op
3699 * by placing the constant on the right side
3700 * or moving the lower address node to the left.
3701 * We ignore the case that both are constants
3702 * this case should be optimized away.
3704 if (is_Const(right)) {
3706 } else if (is_irn_constlike(left)) {
3713 proj_nr = get_inversed_pnc(proj_nr);
3715 } else if (get_irn_idx(left) > get_irn_idx(right)) {
3721 proj_nr = get_inversed_pnc(proj_nr);
3726 * Second step: Try to reduce the magnitude
3727 * of a constant. This may help to generate better code
3728 * later and may help to normalize more compares.
3729 * Of course this is only possible for integer values.
3732 mode = get_irn_mode(c);
3733 tv = get_Const_tarval(c);
3735 /* TODO extend to arbitrary constants */
3736 if (is_Conv(left) && tarval_is_null(tv)) {
3737 ir_node *op = get_Conv_op(left);
3738 ir_mode *op_mode = get_irn_mode(op);
3741 * UpConv(x) REL 0 ==> x REL 0
3743 if (get_mode_size_bits(mode) > get_mode_size_bits(op_mode) &&
3744 ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) ||
3745 mode_is_signed(mode) || !mode_is_signed(op_mode))) {
3746 tv = get_mode_null(op_mode);
3750 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
3754 if (tv != tarval_bad) {
3755 /* the following optimization is possible on modes without Overflow
3756 * on Unary Minus or on == and !=:
3757 * -a CMP c ==> a swap(CMP) -c
3759 * Beware: for two-complement Overflow may occur, so only == and != can
3760 * be optimized, see this:
3761 * -MININT < 0 =/=> MININT > 0 !!!
3763 if (is_Minus(left) &&
3764 (!mode_overflow_on_unary_Minus(mode) ||
3765 (mode_is_int(mode) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)))) {
3766 tv = tarval_neg(tv);
3768 if (tv != tarval_bad) {
3769 left = get_Minus_op(left);
3770 proj_nr = get_inversed_pnc(proj_nr);
3772 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
3774 } else if (is_Not(left) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)) {
3775 /* Not(a) ==/!= c ==> a ==/!= Not(c) */
3776 tv = tarval_not(tv);
3778 if (tv != tarval_bad) {
3779 left = get_Not_op(left);
3781 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
3785 /* for integer modes, we have more */
3786 if (mode_is_int(mode)) {
3787 /* Ne includes Unordered which is not possible on integers.
3788 * However, frontends often use this wrong, so fix it here */
3789 if (proj_nr & pn_Cmp_Uo) {
3790 proj_nr &= ~pn_Cmp_Uo;
3791 set_Proj_proj(proj, proj_nr);
3794 /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */
3795 if ((proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Ge) &&
3796 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Gt) {
3797 tv = tarval_sub(tv, get_mode_one(mode));
3799 if (tv != tarval_bad) {
3800 proj_nr ^= pn_Cmp_Eq;
3802 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
3805 /* c < 0 : a > c ==> a >= (c+1) a <= c ==> a < (c+1) */
3806 else if ((proj_nr == pn_Cmp_Gt || proj_nr == pn_Cmp_Le) &&
3807 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Lt) {
3808 tv = tarval_add(tv, get_mode_one(mode));
3810 if (tv != tarval_bad) {
3811 proj_nr ^= pn_Cmp_Eq;
3813 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
3817 /* the following reassociations work only for == and != */
3818 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
3820 #if 0 /* Might be not that good in general */
3821 /* a-b == 0 ==> a == b, a-b != 0 ==> a != b */
3822 if (tarval_is_null(tv) && is_Sub(left)) {
3823 right = get_Sub_right(left);
3824 left = get_Sub_left(left);
3826 tv = value_of(right);
3828 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
3832 if (tv != tarval_bad) {
3833 /* a-c1 == c2 ==> a == c2+c1, a-c1 != c2 ==> a != c2+c1 */
3835 ir_node *c1 = get_Sub_right(left);
3836 tarval *tv2 = value_of(c1);
3838 if (tv2 != tarval_bad) {
3839 tv2 = tarval_add(tv, value_of(c1));
3841 if (tv2 != tarval_bad) {
3842 left = get_Sub_left(left);
3845 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
3849 /* a+c1 == c2 ==> a == c2-c1, a+c1 != c2 ==> a != c2-c1 */
3850 else if (is_Add(left)) {
3851 ir_node *a_l = get_Add_left(left);
3852 ir_node *a_r = get_Add_right(left);
3856 if (is_Const(a_l)) {
3858 tv2 = value_of(a_l);
3861 tv2 = value_of(a_r);
3864 if (tv2 != tarval_bad) {
3865 tv2 = tarval_sub(tv, tv2);
3867 if (tv2 != tarval_bad) {
3871 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
3875 /* -a == c ==> a == -c, -a != c ==> a != -c */
3876 else if (is_Minus(left)) {
3877 tarval *tv2 = tarval_sub(get_mode_null(mode), tv);
3879 if (tv2 != tarval_bad) {
3880 left = get_Minus_op(left);
3883 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
3888 /* the following reassociations work only for <= */
3889 else if (proj_nr == pn_Cmp_Le || proj_nr == pn_Cmp_Lt) {
3890 if (tv != tarval_bad) {
3891 /* c >= 0 : Abs(a) <= c ==> (unsigned)(a + c) <= 2*c */
3892 if (get_irn_op(left) == op_Abs) { // TODO something is missing here
3898 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
3899 switch (get_irn_opcode(left)) {
3903 c1 = get_And_right(left);
3906 * And(x, C1) == C2 ==> FALSE if C2 & C1 != C2
3907 * And(x, C1) != C2 ==> TRUE if C2 & C1 != C2
3909 tarval *mask = tarval_and(get_Const_tarval(c1), tv);
3911 /* TODO: move to constant evaluation */
3912 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
3913 c1 = new_Const(mode_b, tv);
3914 DBG_OPT_CSTEVAL(proj, c1);
3918 if (tarval_is_single_bit(tv)) {
3920 * optimization for AND:
3922 * And(x, C) == C ==> And(x, C) != 0
3923 * And(x, C) != C ==> And(X, C) == 0
3925 * if C is a single Bit constant.
3928 /* check for Constant's match. We have check hare the tarvals,
3929 because our const might be changed */
3930 if (get_Const_tarval(c1) == tv) {
3931 /* fine: do the transformation */
3932 tv = get_mode_null(get_tarval_mode(tv));
3933 proj_nr ^= pn_Cmp_Leg;
3935 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
3941 c1 = get_Or_right(left);
3942 if (is_Const(c1) && tarval_is_null(tv)) {
3944 * Or(x, C) == 0 && C != 0 ==> FALSE
3945 * Or(x, C) != 0 && C != 0 ==> TRUE
3947 if (! tarval_is_null(get_Const_tarval(c1))) {
3948 /* TODO: move to constant evaluation */
3949 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
3950 c1 = new_Const(mode_b, tv);
3951 DBG_OPT_CSTEVAL(proj, c1);
3958 * optimize x << c1 == c into x & (-1 >>u c1) == c >> c1 if c & (-1 << c1) == c
3960 * optimize x << c1 != c into x & (-1 >>u c1) != c >> c1 if c & (-1 << c1) == c
3963 c1 = get_Shl_right(left);
3965 tarval *tv1 = get_Const_tarval(c1);
3966 ir_mode *mode = get_irn_mode(left);
3967 tarval *minus1 = get_mode_all_one(mode);
3968 tarval *amask = tarval_shr(minus1, tv1);
3969 tarval *cmask = tarval_shl(minus1, tv1);
3972 if (tarval_and(tv, cmask) != tv) {
3973 /* condition not met */
3974 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
3975 c1 = new_Const(mode_b, tv);
3976 DBG_OPT_CSTEVAL(proj, c1);
3979 sl = get_Shl_left(left);
3980 blk = get_nodes_block(n);
3981 left = new_rd_And(get_irn_dbg_info(left), current_ir_graph, blk, sl, new_Const(mode, amask), mode);
3982 tv = tarval_shr(tv, tv1);
3984 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
3989 * optimize x >>u c1 == c into x & (-1 << c1) == c << c1 if c & (-1 >>u c1) == c
3991 * optimize x >>u c1 != c into x & (-1 << c1) != c << c1 if c & (-1 >>u c1) == c
3994 c1 = get_Shr_right(left);
3996 tarval *tv1 = get_Const_tarval(c1);
3997 ir_mode *mode = get_irn_mode(left);
3998 tarval *minus1 = get_mode_all_one(mode);
3999 tarval *amask = tarval_shl(minus1, tv1);
4000 tarval *cmask = tarval_shr(minus1, tv1);
4003 if (tarval_and(tv, cmask) != tv) {
4004 /* condition not met */
4005 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4006 c1 = new_Const(mode_b, tv);
4007 DBG_OPT_CSTEVAL(proj, c1);
4010 sl = get_Shr_left(left);
4011 blk = get_nodes_block(n);
4012 left = new_rd_And(get_irn_dbg_info(left), current_ir_graph, blk, sl, new_Const(mode, amask), mode);
4013 tv = tarval_shl(tv, tv1);
4015 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4020 * optimize x >>s c1 == c into x & (-1 << c1) == c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4022 * optimize x >>s c1 != c into x & (-1 << c1) != c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4025 c1 = get_Shrs_right(left);
4027 tarval *tv1 = get_Const_tarval(c1);
4028 ir_mode *mode = get_irn_mode(left);
4029 tarval *minus1 = get_mode_all_one(mode);
4030 tarval *amask = tarval_shl(minus1, tv1);
4031 tarval *cond = new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(tv1));
4034 cond = tarval_sub(cond, tv1);
4035 cond = tarval_shrs(tv, cond);
4037 if (!tarval_is_all_one(cond) && !tarval_is_null(cond)) {
4038 /* condition not met */
4039 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4040 c1 = new_Const(mode_b, tv);
4041 DBG_OPT_CSTEVAL(proj, c1);
4044 sl = get_Shrs_left(left);
4045 blk = get_nodes_block(n);
4046 left = new_rd_And(get_irn_dbg_info(left), current_ir_graph, blk, sl, new_Const(mode, amask), mode);
4047 tv = tarval_shl(tv, tv1);
4049 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4054 } /* tarval != bad */
4057 if (changed & 2) /* need a new Const */
4058 right = new_Const(mode, tv);
4060 if ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) && is_Const(right) && is_Const_null(right) && is_Proj(left)) {
4061 ir_node *op = get_Proj_pred(left);
4063 if ((is_Mod(op) && get_Proj_proj(left) == pn_Mod_res) ||
4064 (is_DivMod(op) && get_Proj_proj(left) == pn_DivMod_res_mod)) {
4065 ir_node *c = get_binop_right(op);
4068 tarval *tv = get_Const_tarval(c);
4070 if (tarval_is_single_bit(tv)) {
4071 /* special case: (x % 2^n) CMP 0 ==> x & (2^n-1) CMP 0 */
4072 ir_node *v = get_binop_left(op);
4073 ir_node *blk = get_irn_n(op, -1);
4074 ir_mode *mode = get_irn_mode(v);
4076 tv = tarval_sub(tv, get_mode_one(mode));
4077 left = new_rd_And(get_irn_dbg_info(op), current_ir_graph, blk, v, new_Const(mode, tv), mode);
4079 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_MOD_TO_AND);
4086 ir_node *block = get_irn_n(n, -1); /* Beware of get_nodes_Block() */
4088 /* create a new compare */
4089 n = new_rd_Cmp(get_irn_dbg_info(n), current_ir_graph, block, left, right);
4091 set_Proj_pred(proj, n);
4092 set_Proj_proj(proj, proj_nr);
4096 } /* transform_node_Proj_Cmp */
4099 * Does all optimizations on nodes that must be done on it's Proj's
4100 * because of creating new nodes.
4102 static ir_node *transform_node_Proj(ir_node *proj) {
4103 ir_node *n = get_Proj_pred(proj);
4105 switch (get_irn_opcode(n)) {
4107 return transform_node_Proj_Div(proj);
4110 return transform_node_Proj_Mod(proj);
4113 return transform_node_Proj_DivMod(proj);
4116 return transform_node_Proj_Cond(proj);
4119 return transform_node_Proj_Cmp(proj);
4122 /* should not happen, but if it does will be optimized away */
4123 return equivalent_node_Proj(proj);
4129 } /* transform_node_Proj */
4132 * Move Confirms down through Phi nodes.
4134 static ir_node *transform_node_Phi(ir_node *phi) {
4136 ir_mode *mode = get_irn_mode(phi);
4138 if (mode_is_reference(mode)) {
4139 n = get_irn_arity(phi);
4141 /* Beware of Phi0 */
4143 ir_node *pred = get_irn_n(phi, 0);
4144 ir_node *bound, *new_Phi, *block, **in;
4147 if (! is_Confirm(pred))
4150 bound = get_Confirm_bound(pred);
4151 pnc = get_Confirm_cmp(pred);
4153 NEW_ARR_A(ir_node *, in, n);
4154 in[0] = get_Confirm_value(pred);
4156 for (i = 1; i < n; ++i) {
4157 pred = get_irn_n(phi, i);
4159 if (! is_Confirm(pred) ||
4160 get_Confirm_bound(pred) != bound ||
4161 get_Confirm_cmp(pred) != pnc)
4163 in[i] = get_Confirm_value(pred);
4165 /* move the Confirm nodes "behind" the Phi */
4166 block = get_irn_n(phi, -1);
4167 new_Phi = new_r_Phi(current_ir_graph, block, n, in, get_irn_mode(phi));
4168 return new_r_Confirm(current_ir_graph, block, new_Phi, bound, pnc);
4172 } /* transform_node_Phi */
4175 * Returns the operands of a commutative bin-op, if one operand is
4176 * a const, it is returned as the second one.
4178 static void get_comm_Binop_Ops(ir_node *binop, ir_node **a, ir_node **c) {
4179 ir_node *op_a = get_binop_left(binop);
4180 ir_node *op_b = get_binop_right(binop);
4182 assert(is_op_commutative(get_irn_op(binop)));
4184 if (is_Const(op_a)) {
4191 } /* get_comm_Binop_Ops */
4194 * Optimize a Or(And(Or(And(v,c4),c3),c2),c1) pattern if possible.
4195 * Such pattern may arise in bitfield stores.
4197 * value c4 value c4 & c2
4198 * AND c3 AND c1 | c3
4205 * AND c1 ===> OR if (c1 | c2) == 0x111..11
4208 static ir_node *transform_node_Or_bf_store(ir_node *or) {
4211 ir_node *and_l, *c3;
4212 ir_node *value, *c4;
4213 ir_node *new_and, *new_const, *block;
4214 ir_mode *mode = get_irn_mode(or);
4216 tarval *tv1, *tv2, *tv3, *tv4, *tv, *n_tv4, *n_tv2;
4219 get_comm_Binop_Ops(or, &and, &c1);
4220 if (!is_Const(c1) || !is_And(and))
4223 get_comm_Binop_Ops(and, &or_l, &c2);
4227 tv1 = get_Const_tarval(c1);
4228 tv2 = get_Const_tarval(c2);
4230 tv = tarval_or(tv1, tv2);
4231 if (tarval_is_all_one(tv)) {
4232 /* the AND does NOT clear a bit with isn't set by the OR */
4233 set_Or_left(or, or_l);
4234 set_Or_right(or, c1);
4236 /* check for more */
4243 get_comm_Binop_Ops(or_l, &and_l, &c3);
4244 if (!is_Const(c3) || !is_And(and_l))
4247 get_comm_Binop_Ops(and_l, &value, &c4);
4251 /* ok, found the pattern, check for conditions */
4252 assert(mode == get_irn_mode(and));
4253 assert(mode == get_irn_mode(or_l));
4254 assert(mode == get_irn_mode(and_l));
4256 tv3 = get_Const_tarval(c3);
4257 tv4 = get_Const_tarval(c4);
4259 tv = tarval_or(tv4, tv2);
4260 if (!tarval_is_all_one(tv)) {
4261 /* have at least one 0 at the same bit position */
4265 n_tv4 = tarval_not(tv4);
4266 if (tv3 != tarval_and(tv3, n_tv4)) {
4267 /* bit in the or_mask is outside the and_mask */
4271 n_tv2 = tarval_not(tv2);
4272 if (tv1 != tarval_and(tv1, n_tv2)) {
4273 /* bit in the or_mask is outside the and_mask */
4277 /* ok, all conditions met */
4278 block = get_irn_n(or, -1);
4280 new_and = new_r_And(current_ir_graph, block,
4281 value, new_r_Const(current_ir_graph, block, mode, tarval_and(tv4, tv2)), mode);
4283 new_const = new_r_Const(current_ir_graph, block, mode, tarval_or(tv3, tv1));
4285 set_Or_left(or, new_and);
4286 set_Or_right(or, new_const);
4288 /* check for more */
4290 } /* transform_node_Or_bf_store */
4293 * Optimize an Or(shl(x, c), shr(x, bits - c)) into a Rot
4295 static ir_node *transform_node_Or_Rot(ir_node *or) {
4296 ir_mode *mode = get_irn_mode(or);
4297 ir_node *shl, *shr, *block;
4298 ir_node *irn, *x, *c1, *c2, *v, *sub, *n;
4301 if (! mode_is_int(mode))
4304 shl = get_binop_left(or);
4305 shr = get_binop_right(or);
4314 } else if (!is_Shl(shl)) {
4316 } else if (!is_Shr(shr)) {
4319 x = get_Shl_left(shl);
4320 if (x != get_Shr_left(shr))
4323 c1 = get_Shl_right(shl);
4324 c2 = get_Shr_right(shr);
4325 if (is_Const(c1) && is_Const(c2)) {
4326 tv1 = get_Const_tarval(c1);
4327 if (! tarval_is_long(tv1))
4330 tv2 = get_Const_tarval(c2);
4331 if (! tarval_is_long(tv2))
4334 if (get_tarval_long(tv1) + get_tarval_long(tv2)
4335 != get_mode_size_bits(mode))
4338 /* yet, condition met */
4339 block = get_irn_n(or, -1);
4341 n = new_r_Rot(current_ir_graph, block, x, c1, mode);
4343 DBG_OPT_ALGSIM1(or, shl, shr, n, FS_OPT_OR_SHFT_TO_ROT);
4345 } else if (is_Sub(c1)) {
4349 if (get_Sub_right(sub) != v)
4352 c1 = get_Sub_left(sub);
4356 tv1 = get_Const_tarval(c1);
4357 if (! tarval_is_long(tv1))
4360 if (get_tarval_long(tv1) != get_mode_size_bits(mode))
4363 /* yet, condition met */
4364 block = get_nodes_block(or);
4366 /* a Rot right is not supported, so use a rot left */
4367 n = new_r_Rot(current_ir_graph, block, x, sub, mode);
4369 DBG_OPT_ALGSIM0(or, n, FS_OPT_OR_SHFT_TO_ROT);
4371 } else if (is_Sub(c2)) {
4375 c1 = get_Sub_left(sub);
4379 tv1 = get_Const_tarval(c1);
4380 if (! tarval_is_long(tv1))
4383 if (get_tarval_long(tv1) != get_mode_size_bits(mode))
4386 /* yet, condition met */
4387 block = get_irn_n(or, -1);
4390 n = new_r_Rot(current_ir_graph, block, x, v, mode);
4392 DBG_OPT_ALGSIM0(or, n, FS_OPT_OR_SHFT_TO_ROT);
4397 } /* transform_node_Or_Rot */
4402 static ir_node *transform_node_Or(ir_node *n) {
4403 ir_node *c, *oldn = n;
4404 ir_node *a = get_Or_left(n);
4405 ir_node *b = get_Or_right(n);
4408 if (is_Not(a) && is_Not(b)) {
4409 /* ~a | ~b = ~(a&b) */
4410 ir_node *block = get_nodes_block(n);
4412 mode = get_irn_mode(n);
4415 n = new_rd_And(get_irn_dbg_info(n), current_ir_graph, block, a, b, mode);
4416 n = new_rd_Not(get_irn_dbg_info(n), current_ir_graph, block, n, mode);
4417 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
4421 /* we can evaluate 2 Projs of the same Cmp */
4422 if (get_irn_mode(n) == mode_b && is_Proj(a) && is_Proj(b)) {
4423 ir_node *pred_a = get_Proj_pred(a);
4424 ir_node *pred_b = get_Proj_pred(b);
4425 if (pred_a == pred_b) {
4426 dbg_info *dbgi = get_irn_dbg_info(n);
4427 ir_node *block = get_nodes_block(pred_a);
4428 pn_Cmp pn_a = get_Proj_proj(a);
4429 pn_Cmp pn_b = get_Proj_proj(b);
4430 /* yes, we can simply calculate with pncs */
4431 pn_Cmp new_pnc = pn_a | pn_b;
4433 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b,
4438 mode = get_irn_mode(n);
4439 HANDLE_BINOP_PHI(tarval_or, a, b, c, mode);
4441 n = transform_node_Or_bf_store(n);
4442 n = transform_node_Or_Rot(n);
4446 n = transform_bitwise_distributive(n, transform_node_Or);
4449 } /* transform_node_Or */
4453 static ir_node *transform_node(ir_node *n);
4456 * Optimize (a >> c1) >> c2), works for Shr, Shrs, Shl, Rot.
4458 * Should be moved to reassociation?
4460 static ir_node *transform_node_shift(ir_node *n) {
4461 ir_node *left, *right;
4462 tarval *tv1, *tv2, *res;
4464 int modulo_shf, flag;
4466 left = get_binop_left(n);
4468 /* different operations */
4469 if (get_irn_op(left) != get_irn_op(n))
4472 right = get_binop_right(n);
4473 tv1 = value_of(right);
4474 if (tv1 == tarval_bad)
4477 tv2 = value_of(get_binop_right(left));
4478 if (tv2 == tarval_bad)
4481 res = tarval_add(tv1, tv2);
4483 /* beware: a simple replacement works only, if res < modulo shift */
4484 mode = get_irn_mode(n);
4488 modulo_shf = get_mode_modulo_shift(mode);
4489 if (modulo_shf > 0) {
4490 tarval *modulo = new_tarval_from_long(modulo_shf, get_tarval_mode(res));
4492 if (tarval_cmp(res, modulo) & pn_Cmp_Lt)
4498 /* ok, we can replace it */
4499 ir_node *in[2], *irn, *block = get_irn_n(n, -1);
4501 in[0] = get_binop_left(left);
4502 in[1] = new_r_Const(current_ir_graph, block, get_tarval_mode(res), res);
4504 irn = new_ir_node(NULL, current_ir_graph, block, get_irn_op(n), mode, 2, in);
4506 DBG_OPT_ALGSIM0(n, irn, FS_OPT_REASSOC_SHIFT);
4508 return transform_node(irn);
4511 } /* transform_node_shift */
4516 static ir_node *transform_node_Shr(ir_node *n) {
4517 ir_node *c, *oldn = n;
4518 ir_node *a = get_Shr_left(n);
4519 ir_node *b = get_Shr_right(n);
4520 ir_mode *mode = get_irn_mode(n);
4522 HANDLE_BINOP_PHI(tarval_shr, a, b, c, mode);
4523 return transform_node_shift(n);
4524 } /* transform_node_Shr */
4529 static ir_node *transform_node_Shrs(ir_node *n) {
4530 ir_node *c, *oldn = n;
4531 ir_node *a = get_Shrs_left(n);
4532 ir_node *b = get_Shrs_right(n);
4533 ir_mode *mode = get_irn_mode(n);
4535 HANDLE_BINOP_PHI(tarval_shrs, a, b, c, mode);
4536 return transform_node_shift(n);
4537 } /* transform_node_Shrs */
4542 static ir_node *transform_node_Shl(ir_node *n) {
4543 ir_node *c, *oldn = n;
4544 ir_node *a = get_Shl_left(n);
4545 ir_node *b = get_Shl_right(n);
4546 ir_mode *mode = get_irn_mode(n);
4548 HANDLE_BINOP_PHI(tarval_shl, a, b, c, mode);
4549 return transform_node_shift(n);
4550 } /* transform_node_Shl */
4555 static ir_node *transform_node_Rot(ir_node *n) {
4556 ir_node *c, *oldn = n;
4557 ir_node *a = get_Rot_left(n);
4558 ir_node *b = get_Rot_right(n);
4559 ir_mode *mode = get_irn_mode(n);
4561 HANDLE_BINOP_PHI(tarval_rot, a, b, c, mode);
4562 return transform_node_shift(n);
4563 } /* transform_node_Rot */
4568 static ir_node *transform_node_Conv(ir_node *n) {
4569 ir_node *c, *oldn = n;
4570 ir_node *a = get_Conv_op(n);
4572 if (is_const_Phi(a)) {
4573 c = apply_conv_on_phi(a, get_irn_mode(n));
4575 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI);
4580 } /* transform_node_Conv */
4583 * Remove dead blocks and nodes in dead blocks
4584 * in keep alive list. We do not generate a new End node.
4586 static ir_node *transform_node_End(ir_node *n) {
4587 int i, j, n_keepalives = get_End_n_keepalives(n);
4590 NEW_ARR_A(ir_node *, in, n_keepalives);
4592 for (i = j = 0; i < n_keepalives; ++i) {
4593 ir_node *ka = get_End_keepalive(n, i);
4595 if (! is_Block_dead(ka)) {
4599 } else if (is_irn_pinned_in_irg(ka) && is_Block_dead(get_nodes_block(ka))) {
4602 /* FIXME: beabi need to keep a Proj(M) */
4603 if (is_Phi(ka) || is_irn_keep(ka) || is_Proj(ka))
4606 if (j != n_keepalives)
4607 set_End_keepalives(n, j, in);
4609 } /* transform_node_End */
4611 /** returns 1 if a == -b */
4612 static int is_negated_value(ir_node *a, ir_node *b) {
4613 if(is_Minus(a) && get_Minus_op(a) == b)
4615 if(is_Minus(b) && get_Minus_op(b) == a)
4617 if(is_Sub(a) && is_Sub(b)) {
4618 ir_node *a_left = get_Sub_left(a);
4619 ir_node *a_right = get_Sub_right(a);
4620 ir_node *b_left = get_Sub_left(b);
4621 ir_node *b_right = get_Sub_right(b);
4623 if(a_left == b_right && a_right == b_left)
4631 * Optimize a Mux into some simpler cases.
4633 static ir_node *transform_node_Mux(ir_node *n) {
4634 ir_node *oldn = n, *sel = get_Mux_sel(n);
4635 ir_mode *mode = get_irn_mode(n);
4637 if (mode == mode_b) {
4638 ir_node *t = get_Mux_true(n);
4639 ir_node *f = get_Mux_false(n);
4640 dbg_info *dbg = get_irn_dbg_info(n);
4641 ir_node *block = get_irn_n(n, -1);
4642 ir_graph *irg = current_ir_graph;
4645 tarval *tv_t = get_Const_tarval(t);
4646 if (tv_t == tarval_b_true) {
4648 assert(get_Const_tarval(f) == tarval_b_false);
4651 return new_rd_Or(dbg, irg, block, sel, f, mode_b);
4654 ir_node* not_sel = new_rd_Not(dbg, irg, block, sel, mode_b);
4655 assert(tv_t == tarval_b_false);
4657 assert(get_Const_tarval(f) == tarval_b_true);
4660 return new_rd_And(dbg, irg, block, not_sel, f, mode_b);
4663 } else if (is_Const(f)) {
4664 tarval *tv_f = get_Const_tarval(f);
4665 if (tv_f == tarval_b_true) {
4666 ir_node* not_sel = new_rd_Not(dbg, irg, block, sel, mode_b);
4667 return new_rd_Or(dbg, irg, block, not_sel, t, mode_b);
4669 assert(tv_f == tarval_b_false);
4670 return new_rd_And(dbg, irg, block, sel, t, mode_b);
4675 if (is_Proj(sel) && !mode_honor_signed_zeros(mode)) {
4676 ir_node *cmp = get_Proj_pred(sel);
4677 long pn = get_Proj_proj(sel);
4678 ir_node *f = get_Mux_false(n);
4679 ir_node *t = get_Mux_true(n);
4682 * Note: normalization puts the constant on the right side,
4683 * so we check only one case.
4685 * Note further that these optimization work even for floating point
4686 * with NaN's because -NaN == NaN.
4687 * However, if +0 and -0 is handled differently, we cannot use the first
4691 ir_node *cmp_r = get_Cmp_right(cmp);
4692 if (is_Const(cmp_r) && is_Const_null(cmp_r)) {
4693 ir_node *block = get_irn_n(n, -1);
4695 if(is_negated_value(f, t)) {
4696 ir_node *cmp_left = get_Cmp_left(cmp);
4698 /* Psi(a >= 0, a, -a) = Psi(a <= 0, -a, a) ==> Abs(a) */
4699 if ( (cmp_left == t && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt))
4700 || (cmp_left == f && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt)))
4702 n = new_rd_Abs(get_irn_dbg_info(n), current_ir_graph, block,
4704 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
4706 /* Psi(a <= 0, a, -a) = Psi(a >= 0, -a, a) ==> -Abs(a) */
4707 } else if ((cmp_left == t && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt))
4708 || (cmp_left == f && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt)))
4710 n = new_rd_Abs(get_irn_dbg_info(n), current_ir_graph, block,
4712 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph,
4714 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
4721 return arch_transform_node_Mux(n);
4722 } /* transform_node_Mux */
4725 * Optimize a Psi into some simpler cases.
4727 static ir_node *transform_node_Psi(ir_node *n) {
4729 return transform_node_Mux(n);
4732 } /* transform_node_Psi */
4735 * optimize sync nodes that have other syncs as input we simply add the inputs
4736 * of the other sync to our own inputs
4738 static ir_node *transform_node_Sync(ir_node *n) {
4741 arity = get_irn_arity(n);
4742 for(i = 0; i < get_irn_arity(n); /*empty*/) {
4744 ir_node *in = get_irn_n(n, i);
4750 /* set sync input 0 instead of the sync */
4751 set_irn_n(n, i, get_irn_n(in, 0));
4752 /* so we check this input again for syncs */
4754 /* append all other inputs of the sync to our sync */
4755 arity2 = get_irn_arity(in);
4756 for(i2 = 1; i2 < arity2; ++i2) {
4757 ir_node *in_in = get_irn_n(in, i2);
4758 add_irn_n(n, in_in);
4759 /* increase arity so we also check the new inputs for syncs */
4764 /* rehash the sync node */
4765 add_identities(current_ir_graph->value_table, n);
4771 * Tries several [inplace] [optimizing] transformations and returns an
4772 * equivalent node. The difference to equivalent_node() is that these
4773 * transformations _do_ generate new nodes, and thus the old node must
4774 * not be freed even if the equivalent node isn't the old one.
4776 static ir_node *transform_node(ir_node *n) {
4780 * Transform_node is the only "optimizing transformation" that might
4781 * return a node with a different opcode. We iterate HERE until fixpoint
4782 * to get the final result.
4786 if (n->op->ops.transform_node)
4787 n = n->op->ops.transform_node(n);
4788 } while (oldn != n);
4791 } /* transform_node */
4794 * Sets the default transform node operation for an ir_op_ops.
4796 * @param code the opcode for the default operation
4797 * @param ops the operations initialized
4802 static ir_op_ops *firm_set_default_transform_node(ir_opcode code, ir_op_ops *ops)
4806 ops->transform_node = transform_node_##a; \
4843 } /* firm_set_default_transform_node */
4846 /* **************** Common Subexpression Elimination **************** */
4848 /** The size of the hash table used, should estimate the number of nodes
4850 #define N_IR_NODES 512
4852 /** Compares the attributes of two Const nodes. */
4853 static int node_cmp_attr_Const(ir_node *a, ir_node *b) {
4854 return (get_Const_tarval(a) != get_Const_tarval(b))
4855 || (get_Const_type(a) != get_Const_type(b));
4856 } /* node_cmp_attr_Const */
4858 /** Compares the attributes of two Proj nodes. */
4859 static int node_cmp_attr_Proj(ir_node *a, ir_node *b) {
4860 return get_irn_proj_attr(a) != get_irn_proj_attr(b);
4861 } /* node_cmp_attr_Proj */
4863 /** Compares the attributes of two Filter nodes. */
4864 static int node_cmp_attr_Filter(ir_node *a, ir_node *b) {
4865 return get_Filter_proj(a) != get_Filter_proj(b);
4866 } /* node_cmp_attr_Filter */
4868 /** Compares the attributes of two Alloc nodes. */
4869 static int node_cmp_attr_Alloc(ir_node *a, ir_node *b) {
4870 const alloc_attr *pa = get_irn_alloc_attr(a);
4871 const alloc_attr *pb = get_irn_alloc_attr(b);
4872 return (pa->where != pb->where) || (pa->type != pb->type);
4873 } /* node_cmp_attr_Alloc */
4875 /** Compares the attributes of two Free nodes. */
4876 static int node_cmp_attr_Free(ir_node *a, ir_node *b) {
4877 const free_attr *pa = get_irn_free_attr(a);
4878 const free_attr *pb = get_irn_free_attr(b);
4879 return (pa->where != pb->where) || (pa->type != pb->type);
4880 } /* node_cmp_attr_Free */
4882 /** Compares the attributes of two SymConst nodes. */
4883 static int node_cmp_attr_SymConst(ir_node *a, ir_node *b) {
4884 const symconst_attr *pa = get_irn_symconst_attr(a);
4885 const symconst_attr *pb = get_irn_symconst_attr(b);
4886 return (pa->num != pb->num)
4887 || (pa->sym.type_p != pb->sym.type_p)
4888 || (pa->tp != pb->tp);
4889 } /* node_cmp_attr_SymConst */
4891 /** Compares the attributes of two Call nodes. */
4892 static int node_cmp_attr_Call(ir_node *a, ir_node *b) {
4893 return (get_irn_call_attr(a) != get_irn_call_attr(b));
4894 } /* node_cmp_attr_Call */
4896 /** Compares the attributes of two Sel nodes. */
4897 static int node_cmp_attr_Sel(ir_node *a, ir_node *b) {
4898 const ir_entity *a_ent = get_Sel_entity(a);
4899 const ir_entity *b_ent = get_Sel_entity(b);
4901 (a_ent->kind != b_ent->kind) ||
4902 (a_ent->name != b_ent->name) ||
4903 (a_ent->owner != b_ent->owner) ||
4904 (a_ent->ld_name != b_ent->ld_name) ||
4905 (a_ent->type != b_ent->type);
4906 } /* node_cmp_attr_Sel */
4908 /** Compares the attributes of two Phi nodes. */
4909 static int node_cmp_attr_Phi(ir_node *a, ir_node *b) {
4910 /* we can only enter this function if both nodes have the same number of inputs,
4911 hence it is enough to check if one of them is a Phi0 */
4913 /* check the Phi0 attribute */
4914 return get_irn_phi0_attr(a) != get_irn_phi0_attr(b);
4917 } /* node_cmp_attr_Phi */
4919 /** Compares the attributes of two Conv nodes. */
4920 static int node_cmp_attr_Conv(ir_node *a, ir_node *b) {
4921 return get_Conv_strict(a) != get_Conv_strict(b);
4922 } /* node_cmp_attr_Conv */
4924 /** Compares the attributes of two Cast nodes. */
4925 static int node_cmp_attr_Cast(ir_node *a, ir_node *b) {
4926 return get_Cast_type(a) != get_Cast_type(b);
4927 } /* node_cmp_attr_Cast */
4929 /** Compares the attributes of two Load nodes. */
4930 static int node_cmp_attr_Load(ir_node *a, ir_node *b) {
4931 if (get_Load_volatility(a) == volatility_is_volatile ||
4932 get_Load_volatility(b) == volatility_is_volatile)
4933 /* NEVER do CSE on volatile Loads */
4935 /* do not CSE Loads with different alignment. Be conservative. */
4936 if (get_Load_align(a) != get_Load_align(b))
4939 return get_Load_mode(a) != get_Load_mode(b);
4940 } /* node_cmp_attr_Load */
4942 /** Compares the attributes of two Store nodes. */
4943 static int node_cmp_attr_Store(ir_node *a, ir_node *b) {
4944 /* do not CSE Stores with different alignment. Be conservative. */
4945 if (get_Store_align(a) != get_Store_align(b))
4948 /* NEVER do CSE on volatile Stores */
4949 return (get_Store_volatility(a) == volatility_is_volatile ||
4950 get_Store_volatility(b) == volatility_is_volatile);
4951 } /* node_cmp_attr_Store */
4953 /** Compares the attributes of two Confirm nodes. */
4954 static int node_cmp_attr_Confirm(ir_node *a, ir_node *b) {
4955 return (get_Confirm_cmp(a) != get_Confirm_cmp(b));
4956 } /* node_cmp_attr_Confirm */
4958 /** Compares the attributes of two ASM nodes. */
4959 static int node_cmp_attr_ASM(ir_node *a, ir_node *b) {
4961 const ir_asm_constraint *ca;
4962 const ir_asm_constraint *cb;
4965 if (get_ASM_text(a) != get_ASM_text(b))
4968 /* Should we really check the constraints here? Should be better, but is strange. */
4969 n = get_ASM_n_input_constraints(a);
4970 if (n != get_ASM_n_input_constraints(b))
4973 ca = get_ASM_input_constraints(a);
4974 cb = get_ASM_input_constraints(b);
4975 for (i = 0; i < n; ++i) {
4976 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
4980 n = get_ASM_n_output_constraints(a);
4981 if (n != get_ASM_n_output_constraints(b))
4984 ca = get_ASM_output_constraints(a);
4985 cb = get_ASM_output_constraints(b);
4986 for (i = 0; i < n; ++i) {
4987 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
4991 n = get_ASM_n_clobbers(a);
4992 if (n != get_ASM_n_clobbers(b))
4995 cla = get_ASM_clobbers(a);
4996 clb = get_ASM_clobbers(b);
4997 for (i = 0; i < n; ++i) {
4998 if (cla[i] != clb[i])
5002 } /* node_cmp_attr_ASM */
5005 * Set the default node attribute compare operation for an ir_op_ops.
5007 * @param code the opcode for the default operation
5008 * @param ops the operations initialized
5013 static ir_op_ops *firm_set_default_node_cmp_attr(ir_opcode code, ir_op_ops *ops)
5017 ops->node_cmp_attr = node_cmp_attr_##a; \
5042 } /* firm_set_default_node_cmp_attr */
5045 * Compare function for two nodes in the hash table. Gets two
5046 * nodes as parameters. Returns 0 if the nodes are a cse.
5048 int identities_cmp(const void *elt, const void *key) {
5055 if (a == b) return 0;
5057 if ((get_irn_op(a) != get_irn_op(b)) ||
5058 (get_irn_mode(a) != get_irn_mode(b))) return 1;
5060 /* compare if a's in and b's in are of equal length */
5061 irn_arity_a = get_irn_intra_arity (a);
5062 if (irn_arity_a != get_irn_intra_arity(b))
5065 /* for block-local cse and op_pin_state_pinned nodes: */
5066 if (!get_opt_global_cse() || (get_irn_pinned(a) == op_pin_state_pinned)) {
5067 if (get_irn_intra_n(a, -1) != get_irn_intra_n(b, -1))
5071 /* compare a->in[0..ins] with b->in[0..ins] */
5072 for (i = 0; i < irn_arity_a; i++)
5073 if (get_irn_intra_n(a, i) != get_irn_intra_n(b, i))
5077 * here, we already now that the nodes are identical except their
5080 if (a->op->ops.node_cmp_attr)
5081 return a->op->ops.node_cmp_attr(a, b);
5084 } /* identities_cmp */
5087 * Calculate a hash value of a node.
5089 unsigned ir_node_hash(ir_node *node) {
5093 if (node->op == op_Const) {
5094 /* special value for const, as they only differ in their tarval. */
5095 h = HASH_PTR(node->attr.con.tv);
5096 h = 9*h + HASH_PTR(get_irn_mode(node));
5097 } else if (node->op == op_SymConst) {
5098 /* special value for const, as they only differ in their symbol. */
5099 h = HASH_PTR(node->attr.symc.sym.type_p);
5100 h = 9*h + HASH_PTR(get_irn_mode(node));
5103 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
5104 h = irn_arity = get_irn_intra_arity(node);
5106 /* consider all in nodes... except the block if not a control flow. */
5107 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; i++) {
5108 h = 9*h + HASH_PTR(get_irn_intra_n(node, i));
5112 h = 9*h + HASH_PTR(get_irn_mode(node));
5114 h = 9*h + HASH_PTR(get_irn_op(node));
5118 } /* ir_node_hash */
5120 pset *new_identities(void) {
5121 return new_pset(identities_cmp, N_IR_NODES);
5122 } /* new_identities */
5124 void del_identities(pset *value_table) {
5125 del_pset(value_table);
5126 } /* del_identities */
5129 * Normalize a node by putting constants (and operands with smaller
5130 * node index) on the right
5132 * @param n The node to normalize
5134 static void normalize_node(ir_node *n) {
5135 if (get_opt_reassociation()) {
5136 if (is_op_commutative(get_irn_op(n))) {
5137 ir_node *l = get_binop_left(n);
5138 ir_node *r = get_binop_right(n);
5139 int l_idx = get_irn_idx(l);
5140 int r_idx = get_irn_idx(r);
5142 /* For commutative operators perform a OP b == b OP a but keep
5143 constants on the RIGHT side. This helps greatly in some optimizations.
5144 Moreover we use the idx number to make the form deterministic. */
5145 if (is_irn_constlike(l))
5147 if (is_irn_constlike(r))
5149 if (l_idx < r_idx) {
5150 set_binop_left(n, r);
5151 set_binop_right(n, l);
5155 } /* normalize_node */
5158 * Return the canonical node computing the same value as n.
5160 * @param value_table The value table
5161 * @param n The node to lookup
5163 * Looks up the node in a hash table.
5165 * For Const nodes this is performed in the constructor, too. Const
5166 * nodes are extremely time critical because of their frequent use in
5167 * constant string arrays.
5169 static INLINE ir_node *identify(pset *value_table, ir_node *n) {
5172 if (!value_table) return n;
5176 o = pset_find(value_table, n, ir_node_hash(n));
5185 * During construction we set the op_pin_state_pinned flag in the graph right when the
5186 * optimization is performed. The flag turning on procedure global cse could
5187 * be changed between two allocations. This way we are safe.
5189 static INLINE ir_node *identify_cons(pset *value_table, ir_node *n) {
5192 n = identify(value_table, n);
5193 if (get_irn_n(old, -1) != get_irn_n(n, -1))
5194 set_irg_pinned(current_ir_graph, op_pin_state_floats);
5196 } /* identify_cons */
5199 * Return the canonical node computing the same value as n.
5200 * Looks up the node in a hash table, enters it in the table
5201 * if it isn't there yet.
5203 ir_node *identify_remember(pset *value_table, ir_node *n) {
5206 if (!value_table) return n;
5209 /* lookup or insert in hash table with given hash key. */
5210 o = pset_insert(value_table, n, ir_node_hash(n));
5217 } /* identify_remember */
5219 /* Add a node to the identities value table. */
5220 void add_identities(pset *value_table, ir_node *node) {
5221 if (get_opt_cse() && is_no_Block(node))
5222 identify_remember(value_table, node);
5223 } /* add_identities */
5225 /* Visit each node in the value table of a graph. */
5226 void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env) {
5228 ir_graph *rem = current_ir_graph;
5230 current_ir_graph = irg;
5231 foreach_pset(irg->value_table, node)
5233 current_ir_graph = rem;
5234 } /* visit_all_identities */
5237 * Garbage in, garbage out. If a node has a dead input, i.e., the
5238 * Bad node is input to the node, return the Bad node.
5240 static ir_node *gigo(ir_node *node) {
5242 ir_op *op = get_irn_op(node);
5244 /* remove garbage blocks by looking at control flow that leaves the block
5245 and replacing the control flow by Bad. */
5246 if (get_irn_mode(node) == mode_X) {
5247 ir_node *block = get_nodes_block(skip_Proj(node));
5249 /* Don't optimize nodes in immature blocks. */
5250 if (!get_Block_matured(block)) return node;
5251 /* Don't optimize End, may have Bads. */
5252 if (op == op_End) return node;
5254 if (is_Block(block)) {
5255 irn_arity = get_irn_arity(block);
5256 for (i = 0; i < irn_arity; i++) {
5257 if (!is_Bad(get_irn_n(block, i)))
5260 if (i == irn_arity) {
5261 ir_graph *irg = get_irn_irg(block);
5262 /* the start block is never dead */
5263 if (block != get_irg_start_block(irg)
5264 && block != get_irg_end_block(irg))
5270 /* Blocks, Phis and Tuples may have dead inputs, e.g., if one of the
5271 blocks predecessors is dead. */
5272 if (op != op_Block && op != op_Phi && op != op_Tuple) {
5273 irn_arity = get_irn_arity(node);
5276 * Beware: we can only read the block of a non-floating node.
5278 if (is_irn_pinned_in_irg(node) &&
5279 is_Block_dead(get_nodes_block(node)))
5282 for (i = 0; i < irn_arity; i++) {
5283 ir_node *pred = get_irn_n(node, i);
5288 /* Propagating Unknowns here seems to be a bad idea, because
5289 sometimes we need a node as a input and did not want that
5291 However, it might be useful to move this into a later phase
5292 (if you think that optimizing such code is useful). */
5293 if (is_Unknown(pred) && mode_is_data(get_irn_mode(node)))
5294 return new_Unknown(get_irn_mode(node));
5299 /* With this code we violate the agreement that local_optimize
5300 only leaves Bads in Block, Phi and Tuple nodes. */
5301 /* If Block has only Bads as predecessors it's garbage. */
5302 /* If Phi has only Bads as predecessors it's garbage. */
5303 if ((op == op_Block && get_Block_matured(node)) || op == op_Phi) {
5304 irn_arity = get_irn_arity(node);
5305 for (i = 0; i < irn_arity; i++) {
5306 if (!is_Bad(get_irn_n(node, i))) break;
5308 if (i == irn_arity) node = new_Bad();
5315 * These optimizations deallocate nodes from the obstack.
5316 * It can only be called if it is guaranteed that no other nodes
5317 * reference this one, i.e., right after construction of a node.
5319 * @param n The node to optimize
5321 * current_ir_graph must be set to the graph of the node!
5323 ir_node *optimize_node(ir_node *n) {
5326 ir_opcode iro = get_irn_opcode(n);
5328 /* Always optimize Phi nodes: part of the construction. */
5329 if ((!get_opt_optimize()) && (iro != iro_Phi)) return n;
5331 /* constant expression evaluation / constant folding */
5332 if (get_opt_constant_folding()) {
5333 /* neither constants nor Tuple values can be evaluated */
5334 if (iro != iro_Const && (get_irn_mode(n) != mode_T)) {
5335 unsigned fp_model = get_irg_fp_model(current_ir_graph);
5336 int old_fp_mode = tarval_enable_fp_ops((fp_model & fp_strict_algebraic) == 0);
5337 /* try to evaluate */
5338 tv = computed_value(n);
5339 if (tv != tarval_bad) {
5341 ir_type *old_tp = get_irn_type(n);
5342 int i, arity = get_irn_arity(n);
5346 * Try to recover the type of the new expression.
5348 for (i = 0; i < arity && !old_tp; ++i)
5349 old_tp = get_irn_type(get_irn_n(n, i));
5352 * we MUST copy the node here temporary, because it's still needed
5353 * for DBG_OPT_CSTEVAL
5355 node_size = offsetof(ir_node, attr) + n->op->attr_size;
5356 oldn = alloca(node_size);
5358 memcpy(oldn, n, node_size);
5359 CLONE_ARR_A(ir_node *, oldn->in, n->in);
5361 /* ARG, copy the in array, we need it for statistics */
5362 memcpy(oldn->in, n->in, ARR_LEN(n->in) * sizeof(n->in[0]));
5364 /* note the inplace edges module */
5365 edges_node_deleted(n, current_ir_graph);
5367 /* evaluation was successful -- replace the node. */
5368 irg_kill_node(current_ir_graph, n);
5369 nw = new_Const(get_tarval_mode(tv), tv);
5371 if (old_tp && get_type_mode(old_tp) == get_tarval_mode(tv))
5372 set_Const_type(nw, old_tp);
5373 DBG_OPT_CSTEVAL(oldn, nw);
5374 tarval_enable_fp_ops(old_fp_mode);
5377 tarval_enable_fp_ops(old_fp_mode);
5381 /* remove unnecessary nodes */
5382 if (get_opt_constant_folding() ||
5383 (iro == iro_Phi) || /* always optimize these nodes. */
5385 (iro == iro_Proj) ||
5386 (iro == iro_Block) ) /* Flags tested local. */
5387 n = equivalent_node(n);
5389 /* Common Subexpression Elimination.
5391 * Checks whether n is already available.
5392 * The block input is used to distinguish different subexpressions. Right
5393 * now all nodes are op_pin_state_pinned to blocks, i.e., the CSE only finds common
5394 * subexpressions within a block.
5397 n = identify_cons(current_ir_graph->value_table, n);
5400 edges_node_deleted(oldn, current_ir_graph);
5402 /* We found an existing, better node, so we can deallocate the old node. */
5403 irg_kill_node(current_ir_graph, oldn);
5407 /* Some more constant expression evaluation that does not allow to
5409 iro = get_irn_opcode(n);
5410 if (get_opt_constant_folding() ||
5411 (iro == iro_Cond) ||
5412 (iro == iro_Proj)) /* Flags tested local. */
5413 n = transform_node(n);
5415 /* Remove nodes with dead (Bad) input.
5416 Run always for transformation induced Bads. */
5419 /* Now we have a legal, useful node. Enter it in hash table for CSE */
5420 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block)) {
5421 n = identify_remember(current_ir_graph->value_table, n);
5425 } /* optimize_node */
5429 * These optimizations never deallocate nodes (in place). This can cause dead
5430 * nodes lying on the obstack. Remove these by a dead node elimination,
5431 * i.e., a copying garbage collection.
5433 ir_node *optimize_in_place_2(ir_node *n) {
5436 ir_opcode iro = get_irn_opcode(n);
5438 if (!get_opt_optimize() && !is_Phi(n)) return n;
5440 /* constant expression evaluation / constant folding */
5441 if (get_opt_constant_folding()) {
5442 /* neither constants nor Tuple values can be evaluated */
5443 if (iro != iro_Const && get_irn_mode(n) != mode_T) {
5444 unsigned fp_model = get_irg_fp_model(current_ir_graph);
5445 int old_fp_mode = tarval_enable_fp_ops((fp_model & fp_strict_algebraic) == 0);
5446 /* try to evaluate */
5447 tv = computed_value(n);
5448 if (tv != tarval_bad) {
5449 /* evaluation was successful -- replace the node. */
5450 ir_type *old_tp = get_irn_type(n);
5451 int i, arity = get_irn_arity(n);
5454 * Try to recover the type of the new expression.
5456 for (i = 0; i < arity && !old_tp; ++i)
5457 old_tp = get_irn_type(get_irn_n(n, i));
5459 n = new_Const(get_tarval_mode(tv), tv);
5461 if (old_tp && get_type_mode(old_tp) == get_tarval_mode(tv))
5462 set_Const_type(n, old_tp);
5464 DBG_OPT_CSTEVAL(oldn, n);
5465 tarval_enable_fp_ops(old_fp_mode);
5468 tarval_enable_fp_ops(old_fp_mode);
5472 /* remove unnecessary nodes */
5473 if (get_opt_constant_folding() ||
5474 (iro == iro_Phi) || /* always optimize these nodes. */
5475 (iro == iro_Id) || /* ... */
5476 (iro == iro_Proj) || /* ... */
5477 (iro == iro_Block) ) /* Flags tested local. */
5478 n = equivalent_node(n);
5480 /** common subexpression elimination **/
5481 /* Checks whether n is already available. */
5482 /* The block input is used to distinguish different subexpressions. Right
5483 now all nodes are op_pin_state_pinned to blocks, i.e., the cse only finds common
5484 subexpressions within a block. */
5485 if (get_opt_cse()) {
5486 n = identify(current_ir_graph->value_table, n);
5489 /* Some more constant expression evaluation. */
5490 iro = get_irn_opcode(n);
5491 if (get_opt_constant_folding() ||
5492 (iro == iro_Cond) ||
5493 (iro == iro_Proj)) /* Flags tested local. */
5494 n = transform_node(n);
5496 /* Remove nodes with dead (Bad) input.
5497 Run always for transformation induced Bads. */
5500 /* Now we can verify the node, as it has no dead inputs any more. */
5503 /* Now we have a legal, useful node. Enter it in hash table for cse.
5504 Blocks should be unique anyways. (Except the successor of start:
5505 is cse with the start block!) */
5506 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block))
5507 n = identify_remember(current_ir_graph->value_table, n);
5510 } /* optimize_in_place_2 */
5513 * Wrapper for external use, set proper status bits after optimization.
5515 ir_node *optimize_in_place(ir_node *n) {
5516 /* Handle graph state */
5517 assert(get_irg_phase_state(current_ir_graph) != phase_building);
5519 if (get_opt_global_cse())
5520 set_irg_pinned(current_ir_graph, op_pin_state_floats);
5521 if (get_irg_outs_state(current_ir_graph) == outs_consistent)
5522 set_irg_outs_inconsistent(current_ir_graph);
5524 /* FIXME: Maybe we could also test whether optimizing the node can
5525 change the control graph. */
5526 set_irg_doms_inconsistent(current_ir_graph);
5527 return optimize_in_place_2(n);
5528 } /* optimize_in_place */
5531 * Sets the default operation for an ir_ops.
5533 ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops) {
5534 ops = firm_set_default_computed_value(code, ops);
5535 ops = firm_set_default_equivalent_node(code, ops);
5536 ops = firm_set_default_transform_node(code, ops);
5537 ops = firm_set_default_node_cmp_attr(code, ops);
5538 ops = firm_set_default_get_type(code, ops);
5539 ops = firm_set_default_get_type_attr(code, ops);
5540 ops = firm_set_default_get_entity_attr(code, ops);
5543 } /* firm_set_default_operations */