3 * File name: ir/opt/reassoc.c
4 * Purpose: Reassociation
8 * Copyright: (c) 1998-2004 Universität Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
16 # include "irnode_t.h"
17 # include "irgraph_t.h"
18 # include "irmode_t.h"
20 # include "ircons_t.h"
23 # include "iropt_dbg.h"
24 # include "irflag_t.h"
26 # include "reassoc_t.h"
31 static firm_dbg_module_t *dbg;
33 typedef struct _walker_t {
34 int changes; /* set, if a reassociation take place */
38 NO_CONSTANT = 0, /**< node is not constant */
39 REAL_CONSTANT = 1, /**< node is a Const that is suitable for constant folding */
40 CONST_EXPR = 4 /**< node is a constant expression in the current context,
41 use 4 here to simplify implementation of get_comm_Binop_ops() */
45 * returns whether a node is constant ie is a constant or
48 * @param n the node to be checked for constant
49 * @param block a block that might be in a loop
51 static const_class_t get_const_class(ir_node *n, ir_node *block)
53 ir_op *op = get_irn_op(n);
57 if (op == op_SymConst)
61 * Beware: Bad nodes are always loop-invariant, but
62 * cannot handled in later code, so filter them here
64 if (! is_Bad(n) && is_loop_invariant(n, block))
71 * returns the operands of a commutative bin-op, if one operand is
72 * a constant in the current context, it is returned as the second one.
74 * Beware: Real constants must be returned with higher priority than
75 * constant expression, because they might be folded.
77 static void get_comm_Binop_ops(ir_node *binop, ir_node **a, ir_node **c)
79 ir_node *op_a = get_binop_left(binop);
80 ir_node *op_b = get_binop_right(binop);
81 ir_node *block = get_nodes_block(binop);
82 int class_a = get_const_class(op_a, block);
83 int class_b = get_const_class(op_b, block);
85 assert(is_op_commutative(get_irn_op(binop)));
87 switch (class_a + 2*class_b) {
88 case REAL_CONSTANT + 2*NO_CONSTANT:
89 case REAL_CONSTANT + 2*REAL_CONSTANT:
90 case REAL_CONSTANT + 2*CONST_EXPR:
91 case CONST_EXPR + 2*NO_CONSTANT:
103 * reassociate a Sub: x - c = (-c) + x
105 static int reassoc_Sub(ir_node **in)
108 ir_node *block = get_nodes_block(n);
109 ir_node *right = get_Sub_right(n);
111 /* FIXME: Do not apply this rule for unsigned Sub's because our code
112 * generation is currently buggy :-)
114 if (! mode_is_signed(get_irn_mode(n)))
118 * convert x - c => (-c) + x
120 * As there is NO real Minus in Firm it makes no sense to do this
121 * for non-real constants yet.
123 if (get_const_class(right, block) == REAL_CONSTANT) {
124 ir_node *left = get_Sub_left(n);
125 ir_node *block = get_nodes_block(n);
126 ir_mode *mode = get_irn_mode(n);
127 dbg_info *dbi = get_irn_dbg_info(n);
130 switch (get_const_class(left, block)) {
132 irn = optimize_in_place(n);
142 /* already constant, nothing to do */
146 c = new_r_Const(current_ir_graph, block, mode, get_mode_null(mode));
147 irn = new_rd_Sub(dbi, current_ir_graph, block, c, right, mode);
149 irn = new_rd_Add(dbi, current_ir_graph, block, left, irn, get_irn_mode(n));
151 DBG((dbg, LEVEL_5, "Applied: %n - %n => %n + (-%n)\n",
152 get_Sub_left(n), c, get_Sub_left(n), c));
162 /** Retrieve a mode from the operands. We need this, because
163 * Add and Sub are allowed to operate on (P, Is)
165 static ir_mode *get_mode_from_ops(ir_node *op1, ir_node *op2)
169 m1 = get_irn_mode(op1);
170 if (mode_is_reference(m1))
173 m2 = get_irn_mode(op2);
174 if (mode_is_reference(m2))
183 * reassociate a commutative Binop
185 * BEWARE: this rule leads to a potential loop, if
186 * two operands are are constant expressions and the third is a
187 * constant, so avoid this situation.
189 static int reassoc_commutative(ir_node **node)
192 ir_op *op = get_irn_op(n);
193 ir_node *block = get_nodes_block(n);
196 get_comm_Binop_ops(n, &t1, &c1);
198 if (get_irn_op(t1) == op) {
200 const_class_t c_c1, c_c2, c_t2;
202 get_comm_Binop_ops(t1, &t2, &c2);
204 /* do not optimize Bad nodes, will fail later */
208 c_c1 = get_const_class(c1, block);
209 c_c2 = get_const_class(c2, block);
210 c_t2 = get_const_class(t2, block);
212 if ( ((c_c1 > NO_CONSTANT) & (c_t2 > NO_CONSTANT)) &&
213 ((((c_c1 ^ c_c2 ^ c_t2) & CONST_EXPR) == 0) || ((c_c1 & c_c2 & c_t2) == CONST_EXPR)) ) {
214 /* All three are constant and either all are constant expressions or two of them are:
215 * then applying this rule would lead into a cycle
217 * Note that if t2 is a constant so is c2 hence we save one test.
222 if ((c_c1 != NO_CONSTANT) & (c_c2 != NO_CONSTANT)) {
223 /* handles rules R7, R8, R9, R10:
224 * convert c1 .OP. (c2 .OP. x) => (c1 .OP. c2) .OP. x
226 ir_node *irn, *in[2];
227 ir_mode *mode, *mode_c1 = get_irn_mode(c1), *mode_c2 = get_irn_mode(c2);
229 /* It might happen, that c1 and c2 have different modes, for instance Is and Iu.
232 if (mode_c1 != mode_c2) {
233 if (mode_is_int(mode_c1) && mode_is_int(mode_c2)) {
234 /* get the bigger one */
235 if (get_mode_size_bits(mode_c1) > get_mode_size_bits(mode_c2))
236 c2 = new_r_Conv(current_ir_graph, block, c2, mode_c1);
237 else if (get_mode_size_bits(mode_c1) < get_mode_size_bits(mode_c2))
238 c1 = new_r_Conv(current_ir_graph, block, c1, mode_c2);
240 /* Try to cast the real const */
241 if (c_c1 == REAL_CONSTANT)
242 c1 = new_r_Conv(current_ir_graph, block, c1, mode_c2);
244 c2 = new_r_Conv(current_ir_graph, block, c2, mode_c1);
252 mode = get_mode_from_ops(in[0], in[1]);
253 in[0] = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
256 mode = get_mode_from_ops(in[0], in[1]);
257 irn = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
259 DBG((dbg, LEVEL_5, "Applied: %n .%s. (%n .%s. %n) => (%n .%s. %n) .%s. %n\n",
260 c1, get_irn_opname(n), c2, get_irn_opname(n),
261 t2, c1, get_irn_opname(n), c2, get_irn_opname(n), t2));
263 * In some rare cases it can really happen that we get the same node back.
264 * This might be happen in dead loops, were the Phi nodes are already gone away.
277 #define reassoc_Add reassoc_commutative
278 #define reassoc_And reassoc_commutative
279 #define reassoc_Or reassoc_commutative
280 #define reassoc_Eor reassoc_commutative
283 * reassociate using distributive law for Mul and Add/Sub
285 static int reassoc_Mul(ir_node **node)
288 ir_node *add_sub, *c;
291 if (reassoc_commutative(&n))
294 get_comm_Binop_ops(n, &add_sub, &c);
295 op = get_irn_op(add_sub);
297 /* handles rules R11, R12, R13, R14, R15, R16, R17, R18, R19, R20 */
298 if (op == op_Add || op == op_Sub) {
299 ir_mode *mode = get_irn_mode(n);
300 ir_node *irn, *block, *t1, *t2, *in[2];
302 block = get_nodes_block(n);
303 t1 = get_binop_left(add_sub);
304 t2 = get_binop_right(add_sub);
306 /* we can only multiplication rules on integer arithmetic */
307 if (mode_is_int(get_irn_mode(t1)) && mode_is_int(get_irn_mode(t2))) {
308 in[0] = new_rd_Mul(NULL, current_ir_graph, block, c, t1, mode);
309 in[1] = new_rd_Mul(NULL, current_ir_graph, block, c, t2, mode);
311 mode = get_mode_from_ops(in[0], in[1]);
312 irn = optimize_node(new_ir_node(NULL, current_ir_graph, block, op, mode, 2, in));
314 DBG((dbg, LEVEL_5, "Applied: (%n .%s. %n) %n %n => (%n %n %n) .%s. (%n %n %n)\n",
315 t1, get_op_name(op), t2, n, c, t1, n, c, get_op_name(op), t2, n, c));
326 * The walker for the reassociation.
328 static void do_reassociation(ir_node *n, void *env)
330 walker_t *wenv = env;
335 /* reassociation must run until a fixpoint is reached. */
337 ir_op *op = get_irn_op(n);
338 ir_mode *mode = get_irn_mode(n);
342 /* reassociation works only for integer or reference modes */
343 if (op->ops.reassociate && (mode_is_int(mode) || mode_is_reference(mode))) {
344 res = op->ops.reassociate(&n);
346 wenv->changes |= res;
354 * do the reassociation
356 void optimize_reassociation(ir_graph *irg)
359 irg_loopinfo_state state;
361 assert(get_irg_phase_state(irg) != phase_building);
362 assert(get_irg_pinned(irg) != op_pin_state_floats &&
363 "Reassociation needs pinned graph to work properly");
365 /* reassociation needs constant folding */
366 if (!get_opt_reassociation() || !get_opt_constant_folding())
370 * Calculate loop info, so we could identify loop-invariant
371 * code and threat it like a constant.
372 * We only need control flow loops here but can handle generic
373 * INTRA info as well.
375 state = get_irg_loopinfo_state(irg);
376 if ((state & loopinfo_inter) ||
377 (state & (loopinfo_constructed | loopinfo_valid)) != (loopinfo_constructed | loopinfo_valid))
378 construct_cf_backedges(irg);
382 /* now we have collected enough information, optimize */
383 irg_walk_graph(irg, NULL, do_reassociation, &env);
385 /* Handle graph state */
387 if (get_irg_outs_state(irg) == outs_consistent)
388 set_irg_outs_inconsistent(irg);
389 set_irg_loopinfo_inconsistent(irg);
393 /* Sets the default reassociation operation for an ir_op_ops. */
394 ir_op_ops *firm_set_default_reassoc(opcode code, ir_op_ops *ops)
396 #define CASE(a) case iro_##a: ops->reassociate = reassoc_##a; break
413 /* initialize the reassociation by adding operations to some opcodes */
414 void firm_init_reassociation(void)
416 dbg = firm_dbg_register("firm.opt.reassoc");