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 Optimizations for a whole ir graph, i.e., a procedure.
23 * @author Christian Schaefer, Goetz Lindenmaier, Sebastian Felis
25 #ifndef FIRM_IR_IRGOPT_H
26 #define FIRM_IR_IRGOPT_H
28 #include "firm_types.h"
33 * @defgroup irgopt Graph Transformations
37 /** Applies local optimizations (see iropt.h) to all nodes reachable from node
40 * @param n The node to be optimized.
42 FIRM_API void local_optimize_node(ir_node *n);
44 /** Applies local optimizations (see iropt.h) to all nodes in the graph.
46 * @param irg The graph to be optimized.
48 * After applying local_optimize_graph() to a IR-graph, Bad nodes
49 * only occur as predecessor of Block and Phi nodes.
51 FIRM_API void local_optimize_graph(ir_graph *irg);
53 /** Applies local optimizations (see iropt.h) to all nodes in the graph.
55 * After applying optimize_graph_df() to a IR-graph, Bad nodes
56 * only occur as predecessor of Block and Phi nodes.
58 * This version uses fixpoint iteration.
60 * @param irg The graph to be optimized.
62 * @return non-zero if the optimization could be applied, 0 else
64 FIRM_API void local_opts(ir_graph *irg);
67 * Perform local optimizations on nodes on const code irg
69 FIRM_API void local_opts_const_code(void);
71 /** Same functionality as local_opts above, but without framework wrapper
74 FIRM_API int optimize_graph_df(ir_graph *irg);
77 * Eliminates (obviously) unreachable code
79 FIRM_API void remove_unreachable_code(ir_graph *irg);
82 * Removes all Bad nodes from a graph.
84 * @param irg The graph to be optimized.
86 FIRM_API void remove_bads(ir_graph *irg);
89 * Removes all Tuple nodes from a graph.
91 * @param irg The graph to be optimized.
93 FIRM_API void remove_tuples(ir_graph *irg);
96 * Creates an ir_graph pass for optimize_graph_df().
98 * @param name the name of this pass or NULL
100 * @return the newly created ir_graph pass
102 FIRM_API ir_graph_pass_t *optimize_graph_df_pass(const char *name);
104 /** Places an empty basic block on critical control flow edges thereby
107 * A critical control flow edge is an edge from a block with several
108 * control exits to a block with several control entries (See Muchnic
109 * p. 407). Exception edges are always ignored.
111 * @param irg IR Graph
113 FIRM_API void remove_critical_cf_edges(ir_graph *irg);
115 /** Places an empty basic block on critical control flow edges thereby
118 * A critical control flow edge is an edge from a block with several
119 * control exits to a block with several control entries (See Muchnic
122 * @param irg IR Graph
123 * @param ignore_exception_edges if non-zero, exception edges will be ignored
125 FIRM_API void remove_critical_cf_edges_ex(ir_graph *irg,
126 int ignore_exception_edges);