X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgopt.h;h=65e05240eb4ebd7c1081d4e7ba4af879bbe00d46;hb=e1c33a238578342a072e1c95ff12eefe6d0acd37;hp=789186c09204ada9966793bb34061bcb755befe1;hpb=4dd3c33dbb95325452ffb6db9920a38c75877258;p=libfirm

diff --git a/ir/ir/irgopt.h b/ir/ir/irgopt.h
index 789186c09..65e05240e 100644
--- a/ir/ir/irgopt.h
+++ b/ir/ir/irgopt.h
@@ -17,11 +17,10 @@
  *
  * @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.
  *
@@ -38,12 +37,23 @@ void local_optimize_node(ir_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.
  *
@@ -80,9 +90,9 @@ void free_survive_dce(survive_dce_t *sd);
  */
 void survive_dce_register_irn(survive_dce_t *sd, ir_node **place);
 
-/**  Cleans the control flow from Bad predecesors.
+/**  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.
  *
@@ -167,7 +177,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
@@ -190,10 +200,9 @@ 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
  */
 void remove_critical_cf_edges(ir_graph *irg);
 
-# endif /* _IRGOPT_H_ */
+#endif /* _FIRM_IR_IRGOPT_H_ */