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
21 * Author: Daniel Grund
23 * Copyright: (c) Universitaet Karlsruhe
24 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
26 * Main file for the optimization reducing the copies needed for:
28 * - Register-constrained nodes
29 * - Two-address code instructions
36 #include "firm_types.h"
37 #include "bechordal.h"
40 * Flags for dumping the IFG.
43 CO_IFG_DUMP_COLORS = 1, /**< Dump the graph colored. */
44 CO_IFG_DUMP_LABELS = 2, /**< Dump node/edge labels. */
45 CO_IFG_DUMP_SHAPE = 4, /**< Give constrained nodes special shapes. */
46 CO_IFG_DUMP_CONSTR = 8 /**< Dump the node constraints in the label. */
62 /** The driver for copy minimization. */
63 void co_driver(be_chordal_env_t *cenv);
65 typedef struct _copy_opt_t copy_opt_t;
67 typedef int(*cost_fct_t)(const copy_opt_t *, ir_node*, ir_node*, int);
69 /** A coalescing algorithm. */
70 typedef int (co_algo_t)(copy_opt_t *);
73 * Generate the problem. Collect all information and optimizable nodes.
75 copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs);
78 * Free the space used...
80 void free_copy_opt(copy_opt_t *co);
83 * Checks if a node is optimizable, viz. has something to do with coalescing
84 * @param arch The architecture environment
85 * @param irn The irn to check
87 int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn);
90 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
92 int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
95 * Computes the costs of a copy according to loop depth
96 * @param co The copy opt object.
97 * @param pos the argument position of arg in the root arguments
98 * @return Must be >= 0 in all cases.
100 int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
103 * Computes the costs of a copy according to execution frequency
104 * @param co The copy opt object.
105 * @param pos the argument position of arg in the root arguments
106 * @return Must be >= 0 in all cases.
108 int co_get_costs_exec_freq(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
111 * All costs equal 1. Using this will reduce the _number_ of copies.
112 * @param co The copy opt object.
113 * @return Must be >= 0 in all cases.
115 int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
118 * Statistics over a copy optimization module.
121 ulong64 aff_edges; /**< number of affinity edges. */
122 ulong64 aff_nodes; /**< number of nodes with incident affinity edges. */
123 ulong64 aff_int; /**< number of affinity edges whose nodes also interfere. */
124 ulong64 inevit_costs; /**< costs which cannot be evited (due to interfering affinities). */
125 ulong64 max_costs; /**< all costs of the affinities. */
126 ulong64 costs; /**< The costs of the current coloring. */
127 ulong64 unsatisfied_edges; /**< The number of unequally colored affinity edges. */
128 } co_complete_stats_t;
131 * Collect statistics of a copy optimization module.
132 * @param co The copy optimization environment.
133 * @param stat Where to put the stats.
134 * @note This requires the graph info to be computed.
136 void co_complete_stats(const copy_opt_t *co, co_complete_stats_t *stat);
140 * Build internal optimization units structure
142 void co_build_ou_structure(copy_opt_t *co);
145 * Frees the space used by the opt unit representation.
146 * Does NOT free the whole copyopt structure
148 void co_free_ou_structure(copy_opt_t *co);
151 * Solves the problem using a heuristic approach
152 * Uses the OU data structure
154 int co_solve_heuristic(copy_opt_t *co);
157 * Apply Park/Moon coalescing to the graph.
158 * @param co The copy optimization data structure.
160 void co_solve_park_moon(copy_opt_t *co);
163 * Solves the copy minimization problem using another heuristic approach.
164 * Uses the OU and the GRAPH data structure.
166 int co_solve_heuristic_new(copy_opt_t *co);
169 * Solves the copy minimization problem using another heuristic approach implemented in Java.
170 * This function needs a JVM which is started to call the Java module.
171 * Uses the GRAPH data structure.
173 int co_solve_heuristic_java(copy_opt_t *co);
176 * This is the pure C implementation of co_solve_heuristic_java().
178 int co_solve_heuristic_mst(copy_opt_t *co);
181 * Returns the maximal costs possible, i.e. the costs if all
182 * pairs would be assigned different registers.
183 * Uses the OU data structure
185 int co_get_max_copy_costs(const copy_opt_t *co);
188 * Returns the inevitable costs, i.e. the costs of
189 * all copy pairs which interfere.
190 * Uses the OU data structure
192 int co_get_inevit_copy_costs(const copy_opt_t *co);
195 * Returns the current costs the copies are causing.
196 * The result includes inevitable costs and the costs
197 * of the copies regarding the current register allocation
198 * Uses the OU data structure
200 int co_get_copy_costs(const copy_opt_t *co);
203 * Returns a lower bound for the costs of copies in this ou.
204 * The result includes inevitable costs and the costs of a
205 * minimal costs caused by the nodes of the ou.
206 * Uses the OU data structure
208 int co_get_lower_bound(const copy_opt_t *co);
211 * Dump the interference graph according to the Appel/George coalescing contest file format.
212 * See: http://www.cs.princeton.edu/~appel/coalesce/format.html
213 * @note Requires graph structure.
214 * @param co The copy opt object.
215 * @param f A file to dump to.
217 void co_dump_appel_graph(const copy_opt_t *co, FILE *f);
220 * Dumps the IFG of the program splitting after each instruction in the Appel format.
221 * @param co The copy opt object.
222 * @param f The file to dump to.
224 void co_dump_appel_graph_cliques(const copy_opt_t *co, FILE *f);
226 * Dump the interference graph with the affinity edges and the coloring.
227 * @param co The copy opt structure.
228 * @param f The file to dump to.
229 * @param flags The dump flags (see enum above).
231 void co_dump_ifg_dot(const copy_opt_t *co, FILE *f, unsigned flags);
234 * Constructs another internal representation of the affinity edges
236 void co_build_graph_structure(copy_opt_t *co);
239 * Frees the space used by the graph representation.
240 * Does NOT free the whole copyopt structure
242 void co_free_graph_structure(copy_opt_t *co);
245 * Solves the problem using mixed integer programming
246 * @returns 1 iff solution state was optimal
249 int co_solve_ilp1(copy_opt_t *co, double time_limit);
252 * Solves the problem using mixed integer programming
253 * @returns 1 iff solution state was optimal
254 * Uses the OU and the GRAPH data structure
255 * Dependency of the OU structure can be removed
257 int co_solve_ilp2(copy_opt_t *co);
260 * Checks if a node is optimizable, viz has something to do with coalescing.
261 * Uses the GRAPH data structure
263 int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
265 #endif /* _BECOPYOPT_H */