X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firopt.c;h=5ff0f84fff18853000835ddf9e5056da3483a5df;hb=04d455ab69c9d1549305ccbd6f97eb802db91ff4;hp=51e8854750cbd4c82c243762d1ab750553f18630;hpb=52cea85678c5ff65f3db786f85a83de2b657a0e8;p=libfirm diff --git a/ir/ir/iropt.c b/ir/ir/iropt.c index 51e885475..5ff0f84ff 100644 --- a/ir/ir/iropt.c +++ b/ir/ir/iropt.c @@ -21,7 +21,6 @@ * @file * @brief iropt --- optimizations intertwined with IR construction. * @author Christian Schaefer, Goetz Lindenmaier, Michael Beck - * @version $Id$ */ #include "config.h" @@ -44,7 +43,6 @@ #include "irhooks.h" #include "irarch.h" #include "hashptr.h" -#include "opt_polymorphy.h" #include "irtools.h" #include "irhooks.h" #include "array_t.h" @@ -53,9 +51,24 @@ #include "bitfiddle.h" #include "be.h" -/* Make types visible to allow most efficient access */ #include "entity_t.h" +static bool is_Or_Eor_Add(const ir_node *node) +{ + if (is_Or(node) || is_Eor(node) || is_Add(node)) { + ir_node *left = get_binop_left(node); + ir_node *right = get_binop_right(node); + vrp_attr *vrp_left = vrp_get_info(left); + vrp_attr *vrp_right = vrp_get_info(right); + if (vrp_left != NULL && vrp_right != NULL) { + ir_tarval *vrp_val + = tarval_and(vrp_left->bits_not_set, vrp_right->bits_not_set); + return tarval_is_null(vrp_val); + } + } + return false; +} + /** * Returns the tarval of a Const node or tarval_bad for all other nodes. */ @@ -69,7 +82,6 @@ static ir_tarval *default_value_of(const ir_node *n) value_of_func value_of_ptr = default_value_of; -/* * Set a new value_of function. */ void set_value_of_func(value_of_func func) { if (func != NULL) @@ -84,7 +96,7 @@ void set_value_of_func(value_of_func func) static ir_tarval *computed_value_Const(const ir_node *n) { return get_Const_tarval(n); -} /* computed_value_Const */ +} /** * Return the value of a 'sizeof', 'alignof' or 'offsetof' SymConst. @@ -115,7 +127,7 @@ static ir_tarval *computed_value_SymConst(const ir_node *n) break; } return tarval_bad; -} /* computed_value_SymConst */ +} /** * Return the value of an Add. @@ -131,8 +143,14 @@ static ir_tarval *computed_value_Add(const ir_node *n) if ((ta != tarval_bad) && (tb != tarval_bad)) return tarval_add(ta, tb); + /* x+~x => -1 */ + if ((is_Not(a) && get_Not_op(a) == b) + || (is_Not(b) && get_Not_op(b) == a)) { + return get_mode_all_one(get_irn_mode(n)); + } + return tarval_bad; -} /* computed_value_Add */ +} /** * Return the value of a Sub. @@ -160,7 +178,7 @@ static ir_tarval *computed_value_Sub(const ir_node *n) return tarval_sub(ta, tb, mode); return tarval_bad; -} /* computed_value_Sub */ +} /** * Return the value of a Carry. @@ -182,7 +200,7 @@ static ir_tarval *computed_value_Carry(const ir_node *n) return get_mode_null(m); } return tarval_bad; -} /* computed_value_Carry */ +} /** * Return the value of a Borrow. @@ -202,7 +220,7 @@ static ir_tarval *computed_value_Borrow(const ir_node *n) return get_mode_null(m); } return tarval_bad; -} /* computed_value_Borrow */ +} /** * Return the value of an unary Minus. @@ -216,7 +234,7 @@ static ir_tarval *computed_value_Minus(const ir_node *n) return tarval_neg(ta); return tarval_bad; -} /* computed_value_Minus */ +} /** * Return the value of a Mul. @@ -249,7 +267,7 @@ static ir_tarval *computed_value_Mul(const ir_node *n) } } return tarval_bad; -} /* computed_value_Mul */ +} /** * Return the value of an And. @@ -264,12 +282,19 @@ static ir_tarval *computed_value_And(const ir_node *n) if ((ta != tarval_bad) && (tb != tarval_bad)) { return tarval_and (ta, tb); - } else { - if (tarval_is_null(ta)) return ta; - if (tarval_is_null(tb)) return tb; } + + if (tarval_is_null(ta)) return ta; + if (tarval_is_null(tb)) return tb; + + /* x&~x => 0 */ + if ((is_Not(a) && get_Not_op(a) == b) + || (is_Not(b) && get_Not_op(b) == a)) { + return get_mode_null(get_irn_mode(n)); + } + return tarval_bad; -} /* computed_value_And */ +} /** * Return the value of an Or. @@ -284,12 +309,18 @@ static ir_tarval *computed_value_Or(const ir_node *n) if ((ta != tarval_bad) && (tb != tarval_bad)) { return tarval_or (ta, tb); - } else { - if (tarval_is_all_one(ta)) return ta; - if (tarval_is_all_one(tb)) return tb; + } + + if (tarval_is_all_one(ta)) return ta; + if (tarval_is_all_one(tb)) return tb; + + /* x|~x => -1 */ + if ((is_Not(a) && get_Not_op(a) == b) + || (is_Not(b) && get_Not_op(b) == a)) { + return get_mode_all_one(get_irn_mode(n)); } return tarval_bad; -} /* computed_value_Or */ +} /** * Return the value of an Eor. @@ -303,6 +334,11 @@ static ir_tarval *computed_value_Eor(const ir_node *n) if (a == b) return get_mode_null(get_irn_mode(n)); + /* x^~x => -1 */ + if ((is_Not(a) && get_Not_op(a) == b) + || (is_Not(b) && get_Not_op(b) == a)) { + return get_mode_all_one(get_irn_mode(n)); + } ta = value_of(a); tb = value_of(b); @@ -311,7 +347,7 @@ static ir_tarval *computed_value_Eor(const ir_node *n) return tarval_eor(ta, tb); } return tarval_bad; -} /* computed_value_Eor */ +} /** * Return the value of a Not. @@ -325,7 +361,29 @@ static ir_tarval *computed_value_Not(const ir_node *n) return tarval_not(ta); return tarval_bad; -} /* computed_value_Not */ +} + +/** + * Tests whether a shift shifts more bits than available in the mode + */ +static bool is_oversize_shift(const ir_node *n) +{ + ir_node *count = get_binop_right(n); + ir_mode *mode = get_irn_mode(n); + ir_tarval *tv = value_of(count); + long modulo_shift; + long shiftval; + if (tv == tarval_bad) + return false; + if (!tarval_is_long(tv)) + return false; + shiftval = get_tarval_long(tv); + modulo_shift = get_mode_modulo_shift(mode); + if (shiftval < 0 || (modulo_shift > 0 && shiftval >= modulo_shift)) + return false; + + return shiftval >= (long)get_mode_size_bits(mode); +} /** * Return the value of a Shl. @@ -341,8 +399,12 @@ static ir_tarval *computed_value_Shl(const ir_node *n) if ((ta != tarval_bad) && (tb != tarval_bad)) { return tarval_shl(ta, tb); } + + if (is_oversize_shift(n)) + return get_mode_null(get_irn_mode(n)); + return tarval_bad; -} /* computed_value_Shl */ +} /** * Return the value of a Shr. @@ -358,8 +420,11 @@ static ir_tarval *computed_value_Shr(const ir_node *n) if ((ta != tarval_bad) && (tb != tarval_bad)) { return tarval_shr(ta, tb); } + if (is_oversize_shift(n)) + return get_mode_null(get_irn_mode(n)); + return tarval_bad; -} /* computed_value_Shr */ +} /** * Return the value of a Shrs. @@ -376,7 +441,7 @@ static ir_tarval *computed_value_Shrs(const ir_node *n) return tarval_shrs(ta, tb); } return tarval_bad; -} /* computed_value_Shrs */ +} /** * Return the value of a Rotl. @@ -393,21 +458,56 @@ static ir_tarval *computed_value_Rotl(const ir_node *n) return tarval_rotl(ta, tb); } return tarval_bad; -} /* computed_value_Rotl */ +} + +bool ir_zero_when_converted(const ir_node *node, ir_mode *dest_mode) +{ + ir_mode *mode = get_irn_mode(node); + if (get_mode_arithmetic(mode) != irma_twos_complement + || get_mode_arithmetic(dest_mode) != irma_twos_complement) + return false; + + if (is_Shl(node)) { + ir_node *count = get_Shl_right(node); + if (is_Const(count)) { + ir_tarval *tv = get_Const_tarval(count); + if (tarval_is_long(tv)) { + long shiftval = get_tarval_long(tv); + long destbits = get_mode_size_bits(dest_mode); + if (shiftval >= destbits + && shiftval < (long)get_mode_modulo_shift(mode)) + return true; + } + } + } + if (is_And(node)) { + ir_node *right = get_And_right(node); + if (is_Const(right)) { + ir_tarval *tv = get_Const_tarval(right); + ir_tarval *conved = tarval_convert_to(tv, dest_mode); + return tarval_is_null(conved); + } + } + return false; +} /** * Return the value of a Conv. */ static ir_tarval *computed_value_Conv(const ir_node *n) { - ir_node *a = get_Conv_op(n); - ir_tarval *ta = value_of(a); + ir_node *a = get_Conv_op(n); + ir_tarval *ta = value_of(a); + ir_mode *mode = get_irn_mode(n); if (ta != tarval_bad) return tarval_convert_to(ta, get_irn_mode(n)); + if (ir_zero_when_converted(a, mode)) + return get_mode_null(mode); + return tarval_bad; -} /* computed_value_Conv */ +} /** * Calculate the value of a Mux: can be evaluated, if the @@ -427,7 +527,7 @@ static ir_tarval *computed_value_Mux(const ir_node *n) return value_of(v); } return tarval_bad; -} /* computed_value_Mux */ +} /** * Calculate the value of a Confirm: can be evaluated, @@ -441,7 +541,7 @@ static ir_tarval *computed_value_Confirm(const ir_node *n) return tv; } return value_of(get_Confirm_value(n)); -} /* computed_value_Confirm */ +} /** * gives a (conservative) estimation of possible relation when comparing @@ -484,17 +584,20 @@ ir_relation ir_get_possible_cmp_relations(const ir_node *left, /* Alloc nodes never return null (but throw an exception) */ if (is_Alloc(left) && tarval_is_null(tv_r)) possible &= ~ir_relation_equal; + /* stuff known through confirm nodes */ + if (is_Confirm(left) && get_Confirm_bound(left) == right) { + possible &= get_Confirm_relation(left); + } + if (is_Confirm(right) && get_Confirm_bound(right) == left) { + ir_relation relation = get_Confirm_relation(right); + relation = get_inversed_relation(relation); + possible &= relation; + } return possible; } -/** - * Return the value of a Cmp. - * - * The basic idea here is to determine which relations are possible and which - * one are definitely impossible. - */ -static ir_tarval *computed_value_Cmp(const ir_node *cmp) +static ir_tarval *compute_cmp(const ir_node *cmp) { ir_node *left = get_Cmp_left(cmp); ir_node *right = get_Cmp_right(cmp); @@ -511,6 +614,32 @@ static ir_tarval *computed_value_Cmp(const ir_node *cmp) return computed_value_Cmp_Confirm(cmp, left, right, relation); } +/** + * some people want to call compute_cmp directly, in this case we have to + * test the constant folding flag again + */ +static ir_tarval *compute_cmp_ext(const ir_node *cmp) +{ + if (!get_opt_constant_folding()) + return tarval_bad; + return compute_cmp(cmp); +} + +/** + * Return the value of a Cmp. + * + * The basic idea here is to determine which relations are possible and which + * one are definitely impossible. + */ +static ir_tarval *computed_value_Cmp(const ir_node *cmp) +{ + /* we can't construct Constb after lowering mode_b nodes */ + if (irg_is_constrained(get_irn_irg(cmp), IR_GRAPH_CONSTRAINT_MODEB_LOWERED)) + return tarval_bad; + + return compute_cmp(cmp); +} + /** * Calculate the value of an integer Div. * Special case: 0 / b @@ -533,7 +662,7 @@ static ir_tarval *do_computed_value_Div(const ir_node *div) if (ta != tarval_bad && tb != tarval_bad) return tarval_div(ta, tb); return tarval_bad; -} /* do_computed_value_Div */ +} /** * Calculate the value of an integer Mod of two nodes. @@ -550,7 +679,7 @@ static ir_tarval *do_computed_value_Mod(const ir_node *a, const ir_node *b) if (ta != tarval_bad && tb != tarval_bad) return tarval_mod(ta, tb); return tarval_bad; -} /* do_computed_value_Mod */ +} /** * Return the value of a Proj(Div). @@ -562,7 +691,7 @@ static ir_tarval *computed_value_Proj_Div(const ir_node *n) return tarval_bad; return do_computed_value_Div(get_Proj_pred(n)); -} /* computed_value_Proj_Div */ +} /** * Return the value of a Proj(Mod). @@ -576,7 +705,7 @@ static ir_tarval *computed_value_Proj_Mod(const ir_node *n) return do_computed_value_Mod(get_Mod_left(mod), get_Mod_right(mod)); } return tarval_bad; -} /* computed_value_Proj_Mod */ +} /** * Return the value of a Proj. @@ -588,7 +717,7 @@ static ir_tarval *computed_value_Proj(const ir_node *proj) if (n->op->ops.computed_value_Proj != NULL) return n->op->ops.computed_value_Proj(proj); return tarval_bad; -} /* computed_value_Proj */ +} /** * If the parameter n can be computed, return its value, else tarval_bad. @@ -599,154 +728,13 @@ static ir_tarval *computed_value_Proj(const ir_node *proj) ir_tarval *computed_value(const ir_node *n) { vrp_attr *vrp = vrp_get_info(n); - if (vrp && vrp->valid && tarval_cmp(vrp->bits_set, vrp->bits_not_set) == ir_relation_equal) { + if (vrp != NULL && vrp->bits_set == vrp->bits_not_set) return vrp->bits_set; - } + if (n->op->ops.computed_value) return n->op->ops.computed_value(n); return tarval_bad; -} /* computed_value */ - -/** - * Set the default computed_value evaluator in an ir_op_ops. - * - * @param code the opcode for the default operation - * @param ops the operations initialized - * - * @return - * The operations. - */ -static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops) -{ -#define CASE(a) \ - case iro_##a: \ - ops->computed_value = computed_value_##a; \ - break -#define CASE_PROJ(a) \ - case iro_##a: \ - ops->computed_value_Proj = computed_value_Proj_##a; \ - break - - switch (code) { - CASE(Add); - CASE(And); - CASE(Borrow); - CASE(Carry); - CASE(Cmp); - CASE(Confirm); - CASE(Const); - CASE(Conv); - CASE(Eor); - CASE(Minus); - CASE(Mul); - CASE(Mux); - CASE(Not); - CASE(Or); - CASE(Proj); - CASE(Rotl); - CASE(Shl); - CASE(Shr); - CASE(Shrs); - CASE(Sub); - CASE(SymConst); - CASE_PROJ(Div); - CASE_PROJ(Mod); - default: - /* leave NULL */ - break; - } - - return ops; -#undef CASE_PROJ -#undef CASE -} /* firm_set_default_computed_value */ - -/** - * Returns a equivalent block for another block. - * If the block has only one predecessor, this is - * the equivalent one. If the only predecessor of a block is - * the block itself, this is a dead block. - * - * If both predecessors of a block are the branches of a binary - * Cond, the equivalent block is Cond's block. - * - * If all predecessors of a block are bad or lies in a dead - * block, the current block is dead as well. - */ -static ir_node *equivalent_node_Block(ir_node *n) -{ - ir_node *oldn = n; - int n_preds; - ir_graph *irg; - - /* don't optimize dead or labeled blocks */ - if (has_Block_entity(n)) - return n; - - n_preds = get_Block_n_cfgpreds(n); - - /* The Block constructor does not call optimize, but mature_immBlock() - calls the optimization. */ - assert(get_Block_matured(n)); - - irg = get_irn_irg(n); - - /* if all predecessors of a block are unreachable, then the block is - * unreachable */ - if (is_irg_state(irg, IR_GRAPH_STATE_BAD_BLOCK)) { - int i; - int n_cfgpreds = get_Block_n_cfgpreds(n); - - for (i = 0; i < n_cfgpreds; ++i) { - ir_node *pred = get_Block_cfgpred(n, i); - if (!is_Bad(pred)) - break; - } - /* only bad inputs? It's unreachable code (unless it is the start or - * end block) */ - if (i >= n_cfgpreds && n != get_irg_start_block(irg) - && n != get_irg_end_block(irg)) { - return get_irg_bad(irg); - } - } - - /* Straightening: a single entry Block following a single exit Block - * can be merged. */ - if (n_preds == 1) { - ir_node *pred = get_Block_cfgpred(n, 0); - - if (is_Jmp(pred)) { - ir_node *pred_block = get_nodes_block(pred); - DBG_OPT_STG(n, pred_block); - return pred_block; - } - } else if (n_preds == 2) { - /* Test whether Cond jumps twice to this block - * The more general case which more than 2 predecessors is handles - * in optimize_cf(), we handle only this special case for speed here. - */ - ir_node *a = get_Block_cfgpred(n, 0); - ir_node *b = get_Block_cfgpred(n, 1); - - if (is_Proj(a) && is_Proj(b)) { - ir_node *cond = get_Proj_pred(a); - - if (cond == get_Proj_pred(b) && is_Cond(cond) && - get_irn_mode(get_Cond_selector(cond)) == mode_b) { - /* Also a single entry Block following a single exit Block. - * Phis have twice the same operand and will be optimized away. - */ - n = get_nodes_block(cond); - DBG_OPT_IFSIM1(oldn, a, b, n); - } - } - } - - return n; -} /* equivalent_node_Block */ - -/* We do not evaluate Cond here as we replace it by a new node, a Jmp. - See transform_node_Proj_Cond(). */ +} /** * Optimize operations that are commutative and have neutral 0, @@ -785,7 +773,7 @@ static ir_node *equivalent_node_neutral_zero(ir_node *n) } return n; -} /* equivalent_node_neutral_zero */ +} /** * Eor is commutative and has neutral 0. @@ -802,9 +790,9 @@ static ir_node *equivalent_node_Eor(ir_node *n) a = get_Eor_left(n); b = get_Eor_right(n); - if (is_Eor(a)) { - ir_node *aa = get_Eor_left(a); - ir_node *ab = get_Eor_right(a); + if (is_Eor(a) || is_Or_Eor_Add(a)) { + ir_node *aa = get_binop_left(a); + ir_node *ab = get_binop_right(a); if (aa == b) { /* (a ^ b) ^ a -> b */ @@ -818,9 +806,9 @@ static ir_node *equivalent_node_Eor(ir_node *n) return n; } } - if (is_Eor(b)) { - ir_node *ba = get_Eor_left(b); - ir_node *bb = get_Eor_right(b); + if (is_Eor(b) || is_Or_Eor_Add(b)) { + ir_node *ba = get_binop_left(b); + ir_node *bb = get_binop_right(b); if (ba == a) { /* a ^ (a ^ b) -> b */ @@ -889,7 +877,7 @@ static ir_node *equivalent_node_Add(ir_node *n) } } return n; -} /* equivalent_node_Add */ +} /** * optimize operations that are not commutative but have neutral 0 on left, @@ -909,12 +897,7 @@ static ir_node *equivalent_node_left_zero(ir_node *n) DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0); } return n; -} /* equivalent_node_left_zero */ - -#define equivalent_node_Shl equivalent_node_left_zero -#define equivalent_node_Shr equivalent_node_left_zero -#define equivalent_node_Shrs equivalent_node_left_zero -#define equivalent_node_Rotl equivalent_node_left_zero +} /** * Optimize a - 0 and (a + x) - x (for modes with wrap-around). @@ -952,11 +935,11 @@ static ir_node *equivalent_node_Sub(ir_node *n) } } return n; -} /* equivalent_node_Sub */ +} /** - * Optimize an "self-inverse unary op", ie op(op(n)) = n. + * Optimize an "self-inverse unary op", i.e. op(op(n)) = n. * * @todo * -(-a) == a, but might overflow two times. @@ -974,14 +957,7 @@ static ir_node *equivalent_node_idempotent_unop(ir_node *n) DBG_OPT_ALGSIM2(oldn, pred, n, FS_OPT_IDEM_UNARY); } return n; -} /* equivalent_node_idempotent_unop */ - -/** Optimize Not(Not(x)) == x. */ -#define equivalent_node_Not equivalent_node_idempotent_unop - -/** -(-x) == x ??? Is this possible or can --x raise an - out of bounds exception if min =! max? */ -#define equivalent_node_Minus equivalent_node_idempotent_unop +} /** * Optimize a * 1 = 1 * a = a. @@ -1013,7 +989,7 @@ static ir_node *equivalent_node_Mul(ir_node *n) } } return n; -} /* equivalent_node_Mul */ +} /** * Use algebraic simplification a | a = a | 0 = 0 | a = a. @@ -1046,7 +1022,7 @@ static ir_node *equivalent_node_Or(ir_node *n) } return n; -} /* equivalent_node_Or */ +} /** * Optimize a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a. @@ -1077,8 +1053,13 @@ static ir_node *equivalent_node_And(ir_node *n) ir_node *convop = get_Conv_op(a); ir_mode *convopmode = get_irn_mode(convop); if (!mode_is_signed(convopmode)) { - if (tarval_is_all_one(tarval_convert_to(tv, convopmode))) { - /* Conv(X) & all_one(mode(X)) = Conv(X) */ + /* Check Conv(all_one) & Const = all_one */ + ir_tarval *one = get_mode_all_one(convopmode); + ir_tarval *conv = tarval_convert_to(one, mode); + ir_tarval *tand = tarval_and(conv, tv); + + if (tarval_is_all_one(tand)) { + /* Conv(X) & Const = X */ n = a; DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND); return n; @@ -1092,24 +1073,22 @@ static ir_node *equivalent_node_And(ir_node *n) DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND); return n; } - if (is_Or(a)) { - if (b == get_Or_left(a) || b == get_Or_right(a)) { - /* (a|X) & a */ - n = b; - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND); - return n; - } + /* (a|X) & a => a*/ + if ((is_Or(a) || is_Or_Eor_Add(a)) + && (b == get_binop_left(a) || b == get_binop_right(a))) { + n = b; + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND); + return n; } - if (is_Or(b)) { - if (a == get_Or_left(b) || a == get_Or_right(b)) { - /* a & (a|X) */ - n = a; - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND); - return n; - } + /* a & (a|X) => a*/ + if ((is_Or(b) || is_Or_Eor_Add(b)) + && (a == get_binop_left(b) || a == get_binop_right(b))) { + n = a; + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_AND); + return n; } return n; -} /* equivalent_node_And */ +} /** * Try to remove useless Conv's: @@ -1220,7 +1199,7 @@ restart: if (mode_is_int(n_mode) && get_mode_arithmetic(a_mode) == irma_ieee754) { /* ConvI(ConvF(I)) -> I, iff float mantissa >= int mode */ unsigned int_mantissa = get_mode_size_bits(n_mode) - (mode_is_signed(n_mode) ? 1 : 0); - unsigned float_mantissa = tarval_ieee754_get_mantissa_size(a_mode); + unsigned float_mantissa = get_mode_mantissa_size(a_mode); if (float_mantissa >= int_mantissa) { n = b; @@ -1240,7 +1219,7 @@ restart: } } return n; -} /* equivalent_node_Conv */ +} /** * - fold Phi-nodes, iff they have only one predecessor except @@ -1251,7 +1230,6 @@ static ir_node *equivalent_node_Phi(ir_node *n) int i, n_preds; ir_node *oldn = n; - ir_node *block; ir_node *first_val = NULL; /* to shutup gcc */ if (!get_opt_optimize() && @@ -1260,8 +1238,6 @@ static ir_node *equivalent_node_Phi(ir_node *n) n_preds = get_Phi_n_preds(n); - block = get_nodes_block(n); - /* Phi of dead Region without predecessors. */ if (n_preds == 0) return n; @@ -1276,12 +1252,6 @@ static ir_node *equivalent_node_Phi(ir_node *n) } } - if (i >= n_preds) { - ir_graph *irg = get_irn_irg(n); - /* A totally Bad or self-referencing Phi (we didn't break the above loop) */ - return get_irg_bad(irg); - } - /* search for rest of inputs, determine if any of these are non-self-referencing */ while (++i < n_preds) { @@ -1297,50 +1267,7 @@ static ir_node *equivalent_node_Phi(ir_node *n) DBG_OPT_PHI(oldn, n); } return n; -} /* equivalent_node_Phi */ - -/** - * Several optimizations: - * - fold Sync-nodes, iff they have only one predecessor except - * themselves. - */ -static ir_node *equivalent_node_Sync(ir_node *n) -{ - int arity = get_Sync_n_preds(n); - int i; - - for (i = 0; i < arity;) { - ir_node *pred = get_Sync_pred(n, i); - int j; - - /* Remove Bad predecessors */ - if (is_Bad(pred)) { - del_Sync_n(n, i); - --arity; - continue; - } - - /* Remove duplicate predecessors */ - for (j = 0;; ++j) { - if (j >= i) { - ++i; - break; - } - if (get_Sync_pred(n, j) == pred) { - del_Sync_n(n, i); - --arity; - break; - } - } - } - - if (arity == 0) { - ir_graph *irg = get_irn_irg(n); - return get_irg_bad(irg); - } - if (arity == 1) return get_Sync_pred(n, 0); - return n; -} /* equivalent_node_Sync */ +} /** * Optimize Proj(Tuple). @@ -1355,7 +1282,7 @@ static ir_node *equivalent_node_Proj_Tuple(ir_node *proj) DBG_OPT_TUPLE(oldn, tuple, proj); return proj; -} /* equivalent_node_Proj_Tuple */ +} /** * Optimize a / 1 = a. @@ -1387,7 +1314,7 @@ static ir_node *equivalent_node_Proj_Div(ir_node *proj) } } return proj; -} /* equivalent_node_Proj_Div */ +} /** * Optimize CopyB(mem, x, x) into a Nop. @@ -1406,17 +1333,10 @@ static ir_node *equivalent_node_Proj_CopyB(ir_node *proj) proj = get_CopyB_mem(copyb); DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP); break; - - case pn_CopyB_X_except: { - ir_graph *irg = get_irn_irg(proj); - DBG_OPT_EXC_REM(proj); - proj = get_irg_bad(irg); - break; - } } } return proj; -} /* equivalent_node_Proj_CopyB */ +} /** * Optimize Bounds(idx, idx, upper) into idx. @@ -1456,12 +1376,6 @@ static ir_node *equivalent_node_Proj_Bound(ir_node *proj) DBG_OPT_EXC_REM(proj); proj = get_Bound_mem(bound); break; - case pn_Bound_X_except: { - ir_graph *irg = get_irn_irg(proj); - DBG_OPT_EXC_REM(proj); - proj = get_irg_bad(irg); - break; - } case pn_Bound_res: proj = idx; DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP); @@ -1472,57 +1386,7 @@ static ir_node *equivalent_node_Proj_Bound(ir_node *proj) } } return proj; -} /* equivalent_node_Proj_Bound */ - -/** - * Optimize an Exception Proj(Load) with a non-null address. - */ -static ir_node *equivalent_node_Proj_Load(ir_node *proj) -{ - if (get_opt_ldst_only_null_ptr_exceptions()) { - if (get_irn_mode(proj) == mode_X) { - ir_node *load = get_Proj_pred(proj); - - /* get the Load address */ - const ir_node *addr = get_Load_ptr(load); - const ir_node *confirm; - - if (value_not_null(addr, &confirm)) { - if (get_Proj_proj(proj) == pn_Load_X_except) { - ir_graph *irg = get_irn_irg(proj); - DBG_OPT_EXC_REM(proj); - return get_irg_bad(irg); - } - } - } - } - return proj; -} /* equivalent_node_Proj_Load */ - -/** - * Optimize an Exception Proj(Store) with a non-null address. - */ -static ir_node *equivalent_node_Proj_Store(ir_node *proj) -{ - if (get_opt_ldst_only_null_ptr_exceptions()) { - if (get_irn_mode(proj) == mode_X) { - ir_node *store = get_Proj_pred(proj); - - /* get the load/store address */ - const ir_node *addr = get_Store_ptr(store); - const ir_node *confirm; - - if (value_not_null(addr, &confirm)) { - if (get_Proj_proj(proj) == pn_Store_X_except) { - ir_graph *irg = get_irn_irg(proj); - DBG_OPT_EXC_REM(proj); - return get_irg_bad(irg); - } - } - } - } - return proj; -} /* equivalent_node_Proj_Store */ +} /** * Does all optimizations on nodes that must be done on its Projs @@ -1534,7 +1398,7 @@ static ir_node *equivalent_node_Proj(ir_node *proj) if (n->op->ops.equivalent_node_Proj) return n->op->ops.equivalent_node_Proj(proj); return proj; -} /* equivalent_node_Proj */ +} /** * Remove Id's. @@ -1549,7 +1413,7 @@ static ir_node *equivalent_node_Id(ir_node *n) DBG_OPT_ID(oldn, n); return n; -} /* equivalent_node_Id */ +} /** * Optimize a Mux. @@ -1560,6 +1424,12 @@ static ir_node *equivalent_node_Mux(ir_node *n) ir_node *n_t, *n_f; ir_tarval *ts = value_of(sel); + if (ts == tarval_bad && is_Cmp(sel)) { + /* try again with a direct call to compute_cmp, as we don't care + * about the MODEB_LOWERED flag here */ + ts = compute_cmp_ext(sel); + } + /* Mux(true, f, t) == t */ if (ts == tarval_b_true) { n = get_Mux_true(n); @@ -1686,68 +1556,11 @@ ir_node *equivalent_node(ir_node *n) if (n->op->ops.equivalent_node) return n->op->ops.equivalent_node(n); return n; -} /* equivalent_node */ +} /** - * Sets the default equivalent node operation for an ir_op_ops. - * - * @param code the opcode for the default operation - * @param ops the operations initialized - * - * @return - * The operations. - */ -static ir_op_ops *firm_set_default_equivalent_node(ir_opcode code, ir_op_ops *ops) -{ -#define CASE(a) \ - case iro_##a: \ - ops->equivalent_node = equivalent_node_##a; \ - break -#define CASE_PROJ(a) \ - case iro_##a: \ - ops->equivalent_node_Proj = equivalent_node_Proj_##a; \ - break - - switch (code) { - CASE(Block); - CASE(Eor); - CASE(Add); - CASE(Shl); - CASE(Shr); - CASE(Shrs); - CASE(Rotl); - CASE(Sub); - CASE(Not); - CASE(Minus); - CASE(Mul); - CASE(Or); - CASE(And); - CASE(Conv); - CASE(Phi); - CASE(Sync); - CASE_PROJ(Tuple); - CASE_PROJ(Div); - CASE_PROJ(CopyB); - CASE_PROJ(Bound); - CASE_PROJ(Load); - CASE_PROJ(Store); - CASE(Proj); - CASE(Id); - CASE(Mux); - CASE(Confirm); - default: - /* leave NULL */ - break; - } - - return ops; -#undef CASE -#undef CASE_PROJ -} /* firm_set_default_equivalent_node */ - -/** - * Returns non-zero if a node is a Phi node - * with all predecessors constant. + * Returns non-zero if a node is a Phi node + * with all predecessors constant. */ static int is_const_Phi(ir_node *n) { @@ -1760,7 +1573,7 @@ static int is_const_Phi(ir_node *n) return 0; } return 1; -} /* is_const_Phi */ +} typedef ir_tarval *(*tarval_sub_type)(ir_tarval *a, ir_tarval *b, ir_mode *mode); typedef ir_tarval *(*tarval_binop_type)(ir_tarval *a, ir_tarval *b); @@ -1838,7 +1651,7 @@ static ir_node *apply_binop_on_phi(ir_node *phi, ir_tarval *other, eval_func eva res[i] = new_r_Const(irg, (ir_tarval*)res[i]); } return new_r_Phi(get_nodes_block(phi), n, (ir_node **)res, mode); -} /* apply_binop_on_phi */ +} /** * Apply an evaluator on a binop with two constant Phi. @@ -1883,7 +1696,7 @@ static ir_node *apply_binop_on_2_phis(ir_node *a, ir_node *b, eval_func eval, ir res[i] = new_r_Const(irg, (ir_tarval*)res[i]); } return new_r_Phi(get_nodes_block(a), n, (ir_node **)res, mode); -} /* apply_binop_on_2_phis */ +} /** * Apply an evaluator on a unop with a constant operator (a Phi). @@ -1921,7 +1734,7 @@ static ir_node *apply_unop_on_phi(ir_node *phi, ir_tarval *(*eval)(ir_tarval *)) res[i] = new_r_Const(irg, (ir_tarval*)res[i]); } return new_r_Phi(get_nodes_block(phi), n, (ir_node **)res, mode); -} /* apply_unop_on_phi */ +} /** * Apply a conversion on a constant operator (a Phi). @@ -1956,7 +1769,7 @@ static ir_node *apply_conv_on_phi(ir_node *phi, ir_mode *mode) res[i] = new_r_Const(irg, (ir_tarval*)res[i]); } return new_r_Phi(get_nodes_block(phi), n, (ir_node **)res, mode); -} /* apply_conv_on_phi */ +} /** * Transform AddP(P, ConvIs(Iu)), AddP(P, ConvIu(Is)) and @@ -2033,7 +1846,7 @@ static ir_node *transform_node_AddSub(ir_node *n) } return n; -} /* transform_node_AddSub */ +} #define HANDLE_BINOP_PHI(eval, a, b, c, mode) \ do { \ @@ -2070,2911 +1883,3381 @@ static ir_node *transform_node_AddSub(ir_node *n) } while(0) /** - * Do the AddSub optimization, then Transform - * Constant folding on Phi - * Add(a,a) -> Mul(a, 2) - * Add(Mul(a, x), a) -> Mul(a, x+1) - * if the mode is integer or float. - * Transform Add(a,-b) into Sub(a,b). - * Reassociation might fold this further. + * Create a 0 constant of given mode. */ -static ir_node *transform_node_Add(ir_node *n) +static ir_node *create_zero_const(ir_graph *irg, ir_mode *mode) { - ir_mode *mode; - ir_node *a, *b, *c, *oldn = n; - vrp_attr *a_vrp, *b_vrp; - - n = transform_node_AddSub(n); - - a = get_Add_left(n); - b = get_Add_right(n); - - mode = get_irn_mode(n); - - if (mode_is_reference(mode)) { - ir_mode *lmode = get_irn_mode(a); - - if (is_Const(b) && is_Const_null(b) && mode_is_int(lmode)) { - /* an Add(a, NULL) is a hidden Conv */ - dbg_info *dbg = get_irn_dbg_info(n); - return new_rd_Conv(dbg, get_nodes_block(n), a, mode); - } - } - - HANDLE_BINOP_PHI((eval_func) tarval_add, a, b, c, mode); + ir_tarval *tv = get_mode_null(mode); + ir_node *cnst = new_r_Const(irg, tv); - /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */ - if (mode_is_float(mode)) { - ir_graph *irg = get_irn_irg(n); - if (get_irg_fp_model(irg) & fp_strict_algebraic) - return n; - } + return cnst; +} - if (mode_is_num(mode)) { - ir_graph *irg = get_irn_irg(n); - /* the following code leads to endless recursion when Mul are replaced by a simple instruction chain */ - if (!is_irg_state(irg, IR_GRAPH_STATE_ARCH_DEP) - && a == b && mode_is_int(mode)) { - ir_node *block = get_nodes_block(n); +static bool is_shiftop(const ir_node *n) +{ + return is_Shl(n) || is_Shr(n) || is_Shrs(n) || is_Rotl(n); +} - n = new_rd_Mul( - get_irn_dbg_info(n), - block, - a, - new_r_Const_long(irg, mode, 2), - mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_A); - return n; - } - if (is_Minus(a)) { - n = new_rd_Sub( - get_irn_dbg_info(n), - get_nodes_block(n), - b, - get_Minus_op(a), - mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B); - return n; - } - if (is_Minus(b)) { - n = new_rd_Sub( - get_irn_dbg_info(n), - get_nodes_block(n), - a, - get_Minus_op(b), - mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B); - return n; - } - if (get_mode_arithmetic(mode) == irma_twos_complement) { - /* Here we rely on constants be on the RIGHT side */ - if (is_Not(a)) { - ir_node *op = get_Not_op(a); +/* the order of the values is important! */ +typedef enum const_class { + const_const = 0, + const_like = 1, + const_other = 2 +} const_class; - if (is_Const(b) && is_Const_one(b)) { - /* ~x + 1 = -x */ - ir_node *blk = get_nodes_block(n); - n = new_rd_Minus(get_irn_dbg_info(n), blk, op, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_PLUS_1); - return n; - } - if (op == b) { - /* ~x + x = -1 */ - n = new_r_Const(irg, get_mode_minus_one(mode)); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X); - return n; - } - } - if (is_Not(b)) { - ir_node *op = get_Not_op(b); +static const_class classify_const(const ir_node* n) +{ + if (is_Const(n)) return const_const; + if (is_irn_constlike(n)) return const_like; + return const_other; +} - if (op == a) { - /* x + ~x = -1 */ - n = new_r_Const(irg, get_mode_minus_one(mode)); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_X_NOT_X); - return n; - } - } - } - } +/** + * Determines whether r is more constlike or has a larger index (in that order) + * than l. + */ +static bool operands_are_normalized(const ir_node *l, const ir_node *r) +{ + const const_class l_order = classify_const(l); + const const_class r_order = classify_const(r); + return + l_order > r_order || + (l_order == r_order && get_irn_idx(l) <= get_irn_idx(r)); +} - a_vrp = vrp_get_info(a); - b_vrp = vrp_get_info(b); +static bool is_cmp_unequal(const ir_node *node) +{ + ir_relation relation = get_Cmp_relation(node); + ir_node *left = get_Cmp_left(node); + ir_node *right = get_Cmp_right(node); + ir_mode *mode = get_irn_mode(left); - if (a_vrp && b_vrp) { - ir_tarval *c = tarval_and(a_vrp->bits_not_set, b_vrp->bits_not_set); + if (relation == ir_relation_less_greater) + return true; - if (tarval_is_null(c)) { - dbg_info *dbgi = get_irn_dbg_info(n); - return new_rd_Or(dbgi, get_nodes_block(n), a, b, mode); - } - } - return n; -} /* transform_node_Add */ + if (!mode_is_signed(mode) && is_Const(right) && is_Const_null(right)) + return relation == ir_relation_greater; + return false; +} /** - * returns -cnst or NULL if impossible + * returns true for Cmp(x == 0) or Cmp(x != 0) */ -static ir_node *const_negate(ir_node *cnst) +static bool is_cmp_equality_zero(const ir_node *node) { - ir_tarval *tv = tarval_neg(get_Const_tarval(cnst)); - dbg_info *dbgi = get_irn_dbg_info(cnst); - ir_graph *irg = get_irn_irg(cnst); - if (tv == tarval_bad) return NULL; - return new_rd_Const(dbgi, irg, tv); + ir_relation relation; + ir_node *right = get_Cmp_right(node); + + if (!is_Const(right) || !is_Const_null(right)) + return false; + relation = get_Cmp_relation(node); + return relation == ir_relation_equal + || relation == ir_relation_less_greater + || (!mode_is_signed(get_irn_mode(right)) + && relation == ir_relation_greater); } /** - * Do the AddSub optimization, then Transform - * Constant folding on Phi - * Sub(0,a) -> Minus(a) - * Sub(Mul(a, x), a) -> Mul(a, x-1) - * Sub(Sub(x, y), b) -> Sub(x, Add(y,b)) - * Sub(Add(a, x), x) -> a - * Sub(x, Add(x, a)) -> -a - * Sub(x, Const) -> Add(x, -Const) + * Optimize a Or(And(Or(And(v,c4),c3),c2),c1) pattern if possible. + * Such pattern may arise in bitfield stores. + * + * value c4 value c4 & c2 + * AND c3 AND c1 | c3 + * OR c2 ===> OR + * AND c1 + * OR + * + * + * value c2 value c1 + * AND c1 ===> OR if (c1 | c2) == 0x111..11 + * OR */ -static ir_node *transform_node_Sub(ir_node *n) +static ir_node *transform_node_Or_bf_store(ir_node *irn_or) { - ir_mode *mode; - ir_node *oldn = n; - ir_node *a, *b, *c; + ir_node *irn_and, *c1; + ir_node *or_l, *c2; + ir_node *and_l, *c3; + ir_node *value, *c4; + ir_node *new_and, *new_const, *block; + ir_mode *mode = get_irn_mode(irn_or); - n = transform_node_AddSub(n); + ir_tarval *tv1, *tv2, *tv3, *tv4, *tv; - a = get_Sub_left(n); - b = get_Sub_right(n); + for (;;) { + ir_graph *irg; + irn_and = get_binop_left(irn_or); + c1 = get_binop_right(irn_or); + if (!is_Const(c1) || !is_And(irn_and)) + return irn_or; - mode = get_irn_mode(n); + or_l = get_binop_left(irn_and); + c2 = get_binop_right(irn_and); + if (!is_Const(c2)) + return irn_or; - if (mode_is_int(mode)) { - ir_mode *lmode = get_irn_mode(a); + tv1 = get_Const_tarval(c1); + tv2 = get_Const_tarval(c2); - if (is_Const(b) && is_Const_null(b) && mode_is_reference(lmode)) { - /* a Sub(a, NULL) is a hidden Conv */ - dbg_info *dbg = get_irn_dbg_info(n); - n = new_rd_Conv(dbg, get_nodes_block(n), a, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_CONV); - return n; - } + tv = tarval_or(tv1, tv2); + if (tarval_is_all_one(tv)) { + /* the AND does NOT clear a bit with isn't set by the OR */ + set_binop_left(irn_or, or_l); + set_binop_right(irn_or, c1); - if (mode == lmode && - get_mode_arithmetic(mode) == irma_twos_complement && - is_Const(a) && - get_Const_tarval(a) == get_mode_minus_one(mode)) { - /* -1 - x -> ~x */ - dbg_info *dbg = get_irn_dbg_info(n); - n = new_rd_Not(dbg, get_nodes_block(n), b, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_NOT); - return n; + /* check for more */ + continue; } - } -restart: - HANDLE_BINOP_PHI((eval_func) tarval_sub, a, b, c, mode); + if (!is_Or(or_l) && !is_Or_Eor_Add(or_l)) + return irn_or; - /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */ - if (mode_is_float(mode)) { - ir_graph *irg = get_irn_irg(n); - if (get_irg_fp_model(irg) & fp_strict_algebraic) - return n; - } + and_l = get_binop_left(or_l); + c3 = get_binop_right(or_l); + if (!is_Const(c3) || !is_And(and_l)) + return irn_or; - if (is_Const(b) && !mode_is_reference(get_irn_mode(b))) { - /* a - C -> a + (-C) */ - ir_node *cnst = const_negate(b); - if (cnst != NULL) { - ir_node *block = get_nodes_block(n); - dbg_info *dbgi = get_irn_dbg_info(n); + value = get_binop_left(and_l); + c4 = get_binop_right(and_l); + if (!is_Const(c4)) + return irn_or; - n = new_rd_Add(dbgi, block, a, cnst, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); - return n; - } - } + /* ok, found the pattern, check for conditions */ + assert(mode == get_irn_mode(irn_and)); + assert(mode == get_irn_mode(or_l)); + assert(mode == get_irn_mode(and_l)); - if (is_Minus(a)) { /* (-a) - b -> -(a + b) */ - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_node *left = get_Minus_op(a); - ir_node *add = new_rd_Add(dbg, block, left, b, mode); - - n = new_rd_Minus(dbg, block, add, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); - return n; - } else if (is_Minus(b)) { /* a - (-b) -> a + b */ - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_node *right = get_Minus_op(b); - - n = new_rd_Add(dbg, block, a, right, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MINUS); - return n; - } else if (is_Sub(b)) { - /* a - (b - c) -> a + (c - b) - * -> (a - b) + c iff (b - c) is a pointer */ - dbg_info *s_dbg = get_irn_dbg_info(b); - ir_node *s_left = get_Sub_left(b); - ir_node *s_right = get_Sub_right(b); - ir_mode *s_mode = get_irn_mode(b); - if (mode_is_reference(s_mode)) { - ir_node *lowest_block = get_nodes_block(n); /* a and b are live here */ - ir_node *sub = new_rd_Sub(s_dbg, lowest_block, a, s_left, mode); - dbg_info *a_dbg = get_irn_dbg_info(n); + tv3 = get_Const_tarval(c3); + tv4 = get_Const_tarval(c4); - if (s_mode != mode) - s_right = new_r_Conv(lowest_block, s_right, mode); - n = new_rd_Add(a_dbg, lowest_block, sub, s_right, mode); - } else { - ir_node *s_block = get_nodes_block(b); - ir_node *sub = new_rd_Sub(s_dbg, s_block, s_right, s_left, s_mode); - dbg_info *a_dbg = get_irn_dbg_info(n); - ir_node *a_block = get_nodes_block(n); + tv = tarval_or(tv4, tv2); + if (!tarval_is_all_one(tv)) { + /* have at least one 0 at the same bit position */ + return irn_or; + } - n = new_rd_Add(a_dbg, a_block, a, sub, mode); + if (tv3 != tarval_andnot(tv3, tv4)) { + /* bit in the or_mask is outside the and_mask */ + return irn_or; } - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); - return n; - } else if (is_Mul(b)) { /* a - (b * C) -> a + (b * -C) */ - ir_node *m_right = get_Mul_right(b); - if (is_Const(m_right)) { - ir_node *cnst2 = const_negate(m_right); - if (cnst2 != NULL) { - dbg_info *m_dbg = get_irn_dbg_info(b); - ir_node *m_block = get_nodes_block(b); - ir_node *m_left = get_Mul_left(b); - ir_mode *m_mode = get_irn_mode(b); - ir_node *mul = new_rd_Mul(m_dbg, m_block, m_left, cnst2, m_mode); - dbg_info *a_dbg = get_irn_dbg_info(n); - ir_node *a_block = get_nodes_block(n); - n = new_rd_Add(a_dbg, a_block, a, mul, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); - return n; - } + if (tv1 != tarval_andnot(tv1, tv2)) { + /* bit in the or_mask is outside the and_mask */ + return irn_or; } - } - /* Beware of Sub(P, P) which cannot be optimized into a simple Minus ... */ - if (mode_is_num(mode) && mode == get_irn_mode(a) && is_Const(a) && is_Const_null(a)) { - n = new_rd_Minus( - get_irn_dbg_info(n), - get_nodes_block(n), - b, - mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_0_A); - return n; - } - if (is_Add(a)) { - if (mode_wrap_around(mode)) { - ir_node *left = get_Add_left(a); - ir_node *right = get_Add_right(a); + /* ok, all conditions met */ + block = get_nodes_block(irn_or); + irg = get_irn_irg(block); - /* FIXME: Does the Conv's work only for two complement or generally? */ - if (left == b) { - if (mode != get_irn_mode(right)) { - /* This Sub is an effective Cast */ - right = new_r_Conv(get_nodes_block(n), right, mode); - } - n = right; - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); - return n; - } else if (right == b) { - if (mode != get_irn_mode(left)) { - /* This Sub is an effective Cast */ - left = new_r_Conv(get_nodes_block(n), left, mode); - } - n = left; - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); - return n; - } - } - } - if (is_Add(b)) { - if (mode_wrap_around(mode)) { - ir_node *left = get_Add_left(b); - ir_node *right = get_Add_right(b); + new_and = new_r_And(block, value, new_r_Const(irg, tarval_and(tv4, tv2)), mode); - /* FIXME: Does the Conv's work only for two complement or generally? */ - if (left == a) { - ir_mode *r_mode = get_irn_mode(right); + new_const = new_r_Const(irg, tarval_or(tv3, tv1)); - n = new_r_Minus(get_nodes_block(n), right, r_mode); - if (mode != r_mode) { - /* This Sub is an effective Cast */ - n = new_r_Conv(get_nodes_block(n), n, mode); - } - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); - return n; - } else if (right == a) { - ir_mode *l_mode = get_irn_mode(left); + set_binop_left(irn_or, new_and); + set_binop_right(irn_or, new_const); - n = new_r_Minus(get_nodes_block(n), left, l_mode); - if (mode != l_mode) { - /* This Sub is an effective Cast */ - n = new_r_Conv(get_nodes_block(n), n, mode); - } - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); - return n; - } - } + /* check for more */ } - if (mode_is_int(mode) && is_Conv(a) && is_Conv(b)) { - ir_mode *mode = get_irn_mode(a); +} - if (mode == get_irn_mode(b)) { - ir_mode *ma, *mb; - ir_node *op_a = get_Conv_op(a); - ir_node *op_b = get_Conv_op(b); +/** + * Optimize an Or(shl(x, c), shr(x, bits - c)) into a Rotl + */ +static ir_node *transform_node_Or_Rotl(ir_node *irn_or) +{ + ir_mode *mode = get_irn_mode(irn_or); + ir_node *shl, *shr, *block; + ir_node *irn, *x, *c1, *c2, *n; + ir_tarval *tv1, *tv2; - /* check if it's allowed to skip the conv */ - ma = get_irn_mode(op_a); - mb = get_irn_mode(op_b); + /* some backends can't handle rotl */ + if (!be_get_backend_param()->support_rotl) + return irn_or; - if (mode_is_reference(ma) && mode_is_reference(mb)) { - /* SubInt(ConvInt(aP), ConvInt(bP)) -> SubInt(aP,bP) */ - a = op_a; b = op_b; - set_Sub_left(n, a); - set_Sub_right(n, b); + if (! mode_is_int(mode)) + return irn_or; - goto restart; - } - } - } - /* do NOT execute this code if reassociation is enabled, it does the inverse! */ - if (!is_reassoc_running() && is_Mul(a)) { - ir_node *ma = get_Mul_left(a); - ir_node *mb = get_Mul_right(a); + shl = get_binop_left(irn_or); + shr = get_binop_right(irn_or); - if (ma == b) { - ir_node *blk = get_nodes_block(n); - ir_graph *irg = get_irn_irg(n); - n = new_rd_Mul( - get_irn_dbg_info(n), - blk, - ma, - new_rd_Sub( - get_irn_dbg_info(n), - blk, - mb, - new_r_Const(irg, get_mode_one(mode)), - mode), - mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A); - return n; - } else if (mb == b) { - ir_node *blk = get_nodes_block(n); - ir_graph *irg = get_irn_irg(n); - n = new_rd_Mul( - get_irn_dbg_info(n), - blk, - mb, - new_rd_Sub( - get_irn_dbg_info(n), - blk, - ma, - new_r_Const(irg, get_mode_one(mode)), - mode), - mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A); - return n; - } + if (is_Shr(shl)) { + if (!is_Shl(shr)) + return irn_or; + + irn = shl; + shl = shr; + shr = irn; + } else if (!is_Shl(shl)) { + return irn_or; + } else if (!is_Shr(shr)) { + return irn_or; } - if (is_Sub(a)) { /* (x - y) - b -> x - (y + b) */ - ir_node *x = get_Sub_left(a); - ir_node *y = get_Sub_right(a); - ir_node *blk = get_nodes_block(n); - ir_mode *m_b = get_irn_mode(b); - ir_mode *m_y = get_irn_mode(y); - ir_mode *add_mode; - ir_node *add; + x = get_Shl_left(shl); + if (x != get_Shr_left(shr)) + return irn_or; - /* Determine the right mode for the Add. */ - if (m_b == m_y) - add_mode = m_b; - else if (mode_is_reference(m_b)) - add_mode = m_b; - else if (mode_is_reference(m_y)) - add_mode = m_y; - else { - /* - * Both modes are different but none is reference, - * happens for instance in SubP(SubP(P, Iu), Is). - * We have two possibilities here: Cast or ignore. - * Currently we ignore this case. - */ - return n; - } + c1 = get_Shl_right(shl); + c2 = get_Shr_right(shr); + if (is_Const(c1) && is_Const(c2)) { + tv1 = get_Const_tarval(c1); + if (! tarval_is_long(tv1)) + return irn_or; - add = new_r_Add(blk, y, b, add_mode); + tv2 = get_Const_tarval(c2); + if (! tarval_is_long(tv2)) + return irn_or; - n = new_rd_Sub(get_irn_dbg_info(n), blk, x, add, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_SUB_X_Y_Z); + if (get_tarval_long(tv1) + get_tarval_long(tv2) + != (int) get_mode_size_bits(mode)) + return irn_or; + + /* yet, condition met */ + block = get_nodes_block(irn_or); + + n = new_r_Rotl(block, x, c1, mode); + + DBG_OPT_ALGSIM1(irn_or, shl, shr, n, FS_OPT_OR_SHFT_TO_ROTL); return n; } - if (get_mode_arithmetic(mode) == irma_twos_complement) { - if (is_Const(a) && is_Not(b)) { - /* c - ~X = X + (c+1) */ - ir_tarval *tv = get_Const_tarval(a); - - tv = tarval_add(tv, get_mode_one(mode)); - if (tv != tarval_bad) { - ir_node *blk = get_nodes_block(n); - ir_graph *irg = get_irn_irg(n); - ir_node *c = new_r_Const(irg, tv); - n = new_rd_Add(get_irn_dbg_info(n), blk, get_Not_op(b), c, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_C_NOT_X); - return n; - } - } + /* Note: the obvious rot formulation (a << x) | (a >> (32-x)) gets + * transformed to (a << x) | (a >> -x) by transform_node_shift_modulo() */ + if (!ir_is_negated_value(c1, c2)) { + return irn_or; } + + /* yet, condition met */ + block = get_nodes_block(irn_or); + n = new_r_Rotl(block, x, c1, mode); + DBG_OPT_ALGSIM0(irn_or, n, FS_OPT_OR_SHFT_TO_ROTL); return n; -} /* transform_node_Sub */ +} /** - * Several transformation done on n*n=2n bits mul. - * These transformations must be done here because new nodes may be produced. + * Prototype of a recursive transform function + * for bitwise distributive transformations. */ -static ir_node *transform_node_Mul2n(ir_node *n, ir_mode *mode) +typedef ir_node* (*recursive_transform)(ir_node *n); + +/** + * makes use of distributive laws for and, or, eor + * and(a OP c, b OP c) -> and(a, b) OP c + * note, might return a different op than n + */ +static ir_node *transform_bitwise_distributive(ir_node *n, + recursive_transform trans_func) { - ir_node *oldn = n; - ir_node *a = get_Mul_left(n); - ir_node *b = get_Mul_right(n); - ir_tarval *ta = value_of(a); - ir_tarval *tb = value_of(b); - ir_mode *smode = get_irn_mode(a); + ir_node *oldn = n; + ir_node *a = get_binop_left(n); + ir_node *b = get_binop_right(n); + ir_op *op = get_irn_op(a); + ir_op *op_root = get_irn_op(n); - if (ta == get_mode_one(smode)) { - /* (L)1 * (L)b = (L)b */ - ir_node *blk = get_nodes_block(n); - n = new_rd_Conv(get_irn_dbg_info(n), blk, b, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1); - return n; - } - else if (ta == get_mode_minus_one(smode)) { - /* (L)-1 * (L)b = (L)b */ - ir_node *blk = get_nodes_block(n); - n = new_rd_Minus(get_irn_dbg_info(n), blk, b, smode); - n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); + if (op != get_irn_op(b)) return n; + + /* and(conv(a), conv(b)) -> conv(and(a,b)) */ + if (op == op_Conv) { + ir_node *a_op = get_Conv_op(a); + ir_node *b_op = get_Conv_op(b); + ir_mode *a_mode = get_irn_mode(a_op); + ir_mode *b_mode = get_irn_mode(b_op); + if (a_mode == b_mode && (mode_is_int(a_mode) || a_mode == mode_b)) { + ir_node *blk = get_nodes_block(n); + + n = exact_copy(n); + set_binop_left(n, a_op); + set_binop_right(n, b_op); + set_irn_mode(n, a_mode); + n = trans_func(n); + n = new_r_Conv(blk, n, get_irn_mode(oldn)); + + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV); + return n; + } } - if (tb == get_mode_one(smode)) { - /* (L)a * (L)1 = (L)a */ - ir_node *blk = get_irn_n(a, -1); - n = new_rd_Conv(get_irn_dbg_info(n), blk, a, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1); + + if (op == op_Eor) { + /* nothing to gain here */ return n; } - else if (tb == get_mode_minus_one(smode)) { - /* (L)a * (L)-1 = (L)-a */ - ir_node *blk = get_nodes_block(n); - n = new_rd_Minus(get_irn_dbg_info(n), blk, a, smode); - n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); - return n; + + if (op == op_Shrs || op == op_Shr || op == op_Shl + || op == op_And || op == op_Or || op == op_Eor) { + ir_node *a_left = get_binop_left(a); + ir_node *a_right = get_binop_right(a); + ir_node *b_left = get_binop_left(b); + ir_node *b_right = get_binop_right(b); + ir_node *c = NULL; + ir_node *op1 = NULL; + ir_node *op2 = NULL; + + if (is_op_commutative(op)) { + if (a_left == b_left) { + c = a_left; + op1 = a_right; + op2 = b_right; + } else if (a_left == b_right) { + c = a_left; + op1 = a_right; + op2 = b_left; + } else if (a_right == b_left) { + c = a_right; + op1 = a_left; + op2 = b_right; + } + } + if (a_right == b_right) { + c = a_right; + op1 = a_left; + op2 = b_left; + } + + if (c != NULL) { + /* (a sop c) & (b sop c) => (a & b) sop c */ + ir_node *blk = get_nodes_block(n); + + ir_node *new_n = exact_copy(n); + set_binop_left(new_n, op1); + set_binop_right(new_n, op2); + new_n = trans_func(new_n); + + if (op_root == op_Eor && op == op_Or) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_mode *mode = get_irn_mode(c); + + c = new_rd_Not(dbgi, blk, c, mode); + n = new_rd_And(dbgi, blk, new_n, c, mode); + } else { + n = exact_copy(a); + set_nodes_block(n, blk); + set_binop_left(n, new_n); + set_binop_right(n, c); + add_identities(n); + } + + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND); + return n; + } } + return n; } /** - * Transform Mul(a,-1) into -a. - * Do constant evaluation of Phi nodes. - * Do architecture dependent optimizations on Mul nodes + * normalisation: (x >> c1) & c2 to (x & (c2<> c1 + * (we can use: + * - and, or, xor instead of & + * - Shl, Shr, Shrs, rotl instead of >> + * (with a special case for Or/Xor + Shrs) + * + * This normalisation is usually good for the backend since << C can often be + * matched as address-mode. */ -static ir_node *transform_node_Mul(ir_node *n) +static ir_node *transform_node_bitop_shift(ir_node *n) { - ir_node *c, *oldn = n; - ir_mode *mode = get_irn_mode(n); - ir_node *a = get_Mul_left(n); - ir_node *b = get_Mul_right(n); + ir_graph *irg = get_irn_irg(n); + ir_node *left = get_binop_left(n); + ir_node *right = get_binop_right(n); + ir_mode *mode = get_irn_mode(n); + ir_node *shift_left; + ir_node *shift_right; + ir_node *block; + dbg_info *dbg_bitop; + dbg_info *dbg_shift; + ir_node *new_bitop; + ir_node *new_shift; + ir_node *new_const; + ir_tarval *tv1; + ir_tarval *tv2; + ir_tarval *tv_bitop; - if (is_Bad(a) || is_Bad(b)) + if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_NORMALISATION2)) return n; - if (mode != get_irn_mode(a)) - return transform_node_Mul2n(n, mode); - - HANDLE_BINOP_PHI((eval_func) tarval_mul, a, b, c, mode); + assert(is_And(n) || is_Or(n) || is_Eor(n) || is_Or_Eor_Add(n)); + if (!is_Const(right) || !is_shiftop(left)) + return n; - if (mode_is_signed(mode)) { - ir_node *r = NULL; + shift_left = get_binop_left(left); + shift_right = get_binop_right(left); + if (!is_Const(shift_right)) + return n; - if (value_of(a) == get_mode_minus_one(mode)) - r = b; - else if (value_of(b) == get_mode_minus_one(mode)) - r = a; - if (r) { - n = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), r, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); - return n; - } + /* doing it with Shrs is not legal if the Or/Eor affects the topmost bit */ + if (is_Shrs(left)) { + /* TODO this could be improved */ + return n; } - if (is_Minus(a)) { - if (is_Const(b)) { /* (-a) * const -> a * -const */ - ir_node *cnst = const_negate(b); - if (cnst != NULL) { - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - n = new_rd_Mul(dbgi, block, get_Minus_op(a), cnst, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); + + irg = get_irn_irg(n); + block = get_nodes_block(n); + dbg_bitop = get_irn_dbg_info(n); + dbg_shift = get_irn_dbg_info(left); + tv1 = get_Const_tarval(shift_right); + tv2 = get_Const_tarval(right); + assert(get_tarval_mode(tv2) == mode); + + if (is_Shl(left)) { + tv_bitop = tarval_shr(tv2, tv1); + + /* Check whether we have lost some bits during the right shift. */ + if (!is_And(n)) { + ir_tarval *tv_back_again = tarval_shl(tv_bitop, tv1); + + if (tarval_cmp(tv_back_again, tv2) != ir_relation_equal) return n; - } - } else if (is_Minus(b)) { /* (-a) * (-b) -> a * b */ - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - n = new_rd_Mul(dbgi, block, get_Minus_op(a), get_Minus_op(b), mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_MINUS); - return n; - } else if (is_Sub(b)) { /* (-a) * (b - c) -> a * (c - b) */ - ir_node *sub_l = get_Sub_left(b); - ir_node *sub_r = get_Sub_right(b); - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_node *new_b = new_rd_Sub(dbgi, block, sub_r, sub_l, mode); - n = new_rd_Mul(dbgi, block, get_Minus_op(a), new_b, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS); - return n; - } - } else if (is_Minus(b)) { - if (is_Sub(a)) { /* (a - b) * (-c) -> (b - a) * c */ - ir_node *sub_l = get_Sub_left(a); - ir_node *sub_r = get_Sub_right(a); - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_node *new_a = new_rd_Sub(dbgi, block, sub_r, sub_l, mode); - n = new_rd_Mul(dbgi, block, new_a, get_Minus_op(b), mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS); - return n; } - } else if (is_Shl(a)) { - ir_node *const shl_l = get_Shl_left(a); - if (is_Const(shl_l) && is_Const_one(shl_l)) { - /* (1 << x) * b -> b << x */ - dbg_info *const dbgi = get_irn_dbg_info(n); - ir_node *const block = get_nodes_block(n); - ir_node *const shl_r = get_Shl_right(a); - n = new_rd_Shl(dbgi, block, b, shl_r, mode); - // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT); - return n; - } - } else if (is_Shl(b)) { - ir_node *const shl_l = get_Shl_left(b); - if (is_Const(shl_l) && is_Const_one(shl_l)) { - /* a * (1 << x) -> a << x */ - dbg_info *const dbgi = get_irn_dbg_info(n); - ir_node *const block = get_nodes_block(n); - ir_node *const shl_r = get_Shl_right(b); - n = new_rd_Shl(dbgi, block, a, shl_r, mode); - // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT); + } else if (is_Shr(left)) { + if (!is_And(n)) { + /* + * TODO this can be improved by checking whether + * the left shift produces an overflow + */ return n; } + tv_bitop = tarval_shl(tv2, tv1); + } else { + assert(is_Rotl(left)); + tv_bitop = tarval_rotl(tv2, tarval_neg(tv1)); } - if (get_mode_arithmetic(mode) == irma_ieee754) { - if (is_Const(a)) { - ir_tarval *tv = get_Const_tarval(a); - if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv) - && !tarval_is_negative(tv)) { - /* 2.0 * b = b + b */ - n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), b, b, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A); - return n; - } - } - else if (is_Const(b)) { - ir_tarval *tv = get_Const_tarval(b); - if (tarval_ieee754_get_exponent(tv) == 1 && tarval_ieee754_zero_mantissa(tv) - && !tarval_is_negative(tv)) { - /* a * 2.0 = a + a */ - n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), a, a, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A); - return n; - } - } + new_const = new_r_Const(irg, tv_bitop); + + if (is_And(n)) { + new_bitop = new_rd_And(dbg_bitop, block, shift_left, new_const, mode); + } else if (is_Or(n) || is_Or_Eor_Add(n)) { + new_bitop = new_rd_Or(dbg_bitop, block, shift_left, new_const, mode); + } else { + assert(is_Eor(n)); + new_bitop = new_rd_Eor(dbg_bitop, block, shift_left, new_const, mode); } - return arch_dep_replace_mul_with_shifts(n); -} /* transform_node_Mul */ -/** - * Transform a Div Node. - */ -static ir_node *transform_node_Div(ir_node *n) -{ - ir_mode *mode = get_Div_resmode(n); - ir_node *a = get_Div_left(n); - ir_node *b = get_Div_right(n); - ir_node *value = n; - const ir_node *dummy; - - if (mode_is_int(mode)) { - if (is_Const(b) && is_const_Phi(a)) { - /* check for Div(Phi, Const) */ - value = apply_binop_on_phi(a, get_Const_tarval(b), (eval_func) tarval_div, mode, 0); - if (value) { - DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); - goto make_tuple; - } - } else if (is_Const(a) && is_const_Phi(b)) { - /* check for Div(Const, Phi) */ - value = apply_binop_on_phi(b, get_Const_tarval(a), (eval_func) tarval_div, mode, 1); - if (value) { - DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); - goto make_tuple; - } - } else if (is_const_Phi(a) && is_const_Phi(b)) { - /* check for Div(Phi, Phi) */ - value = apply_binop_on_2_phis(a, b, (eval_func) tarval_div, mode); - if (value) { - DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); - goto make_tuple; - } - } - - if (a == b && value_not_zero(a, &dummy)) { - ir_graph *irg = get_irn_irg(n); - /* BEWARE: we can optimize a/a to 1 only if this cannot cause a exception */ - value = new_r_Const(irg, get_mode_one(mode)); - DBG_OPT_CSTEVAL(n, value); - goto make_tuple; - } else { - if (mode_is_signed(mode) && is_Const(b)) { - ir_tarval *tv = get_Const_tarval(b); - - if (tv == get_mode_minus_one(mode)) { - /* a / -1 */ - value = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), a, mode); - DBG_OPT_CSTEVAL(n, value); - goto make_tuple; - } - } - /* Try architecture dependent optimization */ - value = arch_dep_replace_div_by_const(n); - } + if (is_Shl(left)) { + new_shift = new_rd_Shl(dbg_shift, block, new_bitop, shift_right, mode); + } else if (is_Shr(left)) { + new_shift = new_rd_Shr(dbg_shift, block, new_bitop, shift_right, mode); } else { - assert(mode_is_float(mode)); - - /* Optimize x/c to x*(1/c) */ - if (get_mode_arithmetic(mode) == irma_ieee754) { - ir_tarval *tv = value_of(b); - - if (tv != tarval_bad) { - int rem = tarval_fp_ops_enabled(); - - /* - * Floating point constant folding might be disabled here to - * prevent rounding. - * However, as we check for exact result, doing it is safe. - * Switch it on. - */ - tarval_enable_fp_ops(1); - tv = tarval_div(get_mode_one(mode), tv); - tarval_enable_fp_ops(rem); - - /* Do the transformation if the result is either exact or we are - not using strict rules. */ - if (tv != tarval_bad && - (tarval_ieee754_get_exact() || (get_irg_fp_model(get_irn_irg(n)) & fp_strict_algebraic) == 0)) { - ir_node *block = get_nodes_block(n); - ir_graph *irg = get_irn_irg(block); - ir_node *c = new_r_Const(irg, tv); - dbg_info *dbgi = get_irn_dbg_info(n); - value = new_rd_Mul(dbgi, block, a, c, mode); - - goto make_tuple; - } - } - } + assert(is_Rotl(left)); + new_shift = new_rd_Rotl(dbg_shift, block, new_bitop, shift_right, mode); } - if (value != n) { - ir_node *mem, *blk; - ir_graph *irg; - -make_tuple: - /* Turn Div into a tuple (mem, jmp, bad, value) */ - mem = get_Div_mem(n); - blk = get_nodes_block(n); - irg = get_irn_irg(blk); + return new_shift; +} - /* skip a potential Pin */ - mem = skip_Pin(mem); - turn_into_tuple(n, pn_Div_max); - set_Tuple_pred(n, pn_Div_M, mem); - set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(blk)); - set_Tuple_pred(n, pn_Div_X_except, get_irg_bad(irg)); - set_Tuple_pred(n, pn_Div_res, value); +static bool complement_values(const ir_node *a, const ir_node *b) +{ + if (is_Not(a) && get_Not_op(a) == b) + return true; + if (is_Not(b) && get_Not_op(b) == a) + return true; + if (is_Const(a) && is_Const(b)) { + ir_tarval *tv_a = get_Const_tarval(a); + ir_tarval *tv_b = get_Const_tarval(b); + return tarval_not(tv_a) == tv_b; } - return n; -} /* transform_node_Div */ + return false; +} + +typedef ir_tarval *(tv_fold_binop_func)(ir_tarval *a, ir_tarval *b); /** - * Transform a Mod node. + * for associative operations fold: + * op(op(x, c0), c1) to op(x, op(c0, c1)) with constants folded. + * This is a "light" version of the reassociation phase */ -static ir_node *transform_node_Mod(ir_node *n) +static ir_node *fold_constant_associativity(ir_node *node, + tv_fold_binop_func fold) { - ir_mode *mode = get_Mod_resmode(n); - ir_node *a = get_Mod_left(n); - ir_node *b = get_Mod_right(n); ir_graph *irg; - ir_node *value; - ir_tarval *tv; + ir_op *op; + ir_node *left; + ir_node *right = get_binop_right(node); + ir_node *left_right; + ir_node *left_left; + ir_tarval *c0; + ir_tarval *c1; + ir_tarval *new_c; + ir_node *new_const; + ir_node *new_node; + if (!is_Const(right)) + return node; + + op = get_irn_op(node); + left = get_binop_left(node); + if (get_irn_op(left) != op) + return node; + + left_right = get_binop_right(left); + if (!is_Const(left_right)) + return node; + + left_left = get_binop_left(left); + c0 = get_Const_tarval(left_right); + c1 = get_Const_tarval(right); + irg = get_irn_irg(node); + if (get_tarval_mode(c0) != get_tarval_mode(c1)) + return node; + new_c = fold(c0, c1); + if (new_c == tarval_bad) + return node; + new_const = new_r_Const(irg, new_c); + new_node = exact_copy(node); + set_binop_left(new_node, left_left); + set_binop_right(new_node, new_const); + return new_node; +} - if (is_Const(b) && is_const_Phi(a)) { - /* check for Div(Phi, Const) */ - value = apply_binop_on_phi(a, get_Const_tarval(b), (eval_func) tarval_mod, mode, 0); - if (value) { - DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); - goto make_tuple; - } - } - else if (is_Const(a) && is_const_Phi(b)) { - /* check for Div(Const, Phi) */ - value = apply_binop_on_phi(b, get_Const_tarval(a), (eval_func) tarval_mod, mode, 1); - if (value) { - DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); - goto make_tuple; - } - } - else if (is_const_Phi(a) && is_const_Phi(b)) { - /* check for Div(Phi, Phi) */ - value = apply_binop_on_2_phis(a, b, (eval_func) tarval_mod, mode); - if (value) { - DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); - goto make_tuple; - } - } +/** + * Transform an Or. + */ +static ir_node *transform_node_Or_(ir_node *n) +{ + ir_node *oldn = n; + ir_node *a = get_binop_left(n); + ir_node *b = get_binop_right(n); + ir_node *c; + ir_mode *mode; - value = n; - tv = value_of(n); - irg = get_irn_irg(n); - if (tv != tarval_bad) { - value = new_r_Const(irg, tv); + n = fold_constant_associativity(n, tarval_or); + if (n != oldn) + return n; - DBG_OPT_CSTEVAL(n, value); - goto make_tuple; - } else { - ir_node *a = get_Mod_left(n); - ir_node *b = get_Mod_right(n); - const ir_node *dummy; + if (is_Not(a) && is_Not(b)) { + /* ~a | ~b = ~(a&b) */ + ir_node *block = get_nodes_block(n); - if (a == b && value_not_zero(a, &dummy)) { - /* BEWARE: we can optimize a%a to 0 only if this cannot cause a exception */ - value = new_r_Const(irg, get_mode_null(mode)); - DBG_OPT_CSTEVAL(n, value); - goto make_tuple; - } else { - if (mode_is_signed(mode) && is_Const(b)) { - ir_tarval *tv = get_Const_tarval(b); + mode = get_irn_mode(n); + a = get_Not_op(a); + b = get_Not_op(b); + n = new_rd_And(get_irn_dbg_info(n), block, a, b, mode); + n = new_rd_Not(get_irn_dbg_info(n), block, n, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN); + return n; + } - if (tv == get_mode_minus_one(mode)) { - /* a % -1 = 0 */ - value = new_r_Const(irg, get_mode_null(mode)); - DBG_OPT_CSTEVAL(n, value); - goto make_tuple; - } + /* we can combine the relations of two compares with the same operands */ + if (is_Cmp(a) && is_Cmp(b)) { + ir_node *a_left = get_Cmp_left(a); + ir_node *a_right = get_Cmp_right(a); + ir_node *b_left = get_Cmp_left(b); + ir_node *b_right = get_Cmp_right(b); + if (a_left == b_left && b_left == b_right) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_relation a_relation = get_Cmp_relation(a); + ir_relation b_relation = get_Cmp_relation(b); + ir_relation new_relation = a_relation | b_relation; + return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation); + } + /* Cmp(a!=b) or Cmp(c!=d) => Cmp((a^b)|(c^d) != 0) */ + if (is_cmp_unequal(a) && is_cmp_unequal(b) + && !mode_is_float(get_irn_mode(a_left)) + && !mode_is_float(get_irn_mode(b_left))) { + if (values_in_mode(get_irn_mode(a_left), get_irn_mode(b_left))) { + ir_graph *irg = get_irn_irg(n); + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_mode *a_mode = get_irn_mode(a_left); + ir_mode *b_mode = get_irn_mode(b_left); + ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode); + ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode); + ir_node *conv = new_rd_Conv(dbgi, block, xora, b_mode); + ir_node *orn = new_rd_Or(dbgi, block, conv, xorb, b_mode); + ir_node *zero = create_zero_const(irg, b_mode); + return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_less_greater); + } + if (values_in_mode(get_irn_mode(b_left), get_irn_mode(a_left))) { + ir_graph *irg = get_irn_irg(n); + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_mode *a_mode = get_irn_mode(a_left); + ir_mode *b_mode = get_irn_mode(b_left); + ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode); + ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode); + ir_node *conv = new_rd_Conv(dbgi, block, xorb, a_mode); + ir_node *orn = new_rd_Or(dbgi, block, xora, conv, a_mode); + ir_node *zero = create_zero_const(irg, a_mode); + return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_less_greater); } - /* Try architecture dependent optimization */ - value = arch_dep_replace_mod_by_const(n); } } - if (value != n) { - ir_node *mem, *blk; - ir_graph *irg; + mode = get_irn_mode(n); + HANDLE_BINOP_PHI((eval_func) tarval_or, a, b, c, mode); -make_tuple: - /* Turn Mod into a tuple (mem, jmp, bad, value) */ - mem = get_Mod_mem(n); - blk = get_nodes_block(n); - irg = get_irn_irg(blk); + n = transform_node_Or_bf_store(n); + if (n != oldn) + return n; + n = transform_node_Or_Rotl(n); + if (n != oldn) + return n; + + n = transform_bitwise_distributive(n, transform_node_Or_); + if (n != oldn) + return n; + n = transform_node_bitop_shift(n); + if (n != oldn) + return n; - /* skip a potential Pin */ - mem = skip_Pin(mem); - turn_into_tuple(n, pn_Mod_max); - set_Tuple_pred(n, pn_Mod_M, mem); - set_Tuple_pred(n, pn_Mod_X_regular, new_r_Jmp(blk)); - set_Tuple_pred(n, pn_Mod_X_except, get_irg_bad(irg)); - set_Tuple_pred(n, pn_Mod_res, value); - } return n; -} /* transform_node_Mod */ +} + +static ir_node *transform_node_Or(ir_node *n) +{ + if (is_Or_Eor_Add(n)) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *left = get_Or_left(n); + ir_node *right = get_Or_right(n); + ir_mode *mode = get_irn_mode(n); + return new_rd_Add(dbgi, block, left, right, mode); + } + return transform_node_Or_(n); +} /** - * Transform a Cond node. - * - * Replace the Cond by a Jmp if it branches on a constant - * condition. + * Transform an Eor. */ -static ir_node *transform_node_Cond(ir_node *n) +static ir_node *transform_node_Eor_(ir_node *n) { + ir_node *oldn = n; + ir_node *a = get_binop_left(n); + ir_node *b = get_binop_right(n); + ir_mode *mode = get_irn_mode(n); + ir_node *c; - ir_node *a = get_Cond_selector(n); - ir_tarval *ta = value_of(a); - ir_graph *irg = get_irn_irg(n); - ir_node *jmp; - - /* we need block info which is not available in floating irgs */ - if (get_irg_pinned(irg) == op_pin_state_floats) + n = fold_constant_associativity(n, tarval_eor); + if (n != oldn) return n; - if ((ta != tarval_bad) && - (get_irn_mode(a) == mode_b) && - (get_opt_unreachable_code())) { - /* It's a boolean Cond, branching on a boolean constant. - Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */ - ir_node *blk = get_nodes_block(n); - jmp = new_r_Jmp(blk); - turn_into_tuple(n, pn_Cond_max); - if (ta == tarval_b_true) { - set_Tuple_pred(n, pn_Cond_false, get_irg_bad(irg)); - set_Tuple_pred(n, pn_Cond_true, jmp); - } else { - set_Tuple_pred(n, pn_Cond_false, jmp); - set_Tuple_pred(n, pn_Cond_true, get_irg_bad(irg)); + /* we can combine the relations of two compares with the same operands */ + if (is_Cmp(a) && is_Cmp(b)) { + ir_node *a_left = get_Cmp_left(a); + ir_node *a_right = get_Cmp_left(a); + ir_node *b_left = get_Cmp_left(b); + ir_node *b_right = get_Cmp_right(b); + if (a_left == b_left && b_left == b_right) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_relation a_relation = get_Cmp_relation(a); + ir_relation b_relation = get_Cmp_relation(b); + ir_relation new_relation = a_relation ^ b_relation; + return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation); } - /* We might generate an endless loop, so keep it alive. */ - add_End_keepalive(get_irg_end(irg), blk); } + + HANDLE_BINOP_PHI((eval_func) tarval_eor, a, b, c, mode); + + /* normalize not nodes... ~a ^ b <=> a ^ ~b */ + if (is_Not(a) && operands_are_normalized(get_Not_op(a), b)) { + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *new_not = new_rd_Not(dbg, block, b, mode); + ir_node *new_left = get_Not_op(a); + n = new_rd_Eor(dbg, block, new_left, new_not, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + return n; + } else if (is_Not(b) && !operands_are_normalized(a, get_Not_op(b))) { + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *new_not = new_rd_Not(dbg, block, a, mode); + ir_node *new_right = get_Not_op(b); + n = new_rd_Eor(dbg, block, new_not, new_right, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + return n; + } + + /* x ^ 1...1 -> ~1 */ + if (is_Const(b) && is_Const_all_one(b)) { + n = new_r_Not(get_nodes_block(n), a, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + return n; + } + + n = transform_bitwise_distributive(n, transform_node_Eor_); + if (n != oldn) + return n; + n = transform_node_bitop_shift(n); + if (n != oldn) + return n; + return n; -} /* transform_node_Cond */ +} -/** - * Prototype of a recursive transform function - * for bitwise distributive transformations. - */ -typedef ir_node* (*recursive_transform)(ir_node *n); +static ir_node *transform_node_Eor(ir_node *n) +{ + if (is_Or_Eor_Add(n)) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *left = get_Eor_left(n); + ir_node *right = get_Eor_right(n); + ir_mode *mode = get_irn_mode(n); + return new_rd_Add(dbgi, block, left, right, mode); + } + return transform_node_Eor_(n); +} /** - * makes use of distributive laws for and, or, eor - * and(a OP c, b OP c) -> and(a, b) OP c - * note, might return a different op than n + * Do the AddSub optimization, then Transform + * Constant folding on Phi + * Add(a,a) -> Mul(a, 2) + * Add(Mul(a, x), a) -> Mul(a, x+1) + * if the mode is integer or float. + * Transform Add(a,-b) into Sub(a,b). + * Reassociation might fold this further. */ -static ir_node *transform_bitwise_distributive(ir_node *n, - recursive_transform trans_func) +static ir_node *transform_node_Add(ir_node *n) { - ir_node *oldn = n; - ir_node *a = get_binop_left(n); - ir_node *b = get_binop_right(n); - ir_op *op = get_irn_op(a); - ir_op *op_root = get_irn_op(n); + ir_mode *mode; + ir_node *a; + ir_node *b; + ir_node *c; + ir_node *oldn = n; - if (op != get_irn_op(b)) + n = fold_constant_associativity(n, tarval_add); + if (n != oldn) return n; - /* and(conv(a), conv(b)) -> conv(and(a,b)) */ - if (op == op_Conv) { - ir_node *a_op = get_Conv_op(a); - ir_node *b_op = get_Conv_op(b); - ir_mode *a_mode = get_irn_mode(a_op); - ir_mode *b_mode = get_irn_mode(b_op); - if (a_mode == b_mode && (mode_is_int(a_mode) || a_mode == mode_b)) { - ir_node *blk = get_nodes_block(n); + n = transform_node_AddSub(n); + if (n != oldn) + return n; - n = exact_copy(n); - set_binop_left(n, a_op); - set_binop_right(n, b_op); - set_irn_mode(n, a_mode); - n = trans_func(n); - n = new_r_Conv(blk, n, get_irn_mode(oldn)); + a = get_Add_left(n); + b = get_Add_right(n); + mode = get_irn_mode(n); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_CONV); - return n; + if (mode_is_reference(mode)) { + ir_mode *lmode = get_irn_mode(a); + + if (is_Const(b) && is_Const_null(b) && mode_is_int(lmode)) { + /* an Add(a, NULL) is a hidden Conv */ + dbg_info *dbg = get_irn_dbg_info(n); + return new_rd_Conv(dbg, get_nodes_block(n), a, mode); } } - if (op == op_Eor) { - /* nothing to gain here */ - return n; + if (is_Const(b) && get_mode_arithmetic(mode) == irma_twos_complement) { + ir_tarval *tv = get_Const_tarval(b); + ir_tarval *min = get_mode_min(mode); + /* if all bits are set, then this has the same effect as a Not. + * Note that the following == gives false for different modes which + * is exactly what we want */ + if (tv == min) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_graph *irg = get_irn_irg(n); + ir_node *block = get_nodes_block(n); + ir_node *cnst = new_r_Const(irg, min); + return new_rd_Eor(dbgi, block, a, cnst, mode); + } } - if (op == op_Shrs || op == op_Shr || op == op_Shl - || op == op_And || op == op_Or || op == op_Eor) { - ir_node *a_left = get_binop_left(a); - ir_node *a_right = get_binop_right(a); - ir_node *b_left = get_binop_left(b); - ir_node *b_right = get_binop_right(b); - ir_node *c = NULL; - ir_node *op1 = NULL; - ir_node *op2 = NULL; - - if (is_op_commutative(op)) { - if (a_left == b_left) { - c = a_left; - op1 = a_right; - op2 = b_right; - } else if (a_left == b_right) { - c = a_left; - op1 = a_right; - op2 = b_left; - } else if (a_right == b_left) { - c = a_right; - op1 = a_left; - op2 = b_right; - } - } - if (a_right == b_right) { - c = a_right; - op1 = a_left; - op2 = b_left; - } + HANDLE_BINOP_PHI((eval_func) tarval_add, a, b, c, mode); - if (c != NULL) { - /* (a sop c) & (b sop c) => (a & b) sop c */ - ir_node *blk = get_nodes_block(n); + /* for FP the following optimizations are only allowed if + * fp_strict_algebraic is disabled */ + if (mode_is_float(mode)) { + ir_graph *irg = get_irn_irg(n); + if (get_irg_fp_model(irg) & fp_strict_algebraic) + return n; + } - ir_node *new_n = exact_copy(n); - set_binop_left(new_n, op1); - set_binop_right(new_n, op2); - new_n = trans_func(new_n); + if (mode_is_num(mode)) { + ir_graph *irg = get_irn_irg(n); + /* the following code leads to endless recursion when Mul are replaced + * by a simple instruction chain */ + if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_ARCH_DEP) + && a == b && mode_is_int(mode)) { + ir_node *block = get_nodes_block(n); - if (op_root == op_Eor && op == op_Or) { - dbg_info *dbgi = get_irn_dbg_info(n); - ir_mode *mode = get_irn_mode(c); + n = new_rd_Mul( + get_irn_dbg_info(n), + block, + a, + new_r_Const_long(irg, mode, 2), + mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_A); + return n; + } + if (is_Minus(a)) { + n = new_rd_Sub( + get_irn_dbg_info(n), + get_nodes_block(n), + b, + get_Minus_op(a), + mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B); + return n; + } + if (is_Minus(b)) { + n = new_rd_Sub( + get_irn_dbg_info(n), + get_nodes_block(n), + a, + get_Minus_op(b), + mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_ADD_A_MINUS_B); + return n; + } + if (get_mode_arithmetic(mode) == irma_twos_complement) { + /* Here we rely on constants be on the RIGHT side */ + if (is_Not(a)) { + ir_node *op = get_Not_op(a); - c = new_rd_Not(dbgi, blk, c, mode); - n = new_rd_And(dbgi, blk, new_n, c, mode); - } else { - n = exact_copy(a); - set_nodes_block(n, blk); - set_binop_left(n, new_n); - set_binop_right(n, c); - add_identities(n); + if (is_Const(b) && is_Const_one(b)) { + /* ~x + 1 = -x */ + ir_node *blk = get_nodes_block(n); + n = new_rd_Minus(get_irn_dbg_info(n), blk, op, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_PLUS_1); + return n; + } } + } + } - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_SHIFT_AND); + if (is_Or_Eor_Add(n)) { + n = transform_node_Or_(n); + if (n != oldn) + return n; + n = transform_node_Eor_(n); + if (n != oldn) return n; - } } return n; } /** - * Create a 0 constant of given mode. + * returns -cnst or NULL if impossible */ -static ir_node *create_zero_const(ir_graph *irg, ir_mode *mode) +static ir_node *const_negate(ir_node *cnst) { - ir_tarval *tv = get_mode_null(mode); - ir_node *cnst = new_r_Const(irg, tv); - - return cnst; + ir_tarval *tv = tarval_neg(get_Const_tarval(cnst)); + dbg_info *dbgi = get_irn_dbg_info(cnst); + ir_graph *irg = get_irn_irg(cnst); + if (tv == tarval_bad) return NULL; + return new_rd_Const(dbgi, irg, tv); } /** - * Transform an And. + * Do the AddSub optimization, then Transform + * Constant folding on Phi + * Sub(0,a) -> Minus(a) + * Sub(Mul(a, x), a) -> Mul(a, x-1) + * Sub(Sub(x, y), b) -> Sub(x, Add(y,b)) + * Sub(Add(a, x), x) -> a + * Sub(x, Add(x, a)) -> -a + * Sub(x, Const) -> Add(x, -Const) */ -static ir_node *transform_node_And(ir_node *n) +static ir_node *transform_node_Sub(ir_node *n) { - ir_node *c, *oldn = n; - ir_node *a = get_And_left(n); - ir_node *b = get_And_right(n); ir_mode *mode; - vrp_attr *a_vrp, *b_vrp; + ir_node *oldn = n; + ir_node *a, *b, *c; - if (is_Cmp(a) && is_Cmp(b)) { - ir_node *a_left = get_Cmp_left(a); - ir_node *a_right = get_Cmp_right(a); - ir_node *b_left = get_Cmp_left(b); - ir_node *b_right = get_Cmp_right(b); - ir_relation a_relation = get_Cmp_relation(a); - ir_relation b_relation = get_Cmp_relation(b); - /* we can combine the relations of two compares with the same - * operands */ - if (a_left == b_left && b_left == b_right) { - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_relation new_relation = a_relation & b_relation; - return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation); - } - /* Cmp(a==0) and Cmp(b==0) can be optimized to Cmp(a|b==0) */ - if (is_Const(a_right) && is_Const_null(a_right) - && is_Const(b_right) && is_Const_null(b_right) - && a_relation == b_relation && a_relation == ir_relation_equal - && !mode_is_float(get_irn_mode(a_left)) - && !mode_is_float(get_irn_mode(b_left))) { - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_mode *mode = get_irn_mode(a_left); - ir_node *n_b_left = get_irn_mode(b_left) != mode ? - new_rd_Conv(dbgi, block, b_left, mode) : b_left; - ir_node *or = new_rd_Or(dbgi, block, a_left, n_b_left, mode); - ir_graph *irg = get_irn_irg(n); - ir_node *zero = create_zero_const(irg, mode); - return new_rd_Cmp(dbgi, block, or, zero, ir_relation_equal); - } - } + n = transform_node_AddSub(n); - mode = get_irn_mode(n); - HANDLE_BINOP_PHI((eval_func) tarval_and, a, b, c, mode); + a = get_Sub_left(n); + b = get_Sub_right(n); - if (is_Or(a)) { - if (is_Not(b)) { - ir_node *op = get_Not_op(b); - if (is_And(op)) { - ir_node *ba = get_And_left(op); - ir_node *bb = get_And_right(op); + mode = get_irn_mode(n); - /* it's enough to test the following cases due to normalization! */ - if (get_Or_left(a) == ba && get_Or_right(a) == bb) { - /* (a|b) & ~(a&b) = a^b */ - ir_node *block = get_nodes_block(n); + if (mode_is_int(mode)) { + ir_mode *lmode = get_irn_mode(a); - n = new_rd_Eor(get_irn_dbg_info(n), block, ba, bb, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR); - return n; - } - } + if (is_Const(b) && is_Const_null(b) && mode_is_reference(lmode)) { + /* a Sub(a, NULL) is a hidden Conv */ + dbg_info *dbg = get_irn_dbg_info(n); + n = new_rd_Conv(dbg, get_nodes_block(n), a, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_CONV); + return n; } - } - if (is_Or(b)) { - if (is_Not(a)) { - ir_node *op = get_Not_op(a); - if (is_And(op)) { - ir_node *aa = get_And_left(op); - ir_node *ab = get_And_right(op); - - /* it's enough to test the following cases due to normalization! */ - if (get_Or_left(b) == aa && get_Or_right(b) == ab) { - /* (a|b) & ~(a&b) = a^b */ - ir_node *block = get_nodes_block(n); - n = new_rd_Eor(get_irn_dbg_info(n), block, aa, ab, mode); - DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR); - return n; - } - } + if (mode == lmode && + get_mode_arithmetic(mode) == irma_twos_complement && + is_Const(a) && + get_Const_tarval(a) == get_mode_minus_one(mode)) { + /* -1 - x -> ~x */ + dbg_info *dbg = get_irn_dbg_info(n); + n = new_rd_Not(dbg, get_nodes_block(n), b, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_NOT); + return n; } } - if (is_Eor(a)) { - ir_node *al = get_Eor_left(a); - ir_node *ar = get_Eor_right(a); - if (al == b) { - /* (b ^ a) & b -> ~a & b */ - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); +restart: + HANDLE_BINOP_PHI((eval_func) tarval_sub, a, b, c, mode); - ar = new_rd_Not(dbg, block, ar, mode); - n = new_rd_And(dbg, block, ar, b, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */ + if (mode_is_float(mode)) { + ir_graph *irg = get_irn_irg(n); + if (get_irg_fp_model(irg) & fp_strict_algebraic) return n; - } - if (ar == b) { - /* (a ^ b) & b -> ~a & b */ - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); + } - al = new_rd_Not(dbg, block, al, mode); - n = new_rd_And(dbg, block, al, b, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + if (is_Const(b) && !mode_is_reference(get_irn_mode(b))) { + /* a - C -> a + (-C) */ + ir_node *cnst = const_negate(b); + if (cnst != NULL) { + ir_node *block = get_nodes_block(n); + dbg_info *dbgi = get_irn_dbg_info(n); + + n = new_rd_Add(dbgi, block, a, cnst, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); return n; } } - if (is_Eor(b)) { - ir_node *bl = get_Eor_left(b); - ir_node *br = get_Eor_right(b); - if (bl == a) { - /* a & (a ^ b) -> a & ~b */ - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); + if (is_Minus(a)) { /* (-a) - b -> -(a + b) */ + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *left = get_Minus_op(a); + ir_node *add = new_rd_Add(dbg, block, left, b, mode); - br = new_rd_Not(dbg, block, br, mode); - n = new_rd_And(dbg, block, br, a, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); - return n; + n = new_rd_Minus(dbg, block, add, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); + return n; + } else if (is_Minus(b)) { /* a - (-b) -> a + b */ + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *right = get_Minus_op(b); + + n = new_rd_Add(dbg, block, a, right, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MINUS); + return n; + } else if (is_Sub(b)) { + /* a - (b - c) -> a + (c - b) + * -> (a - b) + c iff (b - c) is a pointer */ + dbg_info *s_dbg = get_irn_dbg_info(b); + ir_node *s_left = get_Sub_left(b); + ir_node *s_right = get_Sub_right(b); + ir_mode *s_mode = get_irn_mode(b); + if (mode_is_reference(s_mode)) { + ir_node *lowest_block = get_nodes_block(n); /* a and b are live here */ + ir_node *sub = new_rd_Sub(s_dbg, lowest_block, a, s_left, mode); + dbg_info *a_dbg = get_irn_dbg_info(n); + + if (s_mode != mode) + s_right = new_r_Conv(lowest_block, s_right, mode); + n = new_rd_Add(a_dbg, lowest_block, sub, s_right, mode); + } else { + ir_node *s_block = get_nodes_block(b); + ir_node *sub = new_rd_Sub(s_dbg, s_block, s_right, s_left, s_mode); + dbg_info *a_dbg = get_irn_dbg_info(n); + ir_node *a_block = get_nodes_block(n); + + n = new_rd_Add(a_dbg, a_block, a, sub, mode); } - if (br == a) { - /* a & (b ^ a) -> a & ~b */ - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); + return n; +#if 0 + } else if (is_Mul(b)) { /* a - (b * C) -> a + (b * -C) */ + ir_node *m_right = get_Mul_right(b); + if (is_Const(m_right)) { + ir_node *cnst2 = const_negate(m_right); + if (cnst2 != NULL) { + dbg_info *m_dbg = get_irn_dbg_info(b); + ir_node *m_block = get_nodes_block(b); + ir_node *m_left = get_Mul_left(b); + ir_mode *m_mode = get_irn_mode(b); + ir_node *mul = new_rd_Mul(m_dbg, m_block, m_left, cnst2, m_mode); + dbg_info *a_dbg = get_irn_dbg_info(n); + ir_node *a_block = get_nodes_block(n); - bl = new_rd_Not(dbg, block, bl, mode); - n = new_rd_And(dbg, block, bl, a, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); - return n; + n = new_rd_Add(a_dbg, a_block, a, mul, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_TO_ADD); + return n; + } } +#endif } - if (is_Not(a) && is_Not(b)) { - /* ~a & ~b = ~(a|b) */ - ir_node *block = get_nodes_block(n); - ir_mode *mode = get_irn_mode(n); - a = get_Not_op(a); - b = get_Not_op(b); - n = new_rd_Or(get_irn_dbg_info(n), block, a, b, mode); - n = new_rd_Not(get_irn_dbg_info(n), block, n, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN); + /* Beware of Sub(P, P) which cannot be optimized into a simple Minus ... */ + if (mode_is_num(mode) && mode == get_irn_mode(a) && is_Const(a) && is_Const_null(a)) { + n = new_rd_Minus( + get_irn_dbg_info(n), + get_nodes_block(n), + b, + mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_0_A); return n; } + if ((is_Add(a) || is_Or_Eor_Add(a)) && mode_wrap_around(mode)) { + ir_node *left = get_binop_left(a); + ir_node *right = get_binop_right(a); - b_vrp = vrp_get_info(b); - if (is_Const(a) && b_vrp && (tarval_cmp(tarval_or(get_Const_tarval(a), - b_vrp->bits_not_set), get_Const_tarval(a)) == ir_relation_equal)) { + /* FIXME: Does the Conv's work only for two complement or generally? */ + if (left == b) { + if (mode != get_irn_mode(right)) { + /* This Sub is an effective Cast */ + right = new_r_Conv(get_nodes_block(n), right, mode); + } + n = right; + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); + return n; + } else if (right == b) { + if (mode != get_irn_mode(left)) { + /* This Sub is an effective Cast */ + left = new_r_Conv(get_nodes_block(n), left, mode); + } + n = left; + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); + return n; + } + } + if ((is_Add(b) || is_Or_Eor_Add(b)) && mode_wrap_around(mode)) { + ir_node *left = get_binop_left(b); + ir_node *right = get_binop_right(b); - return b; + /* FIXME: Does the Conv's work only for two complement or generally? */ + if (left == a) { + ir_mode *r_mode = get_irn_mode(right); - } + n = new_r_Minus(get_nodes_block(n), right, r_mode); + if (mode != r_mode) { + /* This Sub is an effective Cast */ + n = new_r_Conv(get_nodes_block(n), n, mode); + } + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); + return n; + } else if (right == a) { + ir_mode *l_mode = get_irn_mode(left); - a_vrp = vrp_get_info(a); - if (is_Const(b) && a_vrp && (tarval_cmp(tarval_or(get_Const_tarval(b), - a_vrp->bits_not_set), get_Const_tarval(b)) == ir_relation_equal)) { - return a; + n = new_r_Minus(get_nodes_block(n), left, l_mode); + if (mode != l_mode) { + /* This Sub is an effective Cast */ + n = new_r_Conv(get_nodes_block(n), n, mode); + } + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_SUB); + return n; + } } + if (mode_is_int(mode) && is_Conv(a) && is_Conv(b)) { + ir_mode *mode = get_irn_mode(a); - n = transform_bitwise_distributive(n, transform_node_And); - - return n; -} /* transform_node_And */ + if (mode == get_irn_mode(b)) { + ir_mode *ma, *mb; + ir_node *op_a = get_Conv_op(a); + ir_node *op_b = get_Conv_op(b); -/* the order of the values is important! */ -typedef enum const_class { - const_const = 0, - const_like = 1, - const_other = 2 -} const_class; + /* check if it's allowed to skip the conv */ + ma = get_irn_mode(op_a); + mb = get_irn_mode(op_b); -static const_class classify_const(const ir_node* n) -{ - if (is_Const(n)) return const_const; - if (is_irn_constlike(n)) return const_like; - return const_other; -} + if (mode_is_reference(ma) && mode_is_reference(mb)) { + /* SubInt(ConvInt(aP), ConvInt(bP)) -> SubInt(aP,bP) */ + a = op_a; b = op_b; + set_Sub_left(n, a); + set_Sub_right(n, b); -/** - * Determines whether r is more constlike or has a larger index (in that order) - * than l. - */ -static bool operands_are_normalized(const ir_node *l, const ir_node *r) -{ - const const_class l_order = classify_const(l); - const const_class r_order = classify_const(r); - return - l_order > r_order || - (l_order == r_order && get_irn_idx(l) <= get_irn_idx(r)); -} + goto restart; + } + } + } + /* do NOT execute this code if reassociation is enabled, it does the inverse! */ + if (!is_reassoc_running() && is_Mul(a)) { + ir_node *ma = get_Mul_left(a); + ir_node *mb = get_Mul_right(a); -/** - * Transform an Eor. - */ -static ir_node *transform_node_Eor(ir_node *n) -{ - ir_node *c, *oldn = n; - ir_node *a = get_Eor_left(n); - ir_node *b = get_Eor_right(n); - ir_mode *mode = get_irn_mode(n); - - /* we can combine the relations of two compares with the same operands */ - if (is_Cmp(a) && is_Cmp(b)) { - ir_node *a_left = get_Cmp_left(a); - ir_node *a_right = get_Cmp_left(a); - ir_node *b_left = get_Cmp_left(b); - ir_node *b_right = get_Cmp_right(b); - if (a_left == b_left && b_left == b_right) { - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_relation a_relation = get_Cmp_relation(a); - ir_relation b_relation = get_Cmp_relation(b); - ir_relation new_relation = a_relation ^ b_relation; - return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation); + if (ma == b) { + ir_node *blk = get_nodes_block(n); + ir_graph *irg = get_irn_irg(n); + n = new_rd_Mul( + get_irn_dbg_info(n), + blk, + ma, + new_rd_Sub( + get_irn_dbg_info(n), + blk, + mb, + new_r_Const(irg, get_mode_one(mode)), + mode), + mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A); + return n; + } else if (mb == b) { + ir_node *blk = get_nodes_block(n); + ir_graph *irg = get_irn_irg(n); + n = new_rd_Mul( + get_irn_dbg_info(n), + blk, + mb, + new_rd_Sub( + get_irn_dbg_info(n), + blk, + ma, + new_r_Const(irg, get_mode_one(mode)), + mode), + mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_MUL_A_X_A); + return n; } } + if (is_Sub(a)) { /* (x - y) - b -> x - (y + b) */ + ir_node *x = get_Sub_left(a); + ir_node *y = get_Sub_right(a); + ir_node *blk = get_nodes_block(n); + ir_mode *m_b = get_irn_mode(b); + ir_mode *m_y = get_irn_mode(y); + ir_mode *add_mode; + ir_node *add; - HANDLE_BINOP_PHI((eval_func) tarval_eor, a, b, c, mode); + /* Determine the right mode for the Add. */ + if (m_b == m_y) + add_mode = m_b; + else if (mode_is_reference(m_b)) + add_mode = m_b; + else if (mode_is_reference(m_y)) + add_mode = m_y; + else { + /* + * Both modes are different but none is reference, + * happens for instance in SubP(SubP(P, Iu), Is). + * We have two possibilities here: Cast or ignore. + * Currently we ignore this case. + */ + return n; + } - /* normalize not nodes... ~a ^ b <=> a ^ ~b */ - if (is_Not(a) && operands_are_normalized(get_Not_op(a), b)) { - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_node *new_not = new_rd_Not(dbg, block, b, mode); - ir_node *new_left = get_Not_op(a); - n = new_rd_Eor(dbg, block, new_left, new_not, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); - return n; - } else if (is_Not(b) && !operands_are_normalized(a, get_Not_op(b))) { - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_node *new_not = new_rd_Not(dbg, block, a, mode); - ir_node *new_right = get_Not_op(b); - n = new_rd_Eor(dbg, block, new_not, new_right, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); - return n; - } + add = new_r_Add(blk, y, b, add_mode); - /* x ^ 1...1 -> ~1 */ - if (is_Const(b) && is_Const_all_one(b)) { - n = new_r_Not(get_nodes_block(n), a, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + n = new_rd_Sub(get_irn_dbg_info(n), blk, x, add, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_SUB_X_Y_Z); return n; } - n = transform_bitwise_distributive(n, transform_node_Eor); + if (get_mode_arithmetic(mode) == irma_twos_complement) { + /* c - ~X = X + (c+1) */ + if (is_Const(a) && is_Not(b)) { + ir_tarval *tv = get_Const_tarval(a); + + tv = tarval_add(tv, get_mode_one(mode)); + if (tv != tarval_bad) { + ir_node *blk = get_nodes_block(n); + ir_graph *irg = get_irn_irg(n); + ir_node *c = new_r_Const(irg, tv); + n = new_rd_Add(get_irn_dbg_info(n), blk, get_Not_op(b), c, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_SUB_C_NOT_X); + return n; + } + } + /* x-(x&y) = x & ~y */ + if (is_And(b)) { + ir_node *and_left = get_And_left(b); + ir_node *and_right = get_And_right(b); + if (and_right == a) { + ir_node *tmp = and_left; + and_left = and_right; + and_right = tmp; + } + if (and_left == a) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_mode *mode = get_irn_mode(n); + ir_node *notn = new_rd_Not(dbgi, block, and_right, mode); + ir_node *andn = new_rd_And(dbgi, block, a, notn, mode); + return andn; + } + } + } return n; -} /* transform_node_Eor */ +} /** - * Transform a Not. + * Several transformation done on n*n=2n bits mul. + * These transformations must be done here because new nodes may be produced. */ -static ir_node *transform_node_Not(ir_node *n) +static ir_node *transform_node_Mul2n(ir_node *n, ir_mode *mode) { - ir_node *c, *oldn = n; - ir_node *a = get_Not_op(n); - ir_mode *mode = get_irn_mode(n); - - HANDLE_UNOP_PHI(tarval_not,a,c); + ir_node *oldn = n; + ir_node *a = get_Mul_left(n); + ir_node *b = get_Mul_right(n); + ir_tarval *ta = value_of(a); + ir_tarval *tb = value_of(b); + ir_mode *smode = get_irn_mode(a); - /* check for a boolean Not */ - if (is_Cmp(a)) { - dbg_info *dbgi = get_irn_dbg_info(a); - ir_node *block = get_nodes_block(a); - ir_relation relation = get_Cmp_relation(a); - relation = get_negated_relation(relation); - n = new_rd_Cmp(dbgi, block, get_Cmp_left(a), get_Cmp_right(a), relation); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP); + if (ta == get_mode_one(smode)) { + /* (L)1 * (L)b = (L)b */ + ir_node *blk = get_nodes_block(n); + n = new_rd_Conv(get_irn_dbg_info(n), blk, b, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1); return n; } - - /* normalize ~(a ^ b) => a ^ ~b */ - if (is_Eor(a)) { - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_node *eor_right = get_Eor_right(a); - ir_node *eor_left = get_Eor_left(a); - eor_right = new_rd_Not(dbg, block, eor_right, mode); - n = new_rd_Eor(dbg, block, eor_left, eor_right, mode); + else if (ta == get_mode_minus_one(smode)) { + /* (L)-1 * (L)b = (L)b */ + ir_node *blk = get_nodes_block(n); + n = new_rd_Minus(get_irn_dbg_info(n), blk, b, smode); + n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); return n; } - - if (get_mode_arithmetic(mode) == irma_twos_complement) { - if (is_Minus(a)) { /* ~-x -> x + -1 */ - dbg_info *dbg = get_irn_dbg_info(n); - ir_graph *irg = get_irn_irg(n); - ir_node *block = get_nodes_block(n); - ir_node *add_l = get_Minus_op(a); - ir_node *add_r = new_rd_Const(dbg, irg, get_mode_minus_one(mode)); - n = new_rd_Add(dbg, block, add_l, add_r, mode); - } else if (is_Add(a)) { - ir_node *add_r = get_Add_right(a); - if (is_Const(add_r) && is_Const_all_one(add_r)) { - /* ~(x + -1) = -x */ - ir_node *op = get_Add_left(a); - ir_node *blk = get_nodes_block(n); - n = new_rd_Minus(get_irn_dbg_info(n), blk, op, get_irn_mode(n)); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_MINUS_1); - } - } + if (tb == get_mode_one(smode)) { + /* (L)a * (L)1 = (L)a */ + ir_node *blk = get_nodes_block(a); + n = new_rd_Conv(get_irn_dbg_info(n), blk, a, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_1); + return n; + } + else if (tb == get_mode_minus_one(smode)) { + /* (L)a * (L)-1 = (L)-a */ + ir_node *blk = get_nodes_block(n); + n = new_rd_Minus(get_irn_dbg_info(n), blk, a, smode); + n = new_rd_Conv(get_irn_dbg_info(n), blk, n, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); + return n; } return n; } /** - * Transform a Minus. - * Optimize: - * -(~x) = x + 1 - * -(a-b) = b - a - * -(a >>u (size-1)) = a >>s (size-1) - * -(a >>s (size-1)) = a >>u (size-1) - * -(a * const) -> a * -const + * Transform Mul(a,-1) into -a. + * Do constant evaluation of Phi nodes. + * Do architecture dependent optimizations on Mul nodes */ -static ir_node *transform_node_Minus(ir_node *n) +static ir_node *transform_node_Mul(ir_node *n) { ir_node *c, *oldn = n; - ir_node *a = get_Minus_op(n); - ir_mode *mode; + ir_mode *mode = get_irn_mode(n); + ir_node *a = get_Mul_left(n); + ir_node *b = get_Mul_right(n); - HANDLE_UNOP_PHI(tarval_neg,a,c); + n = fold_constant_associativity(n, tarval_mul); + if (n != oldn) + return n; - mode = get_irn_mode(a); - if (get_mode_arithmetic(mode) == irma_twos_complement) { - /* the following rules are only to twos-complement */ - if (is_Not(a)) { - /* -(~x) = x + 1 */ - ir_node *op = get_Not_op(a); - ir_tarval *tv = get_mode_one(mode); - ir_node *blk = get_nodes_block(n); - ir_graph *irg = get_irn_irg(blk); - ir_node *c = new_r_Const(irg, tv); - n = new_rd_Add(get_irn_dbg_info(n), blk, op, c, mode); - DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_NOT); - return n; - } - if (is_Shr(a)) { - ir_node *c = get_Shr_right(a); + if (mode != get_irn_mode(a)) + return transform_node_Mul2n(n, mode); - if (is_Const(c)) { - ir_tarval *tv = get_Const_tarval(c); + HANDLE_BINOP_PHI((eval_func) tarval_mul, a, b, c, mode); - if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) { - /* -(a >>u (size-1)) = a >>s (size-1) */ - ir_node *v = get_Shr_left(a); + if (mode_is_signed(mode)) { + ir_node *r = NULL; - n = new_rd_Shrs(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode); - DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE); - return n; - } - } + if (value_of(a) == get_mode_minus_one(mode)) + r = b; + else if (value_of(b) == get_mode_minus_one(mode)) + r = a; + if (r) { + n = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), r, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); + return n; } - if (is_Shrs(a)) { - ir_node *c = get_Shrs_right(a); - - if (is_Const(c)) { - ir_tarval *tv = get_Const_tarval(c); - - if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) { - /* -(a >>s (size-1)) = a >>u (size-1) */ - ir_node *v = get_Shrs_left(a); - - n = new_rd_Shr(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode); - DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE); - return n; - } + } + if (is_Minus(a)) { + if (is_Const(b)) { /* (-a) * const -> a * -const */ + ir_node *cnst = const_negate(b); + if (cnst != NULL) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + n = new_rd_Mul(dbgi, block, get_Minus_op(a), cnst, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_1); + return n; } + } else if (is_Minus(b)) { /* (-a) * (-b) -> a * b */ + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + n = new_rd_Mul(dbgi, block, get_Minus_op(a), get_Minus_op(b), mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS_MINUS); + return n; + } else if (is_Sub(b)) { /* (-a) * (b - c) -> a * (c - b) */ + ir_node *sub_l = get_Sub_left(b); + ir_node *sub_r = get_Sub_right(b); + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *new_b = new_rd_Sub(dbgi, block, sub_r, sub_l, mode); + n = new_rd_Mul(dbgi, block, get_Minus_op(a), new_b, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS); + return n; + } + } else if (is_Minus(b)) { + if (is_Sub(a)) { /* (a - b) * (-c) -> (b - a) * c */ + ir_node *sub_l = get_Sub_left(a); + ir_node *sub_r = get_Sub_right(a); + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *new_a = new_rd_Sub(dbgi, block, sub_r, sub_l, mode); + n = new_rd_Mul(dbgi, block, new_a, get_Minus_op(b), mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_MINUS); + return n; + } + } else if (is_Shl(a)) { + ir_node *const shl_l = get_Shl_left(a); + if (is_Const(shl_l) && is_Const_one(shl_l)) { + /* (1 << x) * b -> b << x */ + dbg_info *const dbgi = get_irn_dbg_info(n); + ir_node *const block = get_nodes_block(n); + ir_node *const shl_r = get_Shl_right(a); + n = new_rd_Shl(dbgi, block, b, shl_r, mode); + // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT); + return n; + } + } else if (is_Shl(b)) { + ir_node *const shl_l = get_Shl_left(b); + if (is_Const(shl_l) && is_Const_one(shl_l)) { + /* a * (1 << x) -> a << x */ + dbg_info *const dbgi = get_irn_dbg_info(n); + ir_node *const block = get_nodes_block(n); + ir_node *const shl_r = get_Shl_right(b); + n = new_rd_Shl(dbgi, block, a, shl_r, mode); + // TODO add me DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_MUL_SHIFT); + return n; } } - if (is_Sub(a)) { - /* - (a-b) = b - a */ - ir_node *la = get_Sub_left(a); - ir_node *ra = get_Sub_right(a); - ir_node *blk = get_nodes_block(n); - - n = new_rd_Sub(get_irn_dbg_info(n), blk, ra, la, mode); - DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_SUB); - return n; - } - - if (is_Mul(a)) { /* -(a * const) -> a * -const */ - ir_node *mul_l = get_Mul_left(a); - ir_node *mul_r = get_Mul_right(a); - ir_tarval *tv = value_of(mul_r); - if (tv != tarval_bad) { - tv = tarval_neg(tv); - if (tv != tarval_bad) { - ir_graph *irg = get_irn_irg(n); - ir_node *cnst = new_r_Const(irg, tv); - dbg_info *dbg = get_irn_dbg_info(a); - ir_node *block = get_nodes_block(a); - n = new_rd_Mul(dbg, block, mul_l, cnst, mode); - DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_MUL_C); + if (get_mode_arithmetic(mode) == irma_ieee754 + || get_mode_arithmetic(mode) == irma_x86_extended_float) { + if (is_Const(a)) { + ir_tarval *tv = get_Const_tarval(a); + if (tarval_get_exponent(tv) == 1 && tarval_zero_mantissa(tv) + && !tarval_is_negative(tv)) { + /* 2.0 * b = b + b */ + n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), b, b, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A); + return n; + } + } + else if (is_Const(b)) { + ir_tarval *tv = get_Const_tarval(b); + if (tarval_get_exponent(tv) == 1 && tarval_zero_mantissa(tv) + && !tarval_is_negative(tv)) { + /* a * 2.0 = a + a */ + n = new_rd_Add(get_irn_dbg_info(n), get_nodes_block(n), a, a, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_ADD_A_A); return n; } } } - - return n; -} /* transform_node_Minus */ + return arch_dep_replace_mul_with_shifts(n); +} /** - * Transform a Proj(Load) with a non-null address. + * Transform a Div Node. */ -static ir_node *transform_node_Proj_Load(ir_node *proj) +static ir_node *transform_node_Div(ir_node *n) { - if (get_opt_ldst_only_null_ptr_exceptions()) { - if (get_irn_mode(proj) == mode_X) { - ir_node *load = get_Proj_pred(proj); - - /* get the Load address */ - const ir_node *addr = get_Load_ptr(load); - const ir_node *confirm; + ir_mode *mode = get_Div_resmode(n); + ir_node *a = get_Div_left(n); + ir_node *b = get_Div_right(n); + ir_node *value = n; + const ir_node *dummy; - if (value_not_null(addr, &confirm)) { - if (confirm == NULL) { - /* this node may float if it did not depend on a Confirm */ - set_irn_pinned(load, op_pin_state_floats); - } - if (get_Proj_proj(proj) == pn_Load_X_except) { - ir_graph *irg = get_irn_irg(proj); - DBG_OPT_EXC_REM(proj); - return get_irg_bad(irg); - } else { - ir_node *blk = get_nodes_block(load); - return new_r_Jmp(blk); - } + if (mode_is_int(mode)) { + if (is_Const(b) && is_const_Phi(a)) { + /* check for Div(Phi, Const) */ + value = apply_binop_on_phi(a, get_Const_tarval(b), (eval_func) tarval_div, mode, 0); + if (value) { + DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); + goto make_tuple; + } + } else if (is_Const(a) && is_const_Phi(b)) { + /* check for Div(Const, Phi) */ + value = apply_binop_on_phi(b, get_Const_tarval(a), (eval_func) tarval_div, mode, 1); + if (value) { + DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); + goto make_tuple; + } + } else if (is_const_Phi(a) && is_const_Phi(b)) { + /* check for Div(Phi, Phi) */ + value = apply_binop_on_2_phis(a, b, (eval_func) tarval_div, mode); + if (value) { + DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); + goto make_tuple; } } - } - return proj; -} /* transform_node_Proj_Load */ - -/** - * Transform a Proj(Store) with a non-null address. - */ -static ir_node *transform_node_Proj_Store(ir_node *proj) -{ - if (get_opt_ldst_only_null_ptr_exceptions()) { - if (get_irn_mode(proj) == mode_X) { - ir_node *store = get_Proj_pred(proj); - /* get the load/store address */ - const ir_node *addr = get_Store_ptr(store); - const ir_node *confirm; + if (a == b && value_not_zero(a, &dummy)) { + ir_graph *irg = get_irn_irg(n); + /* BEWARE: we can optimize a/a to 1 only if this cannot cause a exception */ + value = new_r_Const(irg, get_mode_one(mode)); + DBG_OPT_CSTEVAL(n, value); + goto make_tuple; + } else { + if (mode_is_signed(mode) && is_Const(b)) { + ir_tarval *tv = get_Const_tarval(b); - if (value_not_null(addr, &confirm)) { - if (confirm == NULL) { - /* this node may float if it did not depend on a Confirm */ - set_irn_pinned(store, op_pin_state_floats); - } - if (get_Proj_proj(proj) == pn_Store_X_except) { - ir_graph *irg = get_irn_irg(proj); - DBG_OPT_EXC_REM(proj); - return get_irg_bad(irg); - } else { - ir_node *blk = get_nodes_block(store); - return new_r_Jmp(blk); + if (tv == get_mode_minus_one(mode)) { + /* a / -1 */ + value = new_rd_Minus(get_irn_dbg_info(n), get_nodes_block(n), a, mode); + DBG_OPT_CSTEVAL(n, value); + goto make_tuple; } } + /* Try architecture dependent optimization */ + value = arch_dep_replace_div_by_const(n); } - } - return proj; -} /* transform_node_Proj_Store */ - -/** - * Transform a Proj(Div) with a non-zero value. - * Removes the exceptions and routes the memory to the NoMem node. - */ -static ir_node *transform_node_Proj_Div(ir_node *proj) -{ - ir_node *div = get_Proj_pred(proj); - ir_node *b = get_Div_right(div); - ir_node *res, *new_mem; - const ir_node *confirm; - long proj_nr; + } else { + assert(mode_is_float(mode)); - if (value_not_zero(b, &confirm)) { - /* div(x, y) && y != 0 */ - if (confirm == NULL) { - /* we are sure we have a Const != 0 */ - new_mem = get_Div_mem(div); - new_mem = skip_Pin(new_mem); - set_Div_mem(div, new_mem); - set_irn_pinned(div, op_pin_state_floats); - } + /* Optimize x/c to x*(1/c) */ + if (get_mode_arithmetic(mode) == irma_ieee754) { + ir_tarval *tv = value_of(b); - proj_nr = get_Proj_proj(proj); - switch (proj_nr) { - case pn_Div_X_regular: - return new_r_Jmp(get_nodes_block(div)); + if (tv != tarval_bad) { + int rem = tarval_fp_ops_enabled(); - case pn_Div_X_except: { - ir_graph *irg = get_irn_irg(proj); - /* we found an exception handler, remove it */ - DBG_OPT_EXC_REM(proj); - return get_irg_bad(irg); - } + /* + * Floating point constant folding might be disabled here to + * prevent rounding. + * However, as we check for exact result, doing it is safe. + * Switch it on. + */ + tarval_enable_fp_ops(1); + tv = tarval_div(get_mode_one(mode), tv); + tarval_enable_fp_ops(rem); - case pn_Div_M: { - ir_graph *irg = get_irn_irg(proj); - res = get_Div_mem(div); - new_mem = get_irg_no_mem(irg); + /* Do the transformation if the result is either exact or we are + not using strict rules. */ + if (tv != tarval_bad && + (tarval_ieee754_get_exact() || (get_irg_fp_model(get_irn_irg(n)) & fp_strict_algebraic) == 0)) { + ir_node *block = get_nodes_block(n); + ir_graph *irg = get_irn_irg(block); + ir_node *c = new_r_Const(irg, tv); + dbg_info *dbgi = get_irn_dbg_info(n); + value = new_rd_Mul(dbgi, block, a, c, mode); - if (confirm) { - /* This node can only float up to the Confirm block */ - new_mem = new_r_Pin(get_nodes_block(confirm), new_mem); + goto make_tuple; + } } - set_irn_pinned(div, op_pin_state_floats); - /* this is a Div without exception, we can remove the memory edge */ - set_Div_mem(div, new_mem); - return res; - } } } - return proj; -} /* transform_node_Proj_Div */ - -/** - * Transform a Proj(Mod) with a non-zero value. - * Removes the exceptions and routes the memory to the NoMem node. - */ -static ir_node *transform_node_Proj_Mod(ir_node *proj) -{ - ir_node *mod = get_Proj_pred(proj); - ir_node *b = get_Mod_right(mod); - ir_node *res, *new_mem; - const ir_node *confirm; - long proj_nr; - if (value_not_zero(b, &confirm)) { - /* mod(x, y) && y != 0 */ - proj_nr = get_Proj_proj(proj); + if (value != n) { + ir_node *mem, *blk; + ir_graph *irg; - if (confirm == NULL) { - /* we are sure we have a Const != 0 */ - new_mem = get_Mod_mem(mod); - new_mem = skip_Pin(new_mem); - set_Mod_mem(mod, new_mem); - set_irn_pinned(mod, op_pin_state_floats); - } +make_tuple: + /* Turn Div into a tuple (mem, jmp, bad, value) */ + mem = get_Div_mem(n); + blk = get_nodes_block(n); + irg = get_irn_irg(blk); - switch (proj_nr) { + /* skip a potential Pin */ + mem = skip_Pin(mem); + turn_into_tuple(n, pn_Div_max+1); + set_Tuple_pred(n, pn_Div_M, mem); + set_Tuple_pred(n, pn_Div_X_regular, new_r_Jmp(blk)); + set_Tuple_pred(n, pn_Div_X_except, new_r_Bad(irg, mode_X)); + set_Tuple_pred(n, pn_Div_res, value); + } + return n; +} - case pn_Mod_X_regular: - return new_r_Jmp(get_irn_n(mod, -1)); +/** + * Transform a Mod node. + */ +static ir_node *transform_node_Mod(ir_node *n) +{ + ir_mode *mode = get_Mod_resmode(n); + ir_node *a = get_Mod_left(n); + ir_node *b = get_Mod_right(n); + ir_graph *irg; + ir_node *value; + ir_tarval *tv; - case pn_Mod_X_except: { - ir_graph *irg = get_irn_irg(proj); - /* we found an exception handler, remove it */ - DBG_OPT_EXC_REM(proj); - return get_irg_bad(irg); + if (is_Const(b) && is_const_Phi(a)) { + /* check for Div(Phi, Const) */ + value = apply_binop_on_phi(a, get_Const_tarval(b), (eval_func) tarval_mod, mode, 0); + if (value) { + DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); + goto make_tuple; + } + } + else if (is_Const(a) && is_const_Phi(b)) { + /* check for Div(Const, Phi) */ + value = apply_binop_on_phi(b, get_Const_tarval(a), (eval_func) tarval_mod, mode, 1); + if (value) { + DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); + goto make_tuple; + } + } + else if (is_const_Phi(a) && is_const_Phi(b)) { + /* check for Div(Phi, Phi) */ + value = apply_binop_on_2_phis(a, b, (eval_func) tarval_mod, mode); + if (value) { + DBG_OPT_ALGSIM0(n, value, FS_OPT_CONST_PHI); + goto make_tuple; } + } - case pn_Mod_M: { - ir_graph *irg = get_irn_irg(proj); - res = get_Mod_mem(mod); - new_mem = get_irg_no_mem(irg); + value = n; + tv = value_of(n); + irg = get_irn_irg(n); + if (tv != tarval_bad) { + value = new_r_Const(irg, tv); - if (confirm) { - /* This node can only float up to the Confirm block */ - new_mem = new_r_Pin(get_nodes_block(confirm), new_mem); - } - /* this is a Mod without exception, we can remove the memory edge */ - set_Mod_mem(mod, new_mem); - return res; - } - case pn_Mod_res: - if (get_Mod_left(mod) == b) { - /* a % a = 0 if a != 0 */ - ir_graph *irg = get_irn_irg(proj); - ir_mode *mode = get_irn_mode(proj); - ir_node *res = new_r_Const(irg, get_mode_null(mode)); + DBG_OPT_CSTEVAL(n, value); + goto make_tuple; + } else { + ir_node *a = get_Mod_left(n); + ir_node *b = get_Mod_right(n); + const ir_node *dummy; - DBG_OPT_CSTEVAL(mod, res); - return res; + if (a == b && value_not_zero(a, &dummy)) { + /* BEWARE: we can optimize a%a to 0 only if this cannot cause a exception */ + value = new_r_Const(irg, get_mode_null(mode)); + DBG_OPT_CSTEVAL(n, value); + goto make_tuple; + } else { + if (mode_is_signed(mode) && is_Const(b)) { + ir_tarval *tv = get_Const_tarval(b); + + if (tv == get_mode_minus_one(mode)) { + /* a % -1 = 0 */ + value = new_r_Const(irg, get_mode_null(mode)); + DBG_OPT_CSTEVAL(n, value); + goto make_tuple; + } } + /* Try architecture dependent optimization */ + value = arch_dep_replace_mod_by_const(n); } } - return proj; -} /* transform_node_Proj_Mod */ + + if (value != n) { + ir_node *mem, *blk; + ir_graph *irg; + +make_tuple: + /* Turn Mod into a tuple (mem, jmp, bad, value) */ + mem = get_Mod_mem(n); + blk = get_nodes_block(n); + irg = get_irn_irg(blk); + + /* skip a potential Pin */ + mem = skip_Pin(mem); + turn_into_tuple(n, pn_Mod_max+1); + set_Tuple_pred(n, pn_Mod_M, mem); + set_Tuple_pred(n, pn_Mod_X_regular, new_r_Jmp(blk)); + set_Tuple_pred(n, pn_Mod_X_except, new_r_Bad(irg, mode_X)); + set_Tuple_pred(n, pn_Mod_res, value); + } + return n; +} /** - * Optimizes jump tables (CondIs or CondIu) by removing all impossible cases. + * Transform a Cond node. + * + * Replace the Cond by a Jmp if it branches on a constant + * condition. */ -static ir_node *transform_node_Proj_Cond(ir_node *proj) +static ir_node *transform_node_Cond(ir_node *n) { - ir_node *n = get_Proj_pred(proj); - ir_node *b = get_Cond_selector(n); + ir_node *a = get_Cond_selector(n); + ir_graph *irg = get_irn_irg(n); + ir_tarval *ta; + ir_node *jmp; - if (!get_opt_unreachable_code()) + /* we need block info which is not available in floating irgs */ + if (get_irg_pinned(irg) == op_pin_state_floats) return n; - if (mode_is_int(get_irn_mode(b))) { - ir_tarval *tb = value_of(b); - - if (tb != tarval_bad) { - /* we have a constant switch */ - long num = get_Proj_proj(proj); + ta = value_of(a); + if (ta == tarval_bad && is_Cmp(a)) { + /* try again with a direct call to compute_cmp, as we don't care + * about the MODEB_LOWERED flag here */ + ta = compute_cmp_ext(a); + } - if (num != get_Cond_default_proj(n)) { /* we cannot optimize default Proj's yet */ - if (get_tarval_long(tb) == num) { - /* Do NOT create a jump here, or we will have 2 control flow ops - * in a block. This case is optimized away in optimize_cf(). */ - return proj; - } else { - ir_graph *irg = get_irn_irg(proj); - /* this case will NEVER be taken, kill it */ - return get_irg_bad(irg); - } - } + if (ta != tarval_bad && get_irn_mode(a) == mode_b) { + /* It's a boolean Cond, branching on a boolean constant. + Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */ + ir_node *blk = get_nodes_block(n); + jmp = new_r_Jmp(blk); + turn_into_tuple(n, pn_Cond_max+1); + if (ta == tarval_b_true) { + set_Tuple_pred(n, pn_Cond_false, new_r_Bad(irg, mode_X)); + set_Tuple_pred(n, pn_Cond_true, jmp); } else { - long num = get_Proj_proj(proj); - vrp_attr *b_vrp = vrp_get_info(b); - if (num != get_Cond_default_proj(n) && b_vrp) { - /* Try handling with vrp data. We only remove dead parts. */ - ir_tarval *tp = new_tarval_from_long(num, get_irn_mode(b)); - - if (b_vrp->range_type == VRP_RANGE) { - ir_relation cmp_result = tarval_cmp(b_vrp->range_bottom, tp); - ir_relation cmp_result2 = tarval_cmp(b_vrp->range_top, tp); - - if ((cmp_result & ir_relation_greater) == cmp_result && (cmp_result2 - & ir_relation_less) == cmp_result2) { - ir_graph *irg = get_irn_irg(proj); - return get_irg_bad(irg); - } - } else if (b_vrp->range_type == VRP_ANTIRANGE) { - ir_relation cmp_result = tarval_cmp(b_vrp->range_bottom, tp); - ir_relation cmp_result2 = tarval_cmp(b_vrp->range_top, tp); - - if ((cmp_result & ir_relation_less_equal) == cmp_result && (cmp_result2 - & ir_relation_greater_equal) == cmp_result2) { - ir_graph *irg = get_irn_irg(proj); - return get_irg_bad(irg); - } - } - - if (!(tarval_cmp( - tarval_and( b_vrp->bits_set, tp), - b_vrp->bits_set - ) == ir_relation_equal)) { - ir_graph *irg = get_irn_irg(proj); - return get_irg_bad(irg); - } - - if (!(tarval_cmp( - tarval_and( - tarval_not(tp), - tarval_not(b_vrp->bits_not_set)), - tarval_not(b_vrp->bits_not_set)) - == ir_relation_equal)) { - ir_graph *irg = get_irn_irg(proj); - return get_irg_bad(irg); - } - - - } + set_Tuple_pred(n, pn_Cond_false, jmp); + set_Tuple_pred(n, pn_Cond_true, new_r_Bad(irg, mode_X)); } + /* We might generate an endless loop, so keep it alive. */ + add_End_keepalive(get_irg_end(irg), blk); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_NO_UNREACHABLE_CODE); } - return proj; + return n; } -/** - * return true if the operation returns a value with exactly 1 bit set - */ -static bool is_single_bit(const ir_node *node) -{ - /* a first implementation, could be extended with vrp and others... */ - if (is_Shl(node)) { - ir_node *shl_l = get_Shl_left(node); - ir_mode *mode = get_irn_mode(node); - int modulo = get_mode_modulo_shift(mode); - /* this works if we shift a 1 and we have modulo shift */ - if (is_Const(shl_l) && is_Const_one(shl_l) - && 0 < modulo && modulo <= (int)get_mode_size_bits(mode)) { - return true; +static ir_node *transform_node_Switch(ir_node *n) +{ + ir_node *op = get_Switch_selector(n); + ir_tarval *val = value_of(op); + if (val != tarval_bad) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_graph *irg = get_irn_irg(n); + unsigned n_outs = get_Switch_n_outs(n); + ir_node *block = get_nodes_block(n); + ir_node *bad = new_r_Bad(irg, mode_X); + ir_node **in = XMALLOCN(ir_node*, n_outs); + const ir_switch_table *table = get_Switch_table(n); + size_t n_entries = ir_switch_table_get_n_entries(table); + long jmp_pn = 0; + size_t i; + unsigned o; + for (i = 0; i < n_entries; ++i) { + const ir_switch_table_entry *entry + = ir_switch_table_get_entry_const(table, i); + ir_tarval *min = entry->min; + ir_tarval *max = entry->max; + if (entry->pn == 0) + continue; + if ((min == max && min == val) + || (tarval_cmp(val, min) != ir_relation_less + && tarval_cmp(val, max) != ir_relation_greater)) { + jmp_pn = entry->pn; + break; + } } - } else if (is_Const(node)) { - ir_tarval *tv = get_Const_tarval(node); - return tarval_is_single_bit(tv); + for (o = 0; o < n_outs; ++o) { + if (o == (unsigned)jmp_pn) { + in[o] = new_rd_Jmp(dbgi, block); + } else { + in[o] = bad; + } + } + return new_r_Tuple(block, (int)n_outs, in); } - return false; + return n; } /** - * Normalizes and optimizes Cmp nodes. + * normalisation: (x & c1) >> c2 to (x >> c2) & (c1 >> c2) + * (we can use: + * - and, or, xor instead of & + * - Shl, Shr, Shrs, rotl instead of >> + * (with a special case for Or/Xor + Shrs) + * + * This normalisation is good for things like x-(x&y) esp. in 186.crafty. */ -static ir_node *transform_node_Cmp(ir_node *n) +static ir_node *transform_node_shift_bitop(ir_node *n) { - ir_node *left = get_Cmp_left(n); - ir_node *right = get_Cmp_right(n); - ir_mode *mode = get_irn_mode(left); - ir_tarval *tv = NULL; - bool changed = false; - bool changedc = false; - ir_relation relation = get_Cmp_relation(n); - ir_relation possible = ir_get_possible_cmp_relations(left, right); + ir_graph *irg = get_irn_irg(n); + ir_node *right = get_binop_right(n); + ir_mode *mode = get_irn_mode(n); + ir_node *left; + ir_node *bitop_left; + ir_node *bitop_right; + ir_op *op_left; + ir_node *block; + dbg_info *dbgi; + ir_node *new_shift; + ir_node *new_bitop; + ir_node *new_const; + ir_tarval *tv1; + ir_tarval *tv2; + ir_tarval *tv_shift; - /* mask out impossible relations */ - ir_relation new_relation = relation & possible; - if (new_relation != relation) { - relation = new_relation; - changed = true; - } + if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_NORMALISATION2)) + return n; - /* Remove unnecessary conversions */ - /* TODO handle conv+constant */ - if (is_Conv(left) && is_Conv(right)) { - ir_node *op_left = get_Conv_op(left); - ir_node *op_right = get_Conv_op(right); - ir_mode *mode_left = get_irn_mode(op_left); - ir_mode *mode_right = get_irn_mode(op_right); + assert(is_Shrs(n) || is_Shr(n) || is_Shl(n) || is_Rotl(n)); - if (smaller_mode(mode_left, mode) && smaller_mode(mode_right, mode) - && mode_left != mode_b && mode_right != mode_b) { - ir_node *block = get_nodes_block(n); + if (!is_Const(right)) + return n; - if (mode_left == mode_right) { - left = op_left; - right = op_right; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV_CONV); - } else if (smaller_mode(mode_left, mode_right)) { - left = new_r_Conv(block, op_left, mode_right); - right = op_right; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); - } else if (smaller_mode(mode_right, mode_left)) { - left = op_left; - right = new_r_Conv(block, op_right, mode_left); - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); - } - } + left = get_binop_left(n); + op_left = get_irn_op(left); + if (op_left != op_And && op_left != op_Or && op_left != op_Eor) + return n; + + /* doing it with Shrs is not legal if the Or/Eor affects the topmost bit */ + if (is_Shrs(n) && (op_left == op_Or || op_left == op_Eor)) { + /* TODO: test if sign bit is affectes */ + return n; } - /* - * Optimize -a CMP -b into b CMP a. - * This works only for modes where unary Minus cannot Overflow. - * Note that two-complement integers can Overflow so it will NOT work. - */ - if (!mode_overflow_on_unary_Minus(mode) && - is_Minus(left) && is_Minus(right)) { - left = get_Minus_op(left); - right = get_Minus_op(right); - relation = get_inversed_relation(relation); - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } + bitop_right = get_binop_right(left); + if (!is_Const(bitop_right)) + return n; - /* remove operation on both sides if possible */ - if (relation == ir_relation_equal || relation == ir_relation_less_greater) { - /* - * The following operations are NOT safe for floating point operations, for instance - * 1.0 + inf == 2.0 + inf, =/=> x == y - */ - if (mode_is_int(mode)) { - unsigned lop = get_irn_opcode(left); + bitop_left = get_binop_left(left); - if (lop == get_irn_opcode(right)) { - ir_node *ll, *lr, *rl, *rr; + block = get_nodes_block(n); + dbgi = get_irn_dbg_info(n); + tv1 = get_Const_tarval(bitop_right); + tv2 = get_Const_tarval(right); - /* same operation on both sides, try to remove */ - switch (lop) { - case iro_Not: - case iro_Minus: - /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */ - left = get_unop_op(left); - right = get_unop_op(right); - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - break; - case iro_Add: - ll = get_Add_left(left); - lr = get_Add_right(left); - rl = get_Add_left(right); - rr = get_Add_right(right); + assert(get_tarval_mode(tv1) == mode); - if (ll == rl) { - /* X + a CMP X + b ==> a CMP b */ - left = lr; - right = rr; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } else if (ll == rr) { - /* X + a CMP b + X ==> a CMP b */ - left = lr; - right = rl; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } else if (lr == rl) { - /* a + X CMP X + b ==> a CMP b */ - left = ll; - right = rr; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } else if (lr == rr) { - /* a + X CMP b + X ==> a CMP b */ - left = ll; - right = rl; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } - break; - case iro_Sub: - ll = get_Sub_left(left); - lr = get_Sub_right(left); - rl = get_Sub_left(right); - rr = get_Sub_right(right); + if (is_Shl(n)) { + new_shift = new_rd_Shl(dbgi, block, bitop_left, right, mode); + tv_shift = tarval_shl(tv1, tv2); + } else if (is_Shr(n)) { + new_shift = new_rd_Shr(dbgi, block, bitop_left, right, mode); + tv_shift = tarval_shr(tv1, tv2); + } else if (is_Shrs(n)) { + new_shift = new_rd_Shrs(dbgi, block, bitop_left, right, mode); + tv_shift = tarval_shrs(tv1, tv2); + } else { + assert(is_Rotl(n)); + new_shift = new_rd_Rotl(dbgi, block, bitop_left, right, mode); + tv_shift = tarval_rotl(tv1, tv2); + } - if (ll == rl) { - /* X - a CMP X - b ==> a CMP b */ - left = lr; - right = rr; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } else if (lr == rr) { - /* a - X CMP b - X ==> a CMP b */ - left = ll; - right = rl; - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } - break; - case iro_Rotl: - if (get_Rotl_right(left) == get_Rotl_right(right)) { - /* a ROTL X CMP b ROTL X ==> a CMP b */ - left = get_Rotl_left(left); - right = get_Rotl_left(right); - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } - break; - default: - break; - } - } + assert(get_tarval_mode(tv_shift) == mode); + irg = get_irn_irg(n); + new_const = new_r_Const(irg, tv_shift); - /* X+A == A, A+X == A, A-X == A -> X == 0 */ - if (is_Add(left) || is_Sub(left)) { - ir_node *ll = get_binop_left(left); - ir_node *lr = get_binop_right(left); + if (op_left == op_And) { + new_bitop = new_rd_And(dbgi, block, new_shift, new_const, mode); + } else if (op_left == op_Or) { + new_bitop = new_rd_Or(dbgi, block, new_shift, new_const, mode); + } else { + assert(op_left == op_Eor); + new_bitop = new_rd_Eor(dbgi, block, new_shift, new_const, mode); + } - if (lr == right && is_Add(left)) { - ir_node *tmp = ll; - ll = lr; - lr = tmp; - } - if (ll == right) { - ir_graph *irg = get_irn_irg(n); - left = lr; - right = create_zero_const(irg, mode); - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } - } - if (is_Add(right) || is_Sub(right)) { - ir_node *rl = get_binop_left(right); - ir_node *rr = get_binop_right(right); + return new_bitop; +} - if (rr == left && is_Add(right)) { - ir_node *tmp = rl; - rl = rr; - rr = tmp; - } - if (rl == left) { - ir_graph *irg = get_irn_irg(n); - left = rr; - right = create_zero_const(irg, mode); - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); - } +/** + * Transform an And. + */ +static ir_node *transform_node_And(ir_node *n) +{ + ir_node *c, *oldn = n; + ir_node *a = get_And_left(n); + ir_node *b = get_And_right(n); + ir_mode *mode; + + n = fold_constant_associativity(n, tarval_and); + if (n != oldn) + return n; + + if (is_Cmp(a) && is_Cmp(b)) { + ir_node *a_left = get_Cmp_left(a); + ir_node *a_right = get_Cmp_right(a); + ir_node *b_left = get_Cmp_left(b); + ir_node *b_right = get_Cmp_right(b); + ir_relation a_relation = get_Cmp_relation(a); + ir_relation b_relation = get_Cmp_relation(b); + /* we can combine the relations of two compares with the same + * operands */ + if (a_left == b_left && b_left == b_right) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_relation new_relation = a_relation & b_relation; + return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation); + } + /* Cmp(a==b) and Cmp(c==d) can be optimized to Cmp((a^b)|(c^d)==0) */ + if (a_relation == b_relation && a_relation == ir_relation_equal + && !mode_is_float(get_irn_mode(a_left)) + && !mode_is_float(get_irn_mode(b_left))) { + if (values_in_mode(get_irn_mode(a_left), get_irn_mode(b_left))) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_mode *a_mode = get_irn_mode(a_left); + ir_mode *b_mode = get_irn_mode(b_left); + ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode); + ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode); + ir_node *conv = new_rd_Conv(dbgi, block, xora, b_mode); + ir_node *orn = new_rd_Or(dbgi, block, conv, xorb, b_mode); + ir_graph *irg = get_irn_irg(n); + ir_node *zero = create_zero_const(irg, b_mode); + return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_equal); } + if (values_in_mode(get_irn_mode(b_left), get_irn_mode(a_left))) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_mode *a_mode = get_irn_mode(a_left); + ir_mode *b_mode = get_irn_mode(b_left); + ir_node *xora = new_rd_Eor(dbgi, block, a_left, a_right, a_mode); + ir_node *xorb = new_rd_Eor(dbgi, block, b_left, b_right, b_mode); + ir_node *conv = new_rd_Conv(dbgi, block, xorb, a_mode); + ir_node *orn = new_rd_Or(dbgi, block, xora, conv, a_mode); + ir_graph *irg = get_irn_irg(n); + ir_node *zero = create_zero_const(irg, a_mode); + return new_rd_Cmp(dbgi, block, orn, zero, ir_relation_equal); + } + } + } - if (is_And(left) && is_Const(right)) { - ir_node *ll = get_binop_left(left); - ir_node *lr = get_binop_right(left); - if (is_Shr(ll) && is_Const(lr)) { - /* Cmp((x >>u c1) & c2, c3) = Cmp(x & (c2 << c1), c3 << c1) */ - ir_node *block = get_nodes_block(n); - ir_mode *mode = get_irn_mode(left); + mode = get_irn_mode(n); + HANDLE_BINOP_PHI((eval_func) tarval_and, a, b, c, mode); - ir_node *llr = get_Shr_right(ll); - if (is_Const(llr)) { - dbg_info *dbg = get_irn_dbg_info(left); - ir_graph *irg = get_irn_irg(left); + if (is_Or(a) || is_Or_Eor_Add(a)) { + ir_node *or_left = get_binop_left(a); + ir_node *or_right = get_binop_right(a); + if (complement_values(or_left, b)) { + /* (a|b) & ~a => b & ~a */ + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + return new_rd_And(dbgi, block, or_right, b, mode); + } else if (complement_values(or_right, b)) { + /* (a|b) & ~b => a & ~b */ + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + return new_rd_And(dbgi, block, or_left, b, mode); + } else if (is_Not(b)) { + ir_node *op = get_Not_op(b); + if (is_And(op)) { + ir_node *ba = get_And_left(op); + ir_node *bb = get_And_right(op); - ir_tarval *c1 = get_Const_tarval(llr); - ir_tarval *c2 = get_Const_tarval(lr); - ir_tarval *c3 = get_Const_tarval(right); - ir_tarval *mask = tarval_shl(c2, c1); - ir_tarval *value = tarval_shl(c3, c1); + /* it's enough to test the following cases due to normalization! */ + if (or_left == ba && or_right == bb) { + /* (a|b) & ~(a&b) = a^b */ + ir_node *block = get_nodes_block(n); - left = new_rd_And(dbg, block, get_Shr_left(ll), new_r_Const(irg, mask), mode); - right = new_r_Const(irg, value); - changed = true; - } + n = new_rd_Eor(get_irn_dbg_info(n), block, ba, bb, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR); + return n; } } - /* Cmp(Eor(x, y), 0) <=> Cmp(x, y) at least for the ==0,!=0 - * cases */ - if (is_Const(right) && is_Const_null(right) && is_Eor(left)) { - right = get_Eor_right(left); - left = get_Eor_left(left); - changed = true; - } - } /* mode_is_int(...) */ + } } + if (is_Or(b) || is_Or_Eor_Add(b)) { + ir_node *or_left = get_binop_left(b); + ir_node *or_right = get_binop_right(b); + if (complement_values(or_left, a)) { + /* (a|b) & ~a => b & ~a */ + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + return new_rd_And(dbgi, block, or_right, a, mode); + } else if (complement_values(or_right, a)) { + /* (a|b) & ~b => a & ~b */ + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + return new_rd_And(dbgi, block, or_left, a, mode); + } else if (is_Not(a)) { + ir_node *op = get_Not_op(a); + if (is_And(op)) { + ir_node *aa = get_And_left(op); + ir_node *ab = get_And_right(op); - /* Cmp(And(1bit, val), 1bit) "bit-testing" can be replaced - * by the simpler Cmp(And(1bit), val), 0) negated pnc */ - if (mode_is_int(mode) && is_And(left) - && (relation == ir_relation_equal - || (mode_is_signed(mode) && relation == ir_relation_less_greater) - || (!mode_is_signed(mode) && (relation & ir_relation_less_equal) == ir_relation_less))) { - ir_node *and0 = get_And_left(left); - ir_node *and1 = get_And_right(left); - if (and1 == right) { - ir_node *tmp = and0; - and0 = and1; - and1 = tmp; - } - if (and0 == right && is_single_bit(and0)) { - ir_graph *irg = get_irn_irg(n); - relation = - relation == ir_relation_equal ? ir_relation_less_greater : ir_relation_equal; - right = create_zero_const(irg, mode); - changed |= 1; + /* it's enough to test the following cases due to normalization! */ + if (or_left == aa && or_right == ab) { + /* (a|b) & ~(a&b) = a^b */ + ir_node *block = get_nodes_block(n); + + n = new_rd_Eor(get_irn_dbg_info(n), block, aa, ab, mode); + DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_TO_EOR); + return n; + } + } } } + if (is_Eor(a) || is_Or_Eor_Add(a)) { + ir_node *al = get_binop_left(a); + ir_node *ar = get_binop_right(a); - /* replace mode_b compares with ands/ors */ - if (mode == mode_b) { - ir_node *block = get_nodes_block(n); - ir_node *bres; + if (al == b) { + /* (b ^ a) & b -> ~a & b */ + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); - switch (relation) { - case ir_relation_less_equal: - bres = new_r_Or(block, new_r_Not(block, left, mode_b), right, mode_b); - break; - case ir_relation_less: - bres = new_r_And(block, new_r_Not(block, left, mode_b), right, mode_b); - break; - case ir_relation_greater_equal: - bres = new_r_Or(block, left, new_r_Not(block, right, mode_b), mode_b); - break; - case ir_relation_greater: - bres = new_r_And(block, left, new_r_Not(block, right, mode_b), mode_b); - break; - case ir_relation_less_greater: - bres = new_r_Eor(block, left, right, mode_b); - break; - case ir_relation_equal: - bres = new_r_Not(block, new_r_Eor(block, left, right, mode_b), mode_b); - break; - default: -#ifdef DEBUG_libfirm - ir_fprintf(stderr, "Optimisation warning, unexpected mode_b Cmp %+F\n", n); -#endif - bres = NULL; + ar = new_rd_Not(dbg, block, ar, mode); + n = new_rd_And(dbg, block, ar, b, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + return n; } - if (bres != NULL) { - DBG_OPT_ALGSIM0(n, bres, FS_OPT_CMP_TO_BOOL); - return bres; + if (ar == b) { + /* (a ^ b) & b -> ~a & b */ + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + + al = new_rd_Not(dbg, block, al, mode); + n = new_rd_And(dbg, block, al, b, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + return n; } } + if (is_Eor(b) || is_Or_Eor_Add(b)) { + ir_node *bl = get_binop_left(b); + ir_node *br = get_binop_right(b); - /* - * First step: normalize the compare op - * by placing the constant on the right side - * or moving the lower address node to the left. - */ - if (!operands_are_normalized(left, right)) { - ir_node *t = left; - left = right; - right = t; + if (bl == a) { + /* a & (a ^ b) -> a & ~b */ + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); - relation = get_inversed_relation(relation); - changed = true; + br = new_rd_Not(dbg, block, br, mode); + n = new_rd_And(dbg, block, br, a, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + return n; + } + if (br == a) { + /* a & (b ^ a) -> a & ~b */ + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + + bl = new_rd_Not(dbg, block, bl, mode); + n = new_rd_And(dbg, block, bl, a, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_EOR_TO_NOT); + return n; + } } + if (is_Not(a) && is_Not(b)) { + /* ~a & ~b = ~(a|b) */ + ir_node *block = get_nodes_block(n); + ir_mode *mode = get_irn_mode(n); - /* - * Second step: Try to reduce the magnitude - * of a constant. This may help to generate better code - * later and may help to normalize more compares. - * Of course this is only possible for integer values. - */ - tv = value_of(right); - if (tv != tarval_bad) { - ir_mode *mode = get_irn_mode(right); + a = get_Not_op(a); + b = get_Not_op(b); + n = new_rd_Or(get_irn_dbg_info(n), block, a, b, mode); + n = new_rd_Not(get_irn_dbg_info(n), block, n, mode); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN); + return n; + } - /* TODO extend to arbitrary constants */ - if (is_Conv(left) && tarval_is_null(tv)) { - ir_node *op = get_Conv_op(left); - ir_mode *op_mode = get_irn_mode(op); + if (is_Const(a)) { + vrp_attr *b_vrp = vrp_get_info(b); + ir_tarval *a_val = get_Const_tarval(a); + if (b_vrp != NULL && tarval_or(a_val, b_vrp->bits_not_set) == a_val) { + return b; + } + } - /* - * UpConv(x) REL 0 ==> x REL 0 - * Don't do this for float values as it's unclear whether it is a - * win. (on the other side it makes detection/creation of fabs hard) - */ - if (get_mode_size_bits(mode) > get_mode_size_bits(op_mode) && - ((relation == ir_relation_equal || relation == ir_relation_less_greater) || - mode_is_signed(mode) || !mode_is_signed(op_mode)) && - !mode_is_float(mode)) { - tv = get_mode_null(op_mode); - left = op; - mode = op_mode; - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); - } + if (is_Const(b)) { + vrp_attr *a_vrp = vrp_get_info(a); + ir_tarval *b_val = get_Const_tarval(b); + if (a_vrp != NULL && tarval_or(b_val, a_vrp->bits_not_set) == b_val) { + return a; } + } - if (tv != tarval_bad) { - /* the following optimization is possible on modes without Overflow - * on Unary Minus or on == and !=: - * -a CMP c ==> a swap(CMP) -c - * - * Beware: for two-complement Overflow may occur, so only == and != can - * be optimized, see this: - * -MININT < 0 =/=> MININT > 0 !!! - */ - if (is_Minus(left) && - (!mode_overflow_on_unary_Minus(mode) || - (mode_is_int(mode) && (relation == ir_relation_equal || relation == ir_relation_less_greater)))) { - tv = tarval_neg(tv); + n = transform_bitwise_distributive(n, transform_node_And); + if (is_And(n)) + n = transform_node_bitop_shift(n); - if (tv != tarval_bad) { - left = get_Minus_op(left); - relation = get_inversed_relation(relation); - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); - } - } else if (is_Not(left) && (relation == ir_relation_equal || relation == ir_relation_less_greater)) { - /* Not(a) ==/!= c ==> a ==/!= Not(c) */ - tv = tarval_not(tv); + return n; +} - if (tv != tarval_bad) { - left = get_Not_op(left); - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); - } - } +/** + * Transform a Not. + */ +static ir_node *transform_node_Not(ir_node *n) +{ + ir_node *c, *oldn = n; + ir_node *a = get_Not_op(n); + ir_mode *mode = get_irn_mode(n); - /* for integer modes, we have more */ - if (mode_is_int(mode)) { - /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */ - if ((relation == ir_relation_less || relation == ir_relation_greater_equal) && - tarval_cmp(tv, get_mode_null(mode)) == ir_relation_greater) { - tv = tarval_sub(tv, get_mode_one(mode), NULL); + HANDLE_UNOP_PHI(tarval_not,a,c); - if (tv != tarval_bad) { - relation ^= ir_relation_equal; - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); - } - } - /* c < 0 : a > c ==> a >= (c+1) a <= c ==> a < (c+1) */ - else if ((relation == ir_relation_greater || relation == ir_relation_less_equal) && - tarval_cmp(tv, get_mode_null(mode)) == ir_relation_less) { - tv = tarval_add(tv, get_mode_one(mode)); + /* check for a boolean Not */ + if (is_Cmp(a)) { + dbg_info *dbgi = get_irn_dbg_info(a); + ir_node *block = get_nodes_block(a); + ir_relation relation = get_Cmp_relation(a); + relation = get_negated_relation(relation); + n = new_rd_Cmp(dbgi, block, get_Cmp_left(a), get_Cmp_right(a), relation); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP); + return n; + } - if (tv != tarval_bad) { - relation ^= ir_relation_equal; - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); - } - } + /* normalize ~(a ^ b) => a ^ ~b */ + if (is_Eor(a) || is_Or_Eor_Add(a)) { + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *eor_right = get_binop_right(a); + ir_node *eor_left = get_binop_left(a); + eor_right = new_rd_Not(dbg, block, eor_right, mode); + n = new_rd_Eor(dbg, block, eor_left, eor_right, mode); + return n; + } - /* the following reassociations work only for == and != */ - if (relation == ir_relation_equal || relation == ir_relation_less_greater) { + if (get_mode_arithmetic(mode) == irma_twos_complement) { + if (is_Minus(a)) { /* ~-x -> x + -1 */ + dbg_info *dbg = get_irn_dbg_info(n); + ir_graph *irg = get_irn_irg(n); + ir_node *block = get_nodes_block(n); + ir_node *add_l = get_Minus_op(a); + ir_node *add_r = new_rd_Const(dbg, irg, get_mode_minus_one(mode)); + n = new_rd_Add(dbg, block, add_l, add_r, mode); + } else if (is_Add(a) || is_Or_Eor_Add(a)) { + ir_node *add_r = get_binop_right(a); + if (is_Const(add_r) && is_Const_all_one(add_r)) { + /* ~(x + -1) = -x */ + ir_node *op = get_binop_left(a); + ir_node *blk = get_nodes_block(n); + n = new_rd_Minus(get_irn_dbg_info(n), blk, op, get_irn_mode(n)); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_MINUS_1); + } + } + } + return n; +} -#if 0 /* Might be not that good in general */ - /* a-b == 0 ==> a == b, a-b != 0 ==> a != b */ - if (tarval_is_null(tv) && is_Sub(left)) { - right = get_Sub_right(left); - left = get_Sub_left(left); +/** + * Transform a Minus. + * Optimize: + * -(~x) = x + 1 + * -(a-b) = b - a + * -(a >>u (size-1)) = a >>s (size-1) + * -(a >>s (size-1)) = a >>u (size-1) + * -(a * const) -> a * -const + */ +static ir_node *transform_node_Minus(ir_node *n) +{ + ir_node *c, *oldn = n; + ir_node *a = get_Minus_op(n); + ir_mode *mode; - tv = value_of(right); - changed = 1; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); - } -#endif + HANDLE_UNOP_PHI(tarval_neg,a,c); - if (tv != tarval_bad) { - /* a-c1 == c2 ==> a == c2+c1, a-c1 != c2 ==> a != c2+c1 */ - if (is_Sub(left)) { - ir_node *c1 = get_Sub_right(left); - ir_tarval *tv2 = value_of(c1); + mode = get_irn_mode(a); + if (get_mode_arithmetic(mode) == irma_twos_complement) { + /* the following rules are only to twos-complement */ + if (is_Not(a)) { + /* -(~x) = x + 1 */ + ir_node *op = get_Not_op(a); + ir_tarval *tv = get_mode_one(mode); + ir_node *blk = get_nodes_block(n); + ir_graph *irg = get_irn_irg(blk); + ir_node *c = new_r_Const(irg, tv); + n = new_rd_Add(get_irn_dbg_info(n), blk, op, c, mode); + DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_NOT); + return n; + } + if (is_Shr(a)) { + ir_node *c = get_Shr_right(a); - if (tv2 != tarval_bad) { - tv2 = tarval_add(tv, value_of(c1)); + if (is_Const(c)) { + ir_tarval *tv = get_Const_tarval(c); - if (tv2 != tarval_bad) { - left = get_Sub_left(left); - tv = tv2; - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); - } - } - } - /* a+c1 == c2 ==> a == c2-c1, a+c1 != c2 ==> a != c2-c1 */ - else if (is_Add(left)) { - ir_node *a_l = get_Add_left(left); - ir_node *a_r = get_Add_right(left); - ir_node *a; - ir_tarval *tv2; - - if (is_Const(a_l)) { - a = a_r; - tv2 = value_of(a_l); - } else { - a = a_l; - tv2 = value_of(a_r); - } - - if (tv2 != tarval_bad) { - tv2 = tarval_sub(tv, tv2, NULL); - - if (tv2 != tarval_bad) { - left = a; - tv = tv2; - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); - } - } - } - /* -a == c ==> a == -c, -a != c ==> a != -c */ - else if (is_Minus(left)) { - ir_tarval *tv2 = tarval_sub(get_mode_null(mode), tv, NULL); - - if (tv2 != tarval_bad) { - left = get_Minus_op(left); - tv = tv2; - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); - } - } - } - } /* == or != */ - } /* mode_is_int */ - - if (relation == ir_relation_equal || relation == ir_relation_less_greater) { - switch (get_irn_opcode(left)) { - ir_node *c1; - - case iro_And: - c1 = get_And_right(left); - if (is_Const(c1)) { - /* - * And(x, C1) == C2 ==> FALSE if C2 & C1 != C2 - * And(x, C1) != C2 ==> TRUE if C2 & C1 != C2 - */ - ir_tarval *mask = tarval_and(get_Const_tarval(c1), tv); - if (mask != tv) { - /* TODO: move to constant evaluation */ - ir_graph *irg = get_irn_irg(n); - tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); - c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(n, c1); - return c1; - } - - if (tarval_is_single_bit(tv)) { - /* - * optimization for AND: - * Optimize: - * And(x, C) == C ==> And(x, C) != 0 - * And(x, C) != C ==> And(X, C) == 0 - * - * if C is a single Bit constant. - */ - - /* check for Constant's match. We have check hare the tarvals, - because our const might be changed */ - if (get_Const_tarval(c1) == tv) { - /* fine: do the transformation */ - tv = get_mode_null(get_tarval_mode(tv)); - relation ^= ir_relation_less_equal_greater; - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); - } - } - } - break; - case iro_Or: - c1 = get_Or_right(left); - if (is_Const(c1) && tarval_is_null(tv)) { - /* - * Or(x, C) == 0 && C != 0 ==> FALSE - * Or(x, C) != 0 && C != 0 ==> TRUE - */ - if (! tarval_is_null(get_Const_tarval(c1))) { - /* TODO: move to constant evaluation */ - ir_graph *irg = get_irn_irg(n); - tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); - c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(n, c1); - return c1; - } - } - break; - case iro_Shl: - /* - * optimize x << c1 == c into x & (-1 >>u c1) == c >> c1 if c & (-1 << c1) == c - * FALSE else - * optimize x << c1 != c into x & (-1 >>u c1) != c >> c1 if c & (-1 << c1) == c - * TRUE else - */ - c1 = get_Shl_right(left); - if (is_Const(c1)) { - ir_graph *irg = get_irn_irg(c1); - ir_tarval *tv1 = get_Const_tarval(c1); - ir_mode *mode = get_irn_mode(left); - ir_tarval *minus1 = get_mode_all_one(mode); - ir_tarval *amask = tarval_shr(minus1, tv1); - ir_tarval *cmask = tarval_shl(minus1, tv1); - ir_node *sl, *blk; + if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) { + /* -(a >>u (size-1)) = a >>s (size-1) */ + ir_node *v = get_Shr_left(a); - if (tarval_and(tv, cmask) != tv) { - /* condition not met */ - tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); - c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(n, c1); - return c1; - } - sl = get_Shl_left(left); - blk = get_nodes_block(n); - left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode); - tv = tarval_shr(tv, tv1); - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); - } - break; - case iro_Shr: - /* - * optimize x >>u c1 == c into x & (-1 << c1) == c << c1 if c & (-1 >>u c1) == c - * FALSE else - * optimize x >>u c1 != c into x & (-1 << c1) != c << c1 if c & (-1 >>u c1) == c - * TRUE else - */ - c1 = get_Shr_right(left); - if (is_Const(c1)) { - ir_graph *irg = get_irn_irg(c1); - ir_tarval *tv1 = get_Const_tarval(c1); - ir_mode *mode = get_irn_mode(left); - ir_tarval *minus1 = get_mode_all_one(mode); - ir_tarval *amask = tarval_shl(minus1, tv1); - ir_tarval *cmask = tarval_shr(minus1, tv1); - ir_node *sl, *blk; + n = new_rd_Shrs(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode); + DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE); + return n; + } + } + } + if (is_Shrs(a)) { + ir_node *c = get_Shrs_right(a); - if (tarval_and(tv, cmask) != tv) { - /* condition not met */ - tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); - c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(n, c1); - return c1; - } - sl = get_Shr_left(left); - blk = get_nodes_block(n); - left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode); - tv = tarval_shl(tv, tv1); - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); - } - break; - case iro_Shrs: - /* - * optimize x >>s c1 == c into x & (-1 << c1) == c << c1 if (c >>s (BITS - c1)) \in {0,-1} - * FALSE else - * optimize x >>s c1 != c into x & (-1 << c1) != c << c1 if (c >>s (BITS - c1)) \in {0,-1} - * TRUE else - */ - c1 = get_Shrs_right(left); - if (is_Const(c1)) { - ir_graph *irg = get_irn_irg(c1); - ir_tarval *tv1 = get_Const_tarval(c1); - ir_mode *mode = get_irn_mode(left); - ir_tarval *minus1 = get_mode_all_one(mode); - ir_tarval *amask = tarval_shl(minus1, tv1); - ir_tarval *cond = new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(tv1)); - ir_node *sl, *blk; + if (is_Const(c)) { + ir_tarval *tv = get_Const_tarval(c); - cond = tarval_sub(cond, tv1, NULL); - cond = tarval_shrs(tv, cond); + if (tarval_is_long(tv) && get_tarval_long(tv) == (int) get_mode_size_bits(mode) - 1) { + /* -(a >>s (size-1)) = a >>u (size-1) */ + ir_node *v = get_Shrs_left(a); - if (!tarval_is_all_one(cond) && !tarval_is_null(cond)) { - /* condition not met */ - tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); - c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(n, c1); - return c1; - } - sl = get_Shrs_left(left); - blk = get_nodes_block(n); - left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode); - tv = tarval_shl(tv, tv1); - changedc = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); - } - break; - } /* switch */ + n = new_rd_Shr(get_irn_dbg_info(n), get_nodes_block(n), v, c, mode); + DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_PREDICATE); + return n; + } } - } /* tarval != bad */ + } } + if (is_Sub(a)) { + /* - (a-b) = b - a */ + ir_node *la = get_Sub_left(a); + ir_node *ra = get_Sub_right(a); + ir_node *blk = get_nodes_block(n); - if (changedc) { /* need a new Const */ - ir_graph *irg = get_irn_irg(n); - right = new_r_Const(irg, tv); - changed = true; + n = new_rd_Sub(get_irn_dbg_info(n), blk, ra, la, mode); + DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_SUB); + return n; } - if ((relation == ir_relation_equal || relation == ir_relation_less_greater) && is_Const(right) && is_Const_null(right) && is_Proj(left)) { - ir_node *op = get_Proj_pred(left); + if (is_Mul(a)) { /* -(a * const) -> a * -const */ + ir_node *mul_l = get_Mul_left(a); + ir_node *mul_r = get_Mul_right(a); + ir_tarval *tv = value_of(mul_r); + if (tv != tarval_bad) { + tv = tarval_neg(tv); + if (tv != tarval_bad) { + ir_graph *irg = get_irn_irg(n); + ir_node *cnst = new_r_Const(irg, tv); + dbg_info *dbg = get_irn_dbg_info(a); + ir_node *block = get_nodes_block(a); + n = new_rd_Mul(dbg, block, mul_l, cnst, mode); + DBG_OPT_ALGSIM2(oldn, a, n, FS_OPT_MINUS_MUL_C); + return n; + } + } + } - if (is_Mod(op) && get_Proj_proj(left) == pn_Mod_res) { - ir_node *c = get_binop_right(op); + return n; +} - if (is_Const(c)) { - ir_tarval *tv = get_Const_tarval(c); +/** + * Transform a Proj(Load) with a non-null address. + */ +static ir_node *transform_node_Proj_Load(ir_node *proj) +{ + if (get_irn_mode(proj) == mode_X) { + ir_node *load = get_Proj_pred(proj); - if (tarval_is_single_bit(tv)) { - /* special case: (x % 2^n) CMP 0 ==> x & (2^n-1) CMP 0 */ - ir_node *v = get_binop_left(op); - ir_node *blk = get_irn_n(op, -1); - ir_graph *irg = get_irn_irg(op); - ir_mode *mode = get_irn_mode(v); + /* get the Load address */ + const ir_node *addr = get_Load_ptr(load); + const ir_node *confirm; - tv = tarval_sub(tv, get_mode_one(mode), NULL); - left = new_rd_And(get_irn_dbg_info(op), blk, v, new_r_Const(irg, tv), mode); - changed = true; - DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_MOD_TO_AND); - } + if (value_not_null(addr, &confirm)) { + if (confirm == NULL) { + /* this node may float if it did not depend on a Confirm */ + set_irn_pinned(load, op_pin_state_floats); + } + if (get_Proj_proj(proj) == pn_Load_X_except) { + ir_graph *irg = get_irn_irg(proj); + DBG_OPT_EXC_REM(proj); + return new_r_Bad(irg, mode_X); + } else { + ir_node *blk = get_nodes_block(load); + return new_r_Jmp(blk); } } } + return proj; +} - if (changed) { - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); +/** + * Transform a Proj(Store) with a non-null address. + */ +static ir_node *transform_node_Proj_Store(ir_node *proj) +{ + if (get_irn_mode(proj) == mode_X) { + ir_node *store = get_Proj_pred(proj); - /* create a new compare */ - n = new_rd_Cmp(dbgi, block, left, right, relation); - } + /* get the load/store address */ + const ir_node *addr = get_Store_ptr(store); + const ir_node *confirm; - return n; + if (value_not_null(addr, &confirm)) { + if (confirm == NULL) { + /* this node may float if it did not depend on a Confirm */ + set_irn_pinned(store, op_pin_state_floats); + } + if (get_Proj_proj(proj) == pn_Store_X_except) { + ir_graph *irg = get_irn_irg(proj); + DBG_OPT_EXC_REM(proj); + return new_r_Bad(irg, mode_X); + } else { + ir_node *blk = get_nodes_block(store); + return new_r_Jmp(blk); + } + } + } + return proj; } /** - * Optimize CopyB(mem, x, x) into a Nop. + * Transform a Proj(Div) with a non-zero value. + * Removes the exceptions and routes the memory to the NoMem node. */ -static ir_node *transform_node_Proj_CopyB(ir_node *proj) +static ir_node *transform_node_Proj_Div(ir_node *proj) { - ir_node *copyb = get_Proj_pred(proj); - ir_node *a = get_CopyB_dst(copyb); - ir_node *b = get_CopyB_src(copyb); + ir_node *div = get_Proj_pred(proj); + ir_node *b = get_Div_right(div); + ir_node *res, *new_mem; + const ir_node *confirm; + long proj_nr; - if (a == b) { - switch (get_Proj_proj(proj)) { - case pn_CopyB_X_regular: - /* Turn CopyB into a tuple (mem, jmp, bad, bad) */ - DBG_OPT_EXC_REM(proj); - proj = new_r_Jmp(get_nodes_block(copyb)); - break; - case pn_CopyB_X_except: + if (value_not_zero(b, &confirm)) { + /* div(x, y) && y != 0 */ + if (confirm == NULL) { + /* we are sure we have a Const != 0 */ + new_mem = get_Div_mem(div); + new_mem = skip_Pin(new_mem); + set_Div_mem(div, new_mem); + set_irn_pinned(div, op_pin_state_floats); + } + + proj_nr = get_Proj_proj(proj); + switch (proj_nr) { + case pn_Div_X_regular: + return new_r_Jmp(get_nodes_block(div)); + + case pn_Div_X_except: { + ir_graph *irg = get_irn_irg(proj); + /* we found an exception handler, remove it */ DBG_OPT_EXC_REM(proj); - proj = get_irg_bad(get_irn_irg(proj)); - break; - default: - break; + return new_r_Bad(irg, mode_X); + } + + case pn_Div_M: { + ir_graph *irg = get_irn_irg(proj); + res = get_Div_mem(div); + new_mem = get_irg_no_mem(irg); + + if (confirm) { + /* This node can only float up to the Confirm block */ + new_mem = new_r_Pin(get_nodes_block(confirm), new_mem); + } + set_irn_pinned(div, op_pin_state_floats); + /* this is a Div without exception, we can remove the memory edge */ + set_Div_mem(div, new_mem); + return res; + } } } return proj; -} /* transform_node_Proj_CopyB */ +} /** - * Optimize Bounds(idx, idx, upper) into idx. + * Transform a Proj(Mod) with a non-zero value. + * Removes the exceptions and routes the memory to the NoMem node. */ -static ir_node *transform_node_Proj_Bound(ir_node *proj) +static ir_node *transform_node_Proj_Mod(ir_node *proj) { - ir_node *oldn = proj; - ir_node *bound = get_Proj_pred(proj); - ir_node *idx = get_Bound_index(bound); - ir_node *pred = skip_Proj(idx); - int ret_tuple = 0; + ir_node *mod = get_Proj_pred(proj); + ir_node *b = get_Mod_right(mod); + ir_node *res, *new_mem; + const ir_node *confirm; + long proj_nr; - if (idx == get_Bound_lower(bound)) - ret_tuple = 1; - else if (is_Bound(pred)) { - /* - * idx was Bounds checked previously, it is still valid if - * lower <= pred_lower && pred_upper <= upper. - */ - ir_node *lower = get_Bound_lower(bound); - ir_node *upper = get_Bound_upper(bound); - if (get_Bound_lower(pred) == lower && - get_Bound_upper(pred) == upper) { - /* - * One could expect that we simply return the previous - * Bound here. However, this would be wrong, as we could - * add an exception Proj to a new location then. - * So, we must turn in into a tuple. - */ - ret_tuple = 1; + if (value_not_zero(b, &confirm)) { + /* mod(x, y) && y != 0 */ + proj_nr = get_Proj_proj(proj); + + if (confirm == NULL) { + /* we are sure we have a Const != 0 */ + new_mem = get_Mod_mem(mod); + new_mem = skip_Pin(new_mem); + set_Mod_mem(mod, new_mem); + set_irn_pinned(mod, op_pin_state_floats); } - } - if (ret_tuple) { - /* Turn Bound into a tuple (mem, jmp, bad, idx) */ - switch (get_Proj_proj(proj)) { - case pn_Bound_M: - DBG_OPT_EXC_REM(proj); - proj = get_Bound_mem(bound); - break; - case pn_Bound_X_except: - DBG_OPT_EXC_REM(proj); - proj = get_irg_bad(get_irn_irg(proj)); - break; - case pn_Bound_res: - proj = idx; - DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP); - break; - case pn_Bound_X_regular: + + switch (proj_nr) { + + case pn_Mod_X_regular: + return new_r_Jmp(get_nodes_block(mod)); + + case pn_Mod_X_except: { + ir_graph *irg = get_irn_irg(proj); + /* we found an exception handler, remove it */ DBG_OPT_EXC_REM(proj); - proj = new_r_Jmp(get_nodes_block(bound)); - break; - default: - break; + return new_r_Bad(irg, mode_X); + } + + case pn_Mod_M: { + ir_graph *irg = get_irn_irg(proj); + res = get_Mod_mem(mod); + new_mem = get_irg_no_mem(irg); + + if (confirm) { + /* This node can only float up to the Confirm block */ + new_mem = new_r_Pin(get_nodes_block(confirm), new_mem); + } + /* this is a Mod without exception, we can remove the memory edge */ + set_Mod_mem(mod, new_mem); + return res; + } + case pn_Mod_res: + if (get_Mod_left(mod) == b) { + /* a % a = 0 if a != 0 */ + ir_graph *irg = get_irn_irg(proj); + ir_mode *mode = get_irn_mode(proj); + ir_node *res = new_r_Const(irg, get_mode_null(mode)); + + DBG_OPT_CSTEVAL(mod, res); + return res; + } } } return proj; -} /* transform_node_Proj_Bound */ +} /** - * Does all optimizations on nodes that must be done on its Projs - * because of creating new nodes. + * return true if the operation returns a value with exactly 1 bit set */ -static ir_node *transform_node_Proj(ir_node *proj) +static bool is_single_bit(const ir_node *node) { - ir_node *n = get_Proj_pred(proj); + /* a first implementation, could be extended with vrp and others... */ + if (is_Shl(node)) { + ir_node *shl_l = get_Shl_left(node); + ir_mode *mode = get_irn_mode(node); + int modulo = get_mode_modulo_shift(mode); + /* this works if we shift a 1 and we have modulo shift */ + if (is_Const(shl_l) && is_Const_one(shl_l) + && 0 < modulo && modulo <= (int)get_mode_size_bits(mode)) { + return true; + } + } else if (is_Const(node)) { + ir_tarval *tv = get_Const_tarval(node); + return tarval_is_single_bit(tv); + } + return false; +} - if (n->op->ops.transform_node_Proj) - return n->op->ops.transform_node_Proj(proj); - return proj; -} /* transform_node_Proj */ +/** + * checks if node just flips a bit in another node and returns that other node + * if so. @p tv should be a value having just 1 bit set + */ +static ir_node *flips_bit(const ir_node *node, ir_tarval *tv) +{ + if (is_Not(node)) + return get_Not_op(node); + if (is_Eor(node)) { + ir_node *right = get_Eor_right(node); + if (is_Const(right)) { + ir_tarval *right_tv = get_Const_tarval(right); + ir_mode *mode = get_irn_mode(node); + if (tarval_and(right_tv, tv) != get_mode_null(mode)) + return get_Eor_left(node); + } + } + return NULL; +} -static ir_node *transform_node_Phi(ir_node *phi) +/** + * Normalizes and optimizes Cmp nodes. + */ +static ir_node *transform_node_Cmp(ir_node *n) { - int n = get_irn_arity(phi); - ir_mode *mode = get_irn_mode(phi); - ir_node *block = get_nodes_block(phi); - ir_graph *irg = get_irn_irg(phi); - ir_node *bad = get_irg_bad(irg); - int i; + ir_node *left = get_Cmp_left(n); + ir_node *right = get_Cmp_right(n); + ir_mode *mode = get_irn_mode(left); + ir_tarval *tv = NULL; + bool changed = false; + bool changedc = false; + ir_relation relation = get_Cmp_relation(n); + ir_relation possible = ir_get_possible_cmp_relations(left, right); - /* Set phi-operands for bad-block inputs to bad */ - for (i = 0; i < n; ++i) { - ir_node *pred = get_Block_cfgpred(block, i); - if (!is_Bad(pred)) - continue; - set_irn_n(phi, i, bad); + /* mask out impossible relations */ + ir_relation new_relation = relation & possible; + if (new_relation != relation) { + relation = new_relation; + changed = true; } - /* Move Confirms down through Phi nodes. */ - if (mode_is_reference(mode)) { - n = get_irn_arity(phi); + /* Remove unnecessary conversions */ + if (is_Conv(left) && is_Conv(right)) { + ir_node *op_left = get_Conv_op(left); + ir_node *op_right = get_Conv_op(right); + ir_mode *mode_left = get_irn_mode(op_left); + ir_mode *mode_right = get_irn_mode(op_right); - /* Beware of Phi0 */ - if (n > 0) { - ir_node *pred = get_irn_n(phi, 0); - ir_node *bound, *new_phi, *block, **in; - ir_relation relation; + if (smaller_mode(mode_left, mode) && smaller_mode(mode_right, mode) + && mode_left != mode_b && mode_right != mode_b) { + ir_node *block = get_nodes_block(n); - if (! is_Confirm(pred)) - return phi; + if (mode_left == mode_right) { + left = op_left; + right = op_right; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV_CONV); + } else if (smaller_mode(mode_left, mode_right)) { + left = new_r_Conv(block, op_left, mode_right); + right = op_right; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); + } else if (smaller_mode(mode_right, mode_left)) { + left = op_left; + right = new_r_Conv(block, op_right, mode_left); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); + } + mode = get_irn_mode(left); + } + } + if (is_Conv(left) && is_Const(right)) { + ir_node *op_left = get_Conv_op(left); + ir_mode *mode_left = get_irn_mode(op_left); + if (smaller_mode(mode_left, mode) && mode_left != mode_b) { + ir_tarval *tv = get_Const_tarval(right); + tarval_int_overflow_mode_t last_mode + = tarval_get_integer_overflow_mode(); + ir_tarval *new_tv; + tarval_set_integer_overflow_mode(TV_OVERFLOW_BAD); + new_tv = tarval_convert_to(tv, mode_left); + tarval_set_integer_overflow_mode(last_mode); + if (new_tv != tarval_bad) { + ir_graph *irg = get_irn_irg(n); + left = op_left; + right = new_r_Const(irg, new_tv); + mode = get_irn_mode(left); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); + } + } + } - bound = get_Confirm_bound(pred); - relation = get_Confirm_relation(pred); + /* + * Optimize -a CMP -b into b CMP a. + * This works only for modes where unary Minus cannot Overflow. + * Note that two-complement integers can Overflow so it will NOT work. + */ + if (!mode_overflow_on_unary_Minus(mode) && + is_Minus(left) && is_Minus(right)) { + left = get_Minus_op(left); + right = get_Minus_op(right); + relation = get_inversed_relation(relation); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } - NEW_ARR_A(ir_node *, in, n); - in[0] = get_Confirm_value(pred); + /* remove operation on both sides if possible */ + if (relation == ir_relation_equal || relation == ir_relation_less_greater) { + /* + * The following operations are NOT safe for floating point operations, for instance + * 1.0 + inf == 2.0 + inf, =/=> x == y + */ + if (mode_is_int(mode)) { + unsigned lop = get_irn_opcode(left); - for (i = 1; i < n; ++i) { - pred = get_irn_n(phi, i); + if (lop == get_irn_opcode(right)) { + ir_node *ll, *lr, *rl, *rr; + + /* same operation on both sides, try to remove */ + switch (lop) { + case iro_Not: + case iro_Minus: + /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */ + left = get_unop_op(left); + right = get_unop_op(right); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + break; + case iro_Add: + ll = get_Add_left(left); + lr = get_Add_right(left); + rl = get_Add_left(right); + rr = get_Add_right(right); + + if (ll == rl) { + /* X + a CMP X + b ==> a CMP b */ + left = lr; + right = rr; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } else if (ll == rr) { + /* X + a CMP b + X ==> a CMP b */ + left = lr; + right = rl; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } else if (lr == rl) { + /* a + X CMP X + b ==> a CMP b */ + left = ll; + right = rr; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } else if (lr == rr) { + /* a + X CMP b + X ==> a CMP b */ + left = ll; + right = rl; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } + break; + case iro_Sub: + ll = get_Sub_left(left); + lr = get_Sub_right(left); + rl = get_Sub_left(right); + rr = get_Sub_right(right); + + if (ll == rl) { + /* X - a CMP X - b ==> a CMP b */ + left = lr; + right = rr; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } else if (lr == rr) { + /* a - X CMP b - X ==> a CMP b */ + left = ll; + right = rl; + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } + break; + case iro_Rotl: + if (get_Rotl_right(left) == get_Rotl_right(right)) { + /* a ROTL X CMP b ROTL X ==> a CMP b */ + left = get_Rotl_left(left); + right = get_Rotl_left(right); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } + break; + default: + break; + } + } + + /* X+A == A, A+X == A, A-X == A -> X == 0 */ + if (is_Add(left) || is_Sub(left) || is_Or_Eor_Add(left)) { + ir_node *ll = get_binop_left(left); + ir_node *lr = get_binop_right(left); + + if (lr == right && (is_Add(left) || is_Or_Eor_Add(left))) { + ir_node *tmp = ll; + ll = lr; + lr = tmp; + } + if (ll == right) { + ir_graph *irg = get_irn_irg(n); + left = lr; + right = create_zero_const(irg, mode); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } + } + if (is_Add(right) || is_Sub(right) || is_Or_Eor_Add(right)) { + ir_node *rl = get_binop_left(right); + ir_node *rr = get_binop_right(right); + + if (rr == left && (is_Add(right) || is_Or_Eor_Add(right))) { + ir_node *tmp = rl; + rl = rr; + rr = tmp; + } + if (rl == left) { + ir_graph *irg = get_irn_irg(n); + left = rr; + right = create_zero_const(irg, mode); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); + } + } + + if (is_And(left) && is_Const(right)) { + ir_node *ll = get_binop_left(left); + ir_node *lr = get_binop_right(left); + if (is_Shr(ll) && is_Const(lr)) { + /* Cmp((x >>u c1) & c2, c3) = Cmp(x & (c2 << c1), c3 << c1) */ + ir_node *block = get_nodes_block(n); + ir_mode *mode = get_irn_mode(left); + + ir_node *llr = get_Shr_right(ll); + if (is_Const(llr)) { + dbg_info *dbg = get_irn_dbg_info(left); + ir_graph *irg = get_irn_irg(left); + + ir_tarval *c1 = get_Const_tarval(llr); + ir_tarval *c2 = get_Const_tarval(lr); + ir_tarval *c3 = get_Const_tarval(right); + ir_tarval *mask = tarval_shl(c2, c1); + ir_tarval *value = tarval_shl(c3, c1); - if (! is_Confirm(pred) || - get_Confirm_bound(pred) != bound || - get_Confirm_relation(pred) != relation) - return phi; - in[i] = get_Confirm_value(pred); + left = new_rd_And(dbg, block, get_Shr_left(ll), new_r_Const(irg, mask), mode); + right = new_r_Const(irg, value); + changed = true; + } + } + } + /* Cmp(Eor(x, y), 0) <=> Cmp(x, y) at least for the ==0,!=0 + * cases */ + if (is_Const(right) && is_Const_null(right) && + (is_Eor(left) || is_Or_Eor_Add(left))) { + right = get_Eor_right(left); + left = get_Eor_left(left); + changed = true; } - /* move the Confirm nodes "behind" the Phi */ - block = get_irn_n(phi, -1); - new_phi = new_r_Phi(block, n, in, get_irn_mode(phi)); - return new_r_Confirm(block, new_phi, bound, relation); } } - return phi; -} - -/** - * Returns the operands of a commutative bin-op, if one operand is - * a const, it is returned as the second one. - */ -static void get_comm_Binop_Ops(ir_node *binop, ir_node **a, ir_node **c) -{ - ir_node *op_a = get_binop_left(binop); - ir_node *op_b = get_binop_right(binop); - assert(is_op_commutative(get_irn_op(binop))); + if (mode_is_int(mode) && is_And(left)) { + /* a complicated Cmp(And(1bit, val), 1bit) "bit-testing" can be replaced + * by the simpler Cmp(And(1bit, val), 0) negated pnc */ + if (relation == ir_relation_equal + || (mode_is_signed(mode) && relation == ir_relation_less_greater) + || (!mode_is_signed(mode) && (relation & ir_relation_less_equal) == ir_relation_less)) { + ir_node *and0 = get_And_left(left); + ir_node *and1 = get_And_right(left); + if (and1 == right) { + ir_node *tmp = and0; + and0 = and1; + and1 = tmp; + } + if (and0 == right && is_single_bit(and0)) { + ir_graph *irg = get_irn_irg(n); + relation = + relation == ir_relation_equal ? ir_relation_less_greater + : ir_relation_equal; + right = create_zero_const(irg, mode); + changed |= 1; + goto is_bittest; + } + } - if (is_Const(op_a)) { - *a = op_b; - *c = op_a; - } else { - *a = op_a; - *c = op_b; + if (is_Const(right) && is_Const_null(right) && + (relation == ir_relation_equal + || (relation == ir_relation_less_greater) + || (!mode_is_signed(mode) && relation == ir_relation_greater))) { +is_bittest: { + /* instead of flipping the bit before the bit-test operation negate + * pnc */ + ir_node *and0 = get_And_left(left); + ir_node *and1 = get_And_right(left); + if (is_Const(and1)) { + ir_tarval *tv = get_Const_tarval(and1); + if (tarval_is_single_bit(tv)) { + ir_node *flipped = flips_bit(and0, tv); + if (flipped != NULL) { + dbg_info *dbgi = get_irn_dbg_info(left); + ir_node *block = get_nodes_block(left); + relation = get_negated_relation(relation); + left = new_rd_And(dbgi, block, flipped, and1, mode); + changed |= 1; + } + } + } + } + } } -} /* get_comm_Binop_Ops */ -/** - * Optimize a Or(And(Or(And(v,c4),c3),c2),c1) pattern if possible. - * Such pattern may arise in bitfield stores. - * - * value c4 value c4 & c2 - * AND c3 AND c1 | c3 - * OR c2 ===> OR - * AND c1 - * OR - * - * - * value c2 value c1 - * AND c1 ===> OR if (c1 | c2) == 0x111..11 - * OR - */ -static ir_node *transform_node_Or_bf_store(ir_node *irn_or) -{ - ir_node *irn_and, *c1; - ir_node *or_l, *c2; - ir_node *and_l, *c3; - ir_node *value, *c4; - ir_node *new_and, *new_const, *block; - ir_mode *mode = get_irn_mode(irn_or); + /* replace mode_b compares with ands/ors */ + if (mode == mode_b) { + ir_node *block = get_nodes_block(n); + ir_node *bres; - ir_tarval *tv1, *tv2, *tv3, *tv4, *tv; + switch (relation) { + case ir_relation_less_equal: + bres = new_r_Or(block, new_r_Not(block, left, mode_b), right, mode_b); + break; + case ir_relation_less: + bres = new_r_And(block, new_r_Not(block, left, mode_b), right, mode_b); + break; + case ir_relation_greater_equal: + bres = new_r_Or(block, left, new_r_Not(block, right, mode_b), mode_b); + break; + case ir_relation_greater: + bres = new_r_And(block, left, new_r_Not(block, right, mode_b), mode_b); + break; + case ir_relation_less_greater: + bres = new_r_Eor(block, left, right, mode_b); + break; + case ir_relation_equal: + bres = new_r_Not(block, new_r_Eor(block, left, right, mode_b), mode_b); + break; + default: +#ifdef DEBUG_libfirm + ir_fprintf(stderr, "Optimisation warning, unexpected mode_b Cmp %+F\n", n); +#endif + bres = NULL; + } + if (bres != NULL) { + DBG_OPT_ALGSIM0(n, bres, FS_OPT_CMP_TO_BOOL); + return bres; + } + } - for (;;) { - ir_graph *irg; - get_comm_Binop_Ops(irn_or, &irn_and, &c1); - if (!is_Const(c1) || !is_And(irn_and)) - return irn_or; + /* + * First step: normalize the compare op + * by placing the constant on the right side + * or moving the lower address node to the left. + */ + if (!operands_are_normalized(left, right)) { + ir_node *t = left; + left = right; + right = t; - get_comm_Binop_Ops(irn_and, &or_l, &c2); - if (!is_Const(c2)) - return irn_or; + relation = get_inversed_relation(relation); + changed = true; + } - tv1 = get_Const_tarval(c1); - tv2 = get_Const_tarval(c2); + /* + * Second step: Try to reduce the magnitude + * of a constant. This may help to generate better code + * later and may help to normalize more compares. + * Of course this is only possible for integer values. + */ + tv = value_of(right); + if (tv != tarval_bad) { + ir_mode *mode = get_irn_mode(right); - tv = tarval_or(tv1, tv2); - if (tarval_is_all_one(tv)) { - /* the AND does NOT clear a bit with isn't set by the OR */ - set_Or_left(irn_or, or_l); - set_Or_right(irn_or, c1); + /* cmp(mux(x, cf, ct), c2) can be eliminated: + * cmp(ct,c2) | cmp(cf,c2) | result + * -----------|------------|-------- + * true | true | True + * false | false | False + * true | false | x + * false | true | not(x) + */ + if (is_Mux(left)) { + ir_node *mux_true = get_Mux_true(left); + ir_node *mux_false = get_Mux_false(left); + if (is_Const(mux_true) && is_Const(mux_false)) { + /* we can fold true/false constant separately */ + ir_tarval *tv_true = get_Const_tarval(mux_true); + ir_tarval *tv_false = get_Const_tarval(mux_false); + ir_relation r_true = tarval_cmp(tv_true, tv); + ir_relation r_false = tarval_cmp(tv_false, tv); + if (r_true != ir_relation_false + || r_false != ir_relation_false) { + bool rel_true = (r_true & relation) != 0; + bool rel_false = (r_false & relation) != 0; + ir_node *cond = get_Mux_sel(left); + if (rel_true == rel_false) { + relation = rel_true ? ir_relation_true + : ir_relation_false; + } else if (rel_true) { + return cond; + } else { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *notn = new_rd_Not(dbgi, block, cond, mode_b); + return notn; + } + } + } + } - /* check for more */ - continue; + /* TODO extend to arbitrary constants */ + if (is_Conv(left) && tarval_is_null(tv)) { + ir_node *op = get_Conv_op(left); + ir_mode *op_mode = get_irn_mode(op); + + /* + * UpConv(x) REL 0 ==> x REL 0 + * Don't do this for float values as it's unclear whether it is a + * win. (on the other side it makes detection/creation of fabs hard) + */ + if (get_mode_size_bits(mode) > get_mode_size_bits(op_mode) && + ((relation == ir_relation_equal || relation == ir_relation_less_greater) || + mode_is_signed(mode) || !mode_is_signed(op_mode)) && + !mode_is_float(mode)) { + tv = get_mode_null(op_mode); + left = op; + mode = op_mode; + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); + } } - if (!is_Or(or_l)) - return irn_or; + if (tv != tarval_bad) { + /* the following optimization is possible on modes without Overflow + * on Unary Minus or on == and !=: + * -a CMP c ==> a swap(CMP) -c + * + * Beware: for two-complement Overflow may occur, so only == and != can + * be optimized, see this: + * -MININT < 0 =/=> MININT > 0 !!! + */ + if (is_Minus(left) && + (!mode_overflow_on_unary_Minus(mode) || + (mode_is_int(mode) && (relation == ir_relation_equal || relation == ir_relation_less_greater)))) { + tv = tarval_neg(tv); - get_comm_Binop_Ops(or_l, &and_l, &c3); - if (!is_Const(c3) || !is_And(and_l)) - return irn_or; + if (tv != tarval_bad) { + left = get_Minus_op(left); + relation = get_inversed_relation(relation); + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); + } + } else if (is_Not(left) && (relation == ir_relation_equal || relation == ir_relation_less_greater)) { + /* Not(a) ==/!= c ==> a ==/!= Not(c) */ + tv = tarval_not(tv); - get_comm_Binop_Ops(and_l, &value, &c4); - if (!is_Const(c4)) - return irn_or; + if (tv != tarval_bad) { + left = get_Not_op(left); + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); + } + } - /* ok, found the pattern, check for conditions */ - assert(mode == get_irn_mode(irn_and)); - assert(mode == get_irn_mode(or_l)); - assert(mode == get_irn_mode(and_l)); + /* for integer modes, we have more */ + if (mode_is_int(mode) && !is_Const(left)) { + /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */ + if ((relation == ir_relation_less || relation == ir_relation_greater_equal) && + tarval_cmp(tv, get_mode_null(mode)) == ir_relation_greater) { + tv = tarval_sub(tv, get_mode_one(mode), NULL); - tv3 = get_Const_tarval(c3); - tv4 = get_Const_tarval(c4); + if (tv != tarval_bad) { + relation ^= ir_relation_equal; + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); + } + } + /* c < 0 : a > c ==> a >= (c+1) a <= c ==> a < (c+1) */ + else if ((relation == ir_relation_greater || relation == ir_relation_less_equal) && + tarval_cmp(tv, get_mode_null(mode)) == ir_relation_less) { + tv = tarval_add(tv, get_mode_one(mode)); - tv = tarval_or(tv4, tv2); - if (!tarval_is_all_one(tv)) { - /* have at least one 0 at the same bit position */ - return irn_or; - } + if (tv != tarval_bad) { + relation ^= ir_relation_equal; + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); + } + } - if (tv3 != tarval_andnot(tv3, tv4)) { - /* bit in the or_mask is outside the and_mask */ - return irn_or; - } + /* the following reassociations work only for == and != */ + if (relation == ir_relation_equal || relation == ir_relation_less_greater) { + if (tv != tarval_bad) { + /* a-c1 == c2 ==> a == c2+c1, a-c1 != c2 ==> a != c2+c1 */ + if (is_Sub(left)) { + ir_node *c1 = get_Sub_right(left); + ir_tarval *tv2 = value_of(c1); - if (tv1 != tarval_andnot(tv1, tv2)) { - /* bit in the or_mask is outside the and_mask */ - return irn_or; - } + if (tv2 != tarval_bad) { + tv2 = tarval_add(tv, value_of(c1)); - /* ok, all conditions met */ - block = get_irn_n(irn_or, -1); - irg = get_irn_irg(block); + if (tv2 != tarval_bad) { + left = get_Sub_left(left); + tv = tv2; + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); + } + } + } + /* a+c1 == c2 ==> a == c2-c1, a+c1 != c2 ==> a != c2-c1 */ + else if (is_Add(left) || is_Or_Eor_Add(left)) { + ir_node *a_l = get_binop_left(left); + ir_node *a_r = get_binop_right(left); + ir_node *a; + ir_tarval *tv2; + + if (is_Const(a_l)) { + a = a_r; + tv2 = value_of(a_l); + } else { + a = a_l; + tv2 = value_of(a_r); + } + + if (tv2 != tarval_bad) { + tv2 = tarval_sub(tv, tv2, NULL); - new_and = new_r_And(block, value, new_r_Const(irg, tarval_and(tv4, tv2)), mode); + if (tv2 != tarval_bad) { + left = a; + tv = tv2; + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); + } + } + } + /* -a == c ==> a == -c, -a != c ==> a != -c */ + else if (is_Minus(left)) { + ir_tarval *tv2 = tarval_sub(get_mode_null(mode), tv, NULL); - new_const = new_r_Const(irg, tarval_or(tv3, tv1)); + if (tv2 != tarval_bad) { + left = get_Minus_op(left); + tv = tv2; + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); + } + } + } + } + } - set_Or_left(irn_or, new_and); - set_Or_right(irn_or, new_const); + if (relation == ir_relation_equal || relation == ir_relation_less_greater) { + switch (get_irn_opcode(left)) { + ir_node *c1; - /* check for more */ - } -} /* transform_node_Or_bf_store */ + case iro_And: + c1 = get_And_right(left); + if (is_Const(c1)) { + /* + * And(x, C1) == C2 ==> FALSE if C2 & C1 != C2 + * And(x, C1) != C2 ==> TRUE if C2 & C1 != C2 + */ + ir_tarval *mask = tarval_and(get_Const_tarval(c1), tv); + if (mask != tv) { + /* TODO: move to constant evaluation */ + ir_graph *irg = get_irn_irg(n); + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); + c1 = new_r_Const(irg, tv); + DBG_OPT_CSTEVAL(n, c1); + return c1; + } -/** - * Optimize an Or(shl(x, c), shr(x, bits - c)) into a Rotl - */ -static ir_node *transform_node_Or_Rotl(ir_node *irn_or) -{ - ir_mode *mode = get_irn_mode(irn_or); - ir_node *shl, *shr, *block; - ir_node *irn, *x, *c1, *c2, *n; - ir_tarval *tv1, *tv2; + if (tarval_is_single_bit(tv)) { + /* + * optimization for AND: + * Optimize: + * And(x, C) == C ==> And(x, C) != 0 + * And(x, C) != C ==> And(X, C) == 0 + * + * if C is a single Bit constant. + */ - /* some backends can't handle rotl */ - if (!be_get_backend_param()->support_rotl) - return irn_or; + /* check for Constant's match. We have check hare the tarvals, + because our const might be changed */ + if (get_Const_tarval(c1) == tv) { + /* fine: do the transformation */ + tv = get_mode_null(get_tarval_mode(tv)); + relation ^= ir_relation_less_equal_greater; + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); + } + } + } + break; + case iro_Or: + c1 = get_Or_right(left); + if (is_Const(c1) && tarval_is_null(tv)) { + /* + * Or(x, C) == 0 && C != 0 ==> FALSE + * Or(x, C) != 0 && C != 0 ==> TRUE + */ + if (! tarval_is_null(get_Const_tarval(c1))) { + /* TODO: move to constant evaluation */ + ir_graph *irg = get_irn_irg(n); + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); + c1 = new_r_Const(irg, tv); + DBG_OPT_CSTEVAL(n, c1); + return c1; + } + } + break; + case iro_Shl: + /* + * optimize x << c1 == c into x & (-1 >>u c1) == c >> c1 if c & (-1 << c1) == c + * FALSE else + * optimize x << c1 != c into x & (-1 >>u c1) != c >> c1 if c & (-1 << c1) == c + * TRUE else + */ + c1 = get_Shl_right(left); + if (is_Const(c1)) { + ir_graph *irg = get_irn_irg(c1); + ir_tarval *tv1 = get_Const_tarval(c1); + ir_mode *mode = get_irn_mode(left); + ir_tarval *minus1 = get_mode_all_one(mode); + ir_tarval *amask = tarval_shr(minus1, tv1); + ir_tarval *cmask = tarval_shl(minus1, tv1); + ir_node *sl, *blk; - if (! mode_is_int(mode)) - return irn_or; + if (tarval_and(tv, cmask) != tv) { + /* condition not met */ + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); + c1 = new_r_Const(irg, tv); + DBG_OPT_CSTEVAL(n, c1); + return c1; + } + sl = get_Shl_left(left); + blk = get_nodes_block(n); + left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode); + tv = tarval_shr(tv, tv1); + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); + } + break; + case iro_Shr: + /* + * optimize x >>u c1 == c into x & (-1 << c1) == c << c1 if c & (-1 >>u c1) == c + * FALSE else + * optimize x >>u c1 != c into x & (-1 << c1) != c << c1 if c & (-1 >>u c1) == c + * TRUE else + */ + c1 = get_Shr_right(left); + if (is_Const(c1)) { + ir_graph *irg = get_irn_irg(c1); + ir_tarval *tv1 = get_Const_tarval(c1); + ir_mode *mode = get_irn_mode(left); + ir_tarval *minus1 = get_mode_all_one(mode); + ir_tarval *amask = tarval_shl(minus1, tv1); + ir_tarval *cmask = tarval_shr(minus1, tv1); + ir_node *sl, *blk; - shl = get_binop_left(irn_or); - shr = get_binop_right(irn_or); + if (tarval_and(tv, cmask) != tv) { + /* condition not met */ + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); + c1 = new_r_Const(irg, tv); + DBG_OPT_CSTEVAL(n, c1); + return c1; + } + sl = get_Shr_left(left); + blk = get_nodes_block(n); + left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode); + tv = tarval_shl(tv, tv1); + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); + } + break; + case iro_Shrs: + /* + * optimize x >>s c1 == c into x & (-1 << c1) == c << c1 if (c >>s (BITS - c1)) \in {0,-1} + * FALSE else + * optimize x >>s c1 != c into x & (-1 << c1) != c << c1 if (c >>s (BITS - c1)) \in {0,-1} + * TRUE else + */ + c1 = get_Shrs_right(left); + if (is_Const(c1)) { + ir_graph *irg = get_irn_irg(c1); + ir_tarval *tv1 = get_Const_tarval(c1); + ir_mode *mode = get_irn_mode(left); + ir_tarval *minus1 = get_mode_all_one(mode); + ir_tarval *amask = tarval_shl(minus1, tv1); + ir_tarval *cond = new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(tv1)); + ir_node *sl, *blk; - if (is_Shr(shl)) { - if (!is_Shl(shr)) - return irn_or; + cond = tarval_sub(cond, tv1, NULL); + cond = tarval_shrs(tv, cond); - irn = shl; - shl = shr; - shr = irn; - } else if (!is_Shl(shl)) { - return irn_or; - } else if (!is_Shr(shr)) { - return irn_or; + if (!tarval_is_all_one(cond) && !tarval_is_null(cond)) { + /* condition not met */ + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); + c1 = new_r_Const(irg, tv); + DBG_OPT_CSTEVAL(n, c1); + return c1; + } + sl = get_Shrs_left(left); + blk = get_nodes_block(n); + left = new_rd_And(get_irn_dbg_info(left), blk, sl, new_r_Const(irg, amask), mode); + tv = tarval_shl(tv, tv1); + changedc = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); + } + break; + } + } + } } - x = get_Shl_left(shl); - if (x != get_Shr_left(shr)) - return irn_or; - c1 = get_Shl_right(shl); - c2 = get_Shr_right(shr); - if (is_Const(c1) && is_Const(c2)) { - tv1 = get_Const_tarval(c1); - if (! tarval_is_long(tv1)) - return irn_or; + if (changedc) { /* need a new Const */ + ir_graph *irg = get_irn_irg(n); + right = new_r_Const(irg, tv); + changed = true; + } - tv2 = get_Const_tarval(c2); - if (! tarval_is_long(tv2)) - return irn_or; + if ((relation == ir_relation_equal || relation == ir_relation_less_greater) && is_Const(right) && is_Const_null(right) && is_Proj(left)) { + ir_node *op = get_Proj_pred(left); - if (get_tarval_long(tv1) + get_tarval_long(tv2) - != (int) get_mode_size_bits(mode)) - return irn_or; + if (is_Mod(op) && get_Proj_proj(left) == pn_Mod_res) { + ir_node *c = get_binop_right(op); - /* yet, condition met */ - block = get_nodes_block(irn_or); + if (is_Const(c)) { + ir_tarval *tv = get_Const_tarval(c); - n = new_r_Rotl(block, x, c1, mode); + if (tarval_is_single_bit(tv)) { + /* special case: (x % 2^n) CMP 0 ==> x & (2^n-1) CMP 0 */ + ir_node *v = get_binop_left(op); + ir_node *blk = get_nodes_block(op); + ir_graph *irg = get_irn_irg(op); + ir_mode *mode = get_irn_mode(v); - DBG_OPT_ALGSIM1(irn_or, shl, shr, n, FS_OPT_OR_SHFT_TO_ROTL); - return n; + tv = tarval_sub(tv, get_mode_one(mode), NULL); + left = new_rd_And(get_irn_dbg_info(op), blk, v, new_r_Const(irg, tv), mode); + changed = true; + DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_MOD_TO_AND); + } + } + } } - /* Note: the obvious rot formulation (a << x) | (a >> (32-x)) gets - * transformed to (a << x) | (a >> -x) by transform_node_shift_modulo() */ - if (!ir_is_negated_value(c1, c2)) { - return irn_or; + if (changed) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + + /* create a new compare */ + n = new_rd_Cmp(dbgi, block, left, right, relation); } - /* yet, condition met */ - block = get_nodes_block(irn_or); - n = new_r_Rotl(block, x, c1, mode); - DBG_OPT_ALGSIM0(irn_or, n, FS_OPT_OR_SHFT_TO_ROTL); return n; -} /* transform_node_Or_Rotl */ +} -static bool is_cmp_unequal_zero(const ir_node *node) +/** + * Optimize CopyB(mem, x, x) into a Nop. + */ +static ir_node *transform_node_Proj_CopyB(ir_node *proj) { - ir_relation relation = get_Cmp_relation(node); - ir_node *left = get_Cmp_left(node); - ir_node *right = get_Cmp_right(node); - ir_mode *mode = get_irn_mode(left); + ir_node *copyb = get_Proj_pred(proj); + ir_node *a = get_CopyB_dst(copyb); + ir_node *b = get_CopyB_src(copyb); - if (!is_Const(right) || !is_Const_null(right)) - return false; - if (mode_is_signed(mode)) { - return relation == ir_relation_less_greater; - } else { - return relation == ir_relation_greater; + if (a == b) { + switch (get_Proj_proj(proj)) { + case pn_CopyB_X_regular: + /* Turn CopyB into a tuple (mem, jmp, bad, bad) */ + DBG_OPT_EXC_REM(proj); + proj = new_r_Jmp(get_nodes_block(copyb)); + break; + case pn_CopyB_X_except: { + ir_graph *irg = get_irn_irg(proj); + DBG_OPT_EXC_REM(proj); + proj = new_r_Bad(irg, mode_X); + break; + } + default: + break; + } } + return proj; } /** - * Transform an Or. + * Optimize Bounds(idx, idx, upper) into idx. */ -static ir_node *transform_node_Or(ir_node *n) +static ir_node *transform_node_Proj_Bound(ir_node *proj) { - ir_node *c, *oldn = n; - ir_node *a = get_Or_left(n); - ir_node *b = get_Or_right(n); - ir_mode *mode; - - if (is_Not(a) && is_Not(b)) { - /* ~a | ~b = ~(a&b) */ - ir_node *block = get_nodes_block(n); - - mode = get_irn_mode(n); - a = get_Not_op(a); - b = get_Not_op(b); - n = new_rd_And(get_irn_dbg_info(n), block, a, b, mode); - n = new_rd_Not(get_irn_dbg_info(n), block, n, mode); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_DEMORGAN); - return n; - } + ir_node *oldn = proj; + ir_node *bound = get_Proj_pred(proj); + ir_node *idx = get_Bound_index(bound); + ir_node *pred = skip_Proj(idx); + int ret_tuple = 0; - /* we can combine the relations of two compares with the same operands */ - if (is_Cmp(a) && is_Cmp(b)) { - ir_node *a_left = get_Cmp_left(a); - ir_node *a_right = get_Cmp_left(a); - ir_node *b_left = get_Cmp_left(b); - ir_node *b_right = get_Cmp_right(b); - if (a_left == b_left && b_left == b_right) { - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_relation a_relation = get_Cmp_relation(a); - ir_relation b_relation = get_Cmp_relation(b); - ir_relation new_relation = a_relation | b_relation; - return new_rd_Cmp(dbgi, block, a_left, a_right, new_relation); + if (idx == get_Bound_lower(bound)) + ret_tuple = 1; + else if (is_Bound(pred)) { + /* + * idx was Bounds checked previously, it is still valid if + * lower <= pred_lower && pred_upper <= upper. + */ + ir_node *lower = get_Bound_lower(bound); + ir_node *upper = get_Bound_upper(bound); + if (get_Bound_lower(pred) == lower && + get_Bound_upper(pred) == upper) { + /* + * One could expect that we simply return the previous + * Bound here. However, this would be wrong, as we could + * add an exception Proj to a new location then. + * So, we must turn in into a tuple. + */ + ret_tuple = 1; } - /* Cmp(a!=0) or Cmp(b!=0) => Cmp(a|b != 0) */ - if (is_cmp_unequal_zero(a) && is_cmp_unequal_zero(b) - && !mode_is_float(get_irn_mode(a_left)) - && !mode_is_float(get_irn_mode(b_left))) { - ir_graph *irg = get_irn_irg(n); - dbg_info *dbgi = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); - ir_mode *mode = get_irn_mode(a_left); - ir_node *n_b_left = get_irn_mode(b_left) != mode ? - new_rd_Conv(dbgi, block, b_left, mode) : b_left; - ir_node *or = new_rd_Or(dbgi, block, a_left, n_b_left, mode); - ir_node *zero = create_zero_const(irg, mode); - return new_rd_Cmp(dbgi, block, or, zero, ir_relation_less_greater); + } + if (ret_tuple) { + /* Turn Bound into a tuple (mem, jmp, bad, idx) */ + switch (get_Proj_proj(proj)) { + case pn_Bound_M: + DBG_OPT_EXC_REM(proj); + proj = get_Bound_mem(bound); + break; + case pn_Bound_X_except: + DBG_OPT_EXC_REM(proj); + proj = new_r_Bad(get_irn_irg(proj), mode_X); + break; + case pn_Bound_res: + proj = idx; + DBG_OPT_ALGSIM0(oldn, proj, FS_OPT_NOP); + break; + case pn_Bound_X_regular: + DBG_OPT_EXC_REM(proj); + proj = new_r_Jmp(get_nodes_block(bound)); + break; + default: + break; } } + return proj; +} - mode = get_irn_mode(n); - HANDLE_BINOP_PHI((eval_func) tarval_or, a, b, c, mode); - - n = transform_node_Or_bf_store(n); - n = transform_node_Or_Rotl(n); - if (n != oldn) - return n; - - n = transform_bitwise_distributive(n, transform_node_Or); - - return n; -} /* transform_node_Or */ - +/** + * Does all optimizations on nodes that must be done on its Projs + * because of creating new nodes. + */ +static ir_node *transform_node_Proj(ir_node *proj) +{ + ir_node *n = get_Proj_pred(proj); -/* forward */ -static ir_node *transform_node(ir_node *n); + if (n->op->ops.transform_node_Proj) + return n->op->ops.transform_node_Proj(proj); + return proj; +} /** - * Optimize (a >> c1) >> c2), works for Shr, Shrs, Shl, Rotl. - * - * Should be moved to reassociation? + * Test whether a block is unreachable + * Note: That this only returns true when + * IR_GRAPH_CONSTRAINT_OPTIMIZE_UNREACHABLE_CODE is set. + * This is important, as you easily end up producing invalid constructs in the + * unreachable code when optimizing away edges into the unreachable code. + * So only set this flag when you iterate localopts to the fixpoint. + * When you reach the fixpoint then all unreachable code is dead + * (= can't be reached by firm edges) and you won't see the invalid constructs + * anymore. */ -static ir_node *transform_node_shift(ir_node *n) +static bool is_block_unreachable(const ir_node *block) { - ir_node *left, *right; - ir_mode *mode; - ir_tarval *tv1, *tv2, *res; - ir_node *in[2], *irn, *block; - ir_graph *irg; + const ir_graph *irg = get_irn_irg(block); + if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_OPTIMIZE_UNREACHABLE_CODE)) + return false; + return get_Block_dom_depth(block) < 0; +} - left = get_binop_left(n); +static ir_node *transform_node_Block(ir_node *block) +{ + ir_graph *irg = get_irn_irg(block); + int arity = get_irn_arity(block); + ir_node *bad = NULL; + int i; - /* different operations */ - if (get_irn_op(left) != get_irn_op(n)) - return n; + if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_OPTIMIZE_UNREACHABLE_CODE)) + return block; - right = get_binop_right(n); - tv1 = value_of(right); - if (tv1 == tarval_bad) - return n; + for (i = 0; i < arity; ++i) { + ir_node *const pred = get_Block_cfgpred(block, i); + if (is_Bad(pred) || !is_block_unreachable(get_nodes_block(pred))) + continue; + if (bad == NULL) + bad = new_r_Bad(irg, mode_X); + set_irn_n(block, i, bad); + } - tv2 = value_of(get_binop_right(left)); - if (tv2 == tarval_bad) - return n; + return block; +} - res = tarval_add(tv1, tv2); - mode = get_irn_mode(n); - irg = get_irn_irg(n); +static ir_node *transform_node_Phi(ir_node *phi) +{ + int n = get_irn_arity(phi); + ir_mode *mode = get_irn_mode(phi); + ir_node *block = get_nodes_block(phi); + ir_graph *irg = get_irn_irg(phi); + ir_node *bad = NULL; + int i; - /* beware: a simple replacement works only, if res < modulo shift */ - if (!is_Rotl(n)) { - int modulo_shf = get_mode_modulo_shift(mode); - if (modulo_shf > 0) { - ir_tarval *modulo = new_tarval_from_long(modulo_shf, - get_tarval_mode(res)); + /* Set phi-operands for bad-block inputs to bad */ + for (i = 0; i < n; ++i) { + if (!is_Bad(get_Phi_pred(phi, i))) { + ir_node *pred = get_Block_cfgpred(block, i); + if (is_Bad(pred) || is_block_unreachable(get_nodes_block(pred))) { + if (bad == NULL) + bad = new_r_Bad(irg, mode); + set_irn_n(phi, i, bad); + } + } + } - assert(modulo_shf >= (int) get_mode_size_bits(mode)); + /* Move Pin nodes down through Phi nodes. */ + if (mode == mode_M) { + n = get_irn_arity(phi); - /* shifting too much */ - if (!(tarval_cmp(res, modulo) & ir_relation_less)) { - if (is_Shrs(n)) { - ir_node *block = get_nodes_block(n); - dbg_info *dbgi = get_irn_dbg_info(n); - ir_mode *smode = get_irn_mode(right); - ir_node *cnst = new_r_Const_long(irg, smode, get_mode_size_bits(mode) - 1); - return new_rd_Shrs(dbgi, block, get_binop_left(left), cnst, mode); - } + /* Beware of Phi0 */ + if (n > 0) { + ir_node **in; + ir_node *new_phi; + bool has_pin = false; + + NEW_ARR_A(ir_node *, in, n); + + for (i = 0; i < n; ++i) { + ir_node *pred = get_irn_n(phi, i); - return new_r_Const(irg, get_mode_null(mode)); + if (is_Pin(pred)) { + in[i] = get_Pin_op(pred); + has_pin = true; + } else if (is_Bad(pred)) { + in[i] = pred; + } else { + return phi; + } } + + if (!has_pin) + return phi; + + /* Move the Pin nodes "behind" the Phi. */ + new_phi = new_r_Phi(block, n, in, mode_M); + return new_r_Pin(block, new_phi); } - } else { - res = tarval_mod(res, new_tarval_from_long(get_mode_size_bits(mode), get_tarval_mode(res))); } + /* Move Confirms down through Phi nodes. */ + else if (mode_is_reference(mode)) { + n = get_irn_arity(phi); - /* ok, we can replace it */ - block = get_nodes_block(n); + /* Beware of Phi0 */ + if (n > 0) { + ir_node *pred = get_irn_n(phi, 0); + ir_node *bound, *new_phi, **in; + ir_relation relation; + bool has_confirm = false; - in[0] = get_binop_left(left); - in[1] = new_r_Const(irg, res); + if (! is_Confirm(pred)) + return phi; - irn = new_ir_node(NULL, get_Block_irg(block), block, get_irn_op(n), mode, 2, in); + bound = get_Confirm_bound(pred); + relation = get_Confirm_relation(pred); - DBG_OPT_ALGSIM0(n, irn, FS_OPT_REASSOC_SHIFT); + NEW_ARR_A(ir_node *, in, n); + in[0] = get_Confirm_value(pred); + + for (i = 1; i < n; ++i) { + pred = get_irn_n(phi, i); + + if (is_Confirm(pred) && + get_Confirm_bound(pred) == bound && + get_Confirm_relation(pred) == relation) { + in[i] = get_Confirm_value(pred); + has_confirm = true; + } else if (is_Bad(pred)) { + in[i] = pred; + } else { + return phi; + } + } + + if (!has_confirm) + return phi; - return transform_node(irn); -} /* transform_node_shift */ + /* move the Confirm nodes "behind" the Phi */ + new_phi = new_r_Phi(block, n, in, get_irn_mode(phi)); + return new_r_Confirm(block, new_phi, bound, relation); + } + } + return phi; +} /** - * normalisation: (x & c1) >> c2 to (x >> c2) & (c1 >> c2) - * (we can use: - * - and, or, xor instead of & - * - Shl, Shr, Shrs, rotl instead of >> - * (with a special case for Or/Xor + Shrs) - */ -static ir_node *transform_node_bitop_shift(ir_node *n) -{ - ir_node *left; - ir_node *right = get_binop_right(n); - ir_mode *mode = get_irn_mode(n); - ir_node *bitop_left; - ir_node *bitop_right; - ir_op *op_left; - ir_node *block; - dbg_info *dbgi; - ir_graph *irg; - ir_node *new_shift; - ir_node *new_bitop; - ir_node *new_const; - ir_tarval *tv1; - ir_tarval *tv2; - ir_tarval *tv_shift; + * Optimize (a >> c1) >> c2), works for Shr, Shrs, Shl, Rotl. + * + * Should be moved to reassociation? + */ +static ir_node *transform_node_shift(ir_node *n) +{ + ir_node *left, *right; + ir_mode *mode; + ir_mode *count_mode; + ir_tarval *tv1, *tv2, *res; + ir_node *in[2], *irn, *block; + ir_graph *irg; + int modulo_shf; - assert(is_Shrs(n) || is_Shr(n) || is_Shl(n) || is_Rotl(n)); + left = get_binop_left(n); - if (!is_Const(right)) + /* different operations */ + if (get_irn_op(left) != get_irn_op(n)) return n; - left = get_binop_left(n); - op_left = get_irn_op(left); - if (op_left != op_And && op_left != op_Or && op_left != op_Eor) + right = get_binop_right(n); + tv1 = value_of(right); + if (tv1 == tarval_bad) return n; - /* doing it with Shrs is not legal if the Or/Eor affects the topmost bit */ - if (is_Shrs(n) && (op_left == op_Or || op_left == op_Eor)) { - /* TODO: test if sign bit is affectes */ + tv2 = value_of(get_binop_right(left)); + if (tv2 == tarval_bad) return n; - } - bitop_right = get_binop_right(left); - if (!is_Const(bitop_right)) + count_mode = get_tarval_mode(tv1); + if (get_tarval_mode(tv2) != count_mode) { + /* TODO: search bigger mode or something and convert... */ return n; + } - bitop_left = get_binop_left(left); + mode = get_irn_mode(n); + modulo_shf = get_mode_modulo_shift(mode); - block = get_nodes_block(n); - dbgi = get_irn_dbg_info(n); - tv1 = get_Const_tarval(bitop_right); - tv2 = get_Const_tarval(right); + if (modulo_shf > 0) { + ir_tarval *modulo_mask = new_tarval_from_long(modulo_shf-1, count_mode); - assert(get_tarval_mode(tv1) == mode); + /* I'm not so sure what happens in one complement... */ + assert(get_mode_arithmetic(count_mode) == irma_twos_complement); + /* modulo shifts should always be a power of 2 (otherwise modulo_mask + * above will be invalid) */ + assert(modulo_shf<=0 || is_po2(modulo_shf)); - if (is_Shl(n)) { - new_shift = new_rd_Shl(dbgi, block, bitop_left, right, mode); - tv_shift = tarval_shl(tv1, tv2); - } else if (is_Shr(n)) { - new_shift = new_rd_Shr(dbgi, block, bitop_left, right, mode); - tv_shift = tarval_shr(tv1, tv2); - } else if (is_Shrs(n)) { - new_shift = new_rd_Shrs(dbgi, block, bitop_left, right, mode); - tv_shift = tarval_shrs(tv1, tv2); - } else { - assert(is_Rotl(n)); - new_shift = new_rd_Rotl(dbgi, block, bitop_left, right, mode); - tv_shift = tarval_rotl(tv1, tv2); + tv1 = tarval_and(tv1, modulo_mask); + tv2 = tarval_and(tv2, modulo_mask); } + res = tarval_add(tv1, tv2); + irg = get_irn_irg(n); - assert(get_tarval_mode(tv_shift) == mode); - irg = get_irn_irg(n); - new_const = new_r_Const(irg, tv_shift); - - if (op_left == op_And) { - new_bitop = new_rd_And(dbgi, block, new_shift, new_const, mode); - } else if (op_left == op_Or) { - new_bitop = new_rd_Or(dbgi, block, new_shift, new_const, mode); + /* beware: a simple replacement works only, if res < modulo shift */ + if (is_Rotl(n)) { + int bits = get_mode_size_bits(mode); + ir_tarval *modulo = new_tarval_from_long(bits, count_mode); + res = tarval_mod(res, modulo); } else { - assert(op_left == op_Eor); - new_bitop = new_rd_Eor(dbgi, block, new_shift, new_const, mode); + long bits = get_mode_size_bits(mode); + ir_tarval *mode_size = new_tarval_from_long(bits, count_mode); + + /* shifting too much */ + if (!(tarval_cmp(res, mode_size) & ir_relation_less)) { + if (is_Shrs(n)) { + ir_node *block = get_nodes_block(n); + dbg_info *dbgi = get_irn_dbg_info(n); + ir_mode *smode = get_irn_mode(right); + ir_node *cnst = new_r_Const_long(irg, smode, get_mode_size_bits(mode) - 1); + return new_rd_Shrs(dbgi, block, get_binop_left(left), cnst, mode); + } + + return new_r_Const(irg, get_mode_null(mode)); + } } - return new_bitop; + /* ok, we can replace it */ + assert(modulo_shf >= (int) get_mode_size_bits(mode)); + block = get_nodes_block(n); + + in[0] = get_binop_left(left); + in[1] = new_r_Const(irg, res); + + irn = new_ir_node(NULL, get_Block_irg(block), block, get_irn_op(n), mode, 2, in); + + DBG_OPT_ALGSIM0(n, irn, FS_OPT_REASSOC_SHIFT); + + return irn; } /** @@ -5095,7 +5378,7 @@ typedef ir_node*(*new_shift_func)(dbg_info *dbgi, ir_node *block, * then we can use that to minimize the value of Add(x, const) or * Sub(Const, x). In particular this often avoids 1 instruction in some * backends for the Shift(x, Sub(Const, y)) case because it can be replaced - * by Shift(x, Minus(y)) which doesnt't need an explicit Const constructed. + * by Shift(x, Minus(y)) which does not need an explicit Const constructed. */ static ir_node *transform_node_shift_modulo(ir_node *n, new_shift_func new_shift) @@ -5127,8 +5410,8 @@ static ir_node *transform_node_shift_modulo(ir_node *n, return n; newop = new_r_Const(irg, tv_mod); - } else if (is_Add(right)) { - ir_node *add_right = get_Add_right(right); + } else if (is_Add(right) || is_Or_Eor_Add(right)) { + ir_node *add_right = get_binop_right(right); if (is_Const(add_right)) { ir_tarval *tv = get_Const_tarval(add_right); ir_tarval *tv_mod = get_modulo_tv_value(tv, modulo); @@ -5137,7 +5420,7 @@ static ir_node *transform_node_shift_modulo(ir_node *n, return n; newconst = new_r_Const(irg, tv_mod); - newop = new_r_Add(block, get_Add_left(right), newconst, + newop = new_r_Add(block, get_binop_left(right), newconst, mode_right); } } else if (is_Sub(right)) { @@ -5183,31 +5466,60 @@ static ir_node *transform_node_Shr(ir_node *n) if (is_Shr(n)) n = transform_node_shl_shr(n); if (is_Shr(n)) - n = transform_node_bitop_shift(n); + n = transform_node_shift_bitop(n); return n; -} /* transform_node_Shr */ +} /** * Transform a Shrs. */ static ir_node *transform_node_Shrs(ir_node *n) { - ir_node *c, *oldn = n; - ir_node *a = get_Shrs_left(n); - ir_node *b = get_Shrs_right(n); - ir_mode *mode = get_irn_mode(n); + ir_node *oldn = n; + ir_node *a = get_Shrs_left(n); + ir_node *b = get_Shrs_right(n); + ir_mode *mode = get_irn_mode(n); + ir_node *c; + vrp_attr *attr; + + if (is_oversize_shift(n)) { + ir_node *block = get_nodes_block(n); + dbg_info *dbgi = get_irn_dbg_info(n); + ir_mode *cmode = get_irn_mode(b); + long val = get_mode_size_bits(cmode)-1; + ir_graph *irg = get_irn_irg(n); + ir_node *cnst = new_r_Const_long(irg, cmode, val); + return new_rd_Shrs(dbgi, block, a, cnst, mode); + } HANDLE_BINOP_PHI((eval_func) tarval_shrs, a, b, c, mode); n = transform_node_shift(n); + if (n != oldn) + return n; - if (is_Shrs(n)) - n = transform_node_shift_modulo(n, new_rd_Shrs); - if (is_Shrs(n)) - n = transform_node_bitop_shift(n); + n = transform_node_shift_modulo(n, new_rd_Shrs); + if (n != oldn) + return n; + n = transform_node_shift_bitop(n); + if (n != oldn) + return n; + + /* normalisation: use Shr when sign bit is guaranteed to be cleared */ + attr = vrp_get_info(a); + if (attr != NULL) { + unsigned bits = get_mode_size_bits(mode); + ir_tarval *scount = new_tarval_from_long(bits-1, mode_Iu); + ir_tarval *sign = tarval_shl(get_mode_one(mode), scount); + if (tarval_is_null(tarval_and(attr->bits_not_set, sign))) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + return new_rd_Shr(dbgi, block, a, b, mode); + } + } return n; -} /* transform_node_Shrs */ +} /** * Transform a Shl. @@ -5227,10 +5539,10 @@ static ir_node *transform_node_Shl(ir_node *n) if (is_Shl(n)) n = transform_node_shl_shr(n); if (is_Shl(n)) - n = transform_node_bitop_shift(n); + n = transform_node_shift_bitop(n); return n; -} /* transform_node_Shl */ +} /** * Transform a Rotl. @@ -5246,10 +5558,10 @@ static ir_node *transform_node_Rotl(ir_node *n) n = transform_node_shift(n); if (is_Rotl(n)) - n = transform_node_bitop_shift(n); + n = transform_node_shift_bitop(n); return n; -} /* transform_node_Rotl */ +} /** * Transform a Conv. @@ -5303,7 +5615,7 @@ static ir_node *transform_node_Conv(ir_node *n) } return n; -} /* transform_node_Conv */ +} /** * Remove dead blocks and nodes in dead blocks @@ -5318,16 +5630,20 @@ static ir_node *transform_node_End(ir_node *n) for (i = j = 0; i < n_keepalives; ++i) { ir_node *ka = get_End_keepalive(n, i); - if (is_Bad(ka)) { - /* no need to keep Bad */ + ir_node *block; + /* no need to keep Bad */ + if (is_Bad(ka)) + continue; + /* do not keep unreachable code */ + block = is_Block(ka) ? ka : get_nodes_block(ka); + if (is_block_unreachable(block)) continue; - } in[j++] = ka; } if (j != n_keepalives) set_End_keepalives(n, j, in); return n; -} /* transform_node_End */ +} int ir_is_negated_value(const ir_node *a, const ir_node *b) { @@ -5348,71 +5664,236 @@ int ir_is_negated_value(const ir_node *a, const ir_node *b) return false; } +static const ir_node *skip_upconv(const ir_node *node) +{ + while (is_Conv(node)) { + ir_mode *mode = get_irn_mode(node); + const ir_node *op = get_Conv_op(node); + ir_mode *op_mode = get_irn_mode(op); + if (!smaller_mode(op_mode, mode)) + break; + node = op; + } + return node; +} + +int ir_mux_is_abs(const ir_node *sel, const ir_node *mux_false, + const ir_node *mux_true) +{ + ir_node *cmp_left; + ir_node *cmp_right; + ir_mode *mode; + ir_relation relation; + + if (!is_Cmp(sel)) + return 0; + + /** + * Note further that these optimization work even for floating point + * with NaN's because -NaN == NaN. + * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs + * transformations. + */ + mode = get_irn_mode(mux_true); + if (mode_honor_signed_zeros(mode)) + return 0; + + /* must be <, <=, >=, > */ + relation = get_Cmp_relation(sel); + if ((relation & ir_relation_less_greater) == 0) + return 0; + + if (!ir_is_negated_value(mux_true, mux_false)) + return 0; + + mux_true = skip_upconv(mux_true); + mux_false = skip_upconv(mux_false); + + /* must be x cmp 0 */ + cmp_right = get_Cmp_right(sel); + if (!is_Const(cmp_right) || !is_Const_null(cmp_right)) + return 0; + + cmp_left = get_Cmp_left(sel); + if (cmp_left == mux_false) { + if (relation & ir_relation_less) { + return 1; + } else { + assert(relation & ir_relation_greater); + return -1; + } + } else if (cmp_left == mux_true) { + if (relation & ir_relation_less) { + return -1; + } else { + assert(relation & ir_relation_greater); + return 1; + } + } + + return 0; +} + +ir_node *ir_get_abs_op(const ir_node *sel, ir_node *mux_false, + ir_node *mux_true) +{ + ir_node *cmp_left = get_Cmp_left(sel); + return cmp_left == skip_upconv(mux_false) ? mux_false : mux_true; +} + +bool ir_is_optimizable_mux(const ir_node *sel, const ir_node *mux_false, + const ir_node *mux_true) +{ + /* this code should return true each time transform_node_Mux would + * optimize the Mux completely away */ + + ir_mode *mode = get_irn_mode(mux_false); + if (get_mode_arithmetic(mode) == irma_twos_complement + && ir_mux_is_abs(sel, mux_false, mux_true)) + return true; + + if (is_Cmp(sel) && mode_is_int(mode) && is_cmp_equality_zero(sel)) { + const ir_node *cmp_r = get_Cmp_right(sel); + const ir_node *cmp_l = get_Cmp_left(sel); + const ir_node *f = mux_false; + const ir_node *t = mux_true; + + if (is_Const(t) && is_Const_null(t)) { + t = mux_false; + f = mux_true; + } + + if (is_And(cmp_l) && f == cmp_r) { + ir_node *and_r = get_And_right(cmp_l); + ir_node *and_l; + + if (and_r == t && is_single_bit(and_r)) + return true; + and_l = get_And_left(cmp_l); + if (and_l == t && is_single_bit(and_l)) + return true; + } + } + + return false; +} + +/** + * Optimize a Mux(c, 0, 1) node (sometimes called a "set" instruction) + */ +static ir_node *transform_Mux_set(ir_node *n) +{ + ir_node *cond = get_Mux_sel(n); + ir_mode *dest_mode; + ir_mode *mode; + ir_node *left; + ir_node *right; + ir_relation relation; + bool need_not; + dbg_info *dbgi; + ir_node *block; + ir_graph *irg; + ir_node *a; + ir_node *b; + unsigned bits; + ir_tarval *tv; + ir_node *shift_cnt; + ir_node *res; + + if (!is_Cmp(cond)) + return n; + left = get_Cmp_left(cond); + mode = get_irn_mode(left); + if (!mode_is_int(mode) && !mode_is_reference(mode)) + return n; + dest_mode = get_irn_mode(n); + if (!mode_is_int(dest_mode) && !mode_is_reference(dest_mode)) + return n; + right = get_Cmp_right(cond); + relation = get_Cmp_relation(cond) & ~ir_relation_unordered; + if (get_mode_size_bits(mode) >= get_mode_size_bits(dest_mode) + && !(mode_is_signed(mode) && is_Const(right) && is_Const_null(right) + && relation != ir_relation_greater)) + return n; + + need_not = false; + switch (relation) { + case ir_relation_less: + /* a < b -> (a - b) >> 31 */ + a = left; + b = right; + break; + case ir_relation_less_equal: + /* a <= b -> ~(a - b) >> 31 */ + a = right; + b = left; + need_not = true; + break; + case ir_relation_greater: + /* a > b -> (b - a) >> 31 */ + a = right; + b = left; + break; + case ir_relation_greater_equal: + /* a >= b -> ~(a - b) >> 31 */ + a = left; + b = right; + need_not = true; + break; + default: + return n; + } + + dbgi = get_irn_dbg_info(n); + block = get_nodes_block(n); + irg = get_irn_irg(block); + bits = get_mode_size_bits(dest_mode); + tv = new_tarval_from_long(bits-1, mode_Iu); + shift_cnt = new_rd_Const(dbgi, irg, tv); + + if (mode != dest_mode) { + a = new_rd_Conv(dbgi, block, a, dest_mode); + b = new_rd_Conv(dbgi, block, b, dest_mode); + } + + res = new_rd_Sub(dbgi, block, a, b, dest_mode); + if (need_not) { + res = new_rd_Not(dbgi, block, res, dest_mode); + } + res = new_rd_Shr(dbgi, block, res, shift_cnt, dest_mode); + return res; +} + /** * Optimize a Mux into some simpler cases. */ static ir_node *transform_node_Mux(ir_node *n) { - ir_node *oldn = n, *sel = get_Mux_sel(n); - ir_mode *mode = get_irn_mode(n); - ir_node *t = get_Mux_true(n); - ir_node *f = get_Mux_false(n); - ir_graph *irg = get_irn_irg(n); - - if (is_irg_state(irg, IR_GRAPH_STATE_KEEP_MUX)) - return n; + ir_node *oldn = n; + ir_node *sel = get_Mux_sel(n); + ir_mode *mode = get_irn_mode(n); + ir_node *t = get_Mux_true(n); + ir_node *f = get_Mux_false(n); + ir_graph *irg = get_irn_irg(n); - if (is_Mux(t)) { - ir_node* block = get_nodes_block(n); - ir_node* c0 = sel; - ir_node* c1 = get_Mux_sel(t); - ir_node* t1 = get_Mux_true(t); - ir_node* f1 = get_Mux_false(t); - if (f == f1) { - /* Mux(cond0, Mux(cond1, x, y), y) -> typical if (cond0 && cond1) x else y */ - ir_node* and_ = new_r_And(block, c0, c1, mode_b); - ir_node* new_mux = new_r_Mux(block, and_, f1, t1, mode); - n = new_mux; - sel = and_; - f = f1; - t = t1; - DBG_OPT_ALGSIM0(oldn, t, FS_OPT_MUX_COMBINE); - } else if (f == t1) { - /* Mux(cond0, Mux(cond1, x, y), x) */ - ir_node* not_c1 = new_r_Not(block, c1, mode_b); - ir_node* and_ = new_r_And(block, c0, not_c1, mode_b); - ir_node* new_mux = new_r_Mux(block, and_, t1, f1, mode); - n = new_mux; - sel = and_; - f = t1; - t = f1; - DBG_OPT_ALGSIM0(oldn, t, FS_OPT_MUX_COMBINE); - } - } else if (is_Mux(f)) { - ir_node* block = get_nodes_block(n); - ir_node* c0 = sel; - ir_node* c1 = get_Mux_sel(f); - ir_node* t1 = get_Mux_true(f); - ir_node* f1 = get_Mux_false(f); - if (t == t1) { - /* Mux(cond0, x, Mux(cond1, x, y)) -> typical if (cond0 || cond1) x else y */ - ir_node* or_ = new_r_Or(block, c0, c1, mode_b); - ir_node* new_mux = new_r_Mux(block, or_, f1, t1, mode); - n = new_mux; - sel = or_; - f = f1; - t = t1; - DBG_OPT_ALGSIM0(oldn, f, FS_OPT_MUX_COMBINE); - } else if (t == f1) { - /* Mux(cond0, x, Mux(cond1, y, x)) */ - ir_node* not_c1 = new_r_Not(block, c1, mode_b); - ir_node* or_ = new_r_Or(block, c0, not_c1, mode_b); - ir_node* new_mux = new_r_Mux(block, or_, t1, f1, mode); - n = new_mux; - sel = or_; - f = t1; - t = f1; - DBG_OPT_ALGSIM0(oldn, f, FS_OPT_MUX_COMBINE); + /* implement integer abs: abs(x) = x^(x >>s 31) - (x >>s 31) */ + if (get_mode_arithmetic(mode) == irma_twos_complement) { + int abs = ir_mux_is_abs(sel, f, t); + if (abs != 0) { + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); + ir_node *op = ir_get_abs_op(sel, f, t); + int bits = get_mode_size_bits(mode); + ir_node *shiftconst = new_r_Const_long(irg, mode_Iu, bits-1); + ir_node *sext = new_rd_Shrs(dbgi, block, op, shiftconst, mode); + ir_node *xorn = new_rd_Eor(dbgi, block, op, sext, mode); + ir_node *res; + if (abs > 0) { + res = new_rd_Sub(dbgi, block, xorn, sext, mode); + } else { + res = new_rd_Sub(dbgi, block, sext, xorn, mode); + } + return res; } } @@ -5431,136 +5912,131 @@ static ir_node *transform_node_Mux(ir_node *n) relation = get_negated_relation(relation); sel = new_rd_Cmp(seldbgi, block, get_Cmp_left(sel), get_Cmp_right(sel), relation); - n = new_rd_Mux(get_irn_dbg_info(n), get_nodes_block(n), sel, f, t, mode); + return new_rd_Mux(get_irn_dbg_info(n), get_nodes_block(n), sel, f, t, mode); } - /* note: after normalization, false can only happen on default */ - if (mode == mode_b) { - dbg_info *dbg = get_irn_dbg_info(n); - ir_node *block = get_nodes_block(n); + if (is_Const(f) && is_Const_null(f) && is_Const(t) && is_Const_one(t)) { + n = transform_Mux_set(n); + if (n != oldn) + return n; + } - if (is_Const(t)) { - ir_tarval *tv_t = get_Const_tarval(t); - if (tv_t == tarval_b_true) { - if (is_Const(f)) { - /* Muxb(sel, true, false) = sel */ - assert(get_Const_tarval(f) == tarval_b_false); - DBG_OPT_ALGSIM0(oldn, sel, FS_OPT_MUX_BOOL); - return sel; - } else { - /* Muxb(sel, true, x) = Or(sel, x) */ - n = new_rd_Or(dbg, block, sel, f, mode_b); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_OR_BOOL); - return n; - } + /* the following optimisations create new mode_b nodes, so only do them + * before mode_b lowering */ + if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_MODEB_LOWERED)) { + if (is_Mux(t)) { + ir_node* block = get_nodes_block(n); + ir_node* c0 = sel; + ir_node* c1 = get_Mux_sel(t); + ir_node* t1 = get_Mux_true(t); + ir_node* f1 = get_Mux_false(t); + if (f == f1) { + /* Mux(cond0, Mux(cond1, x, y), y) => Mux(cond0 && cond1, x, y) */ + ir_node* and_ = new_r_And(block, c0, c1, mode_b); + DBG_OPT_ALGSIM0(oldn, t1, FS_OPT_MUX_COMBINE); + return new_r_Mux(block, and_, f1, t1, mode); + } else if (f == t1) { + /* Mux(cond0, Mux(cond1, x, y), x) */ + ir_node* not_c1 = new_r_Not(block, c1, mode_b); + ir_node* and_ = new_r_And(block, c0, not_c1, mode_b); + DBG_OPT_ALGSIM0(oldn, f1, FS_OPT_MUX_COMBINE); + return new_r_Mux(block, and_, t1, f1, mode); } - } else if (is_Const(f)) { - ir_tarval *tv_f = get_Const_tarval(f); - if (tv_f == tarval_b_true) { - /* Muxb(sel, x, true) = Or(Not(sel), x) */ - ir_node* not_sel = new_rd_Not(dbg, block, sel, mode_b); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_ORNOT_BOOL); - n = new_rd_Or(dbg, block, not_sel, t, mode_b); - return n; - } else { - /* Muxb(sel, x, false) = And(sel, x) */ - assert(tv_f == tarval_b_false); - n = new_rd_And(dbg, block, sel, t, mode_b); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_AND_BOOL); - return n; + } else if (is_Mux(f)) { + ir_node* block = get_nodes_block(n); + ir_node* c0 = sel; + ir_node* c1 = get_Mux_sel(f); + ir_node* t1 = get_Mux_true(f); + ir_node* f1 = get_Mux_false(f); + if (t == t1) { + /* Mux(cond0, x, Mux(cond1, x, y)) -> typical if (cond0 || cond1) x else y */ + ir_node* or_ = new_r_Or(block, c0, c1, mode_b); + DBG_OPT_ALGSIM0(oldn, f1, FS_OPT_MUX_COMBINE); + return new_r_Mux(block, or_, f1, t1, mode); + } else if (t == f1) { + /* Mux(cond0, x, Mux(cond1, y, x)) */ + ir_node* not_c1 = new_r_Not(block, c1, mode_b); + ir_node* or_ = new_r_Or(block, c0, not_c1, mode_b); + DBG_OPT_ALGSIM0(oldn, t1, FS_OPT_MUX_COMBINE); + return new_r_Mux(block, or_, t1, f1, mode); } } - } - /* more normalization: Mux(sel, 0, 1) is simply a conv from the mode_b - * value to integer. */ - if (is_Const(t) && is_Const(f) && mode_is_int(mode)) { - ir_tarval *a = get_Const_tarval(t); - ir_tarval *b = get_Const_tarval(f); + /* note: after normalization, false can only happen on default */ + if (mode == mode_b) { + dbg_info *dbg = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); - if (tarval_is_one(a) && tarval_is_null(b)) { - ir_node *block = get_nodes_block(n); - ir_node *conv = new_r_Conv(block, sel, mode); - n = conv; - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_CONV); - return n; - } else if (tarval_is_null(a) && tarval_is_one(b)) { - ir_node *block = get_nodes_block(n); - ir_node *not_ = new_r_Not(block, sel, mode_b); - ir_node *conv = new_r_Conv(block, not_, mode); - n = conv; - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_CONV); - return n; + if (is_Const(t)) { + ir_tarval *tv_t = get_Const_tarval(t); + if (tv_t == tarval_b_true) { + if (is_Const(f)) { + /* Muxb(sel, true, false) = sel */ + assert(get_Const_tarval(f) == tarval_b_false); + DBG_OPT_ALGSIM0(oldn, sel, FS_OPT_MUX_BOOL); + return sel; + } else { + /* Muxb(sel, true, x) = Or(sel, x) */ + n = new_rd_Or(dbg, block, sel, f, mode_b); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_OR_BOOL); + return n; + } + } + } else if (is_Const(f)) { + ir_tarval *tv_f = get_Const_tarval(f); + if (tv_f == tarval_b_true) { + /* Muxb(sel, x, true) = Or(Not(sel), x) */ + ir_node* not_sel = new_rd_Not(dbg, block, sel, mode_b); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_ORNOT_BOOL); + n = new_rd_Or(dbg, block, not_sel, t, mode_b); + return n; + } else { + /* Muxb(sel, x, false) = And(sel, x) */ + assert(tv_f == tarval_b_false); + n = new_rd_And(dbg, block, sel, t, mode_b); + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_AND_BOOL); + return n; + } + } } } - if (is_Cmp(sel)) { + if (is_Cmp(sel) && mode_is_int(mode) && is_cmp_equality_zero(sel)) { + ir_relation relation = get_Cmp_relation(sel); ir_node *cmp_r = get_Cmp_right(sel); - if (is_Const(cmp_r) && is_Const_null(cmp_r)) { - ir_node *block = get_nodes_block(n); - ir_node *cmp_l = get_Cmp_left(sel); - - if (mode_is_int(mode)) { - ir_relation relation = get_Cmp_relation(sel); - /* integer only */ - if ((relation == ir_relation_less_greater || relation == ir_relation_equal) && is_And(cmp_l)) { - /* Mux((a & b) != 0, c, 0) */ - ir_node *and_r = get_And_right(cmp_l); - ir_node *and_l; - - if (and_r == t && f == cmp_r) { - if (is_Const(t) && tarval_is_single_bit(get_Const_tarval(t))) { - if (relation == ir_relation_less_greater) { - /* Mux((a & 2^C) != 0, 2^C, 0) */ - n = cmp_l; - DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP); - } else { - /* Mux((a & 2^C) == 0, 2^C, 0) */ - n = new_rd_Eor(get_irn_dbg_info(n), - block, cmp_l, t, mode); - DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP); - } - return n; - } - } - if (is_Shl(and_r)) { - ir_node *shl_l = get_Shl_left(and_r); - if (is_Const(shl_l) && is_Const_one(shl_l)) { - if (and_r == t && f == cmp_r) { - if (relation == ir_relation_less_greater) { - /* (a & (1 << n)) != 0, (1 << n), 0) */ - n = cmp_l; - DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP); - } else { - /* (a & (1 << n)) == 0, (1 << n), 0) */ - n = new_rd_Eor(get_irn_dbg_info(n), - block, cmp_l, t, mode); - DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP); - } - return n; - } - } - } - and_l = get_And_left(cmp_l); - if (is_Shl(and_l)) { - ir_node *shl_l = get_Shl_left(and_l); - if (is_Const(shl_l) && is_Const_one(shl_l)) { - if (and_l == t && f == cmp_r) { - if (relation == ir_relation_less_greater) { - /* ((1 << n) & a) != 0, (1 << n), 0) */ - n = cmp_l; - DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP); - } else { - /* ((1 << n) & a) == 0, (1 << n), 0) */ - n = new_rd_Eor(get_irn_dbg_info(n), - block, cmp_l, t, mode); - DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP); - } - return n; - } - } - } + ir_node *cmp_l = get_Cmp_left(sel); + ir_node *block = get_nodes_block(n); + + if (is_And(cmp_l) && f == cmp_r) { + ir_node *and_r = get_And_right(cmp_l); + ir_node *and_l; + + if (and_r == t && is_single_bit(and_r)) { + if (relation == ir_relation_equal) { + /* Mux((a & (1<op->ops.transform_node != NULL) - n = n->op->ops.transform_node(n); - } while (oldn != n); + ir_node *old_n; + unsigned iro; +restart: + old_n = n; + iro = get_irn_opcode_(n); + /* constant expression evaluation / constant folding */ + if (get_opt_constant_folding()) { + /* neither constants nor Tuple values can be evaluated */ + if (iro != iro_Const && get_irn_mode(n) != mode_T) { + /* try to evaluate */ + ir_tarval *tv = computed_value(n); + if (tv != tarval_bad) { + /* evaluation was successful -- replace the node. */ + ir_graph *irg = get_irn_irg(n); - return n; -} /* transform_node */ + n = new_r_Const(irg, tv); -/** - * Sets the default transform node operation for an ir_op_ops. - * - * @param code the opcode for the default operation - * @param ops the operations initialized - * - * @return - * The operations. - */ -static ir_op_ops *firm_set_default_transform_node(ir_opcode code, ir_op_ops *ops) -{ -#define CASE(a) \ - case iro_##a: \ - ops->transform_node = transform_node_##a; \ - break -#define CASE_PROJ(a) \ - case iro_##a: \ - ops->transform_node_Proj = transform_node_Proj_##a; \ - break -#define CASE_PROJ_EX(a) \ - case iro_##a: \ - ops->transform_node = transform_node_##a; \ - ops->transform_node_Proj = transform_node_Proj_##a; \ - break - - switch (code) { - CASE(Add); - CASE(And); - CASE(Call); - CASE(Cmp); - CASE(Conv); - CASE(End); - CASE(Eor); - CASE(Minus); - CASE(Mul); - CASE(Mux); - CASE(Not); - CASE(Or); - CASE(Phi); - CASE(Proj); - CASE(Rotl); - CASE(Sel); - CASE(Shl); - CASE(Shr); - CASE(Shrs); - CASE(Sub); - CASE(Sync); - CASE_PROJ(Bound); - CASE_PROJ(CopyB); - CASE_PROJ(Store); - CASE_PROJ_EX(Cond); - CASE_PROJ_EX(Div); - CASE_PROJ_EX(Load); - CASE_PROJ_EX(Mod); - default: - /* leave NULL */; + DBG_OPT_CSTEVAL(old_n, n); + return n; + } + } } - return ops; -#undef CASE_PROJ_EX -#undef CASE_PROJ -#undef CASE -} /* firm_set_default_transform_node */ - - -/* **************** Common Subexpression Elimination **************** */ - -/** The size of the hash table used, should estimate the number of nodes - in a graph. */ -#define N_IR_NODES 512 - -/** Compares the attributes of two Const nodes. */ -static int node_cmp_attr_Const(const ir_node *a, const ir_node *b) -{ - return get_Const_tarval(a) != get_Const_tarval(b); -} - -/** Compares the attributes of two Proj nodes. */ -static int node_cmp_attr_Proj(const ir_node *a, const ir_node *b) -{ - return a->attr.proj.proj != b->attr.proj.proj; -} - -/** Compares the attributes of two Alloc nodes. */ -static int node_cmp_attr_Alloc(const ir_node *a, const ir_node *b) -{ - const alloc_attr *pa = &a->attr.alloc; - const alloc_attr *pb = &b->attr.alloc; - return (pa->where != pb->where) || (pa->type != pb->type); -} - -/** Compares the attributes of two Free nodes. */ -static int node_cmp_attr_Free(const ir_node *a, const ir_node *b) -{ - const free_attr *pa = &a->attr.free; - const free_attr *pb = &b->attr.free; - return (pa->where != pb->where) || (pa->type != pb->type); -} - -/** Compares the attributes of two SymConst nodes. */ -static int node_cmp_attr_SymConst(const ir_node *a, const ir_node *b) -{ - const symconst_attr *pa = &a->attr.symc; - const symconst_attr *pb = &b->attr.symc; - return (pa->kind != pb->kind) - || (pa->sym.type_p != pb->sym.type_p); -} - -/** Compares the attributes of two Call nodes. */ -static int node_cmp_attr_Call(const ir_node *a, const ir_node *b) -{ - const call_attr *pa = &a->attr.call; - const call_attr *pb = &b->attr.call; - return (pa->type != pb->type) - || (pa->tail_call != pb->tail_call); -} - -/** Compares the attributes of two Sel nodes. */ -static int node_cmp_attr_Sel(const ir_node *a, const ir_node *b) -{ - const ir_entity *a_ent = get_Sel_entity(a); - const ir_entity *b_ent = get_Sel_entity(b); - return a_ent != b_ent; -} - -/** Compares the attributes of two Phi nodes. */ -static int node_cmp_attr_Phi(const ir_node *a, const ir_node *b) -{ - /* we can only enter this function if both nodes have the same number of inputs, - hence it is enough to check if one of them is a Phi0 */ - if (is_Phi0(a)) { - /* check the Phi0 pos attribute */ - return a->attr.phi.u.pos != b->attr.phi.u.pos; + /* remove unnecessary nodes */ + if (get_opt_constant_folding() || + (iro == iro_Phi) || /* always optimize these nodes. */ + (iro == iro_Id) || /* ... */ + (iro == iro_Proj) || /* ... */ + (iro == iro_Block)) { /* Flags tested local. */ + n = equivalent_node(n); + if (n != old_n) + goto restart; } - return 0; -} - -/** Compares the attributes of two Conv nodes. */ -static int node_cmp_attr_Conv(const ir_node *a, const ir_node *b) -{ - return get_Conv_strict(a) != get_Conv_strict(b); -} - -/** Compares the attributes of two Cast nodes. */ -static int node_cmp_attr_Cast(const ir_node *a, const ir_node *b) -{ - return get_Cast_type(a) != get_Cast_type(b); -} - -/** Compares the attributes of two Load nodes. */ -static int node_cmp_attr_Load(const ir_node *a, const ir_node *b) -{ - if (get_Load_volatility(a) == volatility_is_volatile || - get_Load_volatility(b) == volatility_is_volatile) - /* NEVER do CSE on volatile Loads */ - return 1; - /* do not CSE Loads with different alignment. Be conservative. */ - if (get_Load_unaligned(a) != get_Load_unaligned(b)) - return 1; - return get_Load_mode(a) != get_Load_mode(b); -} - -/** Compares the attributes of two Store nodes. */ -static int node_cmp_attr_Store(const ir_node *a, const ir_node *b) -{ - /* do not CSE Stores with different alignment. Be conservative. */ - if (get_Store_unaligned(a) != get_Store_unaligned(b)) - return 1; - - /* NEVER do CSE on volatile Stores */ - return (get_Store_volatility(a) == volatility_is_volatile || - get_Store_volatility(b) == volatility_is_volatile); -} - -/** Compares two exception attributes */ -static int node_cmp_exception(const ir_node *a, const ir_node *b) -{ - const except_attr *ea = &a->attr.except; - const except_attr *eb = &b->attr.except; + /* Some more constant expression evaluation. */ + if (get_opt_algebraic_simplification() || + (iro == iro_Cond) || + (iro == iro_Proj)) { /* Flags tested local. */ + if (n->op->ops.transform_node != NULL) { + n = n->op->ops.transform_node(n); + if (n != old_n) { + goto restart; + } + } + } - return ea->pin_state != eb->pin_state; + return n; } -#define node_cmp_attr_Bound node_cmp_exception - -/** Compares the attributes of two Div nodes. */ -static int node_cmp_attr_Div(const ir_node *a, const ir_node *b) +static void register_computed_value_func(ir_op *op, computed_value_func func) { - const div_attr *ma = &a->attr.div; - const div_attr *mb = &b->attr.div; - return ma->exc.pin_state != mb->exc.pin_state || - ma->resmode != mb->resmode || - ma->no_remainder != mb->no_remainder; + assert(op->ops.computed_value == NULL || op->ops.computed_value == func); + op->ops.computed_value = func; } -/** Compares the attributes of two Mod nodes. */ -static int node_cmp_attr_Mod(const ir_node *a, const ir_node *b) +static void register_computed_value_func_proj(ir_op *op, + computed_value_func func) { - const mod_attr *ma = &a->attr.mod; - const mod_attr *mb = &b->attr.mod; - return ma->exc.pin_state != mb->exc.pin_state || - ma->resmode != mb->resmode; + assert(op->ops.computed_value_Proj == NULL + || op->ops.computed_value_Proj == func); + op->ops.computed_value_Proj = func; } -static int node_cmp_attr_Cmp(const ir_node *a, const ir_node *b) +static void register_equivalent_node_func(ir_op *op, equivalent_node_func func) { - const cmp_attr *ma = &a->attr.cmp; - const cmp_attr *mb = &b->attr.cmp; - return ma->relation != mb->relation; + assert(op->ops.equivalent_node == NULL || op->ops.equivalent_node == func); + op->ops.equivalent_node = func; } -/** Compares the attributes of two Confirm nodes. */ -static int node_cmp_attr_Confirm(const ir_node *a, const ir_node *b) +static void register_equivalent_node_func_proj(ir_op *op, + equivalent_node_func func) { - const confirm_attr *ma = &a->attr.confirm; - const confirm_attr *mb = &b->attr.confirm; - return ma->relation != mb->relation; + assert(op->ops.equivalent_node_Proj == NULL + || op->ops.equivalent_node_Proj == func); + op->ops.equivalent_node_Proj = func; } -/** Compares the attributes of two Builtin nodes. */ -static int node_cmp_attr_Builtin(const ir_node *a, const ir_node *b) +static void register_transform_node_func(ir_op *op, transform_node_func func) { - /* no need to compare the type, equal kind means equal type */ - return get_Builtin_kind(a) != get_Builtin_kind(b); + assert(op->ops.transform_node == NULL || op->ops.transform_node == func); + op->ops.transform_node = func; } -/** Compares the attributes of two ASM nodes. */ -static int node_cmp_attr_ASM(const ir_node *a, const ir_node *b) +static void register_transform_node_func_proj(ir_op *op, + transform_node_func func) { - int i, n; - const ir_asm_constraint *ca; - const ir_asm_constraint *cb; - ident **cla, **clb; - - if (get_ASM_text(a) != get_ASM_text(b)) - return 1; - - /* Should we really check the constraints here? Should be better, but is strange. */ - n = get_ASM_n_input_constraints(a); - if (n != get_ASM_n_input_constraints(b)) - return 1; - - ca = get_ASM_input_constraints(a); - cb = get_ASM_input_constraints(b); - for (i = 0; i < n; ++i) { - if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint - || ca[i].mode != cb[i].mode) - return 1; - } - - n = get_ASM_n_output_constraints(a); - if (n != get_ASM_n_output_constraints(b)) - return 1; - - ca = get_ASM_output_constraints(a); - cb = get_ASM_output_constraints(b); - for (i = 0; i < n; ++i) { - if (ca[i].pos != cb[i].pos || ca[i].constraint != cb[i].constraint - || ca[i].mode != cb[i].mode) - return 1; - } - - n = get_ASM_n_clobbers(a); - if (n != get_ASM_n_clobbers(b)) - return 1; - - cla = get_ASM_clobbers(a); - clb = get_ASM_clobbers(b); - for (i = 0; i < n; ++i) { - if (cla[i] != clb[i]) - return 1; - } - return 0; + assert(op->ops.transform_node_Proj == NULL + || op->ops.transform_node_Proj == func); + op->ops.transform_node_Proj = func; } -/** Compares the inexistent attributes of two Dummy nodes. */ -static int node_cmp_attr_Dummy(const ir_node *a, const ir_node *b) -{ - (void) a; - (void) b; - return 1; +void ir_register_opt_node_ops(void) +{ + register_computed_value_func(op_Add, computed_value_Add); + register_computed_value_func(op_And, computed_value_And); + register_computed_value_func(op_Borrow, computed_value_Borrow); + register_computed_value_func(op_Carry, computed_value_Carry); + register_computed_value_func(op_Cmp, computed_value_Cmp); + register_computed_value_func(op_Confirm, computed_value_Confirm); + register_computed_value_func(op_Const, computed_value_Const); + register_computed_value_func(op_Conv, computed_value_Conv); + register_computed_value_func(op_Eor, computed_value_Eor); + register_computed_value_func(op_Minus, computed_value_Minus); + register_computed_value_func(op_Mul, computed_value_Mul); + register_computed_value_func(op_Mux, computed_value_Mux); + register_computed_value_func(op_Not, computed_value_Not); + register_computed_value_func(op_Or, computed_value_Or); + register_computed_value_func(op_Proj, computed_value_Proj); + register_computed_value_func(op_Rotl, computed_value_Rotl); + register_computed_value_func(op_Shl, computed_value_Shl); + register_computed_value_func(op_Shr, computed_value_Shr); + register_computed_value_func(op_Shrs, computed_value_Shrs); + register_computed_value_func(op_Sub, computed_value_Sub); + register_computed_value_func(op_SymConst, computed_value_SymConst); + register_computed_value_func_proj(op_Div, computed_value_Proj_Div); + register_computed_value_func_proj(op_Mod, computed_value_Proj_Mod); + + register_equivalent_node_func(op_Add, equivalent_node_Add); + register_equivalent_node_func(op_And, equivalent_node_And); + register_equivalent_node_func(op_Confirm, equivalent_node_Confirm); + register_equivalent_node_func(op_Conv, equivalent_node_Conv); + register_equivalent_node_func(op_Eor, equivalent_node_Eor); + register_equivalent_node_func(op_Id, equivalent_node_Id); + register_equivalent_node_func(op_Minus, equivalent_node_idempotent_unop); + register_equivalent_node_func(op_Mul, equivalent_node_Mul); + register_equivalent_node_func(op_Mux, equivalent_node_Mux); + register_equivalent_node_func(op_Not, equivalent_node_idempotent_unop); + register_equivalent_node_func(op_Or, equivalent_node_Or); + register_equivalent_node_func(op_Phi, equivalent_node_Phi); + register_equivalent_node_func(op_Proj, equivalent_node_Proj); + register_equivalent_node_func(op_Rotl, equivalent_node_left_zero); + register_equivalent_node_func(op_Shl, equivalent_node_left_zero); + register_equivalent_node_func(op_Shr, equivalent_node_left_zero); + register_equivalent_node_func(op_Shrs, equivalent_node_left_zero); + register_equivalent_node_func(op_Sub, equivalent_node_Sub); + register_equivalent_node_func_proj(op_Bound, equivalent_node_Proj_Bound); + register_equivalent_node_func_proj(op_CopyB, equivalent_node_Proj_CopyB); + register_equivalent_node_func_proj(op_Div, equivalent_node_Proj_Div); + register_equivalent_node_func_proj(op_Tuple, equivalent_node_Proj_Tuple); + + register_transform_node_func(op_Add, transform_node_Add); + register_transform_node_func(op_And, transform_node_And); + register_transform_node_func(op_Block, transform_node_Block); + register_transform_node_func(op_Call, transform_node_Call); + register_transform_node_func(op_Cmp, transform_node_Cmp); + register_transform_node_func(op_Cond, transform_node_Cond); + register_transform_node_func(op_Conv, transform_node_Conv); + register_transform_node_func(op_Div, transform_node_Div); + register_transform_node_func(op_End, transform_node_End); + register_transform_node_func(op_Eor, transform_node_Eor); + register_transform_node_func(op_Load, transform_node_Load); + register_transform_node_func(op_Minus, transform_node_Minus); + register_transform_node_func(op_Mod, transform_node_Mod); + register_transform_node_func(op_Mul, transform_node_Mul); + register_transform_node_func(op_Mux, transform_node_Mux); + register_transform_node_func(op_Not, transform_node_Not); + register_transform_node_func(op_Or, transform_node_Or); + register_transform_node_func(op_Phi, transform_node_Phi); + register_transform_node_func(op_Proj, transform_node_Proj); + register_transform_node_func(op_Rotl, transform_node_Rotl); + register_transform_node_func(op_Shl, transform_node_Shl); + register_transform_node_func(op_Shrs, transform_node_Shrs); + register_transform_node_func(op_Shr, transform_node_Shr); + register_transform_node_func(op_Sub, transform_node_Sub); + register_transform_node_func(op_Switch, transform_node_Switch); + register_transform_node_func(op_Sync, transform_node_Sync); + register_transform_node_func_proj(op_Bound, transform_node_Proj_Bound); + register_transform_node_func_proj(op_CopyB, transform_node_Proj_CopyB); + register_transform_node_func_proj(op_Div, transform_node_Proj_Div); + register_transform_node_func_proj(op_Load, transform_node_Proj_Load); + register_transform_node_func_proj(op_Mod, transform_node_Proj_Mod); + register_transform_node_func_proj(op_Store, transform_node_Proj_Store); } -/** - * Set the default node attribute compare operation for an ir_op_ops. - * - * @param code the opcode for the default operation - * @param ops the operations initialized - * - * @return - * The operations. - */ -static ir_op_ops *firm_set_default_node_cmp_attr(ir_opcode code, ir_op_ops *ops) -{ -#define CASE(a) \ - case iro_##a: \ - ops->node_cmp_attr = node_cmp_attr_##a; \ - break - - switch (code) { - CASE(Const); - CASE(Proj); - CASE(Alloc); - CASE(Free); - CASE(SymConst); - CASE(Call); - CASE(Sel); - CASE(Phi); - CASE(Cmp); - CASE(Conv); - CASE(Cast); - CASE(Load); - CASE(Store); - CASE(Confirm); - CASE(ASM); - CASE(Div); - CASE(Mod); - CASE(Bound); - CASE(Builtin); - CASE(Dummy); - /* FIXME CopyB */ - default: - /* leave NULL */ - break; - } +/* **************** Common Subexpression Elimination **************** */ - return ops; -#undef CASE -} /* firm_set_default_node_cmp_attr */ +/** The size of the hash table used, should estimate the number of nodes + in a graph. */ +#define N_IR_NODES 512 -/* - * Compare function for two nodes in the value table. Gets two - * nodes as parameters. Returns 0 if the nodes are a Common Sub Expression. - */ int identities_cmp(const void *elt, const void *key) { ir_node *a = (ir_node *)elt; @@ -6123,12 +6454,25 @@ int identities_cmp(const void *elt, const void *key) if (get_irn_pinned(a) == op_pin_state_pinned) { /* for pinned nodes, the block inputs must be equal */ - if (get_irn_n(a, -1) != get_irn_n(b, -1)) - return 1; - } else if (! get_opt_global_cse()) { - /* for block-local CSE both nodes must be in the same Block */ if (get_nodes_block(a) != get_nodes_block(b)) return 1; + } else { + ir_node *block_a = get_nodes_block(a); + ir_node *block_b = get_nodes_block(b); + if (! get_opt_global_cse()) { + /* for block-local CSE both nodes must be in the same Block */ + if (block_a != block_b) + return 1; + } else { + /* The optimistic approach would be to do nothing here. + * However doing GCSE optimistically produces a lot of partially dead code which appears + * to be worse in practice than the missed opportunities. + * So we use a very conservative variant here and only CSE if 1 value dominates the + * other. */ + if (!block_dominates(block_a, block_b) + && !block_dominates(block_b, block_a)) + return 1; + } } /* compare a->in[0..ins] with b->in[0..ins] */ @@ -6150,34 +6494,35 @@ int identities_cmp(const void *elt, const void *key) return a->op->ops.node_cmp_attr(a, b); return 0; -} /* identities_cmp */ +} -/* - * Calculate a hash value of a node. - * - * @param node The IR-node - */ unsigned ir_node_hash(const ir_node *node) { return node->op->ops.hash(node); -} /* ir_node_hash */ - +} void new_identities(ir_graph *irg) { if (irg->value_table != NULL) del_pset(irg->value_table); irg->value_table = new_pset(identities_cmp, N_IR_NODES); -} /* new_identities */ +} void del_identities(ir_graph *irg) { if (irg->value_table != NULL) del_pset(irg->value_table); -} /* del_identities */ +} + +static int cmp_node_nr(const void *a, const void *b) +{ + ir_node **p1 = (ir_node**)a; + ir_node **p2 = (ir_node**)b; + long n1 = get_irn_node_nr(*p1); + long n2 = get_irn_node_nr(*p2); + return (n1>n2) - (n1value_table, ir_node*, node) { + foreach_pset(irg->value_table, ir_node, node) { visit(node, env); } current_ir_graph = rem; -} /* visit_all_identities */ - -/** - * Garbage in, garbage out. If a node has a dead input, i.e., the - * Bad node is input to the node, return the Bad node. - */ -static ir_node *gigo(ir_node *node) -{ - ir_op *op = get_irn_op(node); - - /* Code in "Bad" blocks is unreachable and can be replaced by Bad */ - if (op != op_Block && is_Bad(get_nodes_block(node))) { - ir_graph *irg = get_irn_irg(node); - return get_irg_bad(irg); - } - - /* Blocks, Phis and Tuples may have dead inputs, e.g., if one of the - blocks predecessors is dead. */ - if (op != op_Block && op != op_Phi && op != op_Tuple && op != op_Anchor - && op != op_Sync && op != op_End) { - ir_graph *irg = get_irn_irg(node); - int irn_arity = get_irn_arity(node); - int i; - - for (i = 0; i < irn_arity; i++) { - ir_node *pred = get_irn_n(node, i); - - if (is_Bad(pred)) { - /* be careful not to kill cfopts too early or we might violate - * the 1 cfop per block property */ - if (!is_cfop(node) - || is_irg_state(irg, IR_GRAPH_STATE_BAD_BLOCK)) - return get_irg_bad(irg); - } - } - } - - return node; } -/** - * These optimizations deallocate nodes from the obstack. - * It can only be called if it is guaranteed that no other nodes - * reference this one, i.e., right after construction of a node. - * - * @param n The node to optimize - */ ir_node *optimize_node(ir_node *n) { ir_node *oldn = n; @@ -6325,17 +6636,6 @@ ir_node *optimize_node(ir_node *n) /* Always optimize Phi nodes: part of the construction. */ if ((!get_opt_optimize()) && (iro != iro_Phi)) return n; - /* Remove nodes with dead (Bad) input. - Run always for transformation induced Bads. */ - n = gigo(n); - if (n != oldn) { - edges_node_deleted(oldn); - - /* We found an existing, better node, so we can deallocate the old node. */ - irg_kill_node(irg, oldn); - return n; - } - /* constant expression evaluation / constant folding */ if (get_opt_constant_folding()) { /* neither constants nor Tuple values can be evaluated */ @@ -6402,12 +6702,13 @@ ir_node *optimize_node(ir_node *n) free the node. */ iro = get_irn_opcode(n); if (get_opt_algebraic_simplification() || - (iro == iro_Cond) || - (iro == iro_Proj)) /* Flags tested local. */ + (iro == iro_Cond) || + (iro == iro_Proj)) { /* Flags tested local. */ n = transform_node(n); + } /* Now we have a legal, useful node. Enter it in hash table for CSE */ - if (get_opt_cse() && (get_irn_opcode(n) != iro_Block)) { + if (get_opt_cse()) { ir_node *o = n; n = identify_remember(o); if (o != n) @@ -6415,83 +6716,42 @@ ir_node *optimize_node(ir_node *n) } return n; -} /* optimize_node */ - +} -/** - * These optimizations never deallocate nodes (in place). This can cause dead - * nodes lying on the obstack. Remove these by a dead node elimination, - * i.e., a copying garbage collection. - */ ir_node *optimize_in_place_2(ir_node *n) { - ir_tarval *tv; - ir_node *oldn = n; - unsigned iro = get_irn_opcode(n); - if (!get_opt_optimize() && !is_Phi(n)) return n; - if (iro == iro_Deleted) - return n; - - /* Remove nodes with dead (Bad) input. - Run always for transformation induced Bads. */ - n = gigo(n); - if (is_Bad(n)) + if (is_Deleted(n)) return n; - /* constant expression evaluation / constant folding */ - if (get_opt_constant_folding()) { - /* neither constants nor Tuple values can be evaluated */ - if (iro != iro_Const && get_irn_mode(n) != mode_T) { - /* try to evaluate */ - tv = computed_value(n); - if (tv != tarval_bad) { - /* evaluation was successful -- replace the node. */ - ir_graph *irg = get_irn_irg(n); - - n = new_r_Const(irg, tv); - - DBG_OPT_CSTEVAL(oldn, n); - return n; - } - } - } - - /* remove unnecessary nodes */ - if (get_opt_constant_folding() || - (iro == iro_Phi) || /* always optimize these nodes. */ - (iro == iro_Id) || /* ... */ - (iro == iro_Proj) || /* ... */ - (iro == iro_Block) ) /* Flags tested local. */ - n = equivalent_node(n); - /** common subexpression elimination **/ /* Checks whether n is already available. */ - /* The block input is used to distinguish different subexpressions. Right - now all nodes are op_pin_state_pinned to blocks, i.e., the cse only finds common - subexpressions within a block. */ + /* The block input is used to distinguish different subexpressions. + * Right now all nodes are op_pin_state_pinned to blocks, i.e., the cse + * only finds common subexpressions within a block. */ if (get_opt_cse()) { ir_node *o = n; - n = identify_remember(o); - if (o != n) + n = identify_remember(n); + if (n != o) { DBG_OPT_CSE(o, n); + /* we have another existing node now, we do not optimize it here */ + return n; + } } - /* Some more constant expression evaluation. */ - iro = get_irn_opcode(n); - if (get_opt_constant_folding() || - (iro == iro_Cond) || - (iro == iro_Proj)) /* Flags tested local. */ - n = transform_node(n); + n = transform_node(n); /* Now we can verify the node, as it has no dead inputs any more. */ irn_verify(n); /* Now we have a legal, useful node. Enter it in hash table for cse. - Blocks should be unique anyways. (Except the successor of start: - is cse with the start block!) */ - if (get_opt_cse() && (get_irn_opcode(n) != iro_Block)) { + * + * Note: This is only necessary because some of the optimisations + * operate in-place (set_XXX_bla, turn_into_tuple, ...) which is considered + * bad practice and should be fixed sometime. + */ + if (get_opt_cse()) { ir_node *o = n; n = identify_remember(o); if (o != n) @@ -6499,11 +6759,8 @@ ir_node *optimize_in_place_2(ir_node *n) } return n; -} /* optimize_in_place_2 */ +} -/** - * Wrapper for external use, set proper status bits after optimization. - */ ir_node *optimize_in_place(ir_node *n) { ir_graph *irg = get_irn_irg(n); @@ -6512,85 +6769,9 @@ ir_node *optimize_in_place(ir_node *n) if (get_opt_global_cse()) set_irg_pinned(irg, op_pin_state_floats); - if (get_irg_outs_state(irg) == outs_consistent) - set_irg_outs_inconsistent(irg); /* FIXME: Maybe we could also test whether optimizing the node can change the control graph. */ - set_irg_doms_inconsistent(irg); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE); return optimize_in_place_2(n); -} /* optimize_in_place */ - -/** - * Calculate a hash value of a Const node. - */ -static unsigned hash_Const(const ir_node *node) -{ - unsigned h; - - /* special value for const, as they only differ in their tarval. */ - h = HASH_PTR(node->attr.con.tarval); - - return h; -} /* hash_Const */ - -/** - * Calculate a hash value of a SymConst node. - */ -static unsigned hash_SymConst(const ir_node *node) -{ - unsigned h; - - /* all others are pointers */ - h = HASH_PTR(node->attr.symc.sym.type_p); - - return h; -} /* hash_SymConst */ - -/** - * Set the default hash operation in an ir_op_ops. - * - * @param code the opcode for the default operation - * @param ops the operations initialized - * - * @return - * The operations. - */ -static ir_op_ops *firm_set_default_hash(unsigned code, ir_op_ops *ops) -{ -#define CASE(a) \ - case iro_##a: \ - ops->hash = hash_##a; \ - break - - /* hash function already set */ - if (ops->hash != NULL) - return ops; - - switch (code) { - CASE(Const); - CASE(SymConst); - default: - /* use input/mode default hash if no function was given */ - ops->hash = firm_default_hash; - } - - return ops; -#undef CASE } - -/* - * Sets the default operation for an ir_ops. - */ -ir_op_ops *firm_set_default_operations(unsigned code, ir_op_ops *ops) -{ - ops = firm_set_default_hash(code, ops); - ops = firm_set_default_computed_value(code, ops); - ops = firm_set_default_equivalent_node(code, ops); - ops = firm_set_default_transform_node(code, ops); - ops = firm_set_default_node_cmp_attr(code, ops); - ops = firm_set_default_get_type_attr(code, ops); - ops = firm_set_default_get_entity_attr(code, ops); - - return ops; -} /* firm_set_default_operations */