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 ( (classify_tarval(ta) == TV_CLASSIFY_NULL)
149 || (classify_tarval(tb) == TV_CLASSIFY_NULL))
150 return get_mode_null(m);
153 } /* computed_value_Carry */
156 * Return the value of a Borrow.
159 static tarval *computed_value_Borrow(ir_node *n) {
160 ir_node *a = get_binop_left(n);
161 ir_node *b = get_binop_right(n);
162 ir_mode *m = get_irn_mode(n);
164 tarval *ta = value_of(a);
165 tarval *tb = value_of(b);
167 if ((ta != tarval_bad) && (tb != tarval_bad)) {
168 return tarval_cmp(ta, tb) == pn_Cmp_Lt ? get_mode_one(m) : get_mode_null(m);
169 } else if (classify_tarval(ta) == TV_CLASSIFY_NULL) {
170 return get_mode_null(m);
173 } /* computed_value_Borrow */
176 * Return the value of an unary Minus.
178 static tarval *computed_value_Minus(ir_node *n) {
179 ir_node *a = get_Minus_op(n);
180 tarval *ta = value_of(a);
182 if ((ta != tarval_bad) && mode_is_signed(get_irn_mode(a)))
183 return tarval_neg(ta);
186 } /* computed_value_Minus */
189 * Return the value of a Mul.
191 static tarval *computed_value_Mul(ir_node *n) {
192 ir_node *a = get_Mul_left(n);
193 ir_node *b = get_Mul_right(n);
196 tarval *ta = value_of(a);
197 tarval *tb = value_of(b);
199 mode = get_irn_mode(n);
200 if (mode != get_irn_mode(a)) {
201 /* n * n = 2n bit multiplication */
202 ta = tarval_convert_to(ta, mode);
203 tb = tarval_convert_to(tb, mode);
206 if (ta != tarval_bad && tb != tarval_bad) {
207 return tarval_mul(ta, tb);
209 /* a*0 = 0 or 0*b = 0 */
210 if (ta == get_mode_null(mode))
212 if (tb == get_mode_null(mode))
216 } /* computed_value_Mul */
219 * Return the value of a floating point Quot.
221 static tarval *computed_value_Quot(ir_node *n) {
222 ir_node *a = get_Quot_left(n);
223 ir_node *b = get_Quot_right(n);
225 tarval *ta = value_of(a);
226 tarval *tb = value_of(b);
228 /* This was missing in original implementation. Why? */
229 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
230 if (tb != get_mode_null(get_tarval_mode(tb))) /* div by zero: return tarval_bad */
231 return tarval_quo(ta, tb);
234 } /* computed_value_Quot */
237 * Calculate the value of an integer Div of two nodes.
238 * Special case: 0 / b
240 static tarval *do_computed_value_Div(ir_node *a, ir_node *b) {
241 tarval *ta = value_of(a);
242 tarval *tb = value_of(b);
244 /* Compute c1 / c2 or 0 / a, a != 0 */
245 if (ta != tarval_bad) {
246 if ((tb != tarval_bad) && (tb != get_mode_null(get_irn_mode(b)))) /* div by zero: return tarval_bad */
247 return tarval_div(ta, tb);
248 else if (ta == get_mode_null(get_tarval_mode(ta))) /* 0 / b == 0 */
252 } /* do_computed_value_Div */
255 * Return the value of an integer Div.
257 static tarval *computed_value_Div(ir_node *n) {
258 return do_computed_value_Div(get_Div_left(n), get_Div_right(n));
259 } /* computed_value_Div */
262 * Calculate the value of an integer Mod of two nodes.
263 * Special case: a % 1
265 static tarval *do_computed_value_Mod(ir_node *a, ir_node *b) {
266 tarval *ta = value_of(a);
267 tarval *tb = value_of(b);
269 /* Compute c1 % c2 or a % 1 */
270 if (tb != tarval_bad) {
271 if ((ta != tarval_bad) && (tb != get_mode_null(get_tarval_mode(tb)))) /* div by zero: return tarval_bad */
272 return tarval_mod(ta, tb);
273 else if (tb == get_mode_one(get_tarval_mode(tb))) /* x mod 1 == 0 */
274 return get_mode_null(get_irn_mode(a));
277 } /* do_computed_value_Mod */
280 * Return the value of an integer Mod.
282 static tarval *computed_value_Mod(ir_node *n) {
283 return do_computed_value_Mod(get_Mod_left(n), get_Mod_right(n));
284 } /* computed_value_Mod */
287 * Return the value of an Abs.
289 static tarval *computed_value_Abs(ir_node *n) {
290 ir_node *a = get_Abs_op(n);
291 tarval *ta = value_of(a);
293 if (ta != tarval_bad)
294 return tarval_abs(ta);
297 } /* computed_value_Abs */
300 * Return the value of an And.
301 * Special case: a & 0, 0 & b
303 static tarval *computed_value_And(ir_node *n) {
304 ir_node *a = get_And_left(n);
305 ir_node *b = get_And_right(n);
307 tarval *ta = value_of(a);
308 tarval *tb = value_of(b);
310 if ((ta != tarval_bad) && (tb != tarval_bad)) {
311 return tarval_and (ta, tb);
315 if ( (classify_tarval ((v = ta)) == TV_CLASSIFY_NULL)
316 || (classify_tarval ((v = tb)) == TV_CLASSIFY_NULL)) {
321 } /* computed_value_And */
324 * Return the value of an Or.
325 * Special case: a | 1...1, 1...1 | b
327 static tarval *computed_value_Or(ir_node *n) {
328 ir_node *a = get_Or_left(n);
329 ir_node *b = get_Or_right(n);
331 tarval *ta = value_of(a);
332 tarval *tb = value_of(b);
334 if ((ta != tarval_bad) && (tb != tarval_bad)) {
335 return tarval_or (ta, tb);
338 if ( (classify_tarval ((v = ta)) == TV_CLASSIFY_ALL_ONE)
339 || (classify_tarval ((v = tb)) == TV_CLASSIFY_ALL_ONE)) {
344 } /* computed_value_Or */
347 * Return the value of an Eor.
349 static tarval *computed_value_Eor(ir_node *n) {
350 ir_node *a = get_Eor_left(n);
351 ir_node *b = get_Eor_right(n);
356 return get_mode_null(get_irn_mode(n));
361 if ((ta != tarval_bad) && (tb != tarval_bad)) {
362 return tarval_eor (ta, tb);
365 } /* computed_value_Eor */
368 * Return the value of a Not.
370 static tarval *computed_value_Not(ir_node *n) {
371 ir_node *a = get_Not_op(n);
372 tarval *ta = value_of(a);
374 if (ta != tarval_bad)
375 return tarval_not(ta);
378 } /* computed_value_Not */
381 * Return the value of a Shl.
383 static tarval *computed_value_Shl(ir_node *n) {
384 ir_node *a = get_Shl_left(n);
385 ir_node *b = get_Shl_right(n);
387 tarval *ta = value_of(a);
388 tarval *tb = value_of(b);
390 if ((ta != tarval_bad) && (tb != tarval_bad)) {
391 return tarval_shl (ta, tb);
394 } /* computed_value_Shl */
397 * Return the value of a Shr.
399 static tarval *computed_value_Shr(ir_node *n) {
400 ir_node *a = get_Shr_left(n);
401 ir_node *b = get_Shr_right(n);
403 tarval *ta = value_of(a);
404 tarval *tb = value_of(b);
406 if ((ta != tarval_bad) && (tb != tarval_bad)) {
407 return tarval_shr (ta, tb);
410 } /* computed_value_Shr */
413 * Return the value of a Shrs.
415 static tarval *computed_value_Shrs(ir_node *n) {
416 ir_node *a = get_Shrs_left(n);
417 ir_node *b = get_Shrs_right(n);
419 tarval *ta = value_of(a);
420 tarval *tb = value_of(b);
422 if ((ta != tarval_bad) && (tb != tarval_bad)) {
423 return tarval_shrs (ta, tb);
426 } /* computed_value_Shrs */
429 * Return the value of a Rot.
431 static tarval *computed_value_Rot(ir_node *n) {
432 ir_node *a = get_Rot_left(n);
433 ir_node *b = get_Rot_right(n);
435 tarval *ta = value_of(a);
436 tarval *tb = value_of(b);
438 if ((ta != tarval_bad) && (tb != tarval_bad)) {
439 return tarval_rot (ta, tb);
442 } /* computed_value_Rot */
445 * Return the value of a Conv.
447 static tarval *computed_value_Conv(ir_node *n) {
448 ir_node *a = get_Conv_op(n);
449 tarval *ta = value_of(a);
451 if (ta != tarval_bad)
452 return tarval_convert_to(ta, get_irn_mode(n));
455 } /* computed_value_Conv */
458 * Return the value of a Proj(Cmp).
460 * This performs a first step of unreachable code elimination.
461 * Proj can not be computed, but folding a Cmp above the Proj here is
462 * not as wasteful as folding a Cmp into a Tuple of 16 Consts of which
464 * There are several case where we can evaluate a Cmp node, see later.
466 static tarval *computed_value_Proj_Cmp(ir_node *n) {
467 ir_node *a = get_Proj_pred(n);
468 ir_node *aa = get_Cmp_left(a);
469 ir_node *ab = get_Cmp_right(a);
470 long proj_nr = get_Proj_proj(n);
473 * BEWARE: a == a is NOT always True for floating Point values, as
474 * NaN != NaN is defined, so we must check this here.
477 !mode_is_float(get_irn_mode(aa)) || proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Gt)
480 /* This is a trick with the bits used for encoding the Cmp
481 Proj numbers, the following statement is not the same:
482 return new_tarval_from_long (proj_nr == pn_Cmp_Eq, mode_b) */
483 return new_tarval_from_long (proj_nr & pn_Cmp_Eq, mode_b);
486 tarval *taa = value_of(aa);
487 tarval *tab = value_of(ab);
488 ir_mode *mode = get_irn_mode(aa);
491 * The predecessors of Cmp are target values. We can evaluate
494 if ((taa != tarval_bad) && (tab != tarval_bad)) {
495 /* strange checks... */
496 pn_Cmp flags = tarval_cmp(taa, tab);
497 if (flags != pn_Cmp_False) {
498 return new_tarval_from_long (proj_nr & flags, mode_b);
501 /* for integer values, we can check against MIN/MAX */
502 else if (mode_is_int(mode)) {
503 /* MIN <=/> x. This results in true/false. */
504 if (taa == get_mode_min(mode)) {
505 /* a compare with the MIN value */
506 if (proj_nr == pn_Cmp_Le)
507 return get_tarval_b_true();
508 else if (proj_nr == pn_Cmp_Gt)
509 return get_tarval_b_false();
511 /* x >=/< MIN. This results in true/false. */
513 if (tab == get_mode_min(mode)) {
514 /* a compare with the MIN value */
515 if (proj_nr == pn_Cmp_Ge)
516 return get_tarval_b_true();
517 else if (proj_nr == pn_Cmp_Lt)
518 return get_tarval_b_false();
520 /* MAX >=/< x. This results in true/false. */
521 else if (taa == get_mode_max(mode)) {
522 if (proj_nr == pn_Cmp_Ge)
523 return get_tarval_b_true();
524 else if (proj_nr == pn_Cmp_Lt)
525 return get_tarval_b_false();
527 /* x <=/> MAX. This results in true/false. */
528 else if (tab == get_mode_max(mode)) {
529 if (proj_nr == pn_Cmp_Le)
530 return get_tarval_b_true();
531 else if (proj_nr == pn_Cmp_Gt)
532 return get_tarval_b_false();
536 * The predecessors are Allocs or (void*)(0) constants. Allocs never
537 * return NULL, they raise an exception. Therefore we can predict
541 ir_node *aaa = skip_Id(skip_Proj(aa));
542 ir_node *aba = skip_Id(skip_Proj(ab));
544 if ( ( (/* aa is ProjP and aaa is Alloc */
545 (get_irn_op(aa) == op_Proj)
546 && (mode_is_reference(get_irn_mode(aa)))
547 && (get_irn_op(aaa) == op_Alloc))
548 && ( (/* ab is NULL */
549 (get_irn_op(ab) == op_Const)
550 && (mode_is_reference(get_irn_mode(ab)))
551 && (get_Const_tarval(ab) == get_mode_null(get_irn_mode(ab))))
552 || (/* ab is other Alloc */
553 (get_irn_op(ab) == op_Proj)
554 && (mode_is_reference(get_irn_mode(ab)))
555 && (get_irn_op(aba) == op_Alloc)
557 || (/* aa is NULL and aba is Alloc */
558 (get_irn_op(aa) == op_Const)
559 && (mode_is_reference(get_irn_mode(aa)))
560 && (get_Const_tarval(aa) == get_mode_null(get_irn_mode(aa)))
561 && (get_irn_op(ab) == op_Proj)
562 && (mode_is_reference(get_irn_mode(ab)))
563 && (get_irn_op(aba) == op_Alloc)))
565 return new_tarval_from_long(proj_nr & pn_Cmp_Ne, mode_b);
568 return computed_value_Cmp_Confirm(a, aa, ab, proj_nr);
569 } /* computed_value_Proj_Cmp */
572 * Return the value of a Proj, handle Proj(Cmp), Proj(Div), Proj(Mod),
573 * Proj(DivMod) and Proj(Quot).
575 static tarval *computed_value_Proj(ir_node *n) {
576 ir_node *a = get_Proj_pred(n);
579 switch (get_irn_opcode(a)) {
581 return computed_value_Proj_Cmp(n);
584 /* compute either the Div or the Mod part */
585 proj_nr = get_Proj_proj(n);
586 if (proj_nr == pn_DivMod_res_div)
587 return do_computed_value_Div(get_DivMod_left(a), get_DivMod_right(a));
588 else if (proj_nr == pn_DivMod_res_mod)
589 return do_computed_value_Mod(get_DivMod_left(a), get_DivMod_right(a));
593 if (get_Proj_proj(n) == pn_Div_res)
594 return computed_value(a);
598 if (get_Proj_proj(n) == pn_Mod_res)
599 return computed_value(a);
603 if (get_Proj_proj(n) == pn_Quot_res)
604 return computed_value(a);
611 } /* computed_value_Proj */
614 * Calculate the value of a Mux: can be evaluated, if the
615 * sel and the right input are known.
617 static tarval *computed_value_Mux(ir_node *n) {
618 ir_node *sel = get_Mux_sel(n);
619 tarval *ts = value_of(sel);
621 if (ts == get_tarval_b_true()) {
622 ir_node *v = get_Mux_true(n);
625 else if (ts == get_tarval_b_false()) {
626 ir_node *v = get_Mux_false(n);
630 } /* computed_value_Mux */
633 * Calculate the value of a Psi: can be evaluated, if a condition is true
634 * and all previous conditions are false. If all conditions are false
635 * we evaluate to the default one.
637 static tarval *computed_value_Psi(ir_node *n) {
639 return computed_value_Mux(n);
641 } /* computed_value_Psi */
644 * Calculate the value of a Confirm: can be evaluated,
645 * if it has the form Confirm(x, '=', Const).
647 static tarval *computed_value_Confirm(ir_node *n) {
648 return get_Confirm_cmp(n) == pn_Cmp_Eq ?
649 value_of(get_Confirm_bound(n)) : tarval_bad;
650 } /* computed_value_Confirm */
653 * If the parameter n can be computed, return its value, else tarval_bad.
654 * Performs constant folding.
656 * @param n The node this should be evaluated
658 tarval *computed_value(ir_node *n) {
659 if (n->op->ops.computed_value)
660 return n->op->ops.computed_value(n);
662 } /* computed_value */
665 * Set the default computed_value evaluator in an ir_op_ops.
667 * @param code the opcode for the default operation
668 * @param ops the operations initialized
673 static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops)
677 ops->computed_value = computed_value_##a; \
712 } /* firm_set_default_computed_value */
715 * Returns a equivalent block for another block.
716 * If the block has only one predecessor, this is
717 * the equivalent one. If the only predecessor of a block is
718 * the block itself, this is a dead block.
720 * If both predecessors of a block are the branches of a binary
721 * Cond, the equivalent block is Cond's block.
723 * If all predecessors of a block are bad or lies in a dead
724 * block, the current block is dead as well.
726 * Note, that blocks are NEVER turned into Bad's, instead
727 * the dead_block flag is set. So, never test for is_Bad(block),
728 * always use is_dead_Block(block).
730 static ir_node *equivalent_node_Block(ir_node *n)
733 int n_preds = get_Block_n_cfgpreds(n);
735 /* The Block constructor does not call optimize, but mature_immBlock
736 calls the optimization. */
737 assert(get_Block_matured(n));
739 /* Straightening: a single entry Block following a single exit Block
740 can be merged, if it is not the Start block. */
741 /* !!! Beware, all Phi-nodes of n must have been optimized away.
742 This should be true, as the block is matured before optimize is called.
743 But what about Phi-cycles with the Phi0/Id that could not be resolved?
744 Remaining Phi nodes are just Ids. */
745 if ((n_preds == 1) && (get_irn_op(get_Block_cfgpred(n, 0)) == op_Jmp)) {
746 ir_node *predblock = get_nodes_block(get_Block_cfgpred(n, 0));
747 if (predblock == oldn) {
748 /* Jmp jumps into the block it is in -- deal self cycle. */
749 n = set_Block_dead(n);
750 DBG_OPT_DEAD_BLOCK(oldn, n);
751 } else if (get_opt_control_flow_straightening()) {
753 DBG_OPT_STG(oldn, n);
755 } else if ((n_preds == 1) &&
756 (get_irn_op(skip_Proj(get_Block_cfgpred(n, 0))) == op_Cond)) {
757 ir_node *predblock = get_Block_cfgpred_block(n, 0);
758 if (predblock == oldn) {
759 /* Jmp jumps into the block it is in -- deal self cycle. */
760 n = set_Block_dead(n);
761 DBG_OPT_DEAD_BLOCK(oldn, n);
763 } else if ((n_preds == 2) &&
764 (get_opt_control_flow_weak_simplification())) {
765 /* Test whether Cond jumps twice to this block
766 * The more general case which more than 2 predecessors is handles
767 * in optimize_cf(), we handle only this special case for speed here.
769 ir_node *a = get_Block_cfgpred(n, 0);
770 ir_node *b = get_Block_cfgpred(n, 1);
772 if ((get_irn_op(a) == op_Proj) &&
773 (get_irn_op(b) == op_Proj) &&
774 (get_Proj_pred(a) == get_Proj_pred(b)) &&
775 (get_irn_op(get_Proj_pred(a)) == op_Cond) &&
776 (get_irn_mode(get_Cond_selector(get_Proj_pred(a))) == mode_b)) {
777 /* Also a single entry Block following a single exit Block. Phis have
778 twice the same operand and will be optimized away. */
779 n = get_nodes_block(get_Proj_pred(a));
780 DBG_OPT_IFSIM1(oldn, a, b, n);
782 } else if (get_opt_unreachable_code() &&
783 (n != get_irg_start_block(current_ir_graph)) &&
784 (n != get_irg_end_block(current_ir_graph)) ) {
787 /* If all inputs are dead, this block is dead too, except if it is
788 the start or end block. This is one step of unreachable code
790 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
791 ir_node *pred = get_Block_cfgpred(n, i);
794 if (is_Bad(pred)) continue;
795 pred_blk = get_nodes_block(skip_Proj(pred));
797 if (is_Block_dead(pred_blk)) continue;
800 /* really found a living input */
805 n = set_Block_dead(n);
806 DBG_OPT_DEAD_BLOCK(oldn, n);
811 } /* equivalent_node_Block */
814 * Returns a equivalent node for a Jmp, a Bad :-)
815 * Of course this only happens if the Block of the Jmp is dead.
817 static ir_node *equivalent_node_Jmp(ir_node *n) {
818 /* unreachable code elimination */
819 if (is_Block_dead(get_nodes_block(n)))
823 } /* equivalent_node_Jmp */
825 /** Raise is handled in the same way as Jmp. */
826 #define equivalent_node_Raise equivalent_node_Jmp
829 /* We do not evaluate Cond here as we replace it by a new node, a Jmp.
830 See transform_node_Proj_Cond(). */
833 * Optimize operations that are commutative and have neutral 0,
834 * so a op 0 = 0 op a = a.
836 static ir_node *equivalent_node_neutral_zero(ir_node *n)
840 ir_node *a = get_binop_left(n);
841 ir_node *b = get_binop_right(n);
846 /* After running compute_node there is only one constant predecessor.
847 Find this predecessors value and remember the other node: */
848 if ((tv = value_of(a)) != tarval_bad) {
850 } else if ((tv = value_of(b)) != tarval_bad) {
855 /* If this predecessors constant value is zero, the operation is
856 * unnecessary. Remove it.
858 * Beware: If n is a Add, the mode of on and n might be different
859 * which happens in this rare construction: NULL + 3.
860 * Then, a Conv would be needed which we cannot include here.
862 if (classify_tarval (tv) == TV_CLASSIFY_NULL) {
863 if (get_irn_mode(on) == get_irn_mode(n)) {
866 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
871 } /* equivalent_node_neutral_zero */
874 * Eor is commutative and has neutral 0.
876 #define equivalent_node_Eor equivalent_node_neutral_zero
879 * Optimize a - 0 and (a - x) + x (for modes with wrap-around).
881 * The second one looks strange, but this construct
882 * is used heavily in the LCC sources :-).
884 * Beware: The Mode of an Add may be different than the mode of its
885 * predecessors, so we could not return a predecessors in all cases.
887 static ir_node *equivalent_node_Add(ir_node *n) {
889 ir_node *left, *right;
890 ir_mode *mode = get_irn_mode(n);
892 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
893 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
896 n = equivalent_node_neutral_zero(n);
900 left = get_Add_left(n);
901 right = get_Add_right(n);
903 if (get_irn_op(left) == op_Sub) {
904 if (get_Sub_right(left) == right) {
907 n = get_Sub_left(left);
908 if (mode == get_irn_mode(n)) {
909 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
914 if (get_irn_op(right) == op_Sub) {
915 if (get_Sub_right(right) == left) {
918 n = get_Sub_left(right);
919 if (mode == get_irn_mode(n)) {
920 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
926 } /* equivalent_node_Add */
929 * optimize operations that are not commutative but have neutral 0 on left,
932 static ir_node *equivalent_node_left_zero(ir_node *n) {
935 ir_node *a = get_binop_left(n);
936 ir_node *b = get_binop_right(n);
938 if (classify_tarval(value_of(b)) == TV_CLASSIFY_NULL) {
941 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
944 } /* equivalent_node_left_zero */
946 #define equivalent_node_Shl equivalent_node_left_zero
947 #define equivalent_node_Shr equivalent_node_left_zero
948 #define equivalent_node_Shrs equivalent_node_left_zero
949 #define equivalent_node_Rot equivalent_node_left_zero
952 * Optimize a - 0 and (a + x) - x (for modes with wrap-around).
954 * The second one looks strange, but this construct
955 * is used heavily in the LCC sources :-).
957 * Beware: The Mode of a Sub may be different than the mode of its
958 * predecessors, so we could not return a predecessors in all cases.
960 static ir_node *equivalent_node_Sub(ir_node *n) {
963 ir_mode *mode = get_irn_mode(n);
965 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
966 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
969 b = get_Sub_right(n);
971 /* Beware: modes might be different */
972 if (classify_tarval(value_of(b)) == TV_CLASSIFY_NULL) {
973 ir_node *a = get_Sub_left(n);
974 if (mode == get_irn_mode(a)) {
977 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
981 } /* equivalent_node_Sub */
985 * Optimize an "idempotent unary op", ie op(op(n)) = n.
988 * -(-a) == a, but might overflow two times.
989 * We handle it anyway here but the better way would be a
990 * flag. This would be needed for Pascal for instance.
992 static ir_node *equivalent_node_idempotent_unop(ir_node *n) {
994 ir_node *pred = get_unop_op(n);
996 /* optimize symmetric unop */
997 if (get_irn_op(pred) == get_irn_op(n)) {
998 n = get_unop_op(pred);
999 DBG_OPT_ALGSIM2(oldn, pred, n, FS_OPT_IDEM_UNARY);
1002 } /* equivalent_node_idempotent_unop */
1004 /** Optimize Not(Not(x)) == x. */
1005 #define equivalent_node_Not equivalent_node_idempotent_unop
1007 /** -(-x) == x ??? Is this possible or can --x raise an
1008 out of bounds exception if min =! max? */
1009 #define equivalent_node_Minus equivalent_node_idempotent_unop
1012 * Optimize a * 1 = 1 * a = a.
1014 static ir_node *equivalent_node_Mul(ir_node *n) {
1016 ir_node *a = get_Mul_left(n);
1018 /* we can handle here only the n * n = n bit cases */
1019 if (get_irn_mode(n) == get_irn_mode(a)) {
1020 ir_node *b = get_Mul_right(n);
1022 /* Mul is commutative and has again an other neutral element. */
1023 if (classify_tarval(value_of(a)) == TV_CLASSIFY_ONE) {
1025 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1026 } else if (classify_tarval(value_of(b)) == TV_CLASSIFY_ONE) {
1028 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1032 } /* equivalent_node_Mul */
1035 * Optimize a / 1 = a.
1037 static ir_node *equivalent_node_Div(ir_node *n) {
1038 ir_node *a = get_Div_left(n);
1039 ir_node *b = get_Div_right(n);
1041 /* Div is not commutative. */
1042 if (classify_tarval(value_of(b)) == TV_CLASSIFY_ONE) { /* div(x, 1) == x */
1043 /* Turn Div into a tuple (mem, bad, a) */
1044 ir_node *mem = get_Div_mem(n);
1045 ir_node *blk = get_irn_n(n, -1);
1046 turn_into_tuple(n, pn_Div_max);
1047 set_Tuple_pred(n, pn_Div_M, mem);
1048 set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(current_ir_graph, blk));
1049 set_Tuple_pred(n, pn_Div_X_except, new_Bad()); /* no exception */
1050 set_Tuple_pred(n, pn_Div_res, a);
1053 } /* equivalent_node_Div */
1056 * Optimize a / 1.0 = a.
1058 static ir_node *equivalent_node_Quot(ir_node *n) {
1059 ir_node *a = get_Quot_left(n);
1060 ir_node *b = get_Quot_right(n);
1062 /* Div is not commutative. */
1063 if (classify_tarval(value_of(b)) == TV_CLASSIFY_ONE) { /* Quot(x, 1) == x */
1064 /* Turn Quot into a tuple (mem, jmp, bad, a) */
1065 ir_node *mem = get_Quot_mem(n);
1066 ir_node *blk = get_irn_n(n, -1);
1067 turn_into_tuple(n, pn_Quot_max);
1068 set_Tuple_pred(n, pn_Quot_M, mem);
1069 set_Tuple_pred(n, pn_Quot_X_regular, new_r_Jmp(current_ir_graph, blk));
1070 set_Tuple_pred(n, pn_Quot_X_except, new_Bad()); /* no exception */
1071 set_Tuple_pred(n, pn_Quot_res, a);
1074 } /* equivalent_node_Quot */
1077 * Optimize a / 1 = a.
1079 static ir_node *equivalent_node_DivMod(ir_node *n) {
1080 ir_node *b = get_DivMod_right(n);
1082 /* Div is not commutative. */
1083 if (classify_tarval(value_of(b)) == TV_CLASSIFY_ONE) { /* div(x, 1) == x */
1084 /* Turn DivMod into a tuple (mem, jmp, bad, a, 0) */
1085 ir_node *a = get_DivMod_left(n);
1086 ir_node *mem = get_Div_mem(n);
1087 ir_node *blk = get_irn_n(n, -1);
1088 ir_mode *mode = get_DivMod_resmode(n);
1090 turn_into_tuple(n, pn_DivMod_max);
1091 set_Tuple_pred(n, pn_DivMod_M, mem);
1092 set_Tuple_pred(n, pn_DivMod_X_regular, new_r_Jmp(current_ir_graph, blk));
1093 set_Tuple_pred(n, pn_DivMod_X_except, new_Bad()); /* no exception */
1094 set_Tuple_pred(n, pn_DivMod_res_div, a);
1095 set_Tuple_pred(n, pn_DivMod_res_mod, new_Const(mode, get_mode_null(mode)));
1098 } /* equivalent_node_DivMod */
1101 * Use algebraic simplification a | a = a | 0 = 0 | a = a.
1103 static ir_node *equivalent_node_Or(ir_node *n) {
1106 ir_node *a = get_Or_left(n);
1107 ir_node *b = get_Or_right(n);
1110 n = a; /* Or has it's own neutral element */
1111 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_OR);
1112 } else if (classify_tarval(value_of(a)) == TV_CLASSIFY_NULL) {
1114 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1115 } else if (classify_tarval(value_of(b)) == TV_CLASSIFY_NULL) {
1117 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1121 } /* equivalent_node_Or */
1124 * Optimize a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a.
1126 static ir_node *equivalent_node_And(ir_node *n) {
1129 ir_node *a = get_And_left(n);
1130 ir_node *b = get_And_right(n);
1133 n = a; /* And has it's own neutral element */
1134 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_AND);
1137 if (classify_tarval(value_of(a)) == TV_CLASSIFY_ALL_ONE) {
1139 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1142 if (classify_tarval(value_of(b)) == TV_CLASSIFY_ALL_ONE) {
1144 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1148 if (b == get_Or_left(a) || b == get_Or_right(a)) {
1151 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1156 if (a == get_Or_left(b) || a == get_Or_right(b)) {
1159 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1165 } /* equivalent_node_And */
1168 * Try to remove useless Conv's:
1170 static ir_node *equivalent_node_Conv(ir_node *n) {
1172 ir_node *a = get_Conv_op(n);
1175 ir_mode *n_mode = get_irn_mode(n);
1176 ir_mode *a_mode = get_irn_mode(a);
1178 if (n_mode == a_mode) { /* No Conv necessary */
1179 if (get_Conv_strict(n)) {
1180 /* special case: the predecessor might be a also a Conv */
1182 if (! get_Conv_strict(a)) {
1183 /* first one is not strict, kick it */
1184 set_Conv_op(n, get_Conv_op(a));
1187 /* else both are strict conv, second is superflous */
1189 /* leave strict floating point Conv's */
1194 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1195 } else if (get_irn_op(a) == op_Conv) { /* Conv(Conv(b)) */
1199 n_mode = get_irn_mode(n);
1200 b_mode = get_irn_mode(b);
1202 if (n_mode == b_mode) {
1203 if (n_mode == mode_b) {
1204 n = b; /* Convb(Conv*(xxxb(...))) == xxxb(...) */
1205 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1206 } else if (mode_is_int(n_mode)) {
1207 if (smaller_mode(b_mode, a_mode)){
1208 n = b; /* ConvS(ConvL(xxxS(...))) == xxxS(...) */
1209 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1215 } /* equivalent_node_Conv */
1218 * A Cast may be removed if the type of the previous node
1219 * is already the type of the Cast.
1221 static ir_node *equivalent_node_Cast(ir_node *n) {
1223 ir_node *pred = get_Cast_op(n);
1225 if (get_irn_type(pred) == get_Cast_type(n)) {
1227 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CAST);
1230 } /* equivalent_node_Cast */
1233 * Several optimizations:
1234 * - no Phi in start block.
1235 * - remove Id operators that are inputs to Phi
1236 * - fold Phi-nodes, iff they have only one predecessor except
1239 static ir_node *equivalent_node_Phi(ir_node *n) {
1243 ir_node *block = NULL; /* to shutup gcc */
1244 ir_node *first_val = NULL; /* to shutup gcc */
1246 if (!get_opt_normalize()) return n;
1248 n_preds = get_Phi_n_preds(n);
1250 block = get_nodes_block(n);
1251 /* @@@ fliegt 'raus, sollte aber doch immer wahr sein!!!
1252 assert(get_irn_arity(block) == n_preds && "phi in wrong block!"); */
1253 if ((is_Block_dead(block)) || /* Control dead */
1254 (block == get_irg_start_block(current_ir_graph))) /* There should be no Phi nodes */
1255 return new_Bad(); /* in the Start Block. */
1257 if (n_preds == 0) return n; /* Phi of dead Region without predecessors. */
1259 /* If the Block has a Bad pred, we also have one. */
1260 for (i = 0; i < n_preds; ++i)
1261 if (is_Bad(get_Block_cfgpred(block, i)))
1262 set_Phi_pred(n, i, new_Bad());
1264 /* Find first non-self-referencing input */
1265 for (i = 0; i < n_preds; ++i) {
1266 first_val = get_Phi_pred(n, i);
1267 if ( (first_val != n) /* not self pointer */
1269 && (! is_Bad(first_val))
1271 ) { /* value not dead */
1272 break; /* then found first value. */
1277 /* A totally Bad or self-referencing Phi (we didn't break the above loop) */
1281 /* search for rest of inputs, determine if any of these
1282 are non-self-referencing */
1283 while (++i < n_preds) {
1284 ir_node *scnd_val = get_Phi_pred(n, i);
1285 if ( (scnd_val != n)
1286 && (scnd_val != first_val)
1288 && (! is_Bad(scnd_val))
1296 /* Fold, if no multiple distinct non-self-referencing inputs */
1298 DBG_OPT_PHI(oldn, n);
1301 } /* equivalent_node_Phi */
1304 * Several optimizations:
1305 * - no Sync in start block.
1306 * - fold Sync-nodes, iff they have only one predecessor except
1309 static ir_node *equivalent_node_Sync(ir_node *n) {
1313 ir_node *first_val = NULL; /* to shutup gcc */
1315 if (!get_opt_normalize()) return n;
1317 n_preds = get_Sync_n_preds(n);
1319 /* Find first non-self-referencing input */
1320 for (i = 0; i < n_preds; ++i) {
1321 first_val = get_Sync_pred(n, i);
1322 if ((first_val != n) /* not self pointer */ &&
1323 (! is_Bad(first_val))
1324 ) { /* value not dead */
1325 break; /* then found first value. */
1330 /* A totally Bad or self-referencing Sync (we didn't break the above loop) */
1333 /* search the rest of inputs, determine if any of these
1334 are non-self-referencing */
1335 while (++i < n_preds) {
1336 ir_node *scnd_val = get_Sync_pred(n, i);
1337 if ((scnd_val != n) &&
1338 (scnd_val != first_val) &&
1339 (! is_Bad(scnd_val))
1345 /* Fold, if no multiple distinct non-self-referencing inputs */
1347 DBG_OPT_SYNC(oldn, n);
1350 } /* equivalent_node_Sync */
1353 * Optimize Proj(Tuple) and gigo() for ProjX in Bad block,
1354 * ProjX(Load) and ProjX(Store).
1356 static ir_node *equivalent_node_Proj(ir_node *proj) {
1357 ir_node *oldn = proj;
1358 ir_node *a = get_Proj_pred(proj);
1360 if (get_irn_op(a) == op_Tuple) {
1361 /* Remove the Tuple/Proj combination. */
1362 if ( get_Proj_proj(proj) <= get_Tuple_n_preds(a) ) {
1363 proj = get_Tuple_pred(a, get_Proj_proj(proj));
1364 DBG_OPT_TUPLE(oldn, a, proj);
1366 /* This should not happen! */
1367 assert(! "found a Proj with higher number than Tuple predecessors");
1370 } else if (get_irn_mode(proj) == mode_X) {
1371 if (is_Block_dead(get_nodes_block(skip_Proj(proj)))) {
1372 /* Remove dead control flow -- early gigo(). */
1374 } else if (get_opt_ldst_only_null_ptr_exceptions()) {
1375 ir_op *op = get_irn_op(a);
1377 if (op == op_Load) {
1378 /* get the Load address */
1379 ir_node *addr = get_Load_ptr(a);
1380 ir_node *blk = get_irn_n(a, -1);
1383 if (value_not_null(addr, &confirm)) {
1384 if (confirm == NULL) {
1385 /* this node may float if it did not depend on a Confirm */
1386 set_irn_pinned(a, op_pin_state_floats);
1388 if (get_Proj_proj(proj) == pn_Load_X_except) {
1389 DBG_OPT_EXC_REM(proj);
1392 return new_r_Jmp(current_ir_graph, blk);
1394 } else if (op == op_Store) {
1395 /* get the load/store address */
1396 ir_node *addr = get_Store_ptr(a);
1397 ir_node *blk = get_irn_n(a, -1);
1400 if (value_not_null(addr, &confirm)) {
1401 if (confirm == NULL) {
1402 /* this node may float if it did not depend on a Confirm */
1403 set_irn_pinned(a, op_pin_state_floats);
1405 if (get_Proj_proj(proj) == pn_Store_X_except) {
1406 DBG_OPT_EXC_REM(proj);
1409 return new_r_Jmp(current_ir_graph, blk);
1416 } /* equivalent_node_Proj */
1421 static ir_node *equivalent_node_Id(ir_node *n) {
1426 } while (get_irn_op(n) == op_Id);
1428 DBG_OPT_ID(oldn, n);
1430 } /* equivalent_node_Id */
1435 static ir_node *equivalent_node_Mux(ir_node *n)
1437 ir_node *oldn = n, *sel = get_Mux_sel(n);
1438 tarval *ts = value_of(sel);
1440 /* Mux(true, f, t) == t */
1441 if (ts == tarval_b_true) {
1442 n = get_Mux_true(n);
1443 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1445 /* Mux(false, f, t) == f */
1446 else if (ts == tarval_b_false) {
1447 n = get_Mux_false(n);
1448 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1450 /* Mux(v, x, x) == x */
1451 else if (get_Mux_false(n) == get_Mux_true(n)) {
1452 n = get_Mux_true(n);
1453 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1455 else if (get_irn_op(sel) == op_Proj && !mode_honor_signed_zeros(get_irn_mode(n))) {
1456 ir_node *cmp = get_Proj_pred(sel);
1457 long proj_nr = get_Proj_proj(sel);
1458 ir_node *b = get_Mux_false(n);
1459 ir_node *a = get_Mux_true(n);
1462 * Note: normalization puts the constant on the right site,
1463 * so we check only one case.
1465 * Note further that these optimization work even for floating point
1466 * with NaN's because -NaN == NaN.
1467 * However, if +0 and -0 is handled differently, we cannot use the first one.
1469 if (get_irn_op(cmp) == op_Cmp && get_Cmp_left(cmp) == a) {
1470 if (classify_Const(get_Cmp_right(cmp)) == CNST_NULL) {
1471 /* Mux(a CMP 0, X, a) */
1472 if (get_irn_op(b) == op_Minus && get_Minus_op(b) == a) {
1473 /* Mux(a CMP 0, -a, a) */
1474 if (proj_nr == pn_Cmp_Eq) {
1475 /* Mux(a == 0, -a, a) ==> -a */
1477 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1478 } else if (proj_nr == pn_Cmp_Lg || proj_nr == pn_Cmp_Ne) {
1479 /* Mux(a != 0, -a, a) ==> a */
1481 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1483 } else if (classify_Const(b) == CNST_NULL) {
1484 /* Mux(a CMP 0, 0, a) */
1485 if (proj_nr == pn_Cmp_Lg || proj_nr == pn_Cmp_Ne) {
1486 /* Mux(a != 0, 0, a) ==> a */
1488 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1489 } else if (proj_nr == pn_Cmp_Eq) {
1490 /* Mux(a == 0, 0, a) ==> 0 */
1492 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1499 } /* equivalent_node_Mux */
1502 * Returns a equivalent node of a Psi: if a condition is true
1503 * and all previous conditions are false we know its value.
1504 * If all conditions are false its value is the default one.
1506 static ir_node *equivalent_node_Psi(ir_node *n) {
1508 return equivalent_node_Mux(n);
1510 } /* equivalent_node_Psi */
1513 * Optimize -a CMP -b into b CMP a.
1514 * This works only for for modes where unary Minus
1516 * Note that two-complement integers can Overflow
1517 * so it will NOT work.
1519 * For == and != can be handled in Proj(Cmp)
1521 static ir_node *equivalent_node_Cmp(ir_node *n) {
1522 ir_node *left = get_Cmp_left(n);
1523 ir_node *right = get_Cmp_right(n);
1525 if (get_irn_op(left) == op_Minus && get_irn_op(right) == op_Minus &&
1526 !mode_overflow_on_unary_Minus(get_irn_mode(left))) {
1527 left = get_Minus_op(left);
1528 right = get_Minus_op(right);
1529 set_Cmp_left(n, right);
1530 set_Cmp_right(n, left);
1533 } /* equivalent_node_Cmp */
1536 * Remove Confirm nodes if setting is on.
1537 * Replace Confirms(x, '=', Constlike) by Constlike.
1539 static ir_node *equivalent_node_Confirm(ir_node *n) {
1540 ir_node *pred = get_Confirm_value(n);
1541 pn_Cmp pnc = get_Confirm_cmp(n);
1543 if (get_irn_op(pred) == op_Confirm && pnc == get_Confirm_cmp(pred)) {
1545 * rare case: two identical Confirms one after another,
1546 * replace the second one with the first.
1550 if (pnc == pn_Cmp_Eq) {
1551 ir_node *bound = get_Confirm_bound(n);
1554 * Optimize a rare case:
1555 * Confirm(x, '=', Constlike) ==> Constlike
1557 if (is_irn_constlike(bound)) {
1558 DBG_OPT_CONFIRM(n, bound);
1562 return get_opt_remove_confirm() ? get_Confirm_value(n) : n;
1566 * Optimize CopyB(mem, x, x) into a Nop.
1568 static ir_node *equivalent_node_CopyB(ir_node *n) {
1569 ir_node *a = get_CopyB_dst(n);
1570 ir_node *b = get_CopyB_src(n);
1573 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
1574 ir_node *mem = get_CopyB_mem(n);
1575 ir_node *blk = get_nodes_block(n);
1576 turn_into_tuple(n, pn_CopyB_max);
1577 set_Tuple_pred(n, pn_CopyB_M, mem);
1578 set_Tuple_pred(n, pn_CopyB_X_regular, new_r_Jmp(current_ir_graph, blk));
1579 set_Tuple_pred(n, pn_CopyB_X_except, new_Bad()); /* no exception */
1580 set_Tuple_pred(n, pn_CopyB_M_except, new_Bad());
1583 } /* equivalent_node_CopyB */
1586 * Optimize Bounds(idx, idx, upper) into idx.
1588 static ir_node *equivalent_node_Bound(ir_node *n) {
1589 ir_node *idx = get_Bound_index(n);
1590 ir_node *lower = get_Bound_lower(n);
1593 /* By definition lower < upper, so if idx == lower -->
1594 lower <= idx && idx < upper */
1596 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
1599 ir_node *pred = skip_Proj(idx);
1601 if (get_irn_op(pred) == op_Bound) {
1603 * idx was Bounds_check previously, it is still valid if
1604 * lower <= pred_lower && pred_upper <= upper.
1606 ir_node *upper = get_Bound_upper(n);
1607 if (get_Bound_lower(pred) == lower &&
1608 get_Bound_upper(pred) == upper) {
1610 * One could expect that we simply return the previous
1611 * Bound here. However, this would be wrong, as we could
1612 * add an exception Proj to a new location then.
1613 * So, we must turn in into a tuple.
1620 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
1621 ir_node *mem = get_Bound_mem(n);
1622 ir_node *blk = get_nodes_block(n);
1623 turn_into_tuple(n, pn_Bound_max);
1624 set_Tuple_pred(n, pn_Bound_M, mem);
1625 set_Tuple_pred(n, pn_Bound_X_regular, new_r_Jmp(current_ir_graph, blk)); /* no exception */
1626 set_Tuple_pred(n, pn_Bound_X_except, new_Bad()); /* no exception */
1627 set_Tuple_pred(n, pn_Bound_res, idx);
1630 } /* equivalent_node_Bound */
1633 * equivalent_node() returns a node equivalent to input n. It skips all nodes that
1634 * perform no actual computation, as, e.g., the Id nodes. It does not create
1635 * new nodes. It is therefore safe to free n if the node returned is not n.
1636 * If a node returns a Tuple we can not just skip it. If the size of the
1637 * in array fits, we transform n into a tuple (e.g., Div).
1639 ir_node *equivalent_node(ir_node *n) {
1640 if (n->op->ops.equivalent_node)
1641 return n->op->ops.equivalent_node(n);
1643 } /* equivalent_node */
1646 * Sets the default equivalent node operation for an ir_op_ops.
1648 * @param code the opcode for the default operation
1649 * @param ops the operations initialized
1654 static ir_op_ops *firm_set_default_equivalent_node(ir_opcode code, ir_op_ops *ops)
1658 ops->equivalent_node = equivalent_node_##a; \
1698 } /* firm_set_default_equivalent_node */
1701 * Returns non-zero if a node is a Phi node
1702 * with all predecessors constant.
1704 static int is_const_Phi(ir_node *n) {
1709 for (i = get_irn_arity(n) - 1; i >= 0; --i)
1710 if (! is_Const(get_irn_n(n, i)))
1713 } /* is_const_Phi */
1716 * Apply an evaluator on a binop with a constant operators (and one Phi).
1718 * @param phi the Phi node
1719 * @param other the other operand
1720 * @param eval an evaluator function
1721 * @param left if non-zero, other is the left operand, else the right
1723 * @return a new Phi node if the conversion was successful, NULL else
1725 static ir_node *apply_binop_on_phi(ir_node *phi, tarval *other, tarval *(*eval)(tarval *, tarval *), int left) {
1731 int i, n = get_irn_arity(phi);
1733 NEW_ARR_A(void *, res, n);
1735 for (i = 0; i < n; ++i) {
1736 pred = get_irn_n(phi, i);
1737 tv = get_Const_tarval(pred);
1738 tv = eval(other, tv);
1740 if (tv == tarval_bad) {
1741 /* folding failed, bad */
1747 for (i = 0; i < n; ++i) {
1748 pred = get_irn_n(phi, i);
1749 tv = get_Const_tarval(pred);
1750 tv = eval(tv, other);
1752 if (tv == tarval_bad) {
1753 /* folding failed, bad */
1759 mode = get_irn_mode(phi);
1760 irg = current_ir_graph;
1761 for (i = 0; i < n; ++i) {
1762 pred = get_irn_n(phi, i);
1763 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
1764 mode, res[i], get_Const_type(pred));
1766 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
1767 } /* apply_binop_on_phi */
1770 * Apply an evaluator on a unop with a constant operator (a Phi).
1772 * @param phi the Phi node
1773 * @param eval an evaluator function
1775 * @return a new Phi node if the conversion was successful, NULL else
1777 static ir_node *apply_unop_on_phi(ir_node *phi, tarval *(*eval)(tarval *)) {
1783 int i, n = get_irn_arity(phi);
1785 NEW_ARR_A(void *, res, n);
1786 for (i = 0; i < n; ++i) {
1787 pred = get_irn_n(phi, i);
1788 tv = get_Const_tarval(pred);
1791 if (tv == tarval_bad) {
1792 /* folding failed, bad */
1797 mode = get_irn_mode(phi);
1798 irg = current_ir_graph;
1799 for (i = 0; i < n; ++i) {
1800 pred = get_irn_n(phi, i);
1801 res[i] = new_r_Const_type(irg, get_irg_start_block(irg),
1802 mode, res[i], get_Const_type(pred));
1804 return new_r_Phi(irg, get_nodes_block(phi), n, (ir_node **)res, mode);
1805 } /* apply_unop_on_phi */
1808 * Transform AddP(P, ConvIs(Iu)), AddP(P, ConvIu(Is)) and
1809 * SubP(P, ConvIs(Iu)), SubP(P, ConvIu(Is)).
1810 * If possible, remove the Conv's.
1812 static ir_node *transform_node_AddSub(ir_node *n) {
1813 ir_mode *mode = get_irn_mode(n);
1815 if (mode_is_reference(mode)) {
1816 ir_node *left = get_binop_left(n);
1817 ir_node *right = get_binop_right(n);
1818 int ref_bits = get_mode_size_bits(mode);
1820 if (get_irn_op(left) == op_Conv) {
1821 ir_mode *mode = get_irn_mode(left);
1822 int bits = get_mode_size_bits(mode);
1824 if (ref_bits == bits &&
1825 mode_is_int(mode) &&
1826 get_mode_arithmetic(mode) == irma_twos_complement) {
1827 ir_node *pre = get_Conv_op(left);
1828 ir_mode *pre_mode = get_irn_mode(pre);
1830 if (mode_is_int(pre_mode) &&
1831 get_mode_size_bits(pre_mode) == bits &&
1832 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
1833 /* ok, this conv just changes to sign, moreover the calculation
1834 * is done with same number of bits as our address mode, so
1835 * we can ignore the conv as address calculation can be viewed
1836 * as either signed or unsigned
1838 set_binop_left(n, pre);
1843 if (get_irn_op(right) == op_Conv) {
1844 ir_mode *mode = get_irn_mode(right);
1845 int bits = get_mode_size_bits(mode);
1847 if (ref_bits == bits &&
1848 mode_is_int(mode) &&
1849 get_mode_arithmetic(mode) == irma_twos_complement) {
1850 ir_node *pre = get_Conv_op(right);
1851 ir_mode *pre_mode = get_irn_mode(pre);
1853 if (mode_is_int(pre_mode) &&
1854 get_mode_size_bits(pre_mode) == bits &&
1855 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
1856 /* ok, this conv just changes to sign, moreover the calculation
1857 * is done with same number of bits as our address mode, so
1858 * we can ignore the conv as address calculation can be viewed
1859 * as either signed or unsigned
1861 set_binop_right(n, pre);
1867 } /* transform_node_AddSub */
1869 #define HANDLE_BINOP_PHI(op,a,b,c) \
1871 if (is_Const(b) && is_const_Phi(a)) { \
1872 /* check for Op(Phi, Const) */ \
1873 c = apply_binop_on_phi(a, get_Const_tarval(b), op, 0); \
1875 else if (is_Const(a) && is_const_Phi(b)) { \
1876 /* check for Op(Const, Phi) */ \
1877 c = apply_binop_on_phi(b, get_Const_tarval(a), op, 1); \
1880 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
1884 #define HANDLE_UNOP_PHI(op,a,c) \
1886 if (is_const_Phi(a)) { \
1887 /* check for Op(Phi) */ \
1888 c = apply_unop_on_phi(a, op); \
1890 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
1896 * Do the AddSub optimization, then Transform
1897 * Constant folding on Phi
1898 * Add(a,a) -> Mul(a, 2)
1899 * Add(Mul(a, x), a) -> Mul(a, x+1)
1900 * if the mode is integer or float.
1901 * Transform Add(a,-b) into Sub(a,b).
1902 * Reassociation might fold this further.
1904 static ir_node *transform_node_Add(ir_node *n) {
1906 ir_node *a, *b, *c, *oldn = n;
1908 n = transform_node_AddSub(n);
1910 a = get_Add_left(n);
1911 b = get_Add_right(n);
1913 HANDLE_BINOP_PHI(tarval_add, a,b,c);
1915 mode = get_irn_mode(n);
1917 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
1918 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
1921 if (mode_is_num(mode)) {
1922 /* the following code leads to endless recursion when Mul are replaced by a simple instruction chain */
1923 if (!get_opt_arch_dep_running() && a == b && mode_is_int(mode)) {
1924 ir_node *block = get_irn_n(n, -1);
1927 get_irn_dbg_info(n),
1931 new_r_Const_long(current_ir_graph, block, mode, 2),
1933 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_A);
1938 get_irn_dbg_info(n),
1944 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
1949 get_irn_dbg_info(n),
1955 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
1958 if (! get_opt_reassociation()) {
1959 /* do NOT execute this code if reassociation is enabled, it does the inverse! */
1961 ir_node *ma = get_Mul_left(a);
1962 ir_node *mb = get_Mul_right(a);
1965 ir_node *blk = get_irn_n(n, -1);
1967 get_irn_dbg_info(n), current_ir_graph, blk,
1970 get_irn_dbg_info(n), current_ir_graph, blk,
1972 new_r_Const_long(current_ir_graph, blk, mode, 1),
1975 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
1977 } else if (b == mb) {
1978 ir_node *blk = get_irn_n(n, -1);
1980 get_irn_dbg_info(n), current_ir_graph, blk,
1983 get_irn_dbg_info(n), current_ir_graph, blk,
1985 new_r_Const_long(current_ir_graph, blk, mode, 1),
1988 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
1993 ir_node *ma = get_Mul_left(b);
1994 ir_node *mb = get_Mul_right(b);
1997 ir_node *blk = get_irn_n(n, -1);
1999 get_irn_dbg_info(n), current_ir_graph, blk,
2002 get_irn_dbg_info(n), current_ir_graph, blk,
2004 new_r_Const_long(current_ir_graph, blk, mode, 1),
2007 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
2011 ir_node *blk = get_irn_n(n, -1);
2013 get_irn_dbg_info(n), current_ir_graph, blk,
2016 get_irn_dbg_info(n), current_ir_graph, blk,
2018 new_r_Const_long(current_ir_graph, blk, mode, 1),
2021 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_MUL_A_X_A);
2026 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2027 /* Here we rely on constants be on the RIGHT side */
2029 ir_node *op = get_Not_op(a);
2031 if (classify_Const(b) == CNST_ONE) {
2033 ir_node *blk = get_irn_n(n, -1);
2034 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, op, mode);
2035 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_PLUS_1);
2040 ir_node *blk = get_irn_n(n, -1);
2041 n = new_r_Const(current_ir_graph, blk, mode, get_mode_minus_one(mode));
2042 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X);
2049 } /* transform_node_Add */
2052 static ir_node *const_negate(ir_node *cnst) {
2053 tarval *tv = tarval_neg(get_Const_tarval(cnst));
2054 dbg_info *dbgi = get_irn_dbg_info(cnst);
2055 ir_graph *irg = get_irn_irg(cnst);
2056 ir_node *block = get_nodes_block(cnst);
2057 ir_mode *mode = get_irn_mode(cnst);
2058 if (tv == tarval_bad) return NULL;
2059 return new_rd_Const(dbgi, irg, block, mode, tv);
2063 * Do the AddSub optimization, then Transform
2064 * Constant folding on Phi
2065 * Sub(0,a) -> Minus(a)
2066 * Sub(Mul(a, x), a) -> Mul(a, x-1)
2067 * Sub(Sub(x, y), b) -> Sub(x, Add(y,b))
2068 * Sub(Add(a, x), x) -> a
2069 * Sub(x, Add(x, a)) -> -a
2070 * Sub(x, Const) -> Add(x, -Const)
2072 static ir_node *transform_node_Sub(ir_node *n) {
2077 n = transform_node_AddSub(n);
2079 a = get_Sub_left(n);
2080 b = get_Sub_right(n);
2082 mode = get_irn_mode(n);
2085 HANDLE_BINOP_PHI(tarval_sub, a,b,c);
2087 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2088 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2091 /* Sub(a, Const) -> Add(a, -Const) */
2092 if (is_Const(b) && get_irn_mode(b) != mode_P) {
2093 ir_node* cnst = const_negate(b);
2095 ir_node *block = get_nodes_block(n);
2096 dbg_info *dbgi = get_irn_dbg_info(n);
2097 ir_graph *irg = get_irn_irg(n);
2098 ir_node *add = new_rd_Add(dbgi, irg, block, a, cnst, mode);
2104 if (is_Minus(a)) { /* -a - b -> -(a + b) */
2105 ir_graph *irg = current_ir_graph;
2106 dbg_info *dbg = get_irn_dbg_info(n);
2107 ir_node *block = get_nodes_block(n);
2108 ir_node *left = get_Minus_op(a);
2109 ir_mode *mode = get_irn_mode(n);
2110 ir_node *add = new_rd_Add(dbg, irg, block, left, b, mode);
2111 ir_node *neg = new_rd_Minus(dbg, irg, block, add, mode);
2113 } else if (is_Minus(b)) { /* a - -b -> a + b */
2114 ir_graph *irg = current_ir_graph;
2115 dbg_info *dbg = get_irn_dbg_info(n);
2116 ir_node *block = get_nodes_block(n);
2117 ir_node *right = get_Minus_op(b);
2118 ir_mode *mode = get_irn_mode(n);
2119 ir_node *add = new_rd_Add(dbg, irg, block, a, right, mode);
2121 } else if (is_Sub(b)) { /* a - (b - c) -> a + (c - b) */
2122 ir_graph *irg = current_ir_graph;
2123 dbg_info *s_dbg = get_irn_dbg_info(b);
2124 ir_node *s_block = get_nodes_block(b);
2125 ir_node *s_left = get_Sub_right(b);
2126 ir_node *s_right = get_Sub_left(b);
2127 ir_mode *s_mode = get_irn_mode(b);
2128 ir_node *sub = new_rd_Sub(s_dbg, irg, s_block, s_left, s_right, s_mode);
2129 dbg_info *a_dbg = get_irn_dbg_info(n);
2130 ir_node *a_block = get_nodes_block(n);
2131 ir_mode *a_mode = get_irn_mode(n);
2132 ir_node *add = new_rd_Add(a_dbg, irg, a_block, a, sub, a_mode);
2134 } else if (is_Mul(b)) { /* a - (b * const2) -> a + (b * -const2) */
2135 ir_node* m_right = get_Mul_right(b);
2136 if (is_Const(m_right)) {
2137 ir_node* cnst2 = const_negate(m_right);
2138 if (cnst2 != NULL) {
2139 ir_graph *irg = current_ir_graph;
2140 dbg_info *m_dbg = get_irn_dbg_info(b);
2141 ir_node *m_block = get_nodes_block(b);
2142 ir_node *m_left = get_Mul_left(b);
2143 ir_mode *m_mode = get_irn_mode(b);
2144 ir_node *mul = new_rd_Mul(m_dbg, irg, m_block, m_left, cnst2, m_mode);
2145 dbg_info *a_dbg = get_irn_dbg_info(n);
2146 ir_node *a_block = get_nodes_block(n);
2147 ir_mode *a_mode = get_irn_mode(n);
2148 ir_node *add = new_rd_Add(a_dbg, irg, a_block, a, mul, a_mode);
2154 /* Beware of Sub(P, P) which cannot be optimized into a simple Minus ... */
2155 if (mode_is_num(mode) && mode == get_irn_mode(a) && (classify_Const(a) == CNST_NULL)) {
2157 get_irn_dbg_info(n),
2162 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_0_A);
2166 if (mode_wrap_around(mode)) {
2167 ir_node *left = get_Add_left(a);
2168 ir_node *right = get_Add_right(a);
2170 /* FIXME: Does the Conv's work only for two complement or generally? */
2172 if (mode != get_irn_mode(right)) {
2173 /* This Sub is an effective Cast */
2174 right = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), right, mode);
2177 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2179 } else if (right == b) {
2180 if (mode != get_irn_mode(left)) {
2181 /* This Sub is an effective Cast */
2182 left = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), left, mode);
2185 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2191 if (mode_wrap_around(mode)) {
2192 ir_node *left = get_Add_left(b);
2193 ir_node *right = get_Add_right(b);
2195 /* FIXME: Does the Conv's work only for two complement or generally? */
2197 ir_mode *r_mode = get_irn_mode(right);
2199 n = new_r_Minus(get_irn_irg(n), get_irn_n(n, -1), right, r_mode);
2200 if (mode != r_mode) {
2201 /* This Sub is an effective Cast */
2202 n = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), n, mode);
2204 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2206 } else if (right == a) {
2207 ir_mode *l_mode = get_irn_mode(left);
2209 n = new_r_Minus(get_irn_irg(n), get_irn_n(n, -1), left, l_mode);
2210 if (mode != l_mode) {
2211 /* This Sub is an effective Cast */
2212 n = new_r_Conv(get_irn_irg(n), get_irn_n(n, -1), n, mode);
2214 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2219 if (mode_is_int(mode) && is_Conv(a) && is_Conv(b)) {
2220 ir_mode *mode = get_irn_mode(a);
2222 if (mode == get_irn_mode(b)) {
2228 /* check if it's allowed to skip the conv */
2229 ma = get_irn_mode(a);
2230 mb = get_irn_mode(b);
2232 if (mode_is_reference(ma) && mode_is_reference(mb)) {
2233 /* SubInt(ConvInt(aP), ConvInt(bP)) -> SubInt(aP,bP) */
2235 set_Sub_right(n, b);
2241 /* do NOT execute this code if reassociation is enabled, it does the inverse! */
2242 if (get_opt_reassociation() && get_irn_op(a) == op_Mul) {
2243 ir_node *ma = get_Mul_left(a);
2244 ir_node *mb = get_Mul_right(a);
2247 ir_node *blk = get_irn_n(n, -1);
2249 get_irn_dbg_info(n),
2250 current_ir_graph, blk,
2253 get_irn_dbg_info(n),
2254 current_ir_graph, blk,
2256 new_r_Const_long(current_ir_graph, blk, mode, 1),
2259 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2261 } else if (mb == b) {
2262 ir_node *blk = get_irn_n(n, -1);
2264 get_irn_dbg_info(n),
2265 current_ir_graph, blk,
2268 get_irn_dbg_info(n),
2269 current_ir_graph, blk,
2271 new_r_Const_long(current_ir_graph, blk, mode, 1),
2274 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2279 ir_node *x = get_Sub_left(a);
2280 ir_node *y = get_Sub_right(a);
2281 ir_node *blk = get_irn_n(n, -1);
2282 ir_mode *m_b = get_irn_mode(b);
2283 ir_mode *m_y = get_irn_mode(y);
2286 /* Determine the right mode for the Add. */
2289 else if (mode_is_reference(m_b))
2291 else if (mode_is_reference(m_y))
2295 * Both modes are different but none is reference,
2296 * happens for instance in SubP(SubP(P, Iu), Is).
2297 * We have two possibilities here: Cast or ignore.
2298 * Currently we ignore this case.
2303 add = new_r_Add(current_ir_graph, blk, y, b, mode);
2305 n = new_rd_Sub(get_irn_dbg_info(n), current_ir_graph, blk, x, add, mode);
2306 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_SUB_X_Y_Z);
2310 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2311 if (is_Const(a) && is_Not(b)) {
2312 /* c - ~X = X + (c+1) */
2313 tarval *tv = get_Const_tarval(a);
2315 tv = tarval_add(tv, get_mode_one(mode));
2316 if (tv != tarval_bad) {
2317 ir_node *blk = get_irn_n(n, -1);
2318 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
2319 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, blk, get_Not_op(b), c, mode);
2320 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_C_NOT_X);
2326 } /* transform_node_Sub */
2329 * Several transformation done on n*n=2n bits mul.
2330 * These transformations must be done here because new nodes may be produced.
2332 static ir_node *transform_node_Mul2n(ir_node *n, ir_mode *mode) {
2334 ir_node *a = get_Mul_left(n);
2335 ir_node *b = get_Mul_right(n);
2336 tarval *ta = value_of(a);
2337 tarval *tb = value_of(b);
2338 ir_mode *smode = get_irn_mode(a);
2340 if (ta == get_mode_one(smode)) {
2341 ir_node *blk = get_irn_n(n, -1);
2342 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, b, mode);
2343 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2346 else if (ta == get_mode_minus_one(smode)) {
2347 ir_node *blk = get_irn_n(n, -1);
2348 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, b, smode);
2349 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, n, mode);
2350 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2353 if (tb == get_mode_one(smode)) {
2354 ir_node *blk = get_irn_n(a, -1);
2355 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, a, mode);
2356 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2359 else if (tb == get_mode_minus_one(smode)) {
2360 ir_node *blk = get_irn_n(n, -1);
2361 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, a, smode);
2362 n = new_rd_Conv(get_irn_dbg_info(n), current_ir_graph, blk, n, mode);
2363 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2370 * Transform Mul(a,-1) into -a.
2371 * Do constant evaluation of Phi nodes.
2372 * Do architecture dependent optimizations on Mul nodes
2374 static ir_node *transform_node_Mul(ir_node *n) {
2375 ir_node *c, *oldn = n;
2376 ir_mode *mode = get_irn_mode(n);
2377 ir_node *a = get_Mul_left(n);
2378 ir_node *b = get_Mul_right(n);
2380 if (is_Bad(a) || is_Bad(b))
2383 if (mode != get_irn_mode(a))
2384 return transform_node_Mul2n(n, mode);
2386 HANDLE_BINOP_PHI(tarval_mul, a,b,c);
2388 if (mode_is_signed(mode)) {
2391 if (value_of(a) == get_mode_minus_one(mode))
2393 else if (value_of(b) == get_mode_minus_one(mode))
2396 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), r, mode);
2397 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2402 if (is_Const(b)) { /* -a * const -> a * -const */
2403 ir_node* cnst = const_negate(b);
2405 set_Mul_left( n, get_Minus_op(a));
2406 set_Mul_right(n, cnst);
2409 } else if (is_Minus(b)) { /* -a * -b -> a * b */
2410 set_Mul_left( n, get_Minus_op(a));
2411 set_Mul_right(n, get_Minus_op(b));
2413 } else if (is_Sub(b)) { /* -a * (b - c) -> a * (c - b) */
2414 ir_node *sub_l = get_Sub_left(b);
2415 ir_node *sub_r = get_Sub_right(b);
2416 dbg_info *dbgi = get_irn_dbg_info(b);
2417 ir_graph *irg = current_ir_graph;
2418 ir_mode *mode = get_irn_mode(b);
2419 ir_node *block = get_nodes_block(b);
2420 ir_node *new_b = new_rd_Sub(dbgi, irg, block, sub_r, sub_l, mode);
2421 set_Mul_left( n, get_Minus_op(a));
2422 set_Mul_right(n, new_b);
2425 } else if (is_Minus(b)) {
2426 if (is_Sub(a)) { /* (a - b) * -c -> (b - a) * c */
2427 ir_node *sub_l = get_Sub_left(a);
2428 ir_node *sub_r = get_Sub_right(a);
2429 dbg_info *dbgi = get_irn_dbg_info(a);
2430 ir_graph *irg = current_ir_graph;
2431 ir_mode *mode = get_irn_mode(a);
2432 ir_node *block = get_nodes_block(a);
2433 ir_node *new_a = new_rd_Sub(dbgi, irg, block, sub_r, sub_l, mode);
2434 set_Mul_left (n, new_a);
2435 set_Mul_right(n, get_Minus_op(b));
2439 if (get_mode_arithmetic(mode) == irma_ieee754) {
2441 tarval *tv = get_Const_tarval(a);
2442 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)) {
2443 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), b, b, mode);
2444 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2448 else if (is_Const(b)) {
2449 tarval *tv = get_Const_tarval(b);
2450 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)) {
2451 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), a, a, mode);
2452 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2457 return arch_dep_replace_mul_with_shifts(n);
2458 } /* transform_node_Mul */
2461 * Transform a Div Node.
2463 static ir_node *transform_node_Div(ir_node *n) {
2464 tarval *tv = value_of(n);
2465 ir_mode *mode = get_Div_resmode(n);
2468 if (tv != tarval_bad) {
2469 value = new_Const(get_tarval_mode(tv), tv);
2471 DBG_OPT_CSTEVAL(n, value);
2474 ir_node *a = get_Div_left(n);
2475 ir_node *b = get_Div_right(n);
2478 if (a == b && value_not_zero(a, &dummy)) {
2479 /* BEWARE: we can optimize a/a to 1 only if this cannot cause a exception */
2480 value = new_Const(mode, get_mode_one(mode));
2481 DBG_OPT_CSTEVAL(n, value);
2484 if (mode_is_signed(mode) && is_Const(b)) {
2485 tarval *tv = get_Const_tarval(b);
2487 if (tv == get_mode_minus_one(mode)) {
2489 value = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), a, mode);
2490 DBG_OPT_CSTEVAL(n, value);
2494 /* Try architecture dependent optimization */
2495 value = arch_dep_replace_div_by_const(n);
2503 /* Turn Div into a tuple (mem, jmp, bad, value) */
2504 mem = get_Div_mem(n);
2505 blk = get_irn_n(n, -1);
2507 /* skip a potential Pin */
2509 mem = get_Pin_op(mem);
2510 turn_into_tuple(n, pn_Div_max);
2511 set_Tuple_pred(n, pn_Div_M, mem);
2512 set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(current_ir_graph, blk));
2513 set_Tuple_pred(n, pn_Div_X_except, new_Bad());
2514 set_Tuple_pred(n, pn_Div_res, value);
2517 } /* transform_node_Div */
2520 * Transform a Mod node.
2522 static ir_node *transform_node_Mod(ir_node *n) {
2523 tarval *tv = value_of(n);
2524 ir_mode *mode = get_Mod_resmode(n);
2527 if (tv != tarval_bad) {
2528 value = new_Const(get_tarval_mode(tv), tv);
2530 DBG_OPT_CSTEVAL(n, value);
2533 ir_node *a = get_Mod_left(n);
2534 ir_node *b = get_Mod_right(n);
2537 if (a == b && value_not_zero(a, &dummy)) {
2538 /* BEWARE: we can optimize a%a to 0 only if this cannot cause a exception */
2539 value = new_Const(mode, get_mode_null(mode));
2540 DBG_OPT_CSTEVAL(n, value);
2543 if (mode_is_signed(mode) && is_Const(b)) {
2544 tarval *tv = get_Const_tarval(b);
2546 if (tv == get_mode_minus_one(mode)) {
2548 value = new_Const(mode, get_mode_null(mode));
2549 DBG_OPT_CSTEVAL(n, value);
2553 /* Try architecture dependent optimization */
2554 value = arch_dep_replace_mod_by_const(n);
2562 /* Turn Mod into a tuple (mem, jmp, bad, value) */
2563 mem = get_Mod_mem(n);
2564 blk = get_irn_n(n, -1);
2566 /* skip a potential Pin */
2568 mem = get_Pin_op(mem);
2569 turn_into_tuple(n, pn_Mod_max);
2570 set_Tuple_pred(n, pn_Mod_M, mem);
2571 set_Tuple_pred(n, pn_Mod_X_regular, new_r_Jmp(current_ir_graph, blk));
2572 set_Tuple_pred(n, pn_Mod_X_except, new_Bad());
2573 set_Tuple_pred(n, pn_Mod_res, value);
2576 } /* transform_node_Mod */
2579 * Transform a DivMod node.
2581 static ir_node *transform_node_DivMod(ir_node *n) {
2583 ir_node *a = get_DivMod_left(n);
2584 ir_node *b = get_DivMod_right(n);
2585 ir_mode *mode = get_DivMod_resmode(n);
2586 tarval *ta = value_of(a);
2587 tarval *tb = value_of(b);
2590 if (tb != tarval_bad) {
2591 if (tb == get_mode_one(get_tarval_mode(tb))) {
2592 b = new_Const(mode, get_mode_null(mode));
2593 DBG_OPT_CSTEVAL(n, b);
2595 } else if (ta != tarval_bad) {
2596 tarval *resa, *resb;
2597 resa = tarval_div(ta, tb);
2598 if (resa == tarval_bad) return n; /* Causes exception!!! Model by replacing through
2599 Jmp for X result!? */
2600 resb = tarval_mod(ta, tb);
2601 if (resb == tarval_bad) return n; /* Causes exception! */
2602 a = new_Const(mode, resa);
2603 b = new_Const(mode, resb);
2604 DBG_OPT_CSTEVAL(n, a);
2605 DBG_OPT_CSTEVAL(n, b);
2607 } else if (mode_is_signed(mode) && tb == get_mode_minus_one(mode)) {
2608 a = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1), a, mode);
2609 b = new_Const(mode, get_mode_null(mode));
2610 DBG_OPT_CSTEVAL(n, a);
2611 DBG_OPT_CSTEVAL(n, b);
2613 } else { /* Try architecture dependent optimization */
2614 arch_dep_replace_divmod_by_const(&a, &b, n);
2615 evaluated = a != NULL;
2617 } else if (a == b) {
2618 if (value_not_zero(a, &dummy)) {
2620 a = new_Const(mode, get_mode_one(mode));
2621 b = new_Const(mode, get_mode_null(mode));
2622 DBG_OPT_CSTEVAL(n, a);
2623 DBG_OPT_CSTEVAL(n, b);
2626 /* BEWARE: it is NOT possible to optimize a/a to 1, as this may cause a exception */
2629 } else if (ta == get_mode_null(mode) && value_not_zero(b, &dummy)) {
2630 /* 0 / non-Const = 0 */
2635 if (evaluated) { /* replace by tuple */
2639 mem = get_DivMod_mem(n);
2640 /* skip a potential Pin */
2642 mem = get_Pin_op(mem);
2644 blk = get_irn_n(n, -1);
2645 turn_into_tuple(n, pn_DivMod_max);
2646 set_Tuple_pred(n, pn_DivMod_M, mem);
2647 set_Tuple_pred(n, pn_DivMod_X_regular, new_r_Jmp(current_ir_graph, blk));
2648 set_Tuple_pred(n, pn_DivMod_X_except, new_Bad()); /* no exception */
2649 set_Tuple_pred(n, pn_DivMod_res_div, a);
2650 set_Tuple_pred(n, pn_DivMod_res_mod, b);
2654 } /* transform_node_DivMod */
2657 * Optimize x / c to x * (1/c)
2659 static ir_node *transform_node_Quot(ir_node *n) {
2660 ir_mode *mode = get_Quot_resmode(n);
2663 if (get_mode_arithmetic(mode) == irma_ieee754) {
2664 ir_node *b = get_Quot_right(n);
2667 tarval *tv = get_Const_tarval(b);
2669 tv = tarval_quo(get_mode_one(mode), tv);
2671 /* Do the transformation if the result is either exact or we are not
2672 using strict rules. */
2673 if (tv != tarval_bad &&
2674 (tarval_ieee754_get_exact() || (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic) == 0)) {
2675 ir_node *blk = get_irn_n(n, -1);
2676 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
2677 ir_node *a = get_Quot_left(n);
2678 ir_node *m = new_rd_Mul(get_irn_dbg_info(n), current_ir_graph, blk, a, c, mode);
2679 ir_node *mem = get_Quot_mem(n);
2681 /* skip a potential Pin */
2683 mem = get_Pin_op(mem);
2684 turn_into_tuple(n, pn_Quot_max);
2685 set_Tuple_pred(n, pn_Quot_M, mem);
2686 set_Tuple_pred(n, pn_Quot_X_regular, new_r_Jmp(current_ir_graph, blk));
2687 set_Tuple_pred(n, pn_Quot_X_except, new_r_Bad(current_ir_graph));
2688 set_Tuple_pred(n, pn_Quot_res, m);
2689 DBG_OPT_ALGSIM1(oldn, a, b, m, FS_OPT_FP_INV_MUL);
2694 } /* transform_node_Quot */
2697 * Optimize Abs(x) into x if x is Confirmed >= 0
2698 * Optimize Abs(x) into -x if x is Confirmed <= 0
2700 static ir_node *transform_node_Abs(ir_node *n) {
2702 ir_node *a = get_Abs_op(n);
2703 value_classify_sign sign = classify_value_sign(a);
2705 if (sign == value_classified_negative) {
2706 ir_mode *mode = get_irn_mode(n);
2709 * We can replace the Abs by -x here.
2710 * We even could add a new Confirm here.
2712 * Note that -x would create a new node, so we could
2713 * not run it in the equivalent_node() context.
2715 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph,
2716 get_irn_n(n, -1), a, mode);
2718 DBG_OPT_CONFIRM(oldn, n);
2719 } else if (sign == value_classified_positive) {
2720 /* n is positive, Abs is not needed */
2723 DBG_OPT_CONFIRM(oldn, n);
2727 } /* transform_node_Abs */
2730 * Transform a Cond node.
2732 * Replace the Cond by a Jmp if it branches on a constant
2735 static ir_node *transform_node_Cond(ir_node *n) {
2738 ir_node *a = get_Cond_selector(n);
2739 tarval *ta = value_of(a);
2741 /* we need block info which is not available in floating irgs */
2742 if (get_irg_pinned(current_ir_graph) == op_pin_state_floats)
2745 if ((ta != tarval_bad) &&
2746 (get_irn_mode(a) == mode_b) &&
2747 (get_opt_unreachable_code())) {
2748 /* It's a boolean Cond, branching on a boolean constant.
2749 Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
2750 jmp = new_r_Jmp(current_ir_graph, get_nodes_block(n));
2751 turn_into_tuple(n, pn_Cond_max);
2752 if (ta == tarval_b_true) {
2753 set_Tuple_pred(n, pn_Cond_false, new_Bad());
2754 set_Tuple_pred(n, pn_Cond_true, jmp);
2756 set_Tuple_pred(n, pn_Cond_false, jmp);
2757 set_Tuple_pred(n, pn_Cond_true, new_Bad());
2759 /* We might generate an endless loop, so keep it alive. */
2760 add_End_keepalive(get_irg_end(current_ir_graph), get_nodes_block(n));
2763 } /* transform_node_Cond */
2765 typedef ir_node* (*recursive_transform) (ir_node *n);
2768 * makes use of distributive laws for and, or, eor
2769 * and(a OP c, b OP c) -> and(a, b) OP c
2770 * note, might return a different op than n
2772 static ir_node *transform_bitwise_distributive(ir_node *n,
2773 recursive_transform trans_func)
2776 ir_node *a = get_binop_left(n);
2777 ir_node *b = get_binop_right(n);
2778 ir_op *op = get_irn_op(a);
2779 ir_op *op_root = get_irn_op(n);
2781 if(op != get_irn_op(b))
2784 if (op == op_Conv) {
2785 ir_node *a_op = get_Conv_op(a);
2786 ir_node *b_op = get_Conv_op(b);
2787 ir_mode *a_mode = get_irn_mode(a_op);
2788 ir_mode *b_mode = get_irn_mode(b_op);
2789 if(a_mode == b_mode && (mode_is_int(a_mode) || a_mode == mode_b)) {
2790 ir_node *blk = get_irn_n(n, -1);
2793 set_binop_left(n, a_op);
2794 set_binop_right(n, b_op);
2795 set_irn_mode(n, a_mode);
2797 n = new_r_Conv(current_ir_graph, blk, n, get_irn_mode(oldn));
2799 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
2805 /* nothing to gain here */
2809 if (op == op_Shrs || op == op_Shr || op == op_Shl
2810 || op == op_And || op == op_Or || op == op_Eor) {
2811 ir_node *a_left = get_binop_left(a);
2812 ir_node *a_right = get_binop_right(a);
2813 ir_node *b_left = get_binop_left(b);
2814 ir_node *b_right = get_binop_right(b);
2818 if (is_op_commutative(op)) {
2819 if (a_left == b_left) {
2823 } else if(a_left == b_right) {
2827 } else if(a_right == b_left) {
2833 if(a_right == b_right) {
2840 /* (a sop c) & (b sop c) => (a & b) sop c */
2841 ir_node *blk = get_irn_n(n, -1);
2843 ir_node *new_n = exact_copy(n);
2844 set_binop_left(new_n, op1);
2845 set_binop_right(new_n, op2);
2846 new_n = trans_func(new_n);
2848 if(op_root == op_Eor && op == op_Or) {
2849 dbg_info *dbgi = get_irn_dbg_info(n);
2850 ir_graph *irg = current_ir_graph;
2851 ir_mode *mode = get_irn_mode(c);
2853 c = new_rd_Not(dbgi, irg, blk, c, mode);
2854 n = new_rd_And(dbgi, irg, blk, new_n, c, mode);
2857 set_irn_n(n, -1, blk);
2858 set_binop_left(n, new_n);
2859 set_binop_right(n, c);
2862 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
2873 static ir_node *transform_node_And(ir_node *n) {
2874 ir_node *c, *oldn = n;
2875 ir_node *a = get_And_left(n);
2876 ir_node *b = get_And_right(n);
2878 HANDLE_BINOP_PHI(tarval_and, a,b,c);
2880 /* we can evaluate 2 Projs of the same Cmp */
2881 if (get_irn_mode(n) == mode_b && is_Proj(a) && is_Proj(b)) {
2882 ir_node *pred_a = get_Proj_pred(a);
2883 ir_node *pred_b = get_Proj_pred(b);
2884 if(pred_a == pred_b) {
2885 dbg_info *dbgi = get_irn_dbg_info(n);
2886 ir_node *block = get_nodes_block(pred_a);
2887 pn_Cmp pn_a = get_Proj_proj(a);
2888 pn_Cmp pn_b = get_Proj_proj(b);
2889 /* yes, we can simply calculate with pncs */
2890 pn_Cmp new_pnc = pn_a & pn_b;
2892 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b,
2898 ir_node *op = get_Not_op(b);
2900 ir_node *ba = get_And_left(op);
2901 ir_node *bb = get_And_right(op);
2903 /* it's enough to test the following cases due to normalization! */
2904 if (get_Or_left(a) == ba && get_Or_right(a) == bb) {
2905 /* (a|b) & ~(a&b) = a^b */
2906 ir_node *block = get_nodes_block(n);
2908 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph, block, ba, bb, get_irn_mode(n));
2909 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
2917 ir_node *op = get_Not_op(a);
2919 ir_node *aa = get_And_left(op);
2920 ir_node *ab = get_And_right(op);
2922 /* it's enough to test the following cases due to normalization! */
2923 if (get_Or_left(b) == aa && get_Or_right(b) == ab) {
2924 /* (a|b) & ~(a&b) = a^b */
2925 ir_node *block = get_nodes_block(n);
2927 n = new_rd_Eor(get_irn_dbg_info(n), current_ir_graph, block, aa, ab, get_irn_mode(n));
2928 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
2936 n = transform_bitwise_distributive(n, transform_node_And);
2939 } /* transform_node_And */
2944 static ir_node *transform_node_Eor(ir_node *n) {
2945 ir_node *c, *oldn = n;
2946 ir_node *a = get_Eor_left(n);
2947 ir_node *b = get_Eor_right(n);
2948 ir_mode *mode = get_irn_mode(n);
2950 HANDLE_BINOP_PHI(tarval_eor, a,b,c);
2952 /* we can evaluate 2 Projs of the same Cmp */
2953 if(get_irn_mode(n) == mode_b && is_Proj(a) && is_Proj(b)) {
2954 ir_node *pred_a = get_Proj_pred(a);
2955 ir_node *pred_b = get_Proj_pred(b);
2956 if(pred_a == pred_b) {
2957 dbg_info *dbgi = get_irn_dbg_info(n);
2958 ir_node *block = get_nodes_block(pred_a);
2959 pn_Cmp pn_a = get_Proj_proj(a);
2960 pn_Cmp pn_b = get_Proj_proj(b);
2961 /* yes, we can simply calculate with pncs */
2962 pn_Cmp new_pnc = pn_a ^ pn_b;
2964 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b,
2971 n = new_rd_Const(get_irn_dbg_info(n), current_ir_graph, get_irn_n(n, -1),
2972 mode, get_mode_null(mode));
2973 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_A_A);
2974 } else if ((mode == mode_b)
2975 && (get_irn_op(a) == op_Proj)
2976 && (get_irn_mode(a) == mode_b)
2977 && (classify_tarval (value_of(b)) == TV_CLASSIFY_ONE)
2978 && (get_irn_op(get_Proj_pred(a)) == op_Cmp)) {
2979 /* The Eor negates a Cmp. The Cmp has the negated result anyways! */
2980 n = new_r_Proj(current_ir_graph, get_irn_n(n, -1), get_Proj_pred(a),
2981 mode_b, get_negated_pnc(get_Proj_proj(a), mode));
2983 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT_BOOL);
2984 } else if ((mode == mode_b)
2985 && (classify_tarval (value_of(b)) == TV_CLASSIFY_ONE)) {
2986 /* The Eor is a Not. Replace it by a Not. */
2987 /* ????!!!Extend to bitfield 1111111. */
2988 n = new_r_Not(current_ir_graph, get_irn_n(n, -1), a, mode_b);
2990 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
2992 n = transform_bitwise_distributive(n, transform_node_Eor);
2996 } /* transform_node_Eor */
3001 static ir_node *transform_node_Not(ir_node *n) {
3002 ir_node *c, *oldn = n;
3003 ir_node *a = get_Not_op(n);
3004 ir_op *op_a = get_irn_op(a);
3006 HANDLE_UNOP_PHI(tarval_not,a,c);
3008 /* check for a boolean Not */
3009 if ( (get_irn_mode(n) == mode_b)
3010 && (op_a == op_Proj)
3011 && (get_irn_mode(a) == mode_b)
3012 && (get_irn_op(get_Proj_pred(a)) == op_Cmp)) {
3013 /* We negate a Cmp. The Cmp has the negated result anyways! */
3014 n = new_r_Proj(current_ir_graph, get_irn_n(n, -1), get_Proj_pred(a),
3015 mode_b, get_negated_pnc(get_Proj_proj(a), mode_b));
3016 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP);
3019 if (op_a == op_Sub && classify_Const(get_Sub_right(a)) == CNST_ONE) {
3021 ir_node *op = get_Sub_left(a);
3022 ir_node *blk = get_irn_n(n, -1);
3023 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph, blk, op, get_irn_mode(n));
3024 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_MINUS_1);
3027 } /* transform_node_Not */
3030 * Transform a Minus.
3034 static ir_node *transform_node_Minus(ir_node *n) {
3035 ir_node *c, *oldn = n;
3036 ir_node *a = get_Minus_op(n);
3039 HANDLE_UNOP_PHI(tarval_neg,a,c);
3041 mode = get_irn_mode(a);
3042 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Not(a)) {
3044 ir_node *op = get_Not_op(a);
3045 tarval *tv = get_mode_one(mode);
3046 ir_node *blk = get_irn_n(n, -1);
3047 ir_node *c = new_r_Const(current_ir_graph, blk, mode, tv);
3048 n = new_rd_Add(get_irn_dbg_info(n), current_ir_graph, blk, op, c, mode);
3049 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_NOT);
3050 } else if (is_Sub(a)) {
3051 /* - (a-b) = b - a */
3052 ir_node *la = get_Sub_left(a);
3053 ir_node *ra = get_Sub_right(a);
3054 ir_node *blk = get_irn_n(n, -1);
3056 n = new_rd_Sub(get_irn_dbg_info(n), current_ir_graph, blk, ra, la, mode);
3057 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_SUB);
3061 } /* transform_node_Minus */
3064 * Transform a Cast_type(Const) into a new Const_type
3066 static ir_node *transform_node_Cast(ir_node *n) {
3068 ir_node *pred = get_Cast_op(n);
3069 ir_type *tp = get_irn_type(n);
3071 if (get_irn_op(pred) == op_Const && get_Const_type(pred) != tp) {
3072 n = new_rd_Const_type(NULL, current_ir_graph, get_irn_n(pred, -1), get_irn_mode(pred),
3073 get_Const_tarval(pred), tp);
3074 DBG_OPT_CSTEVAL(oldn, n);
3075 } else if ((get_irn_op(pred) == op_SymConst) && (get_SymConst_value_type(pred) != tp)) {
3076 n = new_rd_SymConst_type(NULL, current_ir_graph, get_irn_n(pred, -1), get_SymConst_symbol(pred),
3077 get_SymConst_kind(pred), tp);
3078 DBG_OPT_CSTEVAL(oldn, n);
3082 } /* transform_node_Cast */
3085 * Transform a Proj(Div) with a non-zero value.
3086 * Removes the exceptions and routes the memory to the NoMem node.
3088 static ir_node *transform_node_Proj_Div(ir_node *proj) {
3089 ir_node *div = get_Proj_pred(proj);
3090 ir_node *b = get_Div_right(div);
3091 ir_node *confirm, *res, *new_mem;
3094 if (value_not_zero(b, &confirm)) {
3095 /* div(x, y) && y != 0 */
3096 proj_nr = get_Proj_proj(proj);
3098 case pn_Div_X_regular:
3099 return new_r_Jmp(current_ir_graph, get_irn_n(div, -1));
3101 case pn_Div_X_except:
3102 /* we found an exception handler, remove it */
3103 DBG_OPT_EXC_REM(proj);
3107 res = get_Div_mem(div);
3108 new_mem = get_irg_no_mem(current_ir_graph);
3111 /* This node can only float up to the Confirm block */
3112 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3114 set_irn_pinned(div, op_pin_state_floats);
3115 /* this is a Div without exception, we can remove the memory edge */
3116 set_Div_mem(div, new_mem);
3121 } /* transform_node_Proj_Div */
3124 * Transform a Proj(Mod) with a non-zero value.
3125 * Removes the exceptions and routes the memory to the NoMem node.
3127 static ir_node *transform_node_Proj_Mod(ir_node *proj) {
3128 ir_node *mod = get_Proj_pred(proj);
3129 ir_node *b = get_Mod_right(mod);
3130 ir_node *confirm, *res, *new_mem;
3133 if (value_not_zero(b, &confirm)) {
3134 /* mod(x, y) && y != 0 */
3135 proj_nr = get_Proj_proj(proj);
3139 case pn_Mod_X_regular:
3140 return new_r_Jmp(current_ir_graph, get_irn_n(mod, -1));
3142 case pn_Mod_X_except:
3143 /* we found an exception handler, remove it */
3144 DBG_OPT_EXC_REM(proj);
3148 res = get_Mod_mem(mod);
3149 new_mem = get_irg_no_mem(current_ir_graph);
3152 /* This node can only float up to the Confirm block */
3153 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3155 set_irn_pinned(mod, op_pin_state_floats);
3156 /* this is a Mod without exception, we can remove the memory edge */
3157 set_Mod_mem(mod, get_irg_no_mem(current_ir_graph));
3160 if (get_Mod_left(mod) == b) {
3161 /* a % a = 0 if a != 0 */
3162 ir_mode *mode = get_irn_mode(proj);
3163 ir_node *res = new_Const(mode, get_mode_null(mode));
3165 DBG_OPT_CSTEVAL(mod, res);
3171 } /* transform_node_Proj_Mod */
3174 * Transform a Proj(DivMod) with a non-zero value.
3175 * Removes the exceptions and routes the memory to the NoMem node.
3177 static ir_node *transform_node_Proj_DivMod(ir_node *proj) {
3178 ir_node *divmod = get_Proj_pred(proj);
3179 ir_node *b = get_DivMod_right(divmod);
3180 ir_node *confirm, *res, *new_mem;
3183 if (value_not_zero(b, &confirm)) {
3184 /* DivMod(x, y) && y != 0 */
3185 proj_nr = get_Proj_proj(proj);
3189 case pn_DivMod_X_regular:
3190 return new_r_Jmp(current_ir_graph, get_irn_n(divmod, -1));
3192 case pn_DivMod_X_except:
3193 /* we found an exception handler, remove it */
3194 DBG_OPT_EXC_REM(proj);
3198 res = get_DivMod_mem(divmod);
3199 new_mem = get_irg_no_mem(current_ir_graph);
3202 /* This node can only float up to the Confirm block */
3203 new_mem = new_r_Pin(current_ir_graph, get_nodes_block(confirm), new_mem);
3205 set_irn_pinned(divmod, op_pin_state_floats);
3206 /* this is a DivMod without exception, we can remove the memory edge */
3207 set_DivMod_mem(divmod, get_irg_no_mem(current_ir_graph));
3210 case pn_DivMod_res_mod:
3211 if (get_DivMod_left(divmod) == b) {
3212 /* a % a = 0 if a != 0 */
3213 ir_mode *mode = get_irn_mode(proj);
3214 ir_node *res = new_Const(mode, get_mode_null(mode));
3216 DBG_OPT_CSTEVAL(divmod, res);
3222 } /* transform_node_Proj_DivMod */
3225 * Optimizes jump tables (CondIs or CondIu) by removing all impossible cases.
3227 static ir_node *transform_node_Proj_Cond(ir_node *proj) {
3228 if (get_opt_unreachable_code()) {
3229 ir_node *n = get_Proj_pred(proj);
3230 ir_node *b = get_Cond_selector(n);
3232 if (mode_is_int(get_irn_mode(b))) {
3233 tarval *tb = value_of(b);
3235 if (tb != tarval_bad) {
3236 /* we have a constant switch */
3237 long num = get_Proj_proj(proj);
3239 if (num != get_Cond_defaultProj(n)) { /* we cannot optimize default Proj's yet */
3240 if (get_tarval_long(tb) == num) {
3241 /* Do NOT create a jump here, or we will have 2 control flow ops
3242 * in a block. This case is optimized away in optimize_cf(). */
3245 /* this case will NEVER be taken, kill it */
3253 } /* transform_node_Proj_Cond */
3256 * Normalizes and optimizes Cmp nodes.
3258 static ir_node *transform_node_Proj_Cmp(ir_node *proj) {
3259 ir_node *n = get_Proj_pred(proj);
3260 ir_node *left = get_Cmp_left(n);
3261 ir_node *right = get_Cmp_right(n);
3265 ir_mode *mode = NULL;
3266 long proj_nr = get_Proj_proj(proj);
3268 /* we can evaluate this direct */
3271 return new_Const(mode_b, get_tarval_b_false());
3273 return new_Const(mode_b, get_tarval_b_true());
3275 if(!mode_is_float(get_irn_mode(left)))
3276 return new_Const(mode_b, get_tarval_b_true());
3282 /* Remove unnecessary conversions */
3283 /* TODO handle constants */
3284 if (is_Conv(left) && is_Conv(right)) {
3285 ir_mode *mode = get_irn_mode(left);
3286 ir_node *op_left = get_Conv_op(left);
3287 ir_node *op_right = get_Conv_op(right);
3288 ir_mode *mode_left = get_irn_mode(op_left);
3289 ir_mode *mode_right = get_irn_mode(op_right);
3291 if (smaller_mode(mode_left, mode) && smaller_mode(mode_right, mode)) {
3292 ir_graph *irg = current_ir_graph;
3293 ir_node *block = get_nodes_block(n);
3295 if (mode_left == mode_right) {
3299 } else if (smaller_mode(mode_left, mode_right)) {
3300 left = new_r_Conv(irg, block, op_left, mode_right);
3303 } else if (smaller_mode(mode_right, mode_left)) {
3305 right = new_r_Conv(irg, block, op_right, mode_left);
3313 left = get_Cast_op(left);
3315 right = get_Cast_op(right);
3317 /* remove operation of both sides if possible */
3318 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
3319 ir_opcode lop = get_irn_opcode(left);
3321 if (lop == get_irn_opcode(right)) {
3322 ir_node *ll, *lr, *rl, *rr;
3324 /* same operation on both sides, try to remove */
3328 /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */
3329 left = get_unop_op(left);
3330 right = get_unop_op(right);
3334 ll = get_Add_left(left);
3335 lr = get_Add_right(left);
3336 rl = get_Add_left(right);
3337 rr = get_Add_right(right);
3340 /* X + a CMP X + b ==> a CMP b */
3344 } else if (ll == rr) {
3345 /* X + a CMP b + X ==> a CMP b */
3349 } else if (lr == rl) {
3350 /* a + X CMP X + b ==> a CMP b */
3354 } else if (lr == rr) {
3355 /* a + X CMP b + X ==> a CMP b */
3362 ll = get_Sub_left(left);
3363 lr = get_Sub_right(left);
3364 rl = get_Sub_left(right);
3365 rr = get_Sub_right(right);
3368 /* X - a CMP X - b ==> a CMP b */
3372 } else if (lr == rr) {
3373 /* a - X CMP b - X ==> a CMP b */
3380 if (get_Rot_right(left) == get_Rot_right(right)) {
3381 /* a ROT X CMP b ROT X */
3382 left = get_Rot_left(left);
3383 right = get_Rot_left(right);
3394 if (get_irn_mode(left) == mode_b) {
3395 ir_graph *irg = current_ir_graph;
3396 ir_node *block = get_nodes_block(n);
3399 case pn_Cmp_Le: return new_r_Or( irg, block, new_r_Not(irg, block, left, mode_b), right, mode_b);
3400 case pn_Cmp_Lt: return new_r_And(irg, block, new_r_Not(irg, block, left, mode_b), right, mode_b);
3401 case pn_Cmp_Ge: return new_r_Or( irg, block, left, new_r_Not(irg, block, right, mode_b), mode_b);
3402 case pn_Cmp_Gt: return new_r_And(irg, block, left, new_r_Not(irg, block, right, mode_b), mode_b);
3403 case pn_Cmp_Lg: return new_r_Eor(irg, block, left, right, mode_b);
3404 case pn_Cmp_Eq: return new_r_Not(irg, block, new_r_Eor(irg, block, left, right, mode_b), mode_b);
3408 if (!get_opt_reassociation())
3412 * First step: normalize the compare op
3413 * by placing the constant on the right side
3414 * or moving the lower address node to the left.
3415 * We ignore the case that both are constants
3416 * this case should be optimized away.
3418 if (is_Const(right)) {
3420 } else if (is_Const(left)) {
3425 proj_nr = get_inversed_pnc(proj_nr);
3427 } else if (get_irn_idx(left) > get_irn_idx(right)) {
3433 proj_nr = get_inversed_pnc(proj_nr);
3438 * Second step: Try to reduce the magnitude
3439 * of a constant. This may help to generate better code
3440 * later and may help to normalize more compares.
3441 * Of course this is only possible for integer values.
3444 mode = get_irn_mode(c);
3445 tv = get_Const_tarval(c);
3447 if (tv != tarval_bad) {
3448 /* the following optimization is possible on modes without Overflow
3449 * on Unary Minus or on == and !=:
3450 * -a CMP c ==> a swap(CMP) -c
3452 * Beware: for two-complement Overflow may occur, so only == and != can
3453 * be optimized, see this:
3454 * -MININT < 0 =/=> MININT > 0 !!!
3456 if (is_Minus(left) &&
3457 (!mode_overflow_on_unary_Minus(mode) ||
3458 (mode_is_int(mode) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)))) {
3459 tv = tarval_neg(tv);
3461 if (tv != tarval_bad) {
3462 left = get_Minus_op(left);
3463 proj_nr = get_inversed_pnc(proj_nr);
3466 } else if (is_Not(left) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)) {
3467 tv = tarval_not(tv);
3469 if (tv != tarval_bad) {
3470 left = get_Not_op(left);
3475 /* for integer modes, we have more */
3476 if (mode_is_int(mode)) {
3477 /* Ne includes Unordered which is not possible on integers.
3478 * However, frontends often use this wrong, so fix it here */
3479 if (proj_nr & pn_Cmp_Uo) {
3480 proj_nr &= ~pn_Cmp_Uo;
3481 set_Proj_proj(proj, proj_nr);
3484 /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */
3485 if ((proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Ge) &&
3486 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Gt) {
3487 tv = tarval_sub(tv, get_mode_one(mode));
3489 if (tv != tarval_bad) {
3490 proj_nr ^= pn_Cmp_Eq;
3494 /* c < 0 : a > c ==> a >= (c+1) a <= c ==> a < (c+1) */
3495 else if ((proj_nr == pn_Cmp_Gt || proj_nr == pn_Cmp_Le) &&
3496 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Lt) {
3497 tv = tarval_add(tv, get_mode_one(mode));
3499 if (tv != tarval_bad) {
3500 proj_nr ^= pn_Cmp_Eq;
3505 /* the following reassociations work only for == and != */
3506 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
3508 /* a-b == 0 ==> a == b, a-b != 0 ==> a != b */
3509 if (classify_tarval(tv) == TV_CLASSIFY_NULL && is_Sub(left)) {
3510 right =get_Sub_right(left);
3511 left = get_Sub_left(left);
3513 tv = value_of(right);
3517 if (tv != tarval_bad) {
3518 ir_op *op = get_irn_op(left);
3520 /* a-c1 == c2 ==> a == c2+c1, a-c1 != c2 ==> a != c2+c1 */
3522 ir_node *c1 = get_Sub_right(left);
3523 tarval *tv2 = value_of(c1);
3525 if (tv2 != tarval_bad) {
3526 tv2 = tarval_add(tv, value_of(c1));
3528 if (tv2 != tarval_bad) {
3529 left = get_Sub_left(left);
3535 /* a+c1 == c2 ==> a == c2-c1, a+c1 != c2 ==> a != c2-c1 */
3536 else if (op == op_Add) {
3537 ir_node *a_l = get_Add_left(left);
3538 ir_node *a_r = get_Add_right(left);
3542 if (get_irn_op(a_l) == op_Const) {
3544 tv2 = value_of(a_l);
3547 tv2 = value_of(a_r);
3550 if (tv2 != tarval_bad) {
3551 tv2 = tarval_sub(tv, tv2);
3553 if (tv2 != tarval_bad) {
3560 /* -a == c ==> a == -c, -a != c ==> a != -c */
3561 else if (op == op_Minus) {
3562 tarval *tv2 = tarval_sub(get_mode_null(mode), tv);
3564 if (tv2 != tarval_bad) {
3565 left = get_Minus_op(left);
3572 /* the following reassociations work only for <= */
3573 else if (proj_nr == pn_Cmp_Le || proj_nr == pn_Cmp_Lt) {
3574 if (tv != tarval_bad) {
3575 ir_op *op = get_irn_op(left);
3577 /* c >= 0 : Abs(a) <= c ==> (unsigned)(a + c) <= 2*c */
3585 * optimization for AND:
3587 * And(x, C) == C ==> And(x, C) != 0
3588 * And(x, C) != C ==> And(X, C) == 0
3590 * if C is a single Bit constant.
3592 if ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) && is_And(left)) {
3593 if (tarval_is_single_bit(tv)) {
3594 /* check for Constant's match. We have check hare the tarvals,
3595 because our const might be changed */
3596 ir_node *la = get_And_left(left);
3597 ir_node *ra = get_And_right(left);
3598 if ((is_Const(la) && get_Const_tarval(la) == tv) ||
3599 (is_Const(ra) && get_Const_tarval(ra) == tv)) {
3600 /* fine: do the transformation */
3601 tv = get_mode_null(get_tarval_mode(tv));
3602 proj_nr ^= pn_Cmp_Leg;
3607 } /* tarval != bad */
3611 ir_node *block = get_irn_n(n, -1); /* Beware of get_nodes_Block() */
3613 if (changed & 2) /* need a new Const */
3614 right = new_Const(mode, tv);
3616 /* create a new compare */
3617 n = new_rd_Cmp(get_irn_dbg_info(n), current_ir_graph, block, left, right);
3619 set_Proj_pred(proj, n);
3620 set_Proj_proj(proj, proj_nr);
3624 } /* transform_node_Proj_Cmp */
3627 * Does all optimizations on nodes that must be done on it's Proj's
3628 * because of creating new nodes.
3630 static ir_node *transform_node_Proj(ir_node *proj) {
3631 ir_node *n = get_Proj_pred(proj);
3633 switch (get_irn_opcode(n)) {
3635 return transform_node_Proj_Div(proj);
3638 return transform_node_Proj_Mod(proj);
3641 return transform_node_Proj_DivMod(proj);
3644 return transform_node_Proj_Cond(proj);
3647 return transform_node_Proj_Cmp(proj);
3650 /* should not happen, but if it does will be optimized away */
3651 return equivalent_node_Proj(proj);
3657 } /* transform_node_Proj */
3660 * Move Confirms down through Phi nodes.
3662 static ir_node *transform_node_Phi(ir_node *phi) {
3664 ir_mode *mode = get_irn_mode(phi);
3666 if (mode_is_reference(mode)) {
3667 n = get_irn_arity(phi);
3669 /* Beware of Phi0 */
3671 ir_node *pred = get_irn_n(phi, 0);
3672 ir_node *bound, *new_Phi, *block, **in;
3675 if (! is_Confirm(pred))
3678 bound = get_Confirm_bound(pred);
3679 pnc = get_Confirm_cmp(pred);
3681 NEW_ARR_A(ir_node *, in, n);
3682 in[0] = get_Confirm_value(pred);
3684 for (i = 1; i < n; ++i) {
3685 pred = get_irn_n(phi, i);
3687 if (! is_Confirm(pred) ||
3688 get_Confirm_bound(pred) != bound ||
3689 get_Confirm_cmp(pred) != pnc)
3691 in[i] = get_Confirm_value(pred);
3693 /* move the Confirm nodes "behind" the Phi */
3694 block = get_irn_n(phi, -1);
3695 new_Phi = new_r_Phi(current_ir_graph, block, n, in, get_irn_mode(phi));
3696 return new_r_Confirm(current_ir_graph, block, new_Phi, bound, pnc);
3700 } /* transform_node_Phi */
3703 * Returns the operands of a commutative bin-op, if one operand is
3704 * a const, it is returned as the second one.
3706 static void get_comm_Binop_Ops(ir_node *binop, ir_node **a, ir_node **c) {
3707 ir_node *op_a = get_binop_left(binop);
3708 ir_node *op_b = get_binop_right(binop);
3710 assert(is_op_commutative(get_irn_op(binop)));
3712 if (get_irn_op(op_a) == op_Const) {
3719 } /* get_comm_Binop_Ops */
3722 * Optimize a Or(And(Or(And(v,c4),c3),c2),c1) pattern if possible.
3723 * Such pattern may arise in bitfield stores.
3725 * value c4 value c4 & c2
3726 * AND c3 AND c1 | c3
3733 * AND c1 ===> OR if (c1 | c2) == 0x111..11
3736 static ir_node *transform_node_Or_bf_store(ir_node *or) {
3739 ir_node *and_l, *c3;
3740 ir_node *value, *c4;
3741 ir_node *new_and, *new_const, *block;
3742 ir_mode *mode = get_irn_mode(or);
3744 tarval *tv1, *tv2, *tv3, *tv4, *tv, *n_tv4, *n_tv2;
3747 get_comm_Binop_Ops(or, &and, &c1);
3748 if (!is_Const(c1) || !is_And(and))
3751 get_comm_Binop_Ops(and, &or_l, &c2);
3755 tv1 = get_Const_tarval(c1);
3756 tv2 = get_Const_tarval(c2);
3758 tv = tarval_or(tv1, tv2);
3759 if (classify_tarval(tv) == TV_CLASSIFY_ALL_ONE) {
3760 /* the AND does NOT clear a bit with isn't set be the OR */
3761 set_Or_left(or, or_l);
3762 set_Or_right(or, c1);
3764 /* check for more */
3771 get_comm_Binop_Ops(or_l, &and_l, &c3);
3772 if (!is_Const(c3) || !is_And(and_l))
3775 get_comm_Binop_Ops(and_l, &value, &c4);
3779 /* ok, found the pattern, check for conditions */
3780 assert(mode == get_irn_mode(and));
3781 assert(mode == get_irn_mode(or_l));
3782 assert(mode == get_irn_mode(and_l));
3784 tv3 = get_Const_tarval(c3);
3785 tv4 = get_Const_tarval(c4);
3787 tv = tarval_or(tv4, tv2);
3788 if (classify_tarval(tv) != TV_CLASSIFY_ALL_ONE) {
3789 /* have at least one 0 at the same bit position */
3793 n_tv4 = tarval_not(tv4);
3794 if (tv3 != tarval_and(tv3, n_tv4)) {
3795 /* bit in the or_mask is outside the and_mask */
3799 n_tv2 = tarval_not(tv2);
3800 if (tv1 != tarval_and(tv1, n_tv2)) {
3801 /* bit in the or_mask is outside the and_mask */
3805 /* ok, all conditions met */
3806 block = get_irn_n(or, -1);
3808 new_and = new_r_And(current_ir_graph, block,
3809 value, new_r_Const(current_ir_graph, block, mode, tarval_and(tv4, tv2)), mode);
3811 new_const = new_r_Const(current_ir_graph, block, mode, tarval_or(tv3, tv1));
3813 set_Or_left(or, new_and);
3814 set_Or_right(or, new_const);
3816 /* check for more */
3818 } /* transform_node_Or_bf_store */
3821 * Optimize an Or(shl(x, c), shr(x, bits - c)) into a Rot
3823 static ir_node *transform_node_Or_Rot(ir_node *or) {
3824 ir_mode *mode = get_irn_mode(or);
3825 ir_node *shl, *shr, *block;
3826 ir_node *irn, *x, *c1, *c2, *v, *sub, *n;
3829 if (! mode_is_int(mode))
3832 shl = get_binop_left(or);
3833 shr = get_binop_right(or);
3835 if (get_irn_op(shl) == op_Shr) {
3836 if (get_irn_op(shr) != op_Shl)
3842 } else if (get_irn_op(shl) != op_Shl) {
3844 } else if (get_irn_op(shr) != op_Shr) {
3847 x = get_Shl_left(shl);
3848 if (x != get_Shr_left(shr))
3851 c1 = get_Shl_right(shl);
3852 c2 = get_Shr_right(shr);
3853 if (get_irn_op(c1) == op_Const && get_irn_op(c2) == op_Const) {
3854 tv1 = get_Const_tarval(c1);
3855 if (! tarval_is_long(tv1))
3858 tv2 = get_Const_tarval(c2);
3859 if (! tarval_is_long(tv2))
3862 if (get_tarval_long(tv1) + get_tarval_long(tv2)
3863 != get_mode_size_bits(mode))
3866 /* yet, condition met */
3867 block = get_irn_n(or, -1);
3869 n = new_r_Rot(current_ir_graph, block, x, c1, mode);
3871 DBG_OPT_ALGSIM1(or, shl, shr, n, FS_OPT_OR_SHFT_TO_ROT);
3873 } else if (get_irn_op(c1) == op_Sub) {
3877 if (get_Sub_right(sub) != v)
3880 c1 = get_Sub_left(sub);
3881 if (get_irn_op(c1) != op_Const)
3884 tv1 = get_Const_tarval(c1);
3885 if (! tarval_is_long(tv1))
3888 if (get_tarval_long(tv1) != get_mode_size_bits(mode))
3891 /* yet, condition met */
3892 block = get_nodes_block(or);
3894 /* a Rot right is not supported, so use a rot left */
3895 n = new_r_Rot(current_ir_graph, block, x, sub, mode);
3897 DBG_OPT_ALGSIM0(or, n, FS_OPT_OR_SHFT_TO_ROT);
3899 } else if (get_irn_op(c2) == op_Sub) {
3903 c1 = get_Sub_left(sub);
3904 if (get_irn_op(c1) != op_Const)
3907 tv1 = get_Const_tarval(c1);
3908 if (! tarval_is_long(tv1))
3911 if (get_tarval_long(tv1) != get_mode_size_bits(mode))
3914 /* yet, condition met */
3915 block = get_irn_n(or, -1);
3918 n = new_r_Rot(current_ir_graph, block, x, v, mode);
3920 DBG_OPT_ALGSIM0(or, n, FS_OPT_OR_SHFT_TO_ROT);
3925 } /* transform_node_Or_Rot */
3930 static ir_node *transform_node_Or(ir_node *n) {
3931 ir_node *c, *oldn = n;
3932 ir_node *a = get_Or_left(n);
3933 ir_node *b = get_Or_right(n);
3935 /* we can evaluate 2 Projs of the same Cmp */
3936 if(get_irn_mode(n) == mode_b && is_Proj(a) && is_Proj(b)) {
3937 ir_node *pred_a = get_Proj_pred(a);
3938 ir_node *pred_b = get_Proj_pred(b);
3939 if(pred_a == pred_b) {
3940 dbg_info *dbgi = get_irn_dbg_info(n);
3941 ir_node *block = get_nodes_block(pred_a);
3942 pn_Cmp pn_a = get_Proj_proj(a);
3943 pn_Cmp pn_b = get_Proj_proj(b);
3944 /* yes, we can simply calculate with pncs */
3945 pn_Cmp new_pnc = pn_a | pn_b;
3947 return new_rd_Proj(dbgi, current_ir_graph, block, pred_a, mode_b,
3952 HANDLE_BINOP_PHI(tarval_or, a,b,c);
3954 n = transform_node_Or_bf_store(n);
3955 n = transform_node_Or_Rot(n);
3959 n = transform_bitwise_distributive(n, transform_node_Or);
3962 } /* transform_node_Or */
3966 static ir_node *transform_node(ir_node *n);
3969 * Optimize (a >> c1) >> c2), works for Shr, Shrs, Shl.
3971 * Should be moved to reassociation?
3973 static ir_node *transform_node_shift(ir_node *n) {
3974 ir_node *left, *right;
3975 tarval *tv1, *tv2, *res;
3977 int modulo_shf, flag;
3979 left = get_binop_left(n);
3981 /* different operations */
3982 if (get_irn_op(left) != get_irn_op(n))
3985 right = get_binop_right(n);
3986 tv1 = value_of(right);
3987 if (tv1 == tarval_bad)
3990 tv2 = value_of(get_binop_right(left));
3991 if (tv2 == tarval_bad)
3994 res = tarval_add(tv1, tv2);
3996 /* beware: a simple replacement works only, if res < modulo shift */
3997 mode = get_irn_mode(n);
4001 modulo_shf = get_mode_modulo_shift(mode);
4002 if (modulo_shf > 0) {
4003 tarval *modulo = new_tarval_from_long(modulo_shf, get_tarval_mode(res));
4005 if (tarval_cmp(res, modulo) & pn_Cmp_Lt)
4011 /* ok, we can replace it */
4012 ir_node *in[2], *irn, *block = get_irn_n(n, -1);
4014 in[0] = get_binop_left(left);
4015 in[1] = new_r_Const(current_ir_graph, block, get_tarval_mode(res), res);
4017 irn = new_ir_node(NULL, current_ir_graph, block, get_irn_op(n), mode, 2, in);
4019 DBG_OPT_ALGSIM0(n, irn, FS_OPT_REASSOC_SHIFT);
4021 return transform_node(irn);
4024 } /* transform_node_shift */
4029 static ir_node *transform_node_Shr(ir_node *n) {
4030 ir_node *c, *oldn = n;
4031 ir_node *a = get_Shr_left(n);
4032 ir_node *b = get_Shr_right(n);
4034 HANDLE_BINOP_PHI(tarval_shr, a, b, c);
4035 return transform_node_shift(n);
4036 } /* transform_node_Shr */
4041 static ir_node *transform_node_Shrs(ir_node *n) {
4042 ir_node *c, *oldn = n;
4043 ir_node *a = get_Shrs_left(n);
4044 ir_node *b = get_Shrs_right(n);
4046 HANDLE_BINOP_PHI(tarval_shrs, a, b, c);
4047 return transform_node_shift(n);
4048 } /* transform_node_Shrs */
4053 static ir_node *transform_node_Shl(ir_node *n) {
4054 ir_node *c, *oldn = n;
4055 ir_node *a = get_Shl_left(n);
4056 ir_node *b = get_Shl_right(n);
4058 HANDLE_BINOP_PHI(tarval_shl, a, b, c);
4059 return transform_node_shift(n);
4060 } /* transform_node_Shl */
4063 * Remove dead blocks and nodes in dead blocks
4064 * in keep alive list. We do not generate a new End node.
4066 static ir_node *transform_node_End(ir_node *n) {
4067 int i, j, n_keepalives = get_End_n_keepalives(n);
4070 NEW_ARR_A(ir_node *, in, n_keepalives);
4072 for (i = j = 0; i < n_keepalives; ++i) {
4073 ir_node *ka = get_End_keepalive(n, i);
4075 if (! is_Block_dead(ka)) {
4079 } else if (is_irn_pinned_in_irg(ka) && is_Block_dead(get_nodes_block(ka))) {
4082 /* FIXME: beabi need to keep a Proj(M) */
4083 if (is_Phi(ka) || is_irn_keep(ka) || is_Proj(ka))
4086 if (j != n_keepalives)
4087 set_End_keepalives(n, j, in);
4089 } /* transform_node_End */
4091 /** returns 1 if a == -b */
4092 static int is_negated_value(ir_node *a, ir_node *b) {
4093 if(is_Minus(a) && get_Minus_op(a) == b)
4095 if(is_Minus(b) && get_Minus_op(b) == a)
4097 if(is_Sub(a) && is_Sub(b)) {
4098 ir_node *a_left = get_Sub_left(a);
4099 ir_node *a_right = get_Sub_right(a);
4100 ir_node *b_left = get_Sub_left(b);
4101 ir_node *b_right = get_Sub_right(b);
4103 if(a_left == b_right && a_right == b_left)
4111 * Optimize a Mux into some simpler cases.
4113 static ir_node *transform_node_Mux(ir_node *n) {
4114 ir_node *oldn = n, *sel = get_Mux_sel(n);
4115 ir_mode *mode = get_irn_mode(n);
4117 if (mode == mode_b) {
4118 ir_node *t = get_Mux_true(n);
4119 ir_node *f = get_Mux_false(n);
4120 dbg_info *dbg = get_irn_dbg_info(n);
4121 ir_node *block = get_irn_n(n, -1);
4122 ir_graph *irg = current_ir_graph;
4125 tarval *tv_t = get_Const_tarval(t);
4126 if (tv_t == tarval_b_true) {
4128 assert(get_Const_tarval(f) == tarval_b_false);
4131 return new_rd_Or(dbg, irg, block, sel, f, mode_b);
4134 ir_node* not_sel = new_rd_Not(dbg, irg, block, sel, mode_b);
4135 assert(tv_t == tarval_b_false);
4137 assert(get_Const_tarval(f) == tarval_b_true);
4140 return new_rd_And(dbg, irg, block, not_sel, f, mode_b);
4143 } else if (is_Const(f)) {
4144 tarval *tv_f = get_Const_tarval(f);
4145 if (tv_f == tarval_b_true) {
4146 ir_node* not_sel = new_rd_Not(dbg, irg, block, sel, mode_b);
4147 return new_rd_Or(dbg, irg, block, not_sel, t, mode_b);
4149 assert(tv_f == tarval_b_false);
4150 return new_rd_And(dbg, irg, block, sel, t, mode_b);
4155 if (get_irn_op(sel) == op_Proj && !mode_honor_signed_zeros(mode)) {
4156 ir_node *cmp = get_Proj_pred(sel);
4157 long pn = get_Proj_proj(sel);
4158 ir_node *f = get_Mux_false(n);
4159 ir_node *t = get_Mux_true(n);
4162 * Note: normalization puts the constant on the right side,
4163 * so we check only one case.
4165 * Note further that these optimization work even for floating point
4166 * with NaN's because -NaN == NaN.
4167 * However, if +0 and -0 is handled differently, we cannot use the first
4170 if (get_irn_op(cmp) == op_Cmp
4171 && classify_Const(get_Cmp_right(cmp)) == CNST_NULL) {
4172 ir_node *block = get_irn_n(n, -1);
4174 if(is_negated_value(f, t)) {
4175 ir_node *cmp_left = get_Cmp_left(cmp);
4177 /* Psi(a >= 0, a, -a) = Psi(a <= 0, -a, a) ==> Abs(a) */
4178 if ( (cmp_left == t && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt))
4179 || (cmp_left == f && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt)))
4181 n = new_rd_Abs(get_irn_dbg_info(n), current_ir_graph, block,
4183 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
4185 /* Psi(a <= 0, a, -a) = Psi(a >= 0, -a, a) ==> -Abs(a) */
4186 } else if ((cmp_left == t && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt))
4187 || (cmp_left == f && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt)))
4189 n = new_rd_Abs(get_irn_dbg_info(n), current_ir_graph, block,
4191 n = new_rd_Minus(get_irn_dbg_info(n), current_ir_graph,
4193 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
4198 if (mode_is_int(mode) && mode_is_signed(mode) &&
4199 get_mode_arithmetic(mode) == irma_twos_complement) {
4200 ir_node *x = get_Cmp_left(cmp);
4202 /* the following optimization works only with signed integer two-complement mode */
4204 if (mode == get_irn_mode(x)) {
4206 * FIXME: this restriction is two rigid, as it would still
4207 * work if mode(x) = Hs and mode == Is, but at least it removes
4210 if ((pn == pn_Cmp_Lt || pn == pn_Cmp_Le) &&
4211 classify_Const(t) == CNST_ALL_ONE &&
4212 classify_Const(f) == CNST_NULL) {
4214 * Mux(x:T </<= 0, 0, -1) -> Shrs(x, sizeof_bits(T) - 1)
4218 n = new_rd_Shrs(get_irn_dbg_info(n),
4219 current_ir_graph, block, x,
4220 new_r_Const_long(current_ir_graph, block, mode_Iu,
4221 get_mode_size_bits(mode) - 1),
4223 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_SHR);
4225 } else if ((pn == pn_Cmp_Gt || pn == pn_Cmp_Ge) &&
4226 classify_Const(t) == CNST_ONE &&
4227 classify_Const(f) == CNST_NULL) {
4229 * Mux(x:T >/>= 0, 0, 1) -> Shr(-x, sizeof_bits(T) - 1)
4233 n = new_rd_Shr(get_irn_dbg_info(n),
4234 current_ir_graph, block,
4235 new_r_Minus(current_ir_graph, block, x, mode),
4236 new_r_Const_long(current_ir_graph, block, mode_Iu,
4237 get_mode_size_bits(mode) - 1),
4239 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_SHR);
4246 return arch_transform_node_Mux(n);
4247 } /* transform_node_Mux */
4250 * Optimize a Psi into some simpler cases.
4252 static ir_node *transform_node_Psi(ir_node *n) {
4254 return transform_node_Mux(n);
4257 } /* transform_node_Psi */
4260 * Tries several [inplace] [optimizing] transformations and returns an
4261 * equivalent node. The difference to equivalent_node() is that these
4262 * transformations _do_ generate new nodes, and thus the old node must
4263 * not be freed even if the equivalent node isn't the old one.
4265 static ir_node *transform_node(ir_node *n) {
4269 * Transform_node is the only "optimizing transformation" that might
4270 * return a node with a different opcode. We iterate HERE until fixpoint
4271 * to get the final result.
4275 if (n->op->ops.transform_node)
4276 n = n->op->ops.transform_node(n);
4277 } while (oldn != n);
4280 } /* transform_node */
4283 * Sets the default transform node operation for an ir_op_ops.
4285 * @param code the opcode for the default operation
4286 * @param ops the operations initialized
4291 static ir_op_ops *firm_set_default_transform_node(ir_opcode code, ir_op_ops *ops)
4295 ops->transform_node = transform_node_##a; \
4329 } /* firm_set_default_transform_node */
4332 /* **************** Common Subexpression Elimination **************** */
4334 /** The size of the hash table used, should estimate the number of nodes
4336 #define N_IR_NODES 512
4338 /** Compares the attributes of two Const nodes. */
4339 static int node_cmp_attr_Const(ir_node *a, ir_node *b) {
4340 return (get_Const_tarval(a) != get_Const_tarval(b))
4341 || (get_Const_type(a) != get_Const_type(b));
4342 } /* node_cmp_attr_Const */
4344 /** Compares the attributes of two Proj nodes. */
4345 static int node_cmp_attr_Proj(ir_node *a, ir_node *b) {
4346 return get_irn_proj_attr(a) != get_irn_proj_attr(b);
4347 } /* node_cmp_attr_Proj */
4349 /** Compares the attributes of two Filter nodes. */
4350 static int node_cmp_attr_Filter(ir_node *a, ir_node *b) {
4351 return get_Filter_proj(a) != get_Filter_proj(b);
4352 } /* node_cmp_attr_Filter */
4354 /** Compares the attributes of two Alloc nodes. */
4355 static int node_cmp_attr_Alloc(ir_node *a, ir_node *b) {
4356 const alloc_attr *pa = get_irn_alloc_attr(a);
4357 const alloc_attr *pb = get_irn_alloc_attr(b);
4358 return (pa->where != pb->where) || (pa->type != pb->type);
4359 } /* node_cmp_attr_Alloc */
4361 /** Compares the attributes of two Free nodes. */
4362 static int node_cmp_attr_Free(ir_node *a, ir_node *b) {
4363 const free_attr *pa = get_irn_free_attr(a);
4364 const free_attr *pb = get_irn_free_attr(b);
4365 return (pa->where != pb->where) || (pa->type != pb->type);
4366 } /* node_cmp_attr_Free */
4368 /** Compares the attributes of two SymConst nodes. */
4369 static int node_cmp_attr_SymConst(ir_node *a, ir_node *b) {
4370 const symconst_attr *pa = get_irn_symconst_attr(a);
4371 const symconst_attr *pb = get_irn_symconst_attr(b);
4372 return (pa->num != pb->num)
4373 || (pa->sym.type_p != pb->sym.type_p)
4374 || (pa->tp != pb->tp);
4375 } /* node_cmp_attr_SymConst */
4377 /** Compares the attributes of two Call nodes. */
4378 static int node_cmp_attr_Call(ir_node *a, ir_node *b) {
4379 return (get_irn_call_attr(a) != get_irn_call_attr(b));
4380 } /* node_cmp_attr_Call */
4382 /** Compares the attributes of two Sel nodes. */
4383 static int node_cmp_attr_Sel(ir_node *a, ir_node *b) {
4384 const ir_entity *a_ent = get_Sel_entity(a);
4385 const ir_entity *b_ent = get_Sel_entity(b);
4387 (a_ent->kind != b_ent->kind) ||
4388 (a_ent->name != b_ent->name) ||
4389 (a_ent->owner != b_ent->owner) ||
4390 (a_ent->ld_name != b_ent->ld_name) ||
4391 (a_ent->type != b_ent->type);
4392 } /* node_cmp_attr_Sel */
4394 /** Compares the attributes of two Phi nodes. */
4395 static int node_cmp_attr_Phi(ir_node *a, ir_node *b) {
4396 /* we can only enter this function if both nodes have the same number of inputs,
4397 hence it is enough to check if one of them is a Phi0 */
4399 /* check the Phi0 attribute */
4400 return get_irn_phi0_attr(a) != get_irn_phi0_attr(b);
4403 } /* node_cmp_attr_Phi */
4405 /** Compares the attributes of two Conv nodes. */
4406 static int node_cmp_attr_Conv(ir_node *a, ir_node *b) {
4407 return get_Conv_strict(a) != get_Conv_strict(b);
4408 } /* node_cmp_attr_Conv */
4410 /** Compares the attributes of two Cast nodes. */
4411 static int node_cmp_attr_Cast(ir_node *a, ir_node *b) {
4412 return get_Cast_type(a) != get_Cast_type(b);
4413 } /* node_cmp_attr_Cast */
4415 /** Compares the attributes of two Load nodes. */
4416 static int node_cmp_attr_Load(ir_node *a, ir_node *b) {
4417 if (get_Load_volatility(a) == volatility_is_volatile ||
4418 get_Load_volatility(b) == volatility_is_volatile)
4419 /* NEVER do CSE on volatile Loads */
4421 /* do not CSE Loads with different alignment. Be conservative. */
4422 if (get_Load_align(a) != get_Load_align(b))
4425 return get_Load_mode(a) != get_Load_mode(b);
4426 } /* node_cmp_attr_Load */
4428 /** Compares the attributes of two Store nodes. */
4429 static int node_cmp_attr_Store(ir_node *a, ir_node *b) {
4430 /* do not CSE Stores with different alignment. Be conservative. */
4431 if (get_Store_align(a) != get_Store_align(b))
4434 /* NEVER do CSE on volatile Stores */
4435 return (get_Store_volatility(a) == volatility_is_volatile ||
4436 get_Store_volatility(b) == volatility_is_volatile);
4437 } /* node_cmp_attr_Store */
4439 /** Compares the attributes of two Confirm nodes. */
4440 static int node_cmp_attr_Confirm(ir_node *a, ir_node *b) {
4441 return (get_Confirm_cmp(a) != get_Confirm_cmp(b));
4442 } /* node_cmp_attr_Confirm */
4444 /** Compares the attributes of two ASM nodes. */
4445 static int node_cmp_attr_ASM(ir_node *a, ir_node *b) {
4447 const ir_asm_constraint *ca;
4448 const ir_asm_constraint *cb;
4451 if (get_ASM_text(a) != get_ASM_text(b))
4454 /* Should we really check the constraints here? Should be better, but is strange. */
4455 n = get_ASM_n_input_constraints(a);
4456 if (n != get_ASM_n_input_constraints(b))
4459 ca = get_ASM_input_constraints(a);
4460 cb = get_ASM_input_constraints(b);
4461 for (i = 0; i < n; ++i) {
4462 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
4466 n = get_ASM_n_output_constraints(a);
4467 if (n != get_ASM_n_output_constraints(b))
4470 ca = get_ASM_output_constraints(a);
4471 cb = get_ASM_output_constraints(b);
4472 for (i = 0; i < n; ++i) {
4473 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
4477 n = get_ASM_n_clobbers(a);
4478 if (n != get_ASM_n_clobbers(b))
4481 cla = get_ASM_clobbers(a);
4482 clb = get_ASM_clobbers(b);
4483 for (i = 0; i < n; ++i) {
4484 if (cla[i] != clb[i])
4488 } /* node_cmp_attr_ASM */
4491 * Set the default node attribute compare operation for an ir_op_ops.
4493 * @param code the opcode for the default operation
4494 * @param ops the operations initialized
4499 static ir_op_ops *firm_set_default_node_cmp_attr(ir_opcode code, ir_op_ops *ops)
4503 ops->node_cmp_attr = node_cmp_attr_##a; \
4528 } /* firm_set_default_node_cmp_attr */
4531 * Compare function for two nodes in the hash table. Gets two
4532 * nodes as parameters. Returns 0 if the nodes are a cse.
4534 int identities_cmp(const void *elt, const void *key) {
4541 if (a == b) return 0;
4543 if ((get_irn_op(a) != get_irn_op(b)) ||
4544 (get_irn_mode(a) != get_irn_mode(b))) return 1;
4546 /* compare if a's in and b's in are of equal length */
4547 irn_arity_a = get_irn_intra_arity (a);
4548 if (irn_arity_a != get_irn_intra_arity(b))
4551 /* for block-local cse and op_pin_state_pinned nodes: */
4552 if (!get_opt_global_cse() || (get_irn_pinned(a) == op_pin_state_pinned)) {
4553 if (get_irn_intra_n(a, -1) != get_irn_intra_n(b, -1))
4557 /* compare a->in[0..ins] with b->in[0..ins] */
4558 for (i = 0; i < irn_arity_a; i++)
4559 if (get_irn_intra_n(a, i) != get_irn_intra_n(b, i))
4563 * here, we already now that the nodes are identical except their
4566 if (a->op->ops.node_cmp_attr)
4567 return a->op->ops.node_cmp_attr(a, b);
4570 } /* identities_cmp */
4573 * Calculate a hash value of a node.
4575 unsigned ir_node_hash(ir_node *node) {
4579 if (node->op == op_Const) {
4580 /* special value for const, as they only differ in their tarval. */
4581 h = HASH_PTR(node->attr.con.tv);
4582 h = 9*h + HASH_PTR(get_irn_mode(node));
4583 } else if (node->op == op_SymConst) {
4584 /* special value for const, as they only differ in their symbol. */
4585 h = HASH_PTR(node->attr.symc.sym.type_p);
4586 h = 9*h + HASH_PTR(get_irn_mode(node));
4589 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
4590 h = irn_arity = get_irn_intra_arity(node);
4592 /* consider all in nodes... except the block if not a control flow. */
4593 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; i++) {
4594 h = 9*h + HASH_PTR(get_irn_intra_n(node, i));
4598 h = 9*h + HASH_PTR(get_irn_mode(node));
4600 h = 9*h + HASH_PTR(get_irn_op(node));
4604 } /* ir_node_hash */
4606 pset *new_identities(void) {
4607 return new_pset(identities_cmp, N_IR_NODES);
4608 } /* new_identities */
4610 void del_identities(pset *value_table) {
4611 del_pset(value_table);
4612 } /* del_identities */
4615 * Return the canonical node computing the same value as n.
4617 * @param value_table The value table
4618 * @param n The node to lookup
4620 * Looks up the node in a hash table.
4622 * For Const nodes this is performed in the constructor, too. Const
4623 * nodes are extremely time critical because of their frequent use in
4624 * constant string arrays.
4626 static INLINE ir_node *identify(pset *value_table, ir_node *n) {
4629 if (!value_table) return n;
4631 if (get_opt_reassociation()) {
4632 if (is_op_commutative(get_irn_op(n))) {
4633 ir_node *l = get_binop_left(n);
4634 ir_node *r = get_binop_right(n);
4636 /* for commutative operators perform a OP b == b OP a */
4637 if (get_irn_idx(l) > get_irn_idx(r)) {
4638 set_binop_left(n, r);
4639 set_binop_right(n, l);
4644 o = pset_find(value_table, n, ir_node_hash(n));
4653 * During construction we set the op_pin_state_pinned flag in the graph right when the
4654 * optimization is performed. The flag turning on procedure global cse could
4655 * be changed between two allocations. This way we are safe.
4657 static INLINE ir_node *identify_cons(pset *value_table, ir_node *n) {
4660 n = identify(value_table, n);
4661 if (get_irn_n(old, -1) != get_irn_n(n, -1))
4662 set_irg_pinned(current_ir_graph, op_pin_state_floats);
4664 } /* identify_cons */
4667 * Return the canonical node computing the same value as n.
4668 * Looks up the node in a hash table, enters it in the table
4669 * if it isn't there yet.
4671 ir_node *identify_remember(pset *value_table, ir_node *n) {
4674 if (!value_table) return n;
4676 if (get_opt_reassociation()) {
4677 if (is_op_commutative(get_irn_op(n))) {
4678 ir_node *l = get_binop_left(n);
4679 ir_node *r = get_binop_right(n);
4680 int l_idx = get_irn_idx(l);
4681 int r_idx = get_irn_idx(r);
4683 /* For commutative operators perform a OP b == b OP a but keep
4684 constants on the RIGHT side. This helps greatly in some optimizations.
4685 Moreover we use the idx number to make the form deterministic. */
4686 if (is_irn_constlike(l))
4688 if (is_irn_constlike(r))
4690 if (l_idx < r_idx) {
4691 set_binop_left(n, r);
4692 set_binop_right(n, l);
4697 /* lookup or insert in hash table with given hash key. */
4698 o = pset_insert(value_table, n, ir_node_hash(n));
4705 } /* identify_remember */
4707 /* Add a node to the identities value table. */
4708 void add_identities(pset *value_table, ir_node *node) {
4709 if (get_opt_cse() && is_no_Block(node))
4710 identify_remember(value_table, node);
4711 } /* add_identities */
4713 /* Visit each node in the value table of a graph. */
4714 void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env) {
4716 ir_graph *rem = current_ir_graph;
4718 current_ir_graph = irg;
4719 foreach_pset(irg->value_table, node)
4721 current_ir_graph = rem;
4722 } /* visit_all_identities */
4725 * Garbage in, garbage out. If a node has a dead input, i.e., the
4726 * Bad node is input to the node, return the Bad node.
4728 static INLINE ir_node *gigo(ir_node *node) {
4730 ir_op *op = get_irn_op(node);
4732 /* remove garbage blocks by looking at control flow that leaves the block
4733 and replacing the control flow by Bad. */
4734 if (get_irn_mode(node) == mode_X) {
4735 ir_node *block = get_nodes_block(skip_Proj(node));
4737 /* Don't optimize nodes in immature blocks. */
4738 if (!get_Block_matured(block)) return node;
4739 /* Don't optimize End, may have Bads. */
4740 if (op == op_End) return node;
4742 if (is_Block(block)) {
4743 irn_arity = get_irn_arity(block);
4744 for (i = 0; i < irn_arity; i++) {
4745 if (!is_Bad(get_irn_n(block, i)))
4748 if (i == irn_arity) {
4749 ir_graph *irg = get_irn_irg(block);
4750 /* the start block is never dead */
4751 if (block != get_irg_start_block(irg)
4752 && block != get_irg_end_block(irg))
4758 /* Blocks, Phis and Tuples may have dead inputs, e.g., if one of the
4759 blocks predecessors is dead. */
4760 if (op != op_Block && op != op_Phi && op != op_Tuple) {
4761 irn_arity = get_irn_arity(node);
4764 * Beware: we can only read the block of a non-floating node.
4766 if (is_irn_pinned_in_irg(node) &&
4767 is_Block_dead(get_nodes_block(node)))
4770 for (i = 0; i < irn_arity; i++) {
4771 ir_node *pred = get_irn_n(node, i);
4776 /* Propagating Unknowns here seems to be a bad idea, because
4777 sometimes we need a node as a input and did not want that
4779 However, it might be useful to move this into a later phase
4780 (if you think that optimizing such code is useful). */
4781 if (is_Unknown(pred) && mode_is_data(get_irn_mode(node)))
4782 return new_Unknown(get_irn_mode(node));
4787 /* With this code we violate the agreement that local_optimize
4788 only leaves Bads in Block, Phi and Tuple nodes. */
4789 /* If Block has only Bads as predecessors it's garbage. */
4790 /* If Phi has only Bads as predecessors it's garbage. */
4791 if ((op == op_Block && get_Block_matured(node)) || op == op_Phi) {
4792 irn_arity = get_irn_arity(node);
4793 for (i = 0; i < irn_arity; i++) {
4794 if (!is_Bad(get_irn_n(node, i))) break;
4796 if (i == irn_arity) node = new_Bad();
4803 * These optimizations deallocate nodes from the obstack.
4804 * It can only be called if it is guaranteed that no other nodes
4805 * reference this one, i.e., right after construction of a node.
4807 * @param n The node to optimize
4809 * current_ir_graph must be set to the graph of the node!
4811 ir_node *optimize_node(ir_node *n) {
4814 ir_opcode iro = get_irn_opcode(n);
4816 /* Always optimize Phi nodes: part of the construction. */
4817 if ((!get_opt_optimize()) && (iro != iro_Phi)) return n;
4819 /* constant expression evaluation / constant folding */
4820 if (get_opt_constant_folding()) {
4821 /* neither constants nor Tuple values can be evaluated */
4822 if (iro != iro_Const && (get_irn_mode(n) != mode_T)) {
4823 unsigned fp_model = get_irg_fp_model(current_ir_graph);
4824 int old_fp_mode = tarval_enable_fp_ops((fp_model & fp_strict_algebraic) == 0);
4825 /* try to evaluate */
4826 tv = computed_value(n);
4827 if (tv != tarval_bad) {
4829 ir_type *old_tp = get_irn_type(n);
4830 int i, arity = get_irn_arity(n);
4834 * Try to recover the type of the new expression.
4836 for (i = 0; i < arity && !old_tp; ++i)
4837 old_tp = get_irn_type(get_irn_n(n, i));
4840 * we MUST copy the node here temporary, because it's still needed
4841 * for DBG_OPT_CSTEVAL
4843 node_size = offsetof(ir_node, attr) + n->op->attr_size;
4844 oldn = alloca(node_size);
4846 memcpy(oldn, n, node_size);
4847 CLONE_ARR_A(ir_node *, oldn->in, n->in);
4849 /* ARG, copy the in array, we need it for statistics */
4850 memcpy(oldn->in, n->in, ARR_LEN(n->in) * sizeof(n->in[0]));
4852 /* note the inplace edges module */
4853 edges_node_deleted(n, current_ir_graph);
4855 /* evaluation was successful -- replace the node. */
4856 irg_kill_node(current_ir_graph, n);
4857 nw = new_Const(get_tarval_mode (tv), tv);
4859 if (old_tp && get_type_mode(old_tp) == get_tarval_mode (tv))
4860 set_Const_type(nw, old_tp);
4861 DBG_OPT_CSTEVAL(oldn, nw);
4862 tarval_enable_fp_ops(old_fp_mode);
4865 tarval_enable_fp_ops(old_fp_mode);
4869 /* remove unnecessary nodes */
4870 if (get_opt_constant_folding() ||
4871 (iro == iro_Phi) || /* always optimize these nodes. */
4873 (iro == iro_Proj) ||
4874 (iro == iro_Block) ) /* Flags tested local. */
4875 n = equivalent_node(n);
4877 /* Common Subexpression Elimination.
4879 * Checks whether n is already available.
4880 * The block input is used to distinguish different subexpressions. Right
4881 * now all nodes are op_pin_state_pinned to blocks, i.e., the CSE only finds common
4882 * subexpressions within a block.
4885 n = identify_cons(current_ir_graph->value_table, n);
4888 edges_node_deleted(oldn, current_ir_graph);
4890 /* We found an existing, better node, so we can deallocate the old node. */
4891 irg_kill_node(current_ir_graph, oldn);
4895 /* Some more constant expression evaluation that does not allow to
4897 iro = get_irn_opcode(n);
4898 if (get_opt_constant_folding() ||
4899 (iro == iro_Cond) ||
4900 (iro == iro_Proj)) /* Flags tested local. */
4901 n = transform_node(n);
4903 /* Remove nodes with dead (Bad) input.
4904 Run always for transformation induced Bads. */
4907 /* Now we have a legal, useful node. Enter it in hash table for CSE */
4908 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block)) {
4909 n = identify_remember(current_ir_graph->value_table, n);
4913 } /* optimize_node */
4917 * These optimizations never deallocate nodes (in place). This can cause dead
4918 * nodes lying on the obstack. Remove these by a dead node elimination,
4919 * i.e., a copying garbage collection.
4921 ir_node *optimize_in_place_2(ir_node *n) {
4924 ir_opcode iro = get_irn_opcode(n);
4926 if (!get_opt_optimize() && (get_irn_op(n) != op_Phi)) return n;
4928 /* constant expression evaluation / constant folding */
4929 if (get_opt_constant_folding()) {
4930 /* neither constants nor Tuple values can be evaluated */
4931 if (iro != iro_Const && get_irn_mode(n) != mode_T) {
4932 unsigned fp_model = get_irg_fp_model(current_ir_graph);
4933 int old_fp_mode = tarval_enable_fp_ops((fp_model & fp_strict_algebraic) == 0);
4934 /* try to evaluate */
4935 tv = computed_value(n);
4936 if (tv != tarval_bad) {
4937 /* evaluation was successful -- replace the node. */
4938 ir_type *old_tp = get_irn_type(n);
4939 int i, arity = get_irn_arity(n);
4942 * Try to recover the type of the new expression.
4944 for (i = 0; i < arity && !old_tp; ++i)
4945 old_tp = get_irn_type(get_irn_n(n, i));
4947 n = new_Const(get_tarval_mode(tv), tv);
4949 if (old_tp && get_type_mode(old_tp) == get_tarval_mode(tv))
4950 set_Const_type(n, old_tp);
4952 DBG_OPT_CSTEVAL(oldn, n);
4953 tarval_enable_fp_ops(old_fp_mode);
4956 tarval_enable_fp_ops(old_fp_mode);
4960 /* remove unnecessary nodes */
4961 if (get_opt_constant_folding() ||
4962 (iro == iro_Phi) || /* always optimize these nodes. */
4963 (iro == iro_Id) || /* ... */
4964 (iro == iro_Proj) || /* ... */
4965 (iro == iro_Block) ) /* Flags tested local. */
4966 n = equivalent_node(n);
4968 /** common subexpression elimination **/
4969 /* Checks whether n is already available. */
4970 /* The block input is used to distinguish different subexpressions. Right
4971 now all nodes are op_pin_state_pinned to blocks, i.e., the cse only finds common
4972 subexpressions within a block. */
4973 if (get_opt_cse()) {
4974 n = identify(current_ir_graph->value_table, n);
4977 /* Some more constant expression evaluation. */
4978 iro = get_irn_opcode(n);
4979 if (get_opt_constant_folding() ||
4980 (iro == iro_Cond) ||
4981 (iro == iro_Proj)) /* Flags tested local. */
4982 n = transform_node(n);
4984 /* Remove nodes with dead (Bad) input.
4985 Run always for transformation induced Bads. */
4988 /* Now we can verify the node, as it has no dead inputs any more. */
4991 /* Now we have a legal, useful node. Enter it in hash table for cse.
4992 Blocks should be unique anyways. (Except the successor of start:
4993 is cse with the start block!) */
4994 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block))
4995 n = identify_remember(current_ir_graph->value_table, n);
4998 } /* optimize_in_place_2 */
5001 * Wrapper for external use, set proper status bits after optimization.
5003 ir_node *optimize_in_place(ir_node *n) {
5004 /* Handle graph state */
5005 assert(get_irg_phase_state(current_ir_graph) != phase_building);
5007 if (get_opt_global_cse())
5008 set_irg_pinned(current_ir_graph, op_pin_state_floats);
5009 if (get_irg_outs_state(current_ir_graph) == outs_consistent)
5010 set_irg_outs_inconsistent(current_ir_graph);
5012 /* FIXME: Maybe we could also test whether optimizing the node can
5013 change the control graph. */
5014 set_irg_doms_inconsistent(current_ir_graph);
5015 return optimize_in_place_2(n);
5016 } /* optimize_in_place */
5019 * Sets the default operation for an ir_ops.
5021 ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops) {
5022 ops = firm_set_default_computed_value(code, ops);
5023 ops = firm_set_default_equivalent_node(code, ops);
5024 ops = firm_set_default_transform_node(code, ops);
5025 ops = firm_set_default_node_cmp_attr(code, ops);
5026 ops = firm_set_default_get_type(code, ops);
5027 ops = firm_set_default_get_type_attr(code, ops);
5028 ops = firm_set_default_get_entity_attr(code, ops);
5031 } /* firm_set_default_operations */