X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firopt.c;h=51e8854750cbd4c82c243762d1ab750553f18630;hb=eb47aca33f2f8c414409f3695e73277b47442334;hp=f90d692bd1ac70d9b0fc749789a47d298b5f63b8;hpb=1ed087ad8cec2ba94ab781f6e09981615e618754;p=libfirm diff --git a/ir/ir/iropt.c b/ir/ir/iropt.c index f90d692bd..51e885475 100644 --- a/ir/ir/iropt.c +++ b/ir/ir/iropt.c @@ -197,7 +197,7 @@ static ir_tarval *computed_value_Borrow(const ir_node *n) ir_tarval *tb = value_of(b); if ((ta != tarval_bad) && (tb != tarval_bad)) { - return tarval_cmp(ta, tb) == pn_Cmp_Lt ? get_mode_one(m) : get_mode_null(m); + return tarval_cmp(ta, tb) == ir_relation_less ? get_mode_one(m) : get_mode_null(m); } else if (tarval_is_null(ta)) { return get_mode_null(m); } @@ -435,7 +435,7 @@ static ir_tarval *computed_value_Mux(const ir_node *n) */ static ir_tarval *computed_value_Confirm(const ir_node *n) { - if (get_Confirm_cmp(n) == pn_Cmp_Eq) { + if (get_Confirm_relation(n) == ir_relation_equal) { ir_tarval *tv = value_of(get_Confirm_bound(n)); if (tv != tarval_bad) return tv; @@ -444,104 +444,72 @@ static ir_tarval *computed_value_Confirm(const ir_node *n) } /* computed_value_Confirm */ /** - * Return the value of a Proj(Cmp). - * - * This performs a first step of unreachable code elimination. - * Proj can not be computed, but folding a Cmp above the Proj here is - * not as wasteful as folding a Cmp into a Tuple of 16 Consts of which - * only 1 is used. - * There are several case where we can evaluate a Cmp node, see later. + * gives a (conservative) estimation of possible relation when comparing + * left+right */ -static ir_tarval *computed_value_Proj_Cmp(const ir_node *n) +ir_relation ir_get_possible_cmp_relations(const ir_node *left, + const ir_node *right) { - ir_node *cmp = get_Proj_pred(n); - ir_node *left = get_Cmp_left(cmp); - ir_node *right = get_Cmp_right(cmp); - pn_Cmp pn_cmp = get_Proj_pn_cmp(n); - ir_mode *mode = get_irn_mode(left); - ir_tarval *tv_l, *tv_r; - - /* - * BEWARE: a == a is NOT always True for floating Point values, as - * NaN != NaN is defined, so we must check this here. - */ - if (left == right && (!mode_is_float(mode) || pn_cmp == pn_Cmp_Lt || pn_cmp == pn_Cmp_Gt)) { - /* This is a trick with the bits used for encoding the Cmp - Proj numbers, the following statement is not the same: - return new_tarval_from_long(pn_cmp == pn_Cmp_Eq, mode_b) */ - return new_tarval_from_long(pn_cmp & pn_Cmp_Eq, mode_b); - } - tv_l = value_of(left); - tv_r = value_of(right); + ir_relation possible = ir_relation_true; + ir_tarval *tv_l = value_of(left); + ir_tarval *tv_r = value_of(right); + ir_mode *mode = get_irn_mode(left); + ir_tarval *min = mode == mode_b ? tarval_b_false : get_mode_min(mode); + ir_tarval *max = mode == mode_b ? tarval_b_true : get_mode_max(mode); + /* both values known - evaluate them */ if ((tv_l != tarval_bad) && (tv_r != tarval_bad)) { - /* - * The predecessors of Cmp are target values. We can evaluate - * the Cmp. - */ - pn_Cmp flags = tarval_cmp(tv_l, tv_r); - if (flags != pn_Cmp_False) { - return new_tarval_from_long (pn_cmp & flags, mode_b); - } - } else if (mode_is_int(mode)) { - /* for integer values, we can check against MIN/MAX */ - pn_Cmp cmp_result; - - if (tv_l == get_mode_min(mode)) { - /* MIN <=/> x. This results in true/false. */ - if (pn_cmp == pn_Cmp_Le) - return tarval_b_true; - else if (pn_cmp == pn_Cmp_Gt) - return tarval_b_false; - } else if (tv_r == get_mode_min(mode)) { - /* x >=/< MIN. This results in true/false. */ - if (pn_cmp == pn_Cmp_Ge) - return tarval_b_true; - else if (pn_cmp == pn_Cmp_Lt) - return tarval_b_false; - } else if (tv_l == get_mode_max(mode)) { - /* MAX >=/< x. This results in true/false. */ - if (pn_cmp == pn_Cmp_Ge) - return tarval_b_true; - else if (pn_cmp == pn_Cmp_Lt) - return tarval_b_false; - } else if (tv_r == get_mode_max(mode)) { - /* x <=/> MAX. This results in true/false. */ - if (pn_cmp == pn_Cmp_Le) - return tarval_b_true; - else if (pn_cmp == pn_Cmp_Gt) - return tarval_b_false; - } - - cmp_result = vrp_cmp(left, right); - if (cmp_result != pn_Cmp_False) { - if (cmp_result == pn_Cmp_Lg) { - if (pn_cmp == pn_Cmp_Eq) { - return tarval_b_false; - } else if (pn_cmp == pn_Cmp_Lg) { - return tarval_b_true; - } - } else { - return new_tarval_from_long(cmp_result & pn_cmp, mode_b); - } - } - } else if (mode_is_reference(mode)) { - /* pointer compare */ - ir_node *s_l = skip_Proj(left); - ir_node *s_r = skip_Proj(right); + possible = tarval_cmp(tv_l, tv_r); + /* we can return now, won't get any better */ + return possible; + } + /* a == a is never less or greater (but might be equal or unordered) */ + if (left == right) + possible &= ~ir_relation_less_greater; + /* unordered results only happen for float compares */ + if (!mode_is_float(mode)) + possible &= ~ir_relation_unordered; + /* values can never be less than the least representable number or + * greater than the greatest representable number */ + if (tv_l == min) + possible &= ~ir_relation_greater; + if (tv_l == max) + possible &= ~ir_relation_less; + if (tv_r == max) + possible &= ~ir_relation_greater; + if (tv_r == min) + possible &= ~ir_relation_less; + /* maybe vrp can tell us more */ + possible &= vrp_cmp(left, right); + /* Alloc nodes never return null (but throw an exception) */ + if (is_Alloc(left) && tarval_is_null(tv_r)) + possible &= ~ir_relation_equal; + + return possible; +} - if ((is_Alloc(s_l) && tarval_is_null(tv_r)) || - (tarval_is_null(tv_l) && is_Alloc(s_r))) { - /* - * The predecessors are Allocs and (void*)(0) constants. In Firm Allocs never - * return NULL, they raise an exception. Therefore we can predict - * the Cmp result. - */ - return new_tarval_from_long(pn_cmp & pn_Cmp_Lg, mode_b); - } - } - return computed_value_Cmp_Confirm(cmp, left, right, pn_cmp); -} /* computed_value_Proj_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) +{ + ir_node *left = get_Cmp_left(cmp); + ir_node *right = get_Cmp_right(cmp); + ir_relation possible = ir_get_possible_cmp_relations(left, right); + ir_relation relation = get_Cmp_relation(cmp); + + /* if none of the requested relations is possible, return false */ + if ((possible & relation) == ir_relation_false) + return tarval_b_false; + /* if possible relations are a subset of the requested ones return true */ + if ((possible & ~relation) == ir_relation_false) + return tarval_b_true; + + return computed_value_Cmp_Confirm(cmp, left, right, relation); +} /** * Calculate the value of an integer Div. @@ -631,7 +599,7 @@ 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) == pn_Cmp_Eq) { + if (vrp && vrp->valid && tarval_cmp(vrp->bits_set, vrp->bits_not_set) == ir_relation_equal) { return vrp->bits_set; } if (n->op->ops.computed_value) @@ -660,29 +628,29 @@ static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops break switch (code) { - CASE(Const); - CASE(SymConst); CASE(Add); - CASE(Sub); - CASE(Carry); + CASE(And); CASE(Borrow); + CASE(Carry); + CASE(Cmp); + CASE(Confirm); + CASE(Const); + CASE(Conv); + CASE(Eor); CASE(Minus); CASE(Mul); - CASE(And); - CASE(Or); - CASE(Eor); + CASE(Mux); CASE(Not); + CASE(Or); + CASE(Proj); + CASE(Rotl); CASE(Shl); CASE(Shr); CASE(Shrs); - CASE(Rotl); - CASE(Conv); - CASE(Mux); - CASE(Confirm); - CASE_PROJ(Cmp); + CASE(Sub); + CASE(SymConst); CASE_PROJ(Div); CASE_PROJ(Mod); - CASE(Proj); default: /* leave NULL */ break; @@ -704,10 +672,6 @@ static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops * * If all predecessors of a block are bad or lies in a dead * block, the current block is dead as well. - * - * Note, that blocks are NEVER turned into Bad's, instead - * the dead_block flag is set. So, never test for is_Bad(block), - * always use is_dead_Block(block). */ static ir_node *equivalent_node_Block(ir_node *n) { @@ -716,7 +680,7 @@ static ir_node *equivalent_node_Block(ir_node *n) ir_graph *irg; /* don't optimize dead or labeled blocks */ - if (is_Block_dead(n) || has_Block_entity(n)) + if (has_Block_entity(n)) return n; n_preds = get_Block_n_cfgpreds(n); @@ -727,32 +691,34 @@ static ir_node *equivalent_node_Block(ir_node *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 it is not the Start block. */ - /* !!! Beware, all Phi-nodes of n must have been optimized away. - This should be true, as the block is matured before optimize is called. - But what about Phi-cycles with the Phi0/Id that could not be resolved? - Remaining Phi nodes are just Ids. */ + * can be merged. */ if (n_preds == 1) { - ir_node *pred = skip_Proj(get_Block_cfgpred(n, 0)); + ir_node *pred = get_Block_cfgpred(n, 0); if (is_Jmp(pred)) { - ir_node *predblock = get_nodes_block(pred); - if (predblock == oldn) { - /* Jmp jumps into the block it is in -- deal self cycle. */ - n = set_Block_dead(n); - DBG_OPT_DEAD_BLOCK(oldn, n); - } else { - n = predblock; - DBG_OPT_STG(oldn, n); - } - } else if (is_Cond(pred)) { - ir_node *predblock = get_nodes_block(pred); - if (predblock == oldn) { - /* Jmp jumps into the block it is in -- deal self cycle. */ - n = set_Block_dead(n); - DBG_OPT_DEAD_BLOCK(oldn, n); - } + 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 @@ -767,64 +733,18 @@ static ir_node *equivalent_node_Block(ir_node *n) 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. */ + /* 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); } } - } else if (get_opt_unreachable_code() && - (n != get_irg_start_block(irg)) && - (n != get_irg_end_block(irg))) { - int i; - - /* If all inputs are dead, this block is dead too, except if it is - the start or end block. This is one step of unreachable code - elimination */ - for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) { - ir_node *pred = get_Block_cfgpred(n, i); - ir_node *pred_blk; - - if (is_Bad(pred)) continue; - pred_blk = get_nodes_block(skip_Proj(pred)); - - if (is_Block_dead(pred_blk)) continue; - - if (pred_blk != n) { - /* really found a living input */ - break; - } - } - if (i < 0) { - n = set_Block_dead(n); - DBG_OPT_DEAD_BLOCK(oldn, n); - } } return n; } /* equivalent_node_Block */ -/** - * Returns a equivalent node for a Jmp, a Bad :-) - * Of course this only happens if the Block of the Jmp is dead. - */ -static ir_node *equivalent_node_Jmp(ir_node *n) -{ - ir_node *oldn = n; - - /* unreachable code elimination */ - if (is_Block_dead(get_nodes_block(n))) { - ir_graph *irg = get_irn_irg(n); - n = get_irg_bad(irg); - DBG_OPT_DEAD_BLOCK(oldn, n); - } - return n; -} /* equivalent_node_Jmp */ - -/** Raise is handled in the same way as Jmp. */ -#define equivalent_node_Raise equivalent_node_Jmp - - /* We do not evaluate Cond here as we replace it by a new node, a Jmp. See transform_node_Proj_Cond(). */ @@ -1107,11 +1027,11 @@ static ir_node *equivalent_node_Or(ir_node *n) ir_tarval *tv; if (a == b) { - n = a; /* Or has it's own neutral element */ + n = a; /* idempotence */ DBG_OPT_ALGSIM0(oldn, n, FS_OPT_OR); return n; } - /* constants are cormalized to right, check this site first */ + /* constants are normalized to right, check this side first */ tv = value_of(b); if (tarval_is_null(tv)) { n = a; @@ -1140,11 +1060,11 @@ static ir_node *equivalent_node_And(ir_node *n) ir_tarval *tv; if (a == b) { - n = a; /* And has it's own neutral element */ + n = a; /* idempotence */ DBG_OPT_ALGSIM0(oldn, n, FS_OPT_AND); return n; } - /* constants are normalized to right, check this site first */ + /* constants are normalized to right, check this side first */ tv = value_of(b); if (tarval_is_all_one(tv)) { n = a; @@ -1341,31 +1261,18 @@ static ir_node *equivalent_node_Phi(ir_node *n) n_preds = get_Phi_n_preds(n); block = get_nodes_block(n); - /* Control dead */ - if (is_Block_dead(block)) { - ir_graph *irg = get_irn_irg(n); - return get_irg_bad(irg); - } - if (n_preds == 0) return n; /* Phi of dead Region without predecessors. */ + /* Phi of dead Region without predecessors. */ + if (n_preds == 0) + return n; /* Find first non-self-referencing input */ for (i = 0; i < n_preds; ++i) { first_val = get_Phi_pred(n, i); - if ( (first_val != n) /* not self pointer */ -#if 0 - /* BEWARE: when the if is changed to 1, Phi's will ignore it's Bad - * predecessors. Then, Phi nodes in dead code might be removed, causing - * nodes pointing to themself (Add's for instance). - * This is really bad and causes endless recursions in several - * code pathes, so we do NOT optimize such a code. - * This is not that bad as it sounds, optimize_cf() removes bad control flow - * (and bad Phi predecessors), so live code is optimized later. - */ - && (! is_Bad(get_Block_cfgpred(block, i))) -#endif - ) { /* value not dead */ - break; /* then found first value. */ + /* not self pointer */ + if (first_val != n) { + /* then found first value. */ + break; } } @@ -1379,13 +1286,7 @@ static ir_node *equivalent_node_Phi(ir_node *n) are non-self-referencing */ while (++i < n_preds) { ir_node *scnd_val = get_Phi_pred(n, i); - if ( (scnd_val != n) - && (scnd_val != first_val) -#if 0 - /* see above */ - && (! is_Bad(get_Block_cfgpred(block, i))) -#endif - ) { + if (scnd_val != n && scnd_val != first_val) { break; } } @@ -1624,20 +1525,12 @@ static ir_node *equivalent_node_Proj_Store(ir_node *proj) } /* equivalent_node_Proj_Store */ /** - * Does all optimizations on nodes that must be done on it's Proj's + * Does all optimizations on nodes that must be done on its Projs * because of creating new nodes. */ static ir_node *equivalent_node_Proj(ir_node *proj) { ir_node *n = get_Proj_pred(proj); - - if (get_irn_mode(proj) == mode_X) { - if (is_Block_dead(get_nodes_block(n))) { - /* Remove dead control flow -- early gigo(). */ - ir_graph *irg = get_irn_irg(proj); - return get_irg_bad(irg); - } - } if (n->op->ops.equivalent_node_Proj) return n->op->ops.equivalent_node_Proj(proj); return proj; @@ -1701,65 +1594,65 @@ static ir_node *equivalent_node_Mux(ir_node *n) DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_EQ); return n; } - if (is_Proj(sel) && !mode_honor_signed_zeros(get_irn_mode(n))) { - ir_node *cmp = get_Proj_pred(sel); - long proj_nr = get_Proj_proj(sel); - ir_node *f = get_Mux_false(n); - ir_node *t = get_Mux_true(n); + if (is_Cmp(sel) && !mode_honor_signed_zeros(get_irn_mode(n))) { + ir_relation relation = get_Cmp_relation(sel); + ir_node *f = get_Mux_false(n); + ir_node *t = get_Mux_true(n); /* * 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 first one. */ - if (is_Cmp(cmp)) { - ir_node *const cmp_l = get_Cmp_left(cmp); - ir_node *const cmp_r = get_Cmp_right(cmp); - - switch (proj_nr) { - case pn_Cmp_Eq: - if ((cmp_l == t && cmp_r == f) || /* Mux(t == f, t, f) -> f */ - (cmp_l == f && cmp_r == t)) { /* Mux(f == t, t, f) -> f */ - n = f; - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); - return n; - } - break; + ir_node *const cmp_l = get_Cmp_left(sel); + ir_node *const cmp_r = get_Cmp_right(sel); + + switch (relation) { + case ir_relation_equal: + if ((cmp_l == t && cmp_r == f) || /* Mux(t == f, t, f) -> f */ + (cmp_l == f && cmp_r == t)) { /* Mux(f == t, t, f) -> f */ + n = f; + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); + return n; + } + break; - case pn_Cmp_Lg: - case pn_Cmp_Ne: - if ((cmp_l == t && cmp_r == f) || /* Mux(t != f, t, f) -> t */ - (cmp_l == f && cmp_r == t)) { /* Mux(f != t, t, f) -> t */ - n = t; - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); - return n; - } - break; + case ir_relation_less_greater: + case ir_relation_unordered_less_greater: + if ((cmp_l == t && cmp_r == f) || /* Mux(t != f, t, f) -> t */ + (cmp_l == f && cmp_r == t)) { /* Mux(f != t, t, f) -> t */ + n = t; + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); + return n; } + break; + default: + break; + } - /* - * Note: normalization puts the constant on the right side, - * so we check only one case. - */ - if (cmp_l == t && tarval_is_null(value_of(cmp_r))) { - /* Mux(t CMP 0, X, t) */ - if (is_Minus(f) && get_Minus_op(f) == t) { - /* Mux(t CMP 0, -t, t) */ - if (proj_nr == pn_Cmp_Eq) { - /* Mux(t == 0, -t, t) ==> -t */ - n = f; - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); - } else if (proj_nr == pn_Cmp_Lg || proj_nr == pn_Cmp_Ne) { - /* Mux(t != 0, -t, t) ==> t */ - n = t; - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); - } + /* + * Note: normalization puts the constant on the right side, + * so we check only one case. + */ + if (cmp_l == t && tarval_is_null(value_of(cmp_r))) { + /* Mux(t CMP 0, X, t) */ + if (is_Minus(f) && get_Minus_op(f) == t) { + /* Mux(t CMP 0, -t, t) */ + if (relation == ir_relation_equal) { + /* Mux(t == 0, -t, t) ==> -t */ + n = f; + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); + } else if (relation == ir_relation_less_greater || relation == ir_relation_unordered_less_greater) { + /* Mux(t != 0, -t, t) ==> t */ + n = t; + DBG_OPT_ALGSIM0(oldn, n, FS_OPT_MUX_TRANSFORM); } } } } + return n; -} /* equivalent_node_Mux */ +} /** * Remove Confirm nodes if setting is on. @@ -1767,17 +1660,16 @@ static ir_node *equivalent_node_Mux(ir_node *n) */ static ir_node *equivalent_node_Confirm(ir_node *n) { - ir_node *pred = get_Confirm_value(n); - pn_Cmp pnc = get_Confirm_cmp(n); + ir_node *pred = get_Confirm_value(n); + ir_relation relation = get_Confirm_relation(n); - while (is_Confirm(pred) && pnc == get_Confirm_cmp(pred)) { + while (is_Confirm(pred) && relation == get_Confirm_relation(pred)) { /* * rare case: two identical Confirms one after another, * replace the second one with the first. */ n = pred; pred = get_Confirm_value(n); - pnc = get_Confirm_cmp(n); } return n; } @@ -1818,8 +1710,6 @@ static ir_op_ops *firm_set_default_equivalent_node(ir_opcode code, ir_op_ops *op switch (code) { CASE(Block); - CASE(Jmp); - CASE(Raise); CASE(Eor); CASE(Add); CASE(Shl); @@ -2404,19 +2294,19 @@ restart: /* 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_block = get_nodes_block(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 *sub = new_rd_Sub(s_dbg, s_block, a, s_left, 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); - ir_node *a_block = get_nodes_block(n); if (s_mode != mode) - s_right = new_r_Conv(a_block, s_right, mode); - n = new_rd_Add(a_dbg, a_block, sub, s_right, 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); @@ -2990,32 +2880,6 @@ make_tuple: return n; } /* transform_node_Mod */ -/** - * Optimize -a CMP -b into b CMP a. - * This works only for for modes where unary Minus - * cannot Overflow. - * Note that two-complement integers can Overflow - * so it will NOT work. - * - * For == and != can be handled in Proj(Cmp) - */ -static ir_node *transform_node_Cmp(ir_node *n) -{ - ir_node *oldn = n; - ir_node *left = get_Cmp_left(n); - ir_node *right = get_Cmp_right(n); - - if (is_Minus(left) && is_Minus(right) && - !mode_overflow_on_unary_Minus(get_irn_mode(left))) { - ir_node *const new_left = get_Minus_op(right); - ir_node *const new_right = get_Minus_op(left); - n = new_rd_Cmp(get_irn_dbg_info(n), get_nodes_block(n), new_left, new_right); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_CMP_OP_OP); - } - return n; -} /* transform_node_Cmp */ - - /** * Transform a Cond node. * @@ -3166,6 +3030,17 @@ static ir_node *transform_bitwise_distributive(ir_node *n, return n; } +/** + * Create a 0 constant of given mode. + */ +static ir_node *create_zero_const(ir_graph *irg, ir_mode *mode) +{ + ir_tarval *tv = get_mode_null(mode); + ir_node *cnst = new_r_Const(irg, tv); + + return cnst; +} + /** * Transform an And. */ @@ -3177,23 +3052,42 @@ static ir_node *transform_node_And(ir_node *n) ir_mode *mode; vrp_attr *a_vrp, *b_vrp; + 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); + } + } + mode = get_irn_mode(n); HANDLE_BINOP_PHI((eval_func) tarval_and, a, b, c, mode); - /* we can evaluate 2 Projs of the same Cmp */ - if (mode == mode_b && is_Proj(a) && is_Proj(b)) { - ir_node *pred_a = get_Proj_pred(a); - ir_node *pred_b = get_Proj_pred(b); - if (pred_a == pred_b) { - dbg_info *dbgi = get_irn_dbg_info(n); - pn_Cmp pn_a = get_Proj_pn_cmp(a); - pn_Cmp pn_b = get_Proj_pn_cmp(b); - /* yes, we can simply calculate with pncs */ - pn_Cmp new_pnc = pn_a & pn_b; - - return new_rd_Proj(dbgi, pred_a, mode_b, new_pnc); - } - } if (is_Or(a)) { if (is_Not(b)) { ir_node *op = get_Not_op(b); @@ -3297,7 +3191,7 @@ static ir_node *transform_node_And(ir_node *n) 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)) == pn_Cmp_Eq)) { + b_vrp->bits_not_set), get_Const_tarval(a)) == ir_relation_equal)) { return b; @@ -3305,7 +3199,7 @@ static ir_node *transform_node_And(ir_node *n) 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)) == pn_Cmp_Eq)) { + a_vrp->bits_not_set), get_Const_tarval(b)) == ir_relation_equal)) { return a; } @@ -3351,23 +3245,24 @@ static ir_node *transform_node_Eor(ir_node *n) ir_node *b = get_Eor_right(n); ir_mode *mode = get_irn_mode(n); - HANDLE_BINOP_PHI((eval_func) tarval_eor, a, b, c, mode); - - /* we can evaluate 2 Projs of the same Cmp */ - if (mode == mode_b && is_Proj(a) && is_Proj(b)) { - ir_node *pred_a = get_Proj_pred(a); - ir_node *pred_b = get_Proj_pred(b); - if (pred_a == pred_b) { - dbg_info *dbgi = get_irn_dbg_info(n); - pn_Cmp pn_a = get_Proj_pn_cmp(a); - pn_Cmp pn_b = get_Proj_pn_cmp(b); - /* yes, we can simply calculate with pncs */ - pn_Cmp new_pnc = pn_a ^ pn_b; - - return new_rd_Proj(dbgi, pred_a, mode_b, new_pnc); + /* 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); } } + 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); @@ -3410,15 +3305,14 @@ static ir_node *transform_node_Not(ir_node *n) HANDLE_UNOP_PHI(tarval_not,a,c); /* check for a boolean Not */ - if (mode == mode_b && is_Proj(a)) { - ir_node *a_pred = get_Proj_pred(a); - if (is_Cmp(a_pred)) { - /* We negate a Cmp. The Cmp has the negated result anyways! */ - n = new_r_Proj(get_Proj_pred(a), - mode_b, get_negated_pnc(get_Proj_proj(a), mode_b)); - DBG_OPT_ALGSIM0(oldn, n, FS_OPT_NOT_CMP); - return n; - } + 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; } /* normalize ~(a ^ b) => a ^ ~b */ @@ -3452,7 +3346,7 @@ static ir_node *transform_node_Not(ir_node *n) } } return n; -} /* transform_node_Not */ +} /** * Transform a Minus. @@ -3736,80 +3630,81 @@ static ir_node *transform_node_Proj_Mod(ir_node *proj) */ static ir_node *transform_node_Proj_Cond(ir_node *proj) { - if (get_opt_unreachable_code()) { - ir_node *n = get_Proj_pred(proj); - ir_node *b = get_Cond_selector(n); + ir_node *n = get_Proj_pred(proj); + ir_node *b = get_Cond_selector(n); - if (mode_is_int(get_irn_mode(b))) { - ir_tarval *tb = value_of(b); + if (!get_opt_unreachable_code()) + return n; - if (tb != tarval_bad) { - /* we have a constant switch */ - long num = get_Proj_proj(proj); + if (mode_is_int(get_irn_mode(b))) { + ir_tarval *tb = value_of(b); - 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); - } - } - } 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) { - pn_Cmp cmp_result = tarval_cmp(b_vrp->range_bottom, tp); - pn_Cmp cmp_result2 = tarval_cmp(b_vrp->range_top, tp); - - if ((cmp_result & pn_Cmp_Gt) == cmp_result && (cmp_result2 - & pn_Cmp_Lt) == cmp_result2) { - ir_graph *irg = get_irn_irg(proj); - return get_irg_bad(irg); - } - } else if (b_vrp->range_type == VRP_ANTIRANGE) { - pn_Cmp cmp_result = tarval_cmp(b_vrp->range_bottom, tp); - pn_Cmp cmp_result2 = tarval_cmp(b_vrp->range_top, tp); - - if ((cmp_result & pn_Cmp_Le) == cmp_result && (cmp_result2 - & pn_Cmp_Ge) == cmp_result2) { - ir_graph *irg = get_irn_irg(proj); - return get_irg_bad(irg); - } - } + if (tb != tarval_bad) { + /* we have a constant switch */ + long num = get_Proj_proj(proj); - if (!(tarval_cmp( - tarval_and( b_vrp->bits_set, tp), - b_vrp->bits_set - ) == pn_Cmp_Eq)) { + 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); + } + } + } 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 (!(tarval_cmp( - tarval_and( - tarval_not(tp), - tarval_not(b_vrp->bits_not_set)), - tarval_not(b_vrp->bits_not_set)) - == pn_Cmp_Eq)) { + 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); } + + } } } return proj; -} /* transform_node_Proj_Cond */ +} /** * return true if the operation returns a value with exactly 1 bit set @@ -3834,55 +3729,28 @@ static bool is_single_bit(const ir_node *node) } /** - * Create a 0 constant of given mode. + * Normalizes and optimizes Cmp nodes. */ -static ir_node *create_zero_const(ir_graph *irg, ir_mode *mode) +static ir_node *transform_node_Cmp(ir_node *n) { - ir_tarval *tv = get_mode_null(mode); - ir_node *cnst = new_r_Const(irg, tv); + 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); - return cnst; -} - -/** - * Normalizes and optimizes Cmp nodes. - */ -static ir_node *transform_node_Proj_Cmp(ir_node *proj) -{ - ir_node *n = get_Proj_pred(proj); - ir_node *left = get_Cmp_left(n); - ir_node *right = get_Cmp_right(n); - ir_tarval *tv = NULL; - int changed = 0; - ir_mode *mode = get_irn_mode(left); - long proj_nr = get_Proj_proj(proj); - - /* we can evaluate some cases directly */ - switch (proj_nr) { - case pn_Cmp_False: { - ir_graph *irg = get_irn_irg(proj); - return new_r_Const(irg, get_tarval_b_false()); - } - case pn_Cmp_True: { - ir_graph *irg = get_irn_irg(proj); - return new_r_Const(irg, get_tarval_b_true()); - } - case pn_Cmp_Leg: - if (!mode_is_float(mode)) { - ir_graph *irg = get_irn_irg(proj); - return new_r_Const(irg, get_tarval_b_true()); - } - break; - default: - break; + /* mask out impossible relations */ + ir_relation new_relation = relation & possible; + if (new_relation != relation) { + relation = new_relation; + changed = true; } - /* remove Casts of both sides */ - left = skip_Cast(left); - right = skip_Cast(right); - /* Remove unnecessary conversions */ - /* TODO handle constants */ + /* 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); @@ -3896,24 +3764,38 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (mode_left == mode_right) { left = op_left; right = op_right; - changed |= 1; + 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 |= 1; + 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 |= 1; + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); } } } + /* + * 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); + } + /* remove operation on both sides if possible */ - if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) { + 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 @@ -3931,7 +3813,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) /* ~a CMP ~b => a CMP b, -a CMP -b ==> a CMP b */ left = get_unop_op(left); right = get_unop_op(right); - changed |= 1; + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); break; case iro_Add: @@ -3944,25 +3826,25 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) /* X + a CMP X + b ==> a CMP b */ left = lr; right = rr; - changed |= 1; + 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 |= 1; + 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 |= 1; + 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 |= 1; + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); } break; @@ -3976,13 +3858,13 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) /* X - a CMP X - b ==> a CMP b */ left = lr; right = rr; - changed |= 1; + 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 |= 1; + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); } break; @@ -3991,7 +3873,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) /* a ROTL X CMP b ROTL X ==> a CMP b */ left = get_Rotl_left(left); right = get_Rotl_left(right); - changed |= 1; + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); } break; @@ -4013,8 +3895,8 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (ll == right) { ir_graph *irg = get_irn_irg(n); left = lr; - right = create_zero_const(irg, mode); - changed |= 1; + right = create_zero_const(irg, mode); + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); } } @@ -4030,28 +3912,11 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (rl == left) { ir_graph *irg = get_irn_irg(n); left = rr; - right = create_zero_const(irg, mode); - changed |= 1; + right = create_zero_const(irg, mode); + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_OP); } } - /* Cmp(And(1bit, val), 1bit) "bit-testing" can be replaced - * by the simpler Cmp(And(1bit), val), 0) negated pnc */ - if (is_And(left)) { - 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); - proj_nr = get_negated_pnc(proj_nr, mode); - right = create_zero_const(irg, mode); - changed |= 1; - } - } if (is_And(left) && is_Const(right)) { ir_node *ll = get_binop_left(left); @@ -4074,7 +3939,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) left = new_rd_And(dbg, block, get_Shr_left(ll), new_r_Const(irg, mask), mode); right = new_r_Const(irg, value); - changed |= 1; + changed = true; } } } @@ -4083,26 +3948,64 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (is_Const(right) && is_Const_null(right) && is_Eor(left)) { right = get_Eor_right(left); left = get_Eor_left(left); - changed |= 1; + changed = true; } } /* mode_is_int(...) */ - } /* proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg */ + } + + /* 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; + } + } /* replace mode_b compares with ands/ors */ - if (get_irn_mode(left) == mode_b) { + if (mode == mode_b) { ir_node *block = get_nodes_block(n); ir_node *bres; - switch (proj_nr) { - case pn_Cmp_Le: bres = new_r_Or( block, new_r_Not(block, left, mode_b), right, mode_b); break; - case pn_Cmp_Lt: bres = new_r_And(block, new_r_Not(block, left, mode_b), right, mode_b); break; - case pn_Cmp_Ge: bres = new_r_Or( block, left, new_r_Not(block, right, mode_b), mode_b); break; - case pn_Cmp_Gt: bres = new_r_And(block, left, new_r_Not(block, right, mode_b), mode_b); break; - case pn_Cmp_Lg: bres = new_r_Eor(block, left, right, mode_b); break; - case pn_Cmp_Eq: bres = new_r_Not(block, new_r_Eor(block, left, right, mode_b), mode_b); break; - default: bres = NULL; - } - if (bres) { + 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; } @@ -4115,12 +4018,11 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) */ if (!operands_are_normalized(left, right)) { ir_node *t = left; - left = right; right = t; - proj_nr = get_inversed_pnc(proj_nr); - changed |= 1; + relation = get_inversed_relation(relation); + changed = true; } /* @@ -4131,7 +4033,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) */ tv = value_of(right); if (tv != tarval_bad) { - mode = get_irn_mode(right); + ir_mode *mode = get_irn_mode(right); /* TODO extend to arbitrary constants */ if (is_Conv(left) && tarval_is_null(tv)) { @@ -4144,13 +4046,13 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) * win. (on the other side it makes detection/creation of fabs hard) */ if (get_mode_size_bits(mode) > get_mode_size_bits(op_mode) && - ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) || + ((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; - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CONV); } } @@ -4166,60 +4068,53 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) */ if (is_Minus(left) && (!mode_overflow_on_unary_Minus(mode) || - (mode_is_int(mode) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)))) { + (mode_is_int(mode) && (relation == ir_relation_equal || relation == ir_relation_less_greater)))) { tv = tarval_neg(tv); if (tv != tarval_bad) { left = get_Minus_op(left); - proj_nr = get_inversed_pnc(proj_nr); - changed |= 2; + relation = get_inversed_relation(relation); + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); } - } else if (is_Not(left) && (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg)) { + } else if (is_Not(left) && (relation == ir_relation_equal || relation == ir_relation_less_greater)) { /* Not(a) ==/!= c ==> a ==/!= Not(c) */ tv = tarval_not(tv); if (tv != tarval_bad) { left = get_Not_op(left); - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); } } /* for integer modes, we have more */ if (mode_is_int(mode)) { - /* Ne includes Unordered which is not possible on integers. - * However, frontends often use this wrong, so fix it here */ - if (proj_nr & pn_Cmp_Uo) { - proj_nr &= ~pn_Cmp_Uo; - set_Proj_proj(proj, proj_nr); - } - /* c > 0 : a < c ==> a <= (c-1) a >= c ==> a > (c-1) */ - if ((proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Ge) && - tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Gt) { + 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); if (tv != tarval_bad) { - proj_nr ^= pn_Cmp_Eq; - changed |= 2; + 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 ((proj_nr == pn_Cmp_Gt || proj_nr == pn_Cmp_Le) && - tarval_cmp(tv, get_mode_null(mode)) == pn_Cmp_Lt) { + 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)); if (tv != tarval_bad) { - proj_nr ^= pn_Cmp_Eq; - changed |= 2; + relation ^= ir_relation_equal; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); } } /* the following reassociations work only for == and != */ - if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) { + if (relation == ir_relation_equal || relation == ir_relation_less_greater) { #if 0 /* Might be not that good in general */ /* a-b == 0 ==> a == b, a-b != 0 ==> a != b */ @@ -4245,7 +4140,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (tv2 != tarval_bad) { left = get_Sub_left(left); tv = tv2; - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); } } @@ -4271,7 +4166,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (tv2 != tarval_bad) { left = a; tv = tv2; - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); } } @@ -4283,7 +4178,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (tv2 != tarval_bad) { left = get_Minus_op(left); tv = tv2; - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_OP_C); } } @@ -4291,7 +4186,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) } /* == or != */ } /* mode_is_int */ - if (proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) { + if (relation == ir_relation_equal || relation == ir_relation_less_greater) { switch (get_irn_opcode(left)) { ir_node *c1; @@ -4306,9 +4201,9 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (mask != tv) { /* TODO: move to constant evaluation */ ir_graph *irg = get_irn_irg(n); - tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true(); + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(proj, c1); + DBG_OPT_CSTEVAL(n, c1); return c1; } @@ -4327,8 +4222,8 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (get_Const_tarval(c1) == tv) { /* fine: do the transformation */ tv = get_mode_null(get_tarval_mode(tv)); - proj_nr ^= pn_Cmp_Leg; - changed |= 2; + relation ^= ir_relation_less_equal_greater; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_CNST_MAGN); } } @@ -4344,9 +4239,9 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (! tarval_is_null(get_Const_tarval(c1))) { /* TODO: move to constant evaluation */ ir_graph *irg = get_irn_irg(n); - tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true(); + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(proj, c1); + DBG_OPT_CSTEVAL(n, c1); return c1; } } @@ -4370,16 +4265,16 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (tarval_and(tv, cmask) != tv) { /* condition not met */ - tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true(); + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(proj, c1); + 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); - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); } break; @@ -4402,16 +4297,16 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (tarval_and(tv, cmask) != tv) { /* condition not met */ - tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true(); + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(proj, c1); + 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); - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); } break; @@ -4437,16 +4332,16 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) if (!tarval_is_all_one(cond) && !tarval_is_null(cond)) { /* condition not met */ - tv = proj_nr == pn_Cmp_Eq ? get_tarval_b_false() : get_tarval_b_true(); + tv = relation == ir_relation_equal ? get_tarval_b_false() : get_tarval_b_true(); c1 = new_r_Const(irg, tv); - DBG_OPT_CSTEVAL(proj, c1); + 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); - changed |= 2; + changedc = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_SHF_TO_AND); } break; @@ -4455,12 +4350,13 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) } /* tarval != bad */ } - if (changed & 2) { /* need a new Const */ + if (changedc) { /* need a new Const */ ir_graph *irg = get_irn_irg(n); right = new_r_Const(irg, tv); + changed = true; } - if ((proj_nr == pn_Cmp_Eq || proj_nr == pn_Cmp_Lg) && is_Const(right) && is_Const_null(right) && is_Proj(left)) { + 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_Mod(op) && get_Proj_proj(left) == pn_Mod_res) { @@ -4478,7 +4374,7 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) 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 |= 1; + changed = true; DBG_OPT_ALGSIM0(n, n, FS_OPT_CMP_MOD_TO_AND); } } @@ -4486,15 +4382,15 @@ static ir_node *transform_node_Proj_Cmp(ir_node *proj) } if (changed) { - ir_node *block = get_nodes_block(n); + dbg_info *dbgi = get_irn_dbg_info(n); + ir_node *block = get_nodes_block(n); /* create a new compare */ - n = new_rd_Cmp(get_irn_dbg_info(n), block, left, right); - proj = new_rd_Proj(get_irn_dbg_info(proj), n, get_irn_mode(proj), proj_nr); + n = new_rd_Cmp(dbgi, block, left, right, relation); } - return proj; -} /* transform_node_Proj_Cmp */ + return n; +} /** * Optimize CopyB(mem, x, x) into a Nop. @@ -4581,7 +4477,7 @@ static ir_node *transform_node_Proj_Bound(ir_node *proj) } /* transform_node_Proj_Bound */ /** - * Does all optimizations on nodes that must be done on it's Proj's + * 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) @@ -4593,28 +4489,38 @@ static ir_node *transform_node_Proj(ir_node *proj) return proj; } /* transform_node_Proj */ -/** - * Move Confirms down through Phi nodes. - */ static ir_node *transform_node_Phi(ir_node *phi) { - int i, n; - ir_mode *mode = get_irn_mode(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 = get_irg_bad(irg); + int i; + + /* 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); + } + /* Move Confirms down through Phi nodes. */ if (mode_is_reference(mode)) { n = get_irn_arity(phi); /* Beware of Phi0 */ if (n > 0) { - ir_node *pred = get_irn_n(phi, 0); - ir_node *bound, *new_phi, *block, **in; - pn_Cmp pnc; + ir_node *pred = get_irn_n(phi, 0); + ir_node *bound, *new_phi, *block, **in; + ir_relation relation; if (! is_Confirm(pred)) return phi; - bound = get_Confirm_bound(pred); - pnc = get_Confirm_cmp(pred); + bound = get_Confirm_bound(pred); + relation = get_Confirm_relation(pred); NEW_ARR_A(ir_node *, in, n); in[0] = get_Confirm_value(pred); @@ -4624,18 +4530,18 @@ static ir_node *transform_node_Phi(ir_node *phi) if (! is_Confirm(pred) || get_Confirm_bound(pred) != bound || - get_Confirm_cmp(pred) != pnc) + get_Confirm_relation(pred) != relation) return phi; in[i] = get_Confirm_value(pred); } /* 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, pnc); + return new_r_Confirm(block, new_phi, bound, relation); } } return phi; -} /* transform_node_Phi */ +} /** * Returns the operands of a commutative bin-op, if one operand is @@ -4818,7 +4724,7 @@ static ir_node *transform_node_Or_Rotl(ir_node *irn_or) /* Note: the obvious rot formulation (a << x) | (a >> (32-x)) gets * transformed to (a << x) | (a >> -x) by transform_node_shift_modulo() */ - if (!is_negated_value(c1, c2)) { + if (!ir_is_negated_value(c1, c2)) { return irn_or; } @@ -4829,6 +4735,22 @@ static ir_node *transform_node_Or_Rotl(ir_node *irn_or) return n; } /* transform_node_Or_Rotl */ +static bool is_cmp_unequal_zero(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 (!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; + } +} + /** * Transform an Or. */ @@ -4852,18 +4774,33 @@ static ir_node *transform_node_Or(ir_node *n) return n; } - /* we can evaluate 2 Projs of the same Cmp */ - if (get_irn_mode(n) == mode_b && is_Proj(a) && is_Proj(b)) { - ir_node *pred_a = get_Proj_pred(a); - ir_node *pred_b = get_Proj_pred(b); - if (pred_a == pred_b) { - dbg_info *dbgi = get_irn_dbg_info(n); - pn_Cmp pn_a = get_Proj_pn_cmp(a); - pn_Cmp pn_b = get_Proj_pn_cmp(b); - /* yes, we can simply calculate with pncs */ - pn_Cmp new_pnc = pn_a | pn_b; - - return new_rd_Proj(dbgi, pred_a, mode_b, new_pnc); + /* 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); + } + /* 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); } } @@ -4926,7 +4863,7 @@ static ir_node *transform_node_shift(ir_node *n) assert(modulo_shf >= (int) get_mode_size_bits(mode)); /* shifting too much */ - if (!(tarval_cmp(res, modulo) & pn_Cmp_Lt)) { + 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); @@ -5063,7 +5000,7 @@ static ir_node *transform_node_shl_shr(ir_node *n) ir_tarval *tv_shift; ir_tarval *tv_mask; ir_graph *irg; - pn_Cmp pnc; + ir_relation relation; int need_shrs = 0; assert(is_Shl(n) || is_Shr(n) || is_Shrs(n)); @@ -5085,7 +5022,7 @@ static ir_node *transform_node_shl_shr(ir_node *n) if (is_Shrs(left)) { /* shrs variant only allowed if c1 >= c2 */ - if (! (tarval_cmp(tv_shl, tv_shr) & pn_Cmp_Ge)) + if (! (tarval_cmp(tv_shl, tv_shr) & ir_relation_greater_equal)) return n; tv_mask = tarval_shrs(get_mode_all_one(mode), tv_shr); @@ -5121,8 +5058,8 @@ static ir_node *transform_node_shl_shr(ir_node *n) irg = get_irn_irg(block); dbgi = get_irn_dbg_info(n); - pnc = tarval_cmp(tv_shl, tv_shr); - if (pnc == pn_Cmp_Lt || pnc == pn_Cmp_Eq) { + relation = tarval_cmp(tv_shl, tv_shr); + if (relation == ir_relation_less || relation == ir_relation_equal) { tv_shift = tarval_sub(tv_shr, tv_shl, NULL); new_const = new_r_Const(irg, tv_shift); if (need_shrs) { @@ -5131,7 +5068,7 @@ static ir_node *transform_node_shl_shr(ir_node *n) new_shift = new_rd_Shr(dbgi, block, x, new_const, mode); } } else { - assert(pnc == pn_Cmp_Gt); + assert(relation == ir_relation_greater); tv_shift = tarval_sub(tv_shl, tv_shr, NULL); new_const = new_r_Const(irg, tv_shift); new_shift = new_rd_Shl(dbgi, block, x, new_const, mode); @@ -5381,14 +5318,7 @@ 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_Block(ka)) { - if (! is_Block_dead(ka)) { - in[j++] = ka; - } - continue; - } else if (is_irn_pinned_in_irg(ka) && is_Block_dead(get_nodes_block(ka))) { - continue; - } else if (is_Bad(ka)) { + if (is_Bad(ka)) { /* no need to keep Bad */ continue; } @@ -5399,7 +5329,7 @@ static ir_node *transform_node_End(ir_node *n) return n; } /* transform_node_End */ -bool is_negated_value(ir_node *a, ir_node *b) +int ir_is_negated_value(const ir_node *a, const ir_node *b) { if (is_Minus(a) && get_Minus_op(a) == b) return true; @@ -5488,21 +5418,20 @@ static ir_node *transform_node_Mux(ir_node *n) /* first normalization step: try to move a constant to the false side, * 0 preferred on false side too */ - if (is_Proj(sel)) { - ir_node *cmp = get_Proj_pred(sel); - - if (is_Cmp(cmp) && is_Const(t) && - (!is_Const(f) || (is_Const_null(t) && !is_Const_null(f)))) { - pn_Cmp pnc = get_Proj_pn_cmp(sel); - ir_node *tmp = t; - t = f; - f = tmp; - - /* Mux(x, a, b) => Mux(not(x), b, a) */ - sel = new_r_Proj(cmp, mode_b, - get_negated_pnc(pnc, get_irn_mode(get_Cmp_left(cmp)))); - n = new_rd_Mux(get_irn_dbg_info(n), get_nodes_block(n), sel, f, t, mode); - } + if (is_Cmp(sel) && is_Const(t) && + (!is_Const(f) || (is_Const_null(t) && !is_Const_null(f)))) { + dbg_info *seldbgi = get_irn_dbg_info(sel); + ir_node *block = get_nodes_block(sel); + ir_relation relation = get_Cmp_relation(sel); + ir_node *tmp = t; + t = f; + f = tmp; + + /* Mux(x, a, b) => Mux(not(x), b, a) */ + 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); } /* note: after normalization, false can only happen on default */ @@ -5565,77 +5494,69 @@ static ir_node *transform_node_Mux(ir_node *n) } } - if (is_Proj(sel)) { - ir_node *cmp = get_Proj_pred(sel); - long pn = get_Proj_proj(sel); + if (is_Cmp(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); - /* - * Note: normalization puts the constant on the right side, - * so we check only one case. - */ - if (is_Cmp(cmp)) { - ir_node *cmp_r = get_Cmp_right(cmp); - if (is_Const(cmp_r) && is_Const_null(cmp_r)) { - ir_node *block = get_nodes_block(n); - ir_node *cmp_l = get_Cmp_left(cmp); - - if (mode_is_int(mode)) { - /* integer only */ - if ((pn == pn_Cmp_Lg || pn == pn_Cmp_Eq) && 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 (pn == pn_Cmp_Lg) { - /* Mux((a & 2^C) != 0, 2^C, 0) */ + 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, cmp, sel, n, FS_OPT_MUX_TO_BITOP); + DBG_OPT_ALGSIM1(oldn, sel, sel, n, FS_OPT_MUX_TO_BITOP); } else { - /* Mux((a & 2^C) == 0, 2^C, 0) */ + /* (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, cmp, sel, n, FS_OPT_MUX_TO_BITOP); + 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 (pn == pn_Cmp_Lg) { - /* (a & (1 << n)) != 0, (1 << n), 0) */ - n = cmp_l; - DBG_OPT_ALGSIM1(oldn, cmp, 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, cmp, 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 (pn == pn_Cmp_Lg) { - /* ((1 << n) & a) != 0, (1 << n), 0) */ - n = cmp_l; - DBG_OPT_ALGSIM1(oldn, cmp, 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, cmp, 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; } } } @@ -5645,7 +5566,7 @@ static ir_node *transform_node_Mux(ir_node *n) } return n; -} /* transform_node_Mux */ +} /** * optimize Sync nodes that have other syncs as input we simply add the inputs @@ -5691,6 +5612,66 @@ static ir_node *transform_node_Sync(ir_node *n) return n; } /* transform_node_Sync */ +static ir_node *transform_node_Load(ir_node *n) +{ + /* if our memory predecessor is a load from the same address, then reuse the + * previous result */ + ir_node *mem = get_Load_mem(n); + ir_node *mem_pred; + + if (!is_Proj(mem)) + return n; + /* don't touch volatile loads */ + if (get_Load_volatility(n) == volatility_is_volatile) + return n; + mem_pred = get_Proj_pred(mem); + if (is_Load(mem_pred)) { + ir_node *pred_load = mem_pred; + + /* conservatively compare the 2 loads. TODO: This could be less strict + * with fixup code in some situations (like smaller/bigger modes) */ + if (get_Load_ptr(pred_load) != get_Load_ptr(n)) + return n; + if (get_Load_mode(pred_load) != get_Load_mode(n)) + return n; + /* all combinations of aligned/unaligned pred/n should be fine so we do + * not compare the unaligned attribute */ + { + ir_node *block = get_nodes_block(n); + ir_node *jmp = new_r_Jmp(block); + ir_graph *irg = get_irn_irg(n); + ir_node *bad = get_irg_bad(irg); + ir_mode *mode = get_Load_mode(n); + ir_node *res = new_r_Proj(pred_load, mode, pn_Load_res); + ir_node *in[pn_Load_max] = { mem, jmp, bad, res }; + ir_node *tuple = new_r_Tuple(block, ARRAY_SIZE(in), in); + return tuple; + } + } else if (is_Store(mem_pred)) { + ir_node *pred_store = mem_pred; + ir_node *value = get_Store_value(pred_store); + + if (get_Store_ptr(pred_store) != get_Load_ptr(n)) + return n; + if (get_irn_mode(value) != get_Load_mode(n)) + return n; + /* all combinations of aligned/unaligned pred/n should be fine so we do + * not compare the unaligned attribute */ + { + ir_node *block = get_nodes_block(n); + ir_node *jmp = new_r_Jmp(block); + ir_graph *irg = get_irn_irg(n); + ir_node *bad = get_irg_bad(irg); + ir_node *res = value; + ir_node *in[pn_Load_max] = { mem, jmp, bad, res }; + ir_node *tuple = new_r_Tuple(block, ARRAY_SIZE(in), in); + return tuple; + } + } + + return n; +} + /** * optimize a trampoline Call into a direct Call */ @@ -5702,7 +5683,7 @@ static ir_node *transform_node_Call(ir_node *call) ir_graph *irg; type_dbg_info *tdb; dbg_info *db; - int i, n_res, n_param; + size_t i, n_res, n_param; ir_variadicity var; if (! is_Proj(callee)) @@ -5746,9 +5727,6 @@ static ir_node *transform_node_Call(ir_node *call) } var = get_method_variadicity(mtp); set_method_variadicity(ctp, var); - if (var == variadicity_variadic) { - set_method_first_variadic_param_index(ctp, get_method_first_variadic_param_index(mtp) + 1); - } /* When we resolve a trampoline, the function must be called by a this-call */ set_method_calling_convention(ctp, get_method_calling_convention(mtp) | cc_this_call); set_method_additional_properties(ctp, get_method_additional_properties(mtp)); @@ -5815,33 +5793,33 @@ static ir_op_ops *firm_set_default_transform_node(ir_opcode code, ir_op_ops *ops switch (code) { CASE(Add); - CASE(Sub); - CASE(Mul); - CASE_PROJ_EX(Div); - CASE_PROJ_EX(Mod); - CASE_PROJ_EX(Cmp); - CASE_PROJ_EX(Cond); CASE(And); + CASE(Call); + CASE(Cmp); + CASE(Conv); + CASE(End); CASE(Eor); - CASE(Not); CASE(Minus); - CASE_PROJ(Load); - CASE_PROJ(Store); - CASE_PROJ(Bound); - CASE_PROJ(CopyB); - CASE(Proj); - CASE(Phi); + CASE(Mul); + CASE(Mux); + CASE(Not); CASE(Or); + CASE(Phi); + CASE(Proj); + CASE(Rotl); CASE(Sel); + CASE(Shl); CASE(Shr); CASE(Shrs); - CASE(Shl); - CASE(Rotl); - CASE(Conv); - CASE(End); - CASE(Mux); + CASE(Sub); CASE(Sync); - CASE(Call); + 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 */; } @@ -5860,35 +5838,35 @@ static ir_op_ops *firm_set_default_transform_node(ir_opcode code, ir_op_ops *ops #define N_IR_NODES 512 /** Compares the attributes of two Const nodes. */ -static int node_cmp_attr_Const(ir_node *a, ir_node *b) +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(ir_node *a, ir_node *b) +static int node_cmp_attr_Proj(const ir_node *a, const ir_node *b) { return a->attr.proj.proj != b->attr.proj.proj; -} /* node_cmp_attr_Proj */ +} /** Compares the attributes of two Alloc nodes. */ -static int node_cmp_attr_Alloc(ir_node *a, ir_node *b) +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); -} /* node_cmp_attr_Alloc */ +} /** Compares the attributes of two Free nodes. */ -static int node_cmp_attr_Free(ir_node *a, ir_node *b) +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); -} /* node_cmp_attr_Free */ +} /** Compares the attributes of two SymConst nodes. */ -static int node_cmp_attr_SymConst(ir_node *a, ir_node *b) +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; @@ -5897,24 +5875,24 @@ static int node_cmp_attr_SymConst(ir_node *a, ir_node *b) } /** Compares the attributes of two Call nodes. */ -static int node_cmp_attr_Call(ir_node *a, ir_node *b) +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); -} /* node_cmp_attr_Call */ +} /** Compares the attributes of two Sel nodes. */ -static int node_cmp_attr_Sel(ir_node *a, ir_node *b) +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; -} /* node_cmp_attr_Sel */ +} /** Compares the attributes of two Phi nodes. */ -static int node_cmp_attr_Phi(ir_node *a, ir_node *b) +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 */ @@ -5923,48 +5901,48 @@ static int node_cmp_attr_Phi(ir_node *a, ir_node *b) return a->attr.phi.u.pos != b->attr.phi.u.pos; } return 0; -} /* node_cmp_attr_Phi */ +} /** Compares the attributes of two Conv nodes. */ -static int node_cmp_attr_Conv(ir_node *a, ir_node *b) +static int node_cmp_attr_Conv(const ir_node *a, const ir_node *b) { return get_Conv_strict(a) != get_Conv_strict(b); -} /* node_cmp_attr_Conv */ +} /** Compares the attributes of two Cast nodes. */ -static int node_cmp_attr_Cast(ir_node *a, ir_node *b) +static int node_cmp_attr_Cast(const ir_node *a, const ir_node *b) { return get_Cast_type(a) != get_Cast_type(b); -} /* node_cmp_attr_Cast */ +} /** Compares the attributes of two Load nodes. */ -static int node_cmp_attr_Load(ir_node *a, ir_node *b) +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_align(a) != get_Load_align(b)) + if (get_Load_unaligned(a) != get_Load_unaligned(b)) return 1; return get_Load_mode(a) != get_Load_mode(b); -} /* node_cmp_attr_Load */ +} /** Compares the attributes of two Store nodes. */ -static int node_cmp_attr_Store(ir_node *a, ir_node *b) +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_align(a) != get_Store_align(b)) + 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); -} /* node_cmp_attr_Store */ +} /** Compares two exception attributes */ -static int node_cmp_exception(ir_node *a, ir_node *b) +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; @@ -5975,46 +5953,48 @@ static int node_cmp_exception(ir_node *a, ir_node *b) #define node_cmp_attr_Bound node_cmp_exception /** Compares the attributes of two Div nodes. */ -static int node_cmp_attr_Div(ir_node *a, ir_node *b) +static int node_cmp_attr_Div(const ir_node *a, const ir_node *b) { - const divmod_attr *ma = &a->attr.divmod; - const divmod_attr *mb = &b->attr.divmod; + 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; -} /* node_cmp_attr_Div */ +} -/** Compares the attributes of two Div or Mod nodes. */ -static int node_cmp_attr_Div_Mod(ir_node *a, ir_node *b) +/** Compares the attributes of two Mod nodes. */ +static int node_cmp_attr_Mod(const ir_node *a, const ir_node *b) { - const divmod_attr *ma = &a->attr.divmod; - const divmod_attr *mb = &b->attr.divmod; + 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; -} /* node_cmp_attr_Div_Mod */ +} -/** Compares the attributes of two Mod nodes. */ -static int node_cmp_attr_Mod(ir_node *a, ir_node *b) +static int node_cmp_attr_Cmp(const ir_node *a, const ir_node *b) { - return node_cmp_attr_Div_Mod(a, b); -} /* node_cmp_attr_Mod */ + const cmp_attr *ma = &a->attr.cmp; + const cmp_attr *mb = &b->attr.cmp; + return ma->relation != mb->relation; +} /** Compares the attributes of two Confirm nodes. */ -static int node_cmp_attr_Confirm(ir_node *a, ir_node *b) +static int node_cmp_attr_Confirm(const ir_node *a, const ir_node *b) { - /* no need to compare the bound, as this is a input */ - return (get_Confirm_cmp(a) != get_Confirm_cmp(b)); -} /* node_cmp_attr_Confirm */ + const confirm_attr *ma = &a->attr.confirm; + const confirm_attr *mb = &b->attr.confirm; + return ma->relation != mb->relation; +} /** Compares the attributes of two Builtin nodes. */ -static int node_cmp_attr_Builtin(ir_node *a, ir_node *b) +static int node_cmp_attr_Builtin(const ir_node *a, const ir_node *b) { /* no need to compare the type, equal kind means equal type */ return get_Builtin_kind(a) != get_Builtin_kind(b); -} /* node_cmp_attr_Builtin */ +} /** Compares the attributes of two ASM nodes. */ -static int node_cmp_attr_ASM(ir_node *a, ir_node *b) +static int node_cmp_attr_ASM(const ir_node *a, const ir_node *b) { int i, n; const ir_asm_constraint *ca; @@ -6027,29 +6007,31 @@ static int node_cmp_attr_ASM(ir_node *a, ir_node *b) /* 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 0; + 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) + 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 0; + 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) + 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 0; + return 1; cla = get_ASM_clobbers(a); clb = get_ASM_clobbers(b); @@ -6058,10 +6040,10 @@ static int node_cmp_attr_ASM(ir_node *a, ir_node *b) return 1; } return 0; -} /* node_cmp_attr_ASM */ +} /** Compares the inexistent attributes of two Dummy nodes. */ -static int node_cmp_attr_Dummy(ir_node *a, ir_node *b) +static int node_cmp_attr_Dummy(const ir_node *a, const ir_node *b) { (void) a; (void) b; @@ -6093,6 +6075,7 @@ static ir_op_ops *firm_set_default_node_cmp_attr(ir_opcode code, ir_op_ops *ops) CASE(Call); CASE(Sel); CASE(Phi); + CASE(Cmp); CASE(Conv); CASE(Cast); CASE(Load); @@ -6238,7 +6221,7 @@ ir_node *identify_remember(ir_node *n) if (nn != n) { /* n is reachable again */ - edges_node_revival(nn, get_irn_irg(nn)); + edges_node_revival(nn); } return nn; @@ -6293,93 +6276,37 @@ void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env) */ static ir_node *gigo(ir_node *node) { - int i, irn_arity; ir_op *op = get_irn_op(node); - /* remove garbage blocks by looking at control flow that leaves the block - and replacing the control flow by Bad. */ - if (get_irn_mode(node) == mode_X) { - ir_node *block = get_nodes_block(skip_Proj(node)); - ir_graph *irg = get_irn_irg(block); - - /* Don't optimize nodes in immature blocks. */ - if (!get_Block_matured(block)) - return node; - /* Don't optimize End, may have Bads. */ - if (op == op_End) return node; - - if (is_Block(block)) { - if (is_Block_dead(block)) { - /* control flow from dead block is dead */ - return get_irg_bad(irg); - } - - for (i = get_irn_arity(block) - 1; i >= 0; --i) { - if (!is_Bad(get_irn_n(block, i))) - break; - } - if (i < 0) { - ir_graph *irg = get_irn_irg(block); - /* the start block is never dead */ - if (block != get_irg_start_block(irg) - && block != get_irg_end_block(irg)) { - /* - * Do NOT kill control flow without setting - * the block to dead of bad things can happen: - * We get a Block that is not reachable be irg_block_walk() - * but can be found by irg_walk()! - */ - set_Block_dead(block); - return get_irg_bad(irg); - } - } - } + /* 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) { + 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); - irn_arity = get_irn_arity(node); - - /* - * Beware: we can only read the block of a non-floating node. - */ - if (is_irn_pinned_in_irg(node) && - is_Block_dead(get_nodes_block(skip_Proj(node)))) - return get_irg_bad(irg); + 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)) - return get_irg_bad(irg); -#if 0 - /* Propagating Unknowns here seems to be a bad idea, because - sometimes we need a node as a input and did not want that - it kills it's user. - However, it might be useful to move this into a later phase - (if you think that optimizing such code is useful). */ - if (is_Unknown(pred) && mode_is_data(get_irn_mode(node))) - return new_r_Unknown(irg, get_irn_mode(node)); -#endif - } - } -#if 0 - /* With this code we violate the agreement that local_optimize - only leaves Bads in Block, Phi and Tuple nodes. */ - /* If Block has only Bads as predecessors it's garbage. */ - /* If Phi has only Bads as predecessors it's garbage. */ - if ((op == op_Block && get_Block_matured(node)) || op == op_Phi) { - irn_arity = get_irn_arity(node); - for (i = 0; i < irn_arity; i++) { - if (!is_Bad(get_irn_n(node, i))) break; + 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); + } } - if (i == irn_arity) node = get_irg_bad(irg); } -#endif + return node; -} /* gigo */ +} /** * These optimizations deallocate nodes from the obstack. @@ -6398,6 +6325,17 @@ 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 */ @@ -6409,7 +6347,7 @@ ir_node *optimize_node(ir_node *n) size_t node_size; /* - * we MUST copy the node here temporary, because it's still + * we MUST copy the node here temporarily, because it's still * needed for DBG_OPT_CSTEVAL */ node_size = offsetof(ir_node, attr) + n->op->attr_size; @@ -6422,7 +6360,7 @@ ir_node *optimize_node(ir_node *n) memcpy(oldn->in, n->in, ARR_LEN(n->in) * sizeof(n->in[0])); /* note the inplace edges module */ - edges_node_deleted(n, irg); + edges_node_deleted(n); /* evaluation was successful -- replace the node. */ irg_kill_node(irg, n); @@ -6453,7 +6391,7 @@ ir_node *optimize_node(ir_node *n) n = identify_cons(n); if (n != oldn) { - edges_node_deleted(oldn, irg); + edges_node_deleted(oldn); /* We found an existing, better node, so we can deallocate the old node. */ irg_kill_node(irg, oldn); @@ -6468,10 +6406,6 @@ ir_node *optimize_node(ir_node *n) (iro == iro_Proj)) /* Flags tested local. */ n = transform_node(n); - /* Remove nodes with dead (Bad) input. - Run always for transformation induced Bads. */ - n = gigo(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)) { ir_node *o = n; @@ -6500,6 +6434,12 @@ ir_node *optimize_in_place_2(ir_node *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)) + return n; + /* constant expression evaluation / constant folding */ if (get_opt_constant_folding()) { /* neither constants nor Tuple values can be evaluated */ @@ -6545,10 +6485,6 @@ ir_node *optimize_in_place_2(ir_node *n) (iro == iro_Proj)) /* Flags tested local. */ n = transform_node(n); - /* Remove nodes with dead (Bad) input. - Run always for transformation induced Bads. */ - n = gigo(n); - /* Now we can verify the node, as it has no dead inputs any more. */ irn_verify(n); @@ -6620,7 +6556,7 @@ static unsigned hash_SymConst(const ir_node *node) * @return * The operations. */ -static ir_op_ops *firm_set_default_hash(ir_opcode code, ir_op_ops *ops) +static ir_op_ops *firm_set_default_hash(unsigned code, ir_op_ops *ops) { #define CASE(a) \ case iro_##a: \ @@ -6646,7 +6582,7 @@ static ir_op_ops *firm_set_default_hash(ir_opcode code, ir_op_ops *ops) /* * Sets the default operation for an ir_ops. */ -ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *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);