X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgopt.h;h=786dff6c782d39e53ee50384ec5513f708fafb9e;hb=d2dc2564b47d9c113d7e6e598574e9733627fcca;hp=f50d4f0606687fa4a41019e929e4df165306661e;hpb=346dfddce9be4420855b06ea40d2bf21dad9bc88;p=libfirm

diff --git a/ir/ir/irgopt.h b/ir/ir/irgopt.h
index f50d4f060..786dff6c7 100644
--- a/ir/ir/irgopt.h
+++ b/ir/ir/irgopt.h
@@ -33,17 +33,28 @@ void local_optimize_node(ir_node *n);
  *
  * @param irg  The graph to be optimized.
  *
- * After appliying local_optimize_graph() to a IR-graph, Bad nodes
+ * After applying local_optimize_graph() to a IR-graph, Bad nodes
  * only occure as predecessor of Block and Phi nodes.
  */
 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.
  *
@@ -54,16 +65,35 @@ void local_optimize_graph (ir_graph *irg);
  *  Removes old attributes of nodes.  Sets link field to NULL.
  *  Callee information must be freed (irg_callee_info_none).
  *
- *  Attention: the numbers assigned to nodes if the library is compiled for
- *  development/debugging are not conserved by copying.
- *
  * @param irg  The graph to be optimized.
  */
 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.
  *
@@ -148,7 +178,7 @@ void inline_leave_functions(int maxsize, int leavesize, int size);
 
 /** 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
@@ -171,7 +201,6 @@ void place_code(ir_graph *irg);
  * 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
  */