2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Available Optimisations of libFirm.
25 #ifndef FIRM_IROPTIMIZE_H
26 #define FIRM_IROPTIMIZE_H
28 #include "firm_types.h"
31 * Control flow optimization.
33 * Removes empty blocks doing if simplifications and loop simplifications.
34 * A block is empty if it contains only a Jmp node and Phi nodes.
35 * Merges single entry single exit blocks with their predecessor
36 * and propagates dead control flow by calling equivalent_node().
37 * Independent of compiler flag it removes Tuples from cf edges,
38 * Bad predecessors from Blocks and Phis, and unnecessary predecessors of End.
40 * @bug So far destroys backedge information.
41 * @bug Chokes on Id nodes if called in a certain order with other
42 * optimizations. Call local_optimize_graph() before to remove
45 void optimize_cf(ir_graph *irg);
48 * Creates an ir_graph pass for optimize_cf().
50 * @param name the name of this pass or NULL
52 * @return the newly created ir_graph pass
54 ir_graph_pass_t *optimize_cf_pass(const char *name);
57 * Perform path-sensitive jump threading on the given graph.
59 * @param irg the graph
61 void opt_jumpthreading(ir_graph* irg);
64 * Creates an ir_graph pass for opt_jumpthreading().
66 * @param name the name of this pass or NULL
68 * @return the newly created ir_graph pass
70 ir_graph_pass_t *opt_jumpthreading_pass(const char *name);
73 * Try to simplify boolean expression in the given ir graph.
74 * eg. x < 5 && x < 6 becomes x < 5
76 * @param irg the graph
78 void opt_bool(ir_graph *irg);
81 * Creates an ir_graph pass for opt_bool().
83 * @param name the name of this pass or NULL
85 * @return the newly created ir_graph pass
87 ir_graph_pass_t *opt_bool_pass(const char *name);
90 * Try to reduce the number of conv nodes in the given ir graph.
92 * @param irg the graph
94 * @return non-zero if the optimization could be applied, 0 else
96 int conv_opt(ir_graph *irg);
99 * Creates an ir_graph pass for conv_opt().
101 * @param name the name of this pass or NULL
103 * @return the newly created ir_graph pass
105 ir_graph_pass_t *conv_opt_pass(const char *name);
108 * Do the scalar replacement optimization.
109 * Make a date flow analyze and split the
112 * @param irg the graph which should be optimized
114 void data_flow_scalar_replacement_opt(ir_graph *irg);
117 * A callback that checks whether a entity is an allocation
120 typedef int (*check_alloc_entity_func)(ir_entity *ent);
123 * Do simple and fast escape analysis for one graph.
125 * @param irg the graph
126 * @param callback a callback function to check whether a
127 * given entity is a allocation call
129 void escape_enalysis_irg(ir_graph *irg, check_alloc_entity_func callback);
132 * Do simple and fast escape analysis for all graphs.
134 * This optimization implements a simple and fast but inexact
135 * escape analysis. Some addresses might be marked as 'escaped' even
137 * The advantage is a low memory footprint and fast speed.
139 * @param run_scalar_replace if this flag in non-zero, scalar
140 * replacement optimization is run on graphs with removed
142 * @param callback a callback function to check whether a
143 * given entity is a allocation call
145 * This optimization removes allocation which are not used (rare) and replace
146 * allocation that can be proved dead at the end of the graph which stack variables.
148 * The creation of stack variable allows scalar replacement to be run only
149 * on those graphs that have been changed.
151 * This is most effective on Java where no other stack variables exists.
153 void escape_analysis(int run_scalar_replace, check_alloc_entity_func callback);
156 * Optimize function calls by handling const functions.
158 * This optimization first detects all "const functions", i.e.,
159 * IR graphs that neither read nor write memory (and hence did
160 * not create exceptions, as these use memory in Firm).
162 * The result of calls to such functions depends only on its
163 * arguments, hence those calls are no more pinned.
165 * This is a rather strong criteria, so do not expect that a
166 * lot of functions will be found. Moreover, all of them might
167 * already be inlined if inlining is activated.
168 * Anyway, it might be good for handling builtin's or pseudo-graphs,
169 * even if the later read/write memory (but we know how).
171 * This optimizations read the irg_const_function property of
172 * entities and and sets the irg_const_function property of
175 * If callee information is valid, we also optimize polymorphic Calls.
177 * @param force_run if non-zero, an optimization run is started even
178 * if no const function graph was detected.
179 * Else calls are only optimized if at least one
180 * const function graph was detected.
181 * @param callback a callback function to check whether a
182 * given entity is a allocation call
184 * If the frontend created external entities with the irg_const_function
185 * property set, the force_run parameter should be set, else
188 * @note This optimization destroys the link fields of nodes.
190 void optimize_funccalls(int force_run, check_alloc_entity_func callback);
193 * Creates an ir_prog pass for optimize_funccalls().
195 * @param name the name of this pass or NULL
196 * @param force_run if non-zero, an optimization run is started even
197 * if no const function graph was detected.
198 * Else calls are only optimized if at least one
199 * const function graph was detected.
200 * @param callback a callback function to check whether a
201 * given entity is a allocation call
203 * @return the newly created ir_prog pass
205 ir_prog_pass_t *optimize_funccalls_pass(
207 int force_run, check_alloc_entity_func callback);
210 * Does Partial Redundancy Elimination combined with
211 * Global Value Numbering.
212 * Can be used to replace place_code() completely.
214 * Based on VanDrunen and Hosking 2004.
216 * @param irg the graph
218 void do_gvn_pre(ir_graph *irg);
221 * Creates an ir_graph pass for do_gvn_pre().
223 * @param name the name of this pass or NULL
225 * @return the newly created ir_graph pass
227 ir_graph_pass_t *do_gvn_pre_pass(const char *name);
230 * This function is called to evaluate, if a
231 * mux(@p sel, @p mux_false, @p mux_true) should be built for the current
233 * If it returns non-zero, a mux is created, else the code
235 * @param sel A selector of a Cond.
236 * @param phi_list phi node to be converted
237 * @param i First data predecessor involved in if conversion
238 * @param j Second data predecessor involved in if conversion
240 typedef int (*arch_allow_ifconv_func)(ir_node *sel, ir_node *mux_false,
244 * The parameters structure.
246 struct ir_settings_if_conv_t {
247 int max_depth; /**< The maximum depth up to which expressions
248 are examined when it has to be decided if they
249 can be placed into another block. */
250 arch_allow_ifconv_func allow_ifconv; /**< Evaluator function, if not set all possible Psi
251 nodes will be created. */
255 * Perform If conversion on a graph.
257 * @param irg The graph.
258 * @param params The parameters for the if conversion.
260 * Cannot handle blocks with Bad control predecessors, so call it after control
263 void opt_if_conv(ir_graph *irg, const ir_settings_if_conv_t *params);
266 * Creates an ir_graph pass for opt_if_conv().
268 * @param name the name of this pass or NULL
269 * @param params The parameters for the if conversion.
271 * @return the newly created ir_graph pass
273 ir_graph_pass_t *opt_if_conv_pass(
274 const char *name, const ir_settings_if_conv_t *params);
277 * Tries to reduce dependencies for memory nodes where possible by parllelizing
278 * them and synchronising with Sync nodes
279 * @param irg the graph where memory operations should be parallelised
281 void opt_parallelize_mem(ir_graph *irg);
284 * Creates an ir_graph pass for opt_sync().
286 * @param name the name of this pass or NULL
288 * @return the newly created ir_graph pass
290 ir_graph_pass_t *opt_parallelize_mem_pass(const char *name);
293 * Check if we can replace the load by a given const from
294 * the const code irg.
296 * @param load the load to replace
297 * @param c the constant
299 * @return in the modes match or can be transformed using a reinterpret cast
300 * returns a copy of the constant (possibly Conv'ed) on the
303 ir_node *can_replace_load_by_const(const ir_node *load, ir_node *c);
306 * Load/Store optimization.
308 * Removes redundant non-volatile Loads and Stores.
309 * May introduce Bad nodes if exceptional control flow
310 * is removed. The following cases are optimized:
312 * Load without result: A Load which has only a memory use
315 * Load after Store: A Load after a Store is removed, if
316 * the Load doesn't have an exception handler OR is in
317 * the same block as the Store.
319 * Load after Load: A Load after a Load is removed, if the
320 * Load doesn't have an exception handler OR is in the
321 * same block as the previous Load.
323 * Store before Store: A Store immediately before another
324 * Store in the same block is removed, if the Store doesn't
325 * have an exception handler.
327 * Store after Load: A Store after a Load is removed, if the
328 * Store doesn't have an exception handler.
330 * @return non-zero if the optimization could be applied, 0 else
332 int optimize_load_store(ir_graph *irg);
335 * Creates an ir_graph pass for optimize_load_store().
337 * @param name the name of this pass or NULL
339 * @return the newly created ir_graph pass
341 ir_graph_pass_t *optimize_load_store_pass(const char *name);
344 * New experimental alternative to optimize_load_store.
345 * Based on a dataflow analysis, so load/stores are moved out of loops
348 int opt_ldst(ir_graph *irg);
351 * Creates an ir_graph pass for opt_ldst().
353 * @param name the name of this pass or NULL
355 * @return the newly created ir_graph pass
357 ir_graph_pass_t *opt_ldst_pass(const char *name);
360 * Do Loop unrolling in the given graph.
362 void optimize_loop_unrolling(ir_graph *irg);
365 * Creates an ir_graph pass for optimize_loop_unrolling().
367 * @param name the name of this pass or NULL
369 * @return the newly created ir_graph pass
371 ir_graph_pass_t *optimize_loop_unrolling_pass(const char *name);
374 * Optimize the frame type of an irg by removing
375 * never touched entities.
377 * @param irg The graph whose frame type will be optimized
379 * This function did not change the graph, only it's frame type.
380 * The layout state of the frame type will be set to layout_undefined
381 * if entities were removed.
383 void opt_frame_irg(ir_graph *irg);
386 * Creates an ir_graph pass for opt_frame_irg().
388 * @param name the name of this pass or NULL
390 * @return the newly created ir_graph pass
392 ir_graph_pass_t *opt_frame_irg_pass(const char *name);
394 /** Possible flags for the Operator Scalar Replacement. */
395 typedef enum osr_flags {
396 osr_flag_none = 0, /**< no additional flags */
397 osr_flag_lftr_with_ov_check = 1, /**< do linear function test replacement
398 only if no overflow can occur. */
399 osr_flag_ignore_x86_shift = 2, /**< ignore Multiplications by 2, 4, 8 */
400 osr_flag_keep_reg_pressure = 4 /**< do NOT increase register pressure by introducing new
401 induction variables. */
404 /* FirmJNI cannot handle identical enum values... */
406 /** default setting */
407 #define osr_flag_default osr_flag_lftr_with_ov_check
410 * Do the Operator Scalar Replacement optimization and linear
411 * function test replacement for loop control.
412 * Can be switched off using the set_opt_strength_red() flag.
413 * In that case, only remove_phi_cycles() is executed.
415 * @param irg the graph which should be optimized
416 * @param flags set of osr_flags
418 * The linear function replacement test is controlled by the flags.
419 * If the osr_flag_lftr_with_ov_check is set, the replacement is only
420 * done if do overflow can occur.
421 * Otherwise it is ALWAYS done which might be insecure.
425 * for (i = 0; i < 100; ++i)
427 * might be replaced by
429 * for (i = 0; i < 400; i += 4)
433 * for (i = 0; i < 0x7FFFFFFF; ++i)
435 * will not be replaced by
437 * for (i = 0; i < 0xFFFFFFFC; i += 4)
439 * because of overflow.
443 * for (i = 0; i <= 0xF; ++i)
445 * will NOT be transformed into
447 * for (i = 0xFFFFFFF0; i <= 0xFFFFFFFF; ++i)
449 * although here is no direct overflow. The OV occurs when the ++i
450 * is executed (and would created an endless loop here!).
452 * For the same reason, a loop
454 * for (i = 0; i <= 9; i += x)
456 * will NOT be transformed because we cannot estimate whether an overflow
457 * might happen adding x.
459 * Note that i < a + 400 is also not possible with the current implementation
460 * although this might be allowed by other compilers...
462 * Note further that tests for equality can be handled some simpler (but are not
465 * This algorithm destroys the link field of nodes.
467 void opt_osr(ir_graph *irg, unsigned flags);
470 * Creates an ir_graph pass for remove_phi_cycles().
472 * @param name the name of this pass or NULL
473 * @param flags set of osr_flags
475 * @return the newly created ir_graph pass
477 ir_graph_pass_t *opt_osr_pass(const char *name, unsigned flags);
480 * Removes useless Phi cycles, i.e cycles of Phi nodes with only one
482 * This is automatically done in opt_osr(), so there is no need to call it
485 * @param irg the graph which should be optimized
487 * This algorithm destroys the link field of nodes.
489 void remove_phi_cycles(ir_graph *irg);
492 * Creates an ir_graph pass for remove_phi_cycles().
494 * @param name the name of this pass or NULL
496 * @return the newly created ir_graph pass
498 ir_graph_pass_t *remove_phi_cycles_pass(const char *name);
501 /** A default threshold. */
502 #define DEFAULT_CLONE_THRESHOLD 300
505 * Do procedure cloning. Evaluate a heuristic weight for every
506 * Call(..., Const, ...). If the weight is bigger than threshold,
507 * clone the entity and fix the calls.
509 * @param threshold the threshold for cloning
511 * The threshold is an estimation of how many instructions are saved
512 * when executing a cloned method. If threshold is 0.0, every possible
515 void proc_cloning(float threshold);
518 * Creates an ir_prog pass for proc_cloning().
520 * @param name the name of this pass or NULL
521 * @param threshold the threshold for cloning
523 * @return the newly created ir_prog pass
525 ir_prog_pass_t *proc_cloning_pass(const char *name, float threshold);
530 * Applies Reassociation rules to integer expressions.
531 * Beware: Works only if integer overflow might be ignored, as for C, Java
532 * and for address expression.
533 * Works only if Constant folding is activated.
535 * Uses loop information to detect loop-invariant (ie contant
536 * inside the loop) values.
538 * See Muchnik 12.3.1 Algebraic Simplification and Reassociation of
539 * Addressing Expressions.
541 * @return non-zero if the optimization could be applied, 0 else
543 int optimize_reassociation(ir_graph *irg);
546 * Creates an ir_graph pass for optimize_reassociation().
548 * @param name the name of this pass or NULL
550 * @return the newly created ir_graph pass
552 ir_graph_pass_t *optimize_reassociation_pass(const char *name);
555 * Normalize the Returns of a graph by creating a new End block
556 * with One Return(Phi).
557 * This is the preferred input for the if-conversion.
559 * In pseudocode, it means:
566 * is transformed into
574 void normalize_one_return(ir_graph *irg);
577 * Creates an ir_graph pass for normalize_one_return().
579 * @param name the name of this pass or NULL
581 * @return the newly created ir_graph pass
583 ir_graph_pass_t *normalize_one_return_pass(const char *name);
586 * Normalize the Returns of a graph by moving
587 * the Returns upwards as much as possible.
588 * This might be preferred for code generation.
590 * In pseudocode, it means:
598 * is transformed into
605 void normalize_n_returns(ir_graph *irg);
608 * Creates an ir_graph pass for normalize_n_returns().
610 * @param name the name of this pass or NULL
612 * @return the newly created ir_graph pass
614 ir_graph_pass_t *normalize_n_returns_pass(const char *name);
617 * Do the scalar replacement optimization.
618 * Replace local compound entities (like structures and arrays)
619 * with atomic values if possible. Does not handle classes yet.
621 * @param irg the graph which should be optimized
623 * @return non-zero, if at least one entity was replaced
625 int scalar_replacement_opt(ir_graph *irg);
628 * Creates an ir_graph pass for scalar_replacement_opt().
630 * @param name the name of this pass or NULL
632 * @return the newly created ir_graph pass
634 ir_graph_pass_t *scalar_replacement_opt_pass(const char *name);
636 /** Performs strength reduction for the passed graph. */
637 void reduce_strength(ir_graph *irg);
640 * Optimizes tail-recursion calls by converting them into loops.
641 * Depends on the flag opt_tail_recursion.
642 * Currently supports the following forms:
644 * - return x + func();
645 * - return func() - x;
646 * - return x * func();
649 * Does not work for Calls that use the exception stuff.
651 * @param irg the graph to be optimized
653 * @return non-zero if the optimization could be applied, 0 else
655 int opt_tail_rec_irg(ir_graph *irg);
658 * Creates an ir_graph pass for opt_tail_rec_irg().
660 * @param name the name of this pass or NULL
662 * @return the newly created ir_graph pass
664 ir_graph_pass_t *opt_tail_rec_irg_pass(const char *name);
667 * Optimize tail-recursion calls for all IR-Graphs.
668 * Can currently handle:
669 * - direct return value, i.e. return func().
670 * - additive return value, i.e. return x +/- func()
671 * - multiplicative return value, i.e. return x * func() or return -func()
673 * The current implementation must be run before optimize_funccalls(),
674 * because it expects the memory edges pointing to calls, which might be
675 * removed by optimize_funccalls().
677 void opt_tail_recursion(void);
680 * Creates an ir_prog pass for opt_tail_recursion().
682 * @param name the name of this pass or NULL
684 * @return the newly created ir_prog pass
686 ir_prog_pass_t *opt_tail_recursion_pass(const char *name);
688 /** This is the type for a method, that returns a pointer type to
689 * tp. This is needed in the normalization. */
690 typedef ir_type *(*gen_pointer_type_to_func)(ir_type *tp);
692 /** Insert Casts so that class type casts conform exactly with the type hierarchy.
694 * Formulated in Java, this achieves the following:
696 * For a class hierarchy
698 * class B extends A {}
699 * class C extends B {}
700 * we transforms a cast
705 * The algorithm works for Casts with class types, but also for Casts
706 * with all pointer types that point (over several indirections,
707 * i.e. ***A) to a class type. Normalizes all graphs. Computes type
708 * information (@see irtypeinfo.h) if not available.
709 * Invalidates trout information as new casts are generated.
711 * @param gppt_fct A function that returns a pointer type that points
712 * to the type given as argument. If this parameter is NULL, a default
713 * function is used that either uses trout information or performs a O(n)
714 * search to find an existing pointer type. If it can not find a type,
715 * generates a pointer type with mode_P_mach and suffix "cc_ptr_tp".
717 void normalize_irp_class_casts(gen_pointer_type_to_func gppt_fct);
719 /** Insert Casts so that class type casts conform exactly with the type hierarchy
722 * For more details see normalize_irp_class_casts().
724 * This transformation requires that type information is computed. @see irtypeinfo.h.
726 void normalize_irg_class_casts(ir_graph *irg, gen_pointer_type_to_func gppt_fct);
728 /** Optimize casting between class types.
731 * class B extends A { }
732 * class C extends B {}
733 * Performs the following transformations:
734 * C c = (C)(B)(A)(B)new C() --> C c = (C)(B)newC() --> C c = new C()
735 * (Optimizing downcasts as A a = (A)(B)(new A()) --> A a = new A() can
736 * be suppressed by setting the flag opt_suppress_downcast_optimization.
737 * Downcasting A to B might cause an exception. It is not clear
738 * whether this is modeled by the Firm Cast node, as it has no exception
740 * If there is inh_m() that overwrites m() in B:
741 * ((A) new B()).m() --> (new B()).inh_m()
742 * Phi((A)x, (A)y) --> (A) Phi (x, y) if (A) is an upcast.
744 * Computes type information if not available. @see irtypeinfo.h.
745 * Typeinformation is valid after optimization.
746 * Invalidates trout information.
748 void optimize_class_casts(void);
751 * CLiff Click's combo algorithm from
752 * "Combining Analyses, combining Optimizations".
754 * Does conditional constant propagation, unreachable code elimination and
755 * optimistic global value numbering at once.
757 * @param irg the graph to run on
759 void combo(ir_graph *irg);
762 * Creates an ir_graph pass for combo.
764 * @param name the name of this pass or NULL
766 * @return the newly created ir_graph pass
768 ir_graph_pass_t *combo_pass(const char *name);
771 * Inlines all small methods at call sites where the called address comes
772 * from a SymConst node that references the entity representing the called
775 * @param irg the graph
776 * @param size maximum function size
778 * The size argument is a rough measure for the code size of the method:
779 * Methods where the obstack containing the firm graph is smaller than
780 * size are inlined. Further only a limited number of calls are inlined.
781 * If the method contains more than 1024 inlineable calls none will be
783 * Inlining is only performed if flags `optimize' and `inlineing' are set.
784 * The graph may not be in state phase_building.
785 * It is recommended to call local_optimize_graph() after inlining as this
786 * function leaves a set of obscure Tuple nodes, e.g. a Proj-Tuple-Jmp
787 * combination as control flow operation.
789 void inline_small_irgs(ir_graph *irg, int size);
792 * Creates an ir_graph pass for inline_small_irgs().
794 * @param name the name of this pass or NULL
795 * @param size maximum function size
797 * @return the newly created ir_graph pass
799 ir_graph_pass_t *inline_small_irgs_pass(const char *name, int size);
802 * Inlineing with a different heuristic than inline_small_irgs().
804 * Inlines leave functions. If inlinening creates new leave
805 * function inlines these, too. (If g calls f, and f calls leave h,
806 * h is first inlined in f and then f in g.)
808 * Then inlines all small functions (this is not recursive).
810 * For a heuristic this inlineing uses firm node counts. It does
811 * not count auxiliary nodes as Proj, Tuple, End, Start, Id, Sync.
812 * If the ignore_runtime flag is set, calls to functions marked with the
813 * mtp_property_runtime property are ignored.
815 * @param maxsize Do not inline any calls if a method has more than
816 * maxsize firm nodes. It may reach this limit by
818 * @param leavesize Inline leave functions if they have less than leavesize
820 * @param size Inline all function smaller than size.
821 * @param ignore_runtime count a function only calling runtime functions as
824 void inline_leave_functions(unsigned maxsize, unsigned leavesize,
825 unsigned size, int ignore_runtime);
828 * Creates an ir_prog pass for inline_leave_functions().
830 * @param name the name of this pass or NULL
831 * @param maxsize Do not inline any calls if a method has more than
832 * maxsize firm nodes. It may reach this limit by
834 * @param leavesize Inline leave functions if they have less than leavesize
836 * @param size Inline all function smaller than size.
837 * @param ignore_runtime count a function only calling runtime functions as
840 * @return the newly created ir_prog pass
842 ir_prog_pass_t *inline_leave_functions_pass(
843 const char *name, unsigned maxsize, unsigned leavesize,
844 unsigned size, int ignore_runtime);
846 typedef void (*opt_ptr)(ir_graph *irg);
849 * Heuristic inliner. Calculates a benefice value for every call and inlines
850 * those calls with a value higher than the threshold.
852 * @param maxsize Do not inline any calls if a method has more than
853 * maxsize firm nodes. It may reach this limit by
855 * @param inline_threshold inlining threshold
856 * @param after_inline_opt optimizations performed immediately after inlining
859 void inline_functions(unsigned maxsize, int inline_threshold,
860 opt_ptr after_inline_opt);
863 * Creates an ir_prog pass for inline_functions().
865 * @param name the name of this pass or NULL
866 * @param maxsize Do not inline any calls if a method has more than
867 * maxsize firm nodes. It may reach this limit by
869 * @param inline_threshold inlining threshold
871 * @return the newly created ir_prog pass
873 ir_prog_pass_t *inline_functions_pass(
874 const char *name, unsigned maxsize, int inline_threshold,
875 opt_ptr after_inline_opt);
878 * Combines congruent blocks into one.
880 * @param irg The IR-graph to optimize.
882 * @return non-zero if the graph was transformed
884 int shape_blocks(ir_graph *irg);
887 * Creates an ir_graph pass for shape_blocks().
889 * @param name the name of this pass or NULL
891 * @return the newly created ir_graph pass
893 ir_graph_pass_t *shape_blocks_pass(const char *name);
896 * Perform loop inversion on a given graph.
897 * Loop inversion transform a head controlled loop (like while(...) {} and
898 * for(...) {}) into a foot controlled loop (do {} while(...)).
900 void do_loop_inversion(ir_graph *irg);
903 * Perform loop peeling on a given graph.
905 void do_loop_peeling(ir_graph *irg);
907 typedef ir_type *(*get_Alloc_func)(ir_node *n);
908 /** Set a new get_Alloc_func and returns the old one. */
909 get_Alloc_func firm_set_Alloc_func(get_Alloc_func newf);
912 * Removes all entities which are unused.
914 * Unused entities have ir_visibility_local and are not used directly or
915 * indirectly through entities/code visible outside the compilation unit.
916 * This is usually conservative than gc_irgs, but does not respect properties
917 * of object-oriented programs.
919 void garbage_collect_entities(void);
921 /** Pass for garbage_collect_entities */
922 ir_prog_pass_t *garbage_collect_entities_pass(const char *name);