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
26 #ifndef FIRM_IR_IRGOPT_H
27 #define FIRM_IR_IRGOPT_H
29 #include "firm_types.h"
31 /** Applies local optimizations (see iropt.h) to all nodes reachable from node n.
33 * @param n The node to be optimized.
35 void local_optimize_node(ir_node *n);
37 /** Applies local optimizations (see iropt.h) to all nodes in the graph.
39 * @param irg The graph to be optimized.
41 * After applying local_optimize_graph() to a IR-graph, Bad nodes
42 * only occur as predecessor of Block and Phi nodes.
44 void local_optimize_graph(ir_graph *irg);
46 /** Applies local optimizations (see iropt.h) to all nodes in the graph.
48 * After applying optimize_graph_df() to a IR-graph, Bad nodes
49 * only occur as predecessor of Block and Phi nodes.
51 * This version uses fixpoint iteration.
53 * @param irg The graph to be optimized.
55 * @return non-zero if the optimization could be applied, 0 else
57 int optimize_graph_df(ir_graph *irg);
60 * Creates an ir_graph pass for optimize_graph_df().
62 * @param name the name of this pass or NULL
64 * @return the newly created ir_graph pass
66 ir_graph_pass_t *optimize_graph_df_pass(const char *name);
68 /** Places an empty basic block on critical control flow edges thereby
71 * A critical control flow edge is an edge from a block with several
72 * control exits to a block with several control entries (See Muchnic
73 * p. 407). Exception edges are always ignored.
77 void remove_critical_cf_edges(ir_graph *irg);
79 /** Places an empty basic block on critical control flow edges thereby
82 * A critical control flow edge is an edge from a block with several
83 * control exits to a block with several control entries (See Muchnic
87 * @param ignore_exception_edges if non-zero, exception edges will be ignored
89 void remove_critical_cf_edges_ex(ir_graph *irg, int ignore_exception_edges);