STAT_OPT_TUPLE = 6, /**< Tuple optimization */
STAT_OPT_ID = 7, /**< ID optimization */
STAT_OPT_CONST_EVAL = 8, /**< constant evaluation */
+ STAT_LOWERED = 9, /**< lowered */
- STAT_OPT_MAX = 9
+ STAT_OPT_MAX = 10
}
stat_opt_kind;
/**
* A new graph was created
*/
-void stat_new_graph(const ir_graph *irg);
+void stat_new_graph(ir_graph *irg, entity *ent);
+
+/**
+ * A graph was deleted
+ */
+void stat_free_graph(ir_graph *irg);
/**
* A walk over a graph is initiated
*/
-void stat_irg_walk(const ir_graph *irg, void *pre, void *post);
+void stat_irg_walk(ir_graph *irg, void *pre, void *post);
/**
* A walk over the graph's blocks is initiated
*/
-void stat_irg_block_walk(const ir_graph *irg, const ir_node *node, void *pre, void *post);
+void stat_irg_block_walk(ir_graph *irg, const ir_node *node, void *pre, void *post);
/**
* Some nodes were optimized into some others due to an optimization
ir_node **old_node_array, int old_num_entries,
stat_opt_kind opt);
+/**
+ * A node was lowered into other nodes
+ */
+void stat_lower(ir_node *node);
+
+/**
+ * A graph was inlined
+ */
+void stat_inline(ir_node *call, ir_graph *irg);
+
+/**
+ * Start the dead node elimination.
+ */
+void stat_dead_node_elim_start(ir_graph *irg);
+
+/**
+ * Stops the dead node elimination.
+ */
+void stat_dead_node_elim_stop(ir_graph *irg);
+
#else
#define stat_init()
#define stat_free_ir_op(op)
#define stat_new_node(node)
#define stat_turn_into_id(node)
-#define stat_new_graph(irg)
+#define stat_new_graph(irg, ent)
+#define stat_free_graph(irg)
#define stat_irg_walk(irg, pre, post)
#define stat_irg_block_walk(irg, node, pre, post)
#define stat_merge_nodes(new_node_array, new_num_entries, old_node_array, old_num_entries, opt)
+#define stat_lower(node)
+#define stat_inline(call, irg)
+#define stat_dead_node_elim_start(irg)
+#define stat_dead_node_elim_start(irg)
#endif