/**
* Creates an ir_graph pass for do_gvn_pre().
*
- * @param dump should this pass result be dumped?
+ * @param name the name of this pass or NULL
*
* @return the newly created ir_graph pass
*/
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().
*
* @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
*/
void proc_cloning(float threshold);
+/**
+ * Creates an ir_prog pass for proc_cloning().
+ *
+ * @param name the name of this pass or NULL
+ * @param threshold the threshold for cloning
+ *
+ * @return the newly created ir_prog pass
+ */
+ir_prog_pass_t *proc_cloning_pass(const char *name, float threshold);
+
/**
* Reassociation.
*
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
*/
* from a SymConst node that references the entity representing the called
* method.
*
- * @param size maximum function size
+ * @param irg the graph
+ * @param size maximum function size
*
* 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
- * nlined.
+ * 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
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.
*
- * @param maxsize Do not inline any calls if a method has more than
- * maxsize firm nodes. It may reach this limit by
- * inlineing.
- * @param threshold inlining threshold
+ * @param maxsize Do not inline any calls if a method has more than
+ * 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().
*
- * @param name the name of this pass or NULL
- * @param maxsize Do not inline any calls if a method has more than
- * maxsize firm nodes. It may reach this limit by
- * inlineing.
- * @param threshold inlining threshold
+ * @param name the name of this pass or NULL
+ * @param maxsize Do not inline any calls if a method has more than
+ * maxsize firm nodes. It may reach this limit by
+ * inlineing.
+ * @param inline_threshold inlining 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.
*/
int shape_blocks(ir_graph *irg);
+/**
+ * Creates an ir_graph pass for shape_blocks().
+ *
+ * @param name the name of this pass or NULL
+ *
+ * @return the newly created ir_graph pass
+ */
+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
projects / libfirm / blobdiff