* Author: Michael Beck
* Created:
* CVS-ID: $Id$
- * Copyright: (c) 1998-2004 Universität Karlsruhe
+ * Copyright: (c) 1998-2007 Universität Karlsruhe
* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
#ifdef HAVE_CONFIG_H
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
typedef struct _walker_t {
- int changes; /* set, if a reassociation take place */
+ int changes; /* set, if a reassociation take place */
} walker_t;
typedef enum {
- NO_CONSTANT = 0, /**< node is not constant */
- REAL_CONSTANT = 1, /**< node is a Const that is suitable for constant folding */
- REGION_CONST = 4 /**< node is a constant expression in the current context,
- use 4 here to simplify implementation of get_comm_Binop_ops() */
+ NO_CONSTANT = 0, /**< node is not constant */
+ REAL_CONSTANT = 1, /**< node is a Const that is suitable for constant folding */
+ REGION_CONST = 4 /**< node is a constant expression in the current context,
+ use 4 here to simplify implementation of get_comm_Binop_ops() */
} const_class_t;
/**
*/
static const_class_t get_const_class(ir_node *n, ir_node *block)
{
- ir_op *op = get_irn_op(n);
+ ir_op *op = get_irn_op(n);
- if (op == op_Const)
- return REAL_CONSTANT;
+ if (op == op_Const)
+ return REAL_CONSTANT;
- /* although SymConst's are of course real constant, we cannot
- fold them, so handle them like region constants */
- if (op == op_SymConst)
- return REGION_CONST;
+ /* although SymConst's are of course real constant, we cannot
+ fold them, so handle them like region constants */
+ if (op == op_SymConst)
+ return REGION_CONST;
- /*
- * Beware: Bad nodes are always loop-invariant, but
- * cannot handled in later code, so filter them here.
- */
- if (! is_Bad(n) && is_loop_invariant(n, block))
- return REGION_CONST;
+ /*
+ * Beware: Bad nodes are always loop-invariant, but
+ * cannot handled in later code, so filter them here.
+ */
+ if (! is_Bad(n) && is_loop_invariant(n, block))
+ return REGION_CONST;
- return NO_CONSTANT;
-}
+ return NO_CONSTANT;
+} /* get_const_class */
/**
* returns the operands of a commutative bin-op, if one operand is
*/
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);
- ir_node *block = get_nodes_block(binop);
- int class_a = get_const_class(op_a, block);
- int class_b = get_const_class(op_b, block);
-
- assert(is_op_commutative(get_irn_op(binop)));
-
- switch (class_a + 2*class_b) {
- case REAL_CONSTANT + 2*REAL_CONSTANT:
- /* if both are constants, one might be a
- * pointer constant like NULL, return the other
- */
- if (mode_is_reference(get_irn_mode(op_a))) {
- *a = op_a;
- *c = op_b;
- }
- else {
- *a = op_b;
- *c = op_a;
- }
- break;
- case REAL_CONSTANT + 2*NO_CONSTANT:
- case REAL_CONSTANT + 2*REGION_CONST:
- case REGION_CONST + 2*NO_CONSTANT:
- *a = op_b;
- *c = op_a;
- break;
- default:
- *a = op_a;
- *c = op_b;
- break;
- }
-}
+ ir_node *op_a = get_binop_left(binop);
+ ir_node *op_b = get_binop_right(binop);
+ ir_node *block = get_nodes_block(binop);
+ int class_a = get_const_class(op_a, block);
+ int class_b = get_const_class(op_b, block);
+
+ assert(is_op_commutative(get_irn_op(binop)));
+
+ switch (class_a + 2*class_b) {
+ case REAL_CONSTANT + 2*REAL_CONSTANT:
+ /* if both are constants, one might be a
+ * pointer constant like NULL, return the other
+ */
+ if (mode_is_reference(get_irn_mode(op_a))) {
+ *a = op_a;
+ *c = op_b;
+ } else {
+ *a = op_b;
+ *c = op_a;
+ }
+ break;
+ case REAL_CONSTANT + 2*NO_CONSTANT:
+ case REAL_CONSTANT + 2*REGION_CONST:
+ case REGION_CONST + 2*NO_CONSTANT:
+ *a = op_b;
+ *c = op_a;
+ break;
+ default:
+ *a = op_a;
+ *c = op_b;
+ break;
+ }
+} /* get_comm_Binop_ops */
/**
* reassociate a Sub: x - c = (-c) + x
*/
static int reassoc_Sub(ir_node **in)
{
- ir_node *n = *in;
- ir_node *right = get_Sub_right(n);
- ir_mode *rmode = get_irn_mode(right);
- ir_node *block;
-
- /* cannot handle SubIs(P, P) */
- if (mode_is_reference(rmode))
- return 0;
-
- block = get_nodes_block(n);
-
- /* handles rule R6:
- * convert x - c => (-c) + x
- *
- * As there is NO real Minus in Firm it makes no sense to do this
- * for non-real constants yet.
- * */
- if (get_const_class(right, block) == REAL_CONSTANT) {
- ir_node *left = get_Sub_left(n);
- ir_mode *mode;
- dbg_info *dbi;
- ir_node *irn, *c;
-
- switch (get_const_class(left, block)) {
- case REAL_CONSTANT:
- irn = optimize_in_place(n);
- if (irn != n) {
- exchange(n, irn);
- *in = irn;
- return 1;
- }
- return 0;
- case NO_CONSTANT:
- break;
- default:
- /* already constant, nothing to do */
- return 0;
- }
- mode = get_irn_mode(n);
- dbi = get_irn_dbg_info(n);
-
- /* Beware of SubP(P, Is) */
- c = new_r_Const(current_ir_graph, block, rmode, get_mode_null(rmode));
- irn = new_rd_Sub(dbi, current_ir_graph, block, c, right, rmode);
-
- irn = new_rd_Add(dbi, current_ir_graph, block, left, irn, get_irn_mode(n));
-
- DBG((dbg, LEVEL_5, "Applied: %n - %n => %n + (-%n)\n",
- get_Sub_left(n), c, get_Sub_left(n), c));
-
- exchange(n, irn);
- *in = irn;
-
- return 1;
- }
- return 0;
-}
+ ir_node *n = *in;
+ ir_node *right = get_Sub_right(n);
+ ir_mode *rmode = get_irn_mode(right);
+ ir_node *block;
+
+ /* cannot handle SubIs(P, P) */
+ if (mode_is_reference(rmode))
+ return 0;
+
+ block = get_nodes_block(n);
+
+ /* handles rule R6:
+ * convert x - c => (-c) + x
+ *
+ * As there is NO real Minus in Firm it makes no sense to do this
+ * for non-real constants yet.
+ */
+ if (get_const_class(right, block) == REAL_CONSTANT) {
+ ir_node *left = get_Sub_left(n);
+ ir_mode *mode;
+ dbg_info *dbi;
+ ir_node *irn, *c;
+
+ switch (get_const_class(left, block)) {
+ case REAL_CONSTANT:
+ irn = optimize_in_place(n);
+ if (irn != n) {
+ exchange(n, irn);
+ *in = irn;
+ return 1;
+ }
+ return 0;
+ case NO_CONSTANT:
+ break;
+ default:
+ /* already constant, nothing to do */
+ return 0;
+ }
+ mode = get_irn_mode(n);
+ dbi = get_irn_dbg_info(n);
+
+ /* Beware of SubP(P, Is) */
+ c = new_r_Const(current_ir_graph, block, rmode, get_mode_null(rmode));
+ irn = new_rd_Sub(dbi, current_ir_graph, block, c, right, rmode);
+
+ irn = new_rd_Add(dbi, current_ir_graph, block, left, irn, get_irn_mode(n));
+
+ DBG((dbg, LEVEL_5, "Applied: %n - %n => %n + (-%n)\n",
+ get_Sub_left(n), c, get_Sub_left(n), c));
+
+ exchange(n, irn);
+ *in = irn;
+
+ return 1;
+ }
+ return 0;
+} /* reassoc_Sub */
/** Retrieve a mode from the operands. We need this, because
* Add and Sub are allowed to operate on (P, Is)
*/
static ir_mode *get_mode_from_ops(ir_node *op1, ir_node *op2)
{
- ir_mode *m1, *m2;
+ ir_mode *m1, *m2;
- m1 = get_irn_mode(op1);
- if (mode_is_reference(m1))
- return m1;
+ m1 = get_irn_mode(op1);
+ if (mode_is_reference(m1))
+ return m1;
- m2 = get_irn_mode(op2);
- if (mode_is_reference(m2))
- return m2;
+ m2 = get_irn_mode(op2);
+ if (mode_is_reference(m2))
+ return m2;
- assert(m1 == m2);
+ assert(m1 == m2);
- return m1;
-}
+ return m1;
+} /* get_mode_from_ops */
/**
* reassociate a commutative Binop
*/
static int reassoc_commutative(ir_node **node)
{
- ir_node *n = *node;
- ir_op *op = get_irn_op(n);
- ir_node *block = get_nodes_block(n);
- ir_node *t1, *c1;
-
- get_comm_Binop_ops(n, &t1, &c1);
-
- if (get_irn_op(t1) == op) {
- ir_node *t2, *c2;
- const_class_t c_c1, c_c2, c_t2;
-
- get_comm_Binop_ops(t1, &t2, &c2);
-
- /* do not optimize Bad nodes, will fail later */
- if (is_Bad(t2))
- return 0;
-
- c_c1 = get_const_class(c1, block);
- c_c2 = get_const_class(c2, block);
- c_t2 = get_const_class(t2, block);
-
- if ( ((c_c1 > NO_CONSTANT) & (c_t2 > NO_CONSTANT)) &&
- ((((c_c1 ^ c_c2 ^ c_t2) & REGION_CONST) == 0) || ((c_c1 & c_c2 & c_t2) == REGION_CONST)) ) {
- /* All three are constant and either all are constant expressions or two of them are:
- * then applying this rule would lead into a cycle
- *
- * Note that if t2 is a constant so is c2 hence we save one test.
- */
- return 0;
- }
-
- if ((c_c1 != NO_CONSTANT) & (c_c2 != NO_CONSTANT)) {
- /* handles rules R7, R8, R9, R10:
- * convert c1 .OP. (c2 .OP. x) => (c1 .OP. c2) .OP. x
- */
- ir_node *irn, *in[2];
- ir_mode *mode, *mode_c1 = get_irn_mode(c1), *mode_c2 = get_irn_mode(c2);
-
- /* It might happen, that c1 and c2 have different modes, for instance Is and Iu.
- * Handle this here.
- */
- if (mode_c1 != mode_c2) {
- if (mode_is_int(mode_c1) && mode_is_int(mode_c2)) {
- /* get the bigger one */
- if (get_mode_size_bits(mode_c1) > get_mode_size_bits(mode_c2))
- c2 = new_r_Conv(current_ir_graph, block, c2, mode_c1);
- else if (get_mode_size_bits(mode_c1) < get_mode_size_bits(mode_c2))
- c1 = new_r_Conv(current_ir_graph, block, c1, mode_c2);
- else {
- /* Try to cast the real const */
- if (c_c1 == REAL_CONSTANT)
- c1 = new_r_Conv(current_ir_graph, block, c1, mode_c2);
- else
- c2 = new_r_Conv(current_ir_graph, block, c2, mode_c1);
- }
- }
- }
-
- in[0] = c1;
- in[1] = c2;
-
- mode = get_mode_from_ops(in[0], in[1]);
- in[0] = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
- in[1] = t2;
-
- mode = get_mode_from_ops(in[0], in[1]);
- irn = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
-
- DBG((dbg, LEVEL_5, "Applied: %n .%s. (%n .%s. %n) => (%n .%s. %n) .%s. %n\n",
- c1, get_irn_opname(n), c2, get_irn_opname(n),
- t2, c1, get_irn_opname(n), c2, get_irn_opname(n), t2));
- /*
- * In some rare cases it can really happen that we get the same node back.
- * This might be happen in dead loops, were the Phi nodes are already gone away.
- * So check this.
- */
- if (n != irn) {
- exchange(n, irn);
- *node = irn;
- return 1;
- }
- }
- }
- return 0;
-}
+ ir_node *n = *node;
+ ir_op *op = get_irn_op(n);
+ ir_node *block = get_nodes_block(n);
+ ir_node *t1, *c1;
+
+ get_comm_Binop_ops(n, &t1, &c1);
+
+ if (get_irn_op(t1) == op) {
+ ir_node *t2, *c2;
+ const_class_t c_c1, c_c2, c_t2;
+
+ get_comm_Binop_ops(t1, &t2, &c2);
+
+ /* do not optimize Bad nodes, will fail later */
+ if (is_Bad(t2))
+ return 0;
+
+ c_c1 = get_const_class(c1, block);
+ c_c2 = get_const_class(c2, block);
+ c_t2 = get_const_class(t2, block);
+
+ if ( ((c_c1 > NO_CONSTANT) & (c_t2 > NO_CONSTANT)) &&
+ ((((c_c1 ^ c_c2 ^ c_t2) & REGION_CONST) == 0) || ((c_c1 & c_c2 & c_t2) == REGION_CONST)) ) {
+ /* All three are constant and either all are constant expressions or two of them are:
+ * then applying this rule would lead into a cycle
+ *
+ * Note that if t2 is a constant so is c2 hence we save one test.
+ */
+ return 0;
+ }
+
+ if ((c_c1 != NO_CONSTANT) & (c_c2 != NO_CONSTANT)) {
+ /* handles rules R7, R8, R9, R10:
+ * convert c1 .OP. (c2 .OP. x) => (c1 .OP. c2) .OP. x
+ */
+ ir_node *irn, *in[2];
+ ir_mode *mode, *mode_c1 = get_irn_mode(c1), *mode_c2 = get_irn_mode(c2);
+
+ /* It might happen, that c1 and c2 have different modes, for instance Is and Iu.
+ * Handle this here.
+ */
+ if (mode_c1 != mode_c2) {
+ if (mode_is_int(mode_c1) && mode_is_int(mode_c2)) {
+ /* get the bigger one */
+ if (get_mode_size_bits(mode_c1) > get_mode_size_bits(mode_c2))
+ c2 = new_r_Conv(current_ir_graph, block, c2, mode_c1);
+ else if (get_mode_size_bits(mode_c1) < get_mode_size_bits(mode_c2))
+ c1 = new_r_Conv(current_ir_graph, block, c1, mode_c2);
+ else {
+ /* Try to cast the real const */
+ if (c_c1 == REAL_CONSTANT)
+ c1 = new_r_Conv(current_ir_graph, block, c1, mode_c2);
+ else
+ c2 = new_r_Conv(current_ir_graph, block, c2, mode_c1);
+ }
+ }
+ }
+
+ in[0] = c1;
+ in[1] = c2;
+
+ mode = get_mode_from_ops(in[0], in[1]);
+ in[0] = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
+ in[1] = t2;
+
+ mode = get_mode_from_ops(in[0], in[1]);
+ irn = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
+
+ DBG((dbg, LEVEL_5, "Applied: %n .%s. (%n .%s. %n) => (%n .%s. %n) .%s. %n\n",
+ c1, get_irn_opname(n), c2, get_irn_opname(n),
+ t2, c1, get_irn_opname(n), c2, get_irn_opname(n), t2));
+ /*
+ * In some rare cases it can really happen that we get the same node back.
+ * This might be happen in dead loops, were the Phi nodes are already gone away.
+ * So check this.
+ */
+ if (n != irn) {
+ exchange(n, irn);
+ *node = irn;
+ return 1;
+ }
+ }
+ }
+ return 0;
+} /* reassoc_commutative */
#define reassoc_Add reassoc_commutative
#define reassoc_And reassoc_commutative
*/
static int reassoc_Mul(ir_node **node)
{
- ir_node *n = *node;
- ir_node *add_sub, *c;
- ir_op *op;
-
- if (reassoc_commutative(&n))
- return 1;
-
- get_comm_Binop_ops(n, &add_sub, &c);
- op = get_irn_op(add_sub);
-
- /* handles rules R11, R12, R13, R14, R15, R16, R17, R18, R19, R20 */
- if (op == op_Add || op == op_Sub) {
- ir_mode *mode = get_irn_mode(n);
- ir_node *irn, *block, *t1, *t2, *in[2];
-
- block = get_nodes_block(n);
- t1 = get_binop_left(add_sub);
- t2 = get_binop_right(add_sub);
-
- /* we can only multiplication rules on integer arithmetic */
- if (mode_is_int(get_irn_mode(t1)) && mode_is_int(get_irn_mode(t2))) {
- in[0] = new_rd_Mul(NULL, current_ir_graph, block, c, t1, mode);
- in[1] = new_rd_Mul(NULL, current_ir_graph, block, c, t2, mode);
-
- mode = get_mode_from_ops(in[0], in[1]);
- irn = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
-
- /* In some cases it might happen that the new irn is equal the old one, for
- * instance in:
- * (x - 1) * y == x * y - y
- * will be transformed back by simpler optimization
- * We could switch simple optimizations off, but this only happens iff y
- * is a loop-invariant expression and that it is not clear if the new form
- * is better.
- * So, we let the old one.
- */
- if (irn != n) {
- DBG((dbg, LEVEL_5, "Applied: (%n .%s. %n) %n %n => (%n %n %n) .%s. (%n %n %n)\n",
- t1, get_op_name(op), t2, n, c, t1, n, c, get_op_name(op), t2, n, c));
- exchange(n, irn);
- *node = irn;
-
- return 1;
- }
- }
- }
- return 0;
-}
+ ir_node *n = *node;
+ ir_node *add_sub, *c;
+ ir_op *op;
+
+ if (reassoc_commutative(&n))
+ return 1;
+
+ get_comm_Binop_ops(n, &add_sub, &c);
+ op = get_irn_op(add_sub);
+
+ /* handles rules R11, R12, R13, R14, R15, R16, R17, R18, R19, R20 */
+ if (op == op_Add || op == op_Sub) {
+ ir_mode *mode = get_irn_mode(n);
+ ir_node *irn, *block, *t1, *t2, *in[2];
+
+ block = get_nodes_block(n);
+ t1 = get_binop_left(add_sub);
+ t2 = get_binop_right(add_sub);
+
+ /* we can only multiplication rules on integer arithmetic */
+ if (mode_is_int(get_irn_mode(t1)) && mode_is_int(get_irn_mode(t2))) {
+ in[0] = new_rd_Mul(NULL, current_ir_graph, block, c, t1, mode);
+ in[1] = new_rd_Mul(NULL, current_ir_graph, block, c, t2, mode);
+
+ mode = get_mode_from_ops(in[0], in[1]);
+ irn = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
+
+ /* In some cases it might happen that the new irn is equal the old one, for
+ * instance in:
+ * (x - 1) * y == x * y - y
+ * will be transformed back by simpler optimization
+ * We could switch simple optimizations off, but this only happens iff y
+ * is a loop-invariant expression and that it is not clear if the new form
+ * is better.
+ * So, we let the old one.
+ */
+ if (irn != n) {
+ DBG((dbg, LEVEL_5, "Applied: (%n .%s. %n) %n %n => (%n %n %n) .%s. (%n %n %n)\n",
+ t1, get_op_name(op), t2, n, c, t1, n, c, get_op_name(op), t2, n, c));
+ exchange(n, irn);
+ *node = irn;
+
+ return 1;
+ }
+ }
+ }
+ return 0;
+} /* reassoc_Mul */
/**
* The walker for the reassociation.
*/
static void do_reassociation(ir_node *n, void *env)
{
- walker_t *wenv = env;
- int res;
+ walker_t *wenv = env;
+ int res;
- hook_reassociate(1);
+ if (is_no_Block(n)) {
+ ir_node *blk = get_nodes_block(n);
- /* reassociation must run until a fixpoint is reached. */
- do {
- ir_op *op = get_irn_op(n);
- ir_mode *mode = get_irn_mode(n);
+ if (is_Block_dead(blk) || get_Block_dom_depth(blk) < 0) {
+ /* We are in a dead block, do not optimize or we may fall into an endless
+ loop. We check this here instead of requiring that all dead blocks are removed
+ which or cf_opt do not guarantee yet. */
+ return;
+ }
- res = 0;
+ hook_reassociate(1);
- /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
- if (mode_is_float(mode) && get_irg_fp_model(current_ir_graph) & fp_strict_algebraic)
- break;
+ /* reassociation must run until a fixpoint is reached. */
+ do {
+ ir_op *op = get_irn_op(n);
+ ir_mode *mode = get_irn_mode(n);
- if (op->ops.reassociate) {
- res = op->ops.reassociate(&n);
+ res = 0;
- wenv->changes |= res;
- }
- } while (res == 1);
+ /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
+ if (mode_is_float(mode) && get_irg_fp_model(current_ir_graph) & fp_strict_algebraic)
+ break;
- hook_reassociate(0);
-}
+ if (op->ops.reassociate) {
+ res = op->ops.reassociate(&n);
+
+ wenv->changes |= res;
+ }
+ } while (res == 1);
+
+ hook_reassociate(0);
+ }
+} /* do_reassociation */
/*
* do the reassociation
*/
void optimize_reassociation(ir_graph *irg)
{
- walker_t env;
- irg_loopinfo_state state;
-
- assert(get_irg_phase_state(irg) != phase_building);
- assert(get_irg_pinned(irg) != op_pin_state_floats &&
- "Reassociation needs pinned graph to work properly");
-
- /* reassociation needs constant folding */
- if (!get_opt_reassociation() || !get_opt_constant_folding())
- return;
-
- /*
- * Calculate loop info, so we could identify loop-invariant
- * code and threat it like a constant.
- * We only need control flow loops here but can handle generic
- * INTRA info as well.
- */
- state = get_irg_loopinfo_state(irg);
- if ((state & loopinfo_inter) ||
- (state & (loopinfo_constructed | loopinfo_valid)) != (loopinfo_constructed | loopinfo_valid))
- construct_cf_backedges(irg);
-
- env.changes = 0;
-
- /* now we have collected enough information, optimize */
- irg_walk_graph(irg, NULL, do_reassociation, &env);
-
- /* Handle graph state */
- if (env.changes) {
- set_irg_outs_inconsistent(irg);
- set_irg_loopinfo_inconsistent(irg);
- }
-}
+ walker_t env;
+ irg_loopinfo_state state;
+
+ assert(get_irg_phase_state(irg) != phase_building);
+ assert(get_irg_pinned(irg) != op_pin_state_floats &&
+ "Reassociation needs pinned graph to work properly");
+
+ /* reassociation needs constant folding */
+ if (!get_opt_reassociation() || !get_opt_constant_folding())
+ return;
+
+ /* we use dominance to detect dead blocks */
+ assure_doms(irg);
+
+ /*
+ * Calculate loop info, so we could identify loop-invariant
+ * code and threat it like a constant.
+ * We only need control flow loops here but can handle generic
+ * INTRA info as well.
+ */
+ state = get_irg_loopinfo_state(irg);
+ if ((state & loopinfo_inter) ||
+ (state & (loopinfo_constructed | loopinfo_valid)) != (loopinfo_constructed | loopinfo_valid))
+ construct_cf_backedges(irg);
+
+ env.changes = 0;
+
+ /* now we have collected enough information, optimize */
+ irg_walk_graph(irg, NULL, do_reassociation, &env);
+
+ /* Handle graph state */
+ if (env.changes) {
+ set_irg_outs_inconsistent(irg);
+ set_irg_loopinfo_inconsistent(irg);
+ }
+} /* optimize_reassociation */
/* Sets the default reassociation operation for an ir_op_ops. */
ir_op_ops *firm_set_default_reassoc(ir_opcode code, ir_op_ops *ops)
{
#define CASE(a) case iro_##a: ops->reassociate = reassoc_##a; break
- switch (code) {
- CASE(Mul);
- CASE(Add);
- CASE(Sub);
- CASE(And);
- CASE(Or);
- CASE(Eor);
- default:
- /* leave NULL */;
- }
-
- return ops;
+ switch (code) {
+ CASE(Mul);
+ CASE(Add);
+ CASE(Sub);
+ CASE(And);
+ CASE(Or);
+ CASE(Eor);
+ default:
+ /* leave NULL */;
+ }
+
+ return ops;
#undef CASE
-}
+} /* firm_set_default_reassoc */
/* initialize the reassociation by adding operations to some opcodes */
void firm_init_reassociation(void)
{
- FIRM_DBG_REGISTER(dbg, "firm.opt.reassoc");
-}
+ FIRM_DBG_REGISTER(dbg, "firm.opt.reassoc");
+} /* firm_init_reassociation */
projects / libfirm / commitdiff