X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=7e11ba32de324e62af9cf97babd48b2d3565a289;hb=b9d45e08e23bcf058fa8f2d9e18dd78e8cccd044;hp=c245e10b3f7787f58972fae108fce8be4d48ff1c;hpb=4794cb5f95f18ed6afee5c1cc33aaf5f39d3e4a2;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index c245e10b3..7e11ba32d 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -13,18 +13,53 @@ #ifndef _BECOPYOPT_H #define _BECOPYOPT_H +#include + #include "firm_types.h" #include "bechordal.h" +#ifdef WITH_LIBCORE +#include +extern void co_register_options(lc_opt_entry_t *grp); +#endif + +/** + * Flags for dumping the IFG. + */ +enum { + CO_IFG_DUMP_COLORS = 1, /**< Dump the graph colored. */ + CO_IFG_DUMP_LABELS = 2, /**< Dump node/edge labels. */ + CO_IFG_DUMP_SHAPE = 4, /**< Give constrained nodes special shapes. */ + CO_IFG_DUMP_CONSTR = 8 /**< Dump the node constraints in the label. */ +}; + +/** + * Algorithms. + */ +enum { + CO_ALGO_NONE, + CO_ALGO_HEUR, + CO_ALGO_HEUR2, + CO_ALGO_HEUR3, + CO_ALGO_ILP, + CO_ALGO_LAST +}; + +/** The driver for copy minimization. */ +void co_driver(be_chordal_env_t *cenv); + /** * Has to be called during the firm init phase */ void be_copy_opt_init(void); -typedef int(*cost_fct_t)(ir_node*, ir_node*, int); - typedef struct _copy_opt_t copy_opt_t; +typedef int(*cost_fct_t)(const copy_opt_t *, ir_node*, ir_node*, int); + +/** A coalescing algorithm. */ +typedef int (co_algo_t)(copy_opt_t *); + /** * Generate the problem. Collect all information and optimizable nodes. */ @@ -49,18 +84,47 @@ int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn); /** * Computes the costs of a copy according to loop depth - * @param pos: the argument position of arg in the root arguments + * @param co The copy opt object. + * @param pos the argument position of arg in the root arguments * @return Must be >= 0 in all cases. */ -int co_get_costs_loop_depth(ir_node *root, ir_node* arg, int pos); +int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); + +/** + * Computes the costs of a copy according to execution frequency + * @param co The copy opt object. + * @param pos the argument position of arg in the root arguments + * @return Must be >= 0 in all cases. + */ +int co_get_costs_exec_freq(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); /** * All costs equal 1. Using this will reduce the _number_ of copies. + * @param co The copy opt object. * @return Must be >= 0 in all cases. */ -int co_get_costs_all_one(ir_node *root, ir_node* arg, int pos); +int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); +/** + * Statistics over a copy optimization module. + */ +typedef struct { + ulong64 aff_edges; /**< number of affinity edges. */ + ulong64 aff_nodes; /**< number of nodes with incident affinity edges. */ + ulong64 aff_int; /**< number of affinity edges whose nodes also interfere. */ + ulong64 inevit_costs; /**< costs which cannot be evited (due to interfering affinities). */ + ulong64 max_costs; /**< all costs of the affinities. */ + ulong64 costs; /**< The costs of the current coloring. */ + ulong64 unsatisfied_edges; /**< The number of unequally colored affinity edges. */ +} co_complete_stats_t; +/** + * Collect statistics of a copy optimization module. + * @param co The copy optimization environment. + * @param stat Where to put the stats. + * @note This requires the graph info to be computed. + */ +void co_complete_stats(const copy_opt_t *co, co_complete_stats_t *stat); /** @@ -80,6 +144,25 @@ void co_free_ou_structure(copy_opt_t *co); */ int co_solve_heuristic(copy_opt_t *co); +/** + * Apply Park/Moon coalescing to the graph. + * @param co The copy optimization data structure. + */ +void co_solve_park_moon(copy_opt_t *co); + +/** + * Solves the copy minimization problem using another heuristic approach. + * Uses the OU and the GRAPH data structure. + */ +int co_solve_heuristic_new(copy_opt_t *co); + +/** + * Solves the copy minimization problem using another heuristic approach implemented in Java. + * This function needs a JVM which is started to call the Java module. + * Uses the GRAPH data structure. + */ +int co_solve_heuristic_java(copy_opt_t *co); + /** * Returns the maximal costs possible, i.e. the costs if all * pairs would be assigned different registers. @@ -110,9 +193,28 @@ int co_get_copy_costs(const copy_opt_t *co); */ int co_get_lower_bound(const copy_opt_t *co); +/** + * Dump the interference graph according to the Appel/George coalescing contest file format. + * See: http://www.cs.princeton.edu/~appel/coalesce/format.html + * @note Requires graph structure. + * @param co The copy opt object. + * @param f A file to dump to. + */ +void co_dump_appel_graph(const copy_opt_t *co, FILE *f); - - +/** + * Dumps the IFG of the program splitting after each instruction in the Appel format. + * @param co The copy opt object. + * @param f The file to dump to. + */ +void co_dump_appel_graph_cliques(const copy_opt_t *co, FILE *f); +/** + * Dump the interference graph with the affinity edges and the coloring. + * @param co The copy opt structure. + * @param f The file to dump to. + * @param flags The dump flags (see enum above). + */ +void co_dump_ifg_dot(const copy_opt_t *co, FILE *f, unsigned flags); /** * Constructs another internal representation of the affinity edges @@ -138,7 +240,7 @@ int co_solve_ilp1(copy_opt_t *co, double time_limit); * Uses the OU and the GRAPH data structure * Dependency of the OU structure can be removed */ -int co_solve_ilp2(copy_opt_t *co, double time_limit); +int co_solve_ilp2(copy_opt_t *co); /** * Checks if a node is optimizable, viz has something to do with coalescing.