*
* @author Christian Schaefer, Goetz Lindenmaier
*/
+#ifndef _FIRM_IR_IRGOPT_H_
+#define _FIRM_IR_IRGOPT_H_
-# ifndef _IRGOPT_H_
-# define _IRGOPT_H_
-
-# include "irgraph.h"
+#include "firm_types.h"
/** Applies local optimizations (see iropt.h) to all nodes reachable from node n.
*
*/
void local_optimize_graph (ir_graph *irg);
+/** Applies local optimizations (see iropt.h) to all nodes in the graph.
+ *
+ * @param irg The graph to be optimized.
+ *
+ * After applying local_optimize_graph() to a IR-graph, Bad nodes
+ * only occure as predecessor of Block and Phi nodes.
+ *
+ * This version used a fixpoint iteration.
+ */
+void optimize_graph_df(ir_graph *irg);
+
/** Performs dead node elimination by copying the ir graph to a new obstack.
*
* The major intention of this pass is to free memory occupied by
- * dead nodes and outdated analyses information. Further this
- * function removes Bad predecesors from Blocks and the corresponding
- * inputs to Phi nodes. This opens optmization potential for other
+ * dead nodes and outdated analyzes information. Further this
+ * function removes Bad predecessors from Blocks and the corresponding
+ * inputs to Phi nodes. This opens optimization potential for other
* optimizations. Further this phase reduces dead Block<->Jmp
* self-cycles to Bad nodes.
*
*/
void dead_node_elimination(ir_graph *irg);
-/** Cleans the control flow from Bad predecesors.
+typedef struct _survive_dce_t survive_dce_t;
+
+/**
+ * Make a new Survive DCE environment.
+ */
+survive_dce_t *new_survive_dce(void);
+
+/**
+ * Free a Survive DCE environment.
+ */
+void free_survive_dce(survive_dce_t *sd);
+
+/**
+ * Register a node pointer to be patched upon DCE.
+ * When DCE occurs, the node pointer specified by @p place will be
+ * patched to the new address of the node it is pointing to.
+ *
+ * @param sd The Survive DCE environment.
+ * @param place The address of the node pointer.
+ */
+void survive_dce_register_irn(survive_dce_t *sd, ir_node **place);
+
+/** Cleans the control flow from Bad predecessors.
*
- * Removes Bad predecesors from Blocks and the corresponding
+ * Removes Bad predecessors from Blocks and the corresponding
* inputs to Phi nodes as in dead_node_elimination but without
* copying the graph.
*
/** Code Placement.
*
- * Pinns all floating nodes to a block where they
+ * Pins all floating nodes to a block where they
* will be executed only if needed. Depends on the flag opt_global_cse.
* Graph may not be in phase_building. Does not schedule control dead
* code. Uses dominator information which it computes if the irg is not
* A critical control flow edge is an edge from a block with several
* control exits to a block with several control entries (See Muchnic
* p. 407).
- * Is only executed if flag set_opt_critical_edges() is set.
*
* @param irg IR Graph
*/
void remove_critical_cf_edges(ir_graph *irg);
-# endif /* _IRGOPT_H_ */
+#endif /* _FIRM_IR_IRGOPT_H_ */