dbg_opt_ssa, /**< Optimization of the SSA representation, e.g., removal of superfluent phi nodes. */
dbg_opt_auxnode, /**< Removal of unnecessary auxilliary nodes. */
dbg_const_eval, /**< A Firm subgraph was evaluated to a single constant. */
+ dbg_opt_cse, /**< A Firm node was replaced due to common subexpression elimination. */
dbg_straightening, /**< A Firm subgraph was replaced by a single, existing block. */
dbg_if_simplification, /**< The control flow of an if is changed as either the
else, the then or both blocks are empty. */
after write optimization. */
dbg_write_after_read, /**< A Firm subgraph was replaced because of a write
after read optimization. */
+ dbg_read_after_write, /**< A Firm subgraph was replaced because of a read
+ after write optimization. */
+ dbg_read_after_read, /**< A Firm subgraph was replaced because of a read
+ after read optimization. */
dbg_rem_poly_call, /**< Remove polymorphic call. */
+ dbg_dead_code, /**< Removing unreachable code, I.e. blocks that are never executed. */
dbg_max /**< Maximum value. */
} dbg_action;
case dbg_opt_ssa: return "dbg_opt_ssa"; break;
case dbg_opt_auxnode: return "dbg_opt_auxnode"; break;
case dbg_const_eval: return "dbg_const_eval"; break;
+ case dbg_opt_cse: return "dbg_opt_cse"; break;
case dbg_straightening: return "dbg_straightening"; break;
case dbg_if_simplification: return "dbg_if_simplification"; break;
case dbg_algebraic_simplification:
return "dbg_algebraic_simplification"; break;
case dbg_write_after_write: return "dbg_write_after_write"; break;
case dbg_write_after_read: return "dbg_write_after_read"; break;
+ case dbg_read_after_write: return "dbg_read_after_write"; break;
+ case dbg_read_after_read: return "dbg_read_after_read"; break;
case dbg_rem_poly_call: return "dbg_rem_poly_call"; break;
default:
if (a <= dbg_max)