implemented scc algorithm. Added datastructure to mark

[libfirm] / ir / ir / irgopt.h

diff --git a/ir/ir/irgopt.h b/ir/ir/irgopt.h
index 89f1d4c..d18b555 100644 (file)
--- a/ir/ir/irgopt.h
+++ b/ir/ir/irgopt.h
@@ -23,6 +23,7 @@ void local_optimize_graph (ir_graph *irg);
    `opt_dead_node_elimination' are set.
    The graph may not be in state phase_building.  The outs datasturcture
    is freed, the outs state set to no_outs. (@@@ Change this? -> inconsistent.)
+   Backedge information is conserved.
    Removes old attributes of nodes.  Sets link field to NULL.
    Attention: the numbers assigned to nodes if the library is compiled for
    development/debugging are not conserved by copying. */
@@ -35,6 +36,8 @@ void dead_node_elimination(ir_graph *irg);
 void remove_bad_predecessors(ir_graph *irg);
 
 /* Inlines a method at the given call site.
+   Removes the call node and splits the basic block the call node
+   belongs to.  Inserts a copy of the called graph between these nodes.
    Assumes that call is a Call node in current_ir_graph and that
    the type in the Call nodes type attribute is the same as the
    type of the called graph.
@@ -49,8 +52,8 @@ void remove_bad_predecessors(ir_graph *irg);
    if they are equal.
    Sets visited masterflag in current_ir_graph to the max of the flag in
    current and called graph.
-   Removes the call node and splits the basic block the call node
-   belongs to.  Inserts a copy of the called graph between these nodes.
+   Assumes that both, the called and the calling graph are in state
+   "pinned".
    It is recommended to call local_optimize_graph after inlining as this
    function leaves a set of obscure Tuple nodes, e.g. a Proj-Tuple-Jmp
    combination as control flow operation. */
@@ -72,4 +75,30 @@ void inline_method(ir_node *call, ir_graph *called_graph);
    combination as control flow operation.  */
 void inline_small_irgs(ir_graph *irg, int size);
 
+/* Code Placement.  Pinns 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
+   in state dom_consistent.  Destroys the out information as it moves nodes
+   to other blocks.  Optimizes Tuples in Control edges. (@@@ This
+   is not tested!)
+   @@@ A more powerful code placement would move operations past Phi nodes
+   out of loops.  Further the control flow should be normalized before
+   computing the dominator information so that there exists an optimal block
+   for all operations. */
+void place_code(ir_graph *irg);
+
+/********************************************************************/
+/* Control flow optimization.                                       */
+/* Removes empty blocks doing if simplifications and loop simpli-   */
+/* fications.  A block is empty if it contains only a Jmp node and  */
+/* Phi nodes.                                                       */
+/* Merges single entry single exit blocks with their predecessor    */
+/* and propagates dead control flow by calling equivalent_node.     */
+/* Independent of compiler flag it removes Tuples from cf edges,    */
+/* Bad predecessors form blocks and unnecessary predecessors of End.*/
+/********************************************************************/
+void optimize_cf(ir_graph *irg);
+
+
 # endif /* _IRGOPT_H_ */