2 * Copyright (C) 1995-2007 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 Copy minimization driver.
23 * @author Daniel Grund
27 * Main file for the optimization reducing the copies needed for:
29 * - Register-constrained nodes
30 * - Two-address code instructions
32 #ifndef FIRM_BE_BECOPYOPT_H
33 #define FIRM_BE_BECOPYOPT_H
37 #include "firm_types.h"
38 #include "bechordal.h"
41 * Flags for dumping the IFG.
44 CO_IFG_DUMP_COLORS = 1, /**< Dump the graph colored. */
45 CO_IFG_DUMP_LABELS = 2, /**< Dump node/edge labels. */
46 CO_IFG_DUMP_SHAPE = 4, /**< Give constrained nodes special shapes. */
47 CO_IFG_DUMP_CONSTR = 8 /**< Dump the node constraints in the label. */
63 /** The driver for copy minimization. */
64 void co_driver(be_chordal_env_t *cenv);
66 typedef struct _copy_opt_t copy_opt_t;
68 typedef int(*cost_fct_t)(const copy_opt_t *, ir_node *, ir_node *, int);
70 /** A coalescing algorithm. */
71 typedef int (co_algo_t)(copy_opt_t *);
74 * Generate the problem. Collect all information and optimizable nodes.
76 copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs);
79 * Free the space used...
81 void free_copy_opt(copy_opt_t *co);
84 * Checks if a node is optimizable, viz. has something to do with coalescing
85 * @param arch The architecture environment
86 * @param irn The irn to check
88 int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn);
91 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
93 int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
96 * Computes the costs of a copy according to loop depth
97 * @param co The copy opt object.
98 * @param pos the argument position of arg in the root arguments
99 * @return Must be >= 0 in all cases.
101 int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
104 * Computes the costs of a copy according to execution frequency
105 * @param co The copy opt object.
106 * @param pos the argument position of arg in the root arguments
107 * @return Must be >= 0 in all cases.
109 int co_get_costs_exec_freq(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
112 * All costs equal 1. Using this will reduce the _number_ of copies.
113 * @param co The copy opt object.
114 * @return Must be >= 0 in all cases.
116 int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
119 * Statistics over a copy optimization module.
122 ulong64 aff_edges; /**< number of affinity edges. */
123 ulong64 aff_nodes; /**< number of nodes with incident affinity edges. */
124 ulong64 aff_int; /**< number of affinity edges whose nodes also interfere. */
125 ulong64 inevit_costs; /**< costs which cannot be evited (due to interfering affinities). */
126 ulong64 max_costs; /**< all costs of the affinities. */
127 ulong64 costs; /**< The costs of the current coloring. */
128 ulong64 unsatisfied_edges; /**< The number of unequally colored affinity edges. */
129 } co_complete_stats_t;
132 * Collect statistics of a copy optimization module.
133 * @param co The copy optimization environment.
134 * @param stat Where to put the stats.
135 * @note This requires the graph info to be computed.
137 void co_complete_stats(const copy_opt_t *co, co_complete_stats_t *stat);
141 * Build internal optimization units structure
143 void co_build_ou_structure(copy_opt_t *co);
146 * Frees the space used by the opt unit representation.
147 * Does NOT free the whole copyopt structure
149 void co_free_ou_structure(copy_opt_t *co);
152 * Solves the problem using a heuristic approach
153 * Uses the OU data structure
155 int co_solve_heuristic(copy_opt_t *co);
158 * Apply Park/Moon coalescing to the graph.
159 * @param co The copy optimization data structure.
161 void co_solve_park_moon(copy_opt_t *co);
164 * Solves the copy minimization problem using another heuristic approach.
165 * Uses the OU and the GRAPH data structure.
167 int co_solve_heuristic_new(copy_opt_t *co);
170 * Solves the copy minimization problem using another heuristic approach implemented in Java.
171 * This function needs a JVM which is started to call the Java module.
172 * Uses the GRAPH data structure.
174 int co_solve_heuristic_java(copy_opt_t *co);
177 * This is the pure C implementation of co_solve_heuristic_java().
179 int co_solve_heuristic_mst(copy_opt_t *co);
182 * Returns the maximal costs possible, i.e. the costs if all
183 * pairs would be assigned different registers.
184 * Uses the OU data structure
186 int co_get_max_copy_costs(const copy_opt_t *co);
189 * Returns the inevitable costs, i.e. the costs of
190 * all copy pairs which interfere.
191 * Uses the OU data structure
193 int co_get_inevit_copy_costs(const copy_opt_t *co);
196 * Returns the current costs the copies are causing.
197 * The result includes inevitable costs and the costs
198 * of the copies regarding the current register allocation
199 * Uses the OU data structure
201 int co_get_copy_costs(const copy_opt_t *co);
204 * Returns a lower bound for the costs of copies in this ou.
205 * The result includes inevitable costs and the costs of a
206 * minimal costs caused by the nodes of the ou.
207 * Uses the OU data structure
209 int co_get_lower_bound(const copy_opt_t *co);
212 * Dump the interference graph according to the Appel/George coalescing contest file format.
213 * See: http://www.cs.princeton.edu/~appel/coalesce/format.html
214 * @note Requires graph structure.
215 * @param co The copy opt object.
216 * @param f A file to dump to.
218 void co_dump_appel_graph(const copy_opt_t *co, FILE *f);
221 * Dumps the IFG of the program splitting after each instruction in the Appel format.
222 * @param co The copy opt object.
223 * @param f The file to dump to.
225 void co_dump_appel_graph_cliques(const copy_opt_t *co, FILE *f);
227 * Dump the interference graph with the affinity edges and the coloring.
228 * @param co The copy opt structure.
229 * @param f The file to dump to.
230 * @param flags The dump flags (see enum above).
232 void co_dump_ifg_dot(const copy_opt_t *co, FILE *f, unsigned flags);
235 * Constructs another internal representation of the affinity edges
237 void co_build_graph_structure(copy_opt_t *co);
240 * Frees the space used by the graph representation.
241 * Does NOT free the whole copyopt structure
243 void co_free_graph_structure(copy_opt_t *co);
246 * Solves the problem using mixed integer programming
247 * @returns 1 iff solution state was optimal
250 int co_solve_ilp1(copy_opt_t *co, double time_limit);
253 * Solves the problem using mixed integer programming
254 * @returns 1 iff solution state was optimal
255 * Uses the OU and the GRAPH data structure
256 * Dependency of the OU structure can be removed
258 int co_solve_ilp2(copy_opt_t *co);
261 * Checks if a node is optimizable, viz has something to do with coalescing.
262 * Uses the GRAPH data structure
264 int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
266 #endif /* FIRM_BE_BECOPYOPT_H */