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 mux can build
231 * of the current architecture.
232 * If it returns non-zero, a mux is created, else the code
234 * @param sel A selector of a Cond.
235 * @param phi_list List of Phi nodes about to be converted (linked via get_Phi_next() field)
236 * @param i First data predecessor involved in if conversion
237 * @param j Second data predecessor involved in if conversion
239 typedef int (*arch_allow_ifconv_func)(ir_node *sel, ir_node* phi_list, int i, int j);
242 * The parameters structure.
244 struct ir_settings_if_conv_t {
245 int max_depth; /**< The maximum depth up to which expressions
246 are examined when it has to be decided if they
247 can be placed into another block. */
248 arch_allow_ifconv_func allow_ifconv; /**< Evaluator function, if not set all possible Psi
249 nodes will be created. */
253 * Perform If conversion on a graph.
255 * @param irg The graph.
256 * @param params The parameters for the if conversion.
258 * Cannot handle blocks with Bad control predecessors, so call it after control
261 void opt_if_conv(ir_graph *irg, const ir_settings_if_conv_t *params);
264 * Creates an ir_graph pass for opt_if_conv().
266 * @param name the name of this pass or NULL
267 * @param params The parameters for the if conversion.
269 * @return the newly created ir_graph pass
271 ir_graph_pass_t *opt_if_conv_pass(
272 const char *name, const ir_settings_if_conv_t *params);
275 * Tries to reduce dependencies for memory nodes where possible by parllelizing
276 * them and synchronising with Sync nodes
277 * @param irg the graph where memory operations should be parallelised
279 void opt_parallelize_mem(ir_graph *irg);
282 * Creates an ir_graph pass for opt_sync().
284 * @param name the name of this pass or NULL
286 * @return the newly created ir_graph pass
288 ir_graph_pass_t *opt_parallelize_mem_pass(const char *name);
291 * Check if we can replace the load by a given const from
292 * the const code irg.
294 * @param load the load to replace
295 * @param c the constant
297 * @return in the modes match or can be transformed using a reinterpret cast
298 * returns a copy of the constant (possibly Conv'ed) on the
301 ir_node *can_replace_load_by_const(const ir_node *load, ir_node *c);
304 * Load/Store optimization.
306 * Removes redundant non-volatile Loads and Stores.
307 * May introduce Bad nodes if exceptional control flow
308 * is removed. The following cases are optimized:
310 * Load without result: A Load which has only a memory use
313 * Load after Store: A Load after a Store is removed, if
314 * the Load doesn't have an exception handler OR is in
315 * the same block as the Store.
317 * Load after Load: A Load after a Load is removed, if the
318 * Load doesn't have an exception handler OR is in the
319 * same block as the previous Load.
321 * Store before Store: A Store immediately before another
322 * Store in the same block is removed, if the Store doesn't
323 * have an exception handler.
325 * Store after Load: A Store after a Load is removed, if the
326 * Store doesn't have an exception handler.
328 * @return non-zero if the optimization could be applied, 0 else
330 int optimize_load_store(ir_graph *irg);
333 * Creates an ir_graph pass for optimize_load_store().
335 * @param name the name of this pass or NULL
337 * @return the newly created ir_graph pass
339 ir_graph_pass_t *optimize_load_store_pass(const char *name);
342 * New experimental alternative to optimize_load_store.
343 * Based on a dataflow analysis, so load/stores are moved out of loops
346 int opt_ldst(ir_graph *irg);
349 * Creates an ir_graph pass for opt_ldst().
351 * @param name the name of this pass or NULL
353 * @return the newly created ir_graph pass
355 ir_graph_pass_t *opt_ldst_pass(const char *name);
358 * Do Loop unrolling in the given graph.
360 void optimize_loop_unrolling(ir_graph *irg);
363 * Creates an ir_graph pass for optimize_loop_unrolling().
365 * @param name the name of this pass or NULL
367 * @return the newly created ir_graph pass
369 ir_graph_pass_t *optimize_loop_unrolling_pass(const char *name);
372 * Optimize the frame type of an irg by removing
373 * never touched entities.
375 * @param irg The graph whose frame type will be optimized
377 * This function did not change the graph, only it's frame type.
378 * The layout state of the frame type will be set to layout_undefined
379 * if entities were removed.
381 void opt_frame_irg(ir_graph *irg);
384 * Creates an ir_graph pass for opt_frame_irg().
386 * @param name the name of this pass or NULL
388 * @return the newly created ir_graph pass
390 ir_graph_pass_t *opt_frame_irg_pass(const char *name);
392 /** Possible flags for the Operator Scalar Replacement. */
393 typedef enum osr_flags {
394 osr_flag_none = 0, /**< no additional flags */
395 osr_flag_lftr_with_ov_check = 1, /**< do linear function test replacement
396 only if no overflow can occur. */
397 osr_flag_ignore_x86_shift = 2, /**< ignore Multiplications by 2, 4, 8 */
398 osr_flag_keep_reg_pressure = 4 /**< do NOT increase register pressure by introducing new
399 induction variables. */
402 /* FirmJNI cannot handle identical enum values... */
404 /** default setting */
405 #define osr_flag_default osr_flag_lftr_with_ov_check
408 * Do the Operator Scalar Replacement optimization and linear
409 * function test replacement for loop control.
410 * Can be switched off using the set_opt_strength_red() flag.
411 * In that case, only remove_phi_cycles() is executed.
413 * @param irg the graph which should be optimized
414 * @param flags set of osr_flags
416 * The linear function replacement test is controlled by the flags.
417 * If the osr_flag_lftr_with_ov_check is set, the replacement is only
418 * done if do overflow can occur.
419 * Otherwise it is ALWAYS done which might be insecure.
423 * for (i = 0; i < 100; ++i)
425 * might be replaced by
427 * for (i = 0; i < 400; i += 4)
431 * for (i = 0; i < 0x7FFFFFFF; ++i)
433 * will not be replaced by
435 * for (i = 0; i < 0xFFFFFFFC; i += 4)
437 * because of overflow.
441 * for (i = 0; i <= 0xF; ++i)
443 * will NOT be transformed into
445 * for (i = 0xFFFFFFF0; i <= 0xFFFFFFFF; ++i)
447 * although here is no direct overflow. The OV occurs when the ++i
448 * is executed (and would created an endless loop here!).
450 * For the same reason, a loop
452 * for (i = 0; i <= 9; i += x)
454 * will NOT be transformed because we cannot estimate whether an overflow
455 * might happen adding x.
457 * Note that i < a + 400 is also not possible with the current implementation
458 * although this might be allowed by other compilers...
460 * Note further that tests for equality can be handled some simpler (but are not
463 * This algorithm destroys the link field of nodes.
465 void opt_osr(ir_graph *irg, unsigned flags);
468 * Creates an ir_graph pass for remove_phi_cycles().
470 * @param name the name of this pass or NULL
471 * @param flags set of osr_flags
473 * @return the newly created ir_graph pass
475 ir_graph_pass_t *opt_osr_pass(const char *name, unsigned flags);
478 * Removes useless Phi cycles, i.e cycles of Phi nodes with only one
480 * This is automatically done in opt_osr(), so there is no need to call it
483 * @param irg the graph which should be optimized
485 * This algorithm destroys the link field of nodes.
487 void remove_phi_cycles(ir_graph *irg);
490 * Creates an ir_graph pass for remove_phi_cycles().
492 * @param name the name of this pass or NULL
494 * @return the newly created ir_graph pass
496 ir_graph_pass_t *remove_phi_cycles_pass(const char *name);
499 /** A default threshold. */
500 #define DEFAULT_CLONE_THRESHOLD 300
503 * Do procedure cloning. Evaluate a heuristic weight for every
504 * Call(..., Const, ...). If the weight is bigger than threshold,
505 * clone the entity and fix the calls.
507 * @param threshold the threshold for cloning
509 * The threshold is an estimation of how many instructions are saved
510 * when executing a cloned method. If threshold is 0.0, every possible
513 void proc_cloning(float threshold);
516 * Creates an ir_prog pass for proc_cloning().
518 * @param name the name of this pass or NULL
519 * @param threshold the threshold for cloning
521 * @return the newly created ir_prog pass
523 ir_prog_pass_t *proc_cloning_pass(const char *name, float threshold);
528 * Applies Reassociation rules to integer expressions.
529 * Beware: Works only if integer overflow might be ignored, as for C, Java
530 * and for address expression.
531 * Works only if Constant folding is activated.
533 * Uses loop information to detect loop-invariant (ie contant
534 * inside the loop) values.
536 * See Muchnik 12.3.1 Algebraic Simplification and Reassociation of
537 * Addressing Expressions.
539 * @return non-zero if the optimization could be applied, 0 else
541 int optimize_reassociation(ir_graph *irg);
544 * Creates an ir_graph pass for optimize_reassociation().
546 * @param name the name of this pass or NULL
548 * @return the newly created ir_graph pass
550 ir_graph_pass_t *optimize_reassociation_pass(const char *name);
553 * Normalize the Returns of a graph by creating a new End block
554 * with One Return(Phi).
555 * This is the preferred input for the if-conversion.
557 * In pseudocode, it means:
564 * is transformed into
572 void normalize_one_return(ir_graph *irg);
575 * Creates an ir_graph pass for normalize_one_return().
577 * @param name the name of this pass or NULL
579 * @return the newly created ir_graph pass
581 ir_graph_pass_t *normalize_one_return_pass(const char *name);
584 * Normalize the Returns of a graph by moving
585 * the Returns upwards as much as possible.
586 * This might be preferred for code generation.
588 * In pseudocode, it means:
596 * is transformed into
603 void normalize_n_returns(ir_graph *irg);
606 * Creates an ir_graph pass for normalize_n_returns().
608 * @param name the name of this pass or NULL
610 * @return the newly created ir_graph pass
612 ir_graph_pass_t *normalize_n_returns_pass(const char *name);
615 * Do the scalar replacement optimization.
616 * Replace local compound entities (like structures and arrays)
617 * with atomic values if possible. Does not handle classes yet.
619 * @param irg the graph which should be optimized
621 * @return non-zero, if at least one entity was replaced
623 int scalar_replacement_opt(ir_graph *irg);
626 * Creates an ir_graph pass for scalar_replacement_opt().
628 * @param name the name of this pass or NULL
630 * @return the newly created ir_graph pass
632 ir_graph_pass_t *scalar_replacement_opt_pass(const char *name);
634 /** Performs strength reduction for the passed graph. */
635 void reduce_strength(ir_graph *irg);
638 * Optimizes tail-recursion calls by converting them into loops.
639 * Depends on the flag opt_tail_recursion.
640 * Currently supports the following forms:
642 * - return x + func();
643 * - return func() - x;
644 * - return x * func();
647 * Does not work for Calls that use the exception stuff.
649 * @param irg the graph to be optimized
651 * @return non-zero if the optimization could be applied, 0 else
653 int opt_tail_rec_irg(ir_graph *irg);
656 * Creates an ir_graph pass for opt_tail_rec_irg().
658 * @param name the name of this pass or NULL
660 * @return the newly created ir_graph pass
662 ir_graph_pass_t *opt_tail_rec_irg_pass(const char *name);
665 * Optimize tail-recursion calls for all IR-Graphs.
666 * Can currently handle:
667 * - direct return value, i.e. return func().
668 * - additive return value, i.e. return x +/- func()
669 * - multiplicative return value, i.e. return x * func() or return -func()
671 * The current implementation must be run before optimize_funccalls(),
672 * because it expects the memory edges pointing to calls, which might be
673 * removed by optimize_funccalls().
675 void opt_tail_recursion(void);
678 * Creates an ir_prog pass for opt_tail_recursion().
680 * @param name the name of this pass or NULL
682 * @return the newly created ir_prog pass
684 ir_prog_pass_t *opt_tail_recursion_pass(const char *name);
686 /** This is the type for a method, that returns a pointer type to
687 * tp. This is needed in the normalization. */
688 typedef ir_type *(*gen_pointer_type_to_func)(ir_type *tp);
690 /** Insert Casts so that class type casts conform exactly with the type hierarchy.
692 * Formulated in Java, this achieves the following:
694 * For a class hierarchy
696 * class B extends A {}
697 * class C extends B {}
698 * we transforms a cast
703 * The algorithm works for Casts with class types, but also for Casts
704 * with all pointer types that point (over several indirections,
705 * i.e. ***A) to a class type. Normalizes all graphs. Computes type
706 * information (@see irtypeinfo.h) if not available.
707 * Invalidates trout information as new casts are generated.
709 * @param gppt_fct A function that returns a pointer type that points
710 * to the type given as argument. If this parameter is NULL, a default
711 * function is used that either uses trout information or performs a O(n)
712 * search to find an existing pointer type. If it can not find a type,
713 * generates a pointer type with mode_P_mach and suffix "cc_ptr_tp".
715 void normalize_irp_class_casts(gen_pointer_type_to_func gppt_fct);
717 /** Insert Casts so that class type casts conform exactly with the type hierarchy
720 * For more details see normalize_irp_class_casts().
722 * This transformation requires that type information is computed. @see irtypeinfo.h.
724 void normalize_irg_class_casts(ir_graph *irg, gen_pointer_type_to_func gppt_fct);
726 /** Optimize casting between class types.
729 * class B extends A { }
730 * class C extends B {}
731 * Performs the following transformations:
732 * C c = (C)(B)(A)(B)new C() --> C c = (C)(B)newC() --> C c = new C()
733 * (Optimizing downcasts as A a = (A)(B)(new A()) --> A a = new A() can
734 * be suppressed by setting the flag opt_suppress_downcast_optimization.
735 * Downcasting A to B might cause an exception. It is not clear
736 * whether this is modeled by the Firm Cast node, as it has no exception
738 * If there is inh_m() that overwrites m() in B:
739 * ((A) new B()).m() --> (new B()).inh_m()
740 * Phi((A)x, (A)y) --> (A) Phi (x, y) if (A) is an upcast.
742 * Computes type information if not available. @see irtypeinfo.h.
743 * Typeinformation is valid after optimization.
744 * Invalidates trout information.
746 void optimize_class_casts(void);
749 * CLiff Click's combo algorithm from
750 * "Combining Analyses, combining Optimizations".
752 * Does conditional constant propagation, unreachable code elimination and
753 * optimistic global value numbering at once.
755 * @param irg the graph to run on
757 void combo(ir_graph *irg);
760 * Creates an ir_graph pass for combo.
762 * @param name the name of this pass or NULL
764 * @return the newly created ir_graph pass
766 ir_graph_pass_t *combo_pass(const char *name);
769 * Inlines all small methods at call sites where the called address comes
770 * from a SymConst node that references the entity representing the called
773 * @param irg the graph
774 * @param size maximum function size
776 * The size argument is a rough measure for the code size of the method:
777 * Methods where the obstack containing the firm graph is smaller than
778 * size are inlined. Further only a limited number of calls are inlined.
779 * If the method contains more than 1024 inlineable calls none will be
781 * Inlining is only performed if flags `optimize' and `inlineing' are set.
782 * The graph may not be in state phase_building.
783 * It is recommended to call local_optimize_graph() after inlining as this
784 * function leaves a set of obscure Tuple nodes, e.g. a Proj-Tuple-Jmp
785 * combination as control flow operation.
787 void inline_small_irgs(ir_graph *irg, int size);
790 * Creates an ir_graph pass for inline_small_irgs().
792 * @param name the name of this pass or NULL
793 * @param size maximum function size
795 * @return the newly created ir_graph pass
797 ir_graph_pass_t *inline_small_irgs_pass(const char *name, int size);
800 * Inlineing with a different heuristic than inline_small_irgs().
802 * Inlines leave functions. If inlinening creates new leave
803 * function inlines these, too. (If g calls f, and f calls leave h,
804 * h is first inlined in f and then f in g.)
806 * Then inlines all small functions (this is not recursive).
808 * For a heuristic this inlineing uses firm node counts. It does
809 * not count auxiliary nodes as Proj, Tuple, End, Start, Id, Sync.
810 * If the ignore_runtime flag is set, calls to functions marked with the
811 * mtp_property_runtime property are ignored.
813 * @param maxsize Do not inline any calls if a method has more than
814 * maxsize firm nodes. It may reach this limit by
816 * @param leavesize Inline leave functions if they have less than leavesize
818 * @param size Inline all function smaller than size.
819 * @param ignore_runtime count a function only calling runtime functions as
822 void inline_leave_functions(unsigned maxsize, unsigned leavesize,
823 unsigned size, int ignore_runtime);
826 * Creates an ir_prog pass for inline_leave_functions().
828 * @param name the name of this pass or NULL
829 * @param maxsize Do not inline any calls if a method has more than
830 * maxsize firm nodes. It may reach this limit by
832 * @param leavesize Inline leave functions if they have less than leavesize
834 * @param size Inline all function smaller than size.
835 * @param ignore_runtime count a function only calling runtime functions as
838 * @return the newly created ir_prog pass
840 ir_prog_pass_t *inline_leave_functions_pass(
841 const char *name, unsigned maxsize, unsigned leavesize,
842 unsigned size, int ignore_runtime);
844 typedef void (*opt_ptr)(ir_graph *irg);
847 * Heuristic inliner. Calculates a benefice value for every call and inlines
848 * those calls with a value higher than the threshold.
850 * @param maxsize Do not inline any calls if a method has more than
851 * maxsize firm nodes. It may reach this limit by
853 * @param inline_threshold inlining threshold
854 * @param after_inline_opt optimizations performed immediately after inlining
857 void inline_functions(unsigned maxsize, int inline_threshold,
858 opt_ptr after_inline_opt);
861 * Creates an ir_prog pass for inline_functions().
863 * @param name the name of this pass or NULL
864 * @param maxsize Do not inline any calls if a method has more than
865 * maxsize firm nodes. It may reach this limit by
867 * @param inline_threshold inlining threshold
869 * @return the newly created ir_prog pass
871 ir_prog_pass_t *inline_functions_pass(
872 const char *name, unsigned maxsize, int inline_threshold,
873 opt_ptr after_inline_opt);
876 * Combines congruent blocks into one.
878 * @param irg The IR-graph to optimize.
880 * @return non-zero if the graph was transformed
882 int shape_blocks(ir_graph *irg);
885 * Creates an ir_graph pass for shape_blocks().
887 * @param name the name of this pass or NULL
889 * @return the newly created ir_graph pass
891 ir_graph_pass_t *shape_blocks_pass(const char *name);
894 * Perform loop inversion on a given graph.
895 * Loop inversion transform a head controlled loop (like while(...) {} and
896 * for(...) {}) into a foot controlled loop (do {} while(...)).
898 void do_loop_inversion(ir_graph *irg);
901 * Perform loop peeling on a given graph.
903 void do_loop_peeling(ir_graph *irg);
905 typedef ir_type *(*get_Alloc_func)(ir_node *n);
906 /** Set a new get_Alloc_func and returns the old one. */
907 get_Alloc_func firm_set_Alloc_func(get_Alloc_func newf);