2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief iropt --- optimizations intertwined with IR construction.
23 * @author Christian Schaefer, Goetz Lindenmaier, Michael Beck
31 #include "irgraph_t.h"
32 #include "iredges_t.h"
39 #include "dbginfo_t.h"
40 #include "iropt_dbg.h"
45 #include "opt_confirms.h"
46 #include "opt_polymorphy.h"
51 /* Make types visible to allow most efficient access */
55 * Returns the tarval of a Const node or tarval_bad for all other nodes.
57 static tarval *default_value_of(const ir_node *n) {
59 return get_Const_tarval(n); /* might return tarval_bad */
64 value_of_func value_of_ptr = default_value_of;
66 /* * Set a new value_of function. */
67 void set_value_of_func(value_of_func func) {
71 value_of_ptr = default_value_of;
75 * Return the value of a Constant.
77 static tarval *computed_value_Const(const ir_node *n) {
78 return get_Const_tarval(n);
79 } /* computed_value_Const */
82 * Return the value of a 'sizeof', 'alignof' or 'offsetof' SymConst.
84 static tarval *computed_value_SymConst(const ir_node *n) {
88 switch (get_SymConst_kind(n)) {
89 case symconst_type_size:
90 type = get_SymConst_type(n);
91 if (get_type_state(type) == layout_fixed)
92 return new_tarval_from_long(get_type_size_bytes(type), get_irn_mode(n));
94 case symconst_type_align:
95 type = get_SymConst_type(n);
96 if (get_type_state(type) == layout_fixed)
97 return new_tarval_from_long(get_type_alignment_bytes(type), get_irn_mode(n));
99 case symconst_ofs_ent:
100 ent = get_SymConst_entity(n);
101 type = get_entity_owner(ent);
102 if (get_type_state(type) == layout_fixed)
103 return new_tarval_from_long(get_entity_offset(ent), get_irn_mode(n));
109 } /* computed_value_SymConst */
112 * Return the value of an Add.
114 static tarval *computed_value_Add(const ir_node *n) {
115 ir_node *a = get_Add_left(n);
116 ir_node *b = get_Add_right(n);
118 tarval *ta = value_of(a);
119 tarval *tb = value_of(b);
121 if ((ta != tarval_bad) && (tb != tarval_bad))
122 return tarval_add(ta, tb);
125 } /* computed_value_Add */
128 * Return the value of a Sub.
129 * Special case: a - a
131 static tarval *computed_value_Sub(const ir_node *n) {
132 ir_mode *mode = get_irn_mode(n);
133 ir_node *a = get_Sub_left(n);
134 ir_node *b = get_Sub_right(n);
139 if (! mode_is_float(mode)) {
142 return get_mode_null(mode);
148 if ((ta != tarval_bad) && (tb != tarval_bad))
149 return tarval_sub(ta, tb, mode);
152 } /* computed_value_Sub */
155 * Return the value of a Carry.
156 * Special : a op 0, 0 op b
158 static tarval *computed_value_Carry(const ir_node *n) {
159 ir_node *a = get_binop_left(n);
160 ir_node *b = get_binop_right(n);
161 ir_mode *m = get_irn_mode(n);
163 tarval *ta = value_of(a);
164 tarval *tb = value_of(b);
166 if ((ta != tarval_bad) && (tb != tarval_bad)) {
168 return tarval_carry() ? get_mode_one(m) : get_mode_null(m);
170 if (tarval_is_null(ta) || tarval_is_null(tb))
171 return get_mode_null(m);
174 } /* computed_value_Carry */
177 * Return the value of a Borrow.
180 static tarval *computed_value_Borrow(const ir_node *n) {
181 ir_node *a = get_binop_left(n);
182 ir_node *b = get_binop_right(n);
183 ir_mode *m = get_irn_mode(n);
185 tarval *ta = value_of(a);
186 tarval *tb = value_of(b);
188 if ((ta != tarval_bad) && (tb != tarval_bad)) {
189 return tarval_cmp(ta, tb) == pn_Cmp_Lt ? get_mode_one(m) : get_mode_null(m);
190 } else if (tarval_is_null(ta)) {
191 return get_mode_null(m);
194 } /* computed_value_Borrow */
197 * Return the value of an unary Minus.
199 static tarval *computed_value_Minus(const ir_node *n) {
200 ir_node *a = get_Minus_op(n);
201 tarval *ta = value_of(a);
203 if (ta != tarval_bad)
204 return tarval_neg(ta);
207 } /* computed_value_Minus */
210 * Return the value of a Mul.
212 static tarval *computed_value_Mul(const ir_node *n) {
213 ir_node *a = get_Mul_left(n);
214 ir_node *b = get_Mul_right(n);
217 tarval *ta = value_of(a);
218 tarval *tb = value_of(b);
220 mode = get_irn_mode(n);
221 if (mode != get_irn_mode(a)) {
222 /* n * n = 2n bit multiplication */
223 ta = tarval_convert_to(ta, mode);
224 tb = tarval_convert_to(tb, mode);
227 if (ta != tarval_bad && tb != tarval_bad) {
228 return tarval_mul(ta, tb);
230 /* a * 0 != 0 if a == NaN or a == Inf */
231 if (!mode_is_float(mode)) {
232 /* a*0 = 0 or 0*b = 0 */
233 if (ta == get_mode_null(mode))
235 if (tb == get_mode_null(mode))
240 } /* computed_value_Mul */
243 * Return the value of an Abs.
245 static tarval *computed_value_Abs(const ir_node *n) {
246 ir_node *a = get_Abs_op(n);
247 tarval *ta = value_of(a);
249 if (ta != tarval_bad)
250 return tarval_abs(ta);
253 } /* computed_value_Abs */
256 * Return the value of an And.
257 * Special case: a & 0, 0 & b
259 static tarval *computed_value_And(const ir_node *n) {
260 ir_node *a = get_And_left(n);
261 ir_node *b = get_And_right(n);
263 tarval *ta = value_of(a);
264 tarval *tb = value_of(b);
266 if ((ta != tarval_bad) && (tb != tarval_bad)) {
267 return tarval_and (ta, tb);
269 if (tarval_is_null(ta)) return ta;
270 if (tarval_is_null(tb)) return tb;
273 } /* computed_value_And */
276 * Return the value of an Or.
277 * Special case: a | 1...1, 1...1 | b
279 static tarval *computed_value_Or(const ir_node *n) {
280 ir_node *a = get_Or_left(n);
281 ir_node *b = get_Or_right(n);
283 tarval *ta = value_of(a);
284 tarval *tb = value_of(b);
286 if ((ta != tarval_bad) && (tb != tarval_bad)) {
287 return tarval_or (ta, tb);
289 if (tarval_is_all_one(ta)) return ta;
290 if (tarval_is_all_one(tb)) return tb;
293 } /* computed_value_Or */
296 * Return the value of an Eor.
298 static tarval *computed_value_Eor(const ir_node *n) {
299 ir_node *a = get_Eor_left(n);
300 ir_node *b = get_Eor_right(n);
305 return get_mode_null(get_irn_mode(n));
310 if ((ta != tarval_bad) && (tb != tarval_bad)) {
311 return tarval_eor (ta, tb);
314 } /* computed_value_Eor */
317 * Return the value of a Not.
319 static tarval *computed_value_Not(const ir_node *n) {
320 ir_node *a = get_Not_op(n);
321 tarval *ta = value_of(a);
323 if (ta != tarval_bad)
324 return tarval_not(ta);
327 } /* computed_value_Not */
330 * Return the value of a Shl.
332 static tarval *computed_value_Shl(const ir_node *n) {
333 ir_node *a = get_Shl_left(n);
334 ir_node *b = get_Shl_right(n);
336 tarval *ta = value_of(a);
337 tarval *tb = value_of(b);
339 if ((ta != tarval_bad) && (tb != tarval_bad)) {
340 return tarval_shl (ta, tb);
343 } /* computed_value_Shl */
346 * Return the value of a Shr.
348 static tarval *computed_value_Shr(const ir_node *n) {
349 ir_node *a = get_Shr_left(n);
350 ir_node *b = get_Shr_right(n);
352 tarval *ta = value_of(a);
353 tarval *tb = value_of(b);
355 if ((ta != tarval_bad) && (tb != tarval_bad)) {
356 return tarval_shr (ta, tb);
359 } /* computed_value_Shr */
362 * Return the value of a Shrs.
364 static tarval *computed_value_Shrs(const ir_node *n) {
365 ir_node *a = get_Shrs_left(n);
366 ir_node *b = get_Shrs_right(n);
368 tarval *ta = value_of(a);
369 tarval *tb = value_of(b);
371 if ((ta != tarval_bad) && (tb != tarval_bad)) {
372 return tarval_shrs (ta, tb);
375 } /* computed_value_Shrs */
378 * Return the value of a Rotl.
380 static tarval *computed_value_Rotl(const ir_node *n) {
381 ir_node *a = get_Rotl_left(n);
382 ir_node *b = get_Rotl_right(n);
384 tarval *ta = value_of(a);
385 tarval *tb = value_of(b);
387 if ((ta != tarval_bad) && (tb != tarval_bad)) {
388 return tarval_rotl(ta, tb);
391 } /* computed_value_Rotl */
394 * Return the value of a Conv.
396 static tarval *computed_value_Conv(const ir_node *n) {
397 ir_node *a = get_Conv_op(n);
398 tarval *ta = value_of(a);
400 if (ta != tarval_bad)
401 return tarval_convert_to(ta, get_irn_mode(n));
404 } /* computed_value_Conv */
407 * Calculate the value of a Mux: can be evaluated, if the
408 * sel and the right input are known.
410 static tarval *computed_value_Mux(const ir_node *n) {
411 ir_node *sel = get_Mux_sel(n);
412 tarval *ts = value_of(sel);
414 if (ts == get_tarval_b_true()) {
415 ir_node *v = get_Mux_true(n);
418 else if (ts == get_tarval_b_false()) {
419 ir_node *v = get_Mux_false(n);
423 } /* computed_value_Mux */
426 * Calculate the value of a Confirm: can be evaluated,
427 * if it has the form Confirm(x, '=', Const).
429 static tarval *computed_value_Confirm(const ir_node *n) {
431 * Beware: we might produce Phi(Confirm(x == true), Confirm(x == false)).
432 * Do NOT optimize them away (jump threading wants them), so wait until
433 * remove_confirm is activated.
435 if (get_opt_remove_confirm()) {
436 if (get_Confirm_cmp(n) == pn_Cmp_Eq) {
437 tarval *tv = value_of(get_Confirm_bound(n));
438 if (tv != tarval_bad)
442 return value_of(get_Confirm_value(n));
443 } /* computed_value_Confirm */
446 * Return the value of a Proj(Cmp).
448 * This performs a first step of unreachable code elimination.
449 * Proj can not be computed, but folding a Cmp above the Proj here is
450 * not as wasteful as folding a Cmp into a Tuple of 16 Consts of which
452 * There are several case where we can evaluate a Cmp node, see later.
454 static tarval *computed_value_Proj_Cmp(const ir_node *n) {
455 ir_node *a = get_Proj_pred(n);
456 ir_node *aa = get_Cmp_left(a);
457 ir_node *ab = get_Cmp_right(a);
458 long proj_nr = get_Proj_proj(n);
461 * BEWARE: a == a is NOT always True for floating Point values, as
462 * NaN != NaN is defined, so we must check this here.
465 !mode_is_float(get_irn_mode(aa)) || proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Gt)
468 /* This is a trick with the bits used for encoding the Cmp
469 Proj numbers, the following statement is not the same:
470 return new_tarval_from_long (proj_nr == pn_Cmp_Eq, mode_b) */
471 return new_tarval_from_long (proj_nr & pn_Cmp_Eq, mode_b);
474 tarval *taa = value_of(aa);
475 tarval *tab = value_of(ab);
476 ir_mode *mode = get_irn_mode(aa);
479 * The predecessors of Cmp are target values. We can evaluate
482 if ((taa != tarval_bad) && (tab != tarval_bad)) {
483 /* strange checks... */
484 pn_Cmp flags = tarval_cmp(taa, tab);
485 if (flags != pn_Cmp_False) {
486 return new_tarval_from_long (proj_nr & flags, mode_b);
489 /* for integer values, we can check against MIN/MAX */
490 else if (mode_is_int(mode)) {
491 /* MIN <=/> x. This results in true/false. */
492 if (taa == get_mode_min(mode)) {
493 /* a compare with the MIN value */
494 if (proj_nr == pn_Cmp_Le)
495 return get_tarval_b_true();
496 else if (proj_nr == pn_Cmp_Gt)
497 return get_tarval_b_false();
499 /* x >=/< MIN. This results in true/false. */
501 if (tab == get_mode_min(mode)) {
502 /* a compare with the MIN value */
503 if (proj_nr == pn_Cmp_Ge)
504 return get_tarval_b_true();
505 else if (proj_nr == pn_Cmp_Lt)
506 return get_tarval_b_false();
508 /* MAX >=/< x. This results in true/false. */
509 else if (taa == get_mode_max(mode)) {
510 if (proj_nr == pn_Cmp_Ge)
511 return get_tarval_b_true();
512 else if (proj_nr == pn_Cmp_Lt)
513 return get_tarval_b_false();
515 /* x <=/> MAX. This results in true/false. */
516 else if (tab == get_mode_max(mode)) {
517 if (proj_nr == pn_Cmp_Le)
518 return get_tarval_b_true();
519 else if (proj_nr == pn_Cmp_Gt)
520 return get_tarval_b_false();
524 * The predecessors are Allocs or (void*)(0) constants. Allocs never
525 * return NULL, they raise an exception. Therefore we can predict
529 ir_node *aaa = skip_Proj(aa);
530 ir_node *aba = skip_Proj(ab);
532 if ( ( (/* aa is ProjP and aaa is Alloc */
534 && mode_is_reference(get_irn_mode(aa))
536 && ( (/* ab is NULL */
537 mode_is_reference(get_irn_mode(ab))
538 && tarval_is_null(tab))
539 || (/* ab is other Alloc */
541 && mode_is_reference(get_irn_mode(ab))
544 || (/* aa is NULL and aba is Alloc */
545 mode_is_reference(get_irn_mode(aa))
546 && tarval_is_null(taa)
548 && mode_is_reference(get_irn_mode(ab))
551 return new_tarval_from_long(proj_nr & pn_Cmp_Lg, mode_b);
554 return computed_value_Cmp_Confirm(a, aa, ab, proj_nr);
555 } /* computed_value_Proj_Cmp */
558 * Return the value of a floating point Quot.
560 static tarval *do_computed_value_Quot(const ir_node *a, const ir_node *b) {
561 tarval *ta = value_of(a);
562 tarval *tb = value_of(b);
564 /* cannot optimize 0 / b = 0 because of NaN */
565 if (ta != tarval_bad && tb != tarval_bad)
566 return tarval_quo(ta, tb);
568 } /* do_computed_value_Quot */
571 * Calculate the value of an integer Div of two nodes.
572 * Special case: 0 / b
574 static tarval *do_computed_value_Div(const ir_node *a, const ir_node *b) {
575 tarval *ta = value_of(a);
577 const ir_node *dummy;
579 /* Compute c1 / c2 or 0 / a, a != 0 */
580 if (tarval_is_null(ta) && value_not_zero(b, &dummy))
581 return ta; /* 0 / b == 0 */
583 if (ta != tarval_bad && tb != tarval_bad)
584 return tarval_div(ta, tb);
586 } /* do_computed_value_Div */
589 * Calculate the value of an integer Mod of two nodes.
590 * Special case: a % 1
592 static tarval *do_computed_value_Mod(const ir_node *a, const ir_node *b) {
593 tarval *ta = value_of(a);
594 tarval *tb = value_of(b);
596 /* Compute a % 1 or c1 % c2 */
597 if (tarval_is_one(tb))
598 return get_mode_null(get_irn_mode(a));
599 if (ta != tarval_bad && tb != tarval_bad)
600 return tarval_mod(ta, tb);
602 } /* do_computed_value_Mod */
605 * Return the value of a Proj(DivMod).
607 static tarval *computed_value_Proj_DivMod(const ir_node *n) {
608 long proj_nr = get_Proj_proj(n);
610 /* compute either the Div or the Mod part */
611 if (proj_nr == pn_DivMod_res_div) {
612 const ir_node *a = get_Proj_pred(n);
613 return do_computed_value_Div(get_DivMod_left(a), get_DivMod_right(a));
614 } else if (proj_nr == pn_DivMod_res_mod) {
615 const ir_node *a = get_Proj_pred(n);
616 return do_computed_value_Mod(get_DivMod_left(a), get_DivMod_right(a));
619 } /* computed_value_Proj_DivMod */
622 * Return the value of a Proj(Div).
624 static tarval *computed_value_Proj_Div(const ir_node *n) {
625 long proj_nr = get_Proj_proj(n);
627 if (proj_nr == pn_Div_res) {
628 const ir_node *a = get_Proj_pred(n);
629 return do_computed_value_Div(get_Div_left(a), get_Div_right(a));
632 } /* computed_value_Proj_Div */
635 * Return the value of a Proj(Mod).
637 static tarval *computed_value_Proj_Mod(const ir_node *n) {
638 long proj_nr = get_Proj_proj(n);
640 if (proj_nr == pn_Mod_res) {
641 const ir_node *a = get_Proj_pred(n);
642 return do_computed_value_Mod(get_Mod_left(a), get_Mod_right(a));
645 } /* computed_value_Proj_Mod */
648 * Return the value of a Proj(Quot).
650 static tarval *computed_value_Proj_Quot(const ir_node *n) {
651 long proj_nr = get_Proj_proj(n);
653 if (proj_nr == pn_Quot_res) {
654 const ir_node *a = get_Proj_pred(n);
655 return do_computed_value_Quot(get_Quot_left(a), get_Quot_right(a));
658 } /* computed_value_Proj_Quot */
661 * Return the value of a Proj.
663 static tarval *computed_value_Proj(const ir_node *proj) {
664 ir_node *n = get_Proj_pred(proj);
666 if (n->op->ops.computed_value_Proj != NULL)
667 return n->op->ops.computed_value_Proj(proj);
669 } /* computed_value_Proj */
672 * If the parameter n can be computed, return its value, else tarval_bad.
673 * Performs constant folding.
675 * @param n The node this should be evaluated
677 tarval *computed_value(const ir_node *n) {
678 if (n->op->ops.computed_value)
679 return n->op->ops.computed_value(n);
681 } /* computed_value */
684 * Set the default computed_value evaluator in an ir_op_ops.
686 * @param code the opcode for the default operation
687 * @param ops the operations initialized
692 static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops)
696 ops->computed_value = computed_value_##a; \
698 #define CASE_PROJ(a) \
700 ops->computed_value_Proj = computed_value_Proj_##a; \
737 } /* firm_set_default_computed_value */
740 * Returns a equivalent block for another block.
741 * If the block has only one predecessor, this is
742 * the equivalent one. If the only predecessor of a block is
743 * the block itself, this is a dead block.
745 * If both predecessors of a block are the branches of a binary
746 * Cond, the equivalent block is Cond's block.
748 * If all predecessors of a block are bad or lies in a dead
749 * block, the current block is dead as well.
751 * Note, that blocks are NEVER turned into Bad's, instead
752 * the dead_block flag is set. So, never test for is_Bad(block),
753 * always use is_dead_Block(block).
755 static ir_node *equivalent_node_Block(ir_node *n)
760 /* don't optimize dead or labeled blocks */
761 if (is_Block_dead(n) || has_Block_entity(n))
764 n_preds = get_Block_n_cfgpreds(n);
766 /* The Block constructor does not call optimize, but mature_immBlock()
767 calls the optimization. */
768 assert(get_Block_matured(n));
770 /* Straightening: a single entry Block following a single exit Block
771 can be merged, if it is not the Start block. */
772 /* !!! Beware, all Phi-nodes of n must have been optimized away.
773 This should be true, as the block is matured before optimize is called.
774 But what about Phi-cycles with the Phi0/Id that could not be resolved?
775 Remaining Phi nodes are just Ids. */
777 ir_node *pred = skip_Proj(get_Block_cfgpred(n, 0));
780 ir_node *predblock = get_nodes_block(pred);
781 if (predblock == oldn) {
782 /* Jmp jumps into the block it is in -- deal self cycle. */
783 n = set_Block_dead(n);
784 DBG_OPT_DEAD_BLOCK(oldn, n);
785 } else if (get_opt_control_flow_straightening()) {
787 DBG_OPT_STG(oldn, n);
789 } else if (is_Cond(pred)) {
790 ir_node *predblock = get_nodes_block(pred);
791 if (predblock == oldn) {
792 /* Jmp jumps into the block it is in -- deal self cycle. */
793 n = set_Block_dead(n);
794 DBG_OPT_DEAD_BLOCK(oldn, n);
797 } else if ((n_preds == 2) &&
798 (get_opt_control_flow_weak_simplification())) {
799 /* Test whether Cond jumps twice to this block
800 * The more general case which more than 2 predecessors is handles
801 * in optimize_cf(), we handle only this special case for speed here.
803 ir_node *a = get_Block_cfgpred(n, 0);
804 ir_node *b = get_Block_cfgpred(n, 1);
806 if (is_Proj(a) && is_Proj(b)) {
807 ir_node *cond = get_Proj_pred(a);
809 if (cond == get_Proj_pred(b) && is_Cond(cond) &&
810 get_irn_mode(get_Cond_selector(cond)) == mode_b) {
811 /* Also a single entry Block following a single exit Block. Phis have
812 twice the same operand and will be optimized away. */
813 n = get_nodes_block(cond);
814 DBG_OPT_IFSIM1(oldn, a, b, n);
817 } else if (get_opt_unreachable_code() &&
818 (n != get_irg_start_block(current_ir_graph)) &&
819 (n != get_irg_end_block(current_ir_graph)) ) {
822 /* If all inputs are dead, this block is dead too, except if it is
823 the start or end block. This is one step of unreachable code
825 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
826 ir_node *pred = get_Block_cfgpred(n, i);
829 if (is_Bad(pred)) continue;
830 pred_blk = get_nodes_block(skip_Proj(pred));
832 if (is_Block_dead(pred_blk)) continue;
835 /* really found a living input */
840 n = set_Block_dead(n);
841 DBG_OPT_DEAD_BLOCK(oldn, n);
846 } /* equivalent_node_Block */
849 * Returns a equivalent node for a Jmp, a Bad :-)
850 * Of course this only happens if the Block of the Jmp is dead.
852 static ir_node *equivalent_node_Jmp(ir_node *n) {
855 /* unreachable code elimination */
856 if (is_Block_dead(get_nodes_block(n))) {
857 n = get_irg_bad(current_ir_graph);
858 DBG_OPT_DEAD_BLOCK(oldn, n);
861 } /* equivalent_node_Jmp */
863 /** Raise is handled in the same way as Jmp. */
864 #define equivalent_node_Raise equivalent_node_Jmp
867 /* We do not evaluate Cond here as we replace it by a new node, a Jmp.
868 See transform_node_Proj_Cond(). */
871 * Optimize operations that are commutative and have neutral 0,
872 * so a op 0 = 0 op a = a.
874 static ir_node *equivalent_node_neutral_zero(ir_node *n) {
877 ir_node *a = get_binop_left(n);
878 ir_node *b = get_binop_right(n);
883 /* After running compute_node there is only one constant predecessor.
884 Find this predecessors value and remember the other node: */
885 if ((tv = value_of(a)) != tarval_bad) {
887 } else if ((tv = value_of(b)) != tarval_bad) {
892 /* If this predecessors constant value is zero, the operation is
893 * unnecessary. Remove it.
895 * Beware: If n is a Add, the mode of on and n might be different
896 * which happens in this rare construction: NULL + 3.
897 * Then, a Conv would be needed which we cannot include here.
899 if (tarval_is_null(tv) && get_irn_mode(on) == get_irn_mode(n)) {
902 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
906 } /* equivalent_node_neutral_zero */
909 * Eor is commutative and has neutral 0.
911 static ir_node *equivalent_node_Eor(ir_node *n) {
916 n = equivalent_node_neutral_zero(n);
917 if (n != oldn) return n;
920 b = get_Eor_right(n);
923 ir_node *aa = get_Eor_left(a);
924 ir_node *ab = get_Eor_right(a);
927 /* (a ^ b) ^ a -> b */
929 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
931 } else if (ab == b) {
932 /* (a ^ b) ^ b -> a */
934 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
939 ir_node *ba = get_Eor_left(b);
940 ir_node *bb = get_Eor_right(b);
943 /* a ^ (a ^ b) -> b */
945 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
947 } else if (bb == a) {
948 /* a ^ (b ^ a) -> b */
950 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
958 * Optimize a - 0 and (a - x) + x (for modes with wrap-around).
960 * The second one looks strange, but this construct
961 * is used heavily in the LCC sources :-).
963 * Beware: The Mode of an Add may be different than the mode of its
964 * predecessors, so we could not return a predecessors in all cases.
966 static ir_node *equivalent_node_Add(ir_node *n) {
968 ir_node *left, *right;
969 ir_mode *mode = get_irn_mode(n);
971 n = equivalent_node_neutral_zero(n);
975 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
976 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
979 left = get_Add_left(n);
980 right = get_Add_right(n);
983 if (get_Sub_right(left) == right) {
986 n = get_Sub_left(left);
987 if (mode == get_irn_mode(n)) {
988 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
994 if (get_Sub_right(right) == left) {
997 n = get_Sub_left(right);
998 if (mode == get_irn_mode(n)) {
999 DBG_OPT_ALGSIM1(oldn, left, right, n, FS_OPT_ADD_SUB);
1005 } /* equivalent_node_Add */
1008 * optimize operations that are not commutative but have neutral 0 on left,
1011 static ir_node *equivalent_node_left_zero(ir_node *n) {
1014 ir_node *a = get_binop_left(n);
1015 ir_node *b = get_binop_right(n);
1016 tarval *tb = value_of(b);
1018 if (tarval_is_null(tb)) {
1021 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
1024 } /* equivalent_node_left_zero */
1026 #define equivalent_node_Shl equivalent_node_left_zero
1027 #define equivalent_node_Shr equivalent_node_left_zero
1028 #define equivalent_node_Shrs equivalent_node_left_zero
1029 #define equivalent_node_Rotl equivalent_node_left_zero
1032 * Optimize a - 0 and (a + x) - x (for modes with wrap-around).
1034 * The second one looks strange, but this construct
1035 * is used heavily in the LCC sources :-).
1037 * Beware: The Mode of a Sub may be different than the mode of its
1038 * predecessors, so we could not return a predecessors in all cases.
1040 static ir_node *equivalent_node_Sub(ir_node *n) {
1043 ir_mode *mode = get_irn_mode(n);
1046 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
1047 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
1050 b = get_Sub_right(n);
1053 /* Beware: modes might be different */
1054 if (tarval_is_null(tb)) {
1055 ir_node *a = get_Sub_left(n);
1056 if (mode == get_irn_mode(a)) {
1059 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
1063 } /* equivalent_node_Sub */
1067 * Optimize an "self-inverse unary op", ie op(op(n)) = n.
1070 * -(-a) == a, but might overflow two times.
1071 * We handle it anyway here but the better way would be a
1072 * flag. This would be needed for Pascal for instance.
1074 static ir_node *equivalent_node_idempotent_unop(ir_node *n) {
1076 ir_node *pred = get_unop_op(n);
1078 /* optimize symmetric unop */
1079 if (get_irn_op(pred) == get_irn_op(n)) {
1080 n = get_unop_op(pred);
1081 DBG_OPT_ALGSIM2(oldn, pred, n, FS_OPT_IDEM_UNARY);
1084 } /* equivalent_node_idempotent_unop */
1086 /** Optimize Not(Not(x)) == x. */
1087 #define equivalent_node_Not equivalent_node_idempotent_unop
1089 /** -(-x) == x ??? Is this possible or can --x raise an
1090 out of bounds exception if min =! max? */
1091 #define equivalent_node_Minus equivalent_node_idempotent_unop
1094 * Optimize a * 1 = 1 * a = a.
1096 static ir_node *equivalent_node_Mul(ir_node *n) {
1098 ir_node *a = get_Mul_left(n);
1100 /* we can handle here only the n * n = n bit cases */
1101 if (get_irn_mode(n) == get_irn_mode(a)) {
1102 ir_node *b = get_Mul_right(n);
1106 * Mul is commutative and has again an other neutral element.
1107 * Constants are place right, so check this case first.
1110 if (tarval_is_one(tv)) {
1112 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1115 if (tarval_is_one(tv)) {
1117 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
1122 } /* equivalent_node_Mul */
1125 * Use algebraic simplification a | a = a | 0 = 0 | a = a.
1127 static ir_node *equivalent_node_Or(ir_node *n) {
1130 ir_node *a = get_Or_left(n);
1131 ir_node *b = get_Or_right(n);
1135 n = a; /* Or has it's own neutral element */
1136 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_OR);
1139 /* constants are cormalized to right, check this site first */
1141 if (tarval_is_null(tv)) {
1143 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1147 if (tarval_is_null(tv)) {
1149 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_OR);
1154 } /* equivalent_node_Or */
1157 * Optimize a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a.
1159 static ir_node *equivalent_node_And(ir_node *n) {
1162 ir_node *a = get_And_left(n);
1163 ir_node *b = get_And_right(n);
1167 n = a; /* And has it's own neutral element */
1168 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_AND);
1171 /* constants are normalized to right, check this site first */
1173 if (tarval_is_all_one(tv)) {
1175 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1178 if (tv != get_tarval_bad()) {
1179 ir_mode *mode = get_irn_mode(n);
1180 if (!mode_is_signed(mode) && is_Conv(a)) {
1181 ir_node *convop = get_Conv_op(a);
1182 ir_mode *convopmode = get_irn_mode(convop);
1183 if (!mode_is_signed(convopmode)) {
1184 if (tarval_is_all_one(tarval_convert_to(tv, convopmode))) {
1185 /* Conv(X) & all_one(mode(X)) = Conv(X) */
1187 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1194 if (tarval_is_all_one(tv)) {
1196 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1200 if (b == get_Or_left(a) || b == get_Or_right(a)) {
1203 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1208 if (a == get_Or_left(b) || a == get_Or_right(b)) {
1211 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND);
1216 } /* equivalent_node_And */
1219 * Try to remove useless Conv's:
1221 static ir_node *equivalent_node_Conv(ir_node *n) {
1223 ir_node *a = get_Conv_op(n);
1225 ir_mode *n_mode = get_irn_mode(n);
1226 ir_mode *a_mode = get_irn_mode(a);
1229 if (n_mode == a_mode) { /* No Conv necessary */
1230 if (get_Conv_strict(n)) {
1233 /* neither Minus nor Abs nor Confirm change the precision,
1234 so we can "look-through" */
1237 p = get_Minus_op(p);
1238 } else if (is_Abs(p)) {
1240 } else if (is_Confirm(p)) {
1241 p = get_Confirm_value(p);
1247 if (is_Conv(p) && get_Conv_strict(p)) {
1248 /* we known already, that a_mode == n_mode, and neither
1249 Abs nor Minus change the mode, so the second Conv
1251 assert(get_irn_mode(p) == n_mode);
1253 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1257 ir_node *pred = get_Proj_pred(p);
1258 if (is_Load(pred)) {
1259 /* Loads always return with the exact precision of n_mode */
1260 assert(get_Load_mode(pred) == n_mode);
1262 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1265 if (is_Proj(pred) && get_Proj_proj(pred) == pn_Start_T_args) {
1266 pred = get_Proj_pred(pred);
1267 if (is_Start(pred)) {
1268 /* Arguments always return with the exact precision,
1269 as strictConv's are place before Call -- if the
1270 caller was compiled with the same setting.
1271 Otherwise, the semantics is probably still right. */
1272 assert(get_irn_mode(p) == n_mode);
1274 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1280 /* special case: the immediate predecessor is also a Conv */
1281 if (! get_Conv_strict(a)) {
1282 /* first one is not strict, kick it */
1284 a_mode = get_irn_mode(a);
1288 /* else both are strict conv, second is superfluous */
1290 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1295 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CONV);
1298 } else if (is_Conv(a)) { /* Conv(Conv(b)) */
1299 ir_node *b = get_Conv_op(a);
1300 ir_mode *b_mode = get_irn_mode(b);
1302 if (get_Conv_strict(n) && get_Conv_strict(a)) {
1303 /* both are strict conv */
1304 if (smaller_mode(a_mode, n_mode)) {
1305 /* both are strict, but the first is smaller, so
1306 the second cannot remove more precision, remove the
1308 set_Conv_strict(n, 0);
1311 if (n_mode == b_mode) {
1312 if (! get_Conv_strict(n) && ! get_Conv_strict(a)) {
1313 if (n_mode == mode_b) {
1314 n = b; /* Convb(Conv*(xxxb(...))) == xxxb(...) */
1315 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1317 } else if (get_mode_arithmetic(n_mode) == get_mode_arithmetic(a_mode)) {
1318 if (values_in_mode(b_mode, a_mode)) {
1319 n = b; /* ConvS(ConvL(xxxS(...))) == xxxS(...) */
1320 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1325 if (mode_is_int(n_mode) && get_mode_arithmetic(a_mode) == irma_ieee754) {
1326 /* ConvI(ConvF(I)) -> I, iff float mantissa >= int mode */
1327 unsigned int_mantissa = get_mode_size_bits(n_mode) - (mode_is_signed(n_mode) ? 1 : 0);
1328 unsigned float_mantissa = tarval_ieee754_get_mantissa_size(a_mode);
1330 if (float_mantissa >= int_mantissa) {
1332 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1337 if (smaller_mode(b_mode, a_mode)) {
1338 if (get_Conv_strict(n))
1339 set_Conv_strict(b, 1);
1340 n = b; /* ConvA(ConvB(ConvA(...))) == ConvA(...) */
1341 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV);
1348 } /* equivalent_node_Conv */
1351 * A Cast may be removed if the type of the previous node
1352 * is already the type of the Cast.
1354 static ir_node *equivalent_node_Cast(ir_node *n) {
1356 ir_node *pred = get_Cast_op(n);
1358 if (get_irn_type(pred) == get_Cast_type(n)) {
1360 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CAST);
1363 } /* equivalent_node_Cast */
1366 * - fold Phi-nodes, iff they have only one predecessor except
1369 static ir_node *equivalent_node_Phi(ir_node *n) {
1374 ir_node *first_val = NULL; /* to shutup gcc */
1376 if (!get_opt_normalize()) return n;
1378 n_preds = get_Phi_n_preds(n);
1380 block = get_nodes_block(n);
1381 if (is_Block_dead(block)) /* Control dead */
1382 return get_irg_bad(current_ir_graph);
1384 if (n_preds == 0) return n; /* Phi of dead Region without predecessors. */
1386 /* Find first non-self-referencing input */
1387 for (i = 0; i < n_preds; ++i) {
1388 first_val = get_Phi_pred(n, i);
1389 if ( (first_val != n) /* not self pointer */
1391 /* BEWARE: when the if is changed to 1, Phi's will ignore it's Bad
1392 * predecessors. Then, Phi nodes in dead code might be removed, causing
1393 * nodes pointing to themself (Add's for instance).
1394 * This is really bad and causes endless recursions in several
1395 * code pathes, so we do NOT optimize such a code.
1396 * This is not that bad as it sounds, optimize_cf() removes bad control flow
1397 * (and bad Phi predecessors), so live code is optimized later.
1399 && (! is_Bad(get_Block_cfgpred(block, i)))
1401 ) { /* value not dead */
1402 break; /* then found first value. */
1407 /* A totally Bad or self-referencing Phi (we didn't break the above loop) */
1408 return get_irg_bad(current_ir_graph);
1411 /* search for rest of inputs, determine if any of these
1412 are non-self-referencing */
1413 while (++i < n_preds) {
1414 ir_node *scnd_val = get_Phi_pred(n, i);
1415 if ( (scnd_val != n)
1416 && (scnd_val != first_val)
1419 && (! is_Bad(get_Block_cfgpred(block, i)))
1427 /* Fold, if no multiple distinct non-self-referencing inputs */
1429 DBG_OPT_PHI(oldn, n);
1432 } /* equivalent_node_Phi */
1435 * Several optimizations:
1436 * - fold Sync-nodes, iff they have only one predecessor except
1439 static ir_node *equivalent_node_Sync(ir_node *n) {
1440 int arity = get_Sync_n_preds(n);
1443 for (i = 0; i < arity;) {
1444 ir_node *pred = get_Sync_pred(n, i);
1447 /* Remove Bad predecessors */
1454 /* Remove duplicate predecessors */
1460 if (get_Sync_pred(n, j) == pred) {
1468 if (arity == 0) return get_irg_bad(current_ir_graph);
1469 if (arity == 1) return get_Sync_pred(n, 0);
1471 } /* equivalent_node_Sync */
1474 * Optimize Proj(Tuple).
1476 static ir_node *equivalent_node_Proj_Tuple(ir_node *proj) {
1477 ir_node *oldn = proj;
1478 ir_node *tuple = get_Proj_pred(proj);
1480 /* Remove the Tuple/Proj combination. */
1481 proj = get_Tuple_pred(tuple, get_Proj_proj(proj));
1482 DBG_OPT_TUPLE(oldn, tuple, proj);
1485 } /* equivalent_node_Proj_Tuple */
1488 * Optimize a / 1 = a.
1490 static ir_node *equivalent_node_Proj_Div(ir_node *proj) {
1491 ir_node *oldn = proj;
1492 ir_node *div = get_Proj_pred(proj);
1493 ir_node *b = get_Div_right(div);
1494 tarval *tb = value_of(b);
1496 /* Div is not commutative. */
1497 if (tarval_is_one(tb)) { /* div(x, 1) == x */
1498 switch (get_Proj_proj(proj)) {
1500 proj = get_Div_mem(div);
1501 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1505 proj = get_Div_left(div);
1506 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1510 /* we cannot replace the exception Proj's here, this is done in
1511 transform_node_Proj_Div() */
1516 } /* equivalent_node_Proj_Div */
1519 * Optimize a / 1.0 = a.
1521 static ir_node *equivalent_node_Proj_Quot(ir_node *proj) {
1522 ir_node *oldn = proj;
1523 ir_node *quot = get_Proj_pred(proj);
1524 ir_node *b = get_Quot_right(quot);
1525 tarval *tb = value_of(b);
1527 /* Div is not commutative. */
1528 if (tarval_is_one(tb)) { /* Quot(x, 1) == x */
1529 switch (get_Proj_proj(proj)) {
1531 proj = get_Quot_mem(quot);
1532 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1536 proj = get_Quot_left(quot);
1537 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1541 /* we cannot replace the exception Proj's here, this is done in
1542 transform_node_Proj_Quot() */
1547 } /* equivalent_node_Proj_Quot */
1550 * Optimize a / 1 = a.
1552 static ir_node *equivalent_node_Proj_DivMod(ir_node *proj) {
1553 ir_node *oldn = proj;
1554 ir_node *divmod = get_Proj_pred(proj);
1555 ir_node *b = get_DivMod_right(divmod);
1556 tarval *tb = value_of(b);
1558 /* Div is not commutative. */
1559 if (tarval_is_one(tb)) { /* div(x, 1) == x */
1560 switch (get_Proj_proj(proj)) {
1562 proj = get_DivMod_mem(divmod);
1563 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1566 case pn_DivMod_res_div:
1567 proj = get_DivMod_left(divmod);
1568 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NEUTRAL_1);
1572 /* we cannot replace the exception Proj's here, this is done in
1573 transform_node_Proj_DivMod().
1574 Note further that the pn_DivMod_res_div case is handled in
1575 computed_value_Proj(). */
1580 } /* equivalent_node_Proj_DivMod */
1583 * Optimize CopyB(mem, x, x) into a Nop.
1585 static ir_node *equivalent_node_Proj_CopyB(ir_node *proj) {
1586 ir_node *oldn = proj;
1587 ir_node *copyb = get_Proj_pred(proj);
1588 ir_node *a = get_CopyB_dst(copyb);
1589 ir_node *b = get_CopyB_src(copyb);
1592 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
1593 switch (get_Proj_proj(proj)) {
1594 case pn_CopyB_M_regular:
1595 proj = get_CopyB_mem(copyb);
1596 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
1599 case pn_CopyB_M_except:
1600 case pn_CopyB_X_except:
1601 DBG_OPT_EXC_REM(proj);
1602 proj = get_irg_bad(current_ir_graph);
1607 } /* equivalent_node_Proj_CopyB */
1610 * Optimize Bounds(idx, idx, upper) into idx.
1612 static ir_node *equivalent_node_Proj_Bound(ir_node *proj) {
1613 ir_node *oldn = proj;
1614 ir_node *bound = get_Proj_pred(proj);
1615 ir_node *idx = get_Bound_index(bound);
1616 ir_node *pred = skip_Proj(idx);
1619 if (idx == get_Bound_lower(bound))
1621 else if (is_Bound(pred)) {
1623 * idx was Bounds checked in the same MacroBlock previously,
1624 * it is still valid if lower <= pred_lower && pred_upper <= upper.
1626 ir_node *lower = get_Bound_lower(bound);
1627 ir_node *upper = get_Bound_upper(bound);
1628 if (get_Bound_lower(pred) == lower &&
1629 get_Bound_upper(pred) == upper &&
1630 get_irn_MacroBlock(bound) == get_irn_MacroBlock(pred)) {
1632 * One could expect that we simply return the previous
1633 * Bound here. However, this would be wrong, as we could
1634 * add an exception Proj to a new location then.
1635 * So, we must turn in into a tuple.
1641 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
1642 switch (get_Proj_proj(proj)) {
1644 DBG_OPT_EXC_REM(proj);
1645 proj = get_Bound_mem(bound);
1647 case pn_Bound_X_except:
1648 DBG_OPT_EXC_REM(proj);
1649 proj = get_irg_bad(current_ir_graph);
1653 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
1656 /* cannot optimize pn_Bound_X_regular, handled in transform ... */
1661 } /* equivalent_node_Proj_Bound */
1664 * Optimize an Exception Proj(Load) with a non-null address.
1666 static ir_node *equivalent_node_Proj_Load(ir_node *proj) {
1667 if (get_opt_ldst_only_null_ptr_exceptions()) {
1668 if (get_irn_mode(proj) == mode_X) {
1669 ir_node *load = get_Proj_pred(proj);
1671 /* get the Load address */
1672 const ir_node *addr = get_Load_ptr(load);
1673 const ir_node *confirm;
1675 if (value_not_null(addr, &confirm)) {
1676 if (get_Proj_proj(proj) == pn_Load_X_except) {
1677 DBG_OPT_EXC_REM(proj);
1678 return get_irg_bad(current_ir_graph);
1684 } /* equivalent_node_Proj_Load */
1687 * Optimize an Exception Proj(Store) with a non-null address.
1689 static ir_node *equivalent_node_Proj_Store(ir_node *proj) {
1690 if (get_opt_ldst_only_null_ptr_exceptions()) {
1691 if (get_irn_mode(proj) == mode_X) {
1692 ir_node *store = get_Proj_pred(proj);
1694 /* get the load/store address */
1695 const ir_node *addr = get_Store_ptr(store);
1696 const ir_node *confirm;
1698 if (value_not_null(addr, &confirm)) {
1699 if (get_Proj_proj(proj) == pn_Store_X_except) {
1700 DBG_OPT_EXC_REM(proj);
1701 return get_irg_bad(current_ir_graph);
1707 } /* equivalent_node_Proj_Store */
1710 * Does all optimizations on nodes that must be done on it's Proj's
1711 * because of creating new nodes.
1713 static ir_node *equivalent_node_Proj(ir_node *proj) {
1714 ir_node *n = get_Proj_pred(proj);
1716 if (get_irn_mode(proj) == mode_X) {
1717 if (is_Block_dead(get_nodes_block(n))) {
1718 /* Remove dead control flow -- early gigo(). */
1719 return get_irg_bad(current_ir_graph);
1722 if (n->op->ops.equivalent_node_Proj)
1723 return n->op->ops.equivalent_node_Proj(proj);
1725 } /* equivalent_node_Proj */
1730 static ir_node *equivalent_node_Id(ir_node *n) {
1737 DBG_OPT_ID(oldn, n);
1739 } /* equivalent_node_Id */
1744 static ir_node *equivalent_node_Mux(ir_node *n)
1746 ir_node *oldn = n, *sel = get_Mux_sel(n);
1748 tarval *ts = value_of(sel);
1750 /* Mux(true, f, t) == t */
1751 if (ts == tarval_b_true) {
1752 n = get_Mux_true(n);
1753 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1756 /* Mux(false, f, t) == f */
1757 if (ts == tarval_b_false) {
1758 n = get_Mux_false(n);
1759 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_C);
1762 n_t = get_Mux_true(n);
1763 n_f = get_Mux_false(n);
1765 /* Mux(v, x, T) == x */
1766 if (is_Unknown(n_f)) {
1768 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1771 /* Mux(v, T, x) == x */
1772 if (is_Unknown(n_t)) {
1774 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1778 /* Mux(v, x, x) == x */
1781 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ);
1784 if (is_Proj(sel) && !mode_honor_signed_zeros(get_irn_mode(n))) {
1785 ir_node *cmp = get_Proj_pred(sel);
1786 long proj_nr = get_Proj_proj(sel);
1787 ir_node *f = get_Mux_false(n);
1788 ir_node *t = get_Mux_true(n);
1791 * Note further that these optimization work even for floating point
1792 * with NaN's because -NaN == NaN.
1793 * However, if +0 and -0 is handled differently, we cannot use the first one.
1796 ir_node *const cmp_l = get_Cmp_left(cmp);
1797 ir_node *const cmp_r = get_Cmp_right(cmp);
1801 if ((cmp_l == t && cmp_r == f) || /* Mux(t == f, t, f) -> f */
1802 (cmp_l == f && cmp_r == t)) { /* Mux(f == t, t, f) -> f */
1804 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1811 if ((cmp_l == t && cmp_r == f) || /* Mux(t != f, t, f) -> t */
1812 (cmp_l == f && cmp_r == t)) { /* Mux(f != t, t, f) -> t */
1814 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1821 * Note: normalization puts the constant on the right side,
1822 * so we check only one case.
1824 if (cmp_l == t && tarval_is_null(value_of(cmp_r))) {
1825 /* Mux(t CMP 0, X, t) */
1826 if (is_Minus(f) && get_Minus_op(f) == t) {
1827 /* Mux(t CMP 0, -t, t) */
1828 if (proj_nr == pn_Cmp_Eq) {
1829 /* Mux(t == 0, -t, t) ==> -t */
1831 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1832 } else if (proj_nr == pn_Cmp_Lg || proj_nr == pn_Cmp_Ne) {
1833 /* Mux(t != 0, -t, t) ==> t */
1835 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM);
1842 } /* equivalent_node_Mux */
1845 * Remove Confirm nodes if setting is on.
1846 * Replace Confirms(x, '=', Constlike) by Constlike.
1848 static ir_node *equivalent_node_Confirm(ir_node *n) {
1849 ir_node *pred = get_Confirm_value(n);
1850 pn_Cmp pnc = get_Confirm_cmp(n);
1852 while (is_Confirm(pred) && pnc == get_Confirm_cmp(pred)) {
1854 * rare case: two identical Confirms one after another,
1855 * replace the second one with the first.
1858 pred = get_Confirm_value(n);
1859 pnc = get_Confirm_cmp(n);
1861 if (get_opt_remove_confirm())
1862 return get_Confirm_value(n);
1867 * equivalent_node() returns a node equivalent to input n. It skips all nodes that
1868 * perform no actual computation, as, e.g., the Id nodes. It does not create
1869 * new nodes. It is therefore safe to free n if the node returned is not n.
1870 * If a node returns a Tuple we can not just skip it. If the size of the
1871 * in array fits, we transform n into a tuple (e.g., Div).
1873 ir_node *equivalent_node(ir_node *n) {
1874 if (n->op->ops.equivalent_node)
1875 return n->op->ops.equivalent_node(n);
1877 } /* equivalent_node */
1880 * Sets the default equivalent node operation for an ir_op_ops.
1882 * @param code the opcode for the default operation
1883 * @param ops the operations initialized
1888 static ir_op_ops *firm_set_default_equivalent_node(ir_opcode code, ir_op_ops *ops)
1892 ops->equivalent_node = equivalent_node_##a; \
1894 #define CASE_PROJ(a) \
1896 ops->equivalent_node_Proj = equivalent_node_Proj_##a; \
1938 } /* firm_set_default_equivalent_node */
1941 * Returns non-zero if a node is a Phi node
1942 * with all predecessors constant.
1944 static int is_const_Phi(ir_node *n) {
1947 if (! is_Phi(n) || get_irn_arity(n) == 0)
1949 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1950 if (! is_Const(get_irn_n(n, i)))
1954 } /* is_const_Phi */
1956 typedef tarval *(*tarval_sub_type)(tarval *a, tarval *b, ir_mode *mode);
1957 typedef tarval *(*tarval_binop_type)(tarval *a, tarval *b);
1960 * Wrapper for the tarval binop evaluation, tarval_sub has one more parameter.
1962 static tarval *do_eval(tarval *(*eval)(), tarval *a, tarval *b, ir_mode *mode) {
1963 if (eval == tarval_sub) {
1964 tarval_sub_type func = (tarval_sub_type)eval;
1966 return func(a, b, mode);
1968 tarval_binop_type func = (tarval_binop_type)eval;
1975 * Apply an evaluator on a binop with a constant operators (and one Phi).
1977 * @param phi the Phi node
1978 * @param other the other operand
1979 * @param eval an evaluator function
1980 * @param mode the mode of the result, may be different from the mode of the Phi!
1981 * @param left if non-zero, other is the left operand, else the right
1983 * @return a new Phi node if the conversion was successful, NULL else
1985 static ir_node *apply_binop_on_phi(ir_node *phi, tarval *other, tarval *(*eval)(), ir_mode *mode, int left) {
1990 int i, n = get_irn_arity(phi);
1992 NEW_ARR_A(void *, res, n);
1994 for (i = 0; i < n; ++i) {
1995 pred = get_irn_n(phi, i);
1996 tv = get_Const_tarval(pred);
1997 tv = do_eval(eval, other, tv, mode);
1999 if (tv == tarval_bad) {
2000 /* folding failed, bad */
2006 for (i = 0; i < n; ++i) {
2007 pred = get_irn_n(phi, i);
2008 tv = get_Const_tarval(pred);
2009 tv = do_eval(eval, tv, other, mode);
2011 if (tv == tarval_bad) {
2012 /* folding failed, bad */
2018 irg = current_ir_graph;
2019 for (i = 0; i < n; ++i) {
2020 pred = get_irn_n(phi, i);
2021 res[i] = new_r_Const_type(irg, res[i], get_Const_type(pred));
2023 return new_r_Phi(get_nodes_block(phi), n, (ir_node **)res, mode);
2024 } /* apply_binop_on_phi */
2027 * Apply an evaluator on a binop with two constant Phi.
2029 * @param a the left Phi node
2030 * @param b the right Phi node
2031 * @param eval an evaluator function
2032 * @param mode the mode of the result, may be different from the mode of the Phi!
2034 * @return a new Phi node if the conversion was successful, NULL else
2036 static ir_node *apply_binop_on_2_phis(ir_node *a, ir_node *b, tarval *(*eval)(), ir_mode *mode) {
2037 tarval *tv_l, *tv_r, *tv;
2043 if (get_nodes_block(a) != get_nodes_block(b))
2046 n = get_irn_arity(a);
2047 NEW_ARR_A(void *, res, n);
2049 for (i = 0; i < n; ++i) {
2050 pred = get_irn_n(a, i);
2051 tv_l = get_Const_tarval(pred);
2052 pred = get_irn_n(b, i);
2053 tv_r = get_Const_tarval(pred);
2054 tv = do_eval(eval, tv_l, tv_r, mode);
2056 if (tv == tarval_bad) {
2057 /* folding failed, bad */
2062 irg = current_ir_graph;
2063 for (i = 0; i < n; ++i) {
2064 pred = get_irn_n(a, i);
2065 res[i] = new_r_Const_type(irg, res[i], get_Const_type(pred));
2067 return new_r_Phi(get_nodes_block(a), n, (ir_node **)res, mode);
2068 } /* apply_binop_on_2_phis */
2071 * Apply an evaluator on a unop with a constant operator (a Phi).
2073 * @param phi the Phi node
2074 * @param eval an evaluator function
2076 * @return a new Phi node if the conversion was successful, NULL else
2078 static ir_node *apply_unop_on_phi(ir_node *phi, tarval *(*eval)(tarval *)) {
2084 int i, n = get_irn_arity(phi);
2086 NEW_ARR_A(void *, res, n);
2087 for (i = 0; i < n; ++i) {
2088 pred = get_irn_n(phi, i);
2089 tv = get_Const_tarval(pred);
2092 if (tv == tarval_bad) {
2093 /* folding failed, bad */
2098 mode = get_irn_mode(phi);
2099 irg = current_ir_graph;
2100 for (i = 0; i < n; ++i) {
2101 pred = get_irn_n(phi, i);
2102 res[i] = new_r_Const_type(irg, res[i], get_Const_type(pred));
2104 return new_r_Phi(get_nodes_block(phi), n, (ir_node **)res, mode);
2105 } /* apply_unop_on_phi */
2108 * Apply a conversion on a constant operator (a Phi).
2110 * @param phi the Phi node
2112 * @return a new Phi node if the conversion was successful, NULL else
2114 static ir_node *apply_conv_on_phi(ir_node *phi, ir_mode *mode) {
2119 int i, n = get_irn_arity(phi);
2121 NEW_ARR_A(void *, res, n);
2122 for (i = 0; i < n; ++i) {
2123 pred = get_irn_n(phi, i);
2124 tv = get_Const_tarval(pred);
2125 tv = tarval_convert_to(tv, mode);
2127 if (tv == tarval_bad) {
2128 /* folding failed, bad */
2133 irg = current_ir_graph;
2134 for (i = 0; i < n; ++i) {
2135 pred = get_irn_n(phi, i);
2136 res[i] = new_r_Const_type(irg, res[i], get_Const_type(pred));
2138 return new_r_Phi(get_nodes_block(phi), n, (ir_node **)res, mode);
2139 } /* apply_conv_on_phi */
2142 * Transform AddP(P, ConvIs(Iu)), AddP(P, ConvIu(Is)) and
2143 * SubP(P, ConvIs(Iu)), SubP(P, ConvIu(Is)).
2144 * If possible, remove the Conv's.
2146 static ir_node *transform_node_AddSub(ir_node *n) {
2147 ir_mode *mode = get_irn_mode(n);
2149 if (mode_is_reference(mode)) {
2150 ir_node *left = get_binop_left(n);
2151 ir_node *right = get_binop_right(n);
2152 unsigned ref_bits = get_mode_size_bits(mode);
2154 if (is_Conv(left)) {
2155 ir_mode *lmode = get_irn_mode(left);
2156 unsigned bits = get_mode_size_bits(lmode);
2158 if (ref_bits == bits &&
2159 mode_is_int(lmode) &&
2160 get_mode_arithmetic(lmode) == irma_twos_complement) {
2161 ir_node *pre = get_Conv_op(left);
2162 ir_mode *pre_mode = get_irn_mode(pre);
2164 if (mode_is_int(pre_mode) &&
2165 get_mode_size_bits(pre_mode) == bits &&
2166 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
2167 /* ok, this conv just changes to sign, moreover the calculation
2168 * is done with same number of bits as our address mode, so
2169 * we can ignore the conv as address calculation can be viewed
2170 * as either signed or unsigned
2172 set_binop_left(n, pre);
2177 if (is_Conv(right)) {
2178 ir_mode *rmode = get_irn_mode(right);
2179 unsigned bits = get_mode_size_bits(rmode);
2181 if (ref_bits == bits &&
2182 mode_is_int(rmode) &&
2183 get_mode_arithmetic(rmode) == irma_twos_complement) {
2184 ir_node *pre = get_Conv_op(right);
2185 ir_mode *pre_mode = get_irn_mode(pre);
2187 if (mode_is_int(pre_mode) &&
2188 get_mode_size_bits(pre_mode) == bits &&
2189 get_mode_arithmetic(pre_mode) == irma_twos_complement) {
2190 /* ok, this conv just changes to sign, moreover the calculation
2191 * is done with same number of bits as our address mode, so
2192 * we can ignore the conv as address calculation can be viewed
2193 * as either signed or unsigned
2195 set_binop_right(n, pre);
2200 /* let address arithmetic use unsigned modes */
2201 if (is_Const(right)) {
2202 ir_mode *rmode = get_irn_mode(right);
2204 if (mode_is_signed(rmode) && get_mode_arithmetic(rmode) == irma_twos_complement) {
2205 /* convert a AddP(P, *s) into AddP(P, *u) */
2206 ir_mode *nm = get_reference_mode_unsigned_eq(mode);
2208 ir_node *pre = new_r_Conv(get_nodes_block(n), right, nm);
2209 set_binop_right(n, pre);
2215 } /* transform_node_AddSub */
2217 #define HANDLE_BINOP_PHI(eval, a, b, c, mode) \
2219 if (is_Const(b) && is_const_Phi(a)) { \
2220 /* check for Op(Phi, Const) */ \
2221 c = apply_binop_on_phi(a, get_Const_tarval(b), eval, mode, 0);\
2223 else if (is_Const(a) && is_const_Phi(b)) { \
2224 /* check for Op(Const, Phi) */ \
2225 c = apply_binop_on_phi(b, get_Const_tarval(a), eval, mode, 1);\
2227 else if (is_const_Phi(a) && is_const_Phi(b)) { \
2228 /* check for Op(Phi, Phi) */ \
2229 c = apply_binop_on_2_phis(a, b, eval, mode); \
2232 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
2236 #define HANDLE_UNOP_PHI(eval, a, c) \
2238 if (is_const_Phi(a)) { \
2239 /* check for Op(Phi) */ \
2240 c = apply_unop_on_phi(a, eval); \
2242 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI); \
2248 * Do the AddSub optimization, then Transform
2249 * Constant folding on Phi
2250 * Add(a,a) -> Mul(a, 2)
2251 * Add(Mul(a, x), a) -> Mul(a, x+1)
2252 * if the mode is integer or float.
2253 * Transform Add(a,-b) into Sub(a,b).
2254 * Reassociation might fold this further.
2256 static ir_node *transform_node_Add(ir_node *n) {
2258 ir_node *a, *b, *c, *oldn = n;
2260 n = transform_node_AddSub(n);
2262 a = get_Add_left(n);
2263 b = get_Add_right(n);
2265 mode = get_irn_mode(n);
2267 if (mode_is_reference(mode)) {
2268 ir_mode *lmode = get_irn_mode(a);
2270 if (is_Const(b) && is_Const_null(b) && mode_is_int(lmode)) {
2271 /* an Add(a, NULL) is a hidden Conv */
2272 dbg_info *dbg = get_irn_dbg_info(n);
2273 return new_rd_Conv(dbg, get_nodes_block(n), a, mode);
2277 HANDLE_BINOP_PHI(tarval_add, a, b, c, mode);
2279 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2280 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2283 if (mode_is_num(mode)) {
2284 /* the following code leads to endless recursion when Mul are replaced by a simple instruction chain */
2285 if (!is_irg_state(current_ir_graph, IR_GRAPH_STATE_ARCH_DEP)
2286 && a == b && mode_is_int(mode)) {
2287 ir_node *block = get_nodes_block(n);
2290 get_irn_dbg_info(n),
2293 new_Const_long(mode, 2),
2295 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_A);
2300 get_irn_dbg_info(n),
2305 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
2310 get_irn_dbg_info(n),
2315 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B);
2318 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2319 /* Here we rely on constants be on the RIGHT side */
2321 ir_node *op = get_Not_op(a);
2323 if (is_Const(b) && is_Const_one(b)) {
2325 ir_node *blk = get_nodes_block(n);
2326 n = new_rd_Minus(get_irn_dbg_info(n), blk, op, mode);
2327 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_PLUS_1);
2332 n = new_Const(get_mode_minus_one(mode));
2333 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X);
2338 ir_node *op = get_Not_op(b);
2342 n = new_Const(get_mode_minus_one(mode));
2343 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X);
2350 } /* transform_node_Add */
2353 * returns -cnst or NULL if impossible
2355 static ir_node *const_negate(ir_node *cnst) {
2356 tarval *tv = tarval_neg(get_Const_tarval(cnst));
2357 dbg_info *dbgi = get_irn_dbg_info(cnst);
2358 ir_graph *irg = get_irn_irg(cnst);
2359 if (tv == tarval_bad) return NULL;
2360 return new_rd_Const(dbgi, irg, tv);
2364 * Do the AddSub optimization, then Transform
2365 * Constant folding on Phi
2366 * Sub(0,a) -> Minus(a)
2367 * Sub(Mul(a, x), a) -> Mul(a, x-1)
2368 * Sub(Sub(x, y), b) -> Sub(x, Add(y,b))
2369 * Sub(Add(a, x), x) -> a
2370 * Sub(x, Add(x, a)) -> -a
2371 * Sub(x, Const) -> Add(x, -Const)
2373 static ir_node *transform_node_Sub(ir_node *n) {
2378 n = transform_node_AddSub(n);
2380 a = get_Sub_left(n);
2381 b = get_Sub_right(n);
2383 mode = get_irn_mode(n);
2385 if (mode_is_int(mode)) {
2386 ir_mode *lmode = get_irn_mode(a);
2388 if (is_Const(b) && is_Const_null(b) && mode_is_reference(lmode)) {
2389 /* a Sub(a, NULL) is a hidden Conv */
2390 dbg_info *dbg = get_irn_dbg_info(n);
2391 n = new_rd_Conv(dbg, get_nodes_block(n), a, mode);
2392 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_CONV);
2396 if (mode == lmode &&
2397 get_mode_arithmetic(mode) == irma_twos_complement &&
2399 get_Const_tarval(a) == get_mode_minus_one(mode)) {
2401 dbg_info *dbg = get_irn_dbg_info(n);
2402 n = new_rd_Not(dbg, get_nodes_block(n), b, mode);
2403 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_NOT);
2409 HANDLE_BINOP_PHI(tarval_sub, a, b, c, mode);
2411 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2412 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2415 if (is_Const(b) && !mode_is_reference(get_irn_mode(b))) {
2416 /* a - C -> a + (-C) */
2417 ir_node *cnst = const_negate(b);
2419 ir_node *block = get_nodes_block(n);
2420 dbg_info *dbgi = get_irn_dbg_info(n);
2422 n = new_rd_Add(dbgi, block, a, cnst, mode);
2423 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2428 if (is_Minus(a)) { /* (-a) - b -> -(a + b) */
2429 dbg_info *dbg = get_irn_dbg_info(n);
2430 ir_node *block = get_nodes_block(n);
2431 ir_node *left = get_Minus_op(a);
2432 ir_node *add = new_rd_Add(dbg, block, left, b, mode);
2434 n = new_rd_Minus(dbg, block, add, mode);
2435 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2437 } else if (is_Minus(b)) { /* a - (-b) -> a + b */
2438 dbg_info *dbg = get_irn_dbg_info(n);
2439 ir_node *block = get_nodes_block(n);
2440 ir_node *right = get_Minus_op(b);
2442 n = new_rd_Add(dbg, block, a, right, mode);
2443 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MINUS);
2445 } else if (is_Sub(b)) {
2446 /* a - (b - c) -> a + (c - b)
2447 * -> (a - b) + c iff (b - c) is a pointer */
2448 dbg_info *s_dbg = get_irn_dbg_info(b);
2449 ir_node *s_block = get_nodes_block(b);
2450 ir_node *s_left = get_Sub_left(b);
2451 ir_node *s_right = get_Sub_right(b);
2452 ir_mode *s_mode = get_irn_mode(b);
2453 if (mode_is_reference(s_mode)) {
2454 ir_node *sub = new_rd_Sub(s_dbg, s_block, a, s_left, mode);
2455 dbg_info *a_dbg = get_irn_dbg_info(n);
2456 ir_node *a_block = get_nodes_block(n);
2459 s_right = new_r_Conv(a_block, s_right, mode);
2460 n = new_rd_Add(a_dbg, a_block, sub, s_right, mode);
2462 ir_node *sub = new_rd_Sub(s_dbg, s_block, s_right, s_left, s_mode);
2463 dbg_info *a_dbg = get_irn_dbg_info(n);
2464 ir_node *a_block = get_nodes_block(n);
2466 n = new_rd_Add(a_dbg, a_block, a, sub, mode);
2468 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2470 } else if (is_Mul(b)) { /* a - (b * C) -> a + (b * -C) */
2471 ir_node *m_right = get_Mul_right(b);
2472 if (is_Const(m_right)) {
2473 ir_node *cnst2 = const_negate(m_right);
2474 if (cnst2 != NULL) {
2475 dbg_info *m_dbg = get_irn_dbg_info(b);
2476 ir_node *m_block = get_nodes_block(b);
2477 ir_node *m_left = get_Mul_left(b);
2478 ir_mode *m_mode = get_irn_mode(b);
2479 ir_node *mul = new_rd_Mul(m_dbg, m_block, m_left, cnst2, m_mode);
2480 dbg_info *a_dbg = get_irn_dbg_info(n);
2481 ir_node *a_block = get_nodes_block(n);
2483 n = new_rd_Add(a_dbg, a_block, a, mul, mode);
2484 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD);
2490 /* Beware of Sub(P, P) which cannot be optimized into a simple Minus ... */
2491 if (mode_is_num(mode) && mode == get_irn_mode(a) && is_Const(a) && is_Const_null(a)) {
2493 get_irn_dbg_info(n),
2497 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_0_A);
2501 if (mode_wrap_around(mode)) {
2502 ir_node *left = get_Add_left(a);
2503 ir_node *right = get_Add_right(a);
2505 /* FIXME: Does the Conv's work only for two complement or generally? */
2507 if (mode != get_irn_mode(right)) {
2508 /* This Sub is an effective Cast */
2509 right = new_r_Conv(get_nodes_block(n), right, mode);
2512 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2514 } else if (right == b) {
2515 if (mode != get_irn_mode(left)) {
2516 /* This Sub is an effective Cast */
2517 left = new_r_Conv(get_nodes_block(n), left, mode);
2520 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2526 if (mode_wrap_around(mode)) {
2527 ir_node *left = get_Add_left(b);
2528 ir_node *right = get_Add_right(b);
2530 /* FIXME: Does the Conv's work only for two complement or generally? */
2532 ir_mode *r_mode = get_irn_mode(right);
2534 n = new_r_Minus(get_nodes_block(n), right, r_mode);
2535 if (mode != r_mode) {
2536 /* This Sub is an effective Cast */
2537 n = new_r_Conv(get_nodes_block(n), n, mode);
2539 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2541 } else if (right == a) {
2542 ir_mode *l_mode = get_irn_mode(left);
2544 n = new_r_Minus(get_nodes_block(n), left, l_mode);
2545 if (mode != l_mode) {
2546 /* This Sub is an effective Cast */
2547 n = new_r_Conv(get_nodes_block(n), n, mode);
2549 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB);
2554 if (mode_is_int(mode) && is_Conv(a) && is_Conv(b)) {
2555 ir_mode *mode = get_irn_mode(a);
2557 if (mode == get_irn_mode(b)) {
2559 ir_node *op_a = get_Conv_op(a);
2560 ir_node *op_b = get_Conv_op(b);
2562 /* check if it's allowed to skip the conv */
2563 ma = get_irn_mode(op_a);
2564 mb = get_irn_mode(op_b);
2566 if (mode_is_reference(ma) && mode_is_reference(mb)) {
2567 /* SubInt(ConvInt(aP), ConvInt(bP)) -> SubInt(aP,bP) */
2570 set_Sub_right(n, b);
2576 /* do NOT execute this code if reassociation is enabled, it does the inverse! */
2577 if (!is_reassoc_running() && is_Mul(a)) {
2578 ir_node *ma = get_Mul_left(a);
2579 ir_node *mb = get_Mul_right(a);
2582 ir_node *blk = get_nodes_block(n);
2584 get_irn_dbg_info(n),
2588 get_irn_dbg_info(n),
2591 new_Const_long(mode, 1),
2594 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2596 } else if (mb == b) {
2597 ir_node *blk = get_nodes_block(n);
2599 get_irn_dbg_info(n),
2603 get_irn_dbg_info(n),
2606 new_Const_long(mode, 1),
2609 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A);
2613 if (is_Sub(a)) { /* (x - y) - b -> x - (y + b) */
2614 ir_node *x = get_Sub_left(a);
2615 ir_node *y = get_Sub_right(a);
2616 ir_node *blk = get_nodes_block(n);
2617 ir_mode *m_b = get_irn_mode(b);
2618 ir_mode *m_y = get_irn_mode(y);
2622 /* Determine the right mode for the Add. */
2625 else if (mode_is_reference(m_b))
2627 else if (mode_is_reference(m_y))
2631 * Both modes are different but none is reference,
2632 * happens for instance in SubP(SubP(P, Iu), Is).
2633 * We have two possibilities here: Cast or ignore.
2634 * Currently we ignore this case.
2639 add = new_r_Add(blk, y, b, add_mode);
2641 n = new_rd_Sub(get_irn_dbg_info(n), blk, x, add, mode);
2642 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_SUB_X_Y_Z);
2646 if (get_mode_arithmetic(mode) == irma_twos_complement) {
2647 if (is_Const(a) && is_Not(b)) {
2648 /* c - ~X = X + (c+1) */
2649 tarval *tv = get_Const_tarval(a);
2651 tv = tarval_add(tv, get_mode_one(mode));
2652 if (tv != tarval_bad) {
2653 ir_node *blk = get_nodes_block(n);
2654 ir_node *c = new_Const(tv);
2655 n = new_rd_Add(get_irn_dbg_info(n), blk, get_Not_op(b), c, mode);
2656 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_C_NOT_X);
2662 } /* transform_node_Sub */
2665 * Several transformation done on n*n=2n bits mul.
2666 * These transformations must be done here because new nodes may be produced.
2668 static ir_node *transform_node_Mul2n(ir_node *n, ir_mode *mode) {
2670 ir_node *a = get_Mul_left(n);
2671 ir_node *b = get_Mul_right(n);
2672 tarval *ta = value_of(a);
2673 tarval *tb = value_of(b);
2674 ir_mode *smode = get_irn_mode(a);
2676 if (ta == get_mode_one(smode)) {
2677 /* (L)1 * (L)b = (L)b */
2678 ir_node *blk = get_nodes_block(n);
2679 n = new_rd_Conv(get_irn_dbg_info(n), blk, b, mode);
2680 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2683 else if (ta == get_mode_minus_one(smode)) {
2684 /* (L)-1 * (L)b = (L)b */
2685 ir_node *blk = get_nodes_block(n);
2686 n = new_rd_Minus(get_irn_dbg_info(n), blk, b, smode);
2687 n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode);
2688 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2691 if (tb == get_mode_one(smode)) {
2692 /* (L)a * (L)1 = (L)a */
2693 ir_node *blk = get_irn_n(a, -1);
2694 n = new_rd_Conv(get_irn_dbg_info(n), blk, a, mode);
2695 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1);
2698 else if (tb == get_mode_minus_one(smode)) {
2699 /* (L)a * (L)-1 = (L)-a */
2700 ir_node *blk = get_nodes_block(n);
2701 n = new_rd_Minus(get_irn_dbg_info(n), blk, a, smode);
2702 n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode);
2703 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2710 * Transform Mul(a,-1) into -a.
2711 * Do constant evaluation of Phi nodes.
2712 * Do architecture dependent optimizations on Mul nodes
2714 static ir_node *transform_node_Mul(ir_node *n) {
2715 ir_node *c, *oldn = n;
2716 ir_mode *mode = get_irn_mode(n);
2717 ir_node *a = get_Mul_left(n);
2718 ir_node *b = get_Mul_right(n);
2720 if (is_Bad(a) || is_Bad(b))
2723 if (mode != get_irn_mode(a))
2724 return transform_node_Mul2n(n, mode);
2726 HANDLE_BINOP_PHI(tarval_mul, a, b, c, mode);
2728 if (mode_is_signed(mode)) {
2731 if (value_of(a) == get_mode_minus_one(mode))
2733 else if (value_of(b) == get_mode_minus_one(mode))
2736 n = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), r, mode);
2737 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2742 if (is_Const(b)) { /* (-a) * const -> a * -const */
2743 ir_node *cnst = const_negate(b);
2745 dbg_info *dbgi = get_irn_dbg_info(n);
2746 ir_node *block = get_nodes_block(n);
2747 n = new_rd_Mul(dbgi, block, get_Minus_op(a), cnst, mode);
2748 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1);
2751 } else if (is_Minus(b)) { /* (-a) * (-b) -> a * b */
2752 dbg_info *dbgi = get_irn_dbg_info(n);
2753 ir_node *block = get_nodes_block(n);
2754 n = new_rd_Mul(dbgi, block, get_Minus_op(a), get_Minus_op(b), mode);
2755 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_MINUS);
2757 } else if (is_Sub(b)) { /* (-a) * (b - c) -> a * (c - b) */
2758 ir_node *sub_l = get_Sub_left(b);
2759 ir_node *sub_r = get_Sub_right(b);
2760 dbg_info *dbgi = get_irn_dbg_info(n);
2761 ir_node *block = get_nodes_block(n);
2762 ir_node *new_b = new_rd_Sub(dbgi, block, sub_r, sub_l, mode);
2763 n = new_rd_Mul(dbgi, block, get_Minus_op(a), new_b, mode);
2764 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
2767 } else if (is_Minus(b)) {
2768 if (is_Sub(a)) { /* (a - b) * (-c) -> (b - a) * c */
2769 ir_node *sub_l = get_Sub_left(a);
2770 ir_node *sub_r = get_Sub_right(a);
2771 dbg_info *dbgi = get_irn_dbg_info(n);
2772 ir_node *block = get_nodes_block(n);
2773 ir_node *new_a = new_rd_Sub(dbgi, block, sub_r, sub_l, mode);
2774 n = new_rd_Mul(dbgi, block, new_a, get_Minus_op(b), mode);
2775 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS);
2778 } else if (is_Shl(a)) {
2779 ir_node *const shl_l = get_Shl_left(a);
2780 if (is_Const(shl_l) && is_Const_one(shl_l)) {
2781 /* (1 << x) * b -> b << x */
2782 dbg_info *const dbgi = get_irn_dbg_info(n);
2783 ir_node *const block = get_nodes_block(n);
2784 ir_node *const shl_r = get_Shl_right(a);
2785 n = new_rd_Shl(dbgi, block, b, shl_r, mode);
2786 // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT);
2789 } else if (is_Shl(b)) {
2790 ir_node *const shl_l = get_Shl_left(b);
2791 if (is_Const(shl_l) && is_Const_one(shl_l)) {
2792 /* a * (1 << x) -> a << x */
2793 dbg_info *const dbgi = get_irn_dbg_info(n);
2794 ir_node *const block = get_nodes_block(n);
2795 ir_node *const shl_r = get_Shl_right(b);
2796 n = new_rd_Shl(dbgi, block, a, shl_r, mode);
2797 // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT);
2801 if (get_mode_arithmetic(mode) == irma_ieee754) {
2803 tarval *tv = get_Const_tarval(a);
2804 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)
2805 && !tarval_is_negative(tv)) {
2806 /* 2.0 * b = b + b */
2807 n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), b, b, mode);
2808 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2812 else if (is_Const(b)) {
2813 tarval *tv = get_Const_tarval(b);
2814 if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv)
2815 && !tarval_is_negative(tv)) {
2816 /* a * 2.0 = a + a */
2817 n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), a, a, mode);
2818 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A);
2823 return arch_dep_replace_mul_with_shifts(n);
2824 } /* transform_node_Mul */
2827 * Transform a Div Node.
2829 static ir_node *transform_node_Div(ir_node *n) {
2830 ir_mode *mode = get_Div_resmode(n);
2831 ir_node *a = get_Div_left(n);
2832 ir_node *b = get_Div_right(n);
2834 const ir_node *dummy;
2836 if (is_Const(b) && is_const_Phi(a)) {
2837 /* check for Div(Phi, Const) */
2838 value = apply_binop_on_phi(a, get_Const_tarval(b), tarval_div, mode, 0);
2840 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2844 else if (is_Const(a) && is_const_Phi(b)) {
2845 /* check for Div(Const, Phi) */
2846 value = apply_binop_on_phi(b, get_Const_tarval(a), tarval_div, mode, 1);
2848 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2852 else if (is_const_Phi(a) && is_const_Phi(b)) {
2853 /* check for Div(Phi, Phi) */
2854 value = apply_binop_on_2_phis(a, b, tarval_div, mode);
2856 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2863 if (a == b && value_not_zero(a, &dummy)) {
2864 /* BEWARE: we can optimize a/a to 1 only if this cannot cause a exception */
2865 value = new_Const(get_mode_one(mode));
2866 DBG_OPT_CSTEVAL(n, value);
2869 if (mode_is_signed(mode) && is_Const(b)) {
2870 tarval *tv = get_Const_tarval(b);
2872 if (tv == get_mode_minus_one(mode)) {
2874 value = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), a, mode);
2875 DBG_OPT_CSTEVAL(n, value);
2879 /* Try architecture dependent optimization */
2880 value = arch_dep_replace_div_by_const(n);
2887 /* Turn Div into a tuple (mem, jmp, bad, value) */
2888 mem = get_Div_mem(n);
2889 blk = get_nodes_block(n);
2891 /* skip a potential Pin */
2892 mem = skip_Pin(mem);
2893 turn_into_tuple(n, pn_Div_max);
2894 set_Tuple_pred(n, pn_Div_M, mem);
2895 set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(blk));
2896 set_Tuple_pred(n, pn_Div_X_except, new_Bad());
2897 set_Tuple_pred(n, pn_Div_res, value);
2900 } /* transform_node_Div */
2903 * Transform a Mod node.
2905 static ir_node *transform_node_Mod(ir_node *n) {
2906 ir_mode *mode = get_Mod_resmode(n);
2907 ir_node *a = get_Mod_left(n);
2908 ir_node *b = get_Mod_right(n);
2912 if (is_Const(b) && is_const_Phi(a)) {
2913 /* check for Div(Phi, Const) */
2914 value = apply_binop_on_phi(a, get_Const_tarval(b), tarval_mod, mode, 0);
2916 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2920 else if (is_Const(a) && is_const_Phi(b)) {
2921 /* check for Div(Const, Phi) */
2922 value = apply_binop_on_phi(b, get_Const_tarval(a), tarval_mod, mode, 1);
2924 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2928 else if (is_const_Phi(a) && is_const_Phi(b)) {
2929 /* check for Div(Phi, Phi) */
2930 value = apply_binop_on_2_phis(a, b, tarval_mod, mode);
2932 DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI);
2939 if (tv != tarval_bad) {
2940 value = new_Const(tv);
2942 DBG_OPT_CSTEVAL(n, value);
2945 ir_node *a = get_Mod_left(n);
2946 ir_node *b = get_Mod_right(n);
2947 const ir_node *dummy;
2949 if (a == b && value_not_zero(a, &dummy)) {
2950 /* BEWARE: we can optimize a%a to 0 only if this cannot cause a exception */
2951 value = new_Const(get_mode_null(mode));
2952 DBG_OPT_CSTEVAL(n, value);
2955 if (mode_is_signed(mode) && is_Const(b)) {
2956 tarval *tv = get_Const_tarval(b);
2958 if (tv == get_mode_minus_one(mode)) {
2960 value = new_Const(get_mode_null(mode));
2961 DBG_OPT_CSTEVAL(n, value);
2965 /* Try architecture dependent optimization */
2966 value = arch_dep_replace_mod_by_const(n);
2974 /* Turn Mod into a tuple (mem, jmp, bad, value) */
2975 mem = get_Mod_mem(n);
2976 blk = get_nodes_block(n);
2978 /* skip a potential Pin */
2979 mem = skip_Pin(mem);
2980 turn_into_tuple(n, pn_Mod_max);
2981 set_Tuple_pred(n, pn_Mod_M, mem);
2982 set_Tuple_pred(n, pn_Mod_X_regular, new_r_Jmp(blk));
2983 set_Tuple_pred(n, pn_Mod_X_except, new_Bad());
2984 set_Tuple_pred(n, pn_Mod_res, value);
2987 } /* transform_node_Mod */
2990 * Transform a DivMod node.
2992 static ir_node *transform_node_DivMod(ir_node *n) {
2993 const ir_node *dummy;
2994 ir_node *a = get_DivMod_left(n);
2995 ir_node *b = get_DivMod_right(n);
2996 ir_mode *mode = get_DivMod_resmode(n);
3001 if (is_Const(b) && is_const_Phi(a)) {
3002 /* check for Div(Phi, Const) */
3003 va = apply_binop_on_phi(a, get_Const_tarval(b), tarval_div, mode, 0);
3004 vb = apply_binop_on_phi(a, get_Const_tarval(b), tarval_mod, mode, 0);
3006 DBG_OPT_ALGSIM0(n, va, FS_OPT_CONST_PHI);
3007 DBG_OPT_ALGSIM0(n, vb, FS_OPT_CONST_PHI);
3011 else if (is_Const(a) && is_const_Phi(b)) {
3012 /* check for Div(Const, Phi) */
3013 va = apply_binop_on_phi(b, get_Const_tarval(a), tarval_div, mode, 1);
3014 vb = apply_binop_on_phi(b, get_Const_tarval(a), tarval_mod, mode, 1);
3016 DBG_OPT_ALGSIM0(n, va, FS_OPT_CONST_PHI);
3017 DBG_OPT_ALGSIM0(n, vb, FS_OPT_CONST_PHI);
3021 else if (is_const_Phi(a) && is_const_Phi(b)) {
3022 /* check for Div(Phi, Phi) */
3023 va = apply_binop_on_2_phis(a, b, tarval_div, mode);
3024 vb = apply_binop_on_2_phis(a, b, tarval_mod, mode);
3026 DBG_OPT_ALGSIM0(n, va, FS_OPT_CONST_PHI);
3027 DBG_OPT_ALGSIM0(n, vb, FS_OPT_CONST_PHI);
3034 if (tb != tarval_bad) {
3035 if (tb == get_mode_one(get_tarval_mode(tb))) {
3037 vb = new_Const(get_mode_null(mode));
3038 DBG_OPT_CSTEVAL(n, vb);
3040 } else if (ta != tarval_bad) {
3041 tarval *resa, *resb;
3042 resa = tarval_div(ta, tb);
3043 if (resa == tarval_bad) return n; /* Causes exception!!! Model by replacing through
3044 Jmp for X result!? */
3045 resb = tarval_mod(ta, tb);
3046 if (resb == tarval_bad) return n; /* Causes exception! */
3047 va = new_Const(resa);
3048 vb = new_Const(resb);
3049 DBG_OPT_CSTEVAL(n, va);
3050 DBG_OPT_CSTEVAL(n, vb);
3052 } else if (mode_is_signed(mode) && tb == get_mode_minus_one(mode)) {
3053 va = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), a, mode);
3054 vb = new_Const(get_mode_null(mode));
3055 DBG_OPT_CSTEVAL(n, va);
3056 DBG_OPT_CSTEVAL(n, vb);
3058 } else { /* Try architecture dependent optimization */
3061 arch_dep_replace_divmod_by_const(&va, &vb, n);
3062 evaluated = va != NULL;
3064 } else if (a == b) {
3065 if (value_not_zero(a, &dummy)) {
3067 va = new_Const(get_mode_one(mode));
3068 vb = new_Const(get_mode_null(mode));
3069 DBG_OPT_CSTEVAL(n, va);
3070 DBG_OPT_CSTEVAL(n, vb);
3073 /* BEWARE: it is NOT possible to optimize a/a to 1, as this may cause a exception */
3076 } else if (ta == get_mode_null(mode) && value_not_zero(b, &dummy)) {
3077 /* 0 / non-Const = 0 */
3082 if (evaluated) { /* replace by tuple */
3086 mem = get_DivMod_mem(n);
3087 /* skip a potential Pin */
3088 mem = skip_Pin(mem);
3090 blk = get_nodes_block(n);
3091 turn_into_tuple(n, pn_DivMod_max);
3092 set_Tuple_pred(n, pn_DivMod_M, mem);
3093 set_Tuple_pred(n, pn_DivMod_X_regular, new_r_Jmp(blk));
3094 set_Tuple_pred(n, pn_DivMod_X_except, new_Bad()); /* no exception */
3095 set_Tuple_pred(n, pn_DivMod_res_div, va);
3096 set_Tuple_pred(n, pn_DivMod_res_mod, vb);
3100 } /* transform_node_DivMod */
3103 * Optimize x / c to x * (1/c)
3105 static ir_node *transform_node_Quot(ir_node *n) {
3106 ir_mode *mode = get_Quot_resmode(n);
3109 if (get_mode_arithmetic(mode) == irma_ieee754) {
3110 ir_node *b = get_Quot_right(n);
3111 tarval *tv = value_of(b);
3113 if (tv != tarval_bad) {
3114 int rem = tarval_fp_ops_enabled();
3117 * Floating point constant folding might be disabled here to
3119 * However, as we check for exact result, doing it is safe.
3122 tarval_enable_fp_ops(1);
3123 tv = tarval_quo(get_mode_one(mode), tv);
3124 tarval_enable_fp_ops(rem);
3126 /* Do the transformation if the result is either exact or we are not
3127 using strict rules. */
3128 if (tv != tarval_bad &&
3129 (tarval_ieee754_get_exact() || (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic) == 0)) {
3130 ir_node *blk = get_nodes_block(n);
3131 ir_node *c = new_Const(tv);
3132 ir_node *a = get_Quot_left(n);
3133 ir_node *m = new_rd_Mul(get_irn_dbg_info(n), blk, a, c, mode);
3134 ir_node *mem = get_Quot_mem(n);
3136 /* skip a potential Pin */
3137 mem = skip_Pin(mem);
3138 turn_into_tuple(n, pn_Quot_max);
3139 set_Tuple_pred(n, pn_Quot_M, mem);
3140 set_Tuple_pred(n, pn_Quot_X_regular, new_r_Jmp(blk));
3141 set_Tuple_pred(n, pn_Quot_X_except, new_Bad());
3142 set_Tuple_pred(n, pn_Quot_res, m);
3143 DBG_OPT_ALGSIM1(oldn, a, b, m, FS_OPT_FP_INV_MUL);
3148 } /* transform_node_Quot */
3151 * Optimize Abs(x) into x if x is Confirmed >= 0
3152 * Optimize Abs(x) into -x if x is Confirmed <= 0
3153 * Optimize Abs(-x) int Abs(x)
3155 static ir_node *transform_node_Abs(ir_node *n) {
3156 ir_node *c, *oldn = n;
3157 ir_node *a = get_Abs_op(n);
3160 HANDLE_UNOP_PHI(tarval_abs, a, c);
3162 switch (classify_value_sign(a)) {
3163 case value_classified_negative:
3164 mode = get_irn_mode(n);
3167 * We can replace the Abs by -x here.
3168 * We even could add a new Confirm here
3169 * (if not twos complement)
3171 * Note that -x would create a new node, so we could
3172 * not run it in the equivalent_node() context.
3174 n = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), a, mode);
3176 DBG_OPT_CONFIRM(oldn, n);
3178 case value_classified_positive:
3179 /* n is positive, Abs is not needed */
3182 DBG_OPT_CONFIRM(oldn, n);
3188 /* Abs(-x) = Abs(x) */
3189 mode = get_irn_mode(n);
3190 n = new_rd_Abs(get_irn_dbg_info(n), get_nodes_block(n), get_Minus_op(a), mode);
3191 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ABS_MINUS_X);
3195 } /* transform_node_Abs */
3198 * Optimize -a CMP -b into b CMP a.
3199 * This works only for for modes where unary Minus
3201 * Note that two-complement integers can Overflow
3202 * so it will NOT work.
3204 * For == and != can be handled in Proj(Cmp)
3206 static ir_node *transform_node_Cmp(ir_node *n) {
3208 ir_node *left = get_Cmp_left(n);
3209 ir_node *right = get_Cmp_right(n);
3211 if (is_Minus(left) && is_Minus(right) &&
3212 !mode_overflow_on_unary_Minus(get_irn_mode(left))) {
3213 ir_node *const new_left = get_Minus_op(right);
3214 ir_node *const new_right = get_Minus_op(left);
3215 n = new_rd_Cmp(get_irn_dbg_info(n), get_nodes_block(n), new_left, new_right);
3216 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CMP_OP_OP);
3219 } /* transform_node_Cmp */
3223 * Transform a Cond node.
3225 * Replace the Cond by a Jmp if it branches on a constant
3228 static ir_node *transform_node_Cond(ir_node *n) {
3231 ir_node *a = get_Cond_selector(n);
3232 tarval *ta = value_of(a);
3234 /* we need block info which is not available in floating irgs */
3235 if (get_irg_pinned(current_ir_graph) == op_pin_state_floats)
3238 if ((ta != tarval_bad) &&
3239 (get_irn_mode(a) == mode_b) &&
3240 (get_opt_unreachable_code())) {
3241 /* It's a boolean Cond, branching on a boolean constant.
3242 Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
3243 ir_node *blk = get_nodes_block(n);
3244 jmp = new_r_Jmp(blk);
3245 turn_into_tuple(n, pn_Cond_max);
3246 if (ta == tarval_b_true) {
3247 set_Tuple_pred(n, pn_Cond_false, new_Bad());
3248 set_Tuple_pred(n, pn_Cond_true, jmp);
3250 set_Tuple_pred(n, pn_Cond_false, jmp);
3251 set_Tuple_pred(n, pn_Cond_true, new_Bad());
3253 /* We might generate an endless loop, so keep it alive. */
3254 add_End_keepalive(get_irg_end(current_ir_graph), blk);
3257 } /* transform_node_Cond */
3260 * Prototype of a recursive transform function
3261 * for bitwise distributive transformations.
3263 typedef ir_node* (*recursive_transform)(ir_node *n);
3266 * makes use of distributive laws for and, or, eor
3267 * and(a OP c, b OP c) -> and(a, b) OP c
3268 * note, might return a different op than n
3270 static ir_node *transform_bitwise_distributive(ir_node *n,
3271 recursive_transform trans_func)
3274 ir_node *a = get_binop_left(n);
3275 ir_node *b = get_binop_right(n);
3276 ir_op *op = get_irn_op(a);
3277 ir_op *op_root = get_irn_op(n);
3279 if(op != get_irn_op(b))
3282 /* and(conv(a), conv(b)) -> conv(and(a,b)) */
3283 if (op == op_Conv) {
3284 ir_node *a_op = get_Conv_op(a);
3285 ir_node *b_op = get_Conv_op(b);
3286 ir_mode *a_mode = get_irn_mode(a_op);
3287 ir_mode *b_mode = get_irn_mode(b_op);
3288 if(a_mode == b_mode && (mode_is_int(a_mode) || a_mode == mode_b)) {
3289 ir_node *blk = get_nodes_block(n);
3292 set_binop_left(n, a_op);
3293 set_binop_right(n, b_op);
3294 set_irn_mode(n, a_mode);
3296 n = new_r_Conv(blk, n, get_irn_mode(oldn));
3298 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
3304 /* nothing to gain here */
3308 if (op == op_Shrs || op == op_Shr || op == op_Shl
3309 || op == op_And || op == op_Or || op == op_Eor) {
3310 ir_node *a_left = get_binop_left(a);
3311 ir_node *a_right = get_binop_right(a);
3312 ir_node *b_left = get_binop_left(b);
3313 ir_node *b_right = get_binop_right(b);
3315 ir_node *op1 = NULL;
3316 ir_node *op2 = NULL;
3318 if (is_op_commutative(op)) {
3319 if (a_left == b_left) {
3323 } else if(a_left == b_right) {
3327 } else if(a_right == b_left) {
3333 if(a_right == b_right) {
3340 /* (a sop c) & (b sop c) => (a & b) sop c */
3341 ir_node *blk = get_nodes_block(n);
3343 ir_node *new_n = exact_copy(n);
3344 set_binop_left(new_n, op1);
3345 set_binop_right(new_n, op2);
3346 new_n = trans_func(new_n);
3348 if(op_root == op_Eor && op == op_Or) {
3349 dbg_info *dbgi = get_irn_dbg_info(n);
3350 ir_mode *mode = get_irn_mode(c);
3352 c = new_rd_Not(dbgi, blk, c, mode);
3353 n = new_rd_And(dbgi, blk, new_n, c, mode);
3356 set_nodes_block(n, blk);
3357 set_binop_left(n, new_n);
3358 set_binop_right(n, c);
3359 add_identities(current_ir_graph->value_table, n);
3362 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND);
3373 static ir_node *transform_node_And(ir_node *n) {
3374 ir_node *c, *oldn = n;
3375 ir_node *a = get_And_left(n);
3376 ir_node *b = get_And_right(n);
3379 mode = get_irn_mode(n);
3380 HANDLE_BINOP_PHI(tarval_and, a, b, c, mode);
3382 /* we can evaluate 2 Projs of the same Cmp */
3383 if (mode == mode_b && is_Proj(a) && is_Proj(b)) {
3384 ir_node *pred_a = get_Proj_pred(a);
3385 ir_node *pred_b = get_Proj_pred(b);
3386 if (pred_a == pred_b) {
3387 dbg_info *dbgi = get_irn_dbg_info(n);
3388 ir_node *block = get_nodes_block(pred_a);
3389 pn_Cmp pn_a = get_Proj_proj(a);
3390 pn_Cmp pn_b = get_Proj_proj(b);
3391 /* yes, we can simply calculate with pncs */
3392 pn_Cmp new_pnc = pn_a & pn_b;
3394 return new_rd_Proj(dbgi, block, pred_a, mode_b, new_pnc);
3399 ir_node *op = get_Not_op(b);
3401 ir_node *ba = get_And_left(op);
3402 ir_node *bb = get_And_right(op);
3404 /* it's enough to test the following cases due to normalization! */
3405 if (get_Or_left(a) == ba && get_Or_right(a) == bb) {
3406 /* (a|b) & ~(a&b) = a^b */
3407 ir_node *block = get_nodes_block(n);
3409 n = new_rd_Eor(get_irn_dbg_info(n), block, ba, bb, mode);
3410 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
3418 ir_node *op = get_Not_op(a);
3420 ir_node *aa = get_And_left(op);
3421 ir_node *ab = get_And_right(op);
3423 /* it's enough to test the following cases due to normalization! */
3424 if (get_Or_left(b) == aa && get_Or_right(b) == ab) {
3425 /* (a|b) & ~(a&b) = a^b */
3426 ir_node *block = get_nodes_block(n);
3428 n = new_rd_Eor(get_irn_dbg_info(n), block, aa, ab, mode);
3429 DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR);
3436 ir_node *al = get_Eor_left(a);
3437 ir_node *ar = get_Eor_right(a);
3440 /* (b ^ a) & b -> ~a & b */
3441 dbg_info *dbg = get_irn_dbg_info(n);
3442 ir_node *block = get_nodes_block(n);
3444 ar = new_rd_Not(dbg, block, ar, mode);
3445 n = new_rd_And(dbg, block, ar, b, mode);
3446 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3450 /* (a ^ b) & b -> ~a & b */
3451 dbg_info *dbg = get_irn_dbg_info(n);
3452 ir_node *block = get_nodes_block(n);
3454 al = new_rd_Not(dbg, block, al, mode);
3455 n = new_rd_And(dbg, block, al, b, mode);
3456 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3461 ir_node *bl = get_Eor_left(b);
3462 ir_node *br = get_Eor_right(b);
3465 /* a & (a ^ b) -> a & ~b */
3466 dbg_info *dbg = get_irn_dbg_info(n);
3467 ir_node *block = get_nodes_block(n);
3469 br = new_rd_Not(dbg, block, br, mode);
3470 n = new_rd_And(dbg, block, br, a, mode);
3471 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3475 /* a & (b ^ a) -> a & ~b */
3476 dbg_info *dbg = get_irn_dbg_info(n);
3477 ir_node *block = get_nodes_block(n);
3479 bl = new_rd_Not(dbg, block, bl, mode);
3480 n = new_rd_And(dbg, block, bl, a, mode);
3481 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3485 if (is_Not(a) && is_Not(b)) {
3486 /* ~a & ~b = ~(a|b) */
3487 ir_node *block = get_nodes_block(n);
3488 ir_mode *mode = get_irn_mode(n);
3492 n = new_rd_Or(get_irn_dbg_info(n), block, a, b, mode);
3493 n = new_rd_Not(get_irn_dbg_info(n), block, n, mode);
3494 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
3498 n = transform_bitwise_distributive(n, transform_node_And);
3501 } /* transform_node_And */
3506 static ir_node *transform_node_Eor(ir_node *n) {
3507 ir_node *c, *oldn = n;
3508 ir_node *a = get_Eor_left(n);
3509 ir_node *b = get_Eor_right(n);
3510 ir_mode *mode = get_irn_mode(n);
3512 HANDLE_BINOP_PHI(tarval_eor, a, b, c, mode);
3514 /* we can evaluate 2 Projs of the same Cmp */
3515 if (mode == mode_b && is_Proj(a) && is_Proj(b)) {
3516 ir_node *pred_a = get_Proj_pred(a);
3517 ir_node *pred_b = get_Proj_pred(b);
3518 if(pred_a == pred_b) {
3519 dbg_info *dbgi = get_irn_dbg_info(n);
3520 ir_node *block = get_nodes_block(pred_a);
3521 pn_Cmp pn_a = get_Proj_proj(a);
3522 pn_Cmp pn_b = get_Proj_proj(b);
3523 /* yes, we can simply calculate with pncs */
3524 pn_Cmp new_pnc = pn_a ^ pn_b;
3526 return new_rd_Proj(dbgi, block, pred_a, mode_b, new_pnc);
3532 n = new_rd_Const(get_irn_dbg_info(n), current_ir_graph,
3533 get_mode_null(mode));
3534 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_A_A);
3535 } else if (mode == mode_b &&
3537 is_Const(b) && is_Const_one(b) &&
3538 is_Cmp(get_Proj_pred(a))) {
3539 /* The Eor negates a Cmp. The Cmp has the negated result anyways! */
3540 n = new_r_Proj(get_nodes_block(n), get_Proj_pred(a),
3541 mode_b, get_negated_pnc(get_Proj_proj(a), mode));
3543 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT_BOOL);
3544 } else if (is_Const(b)) {
3545 if (is_Not(a)) { /* ~x ^ const -> x ^ ~const */
3546 ir_node *cnst = new_Const(tarval_not(get_Const_tarval(b)));
3547 ir_node *not_op = get_Not_op(a);
3548 dbg_info *dbg = get_irn_dbg_info(n);
3549 ir_node *block = get_nodes_block(n);
3550 ir_mode *mode = get_irn_mode(n);
3551 n = new_rd_Eor(dbg, block, not_op, cnst, mode);
3553 } else if (is_Const_all_one(b)) { /* x ^ 1...1 -> ~1 */
3554 n = new_r_Not(get_nodes_block(n), a, mode);
3555 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT);
3558 n = transform_bitwise_distributive(n, transform_node_Eor);
3562 } /* transform_node_Eor */
3567 static ir_node *transform_node_Not(ir_node *n) {
3568 ir_node *c, *oldn = n;
3569 ir_node *a = get_Not_op(n);
3570 ir_mode *mode = get_irn_mode(n);
3572 HANDLE_UNOP_PHI(tarval_not,a,c);
3574 /* check for a boolean Not */
3575 if (mode == mode_b && is_Proj(a)) {
3576 ir_node *a_pred = get_Proj_pred(a);
3577 if (is_Cmp(a_pred)) {
3578 ir_node *cmp_block = get_nodes_block(a_pred);
3579 /* We negate a Cmp. The Cmp has the negated result anyways! */
3580 n = new_r_Proj(cmp_block, get_Proj_pred(a),
3581 mode_b, get_negated_pnc(get_Proj_proj(a), mode_b));
3582 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP);
3587 ir_node *eor_b = get_Eor_right(a);
3588 if (is_Const(eor_b)) { /* ~(x ^ const) -> x ^ ~const */
3589 ir_node *cnst = new_Const(tarval_not(get_Const_tarval(eor_b)));
3590 ir_node *eor_a = get_Eor_left(a);
3591 dbg_info *dbg = get_irn_dbg_info(n);
3592 ir_node *block = get_nodes_block(n);
3593 ir_mode *mode = get_irn_mode(n);
3594 n = new_rd_Eor(dbg, block, eor_a, cnst, mode);
3598 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3599 if (is_Minus(a)) { /* ~-x -> x + -1 */
3600 dbg_info *dbg = get_irn_dbg_info(n);
3601 ir_graph *irg = current_ir_graph;
3602 ir_node *block = get_nodes_block(n);
3603 ir_node *add_l = get_Minus_op(a);
3604 ir_node *add_r = new_rd_Const(dbg, irg, get_mode_minus_one(mode));
3605 n = new_rd_Add(dbg, block, add_l, add_r, mode);
3606 } else if (is_Add(a)) {
3607 ir_node *add_r = get_Add_right(a);
3608 if (is_Const(add_r) && is_Const_all_one(add_r)) {
3609 /* ~(x + -1) = -x */
3610 ir_node *op = get_Add_left(a);
3611 ir_node *blk = get_nodes_block(n);
3612 n = new_rd_Minus(get_irn_dbg_info(n), blk, op, get_irn_mode(n));
3613 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_MINUS_1);
3618 } /* transform_node_Not */
3621 * Transform a Minus.
3625 * -(a >>u (size-1)) = a >>s (size-1)
3626 * -(a >>s (size-1)) = a >>u (size-1)
3627 * -(a * const) -> a * -const
3629 static ir_node *transform_node_Minus(ir_node *n) {
3630 ir_node *c, *oldn = n;
3631 ir_node *a = get_Minus_op(n);
3634 HANDLE_UNOP_PHI(tarval_neg,a,c);
3636 mode = get_irn_mode(a);
3637 if (get_mode_arithmetic(mode) == irma_twos_complement) {
3638 /* the following rules are only to twos-complement */
3641 ir_node *op = get_Not_op(a);
3642 tarval *tv = get_mode_one(mode);
3643 ir_node *blk = get_nodes_block(n);
3644 ir_node *c = new_Const(tv);
3645 n = new_rd_Add(get_irn_dbg_info(n), blk, op, c, mode);
3646 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_NOT);
3650 ir_node *c = get_Shr_right(a);
3653 tarval *tv = get_Const_tarval(c);
3655 if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) {
3656 /* -(a >>u (size-1)) = a >>s (size-1) */
3657 ir_node *v = get_Shr_left(a);
3659 n = new_rd_Shrs(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode);
3660 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3666 ir_node *c = get_Shrs_right(a);
3669 tarval *tv = get_Const_tarval(c);
3671 if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) {
3672 /* -(a >>s (size-1)) = a >>u (size-1) */
3673 ir_node *v = get_Shrs_left(a);
3675 n = new_rd_Shr(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode);
3676 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE);
3683 /* - (a-b) = b - a */
3684 ir_node *la = get_Sub_left(a);
3685 ir_node *ra = get_Sub_right(a);
3686 ir_node *blk = get_nodes_block(n);
3688 n = new_rd_Sub(get_irn_dbg_info(n), blk, ra, la, mode);
3689 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_SUB);
3693 if (is_Mul(a)) { /* -(a * const) -> a * -const */
3694 ir_node *mul_l = get_Mul_left(a);
3695 ir_node *mul_r = get_Mul_right(a);
3696 tarval *tv = value_of(mul_r);
3697 if (tv != tarval_bad) {
3698 tv = tarval_neg(tv);
3699 if (tv != tarval_bad) {
3700 ir_node *cnst = new_Const(tv);
3701 dbg_info *dbg = get_irn_dbg_info(a);
3702 ir_node *block = get_nodes_block(a);
3703 n = new_rd_Mul(dbg, block, mul_l, cnst, mode);
3704 DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_MUL_C);
3711 } /* transform_node_Minus */
3714 * Transform a Cast_type(Const) into a new Const_type
3716 static ir_node *transform_node_Cast(ir_node *n) {
3718 ir_node *pred = get_Cast_op(n);
3719 ir_type *tp = get_irn_type(n);
3721 if (is_Const(pred) && get_Const_type(pred) != tp) {
3722 n = new_rd_Const_type(NULL, current_ir_graph, get_Const_tarval(pred), tp);
3723 DBG_OPT_CSTEVAL(oldn, n);
3724 } else if (is_SymConst(pred) && get_SymConst_value_type(pred) != tp) {
3725 n = new_rd_SymConst_type(NULL, current_ir_graph, get_irn_mode(pred),
3726 get_SymConst_symbol(pred), get_SymConst_kind(pred), tp);
3727 DBG_OPT_CSTEVAL(oldn, n);
3731 } /* transform_node_Cast */
3734 * Transform a Proj(Load) with a non-null address.
3736 static ir_node *transform_node_Proj_Load(ir_node *proj) {
3737 if (get_opt_ldst_only_null_ptr_exceptions()) {
3738 if (get_irn_mode(proj) == mode_X) {
3739 ir_node *load = get_Proj_pred(proj);
3741 /* get the Load address */
3742 const ir_node *addr = get_Load_ptr(load);
3743 const ir_node *confirm;
3745 if (value_not_null(addr, &confirm)) {
3746 if (confirm == NULL) {
3747 /* this node may float if it did not depend on a Confirm */
3748 set_irn_pinned(load, op_pin_state_floats);
3750 if (get_Proj_proj(proj) == pn_Load_X_except) {
3751 DBG_OPT_EXC_REM(proj);
3752 return get_irg_bad(current_ir_graph);
3754 ir_node *blk = get_nodes_block(load);
3755 return new_r_Jmp(blk);
3761 } /* transform_node_Proj_Load */
3764 * Transform a Proj(Store) with a non-null address.
3766 static ir_node *transform_node_Proj_Store(ir_node *proj) {
3767 if (get_opt_ldst_only_null_ptr_exceptions()) {
3768 if (get_irn_mode(proj) == mode_X) {
3769 ir_node *store = get_Proj_pred(proj);
3771 /* get the load/store address */
3772 const ir_node *addr = get_Store_ptr(store);
3773 const ir_node *confirm;
3775 if (value_not_null(addr, &confirm)) {
3776 if (confirm == NULL) {
3777 /* this node may float if it did not depend on a Confirm */
3778 set_irn_pinned(store, op_pin_state_floats);
3780 if (get_Proj_proj(proj) == pn_Store_X_except) {
3781 DBG_OPT_EXC_REM(proj);
3782 return get_irg_bad(current_ir_graph);
3784 ir_node *blk = get_nodes_block(store);
3785 return new_r_Jmp(blk);
3791 } /* transform_node_Proj_Store */
3794 * Transform a Proj(Div) with a non-zero value.
3795 * Removes the exceptions and routes the memory to the NoMem node.
3797 static ir_node *transform_node_Proj_Div(ir_node *proj) {
3798 ir_node *div = get_Proj_pred(proj);
3799 ir_node *b = get_Div_right(div);
3800 ir_node *res, *new_mem;
3801 const ir_node *confirm;
3804 if (value_not_zero(b, &confirm)) {
3805 /* div(x, y) && y != 0 */
3806 if (confirm == NULL) {
3807 /* we are sure we have a Const != 0 */
3808 new_mem = get_Div_mem(div);
3809 new_mem = skip_Pin(new_mem);
3810 set_Div_mem(div, new_mem);
3811 set_irn_pinned(div, op_pin_state_floats);
3814 proj_nr = get_Proj_proj(proj);
3816 case pn_Div_X_regular:
3817 return new_r_Jmp(get_nodes_block(div));
3819 case pn_Div_X_except:
3820 /* we found an exception handler, remove it */
3821 DBG_OPT_EXC_REM(proj);
3825 res = get_Div_mem(div);
3826 new_mem = get_irg_no_mem(current_ir_graph);
3829 /* This node can only float up to the Confirm block */
3830 new_mem = new_r_Pin(get_nodes_block(confirm), new_mem);
3832 set_irn_pinned(div, op_pin_state_floats);
3833 /* this is a Div without exception, we can remove the memory edge */
3834 set_Div_mem(div, new_mem);
3839 } /* transform_node_Proj_Div */
3842 * Transform a Proj(Mod) with a non-zero value.
3843 * Removes the exceptions and routes the memory to the NoMem node.
3845 static ir_node *transform_node_Proj_Mod(ir_node *proj) {
3846 ir_node *mod = get_Proj_pred(proj);
3847 ir_node *b = get_Mod_right(mod);
3848 ir_node *res, *new_mem;
3849 const ir_node *confirm;
3852 if (value_not_zero(b, &confirm)) {
3853 /* mod(x, y) && y != 0 */
3854 proj_nr = get_Proj_proj(proj);
3856 if (confirm == NULL) {
3857 /* we are sure we have a Const != 0 */
3858 new_mem = get_Mod_mem(mod);
3859 new_mem = skip_Pin(new_mem);
3860 set_Mod_mem(mod, new_mem);
3861 set_irn_pinned(mod, op_pin_state_floats);
3866 case pn_Mod_X_regular:
3867 return new_r_Jmp(get_irn_n(mod, -1));
3869 case pn_Mod_X_except:
3870 /* we found an exception handler, remove it */
3871 DBG_OPT_EXC_REM(proj);
3875 res = get_Mod_mem(mod);
3876 new_mem = get_irg_no_mem(current_ir_graph);
3879 /* This node can only float up to the Confirm block */
3880 new_mem = new_r_Pin(get_nodes_block(confirm), new_mem);
3882 /* this is a Mod without exception, we can remove the memory edge */
3883 set_Mod_mem(mod, new_mem);
3886 if (get_Mod_left(mod) == b) {
3887 /* a % a = 0 if a != 0 */
3888 ir_mode *mode = get_irn_mode(proj);
3889 ir_node *res = new_Const(get_mode_null(mode));
3891 DBG_OPT_CSTEVAL(mod, res);
3897 } /* transform_node_Proj_Mod */
3900 * Transform a Proj(DivMod) with a non-zero value.
3901 * Removes the exceptions and routes the memory to the NoMem node.
3903 static ir_node *transform_node_Proj_DivMod(ir_node *proj) {
3904 ir_node *divmod = get_Proj_pred(proj);
3905 ir_node *b = get_DivMod_right(divmod);
3906 ir_node *res, *new_mem;
3907 const ir_node *confirm;
3910 if (value_not_zero(b, &confirm)) {
3911 /* DivMod(x, y) && y != 0 */
3912 proj_nr = get_Proj_proj(proj);
3914 if (confirm == NULL) {
3915 /* we are sure we have a Const != 0 */
3916 new_mem = get_DivMod_mem(divmod);
3917 new_mem = skip_Pin(new_mem);
3918 set_DivMod_mem(divmod, new_mem);
3919 set_irn_pinned(divmod, op_pin_state_floats);
3924 case pn_DivMod_X_regular:
3925 return new_r_Jmp(get_nodes_block(divmod));
3927 case pn_DivMod_X_except:
3928 /* we found an exception handler, remove it */
3929 DBG_OPT_EXC_REM(proj);
3933 res = get_DivMod_mem(divmod);
3934 new_mem = get_irg_no_mem(current_ir_graph);
3937 /* This node can only float up to the Confirm block */
3938 new_mem = new_r_Pin(get_nodes_block(confirm), new_mem);
3940 /* this is a DivMod without exception, we can remove the memory edge */
3941 set_DivMod_mem(divmod, new_mem);
3944 case pn_DivMod_res_mod:
3945 if (get_DivMod_left(divmod) == b) {
3946 /* a % a = 0 if a != 0 */
3947 ir_mode *mode = get_irn_mode(proj);
3948 ir_node *res = new_Const(get_mode_null(mode));
3950 DBG_OPT_CSTEVAL(divmod, res);
3956 } /* transform_node_Proj_DivMod */
3959 * Optimizes jump tables (CondIs or CondIu) by removing all impossible cases.
3961 static ir_node *transform_node_Proj_Cond(ir_node *proj) {
3962 if (get_opt_unreachable_code()) {
3963 ir_node *n = get_Proj_pred(proj);
3964 ir_node *b = get_Cond_selector(n);
3966 if (mode_is_int(get_irn_mode(b))) {
3967 tarval *tb = value_of(b);
3969 if (tb != tarval_bad) {
3970 /* we have a constant switch */
3971 long num = get_Proj_proj(proj);
3973 if (num != get_Cond_default_proj(n)) { /* we cannot optimize default Proj's yet */
3974 if (get_tarval_long(tb) == num) {
3975 /* Do NOT create a jump here, or we will have 2 control flow ops
3976 * in a block. This case is optimized away in optimize_cf(). */
3979 /* this case will NEVER be taken, kill it */
3980 return get_irg_bad(current_ir_graph);
3987 } /* transform_node_Proj_Cond */
3990 * Create a 0 constant of given mode.
3992 static ir_node *create_zero_const(ir_mode *mode) {
3993 tarval *tv = get_mode_null(mode);
3994 ir_node *cnst = new_Const(tv);
3999 /* the order of the values is important! */
4000 typedef enum const_class {
4006 static const_class classify_const(const ir_node* n)
4008 if (is_Const(n)) return const_const;
4009 if (is_irn_constlike(n)) return const_like;
4014 * Determines whether r is more constlike or has a larger index (in that order)
4017 static int operands_are_normalized(const ir_node *l, const ir_node *r)
4019 const const_class l_order = classify_const(l);
4020 const const_class r_order = classify_const(r);
4022 l_order > r_order ||
4023 (l_order == r_order && get_irn_idx(l) <= get_irn_idx(r));
4027 * Normalizes and optimizes Cmp nodes.
4029 static ir_node *transform_node_Proj_Cmp(ir_node *proj) {
4030 ir_node *n = get_Proj_pred(proj);
4031 ir_node *left = get_Cmp_left(n);
4032 ir_node *right = get_Cmp_right(n);
4035 ir_mode *mode = NULL;
4036 long proj_nr = get_Proj_proj(proj);
4038 /* we can evaluate some cases directly */
4041 return new_Const(get_tarval_b_false());
4043 return new_Const(get_tarval_b_true());
4045 if (!mode_is_float(get_irn_mode(left)))
4046 return new_Const(get_tarval_b_true());
4052 /* remove Casts of both sides */
4053 left = skip_Cast(left);
4054 right = skip_Cast(right);
4056 /* Remove unnecessary conversions */
4057 /* TODO handle constants */
4058 if (is_Conv(left) && is_Conv(right)) {
4059 ir_mode *mode = get_irn_mode(left);
4060 ir_node *op_left = get_Conv_op(left);
4061 ir_node *op_right = get_Conv_op(right);
4062 ir_mode *mode_left = get_irn_mode(op_left);
4063 ir_mode *mode_right = get_irn_mode(op_right);
4065 if (smaller_mode(mode_left, mode) && smaller_mode(mode_right, mode)
4066 && mode_left != mode_b && mode_right != mode_b) {
4067 ir_node *block = get_nodes_block(n);
4069 if (mode_left == mode_right) {
4073 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV_CONV);
4074 } else if (smaller_mode(mode_left, mode_right)) {
4075 left = new_r_Conv(block, op_left, mode_right);
4078 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4079 } else if (smaller_mode(mode_right, mode_left)) {
4081 right = new_r_Conv(block, op_right, mode_left);
4083 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4088 /* remove operation on both sides if possible */
4089 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
4091 * The following operations are NOT safe for floating point operations, for instance
4092 * 1.0 + inf == 2.0 + inf, =/=> x == y
4094 if (mode_is_int(get_irn_mode(left))) {
4095 unsigned lop = get_irn_opcode(left);
4097 if (lop == get_irn_opcode(right)) {
4098 ir_node *ll, *lr, *rl, *rr;
4100 /* same operation on both sides, try to remove */
4104 /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */
4105 left = get_unop_op(left);
4106 right = get_unop_op(right);
4108 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4111 ll = get_Add_left(left);
4112 lr = get_Add_right(left);
4113 rl = get_Add_left(right);
4114 rr = get_Add_right(right);
4117 /* X + a CMP X + b ==> a CMP b */
4121 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4122 } else if (ll == rr) {
4123 /* X + a CMP b + X ==> a CMP b */
4127 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4128 } else if (lr == rl) {
4129 /* a + X CMP X + b ==> a CMP b */
4133 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4134 } else if (lr == rr) {
4135 /* a + X CMP b + X ==> a CMP b */
4139 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4143 ll = get_Sub_left(left);
4144 lr = get_Sub_right(left);
4145 rl = get_Sub_left(right);
4146 rr = get_Sub_right(right);
4149 /* X - a CMP X - b ==> a CMP b */
4153 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4154 } else if (lr == rr) {
4155 /* a - X CMP b - X ==> a CMP b */
4159 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4163 if (get_Rotl_right(left) == get_Rotl_right(right)) {
4164 /* a ROTL X CMP b ROTL X ==> a CMP b */
4165 left = get_Rotl_left(left);
4166 right = get_Rotl_left(right);
4168 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4176 /* X+A == A, A+X == A, A-X == A -> X == 0 */
4177 if (is_Add(left) || is_Sub(left)) {
4178 ir_node *ll = get_binop_left(left);
4179 ir_node *lr = get_binop_right(left);
4181 if (lr == right && is_Add(left)) {
4188 right = create_zero_const(get_irn_mode(left));
4190 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4193 if (is_Add(right) || is_Sub(right)) {
4194 ir_node *rl = get_binop_left(right);
4195 ir_node *rr = get_binop_right(right);
4197 if (rr == left && is_Add(right)) {
4204 right = create_zero_const(get_irn_mode(left));
4206 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP);
4209 if (is_And(left) && is_Const(right)) {
4210 ir_node *ll = get_binop_left(left);
4211 ir_node *lr = get_binop_right(left);
4212 if (is_Shr(ll) && is_Const(lr)) {
4213 /* Cmp((x >>u c1) & c2, c3) = Cmp(x & (c2 << c1), c3 << c1) */
4214 ir_node *block = get_nodes_block(n);
4215 ir_mode *mode = get_irn_mode(left);
4217 ir_node *llr = get_Shr_right(ll);
4218 if (is_Const(llr)) {
4219 dbg_info *dbg = get_irn_dbg_info(left);
4221 tarval *c1 = get_Const_tarval(llr);
4222 tarval *c2 = get_Const_tarval(lr);
4223 tarval *c3 = get_Const_tarval(right);
4224 tarval *mask = tarval_shl(c2, c1);
4225 tarval *value = tarval_shl(c3, c1);
4227 left = new_rd_And(dbg, block, get_Shr_left(ll), new_Const(mask), mode);
4228 right = new_Const(value);
4233 } /* mode_is_int(...) */
4234 } /* proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg */
4236 /* replace mode_b compares with ands/ors */
4237 if (get_irn_mode(left) == mode_b) {
4238 ir_node *block = get_nodes_block(n);
4242 case pn_Cmp_Le: bres = new_r_Or( block, new_r_Not(block, left, mode_b), right, mode_b); break;
4243 case pn_Cmp_Lt: bres = new_r_And(block, new_r_Not(block, left, mode_b), right, mode_b); break;
4244 case pn_Cmp_Ge: bres = new_r_Or( block, left, new_r_Not(block, right, mode_b), mode_b); break;
4245 case pn_Cmp_Gt: bres = new_r_And(block, left, new_r_Not(block, right, mode_b), mode_b); break;
4246 case pn_Cmp_Lg: bres = new_r_Eor(block, left, right, mode_b); break;
4247 case pn_Cmp_Eq: bres = new_r_Not(block, new_r_Eor(block, left, right, mode_b), mode_b); break;
4248 default: bres = NULL;
4251 DBG_OPT_ALGSIM0(n, bres, FS_OPT_CMP_TO_BOOL);
4257 * First step: normalize the compare op
4258 * by placing the constant on the right side
4259 * or moving the lower address node to the left.
4261 if (!operands_are_normalized(left, right)) {
4267 proj_nr = get_inversed_pnc(proj_nr);
4272 * Second step: Try to reduce the magnitude
4273 * of a constant. This may help to generate better code
4274 * later and may help to normalize more compares.
4275 * Of course this is only possible for integer values.
4277 tv = value_of(right);
4278 if (tv != tarval_bad) {
4279 mode = get_irn_mode(right);
4281 /* TODO extend to arbitrary constants */
4282 if (is_Conv(left) && tarval_is_null(tv)) {
4283 ir_node *op = get_Conv_op(left);
4284 ir_mode *op_mode = get_irn_mode(op);
4287 * UpConv(x) REL 0 ==> x REL 0
4289 if (get_mode_size_bits(mode) > get_mode_size_bits(op_mode) &&
4290 ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) ||
4291 mode_is_signed(mode) || !mode_is_signed(op_mode))) {
4292 tv = get_mode_null(op_mode);
4296 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV);
4300 if (tv != tarval_bad) {
4301 /* the following optimization is possible on modes without Overflow
4302 * on Unary Minus or on == and !=:
4303 * -a CMP c ==> a swap(CMP) -c
4305 * Beware: for two-complement Overflow may occur, so only == and != can
4306 * be optimized, see this:
4307 * -MININT < 0 =/=> MININT > 0 !!!
4309 if (is_Minus(left) &&
4310 (!mode_overflow_on_unary_Minus(mode) ||
4311 (mode_is_int(mode) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)))) {
4312 tv = tarval_neg(tv);
4314 if (tv != tarval_bad) {
4315 left = get_Minus_op(left);
4316 proj_nr = get_inversed_pnc(proj_nr);
4318 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4320 } else if (is_Not(left) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)) {
4321 /* Not(a) ==/!= c ==> a ==/!= Not(c) */
4322 tv = tarval_not(tv);
4324 if (tv != tarval_bad) {
4325 left = get_Not_op(left);
4327 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4331 /* for integer modes, we have more */
4332 if (mode_is_int(mode)) {
4333 /* Ne includes Unordered which is not possible on integers.
4334 * However, frontends often use this wrong, so fix it here */
4335 if (proj_nr & pn_Cmp_Uo) {
4336 proj_nr &= ~pn_Cmp_Uo;
4337 set_Proj_proj(proj, proj_nr);
4340 /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */
4341 if ((proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Ge) &&
4342 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Gt) {
4343 tv = tarval_sub(tv, get_mode_one(mode), NULL);
4345 if (tv != tarval_bad) {
4346 proj_nr ^= pn_Cmp_Eq;
4348 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4351 /* c < 0 : a > c ==> a >= (c+1) a <= c ==> a < (c+1) */
4352 else if ((proj_nr == pn_Cmp_Gt || proj_nr == pn_Cmp_Le) &&
4353 tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Lt) {
4354 tv = tarval_add(tv, get_mode_one(mode));
4356 if (tv != tarval_bad) {
4357 proj_nr ^= pn_Cmp_Eq;
4359 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4363 /* the following reassociations work only for == and != */
4364 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
4366 #if 0 /* Might be not that good in general */
4367 /* a-b == 0 ==> a == b, a-b != 0 ==> a != b */
4368 if (tarval_is_null(tv) && is_Sub(left)) {
4369 right = get_Sub_right(left);
4370 left = get_Sub_left(left);
4372 tv = value_of(right);
4374 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4378 if (tv != tarval_bad) {
4379 /* a-c1 == c2 ==> a == c2+c1, a-c1 != c2 ==> a != c2+c1 */
4381 ir_node *c1 = get_Sub_right(left);
4382 tarval *tv2 = value_of(c1);
4384 if (tv2 != tarval_bad) {
4385 tv2 = tarval_add(tv, value_of(c1));
4387 if (tv2 != tarval_bad) {
4388 left = get_Sub_left(left);
4391 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4395 /* a+c1 == c2 ==> a == c2-c1, a+c1 != c2 ==> a != c2-c1 */
4396 else if (is_Add(left)) {
4397 ir_node *a_l = get_Add_left(left);
4398 ir_node *a_r = get_Add_right(left);
4402 if (is_Const(a_l)) {
4404 tv2 = value_of(a_l);
4407 tv2 = value_of(a_r);
4410 if (tv2 != tarval_bad) {
4411 tv2 = tarval_sub(tv, tv2, NULL);
4413 if (tv2 != tarval_bad) {
4417 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4421 /* -a == c ==> a == -c, -a != c ==> a != -c */
4422 else if (is_Minus(left)) {
4423 tarval *tv2 = tarval_sub(get_mode_null(mode), tv, NULL);
4425 if (tv2 != tarval_bad) {
4426 left = get_Minus_op(left);
4429 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C);
4434 /* the following reassociations work only for <= */
4435 else if (proj_nr == pn_Cmp_Le || proj_nr == pn_Cmp_Lt) {
4436 if (tv != tarval_bad) {
4437 /* c >= 0 : Abs(a) <= c ==> (unsigned)(a + c) <= 2*c */
4438 if (is_Abs(left)) { // TODO something is missing here
4444 if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) {
4445 switch (get_irn_opcode(left)) {
4449 c1 = get_And_right(left);
4452 * And(x, C1) == C2 ==> FALSE if C2 & C1 != C2
4453 * And(x, C1) != C2 ==> TRUE if C2 & C1 != C2
4455 tarval *mask = tarval_and(get_Const_tarval(c1), tv);
4457 /* TODO: move to constant evaluation */
4458 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4460 DBG_OPT_CSTEVAL(proj, c1);
4464 if (tarval_is_single_bit(tv)) {
4466 * optimization for AND:
4468 * And(x, C) == C ==> And(x, C) != 0
4469 * And(x, C) != C ==> And(X, C) == 0
4471 * if C is a single Bit constant.
4474 /* check for Constant's match. We have check hare the tarvals,
4475 because our const might be changed */
4476 if (get_Const_tarval(c1) == tv) {
4477 /* fine: do the transformation */
4478 tv = get_mode_null(get_tarval_mode(tv));
4479 proj_nr ^= pn_Cmp_Leg;
4481 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN);
4487 c1 = get_Or_right(left);
4488 if (is_Const(c1) && tarval_is_null(tv)) {
4490 * Or(x, C) == 0 && C != 0 ==> FALSE
4491 * Or(x, C) != 0 && C != 0 ==> TRUE
4493 if (! tarval_is_null(get_Const_tarval(c1))) {
4494 /* TODO: move to constant evaluation */
4495 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4497 DBG_OPT_CSTEVAL(proj, c1);
4504 * optimize x << c1 == c into x & (-1 >>u c1) == c >> c1 if c & (-1 << c1) == c
4506 * optimize x << c1 != c into x & (-1 >>u c1) != c >> c1 if c & (-1 << c1) == c
4509 c1 = get_Shl_right(left);
4511 tarval *tv1 = get_Const_tarval(c1);
4512 ir_mode *mode = get_irn_mode(left);
4513 tarval *minus1 = get_mode_all_one(mode);
4514 tarval *amask = tarval_shr(minus1, tv1);
4515 tarval *cmask = tarval_shl(minus1, tv1);
4518 if (tarval_and(tv, cmask) != tv) {
4519 /* condition not met */
4520 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4522 DBG_OPT_CSTEVAL(proj, c1);
4525 sl = get_Shl_left(left);
4526 blk = get_nodes_block(n);
4527 left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_Const(amask), mode);
4528 tv = tarval_shr(tv, tv1);
4530 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4535 * optimize x >>u c1 == c into x & (-1 << c1) == c << c1 if c & (-1 >>u c1) == c
4537 * optimize x >>u c1 != c into x & (-1 << c1) != c << c1 if c & (-1 >>u c1) == c
4540 c1 = get_Shr_right(left);
4542 tarval *tv1 = get_Const_tarval(c1);
4543 ir_mode *mode = get_irn_mode(left);
4544 tarval *minus1 = get_mode_all_one(mode);
4545 tarval *amask = tarval_shl(minus1, tv1);
4546 tarval *cmask = tarval_shr(minus1, tv1);
4549 if (tarval_and(tv, cmask) != tv) {
4550 /* condition not met */
4551 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4553 DBG_OPT_CSTEVAL(proj, c1);
4556 sl = get_Shr_left(left);
4557 blk = get_nodes_block(n);
4558 left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_Const(amask), mode);
4559 tv = tarval_shl(tv, tv1);
4561 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4566 * optimize x >>s c1 == c into x & (-1 << c1) == c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4568 * optimize x >>s c1 != c into x & (-1 << c1) != c << c1 if (c >>s (BITS - c1)) \in {0,-1}
4571 c1 = get_Shrs_right(left);
4573 tarval *tv1 = get_Const_tarval(c1);
4574 ir_mode *mode = get_irn_mode(left);
4575 tarval *minus1 = get_mode_all_one(mode);
4576 tarval *amask = tarval_shl(minus1, tv1);
4577 tarval *cond = new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(tv1));
4580 cond = tarval_sub(cond, tv1, NULL);
4581 cond = tarval_shrs(tv, cond);
4583 if (!tarval_is_all_one(cond) && !tarval_is_null(cond)) {
4584 /* condition not met */
4585 tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true();
4587 DBG_OPT_CSTEVAL(proj, c1);
4590 sl = get_Shrs_left(left);
4591 blk = get_nodes_block(n);
4592 left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_Const(amask), mode);
4593 tv = tarval_shl(tv, tv1);
4595 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND);
4600 } /* tarval != bad */
4603 if (changed & 2) /* need a new Const */
4604 right = new_Const(tv);
4606 if ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) && is_Const(right) && is_Const_null(right) && is_Proj(left)) {
4607 ir_node *op = get_Proj_pred(left);
4609 if ((is_Mod(op) && get_Proj_proj(left) == pn_Mod_res) ||
4610 (is_DivMod(op) && get_Proj_proj(left) == pn_DivMod_res_mod)) {
4611 ir_node *c = get_binop_right(op);
4614 tarval *tv = get_Const_tarval(c);
4616 if (tarval_is_single_bit(tv)) {
4617 /* special case: (x % 2^n) CMP 0 ==> x & (2^n-1) CMP 0 */
4618 ir_node *v = get_binop_left(op);
4619 ir_node *blk = get_irn_n(op, -1);
4620 ir_mode *mode = get_irn_mode(v);
4622 tv = tarval_sub(tv, get_mode_one(mode), NULL);
4623 left = new_rd_And(get_irn_dbg_info(op), blk, v, new_Const(tv), mode);
4625 DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_MOD_TO_AND);
4632 ir_node *block = get_nodes_block(n);
4634 /* create a new compare */
4635 n = new_rd_Cmp(get_irn_dbg_info(n), block, left, right);
4636 proj = new_rd_Proj(get_irn_dbg_info(proj), block, n, get_irn_mode(proj), proj_nr);
4640 } /* transform_node_Proj_Cmp */
4643 * Optimize CopyB(mem, x, x) into a Nop.
4645 static ir_node *transform_node_Proj_CopyB(ir_node *proj) {
4646 ir_node *copyb = get_Proj_pred(proj);
4647 ir_node *a = get_CopyB_dst(copyb);
4648 ir_node *b = get_CopyB_src(copyb);
4651 switch (get_Proj_proj(proj)) {
4652 case pn_CopyB_X_regular:
4653 /* Turn CopyB into a tuple (mem, jmp, bad, bad) */
4654 DBG_OPT_EXC_REM(proj);
4655 proj = new_r_Jmp(get_nodes_block(copyb));
4657 case pn_CopyB_M_except:
4658 case pn_CopyB_X_except:
4659 DBG_OPT_EXC_REM(proj);
4660 proj = get_irg_bad(get_irn_irg(proj));
4667 } /* transform_node_Proj_CopyB */
4670 * Optimize Bounds(idx, idx, upper) into idx.
4672 static ir_node *transform_node_Proj_Bound(ir_node *proj) {
4673 ir_node *oldn = proj;
4674 ir_node *bound = get_Proj_pred(proj);
4675 ir_node *idx = get_Bound_index(bound);
4676 ir_node *pred = skip_Proj(idx);
4679 if (idx == get_Bound_lower(bound))
4681 else if (is_Bound(pred)) {
4683 * idx was Bounds checked in the same MacroBlock previously,
4684 * it is still valid if lower <= pred_lower && pred_upper <= upper.
4686 ir_node *lower = get_Bound_lower(bound);
4687 ir_node *upper = get_Bound_upper(bound);
4688 if (get_Bound_lower(pred) == lower &&
4689 get_Bound_upper(pred) == upper &&
4690 get_irn_MacroBlock(bound) == get_irn_MacroBlock(pred)) {
4692 * One could expect that we simply return the previous
4693 * Bound here. However, this would be wrong, as we could
4694 * add an exception Proj to a new location then.
4695 * So, we must turn in into a tuple.
4701 /* Turn Bound into a tuple (mem, jmp, bad, idx) */
4702 switch (get_Proj_proj(proj)) {
4704 DBG_OPT_EXC_REM(proj);
4705 proj = get_Bound_mem(bound);
4707 case pn_Bound_X_except:
4708 DBG_OPT_EXC_REM(proj);
4709 proj = get_irg_bad(get_irn_irg(proj));
4713 DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP);
4715 case pn_Bound_X_regular:
4716 DBG_OPT_EXC_REM(proj);
4717 proj = new_r_Jmp(get_nodes_block(bound));
4724 } /* transform_node_Proj_Bound */
4727 * Does all optimizations on nodes that must be done on it's Proj's
4728 * because of creating new nodes.
4730 static ir_node *transform_node_Proj(ir_node *proj) {
4731 ir_node *n = get_Proj_pred(proj);
4733 if (n->op->ops.transform_node_Proj)
4734 return n->op->ops.transform_node_Proj(proj);
4736 } /* transform_node_Proj */
4739 * Move Confirms down through Phi nodes.
4741 static ir_node *transform_node_Phi(ir_node *phi) {
4743 ir_mode *mode = get_irn_mode(phi);
4745 if (mode_is_reference(mode)) {
4746 n = get_irn_arity(phi);
4748 /* Beware of Phi0 */
4750 ir_node *pred = get_irn_n(phi, 0);
4751 ir_node *bound, *new_Phi, *block, **in;
4754 if (! is_Confirm(pred))
4757 bound = get_Confirm_bound(pred);
4758 pnc = get_Confirm_cmp(pred);
4760 NEW_ARR_A(ir_node *, in, n);
4761 in[0] = get_Confirm_value(pred);
4763 for (i = 1; i < n; ++i) {
4764 pred = get_irn_n(phi, i);
4766 if (! is_Confirm(pred) ||
4767 get_Confirm_bound(pred) != bound ||
4768 get_Confirm_cmp(pred) != pnc)
4770 in[i] = get_Confirm_value(pred);
4772 /* move the Confirm nodes "behind" the Phi */
4773 block = get_irn_n(phi, -1);
4774 new_Phi = new_r_Phi(block, n, in, get_irn_mode(phi));
4775 return new_r_Confirm(block, new_Phi, bound, pnc);
4779 } /* transform_node_Phi */
4782 * Returns the operands of a commutative bin-op, if one operand is
4783 * a const, it is returned as the second one.
4785 static void get_comm_Binop_Ops(ir_node *binop, ir_node **a, ir_node **c) {
4786 ir_node *op_a = get_binop_left(binop);
4787 ir_node *op_b = get_binop_right(binop);
4789 assert(is_op_commutative(get_irn_op(binop)));
4791 if (is_Const(op_a)) {
4798 } /* get_comm_Binop_Ops */
4801 * Optimize a Or(And(Or(And(v,c4),c3),c2),c1) pattern if possible.
4802 * Such pattern may arise in bitfield stores.
4804 * value c4 value c4 & c2
4805 * AND c3 AND c1 | c3
4812 * AND c1 ===> OR if (c1 | c2) == 0x111..11
4815 static ir_node *transform_node_Or_bf_store(ir_node *or) {
4818 ir_node *and_l, *c3;
4819 ir_node *value, *c4;
4820 ir_node *new_and, *new_const, *block;
4821 ir_mode *mode = get_irn_mode(or);
4823 tarval *tv1, *tv2, *tv3, *tv4, *tv, *n_tv4, *n_tv2;
4826 get_comm_Binop_Ops(or, &and, &c1);
4827 if (!is_Const(c1) || !is_And(and))
4830 get_comm_Binop_Ops(and, &or_l, &c2);
4834 tv1 = get_Const_tarval(c1);
4835 tv2 = get_Const_tarval(c2);
4837 tv = tarval_or(tv1, tv2);
4838 if (tarval_is_all_one(tv)) {
4839 /* the AND does NOT clear a bit with isn't set by the OR */
4840 set_Or_left(or, or_l);
4841 set_Or_right(or, c1);
4843 /* check for more */
4850 get_comm_Binop_Ops(or_l, &and_l, &c3);
4851 if (!is_Const(c3) || !is_And(and_l))
4854 get_comm_Binop_Ops(and_l, &value, &c4);
4858 /* ok, found the pattern, check for conditions */
4859 assert(mode == get_irn_mode(and));
4860 assert(mode == get_irn_mode(or_l));
4861 assert(mode == get_irn_mode(and_l));
4863 tv3 = get_Const_tarval(c3);
4864 tv4 = get_Const_tarval(c4);
4866 tv = tarval_or(tv4, tv2);
4867 if (!tarval_is_all_one(tv)) {
4868 /* have at least one 0 at the same bit position */
4872 n_tv4 = tarval_not(tv4);
4873 if (tv3 != tarval_and(tv3, n_tv4)) {
4874 /* bit in the or_mask is outside the and_mask */
4878 n_tv2 = tarval_not(tv2);
4879 if (tv1 != tarval_and(tv1, n_tv2)) {
4880 /* bit in the or_mask is outside the and_mask */
4884 /* ok, all conditions met */
4885 block = get_irn_n(or, -1);
4887 new_and = new_r_And(block, value, new_Const(tarval_and(tv4, tv2)), mode);
4889 new_const = new_Const(tarval_or(tv3, tv1));
4891 set_Or_left(or, new_and);
4892 set_Or_right(or, new_const);
4894 /* check for more */
4896 } /* transform_node_Or_bf_store */
4899 * Optimize an Or(shl(x, c), shr(x, bits - c)) into a Rotl
4901 static ir_node *transform_node_Or_Rotl(ir_node *or) {
4902 ir_mode *mode = get_irn_mode(or);
4903 ir_node *shl, *shr, *block;
4904 ir_node *irn, *x, *c1, *c2, *v, *sub, *n, *rotval;
4907 if (! mode_is_int(mode))
4910 shl = get_binop_left(or);
4911 shr = get_binop_right(or);
4920 } else if (!is_Shl(shl)) {
4922 } else if (!is_Shr(shr)) {
4925 x = get_Shl_left(shl);
4926 if (x != get_Shr_left(shr))
4929 c1 = get_Shl_right(shl);
4930 c2 = get_Shr_right(shr);
4931 if (is_Const(c1) && is_Const(c2)) {
4932 tv1 = get_Const_tarval(c1);
4933 if (! tarval_is_long(tv1))
4936 tv2 = get_Const_tarval(c2);
4937 if (! tarval_is_long(tv2))
4940 if (get_tarval_long(tv1) + get_tarval_long(tv2)
4941 != (int) get_mode_size_bits(mode))
4944 /* yet, condition met */
4945 block = get_nodes_block(or);
4947 n = new_r_Rotl(block, x, c1, mode);
4949 DBG_OPT_ALGSIM1(or, shl, shr, n, FS_OPT_OR_SHFT_TO_ROTL);
4956 rotval = sub; /* a Rot right is not supported, so use a rot left */
4957 } else if (is_Sub(c2)) {
4963 if (get_Sub_right(sub) != v)
4966 c1 = get_Sub_left(sub);
4970 tv1 = get_Const_tarval(c1);
4971 if (! tarval_is_long(tv1))
4974 if (get_tarval_long(tv1) != (int) get_mode_size_bits(mode))
4977 /* yet, condition met */
4978 block = get_nodes_block(or);
4980 n = new_r_Rotl(block, x, rotval, mode);
4982 DBG_OPT_ALGSIM0(or, n, FS_OPT_OR_SHFT_TO_ROTL);
4984 } /* transform_node_Or_Rotl */
4989 static ir_node *transform_node_Or(ir_node *n) {
4990 ir_node *c, *oldn = n;
4991 ir_node *a = get_Or_left(n);
4992 ir_node *b = get_Or_right(n);
4995 if (is_Not(a) && is_Not(b)) {
4996 /* ~a | ~b = ~(a&b) */
4997 ir_node *block = get_nodes_block(n);
4999 mode = get_irn_mode(n);
5002 n = new_rd_And(get_irn_dbg_info(n), block, a, b, mode);
5003 n = new_rd_Not(get_irn_dbg_info(n), block, n, mode);
5004 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN);
5008 /* we can evaluate 2 Projs of the same Cmp */
5009 if (get_irn_mode(n) == mode_b && is_Proj(a) && is_Proj(b)) {
5010 ir_node *pred_a = get_Proj_pred(a);
5011 ir_node *pred_b = get_Proj_pred(b);
5012 if (pred_a == pred_b) {
5013 dbg_info *dbgi = get_irn_dbg_info(n);
5014 ir_node *block = get_nodes_block(pred_a);
5015 pn_Cmp pn_a = get_Proj_proj(a);
5016 pn_Cmp pn_b = get_Proj_proj(b);
5017 /* yes, we can simply calculate with pncs */
5018 pn_Cmp new_pnc = pn_a | pn_b;
5020 return new_rd_Proj(dbgi, block, pred_a, mode_b, new_pnc);
5024 mode = get_irn_mode(n);
5025 HANDLE_BINOP_PHI(tarval_or, a, b, c, mode);
5027 n = transform_node_Or_bf_store(n);
5028 n = transform_node_Or_Rotl(n);
5032 n = transform_bitwise_distributive(n, transform_node_Or);
5035 } /* transform_node_Or */
5039 static ir_node *transform_node(ir_node *n);
5042 * Optimize (a >> c1) >> c2), works for Shr, Shrs, Shl, Rotl.
5044 * Should be moved to reassociation?
5046 static ir_node *transform_node_shift(ir_node *n) {
5047 ir_node *left, *right;
5049 tarval *tv1, *tv2, *res;
5050 ir_node *in[2], *irn, *block;
5052 left = get_binop_left(n);
5054 /* different operations */
5055 if (get_irn_op(left) != get_irn_op(n))
5058 right = get_binop_right(n);
5059 tv1 = value_of(right);
5060 if (tv1 == tarval_bad)
5063 tv2 = value_of(get_binop_right(left));
5064 if (tv2 == tarval_bad)
5067 res = tarval_add(tv1, tv2);
5068 mode = get_irn_mode(n);
5070 /* beware: a simple replacement works only, if res < modulo shift */
5072 int modulo_shf = get_mode_modulo_shift(mode);
5073 if (modulo_shf > 0) {
5074 tarval *modulo = new_tarval_from_long(modulo_shf,
5075 get_tarval_mode(res));
5077 assert(modulo_shf >= (int) get_mode_size_bits(mode));
5079 /* shifting too much */
5080 if (!(tarval_cmp(res, modulo) & pn_Cmp_Lt)) {
5082 ir_node *block = get_nodes_block(n);
5083 dbg_info *dbgi = get_irn_dbg_info(n);
5084 ir_mode *smode = get_irn_mode(right);
5085 ir_node *cnst = new_Const_long(smode, get_mode_size_bits(mode) - 1);
5086 return new_rd_Shrs(dbgi, block, get_binop_left(left), cnst, mode);
5089 return new_Const(get_mode_null(mode));
5093 res = tarval_mod(res, new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(res)));
5096 /* ok, we can replace it */
5097 block = get_nodes_block(n);
5099 in[0] = get_binop_left(left);
5100 in[1] = new_Const(res);
5102 irn = new_ir_node(NULL, get_Block_irg(block), block, get_irn_op(n), mode, 2, in);
5104 DBG_OPT_ALGSIM0(n, irn, FS_OPT_REASSOC_SHIFT);
5106 return transform_node(irn);
5107 } /* transform_node_shift */
5110 * normalisation: (x & c1) >> c2 to (x >> c2) & (c1 >> c2)
5112 * - and, or, xor instead of &
5113 * - Shl, Shr, Shrs, rotl instead of >>
5114 * (with a special case for Or/Xor + Shrs)
5116 static ir_node *transform_node_bitop_shift(ir_node *n) {
5118 ir_node *right = get_binop_right(n);
5119 ir_mode *mode = get_irn_mode(n);
5120 ir_node *bitop_left;
5121 ir_node *bitop_right;
5132 assert(is_Shrs(n) || is_Shr(n) || is_Shl(n) || is_Rotl(n));
5134 if (!is_Const(right))
5137 left = get_binop_left(n);
5138 op_left = get_irn_op(left);
5139 if (op_left != op_And && op_left != op_Or && op_left != op_Eor)
5142 /* doing it with Shrs is not legal if the Or/Eor affects the topmost bit */
5143 if (is_Shrs(n) && (op_left == op_Or || op_left == op_Eor)) {
5144 /* TODO: test if sign bit is affectes */
5148 bitop_right = get_binop_right(left);
5149 if (!is_Const(bitop_right))
5152 bitop_left = get_binop_left(left);
5154 block = get_nodes_block(n);
5155 dbgi = get_irn_dbg_info(n);
5156 tv1 = get_Const_tarval(bitop_right);
5157 tv2 = get_Const_tarval(right);
5159 assert(get_tarval_mode(tv1) == mode);
5162 new_shift = new_rd_Shl(dbgi, block, bitop_left, right, mode);
5163 tv_shift = tarval_shl(tv1, tv2);
5164 } else if(is_Shr(n)) {
5165 new_shift = new_rd_Shr(dbgi, block, bitop_left, right, mode);
5166 tv_shift = tarval_shr(tv1, tv2);
5167 } else if(is_Shrs(n)) {
5168 new_shift = new_rd_Shrs(dbgi, block, bitop_left, right, mode);
5169 tv_shift = tarval_shrs(tv1, tv2);
5172 new_shift = new_rd_Rotl(dbgi, block, bitop_left, right, mode);
5173 tv_shift = tarval_rotl(tv1, tv2);
5176 assert(get_tarval_mode(tv_shift) == mode);
5177 new_const = new_Const(tv_shift);
5179 if (op_left == op_And) {
5180 new_bitop = new_rd_And(dbgi, block, new_shift, new_const, mode);
5181 } else if(op_left == op_Or) {
5182 new_bitop = new_rd_Or(dbgi, block, new_shift, new_const, mode);
5184 assert(op_left == op_Eor);
5185 new_bitop = new_rd_Eor(dbgi, block, new_shift, new_const, mode);
5193 * (x << c1) >> c2 <=> x OP (c2-c1) & ((-1 << c1) >> c2)
5195 * (x >> c1) << c2 <=> x OP (c2-c1) & ((-1 >> c1) << c2)
5196 * (also with x >>s c1 when c1>=c2)
5198 static ir_node *transform_node_shl_shr(ir_node *n) {
5200 ir_node *right = get_binop_right(n);
5216 assert(is_Shl(n) || is_Shr(n) || is_Shrs(n));
5218 if (!is_Const(right))
5221 left = get_binop_left(n);
5222 mode = get_irn_mode(n);
5223 if (is_Shl(n) && (is_Shr(left) || is_Shrs(left))) {
5224 ir_node *shr_right = get_binop_right(left);
5226 if (!is_Const(shr_right))
5229 x = get_binop_left(left);
5230 tv_shr = get_Const_tarval(shr_right);
5231 tv_shl = get_Const_tarval(right);
5233 if (is_Shrs(left)) {
5234 /* shrs variant only allowed if c1 >= c2 */
5235 if (! (tarval_cmp(tv_shl, tv_shr) & pn_Cmp_Ge))
5238 tv_mask = tarval_shrs(get_mode_all_one(mode), tv_shr);
5241 tv_mask = tarval_shr(get_mode_all_one(mode), tv_shr);
5243 tv_mask = tarval_shl(tv_mask, tv_shl);
5244 } else if(is_Shr(n) && is_Shl(left)) {
5245 ir_node *shl_right = get_Shl_right(left);
5247 if (!is_Const(shl_right))
5250 x = get_Shl_left(left);
5251 tv_shr = get_Const_tarval(right);
5252 tv_shl = get_Const_tarval(shl_right);
5254 tv_mask = tarval_shl(get_mode_all_one(mode), tv_shl);
5255 tv_mask = tarval_shr(tv_mask, tv_shr);
5260 if (get_tarval_mode(tv_shl) != get_tarval_mode(tv_shr)) {
5261 tv_shl = tarval_convert_to(tv_shl, get_tarval_mode(tv_shr));
5264 assert(tv_mask != tarval_bad);
5265 assert(get_tarval_mode(tv_mask) == mode);
5267 irg = get_irn_irg(n);
5268 block = get_nodes_block(n);
5269 dbgi = get_irn_dbg_info(n);
5271 pnc = tarval_cmp(tv_shl, tv_shr);
5272 if (pnc == pn_Cmp_Lt || pnc == pn_Cmp_Eq) {
5273 tv_shift = tarval_sub(tv_shr, tv_shl, NULL);
5274 new_const = new_Const(tv_shift);
5276 new_shift = new_rd_Shrs(dbgi, block, x, new_const, mode);
5278 new_shift = new_rd_Shr(dbgi, block, x, new_const, mode);
5281 assert(pnc == pn_Cmp_Gt);
5282 tv_shift = tarval_sub(tv_shl, tv_shr, NULL);
5283 new_const = new_Const(tv_shift);
5284 new_shift = new_rd_Shl(dbgi, block, x, new_const, mode);
5287 new_const = new_Const(tv_mask);
5288 new_and = new_rd_And(dbgi, block, new_shift, new_const, mode);
5296 static ir_node *transform_node_Shr(ir_node *n) {
5297 ir_node *c, *oldn = n;
5298 ir_node *left = get_Shr_left(n);
5299 ir_node *right = get_Shr_right(n);
5300 ir_mode *mode = get_irn_mode(n);
5302 HANDLE_BINOP_PHI(tarval_shr, left, right, c, mode);
5303 n = transform_node_shift(n);
5306 n = transform_node_shl_shr(n);
5308 n = transform_node_bitop_shift(n);
5311 } /* transform_node_Shr */
5316 static ir_node *transform_node_Shrs(ir_node *n) {
5317 ir_node *c, *oldn = n;
5318 ir_node *a = get_Shrs_left(n);
5319 ir_node *b = get_Shrs_right(n);
5320 ir_mode *mode = get_irn_mode(n);
5322 HANDLE_BINOP_PHI(tarval_shrs, a, b, c, mode);
5323 n = transform_node_shift(n);
5326 n = transform_node_bitop_shift(n);
5329 } /* transform_node_Shrs */
5334 static ir_node *transform_node_Shl(ir_node *n) {
5335 ir_node *c, *oldn = n;
5336 ir_node *a = get_Shl_left(n);
5337 ir_node *b = get_Shl_right(n);
5338 ir_mode *mode = get_irn_mode(n);
5340 HANDLE_BINOP_PHI(tarval_shl, a, b, c, mode);
5341 n = transform_node_shift(n);
5344 n = transform_node_shl_shr(n);
5346 n = transform_node_bitop_shift(n);
5349 } /* transform_node_Shl */
5354 static ir_node *transform_node_Rotl(ir_node *n) {
5355 ir_node *c, *oldn = n;
5356 ir_node *a = get_Rotl_left(n);
5357 ir_node *b = get_Rotl_right(n);
5358 ir_mode *mode = get_irn_mode(n);
5360 HANDLE_BINOP_PHI(tarval_rotl, a, b, c, mode);
5361 n = transform_node_shift(n);
5364 n = transform_node_bitop_shift(n);
5367 } /* transform_node_Rotl */
5372 static ir_node *transform_node_Conv(ir_node *n) {
5373 ir_node *c, *oldn = n;
5374 ir_mode *mode = get_irn_mode(n);
5375 ir_node *a = get_Conv_op(n);
5377 if (mode != mode_b && is_const_Phi(a)) {
5378 /* Do NOT optimize mode_b Conv's, this leads to remaining
5379 * Phib nodes later, because the conv_b_lower operation
5380 * is instantly reverted, when it tries to insert a Convb.
5382 c = apply_conv_on_phi(a, mode);
5384 DBG_OPT_ALGSIM0(oldn, c, FS_OPT_CONST_PHI);
5389 if (is_Unknown(a)) { /* Conv_A(Unknown_B) -> Unknown_A */
5390 return new_r_Unknown(current_ir_graph, mode);
5393 if (mode_is_reference(mode) &&
5394 get_mode_size_bits(mode) == get_mode_size_bits(get_irn_mode(a)) &&
5396 ir_node *l = get_Add_left(a);
5397 ir_node *r = get_Add_right(a);
5398 dbg_info *dbgi = get_irn_dbg_info(a);
5399 ir_node *block = get_nodes_block(n);
5401 ir_node *lop = get_Conv_op(l);
5402 if(get_irn_mode(lop) == mode) {
5403 /* ConvP(AddI(ConvI(P), x)) -> AddP(P, x) */
5404 n = new_rd_Add(dbgi, block, lop, r, mode);
5409 ir_node *rop = get_Conv_op(r);
5410 if(get_irn_mode(rop) == mode) {
5411 /* ConvP(AddI(x, ConvI(P))) -> AddP(x, P) */
5412 n = new_rd_Add(dbgi, block, l, rop, mode);
5419 } /* transform_node_Conv */
5422 * Remove dead blocks and nodes in dead blocks
5423 * in keep alive list. We do not generate a new End node.
5425 static ir_node *transform_node_End(ir_node *n) {
5426 int i, j, n_keepalives = get_End_n_keepalives(n);
5429 NEW_ARR_A(ir_node *, in, n_keepalives);
5431 for (i = j = 0; i < n_keepalives; ++i) {
5432 ir_node *ka = get_End_keepalive(n, i);
5434 if (! is_Block_dead(ka)) {
5438 } else if (is_irn_pinned_in_irg(ka) && is_Block_dead(get_nodes_block(ka))) {
5440 } else if (is_Bad(ka)) {
5441 /* no need to keep Bad */
5446 if (j != n_keepalives)
5447 set_End_keepalives(n, j, in);
5449 } /* transform_node_End */
5451 /** returns 1 if a == -b */
5452 static int is_negated_value(ir_node *a, ir_node *b) {
5453 if (is_Minus(a) && get_Minus_op(a) == b)
5455 if (is_Minus(b) && get_Minus_op(b) == a)
5457 if (is_Sub(a) && is_Sub(b)) {
5458 ir_node *a_left = get_Sub_left(a);
5459 ir_node *a_right = get_Sub_right(a);
5460 ir_node *b_left = get_Sub_left(b);
5461 ir_node *b_right = get_Sub_right(b);
5463 if (a_left == b_right && a_right == b_left)
5471 * Optimize a Mux into some simpler cases.
5473 static ir_node *transform_node_Mux(ir_node *n) {
5474 ir_node *oldn = n, *sel = get_Mux_sel(n);
5475 ir_mode *mode = get_irn_mode(n);
5476 ir_node *t = get_Mux_true(n);
5477 ir_node *f = get_Mux_false(n);
5478 ir_graph *irg = current_ir_graph;
5480 if (is_irg_state(irg, IR_GRAPH_STATE_KEEP_MUX))
5484 ir_node* block = get_nodes_block(n);
5486 ir_node* c1 = get_Mux_sel(t);
5487 ir_node* t1 = get_Mux_true(t);
5488 ir_node* f1 = get_Mux_false(t);
5490 /* Mux(cond0, Mux(cond1, x, y), y) -> typical if (cond0 && cond1) x else y */
5491 ir_node* and_ = new_r_And(block, c0, c1, mode_b);
5492 ir_node* new_mux = new_r_Mux(block, and_, f1, t1, mode);
5497 DBG_OPT_ALGSIM0(oldn, t, FS_OPT_MUX_COMBINE);
5498 } else if (f == t1) {
5499 /* Mux(cond0, Mux(cond1, x, y), x) */
5500 ir_node* not_c1 = new_r_Not(block, c1, mode_b);
5501 ir_node* and_ = new_r_And(block, c0, not_c1, mode_b);
5502 ir_node* new_mux = new_r_Mux(block, and_, t1, f1, mode);
5507 DBG_OPT_ALGSIM0(oldn, t, FS_OPT_MUX_COMBINE);
5509 } else if (is_Mux(f)) {
5510 ir_node* block = get_nodes_block(n);
5512 ir_node* c1 = get_Mux_sel(f);
5513 ir_node* t1 = get_Mux_true(f);
5514 ir_node* f1 = get_Mux_false(f);
5516 /* Mux(cond0, x, Mux(cond1, x, y)) -> typical if (cond0 || cond1) x else y */
5517 ir_node* or_ = new_r_Or(block, c0, c1, mode_b);
5518 ir_node* new_mux = new_r_Mux(block, or_, f1, t1, mode);
5523 DBG_OPT_ALGSIM0(oldn, f, FS_OPT_MUX_COMBINE);
5524 } else if (t == f1) {
5525 /* Mux(cond0, x, Mux(cond1, y, x)) */
5526 ir_node* not_c1 = new_r_Not(block, c1, mode_b);
5527 ir_node* or_ = new_r_Or(block, c0, not_c1, mode_b);
5528 ir_node* new_mux = new_r_Mux(block, or_, t1, f1, mode);
5533 DBG_OPT_ALGSIM0(oldn, f, FS_OPT_MUX_COMBINE);
5537 /* first normalization step: move a possible zero to the false case */
5539 ir_node *cmp = get_Proj_pred(sel);
5542 if (is_Const(t) && is_Const_null(t)) {
5545 /* Mux(x, 0, y) => Mux(x, y, 0) */
5546 pn_Cmp pnc = get_Proj_proj(sel);
5547 sel = new_r_Proj(get_nodes_block(cmp), cmp, mode_b,
5548 get_negated_pnc(pnc, get_irn_mode(get_Cmp_left(cmp))));
5549 n = new_rd_Mux(get_irn_dbg_info(n), get_nodes_block(n), sel, t, f, mode);
5557 /* note: after normalization, false can only happen on default */
5558 if (mode == mode_b) {
5559 dbg_info *dbg = get_irn_dbg_info(n);
5560 ir_node *block = get_nodes_block(n);
5563 tarval *tv_t = get_Const_tarval(t);
5564 if (tv_t == tarval_b_true) {
5566 /* Muxb(sel, true, false) = sel */
5567 assert(get_Const_tarval(f) == tarval_b_false);
5568 DBG_OPT_ALGSIM0(oldn, sel, FS_OPT_MUX_BOOL);
5571 /* Muxb(sel, true, x) = Or(sel, x) */
5572 n = new_rd_Or(dbg, block, sel, f, mode_b);
5573 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_OR_BOOL);
5577 } else if (is_Const(f)) {
5578 tarval *tv_f = get_Const_tarval(f);
5579 if (tv_f == tarval_b_true) {
5580 /* Muxb(sel, x, true) = Or(Not(sel), x) */
5581 ir_node* not_sel = new_rd_Not(dbg, block, sel, mode_b);
5582 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_ORNOT_BOOL);
5583 n = new_rd_Or(dbg, block, not_sel, t, mode_b);
5586 /* Muxb(sel, x, false) = And(sel, x) */
5587 assert(tv_f == tarval_b_false);
5588 n = new_rd_And(dbg, block, sel, t, mode_b);
5589 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_AND_BOOL);
5595 /* more normalization: try to normalize Mux(x, C1, C2) into Mux(x, +1/-1, 0) op C2 */
5596 if (is_Const(t) && is_Const(f) && mode_is_int(mode)) {
5597 tarval *a = get_Const_tarval(t);
5598 tarval *b = get_Const_tarval(f);
5601 if (tarval_is_one(a) && tarval_is_null(b)) {
5602 ir_node *block = get_nodes_block(n);
5603 ir_node *conv = new_r_Conv(block, sel, mode);
5605 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_CONV);
5607 } else if (tarval_is_null(a) && tarval_is_one(b)) {
5608 ir_node *block = get_nodes_block(n);
5609 ir_node *not_ = new_r_Not(block, sel, mode_b);
5610 ir_node *conv = new_r_Conv(block, not_, mode);
5612 DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_CONV);
5615 /* TODO: it's not really clear if that helps in general or should be moved
5616 * to backend, especially with the MUX->Conv transformation above */
5617 if (tarval_cmp(a, b) & pn_Cmp_Gt) {
5618 diff = tarval_sub(a, b, NULL);
5621 diff = tarval_sub(b, a, NULL);
5625 if (diff == get_tarval_one(mode)) {
5626 dbg_info *dbg = get_irn_dbg_info(n);
5627 ir_node *block = get_nodes_block(n);
5628 ir_node *t = new_Const(tarval_sub(a, min, NULL));
5629 ir_node *f = new_Const(tarval_sub(b, min, NULL));
5630 n = new_rd_Mux(dbg, block, sel, f, t, mode);
5631 n = new_rd_Add(dbg, block, n, new_Const(min), mode);
5637 ir_node *cmp = get_Proj_pred(sel);
5638 long pn = get_Proj_proj(sel);
5641 * Note: normalization puts the constant on the right side,
5642 * so we check only one case.
5644 * Note further that these optimization work even for floating point
5645 * with NaN's because -NaN == NaN.
5646 * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
5650 ir_node *cmp_r = get_Cmp_right(cmp);
5651 if (is_Const(cmp_r) && is_Const_null(cmp_r)) {
5652 ir_node *block = get_nodes_block(n);
5653 ir_node *cmp_l = get_Cmp_left(cmp);
5655 if (!mode_honor_signed_zeros(mode) && is_negated_value(f, t)) {
5658 if ( (cmp_l == t && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt))
5659 || (cmp_l == f && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt)))
5661 /* Mux(a >/>= 0, a, -a) = Mux(a </<= 0, -a, a) ==> Abs(a) */
5662 n = new_rd_Abs(get_irn_dbg_info(n), block, cmp_l, mode);
5663 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
5665 } else if ((cmp_l == t && (pn == pn_Cmp_Le || pn == pn_Cmp_Lt))
5666 || (cmp_l == f && (pn == pn_Cmp_Ge || pn == pn_Cmp_Gt)))
5668 /* Mux(a </<= 0, a, -a) = Mux(a >/>= 0, -a, a) ==> -Abs(a) */
5669 n = new_rd_Abs(get_irn_dbg_info(n), block, cmp_l, mode);
5670 n = new_rd_Minus(get_irn_dbg_info(n), block, n, mode);
5671 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_ABS);
5676 if (mode_is_int(mode)) {
5678 if ((pn == pn_Cmp_Lg || pn == pn_Cmp_Eq) && is_And(cmp_l)) {
5679 /* Mux((a & b) != 0, c, 0) */
5680 ir_node *and_r = get_And_right(cmp_l);
5683 if (and_r == t && f == cmp_r) {
5684 if (is_Const(t) && tarval_is_single_bit(get_Const_tarval(t))) {
5685 if (pn == pn_Cmp_Lg) {
5686 /* Mux((a & 2^C) != 0, 2^C, 0) */
5688 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_BITOP);
5690 /* Mux((a & 2^C) == 0, 2^C, 0) */
5691 n = new_rd_Eor(get_irn_dbg_info(n),
5692 block, cmp_l, t, mode);
5693 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_BITOP);
5698 if (is_Shl(and_r)) {
5699 ir_node *shl_l = get_Shl_left(and_r);
5700 if (is_Const(shl_l) && is_Const_one(shl_l)) {
5701 if (and_r == t && f == cmp_r) {
5702 if (pn == pn_Cmp_Lg) {
5703 /* (a & (1 << n)) != 0, (1 << n), 0) */
5705 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_BITOP);
5707 /* (a & (1 << n)) == 0, (1 << n), 0) */
5708 n = new_rd_Eor(get_irn_dbg_info(n),
5709 block, cmp_l, t, mode);
5710 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_BITOP);
5716 and_l = get_And_left(cmp_l);
5717 if (is_Shl(and_l)) {
5718 ir_node *shl_l = get_Shl_left(and_l);
5719 if (is_Const(shl_l) && is_Const_one(shl_l)) {
5720 if (and_l == t && f == cmp_r) {
5721 if (pn == pn_Cmp_Lg) {
5722 /* ((1 << n) & a) != 0, (1 << n), 0) */
5724 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_BITOP);
5726 /* ((1 << n) & a) == 0, (1 << n), 0) */
5727 n = new_rd_Eor(get_irn_dbg_info(n),
5728 block, cmp_l, t, mode);
5729 DBG_OPT_ALGSIM1(oldn, cmp, sel, n, FS_OPT_MUX_TO_BITOP);
5742 } /* transform_node_Mux */
5745 * optimize Sync nodes that have other syncs as input we simply add the inputs
5746 * of the other sync to our own inputs
5748 static ir_node *transform_node_Sync(ir_node *n) {
5749 int arity = get_Sync_n_preds(n);
5752 for (i = 0; i < arity;) {
5753 ir_node *pred = get_Sync_pred(n, i);
5757 if (!is_Sync(pred)) {
5765 pred_arity = get_Sync_n_preds(pred);
5766 for (j = 0; j < pred_arity; ++j) {
5767 ir_node *pred_pred = get_Sync_pred(pred, j);
5772 add_irn_n(n, pred_pred);
5776 if (get_Sync_pred(n, k) == pred_pred) break;
5781 /* rehash the sync node */
5782 add_identities(current_ir_graph->value_table, n);
5785 } /* transform_node_Sync */
5788 * optimize a trampoline Call into a direct Call
5790 static ir_node *transform_node_Call(ir_node *call) {
5791 ir_node *callee = get_Call_ptr(call);
5792 ir_node *adr, *mem, *res, *bl, **in;
5793 ir_type *ctp, *mtp, *tp;
5796 int i, n_res, n_param;
5799 if (! is_Proj(callee))
5801 callee = get_Proj_pred(callee);
5802 if (! is_Builtin(callee))
5804 if (get_Builtin_kind(callee) != ir_bk_inner_trampoline)
5807 mem = get_Call_mem(call);
5809 if (skip_Proj(mem) == callee) {
5810 /* memory is routed to the trampoline, skip */
5811 mem = get_Builtin_mem(callee);
5814 /* build a new call type */
5815 mtp = get_Call_type(call);
5816 id = get_type_ident(mtp);
5817 id = id_mangle(new_id_from_chars("T_", 2), id);
5818 db = get_type_dbg_info(mtp);
5820 n_res = get_method_n_ress(mtp);
5821 n_param = get_method_n_params(mtp);
5822 ctp = new_d_type_method(id, n_param + 1, n_res, db);
5824 for (i = 0; i < n_res; ++i)
5825 set_method_res_type(ctp, i, get_method_res_type(mtp, i));
5827 NEW_ARR_A(ir_node *, in, n_param + 1);
5829 /* FIXME: we don't need a new pointer type in every step */
5830 tp = get_irg_frame_type(current_ir_graph);
5831 id = id_mangle(get_type_ident(tp), new_id_from_chars("_ptr", 4));
5832 tp = new_type_pointer(id, tp, mode_P_data);
5833 set_method_param_type(ctp, 0, tp);
5835 in[0] = get_Builtin_param(callee, 2);
5836 for (i = 0; i < n_param; ++i) {
5837 set_method_param_type(ctp, i + 1, get_method_param_type(mtp, i));
5838 in[i + 1] = get_Call_param(call, i);
5840 var = get_method_variadicity(mtp);
5841 set_method_variadicity(ctp, var);
5842 if (var == variadicity_variadic) {
5843 set_method_first_variadic_param_index(ctp, get_method_first_variadic_param_index(mtp) + 1);
5845 /* When we resolve a trampoline, the function must be called by a this-call */
5846 set_method_calling_convention(ctp, get_method_calling_convention(mtp) | cc_this_call);
5847 set_method_additional_properties(ctp, get_method_additional_properties(mtp));
5849 adr = get_Builtin_param(callee, 1);
5851 db = get_irn_dbg_info(call);
5852 bl = get_nodes_block(call);
5854 res = new_rd_Call(db, bl, mem, adr, n_param + 1, in, ctp);
5855 if (get_irn_pinned(call) == op_pin_state_floats)
5856 set_irn_pinned(res, op_pin_state_floats);
5858 } /* transform_node_Call */
5861 * Tries several [inplace] [optimizing] transformations and returns an
5862 * equivalent node. The difference to equivalent_node() is that these
5863 * transformations _do_ generate new nodes, and thus the old node must
5864 * not be freed even if the equivalent node isn't the old one.
5866 static ir_node *transform_node(ir_node *n) {
5870 * Transform_node is the only "optimizing transformation" that might
5871 * return a node with a different opcode. We iterate HERE until fixpoint
5872 * to get the final result.
5876 if (n->op->ops.transform_node != NULL)
5877 n = n->op->ops.transform_node(n);
5878 } while (oldn != n);
5881 } /* transform_node */
5884 * Sets the default transform node operation for an ir_op_ops.
5886 * @param code the opcode for the default operation
5887 * @param ops the operations initialized
5892 static ir_op_ops *firm_set_default_transform_node(ir_opcode code, ir_op_ops *ops)
5896 ops->transform_node = transform_node_##a; \
5898 #define CASE_PROJ(a) \
5900 ops->transform_node_Proj = transform_node_Proj_##a; \
5902 #define CASE_PROJ_EX(a) \
5904 ops->transform_node = transform_node_##a; \
5905 ops->transform_node_Proj = transform_node_Proj_##a; \
5914 CASE_PROJ_EX(DivMod);
5949 } /* firm_set_default_transform_node */
5952 /* **************** Common Subexpression Elimination **************** */
5954 /** The size of the hash table used, should estimate the number of nodes
5956 #define N_IR_NODES 512
5958 /** Compares the attributes of two Const nodes. */
5959 static int node_cmp_attr_Const(ir_node *a, ir_node *b) {
5960 return (get_Const_tarval(a) != get_Const_tarval(b))
5961 || (get_Const_type(a) != get_Const_type(b));
5962 } /* node_cmp_attr_Const */
5964 /** Compares the attributes of two Proj nodes. */
5965 static int node_cmp_attr_Proj(ir_node *a, ir_node *b) {
5966 return get_irn_proj_attr(a) != get_irn_proj_attr(b);
5967 } /* node_cmp_attr_Proj */
5969 /** Compares the attributes of two Filter nodes. */
5970 static int node_cmp_attr_Filter(ir_node *a, ir_node *b) {
5971 return get_Filter_proj(a) != get_Filter_proj(b);
5972 } /* node_cmp_attr_Filter */
5974 /** Compares the attributes of two Alloc nodes. */
5975 static int node_cmp_attr_Alloc(ir_node *a, ir_node *b) {
5976 const alloc_attr *pa = get_irn_alloc_attr(a);
5977 const alloc_attr *pb = get_irn_alloc_attr(b);
5978 return (pa->where != pb->where) || (pa->type != pb->type);
5979 } /* node_cmp_attr_Alloc */
5981 /** Compares the attributes of two Free nodes. */
5982 static int node_cmp_attr_Free(ir_node *a, ir_node *b) {
5983 const free_attr *pa = get_irn_free_attr(a);
5984 const free_attr *pb = get_irn_free_attr(b);
5985 return (pa->where != pb->where) || (pa->type != pb->type);
5986 } /* node_cmp_attr_Free */
5988 /** Compares the attributes of two SymConst nodes. */
5989 static int node_cmp_attr_SymConst(ir_node *a, ir_node *b) {
5990 const symconst_attr *pa = get_irn_symconst_attr(a);
5991 const symconst_attr *pb = get_irn_symconst_attr(b);
5992 return (pa->kind != pb->kind)
5993 || (pa->sym.type_p != pb->sym.type_p)
5994 || (pa->tp != pb->tp);
5995 } /* node_cmp_attr_SymConst */
5997 /** Compares the attributes of two Call nodes. */
5998 static int node_cmp_attr_Call(ir_node *a, ir_node *b) {
5999 return get_irn_call_attr(a) != get_irn_call_attr(b);
6000 } /* node_cmp_attr_Call */
6002 /** Compares the attributes of two Sel nodes. */
6003 static int node_cmp_attr_Sel(ir_node *a, ir_node *b) {
6004 const ir_entity *a_ent = get_Sel_entity(a);
6005 const ir_entity *b_ent = get_Sel_entity(b);
6008 (a_ent->kind != b_ent->kind) ||
6009 (a_ent->name != b_ent->name) ||
6010 (a_ent->owner != b_ent->owner) ||
6011 (a_ent->ld_name != b_ent->ld_name) ||
6012 (a_ent->type != b_ent->type);
6014 /* Matze: inlining of functions can produce 2 entities with same type,
6016 return a_ent != b_ent;
6017 } /* node_cmp_attr_Sel */
6019 /** Compares the attributes of two Phi nodes. */
6020 static int node_cmp_attr_Phi(ir_node *a, ir_node *b) {
6021 /* we can only enter this function if both nodes have the same number of inputs,
6022 hence it is enough to check if one of them is a Phi0 */
6024 /* check the Phi0 pos attribute */
6025 return get_irn_phi_attr(a)->u.pos != get_irn_phi_attr(b)->u.pos;
6028 } /* node_cmp_attr_Phi */
6030 /** Compares the attributes of two Conv nodes. */
6031 static int node_cmp_attr_Conv(ir_node *a, ir_node *b) {
6032 return get_Conv_strict(a) != get_Conv_strict(b);
6033 } /* node_cmp_attr_Conv */
6035 /** Compares the attributes of two Cast nodes. */
6036 static int node_cmp_attr_Cast(ir_node *a, ir_node *b) {
6037 return get_Cast_type(a) != get_Cast_type(b);
6038 } /* node_cmp_attr_Cast */
6040 /** Compares the attributes of two Load nodes. */
6041 static int node_cmp_attr_Load(ir_node *a, ir_node *b) {
6042 if (get_Load_volatility(a) == volatility_is_volatile ||
6043 get_Load_volatility(b) == volatility_is_volatile)
6044 /* NEVER do CSE on volatile Loads */
6046 /* do not CSE Loads with different alignment. Be conservative. */
6047 if (get_Load_align(a) != get_Load_align(b))
6050 return get_Load_mode(a) != get_Load_mode(b);
6051 } /* node_cmp_attr_Load */
6053 /** Compares the attributes of two Store nodes. */
6054 static int node_cmp_attr_Store(ir_node *a, ir_node *b) {
6055 /* do not CSE Stores with different alignment. Be conservative. */
6056 if (get_Store_align(a) != get_Store_align(b))
6059 /* NEVER do CSE on volatile Stores */
6060 return (get_Store_volatility(a) == volatility_is_volatile ||
6061 get_Store_volatility(b) == volatility_is_volatile);
6062 } /* node_cmp_attr_Store */
6064 /** Compares two exception attributes */
6065 static int node_cmp_exception(ir_node *a, ir_node *b) {
6066 const except_attr *ea = get_irn_except_attr(a);
6067 const except_attr *eb = get_irn_except_attr(b);
6069 return ea->pin_state != eb->pin_state;
6072 #define node_cmp_attr_Bound node_cmp_exception
6074 /** Compares the attributes of two Div nodes. */
6075 static int node_cmp_attr_Div(ir_node *a, ir_node *b) {
6076 const divmod_attr *ma = get_irn_divmod_attr(a);
6077 const divmod_attr *mb = get_irn_divmod_attr(b);
6078 return ma->exc.pin_state != mb->exc.pin_state ||
6079 ma->resmode != mb->resmode ||
6080 ma->no_remainder != mb->no_remainder;
6081 } /* node_cmp_attr_Div */
6083 /** Compares the attributes of two DivMod nodes. */
6084 static int node_cmp_attr_DivMod(ir_node *a, ir_node *b) {
6085 const divmod_attr *ma = get_irn_divmod_attr(a);
6086 const divmod_attr *mb = get_irn_divmod_attr(b);
6087 return ma->exc.pin_state != mb->exc.pin_state ||
6088 ma->resmode != mb->resmode;
6089 } /* node_cmp_attr_DivMod */
6091 /** Compares the attributes of two Mod nodes. */
6092 static int node_cmp_attr_Mod(ir_node *a, ir_node *b) {
6093 const divmod_attr *ma = get_irn_divmod_attr(a);
6094 const divmod_attr *mb = get_irn_divmod_attr(b);
6095 return ma->exc.pin_state != mb->exc.pin_state ||
6096 ma->resmode != mb->resmode;
6097 } /* node_cmp_attr_Mod */
6099 /** Compares the attributes of two Quot nodes. */
6100 static int node_cmp_attr_Quot(ir_node *a, ir_node *b) {
6101 const divmod_attr *ma = get_irn_divmod_attr(a);
6102 const divmod_attr *mb = get_irn_divmod_attr(b);
6103 return ma->exc.pin_state != mb->exc.pin_state ||
6104 ma->resmode != mb->resmode;
6105 } /* node_cmp_attr_Quot */
6107 /** Compares the attributes of two Confirm nodes. */
6108 static int node_cmp_attr_Confirm(ir_node *a, ir_node *b) {
6109 /* no need to compare the bound, as this is a input */
6110 return (get_Confirm_cmp(a) != get_Confirm_cmp(b));
6111 } /* node_cmp_attr_Confirm */
6113 /** Compares the attributes of two Builtin nodes. */
6114 static int node_cmp_attr_Builtin(ir_node *a, ir_node *b) {
6115 const builtin_attr *ma = get_irn_builtin_attr(a);
6116 const builtin_attr *mb = get_irn_builtin_attr(b);
6118 /* no need to compare the type, equal kind means equal type */
6119 return ma->kind != mb->kind;
6120 } /* node_cmp_attr_Builtin */
6122 /** Compares the attributes of two ASM nodes. */
6123 static int node_cmp_attr_ASM(ir_node *a, ir_node *b) {
6125 const ir_asm_constraint *ca;
6126 const ir_asm_constraint *cb;
6129 if (get_ASM_text(a) != get_ASM_text(b))
6132 /* Should we really check the constraints here? Should be better, but is strange. */
6133 n = get_ASM_n_input_constraints(a);
6134 if (n != get_ASM_n_input_constraints(b))
6137 ca = get_ASM_input_constraints(a);
6138 cb = get_ASM_input_constraints(b);
6139 for (i = 0; i < n; ++i) {
6140 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
6144 n = get_ASM_n_output_constraints(a);
6145 if (n != get_ASM_n_output_constraints(b))
6148 ca = get_ASM_output_constraints(a);
6149 cb = get_ASM_output_constraints(b);
6150 for (i = 0; i < n; ++i) {
6151 if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint)
6155 n = get_ASM_n_clobbers(a);
6156 if (n != get_ASM_n_clobbers(b))
6159 cla = get_ASM_clobbers(a);
6160 clb = get_ASM_clobbers(b);
6161 for (i = 0; i < n; ++i) {
6162 if (cla[i] != clb[i])
6166 } /* node_cmp_attr_ASM */
6168 /** Compares the inexistent attributes of two Dummy nodes. */
6169 static int node_cmp_attr_Dummy(ir_node *a, ir_node *b)
6177 * Set the default node attribute compare operation for an ir_op_ops.
6179 * @param code the opcode for the default operation
6180 * @param ops the operations initialized
6185 static ir_op_ops *firm_set_default_node_cmp_attr(ir_opcode code, ir_op_ops *ops)
6189 ops->node_cmp_attr = node_cmp_attr_##a; \
6222 } /* firm_set_default_node_cmp_attr */
6225 * Compare function for two nodes in the value table. Gets two
6226 * nodes as parameters. Returns 0 if the nodes are a Common Sub Expression.
6228 int identities_cmp(const void *elt, const void *key) {
6229 ir_node *a = (ir_node *)elt;
6230 ir_node *b = (ir_node *)key;
6233 if (a == b) return 0;
6235 if ((get_irn_op(a) != get_irn_op(b)) ||
6236 (get_irn_mode(a) != get_irn_mode(b))) return 1;
6238 /* compare if a's in and b's in are of equal length */
6239 irn_arity_a = get_irn_intra_arity(a);
6240 if (irn_arity_a != get_irn_intra_arity(b))
6243 if (get_irn_pinned(a) == op_pin_state_pinned) {
6244 /* for pinned nodes, the block inputs must be equal */
6245 if (get_irn_intra_n(a, -1) != get_irn_intra_n(b, -1))
6247 } else if (! get_opt_global_cse()) {
6248 /* for block-local CSE both nodes must be in the same MacroBlock */
6249 if (get_irn_MacroBlock(a) != get_irn_MacroBlock(b))
6253 /* compare a->in[0..ins] with b->in[0..ins] */
6254 for (i = 0; i < irn_arity_a; i++)
6255 if (get_irn_intra_n(a, i) != get_irn_intra_n(b, i))
6259 * here, we already now that the nodes are identical except their
6262 if (a->op->ops.node_cmp_attr)
6263 return a->op->ops.node_cmp_attr(a, b);
6266 } /* identities_cmp */
6269 * Calculate a hash value of a node.
6271 * @param node The IR-node
6273 unsigned ir_node_hash(const ir_node *node) {
6274 return node->op->ops.hash(node);
6275 } /* ir_node_hash */
6278 pset *new_identities(void) {
6279 return new_pset(identities_cmp, N_IR_NODES);
6280 } /* new_identities */
6282 void del_identities(pset *value_table) {
6283 del_pset(value_table);
6284 } /* del_identities */
6286 /* Normalize a node by putting constants (and operands with larger
6287 * node index) on the right (operator side). */
6288 void ir_normalize_node(ir_node *n) {
6289 if (is_op_commutative(get_irn_op(n))) {
6290 ir_node *l = get_binop_left(n);
6291 ir_node *r = get_binop_right(n);
6293 /* For commutative operators perform a OP b == b OP a but keep
6294 * constants on the RIGHT side. This helps greatly in some
6295 * optimizations. Moreover we use the idx number to make the form
6297 if (!operands_are_normalized(l, r)) {
6298 set_binop_left(n, r);
6299 set_binop_right(n, l);
6303 } /* ir_normalize_node */
6306 * Update the nodes after a match in the value table. If both nodes have
6307 * the same MacroBlock but different Blocks, we must ensure that the node
6308 * with the dominating Block (the node that is near to the MacroBlock header
6309 * is stored in the table.
6310 * Because a MacroBlock has only one "non-exception" flow, we don't need
6311 * dominance info here: We known, that one block must dominate the other and
6312 * following the only block input will allow to find it.
6314 static void update_known_irn(ir_node *known_irn, const ir_node *new_ir_node) {
6315 ir_node *known_blk, *new_block, *block, *mbh;
6317 if (get_opt_global_cse()) {
6318 /* Block inputs are meaning less */
6321 known_blk = get_irn_n(known_irn, -1);
6322 new_block = get_irn_n(new_ir_node, -1);
6323 if (known_blk == new_block) {
6324 /* already in the same block */
6328 * We expect the typical case when we built the graph. In that case, the
6329 * known_irn is already the upper one, so checking this should be faster.
6332 mbh = get_Block_MacroBlock(new_block);
6334 if (block == known_blk) {
6335 /* ok, we have found it: known_block dominates new_block as expected */
6340 * We have reached the MacroBlock header NOT founding
6341 * the known_block. new_block must dominate known_block.
6344 set_irn_n(known_irn, -1, new_block);
6347 assert(get_Block_n_cfgpreds(block) == 1);
6348 block = get_Block_cfgpred_block(block, 0);
6350 } /* update_value_table */
6353 * Return the canonical node computing the same value as n.
6354 * Looks up the node in a hash table, enters it in the table
6355 * if it isn't there yet.
6357 * @param value_table the HashSet containing all nodes in the
6359 * @param n the node to look up
6361 * @return a node that computes the same value as n or n if no such
6362 * node could be found
6364 ir_node *identify_remember(pset *value_table, ir_node *n) {
6367 if (!value_table) return n;
6369 ir_normalize_node(n);
6370 /* lookup or insert in hash table with given hash key. */
6371 o = pset_insert(value_table, n, ir_node_hash(n));
6374 update_known_irn(o, n);
6378 } /* identify_remember */
6381 * During construction we set the op_pin_state_pinned flag in the graph right when the
6382 * optimization is performed. The flag turning on procedure global cse could
6383 * be changed between two allocations. This way we are safe.
6385 * @param value_table The value table
6386 * @param n The node to lookup
6388 static inline ir_node *identify_cons(pset *value_table, ir_node *n) {
6391 n = identify_remember(value_table, n);
6392 if (n != old && get_irn_MacroBlock(old) != get_irn_MacroBlock(n))
6393 set_irg_pinned(current_ir_graph, op_pin_state_floats);
6395 } /* identify_cons */
6397 /* Add a node to the identities value table. */
6398 void add_identities(pset *value_table, ir_node *node) {
6399 if (get_opt_cse() && is_no_Block(node))
6400 identify_remember(value_table, node);
6401 } /* add_identities */
6403 /* Visit each node in the value table of a graph. */
6404 void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env) {
6406 ir_graph *rem = current_ir_graph;
6408 current_ir_graph = irg;
6409 foreach_pset(irg->value_table, node)
6411 current_ir_graph = rem;
6412 } /* visit_all_identities */
6415 * Garbage in, garbage out. If a node has a dead input, i.e., the
6416 * Bad node is input to the node, return the Bad node.
6418 static ir_node *gigo(ir_node *node) {
6420 ir_op *op = get_irn_op(node);
6422 /* remove garbage blocks by looking at control flow that leaves the block
6423 and replacing the control flow by Bad. */
6424 if (get_irn_mode(node) == mode_X) {
6425 ir_node *block = get_nodes_block(skip_Proj(node));
6427 /* Don't optimize nodes in immature blocks. */
6428 if (!get_Block_matured(block))
6430 /* Don't optimize End, may have Bads. */
6431 if (op == op_End) return node;
6433 if (is_Block(block)) {
6434 if (is_Block_dead(block)) {
6435 /* control flow from dead block is dead */
6439 for (i = get_irn_arity(block) - 1; i >= 0; --i) {
6440 if (!is_Bad(get_irn_n(block, i)))
6444 ir_graph *irg = get_irn_irg(block);
6445 /* the start block is never dead */
6446 if (block != get_irg_start_block(irg)
6447 && block != get_irg_end_block(irg)) {
6449 * Do NOT kill control flow without setting
6450 * the block to dead of bad things can happen:
6451 * We get a Block that is not reachable be irg_block_walk()
6452 * but can be found by irg_walk()!
6454 set_Block_dead(block);
6461 /* Blocks, Phis and Tuples may have dead inputs, e.g., if one of the
6462 blocks predecessors is dead. */
6463 if (op != op_Block && op != op_Phi && op != op_Tuple) {
6464 irn_arity = get_irn_arity(node);
6467 * Beware: we can only read the block of a non-floating node.
6469 if (is_irn_pinned_in_irg(node) &&
6470 is_Block_dead(get_nodes_block(skip_Proj(node))))
6473 for (i = 0; i < irn_arity; i++) {
6474 ir_node *pred = get_irn_n(node, i);
6479 /* Propagating Unknowns here seems to be a bad idea, because
6480 sometimes we need a node as a input and did not want that
6482 However, it might be useful to move this into a later phase
6483 (if you think that optimizing such code is useful). */
6484 if (is_Unknown(pred) && mode_is_data(get_irn_mode(node)))
6485 return new_Unknown(get_irn_mode(node));
6490 /* With this code we violate the agreement that local_optimize
6491 only leaves Bads in Block, Phi and Tuple nodes. */
6492 /* If Block has only Bads as predecessors it's garbage. */
6493 /* If Phi has only Bads as predecessors it's garbage. */
6494 if ((op == op_Block && get_Block_matured(node)) || op == op_Phi) {
6495 irn_arity = get_irn_arity(node);
6496 for (i = 0; i < irn_arity; i++) {
6497 if (!is_Bad(get_irn_n(node, i))) break;
6499 if (i == irn_arity) node = new_Bad();
6506 * These optimizations deallocate nodes from the obstack.
6507 * It can only be called if it is guaranteed that no other nodes
6508 * reference this one, i.e., right after construction of a node.
6510 * @param n The node to optimize
6512 * current_ir_graph must be set to the graph of the node!
6514 ir_node *optimize_node(ir_node *n) {
6517 ir_opcode iro = get_irn_opcode(n);
6519 /* Always optimize Phi nodes: part of the construction. */
6520 if ((!get_opt_optimize()) && (iro != iro_Phi)) return n;
6522 /* constant expression evaluation / constant folding */
6523 if (get_opt_constant_folding()) {
6524 /* neither constants nor Tuple values can be evaluated */
6525 if (iro != iro_Const && (get_irn_mode(n) != mode_T)) {
6526 unsigned fp_model = get_irg_fp_model(current_ir_graph);
6527 int old_fp_mode = tarval_fp_ops_enabled();
6529 tarval_enable_fp_ops(! (fp_model & fp_no_float_fold));
6531 /* try to evaluate */
6532 tv = computed_value(n);
6533 if (tv != tarval_bad) {
6535 ir_type *old_tp = get_irn_type(n);
6536 int i, arity = get_irn_arity(n);
6540 * Try to recover the type of the new expression.
6542 for (i = 0; i < arity && !old_tp; ++i)
6543 old_tp = get_irn_type(get_irn_n(n, i));
6546 * we MUST copy the node here temporary, because it's still needed
6547 * for DBG_OPT_CSTEVAL
6549 node_size = offsetof(ir_node, attr) + n->op->attr_size;
6550 oldn = alloca(node_size);
6552 memcpy(oldn, n, node_size);
6553 CLONE_ARR_A(ir_node *, oldn->in, n->in);
6555 /* ARG, copy the in array, we need it for statistics */
6556 memcpy(oldn->in, n->in, ARR_LEN(n->in) * sizeof(n->in[0]));
6558 /* note the inplace edges module */
6559 edges_node_deleted(n, current_ir_graph);
6561 /* evaluation was successful -- replace the node. */
6562 irg_kill_node(current_ir_graph, n);
6565 if (old_tp && get_type_mode(old_tp) == get_tarval_mode(tv))
6566 set_Const_type(nw, old_tp);
6567 DBG_OPT_CSTEVAL(oldn, nw);
6568 tarval_enable_fp_ops(old_fp_mode);
6571 tarval_enable_fp_ops(old_fp_mode);
6575 /* remove unnecessary nodes */
6576 if (get_opt_algebraic_simplification() ||
6577 (iro == iro_Phi) || /* always optimize these nodes. */
6579 (iro == iro_Proj) ||
6580 (iro == iro_Block) ) /* Flags tested local. */
6581 n = equivalent_node(n);
6583 /* Common Subexpression Elimination.
6585 * Checks whether n is already available.
6586 * The block input is used to distinguish different subexpressions. Right
6587 * now all nodes are op_pin_state_pinned to blocks, i.e., the CSE only finds common
6588 * subexpressions within a block.
6591 n = identify_cons(current_ir_graph->value_table, n);
6594 edges_node_deleted(oldn, current_ir_graph);
6596 /* We found an existing, better node, so we can deallocate the old node. */
6597 irg_kill_node(current_ir_graph, oldn);
6601 /* Some more constant expression evaluation that does not allow to
6603 iro = get_irn_opcode(n);
6604 if (get_opt_algebraic_simplification() ||
6605 (iro == iro_Cond) ||
6606 (iro == iro_Proj)) /* Flags tested local. */
6607 n = transform_node(n);
6609 /* Remove nodes with dead (Bad) input.
6610 Run always for transformation induced Bads. */
6613 /* Now we have a legal, useful node. Enter it in hash table for CSE */
6614 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block)) {
6616 n = identify_remember(current_ir_graph->value_table, o);
6622 } /* optimize_node */
6626 * These optimizations never deallocate nodes (in place). This can cause dead
6627 * nodes lying on the obstack. Remove these by a dead node elimination,
6628 * i.e., a copying garbage collection.
6630 ir_node *optimize_in_place_2(ir_node *n) {
6633 ir_opcode iro = get_irn_opcode(n);
6635 if (!get_opt_optimize() && !is_Phi(n)) return n;
6637 /* constant expression evaluation / constant folding */
6638 if (get_opt_constant_folding()) {
6639 /* neither constants nor Tuple values can be evaluated */
6640 if (iro != iro_Const && get_irn_mode(n) != mode_T) {
6641 unsigned fp_model = get_irg_fp_model(current_ir_graph);
6642 int old_fp_mode = tarval_fp_ops_enabled();
6644 tarval_enable_fp_ops((fp_model & fp_strict_algebraic) == 0);
6645 /* try to evaluate */
6646 tv = computed_value(n);
6647 if (tv != tarval_bad) {
6648 /* evaluation was successful -- replace the node. */
6649 ir_type *old_tp = get_irn_type(n);
6650 int i, arity = get_irn_arity(n);
6653 * Try to recover the type of the new expression.
6655 for (i = 0; i < arity && !old_tp; ++i)
6656 old_tp = get_irn_type(get_irn_n(n, i));
6660 if (old_tp && get_type_mode(old_tp) == get_tarval_mode(tv))
6661 set_Const_type(n, old_tp);
6663 DBG_OPT_CSTEVAL(oldn, n);
6664 tarval_enable_fp_ops(old_fp_mode);
6667 tarval_enable_fp_ops(old_fp_mode);
6671 /* remove unnecessary nodes */
6672 if (get_opt_constant_folding() ||
6673 (iro == iro_Phi) || /* always optimize these nodes. */
6674 (iro == iro_Id) || /* ... */
6675 (iro == iro_Proj) || /* ... */
6676 (iro == iro_Block) ) /* Flags tested local. */
6677 n = equivalent_node(n);
6679 /** common subexpression elimination **/
6680 /* Checks whether n is already available. */
6681 /* The block input is used to distinguish different subexpressions. Right
6682 now all nodes are op_pin_state_pinned to blocks, i.e., the cse only finds common
6683 subexpressions within a block. */
6684 if (get_opt_cse()) {
6686 n = identify_remember(current_ir_graph->value_table, o);
6691 /* Some more constant expression evaluation. */
6692 iro = get_irn_opcode(n);
6693 if (get_opt_constant_folding() ||
6694 (iro == iro_Cond) ||
6695 (iro == iro_Proj)) /* Flags tested local. */
6696 n = transform_node(n);
6698 /* Remove nodes with dead (Bad) input.
6699 Run always for transformation induced Bads. */
6702 /* Now we can verify the node, as it has no dead inputs any more. */
6705 /* Now we have a legal, useful node. Enter it in hash table for cse.
6706 Blocks should be unique anyways. (Except the successor of start:
6707 is cse with the start block!) */
6708 if (get_opt_cse() && (get_irn_opcode(n) != iro_Block)) {
6710 n = identify_remember(current_ir_graph->value_table, o);
6716 } /* optimize_in_place_2 */
6719 * Wrapper for external use, set proper status bits after optimization.
6721 ir_node *optimize_in_place(ir_node *n) {
6722 /* Handle graph state */
6723 assert(get_irg_phase_state(current_ir_graph) != phase_building);
6725 if (get_opt_global_cse())
6726 set_irg_pinned(current_ir_graph, op_pin_state_floats);
6727 if (get_irg_outs_state(current_ir_graph) == outs_consistent)
6728 set_irg_outs_inconsistent(current_ir_graph);
6730 /* FIXME: Maybe we could also test whether optimizing the node can
6731 change the control graph. */
6732 set_irg_doms_inconsistent(current_ir_graph);
6733 return optimize_in_place_2(n);
6734 } /* optimize_in_place */
6737 * Calculate a hash value of a Const node.
6739 static unsigned hash_Const(const ir_node *node) {
6742 /* special value for const, as they only differ in their tarval. */
6743 h = HASH_PTR(node->attr.con.tv);
6749 * Calculate a hash value of a SymConst node.
6751 static unsigned hash_SymConst(const ir_node *node) {
6754 /* all others are pointers */
6755 h = HASH_PTR(node->attr.symc.sym.type_p);
6758 } /* hash_SymConst */
6761 * Set the default hash operation in an ir_op_ops.
6763 * @param code the opcode for the default operation
6764 * @param ops the operations initialized
6769 static ir_op_ops *firm_set_default_hash(ir_opcode code, ir_op_ops *ops)
6773 ops->hash = hash_##a; \
6776 /* hash function already set */
6777 if (ops->hash != NULL)
6784 /* use input/mode default hash if no function was given */
6785 ops->hash = firm_default_hash;
6793 * Sets the default operation for an ir_ops.
6795 ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops) {
6796 ops = firm_set_default_hash(code, ops);
6797 ops = firm_set_default_computed_value(code, ops);
6798 ops = firm_set_default_equivalent_node(code, ops);
6799 ops = firm_set_default_transform_node(code, ops);
6800 ops = firm_set_default_node_cmp_attr(code, ops);
6801 ops = firm_set_default_get_type(code, ops);
6802 ops = firm_set_default_get_type_attr(code, ops);
6803 ops = firm_set_default_get_entity_attr(code, ops);
6806 } /* firm_set_default_operations */