# include "ircons_t.h"
# include "irgmod.h"
# include "irvrfy.h"
-# include "tv.h"
+# include "tv_t.h"
# include "dbginfo_t.h"
# include "iropt_dbg.h"
# include "irflag_t.h"
return tarval_bad;
}
+/**
+ * return the value of a Constant
+ */
static tarval *computed_value_Const(ir_node *n)
{
return get_Const_tarval(n);
}
+/**
+ * return the value of a 'sizeof' SymConst
+ */
static tarval *computed_value_SymConst(ir_node *n)
{
- if ((get_SymConst_kind(n) ==symconst_size) &&
+ if ((get_SymConst_kind(n) == symconst_size) &&
(get_type_state(get_SymConst_type(n))) == layout_fixed)
- return new_tarval_from_long(get_type_size_bytes(get_SymConst_type(n)), mode_Is);
+ return new_tarval_from_long(get_type_size_bytes(get_SymConst_type(n)), get_irn_mode(n));
return tarval_bad;
}
&& (v == get_mode_null(get_tarval_mode(v))) )
|| ( ((v = tb) != tarval_bad)
&& (v == get_mode_null(get_tarval_mode(v))) )) {
- return v;
+ return v;
}
}
return tarval_bad;
} else {
tarval *v;
- if ( (tarval_classify ((v = computed_value (a))) == TV_CLASSIFY_NULL)
- || (tarval_classify ((v = computed_value (b))) == TV_CLASSIFY_NULL)) {
+ if ( (classify_tarval ((v = computed_value (a))) == TV_CLASSIFY_NULL)
+ || (classify_tarval ((v = computed_value (b))) == TV_CLASSIFY_NULL)) {
return v;
}
}
return tarval_or (ta, tb);
} else {
tarval *v;
- if ( (tarval_classify ((v = computed_value (a))) == TV_CLASSIFY_ALL_ONE)
- || (tarval_classify ((v = computed_value (b))) == TV_CLASSIFY_ALL_ONE)) {
+ if ( (classify_tarval ((v = computed_value (a))) == TV_CLASSIFY_ALL_ONE)
+ || (classify_tarval ((v = computed_value (b))) == TV_CLASSIFY_ALL_ONE)) {
return v;
}
}
tarval *tb = value_of(b);
if ((ta != tarval_bad) && (tb != tarval_bad)) {
- /* return tarval_rot (ta, tb); */
+ return tarval_rot (ta, tb);
}
return tarval_bad;
}
only 1 is used.
There are several case where we can evaluate a Cmp node:
1. The nodes compared are both the same. If we compare for
- equal, greater equal, ... this will return true, else it
- will return false. This step relies on cse.
+ equal, greater equal, ... this will return true, else it
+ will return false. This step relies on cse.
2. The predecessors of Cmp are target values. We can evaluate
- the Cmp.
+ the Cmp.
3. The predecessors are Allocs or void* constants. Allocs never
- return NULL, they raise an exception. Therefore we can predict
- the Cmp result. */
- if (get_irn_op(a) == op_Cmp) {
+ return NULL, they raise an exception. Therefore we can predict
+ the Cmp result. */
+ switch (get_irn_opcode(a)) {
+ case iro_Cmp:
aa = get_Cmp_left(a);
ab = get_Cmp_right(a);
if (aa == ab) { /* 1.: */
- /* This is a tric with the bits used for encoding the Cmp
- Proj numbers, the following statement is not the same:
+ /* 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 ((get_Proj_proj(n) == Eq), mode_b) */
return new_tarval_from_long ((get_Proj_proj(n) & Eq), mode_b);
} else {
tarval *tab = computed_value (ab);
if ((taa != tarval_bad) && (tab != tarval_bad)) { /* 2.: */
- /* strange checks... */
- pnc_number flags = tarval_cmp (taa, tab);
- if (flags != False) {
- return new_tarval_from_long (get_Proj_proj(n) & flags, mode_b);
- }
+ /* strange checks... */
+ pnc_number flags = tarval_cmp (taa, tab);
+ if (flags != False) {
+ return new_tarval_from_long (get_Proj_proj(n) & flags, mode_b);
+ }
} else { /* check for 3.: */
- ir_node *aaa = skip_nop(skip_Proj(aa));
- ir_node *aba = skip_nop(skip_Proj(ab));
-
- if ( ( (/* aa is ProjP and aaa is Alloc */
- (get_irn_op(aa) == op_Proj)
- && (mode_is_reference(get_irn_mode(aa)))
- && (get_irn_op(aaa) == op_Alloc))
- && ( (/* ab is constant void */
- (get_irn_op(ab) == op_Const)
- && (mode_is_reference(get_irn_mode(ab)))
- && (get_Const_tarval(ab) == get_mode_null(get_irn_mode(ab))))
- || (/* ab is other Alloc */
- (get_irn_op(ab) == op_Proj)
- && (mode_is_reference(get_irn_mode(ab)))
- && (get_irn_op(aba) == op_Alloc)
- && (aaa != aba))))
- || (/* aa is void and aba is Alloc */
- (get_irn_op(aa) == op_Const)
- && (mode_is_reference(get_irn_mode(aa)))
- && (get_Const_tarval(aa) == get_mode_null(get_irn_mode(aa)))
- && (get_irn_op(ab) == op_Proj)
- && (mode_is_reference(get_irn_mode(ab)))
- && (get_irn_op(aba) == op_Alloc)))
- /* 3.: */
- return new_tarval_from_long (get_Proj_proj(n) & Ne, mode_b);
+ ir_node *aaa = skip_Id(skip_Proj(aa));
+ ir_node *aba = skip_Id(skip_Proj(ab));
+
+ if ( ( (/* aa is ProjP and aaa is Alloc */
+ (get_irn_op(aa) == op_Proj)
+ && (mode_is_reference(get_irn_mode(aa)))
+ && (get_irn_op(aaa) == op_Alloc))
+ && ( (/* ab is constant void */
+ (get_irn_op(ab) == op_Const)
+ && (mode_is_reference(get_irn_mode(ab)))
+ && (get_Const_tarval(ab) == get_mode_null(get_irn_mode(ab))))
+ || (/* ab is other Alloc */
+ (get_irn_op(ab) == op_Proj)
+ && (mode_is_reference(get_irn_mode(ab)))
+ && (get_irn_op(aba) == op_Alloc)
+ && (aaa != aba))))
+ || (/* aa is void and aba is Alloc */
+ (get_irn_op(aa) == op_Const)
+ && (mode_is_reference(get_irn_mode(aa)))
+ && (get_Const_tarval(aa) == get_mode_null(get_irn_mode(aa)))
+ && (get_irn_op(ab) == op_Proj)
+ && (mode_is_reference(get_irn_mode(ab)))
+ && (get_irn_op(aba) == op_Alloc)))
+ /* 3.: */
+ return new_tarval_from_long (get_Proj_proj(n) & Ne, mode_b);
}
}
- } else if (get_irn_op(a) == op_DivMod) {
+ break;
+
+ case iro_DivMod:
+ {
tarval *tb = value_of(b = get_DivMod_right(a));
tarval *ta = value_of(a = get_DivMod_left(a));
if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
if (tb == get_mode_null(get_tarval_mode(tb))) /* div by zero: return tarval_bad */
- return tarval_bad;
- if (get_Proj_proj(n)== 0) /* Div */
- return tarval_div(ta, tb);
- else /* Mod */
- return tarval_mod(ta, tb);
+ return tarval_bad;
+ if (get_Proj_proj(n)== pn_DivMod_res_div)
+ return tarval_div(ta, tb);
+ else if (get_Proj_proj(n)== pn_DivMod_res_mod)
+ return tarval_mod(ta, tb);
+ }
+ break;
+ }
+
+ case iro_Div:
+ {
+ tarval *tb = value_of(b = get_Div_right(a));
+ tarval *ta = value_of(a = get_Div_left(a));
+
+ if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
+ if (tb == get_mode_null(get_tarval_mode(tb))) /* div by zero: return tarval_bad */
+ return tarval_bad;
+ if (get_Proj_proj(n)== pn_Div_res)
+ return tarval_div(ta, tb);
}
+ break;
+ }
+
+ case iro_Mod:
+ {
+ tarval *tb = value_of(b = get_Mod_right(a));
+ tarval *ta = value_of(a = get_Mod_left(a));
+
+ if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
+ if (tb == get_mode_null(get_tarval_mode(tb))) /* div by zero: return tarval_bad */
+ return tarval_bad;
+ if (get_Proj_proj(n)== pn_Mod_res)
+ return tarval_mod(ta, tb);
+ }
+ break;
+ }
+
+ default:
+ return tarval_bad;
}
return tarval_bad;
}
/**
* If the parameter n can be computed, return its value, else tarval_bad.
* Performs constant folding.
+ *
+ * @param n The node this should be evaluated
*/
tarval *computed_value(ir_node *n)
{
*/
static ir_op *firm_set_default_computed_value(ir_op *op)
{
-#define CASE(a) \
- case iro_##a: \
- op->computed_value = computed_value_##a; \
+#define CASE(a) \
+ case iro_##a: \
+ op->computed_value = computed_value_##a; \
break
switch (op->code) {
ir_node *a1 = get_Proj_pred (a);
ir_node *b1 = get_Proj_pred (b);
if (a1 != b1 && get_irn_op (a1) == op_Alloc
- && get_irn_op (b1) == op_Alloc)
+ && get_irn_op (b1) == op_Alloc)
return 1;
}
return 0;
{
ir_node *oldn = n;
- /* The Block constructor does not call optimize, but mature_block
+ /* The Block constructor does not call optimize, but mature_immBlock
calls the optimization. */
assert(get_Block_matured(n));
Remaining Phi nodes are just Ids. */
if ((get_Block_n_cfgpreds(n) == 1) &&
(get_irn_op(get_Block_cfgpred(n, 0)) == op_Jmp)) {
- ir_node *predblock = get_nodes_Block(get_Block_cfgpred(n, 0));
+ ir_node *predblock = get_nodes_block(get_Block_cfgpred(n, 0));
if (predblock == oldn) {
/* Jmp jumps into the block it is in -- deal self cycle. */
n = new_Bad(); DBG_OPT_DEAD;
}
}
else if ((get_Block_n_cfgpreds(n) == 1) &&
- (get_irn_op(skip_Proj(get_Block_cfgpred(n, 0))) == op_Cond)) {
- ir_node *predblock = get_nodes_Block(get_Block_cfgpred(n, 0));
+ (get_irn_op(skip_Proj(get_Block_cfgpred(n, 0))) == op_Cond)) {
+ ir_node *predblock = get_nodes_block(get_Block_cfgpred(n, 0));
if (predblock == oldn) {
/* Jmp jumps into the block it is in -- deal self cycle. */
n = new_Bad(); DBG_OPT_DEAD;
}
}
else if ((get_Block_n_cfgpreds(n) == 2) &&
- (get_opt_control_flow_weak_simplification())) {
+ (get_opt_control_flow_weak_simplification())) {
/* Test whether Cond jumps twice to this block
@@@ we could do this also with two loops finding two preds from several ones. */
ir_node *a = get_Block_cfgpred(n, 0);
ir_node *b = get_Block_cfgpred(n, 1);
if ((get_irn_op(a) == op_Proj) &&
- (get_irn_op(b) == op_Proj) &&
- (get_Proj_pred(a) == get_Proj_pred(b)) &&
- (get_irn_op(get_Proj_pred(a)) == op_Cond) &&
- (get_irn_mode(get_Cond_selector(get_Proj_pred(a))) == mode_b)) {
+ (get_irn_op(b) == op_Proj) &&
+ (get_Proj_pred(a) == get_Proj_pred(b)) &&
+ (get_irn_op(get_Proj_pred(a)) == op_Cond) &&
+ (get_irn_mode(get_Cond_selector(get_Proj_pred(a))) == mode_b)) {
/* Also a single entry Block following a single exit Block. Phis have
- twice the same operand and will be optimized away. */
- n = get_nodes_Block(a); DBG_OPT_IFSIM;
+ twice the same operand and will be optimized away. */
+ n = get_nodes_block(a); DBG_OPT_IFSIM;
}
} else if (get_opt_unreachable_code() &&
- (n != current_ir_graph->start_block) &&
- (n != current_ir_graph->end_block) ) {
+ (n != current_ir_graph->start_block) &&
+ (n != current_ir_graph->end_block) ) {
int i;
/* If all inputs are dead, this block is dead too, except if it is
the start or end block. This is a step of unreachable code
{
/* GL: Why not same for op_Raise?? */
/* unreachable code elimination */
- if (is_Bad(get_nodes_Block(n)))
+ if (is_Bad(get_nodes_block(n)))
n = new_Bad();
return n;
/* If this predecessors constant value is zero, the operation is
unnecessary. Remove it: */
- if (tarval_classify (tv) == TV_CLASSIFY_NULL) {
+ if (classify_tarval (tv) == TV_CLASSIFY_NULL) {
n = on; DBG_OPT_ALGSIM1;
}
ir_node *a = get_binop_left(n);
ir_node *b = get_binop_right(n);
- if (tarval_classify(computed_value(b)) == TV_CLASSIFY_NULL) {
+ if (classify_tarval(computed_value(b)) == TV_CLASSIFY_NULL) {
n = a; DBG_OPT_ALGSIM1;
}
static ir_node *equivalent_node_symmetric_unop(ir_node *n)
{
ir_node *oldn = n;
+ ir_node *pred = get_unop_op(n);
/* optimize symmetric unop */
- if (get_irn_op(get_unop_op(n)) == get_irn_op(n)) {
- n = get_unop_op(get_unop_op(n)); DBG_OPT_ALGSIM2;
+ if (get_irn_op(pred) == get_irn_op(n)) {
+ n = get_unop_op(pred); DBG_OPT_ALGSIM2;
}
return n;
}
#define equivalent_node_Not equivalent_node_symmetric_unop
/* --x == x */ /* ??? Is this possible or can --x raise an
- out of bounds exception if min =! max? */
+ out of bounds exception if min =! max? */
#define equivalent_node_Minus equivalent_node_symmetric_unop
/**
ir_node *b = get_Mul_right(n);
/* Mul is commutative and has again an other neutral element. */
- if (tarval_classify (computed_value (a)) == TV_CLASSIFY_ONE) {
+ if (classify_tarval (computed_value (a)) == TV_CLASSIFY_ONE) {
n = b; DBG_OPT_ALGSIM1;
- } else if (tarval_classify (computed_value (b)) == TV_CLASSIFY_ONE) {
+ } else if (classify_tarval (computed_value (b)) == TV_CLASSIFY_ONE) {
n = a; DBG_OPT_ALGSIM1;
}
return n;
ir_node *b = get_Div_right(n);
/* Div is not commutative. */
- if (tarval_classify(computed_value(b)) == TV_CLASSIFY_ONE) { /* div(x, 1) == x */
+ if (classify_tarval(computed_value(b)) == TV_CLASSIFY_ONE) { /* div(x, 1) == x */
/* Turn Div into a tuple (mem, bad, a) */
ir_node *mem = get_Div_mem(n);
turn_into_tuple(n, 3);
set_Tuple_pred(n, pn_Div_M, mem);
- set_Tuple_pred(n, pn_Div_X_except, new_Bad()); /* no exception */
+ set_Tuple_pred(n, pn_Div_X_except, new_Bad()); /* no exception */
set_Tuple_pred(n, pn_Div_res, a);
}
return n;
if (a == b) {
n = a; /* And has it's own neutral element */
- } else if (tarval_classify(computed_value(a)) == TV_CLASSIFY_ALL_ONE) {
+ } else if (classify_tarval(computed_value(a)) == TV_CLASSIFY_ALL_ONE) {
n = b;
- } else if (tarval_classify(computed_value(b)) == TV_CLASSIFY_ALL_ONE) {
+ } else if (classify_tarval(computed_value(b)) == TV_CLASSIFY_ALL_ONE) {
n = a;
}
if (n != oldn) DBG_OPT_ALGSIM1;
if (n_mode == b_mode) {
if (n_mode == mode_b) {
- n = b; /* Convb(Conv*(xxxb(...))) == xxxb(...) */ DBG_OPT_ALGSIM1;
+ n = b; /* Convb(Conv*(xxxb(...))) == xxxb(...) */ DBG_OPT_ALGSIM1;
}
else if (mode_is_int(n_mode) || mode_is_character(n_mode)) {
- if (smaller_mode(b_mode, a_mode)){
- n = b; /* ConvS(ConvL(xxxS(...))) == xxxS(...) */ DBG_OPT_ALGSIM1;
- }
+ if (smaller_mode(b_mode, a_mode)){
+ n = b; /* ConvS(ConvL(xxxS(...))) == xxxS(...) */ DBG_OPT_ALGSIM1;
+ }
}
}
}
- no Phi in start block.
- remove Id operators that are inputs to Phi
- fold Phi-nodes, iff they have only one predecessor except
- themselves.
+ themselves.
*/
int i, n_preds;
assert(get_irn_arity(block) == n_preds && "phi in wrong block!"); */
if ((is_Bad(block)) || /* Control dead */
(block == current_ir_graph->start_block)) /* There should be no Phi nodes */
- return new_Bad(); /* in the Start Block. */
+ return new_Bad(); /* in the Start Block. */
if (n_preds == 0) return n; /* Phi of dead Region without predecessors. */
ir_node *a = get_Phi_pred(n, 0);
ir_node *b = get_Phi_pred(n, 1);
if ( (get_irn_op(a) == op_Confirm)
- && (get_irn_op(b) == op_Confirm)
- && follow_Id (get_irn_n(a, 0) == get_irn_n(b, 0))
- && (get_irn_n(a, 1) == get_irn_n (b, 1))
- && (a->data.num == (~b->data.num & irpn_True) )) {
+ && (get_irn_op(b) == op_Confirm)
+ && follow_Id (get_irn_n(a, 0) == get_irn_n(b, 0))
+ && (get_irn_n(a, 1) == get_irn_n (b, 1))
+ && (a->data.num == (~b->data.num & irpn_True) )) {
return get_irn_n(a, 0);
}
}
first_val = get_Phi_pred(n, i);
if ( (first_val != n) /* not self pointer */
#if 1
- && (get_irn_op(first_val) != op_Bad)
+ && (get_irn_op(first_val) != op_Bad)
#endif
- ) { /* value not dead */
+ ) { /* value not dead */
break; /* then found first value. */
}
}
while (++i < n_preds) {
scnd_val = get_Phi_pred(n, i);
if ( (scnd_val != n)
- && (scnd_val != first_val)
+ && (scnd_val != first_val)
#if 1
- && (get_irn_op(scnd_val) != op_Bad)
+ && (get_irn_op(scnd_val) != op_Bad)
#endif
- ) {
+ ) {
break;
}
}
}
/**
- * Optimize Loads after Store.
- *
- * @todo FAILS for volatile entities
+ * optimize Proj(Tuple) and gigo for ProjX in Bad block
*/
-static ir_node *equivalent_node_Load(ir_node *n)
-{
- ir_node *oldn = n;
-
- /* remove unnecessary Load. */
- ir_node *a = skip_Proj(get_Load_mem(n));
- ir_node *b = get_Load_ptr(n);
- ir_node *c;
-
- /* TODO: check for volatile */
- if (get_irn_op(a) == op_Store && get_Store_ptr(a) == b) {
- /* We load immediately after a store -- a read after write. */
- ir_node *mem = get_Load_mem(n);
-
- c = get_Store_value(a);
- turn_into_tuple(n, 3);
- set_Tuple_pred(n, pn_Load_M, mem);
- set_Tuple_pred(n, pn_Load_res, c);
- set_Tuple_pred(n, pn_Load_X_except, new_Bad()); DBG_OPT_RAW;
- }
- return n;
-}
-
-/**
- * Optimize store after store and load atfter store.
- *
- * @todo FAILS for volatile entities
- */
-static ir_node *equivalent_node_Store(ir_node *n)
-{
- ir_node *oldn = n;
-
- /* remove unnecessary store. */
- ir_node *a = skip_Proj(get_Store_mem(n));
- ir_node *b = get_Store_ptr(n);
- ir_node *c = skip_Proj(get_Store_value(n));
-
- if (get_irn_op(a) == op_Store
- && get_Store_ptr(a) == b
- && skip_Proj(get_Store_value(a)) == c) {
- /* We have twice exactly the same store -- a write after write. */
- n = a; DBG_OPT_WAW;
- } else if (get_irn_op(c) == op_Load
- && (a == c || skip_Proj(get_Load_mem(c)) == a)
- && get_Load_ptr(c) == b ) {
- /* We just loaded the value from the same memory, i.e., the store
- doesn't change the memory -- a write after read. */
- a = get_Store_mem(n);
- turn_into_tuple(n, 2);
- set_Tuple_pred(n, pn_Store_M, a);
- set_Tuple_pred(n, pn_Store_X_except, new_Bad()); DBG_OPT_WAR;
- }
- return n;
-}
-
static ir_node *equivalent_node_Proj(ir_node *n)
{
ir_node *oldn = n;
n = new_Bad();
}
} else if (get_irn_mode(n) == mode_X &&
- is_Bad(get_nodes_Block(n))) {
+ is_Bad(get_nodes_block(n))) {
/* Remove dead control flow -- early gigo. */
n = new_Bad();
}
return n;
}
-/*
-case iro_Mod, Quot, DivMod
- DivMod allocates new nodes --> it's treated in transform node.
- What about Quot, DivMod?
-*/
-
/**
* equivalent_node() returns a node equivalent to input n. It skips all nodes that
* perform no actual computation, as, e.g., the Id nodes. It does not create
*/
static ir_op *firm_set_default_equivalent_node(ir_op *op)
{
-#define CASE(a) \
- case iro_##a: \
- op->equivalent_node = equivalent_node_##a; \
+#define CASE(a) \
+ case iro_##a: \
+ op->equivalent_node = equivalent_node_##a; \
break
switch (op->code) {
CASE(And);
CASE(Conv);
CASE(Phi);
- CASE(Load); /* dangerous */
- CASE(Store); /* dangerous, see todo */
CASE(Proj);
CASE(Id);
default:
tarval *resa, *resb;
resa = tarval_div (ta, tb);
if (resa == tarval_bad) return n; /* Causes exception!!! Model by replacing through
- Jmp for X result!? */
+ Jmp for X result!? */
resb = tarval_mod (ta, tb);
if (resb == tarval_bad) return n; /* Causes exception! */
a = new_Const (mode, resa);
set_Tuple_pred(n, pn_DivMod_X_except, new_Bad()); /* no exception */
set_Tuple_pred(n, pn_DivMod_res_div, a);
set_Tuple_pred(n, pn_DivMod_res_mod, b);
- assert(get_nodes_Block(n));
+ assert(get_nodes_block(n));
}
return n;
(get_irn_mode(a) == mode_b) &&
(get_opt_unreachable_code())) {
/* It's a boolean Cond, branching on a boolean constant.
- Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
- jmp = new_r_Jmp(current_ir_graph, get_nodes_Block(n));
+ Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
+ jmp = new_r_Jmp(current_ir_graph, get_nodes_block(n));
turn_into_tuple(n, 2);
if (ta == tarval_b_true) {
set_Tuple_pred(n, pn_Cond_false, new_Bad());
set_Tuple_pred(n, pn_Cond_true, new_Bad());
}
/* We might generate an endless loop, so keep it alive. */
- add_End_keepalive(get_irg_end(current_ir_graph), get_nodes_Block(n));
+ add_End_keepalive(get_irg_end(current_ir_graph), get_nodes_block(n));
} else if ((ta != tarval_bad) &&
- (get_irn_mode(a) == mode_Iu) &&
- (get_Cond_kind(n) == dense) &&
- (get_opt_unreachable_code())) {
+ (get_irn_mode(a) == mode_Iu) &&
+ (get_Cond_kind(n) == dense) &&
+ (get_opt_unreachable_code())) {
/* I don't want to allow Tuples smaller than the biggest Proj.
Also this tuple might get really big...
I generate the Jmp here, and remember it in link. Link is used
when optimizing Proj. */
- set_irn_link(n, new_r_Jmp(current_ir_graph, get_nodes_Block(n)));
+ set_irn_link(n, new_r_Jmp(current_ir_graph, get_nodes_block(n)));
/* We might generate an endless loop, so keep it alive. */
- add_End_keepalive(get_irg_end(current_ir_graph), get_nodes_Block(n));
+ add_End_keepalive(get_irg_end(current_ir_graph), get_nodes_block(n));
} else if ((get_irn_op(a) == op_Eor)
- && (get_irn_mode(a) == mode_b)
- && (tarval_classify(computed_value(get_Eor_right(a))) == TV_CLASSIFY_ONE)) {
+ && (get_irn_mode(a) == mode_b)
+ && (classify_tarval(computed_value(get_Eor_right(a))) == TV_CLASSIFY_ONE)) {
/* The Eor is a negate. Generate a new Cond without the negate,
simulate the negate by exchanging the results. */
- set_irn_link(n, new_r_Cond(current_ir_graph, get_nodes_Block(n),
- get_Eor_left(a)));
+ set_irn_link(n, new_r_Cond(current_ir_graph, get_nodes_block(n),
+ get_Eor_left(a)));
} else if ((get_irn_op(a) == op_Not)
- && (get_irn_mode(a) == mode_b)) {
+ && (get_irn_mode(a) == mode_b)) {
/* A Not before the Cond. Generate a new Cond without the Not,
simulate the Not by exchanging the results. */
- set_irn_link(n, new_r_Cond(current_ir_graph, get_nodes_Block(n),
- get_Not_op(a)));
+ set_irn_link(n, new_r_Cond(current_ir_graph, get_nodes_block(n),
+ get_Not_op(a)));
}
return n;
}
if ((get_irn_mode(n) == mode_b)
&& (get_irn_op(a) == op_Proj)
&& (get_irn_mode(a) == mode_b)
- && (tarval_classify (computed_value (b)) == TV_CLASSIFY_ONE)
+ && (classify_tarval (computed_value (b)) == TV_CLASSIFY_ONE)
&& (get_irn_op(get_Proj_pred(a)) == op_Cmp))
/* The Eor negates a Cmp. The Cmp has the negated result anyways! */
- n = new_r_Proj(current_ir_graph, get_nodes_Block(n), get_Proj_pred(a),
- mode_b, get_negated_pnc(get_Proj_proj(a)));
+ n = new_r_Proj(current_ir_graph, get_nodes_block(n), get_Proj_pred(a),
+ mode_b, get_negated_pnc(get_Proj_proj(a)));
else if ((get_irn_mode(n) == mode_b)
- && (tarval_classify (computed_value (b)) == TV_CLASSIFY_ONE))
+ && (classify_tarval (computed_value (b)) == TV_CLASSIFY_ONE))
/* The Eor is a Not. Replace it by a Not. */
/* ????!!!Extend to bitfield 1111111. */
- n = new_r_Not(current_ir_graph, get_nodes_Block(n), a, mode_b);
+ n = new_r_Not(current_ir_graph, get_nodes_block(n), a, mode_b);
return n;
}
&& (get_irn_mode(a) == mode_b)
&& (get_irn_op(get_Proj_pred(a)) == op_Cmp))
/* We negate a Cmp. The Cmp has the negated result anyways! */
- n = new_r_Proj(current_ir_graph, get_nodes_Block(n), get_Proj_pred(a),
- mode_b, get_negated_pnc(get_Proj_proj(a)));
+ n = new_r_Proj(current_ir_graph, get_nodes_block(n), get_Proj_pred(a),
+ mode_b, get_negated_pnc(get_Proj_proj(a)));
return n;
}
/**
* Transform a Div/Mod/DivMod with a non-zero constant. Must be
- * done here to avoid that this optimization runs more than once...
+ * done here instead of equivalent node because in creates new
+ * nodes.
*/
static ir_node *transform_node_Proj(ir_node *proj)
{
switch (get_irn_opcode(n)) {
case iro_Div:
- b = get_Div_right(n);
- tb = computed_value(b);
-
- if (tb != tarval_bad && tarval_classify(tb) != TV_CLASSIFY_NULL) { /* div(x, c) && c != 0 */
- ir_node *div, *proj;
- ir_node *a = get_Div_left(n);
- ir_node *mem = get_Div_mem(n);
- int rem = get_optimize();
-
- set_optimize(0);
- {
- div = new_rd_Div(get_irn_dbg_info(n), current_ir_graph,
- get_nodes_Block(n), get_irg_initial_mem(current_ir_graph), a, b);
+ if (get_Proj_proj(proj) == pn_Div_X_except) {
+ b = get_Div_right(n);
+ tb = computed_value(b);
- proj = new_r_Proj(current_ir_graph, get_nodes_Block(n), div, get_irn_mode(a), pn_Div_res);
+ /* we found an exception handler, see if we can remove it */
+ if (tb != tarval_bad && classify_tarval(tb) != TV_CLASSIFY_NULL) { /* div(x, c) && c != 0 */
+ return new_Bad();
}
- set_optimize(rem);
-
- turn_into_tuple(n, 3);
- set_Tuple_pred(n, pn_Mod_M, mem);
- set_Tuple_pred(n, pn_Mod_X_except, new_Bad());
- set_Tuple_pred(n, pn_Mod_res, proj);
}
break;
case iro_Mod:
- b = get_Mod_right(n);
- tb = computed_value(b);
-
- if (tb != tarval_bad && tarval_classify(tb) != TV_CLASSIFY_NULL) { /* mod(x, c) && c != 0 */
- ir_node *mod, *proj;
- ir_node *a = get_Mod_left(n);
- ir_node *mem = get_Mod_mem(n);
- int rem = get_optimize();
+ if (get_Proj_proj(proj) == pn_Mod_X_except) {
+ b = get_Mod_right(n);
+ tb = computed_value(b);
- set_optimize(0);
- {
- mod = new_rd_Mod(get_irn_dbg_info(n), current_ir_graph,
- get_nodes_Block(n), get_irg_initial_mem(current_ir_graph), a, b);
-
- proj = new_r_Proj(current_ir_graph, get_nodes_Block(n), mod, get_irn_mode(a), pn_Mod_res);
+ if (tb != tarval_bad && classify_tarval(tb) != TV_CLASSIFY_NULL) { /* mod(x, c) && c != 0 */
+ return new_Bad();
}
- set_optimize(rem);
-
- turn_into_tuple(n, 3);
- set_Tuple_pred(n, pn_Mod_M, mem);
- set_Tuple_pred(n, pn_Mod_X_except, new_Bad());
- set_Tuple_pred(n, pn_Mod_res, proj);
}
break;
case iro_DivMod:
- b = get_DivMod_right(n);
- tb = computed_value(b);
-
- if (tb != tarval_bad && tarval_classify(tb) != TV_CLASSIFY_NULL) { /* DivMod(x, c) && c != 0 */
- ir_node *div_mod, *proj_div, *proj_mod;
- ir_node *a = get_Mod_left(n);
- ir_node *mem = get_Mod_mem(n);
- int rem = get_optimize();
-
- set_optimize(0);
- {
- div_mod = new_rd_DivMod(get_irn_dbg_info(n), current_ir_graph,
- get_nodes_Block(n), get_irg_initial_mem(current_ir_graph), a, b);
-
- proj_div = new_r_Proj(current_ir_graph, get_nodes_Block(n), div_mod, get_irn_mode(a), pn_DivMod_res_div);
- proj_mod = new_r_Proj(current_ir_graph, get_nodes_Block(n), div_mod, get_irn_mode(a), pn_DivMod_res_mod);
+ if (get_Proj_proj(proj) == pn_DivMod_X_except) {
+ b = get_DivMod_right(n);
+ tb = computed_value(b);
+
+ if (tb != tarval_bad && classify_tarval(tb) != TV_CLASSIFY_NULL) { /* DivMod(x, c) && c != 0 */
+ return new_Bad();
}
- set_optimize(rem);
+ }
+ break;
- turn_into_tuple(n, 4);
- set_Tuple_pred(n, pn_DivMod_M, mem);
- set_Tuple_pred(n, pn_DivMod_X_except, new_Bad());
- set_Tuple_pred(n, pn_DivMod_res_div, proj_div);
- set_Tuple_pred(n, pn_DivMod_res_mod, proj_mod);
+ case iro_Cond:
+ if (get_opt_unreachable_code()) {
+ b = get_Cond_selector(n);
+ tb = computed_value(b);
+
+ if (tb != tarval_bad && mode_is_int(get_tarval_mode(tb))) {
+ /* we have a constant switch */
+ long num = get_Proj_proj(proj);
+
+ if (num != get_Cond_defaultProj(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
+ return new_Bad();
+ }
+ }
}
+ return proj;
+
+ case iro_Tuple:
+ /* should not happen, but if it does will optimize */
break;
+
default:
/* do nothing */
return proj;
return equivalent_node_Proj(proj);
}
-/**
- * Transform a Store before a Store to the same address...
- *
- * @todo Check for volatile! Moreover, what if the first store
- * has a exception handler while the other has not?
- */
-static ir_node *transform_node_Store(ir_node *store)
-{
- ir_node *n = skip_Proj(get_Store_mem(store));
- ir_node *ptr = get_Store_ptr(store);
-
- if (get_irn_op(n) == op_Store && get_Store_ptr(n) == ptr) {
- /* the Store n is useless, as it is overwritten by the store store */
- ir_node *mem = get_Store_mem(n);
-
- turn_into_tuple(n, 2);
- set_Tuple_pred(n, pn_Store_M, mem);
- set_Tuple_pred(n, pn_Store_X_except, new_Bad());
- }
- return store;
-}
-
/**
* returns the operands of a commutative bin-op, if one operand is
* a const, it is returned as the second one.
tv4 = get_Const_tarval(c4);
tv = tarval_or(tv4, tv2);
- if (tarval_classify(tv) != TV_CLASSIFY_ALL_ONE) {
+ if (classify_tarval(tv) != TV_CLASSIFY_ALL_ONE) {
/* have at least one 0 at the same bit position */
return or;
}
*/
static ir_op *firm_set_default_transform_node(ir_op *op)
{
-#define CASE(a) \
- case iro_##a: \
- op->transform_node = transform_node_##a; \
+#define CASE(a) \
+ case iro_##a: \
+ op->transform_node = transform_node_##a; \
break
switch (op->code) {
CASE(Eor);
CASE(Not);
CASE(Proj);
- CASE(Store);
CASE(Or);
default:
op->transform_node = NULL;
return get_Cast_type(a) != get_Cast_type(b);
}
+static int node_cmp_attr_Load(ir_node *a, 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;
+
+ return get_Load_mode(a) != get_Load_mode(b);
+}
+
+static int node_cmp_attr_Store(ir_node *a, ir_node *b)
+{
+ /* NEVER do CSE on volatile Stores */
+ return (get_Store_volatility(a) == volatility_is_volatile ||
+ get_Load_volatility(b) == volatility_is_volatile);
+}
+
/**
* set the default node attribute compare operation
*/
static ir_op *firm_set_default_node_cmp_attr(ir_op *op)
{
-#define CASE(a) \
- case iro_##a: \
- op->node_cmp_attr = node_cmp_attr_##a; \
+#define CASE(a) \
+ case iro_##a: \
+ op->node_cmp_attr = node_cmp_attr_##a; \
break
switch (op->code) {
CASE(Sel);
CASE(Phi);
CASE(Cast);
+ CASE(Load);
+ CASE(Store);
default:
op->node_cmp_attr = NULL;
}
if (irn_arity_a != get_irn_arity(b))
return 1;
- /* for block-local cse and pinned nodes: */
- if (!get_opt_global_cse() || (get_op_pinned(get_irn_op(a)) == pinned)) {
+ /* for block-local cse and op_pin_state_pinned nodes: */
+ if (!get_opt_global_cse() || (get_op_pinned(get_irn_op(a)) == op_pin_state_pinned)) {
if (get_irn_n(a, -1) != get_irn_n(b, -1))
return 1;
}
/* TODO: use a generic commutative attribute */
if (get_opt_reassociation()) {
if (is_op_commutative(get_irn_op(n))) {
+ ir_node *l = get_binop_left(n);
+ ir_node *r = get_binop_right(n);
+
/* for commutative operators perform a OP b == b OP a */
- if (get_binop_left(n) > get_binop_right(n)) {
- ir_node *h = get_binop_left(n);
- set_binop_left(n, get_binop_right(n));
- set_binop_right(n, h);
+ if (l > r) {
+ set_binop_left(n, r);
+ set_binop_right(n, l);
}
}
}
}
/**
- * During construction we set the pinned flag in the graph right when the
+ * During construction we set the op_pin_state_pinned flag in the graph right when the
* optimization is performed. The flag turning on procedure global cse could
* be changed between two allocations. This way we are safe.
*/
static INLINE ir_node *
identify_cons (pset *value_table, ir_node *n) {
ir_node *old = n;
+
n = identify(value_table, n);
if (get_irn_n(old, -1) != get_irn_n(n, -1))
- set_irg_pinned(current_ir_graph, floats);
+ set_irg_pinned(current_ir_graph, op_pin_state_floats);
return n;
}
if (get_irn_op(block) == op_Block && get_Block_matured(block)) {
irn_arity = get_irn_arity(block);
for (i = 0; i < irn_arity; i++) {
- if (!is_Bad(get_irn_n(block, i))) break;
+ if (!is_Bad(get_irn_n(block, i))) break;
}
if (i == irn_arity) return new_Bad();
}
/* try to evaluate */
tv = computed_value (n);
if ((get_irn_mode(n) != mode_T) && (tv != tarval_bad)) {
- /*
- * we MUST copy the node here temparary, because it's still needed
- * for DBG_OPT_ALGSIM0
- */
- int node_size = offsetof(ir_node, attr) + n->op->attr_size;
- ir_node *x = alloca(node_size);
+ /*
+ * we MUST copy the node here temporary, because it's still needed
+ * for DBG_OPT_ALGSIM0
+ */
+ int node_size = offsetof(ir_node, attr) + n->op->attr_size;
+ ir_node *x = alloca(node_size);
- memcpy(x, n, node_size);
- oldn = x;
+ memcpy(x, n, node_size);
+ oldn = x;
/* evaluation was successful -- replace the node. */
- obstack_free (current_ir_graph->obst, n);
- n = new_Const (get_tarval_mode (tv), tv);
- DBG_OPT_ALGSIM0;
- return n;
+ obstack_free (current_ir_graph->obst, n);
+ n = new_Const (get_tarval_mode (tv), tv);
+ DBG_OPT_ALGSIM0;
+ return n;
}
}
}
/** common subexpression elimination **/
/* Checks whether n is already available. */
/* The block input is used to distinguish different subexpressions. Right
- now all nodes are pinned to blocks, i.e., the cse only finds common
+ now all nodes are op_pin_state_pinned to blocks, i.e., the cse only finds common
subexpressions within a block. */
if (get_opt_cse())
n = identify_cons (current_ir_graph->value_table, n);
tv = computed_value (n);
if ((get_irn_mode(n) != mode_T) && (tv != tarval_bad)) {
/* evaluation was successful -- replace the node. */
- n = new_Const (get_tarval_mode (tv), tv);
- DBG_OPT_ALGSIM0;
- return n;
+ n = new_Const (get_tarval_mode (tv), tv);
+ DBG_OPT_ALGSIM0;
+ return n;
}
}
}
/* remove unnecessary nodes */
- /*if (get_opt_constant_folding()) */
if (get_opt_constant_folding() ||
(iro == iro_Phi) || /* always optimize these nodes. */
(iro == iro_Id) || /* ... */
/** common subexpression elimination **/
/* Checks whether n is already available. */
/* The block input is used to distinguish different subexpressions. Right
- now all nodes are pinned to blocks, i.e., the cse only finds common
+ now all nodes are op_pin_state_pinned to blocks, i.e., the cse only finds common
subexpressions within a block. */
if (get_opt_cse()) {
n = identify (current_ir_graph->value_table, n);
assert(get_irg_phase_state(current_ir_graph) != phase_building);
if (get_opt_global_cse())
- set_irg_pinned(current_ir_graph, floats);
+ set_irg_pinned(current_ir_graph, op_pin_state_floats);
if (get_irg_outs_state(current_ir_graph) == outs_consistent)
set_irg_outs_inconsistent(current_ir_graph);
+
/* Maybe we could also test whether optimizing the node can
change the control graph. */
if (get_irg_dom_state(current_ir_graph) == dom_consistent)
projects / libfirm / blobdiff