X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Firoptimize.h;h=27f885d7c7c039ac722bd9ce77bb7952d014f46b;hb=e2e929ea04eb563b5fffadfd84bd61eb1f85735f;hp=4fae6e983957d37f356679bff8429ea9a3bcfc7a;hpb=acbdf295cc01d5b69b1cb8ea2c7764dca1e7b8ac;p=libfirm

diff --git a/include/libfirm/iroptimize.h b/include/libfirm/iroptimize.h
index 4fae6e983..27f885d7c 100644
--- a/include/libfirm/iroptimize.h
+++ b/include/libfirm/iroptimize.h
@@ -271,7 +271,12 @@ void opt_if_conv(ir_graph *irg, const ir_settings_if_conv_t *params);
 ir_graph_pass_t *opt_if_conv_pass(
 	const char *name, const ir_settings_if_conv_t *params);
 
-void opt_sync(ir_graph *irg);
+/**
+ * Tries to reduce dependencies for memory nodes where possible by parllelizing
+ * them and synchronising with Sync nodes
+ * @param irg   the graph where memory operations should be parallelised
+ */
+void opt_parallelize_mem(ir_graph *irg);
 
 /**
  * Creates an ir_graph pass for opt_sync().
@@ -280,7 +285,7 @@ void opt_sync(ir_graph *irg);
  *
  * @return  the newly created ir_graph pass
  */
-ir_graph_pass_t *opt_sync_pass(const char *name);
+ir_graph_pass_t *opt_parallelize_mem_pass(const char *name);
 
 /*
  * Check if we can replace the load by a given const from
@@ -741,10 +746,11 @@ void normalize_irg_class_casts(ir_graph *irg, gen_pointer_type_to_func gppt_fct)
 void optimize_class_casts(void);
 
 /**
- * CLiff Click's combo algorithm from "Combining Analyses, combining Optimizations".
+ * CLiff Click's combo algorithm from
+ *   "Combining Analyses, combining Optimizations".
  *
- * Does conditional constant propagation, unreachable code elimination and optimistic
- * global value numbering at once.
+ * Does conditional constant propagation, unreachable code elimination and
+ * optimistic global value numbering at once.
  *
  * @param irg  the graph to run on
  */
@@ -835,6 +841,8 @@ ir_prog_pass_t *inline_leave_functions_pass(
 	const char *name, unsigned maxsize, unsigned leavesize,
 	unsigned size, int ignore_runtime);
 
+typedef void (*opt_ptr)(ir_graph *irg);
+
 /**
  * Heuristic inliner. Calculates a benefice value for every call and inlines
  * those calls with a value higher than the threshold.
@@ -843,8 +851,11 @@ ir_prog_pass_t *inline_leave_functions_pass(
  *                            maxsize firm nodes.  It may reach this limit by
  *                            inlining.
  * @param inline_threshold    inlining threshold
+ * @param after_inline_opt    optimizations performed immediately after inlining
+ *                            some calls
  */
-void inline_functions(unsigned maxsize, int inline_threshold);
+void inline_functions(unsigned maxsize, int inline_threshold,
+                      opt_ptr after_inline_opt);
 
 /**
  * Creates an ir_prog pass for inline_functions().
@@ -858,7 +869,8 @@ void inline_functions(unsigned maxsize, int inline_threshold);
  * @return  the newly created ir_prog pass
  */
 ir_prog_pass_t *inline_functions_pass(
-	const char *name, unsigned maxsize, int inline_threshold);
+	const char *name, unsigned maxsize, int inline_threshold,
+	opt_ptr after_inline_opt);
 
 /**
  * Combines congruent blocks into one.
@@ -878,4 +890,20 @@ int shape_blocks(ir_graph *irg);
  */
 ir_graph_pass_t *shape_blocks_pass(const char *name);
 
+/**
+ * Perform loop inversion on a given graph.
+ * Loop inversion transform a head controlled loop (like while(...) {} and
+ * for(...) {}) into a foot controlled loop (do {} while(...)).
+ */
+void do_loop_inversion(ir_graph *irg);
+
+/**
+ * Perform loop peeling on a given graph.
+ */
+void do_loop_peeling(ir_graph *irg);
+
+typedef ir_type *(*get_Alloc_func)(ir_node *n);
+/** Set a new get_Alloc_func and returns the old one. */
+get_Alloc_func firm_set_Alloc_func(get_Alloc_func newf);
+
 #endif