X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Firgopt.h;h=dac94fdda0c9b09ac0717367af808436efe66b27;hb=d4bbab11371a9c68aa2a716eaa7589b82a28691e;hp=bc72f66584e37bf7f74e70f28458f25d778774fb;hpb=069e718d49c6ac8b6cf98370ae2a5d7aae21c015;p=libfirm

diff --git a/include/libfirm/irgopt.h b/include/libfirm/irgopt.h
index bc72f6658..dac94fdda 100644
--- a/include/libfirm/irgopt.h
+++ b/include/libfirm/irgopt.h
@@ -39,20 +39,22 @@ void local_optimize_node(ir_node *n);
  * @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.
+ * only occur 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 optimize_graph_df() to a IR-graph, Bad nodes
+ * only occur as predecessor of Block and Phi nodes.
  *
- * After applying local_optimize_graph() to a IR-graph, Bad nodes
- * only occure as predecessor of Block and Phi nodes.
+ * This version uses fixpoint iteration.
+ *
+ * @param irg  The graph to be optimized.
  *
- * This version used a fixpoint iteration.
+ * @return non-zero if the optimization could be applied, 0 else
  */
-void optimize_graph_df(ir_graph *irg);
+int optimize_graph_df(ir_graph *irg);
 
 /** Performs dead node elimination by copying the ir graph to a new obstack.
  *
@@ -143,56 +145,6 @@ void remove_bad_predecessors(ir_graph *irg);
  */
 int inline_method(ir_node *call, ir_graph *called_graph);
 
-/** Inlines all small methods at call sites where the called address comes
- *  from a SymConst node that references the entity representing the called
- *  method.
- *
- *  The size argument is a rough measure for the code size of the method:
- *  Methods where the obstack containing the firm graph is smaller than
- *  size are inlined.  Further only a limited number of calls are inlined.
- *  If the method contains more than 1024 inlineable calls none will be
- *  inlined.
- *  Inlining is only performed if flags `optimize' and `inlineing' are set.
- *  The graph may not be in state phase_building.
- *  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.
- */
-void inline_small_irgs(ir_graph *irg, int size);
-
-
-/** Inlineing with a different heuristic than inline_small_irgs().
- *
- *  Inlines leave functions.  If inlinening creates new leave
- *  function inlines these, too. (If g calls f, and f calls leave h,
- *  h is first inlined in f and then f in g.)
- *
- *  Then inlines all small functions (this is not recursive).
- *
- *  For a heuristic this inlineing uses firm node counts.  It does
- *  not count auxiliary nodes as Proj, Tuple, End, Start, Id, Sync.
- *  If the ignore_runtime flag is set, calls to functions marked with the
- *  mtp_property_runtime property are ignored.
- *
- *  @param maxsize         Do not inline any calls if a method has more than
- *                         maxsize firm nodes.  It may reach this limit by
- *                         inlineing.
- *  @param leavesize       Inline leave functions if they have less than leavesize
- *                         nodes.
- *  @param size            Inline all function smaller than size.
- *  @param ignore_runtime  count a function only calling runtime functions as
- *                         leave
- */
-void inline_leave_functions(int maxsize, int leavesize, int size, int ignore_runtime);
-
-/**
- * Heuristic inliner. Calculates a benefice value for every call and inlines
- * those calls with a value higher than the threshold.
- *
- * @param threshold    inlining threshold
- */
-void inline_functions(unsigned inline_threshold);
-
 /** Code Placement.
  *
  * Pins all floating nodes to a block where they
@@ -217,10 +169,22 @@ 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).
+ * p. 407). Exception edges are always ignored.
  *
- * @param irg IR Graph
+ * @param irg  IR Graph
  */
 void remove_critical_cf_edges(ir_graph *irg);
 
+/** Places an empty basic block on critical control flow edges thereby
+ * removing them.
+ *
+ * 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).
+ *
+ * @param irg                     IR Graph
+ * @param ignore_exception_edges  if non-zero, exception edges will be ignored
+ */
+void remove_critical_cf_edges_ex(ir_graph *irg, int ignore_exception_edges);
+
 #endif