* often.
* @author Christian Schaefer, Goetz Lindenmaier, Sebastian Felis,
* Michael Beck
- * @version $Id$
*
* The idea here is to push nodes as deep into the dominance tree as their
* dependencies allow. After pushing them back up out of as many loops as
return 0;
}
-optdesc_t opt_codeplacement = {
+static optdesc_t opt_codeplacement = {
"code-placement",
IR_GRAPH_STATE_NO_CRITICAL_EDGES |
IR_GRAPH_STATE_CONSISTENT_OUTS |
set_opt_global_cse(0);
}
+#if 0
static ir_graph_state_t do_gcse(ir_graph *irg)
{
set_opt_global_cse(1);
return 0;
}
-optdesc_t opt_gcse = {
+static optdesc_t opt_gcse = {
"gcse",
IR_GRAPH_STATE_NO_CRITICAL_EDGES |
IR_GRAPH_STATE_CONSISTENT_OUTS |
IR_GRAPH_STATE_CONSISTENT_LOOPINFO,
do_gcse,
};
+#endif
ir_graph_pass_t *place_code_pass(const char *name)
{