+FIRM_API void combo(ir_graph *irg);
+
+/**
+ * Creates an ir_graph pass for combo.
+ *
+ * @param name the name of this pass or NULL
+ *
+ * @return the newly created ir_graph pass
+ */
+FIRM_API ir_graph_pass_t *combo_pass(const char *name);
+
+/**
+ * Inlines all small methods at call sites where the called address comes
+ * from a SymConst node that references the entity representing the called
+ * method.
+ *
+ * @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
+ * inlined.
+ * Inlining is only performed if flags `optimize' and `inlining' 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.
+ */
+FIRM_API void inline_small_irgs(ir_graph *irg, int size);
+
+/**
+ * Creates an ir_graph pass for inline_small_irgs().
+ *
+ * @param name the name of this pass or NULL
+ * @param size maximum function size
+ *
+ * @return the newly created ir_graph pass
+ */
+FIRM_API ir_graph_pass_t *inline_small_irgs_pass(const char *name, int size);
+
+/**
+ * Inlineing with a different heuristic than inline_small_irgs().
+ *
+ * Inlines leaf functions. If inlining creates new leafs
+ * function inlines these, too. (If g calls f, and f calls leaf 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 inlining 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
+ * inlining.
+ * @param leafsize Inline leaf functions if they have less than leafsize
+ * nodes.
+ * @param size Inline all function smaller than size.
+ * @param ignore_runtime count a function only calling runtime functions as
+ * leaf
+ */
+FIRM_API void inline_leaf_functions(unsigned maxsize, unsigned leafsize,
+ unsigned size, int ignore_runtime);
+
+/**
+ * Creates an ir_prog pass for inline_leaf_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
+ * inlining.
+ * @param leafsize Inline leaf functions if they have less than leafsize
+ * nodes.
+ * @param size Inline all function smaller than size.
+ * @param ignore_runtime count a function only calling runtime functions as
+ * leaf
+ *
+ * @return the newly created ir_prog pass
+ */
+FIRM_API ir_prog_pass_t *inline_leaf_functions_pass(const char *name,
+ unsigned maxsize, unsigned leafsize, unsigned size,
+ int ignore_runtime);
+
+/** pointer to an optimization function */
+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
+ * inlining.
+ * @param inline_threshold inlining threshold
+ * @param after_inline_opt optimizations performed immediately after inlining
+ * some calls
+ */
+FIRM_API 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 inline_threshold inlining threshold
+ * @param after_inline_opt a function that is called after inlining a
+ * procedure. You should run fast local optimisations
+ * here which cleanup the graph before further
+ * inlining
+ *
+ * @return the newly created ir_prog pass
+ */
+FIRM_API ir_prog_pass_t *inline_functions_pass(const char *name,
+ unsigned maxsize, int inline_threshold, opt_ptr after_inline_opt);
+
+/**
+ * Combines congruent blocks into one.
+ *
+ * @param irg The IR-graph to optimize.
+ */
+FIRM_API void 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
+ */
+FIRM_API ir_graph_pass_t *shape_blocks_pass(const char *name);
+
+/**
+ * Perform loop inversion on a given graph.
+ * Loop inversion transforms a head controlled loop (like while(...) {} and
+ * for(...) {}) into a foot controlled loop (do {} while(...)).
+ */
+FIRM_API void do_loop_inversion(ir_graph *irg);
+
+/**
+ * Perform loop unrolling on a given graph.
+ * Loop unrolling multiplies the number loop completely by a number found
+ * through a heuristic.
+ */
+FIRM_API void do_loop_unrolling(ir_graph *irg);
+
+/**
+ * Perform loop peeling on a given graph.
+ */
+FIRM_API void do_loop_peeling(ir_graph *irg);
+
+/**
+ * Creates an ir_graph pass for loop inversion.
+ *
+ * @param name the name of this pass or NULL
+ *
+ * @return the newly created ir_graph pass
+ */
+FIRM_API ir_graph_pass_t *loop_inversion_pass(const char *name);
+
+/**
+ * Creates an ir_graph pass for loop unrolling.
+ *
+ * @param name the name of this pass or NULL
+ *
+ * @return the newly created ir_graph pass
+ */
+FIRM_API ir_graph_pass_t *loop_unroll_pass(const char *name);
+
+/**
+ * Creates an ir_graph pass for loop peeling.
+ *
+ * @param name the name of this pass or NULL
+ *
+ * @return the newly created ir_graph pass
+ */
+FIRM_API ir_graph_pass_t *loop_peeling_pass(const char *name);
+
+/**
+ * Creates an ir_graph pass for set_vrp_data()
+ *
+ * @param name The name of this pass or NULL
+ *
+ * @return the newly created ir_graph pass
+ */
+FIRM_API ir_graph_pass_t *set_vrp_pass(const char *name);
+
+/**
+ * Removes all entities which are unused.
+ *
+ * Unused entities have ir_visibility_local and are not used directly or
+ * indirectly through entities/code visible outside the compilation unit.
+ * This is usually conservative than gc_irgs, but does not respect properties
+ * of object-oriented programs.
+ */
+FIRM_API void garbage_collect_entities(void);
+
+/** Pass for garbage_collect_entities */
+FIRM_API ir_prog_pass_t *garbage_collect_entities_pass(const char *name);
+
+/**
+ * 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 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.
+ *
+ * Dead_node_elimination is only performed if options `optimize' and
+ * `opt_dead_node_elimination' are set. The graph may
+ * not be in state phase_building. The outs datastructure is freed,
+ * the outs state set to outs_none. Backedge information is conserved.
+ * Removes old attributes of nodes. Sets link field to NULL.
+ * Callee information must be freed (irg_callee_info_none).
+ *
+ * @param irg The graph to be optimized.
+ */
+FIRM_API void dead_node_elimination(ir_graph *irg);