X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=67175e298264ee9b7cee7cd2a08d0280eebfca13;hb=81191be9419f49c1338f460dd7cd180197aa46d5;hp=515d3b75ec239baee29a59cf30b729e22bab8ec1;hpb=4ed766ac193746b7e38316f88bc16863a4d03af4;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index 515d3b75e..67175e298 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -22,7 +22,6 @@ * @brief Copy minimization driver. * @author Daniel Grund * @date 11.04.2005 - * @version $Id$ * * Main file for the optimization reducing the copies needed for: * - Phi coalescing @@ -32,47 +31,18 @@ #ifndef FIRM_BE_BECOPYOPT_H #define FIRM_BE_BECOPYOPT_H -#include +#include #include "firm_types.h" #include "bechordal.h" -#include "beutil.h" -/** - * 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_HEUR4, - CO_ALGO_ILP, -#ifdef FIRM_KAPS - CO_ALGO_PBQP, -#endif - CO_ALGO_LAST -}; - -typedef struct copy_opt_t copy_opt_t; - -typedef int(*cost_fct_t)(const copy_opt_t *, ir_node *, ir_node *, int); +typedef int(*cost_fct_t)(const ir_node *node, int input); typedef struct { int (*copyopt)(copy_opt_t *co); /**< function ptr to run copyopt */ - int can_improve_existing; + bool can_improve_existing; } co_algo_info; - /** * Register a new copy optimization algorithm. * @@ -85,9 +55,6 @@ void be_register_copyopt(const char *name, co_algo_info *copyopt); /** The driver for copy minimization. */ void co_driver(be_chordal_env_t *cenv); -/** A coalescing algorithm. */ -typedef int (co_algo_t)(copy_opt_t *); - /** * Generate the problem. Collect all information and optimizable nodes. */ @@ -98,56 +65,17 @@ copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs); */ void free_copy_opt(copy_opt_t *co); -/** - * Computes the costs of a copy according to loop depth - * @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(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(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); - -#ifdef _MSC_VER -typedef __int64 long64; -typedef unsigned __int64 ulong64; - -#define LL_FMT "i64" -#define ULL_FMT "ui64" - -#else -typedef long long long64; -typedef unsigned long long ulong64; - -#define LL_FMT "ll" -#define ULL_FMT "llu" - -#endif - /** * 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. */ + unsigned long long aff_edges; /**< number of affinity edges. */ + unsigned long long aff_nodes; /**< number of nodes with incident affinity edges. */ + unsigned long long aff_int; /**< number of affinity edges whose nodes also interfere. */ + unsigned long long inevit_costs; /**< costs which cannot be evited (due to interfering affinities). */ + unsigned long long max_costs; /**< all costs of the affinities. */ + unsigned long long costs; /**< The costs of the current coloring. */ + unsigned long long unsatisfied_edges; /**< The number of unequally colored affinity edges. */ } co_complete_stats_t; /** @@ -176,18 +104,6 @@ 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); - /** * Returns the maximal costs possible, i.e. the costs if all * pairs would be assigned different registers. @@ -218,29 +134,6 @@ 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 */ @@ -252,14 +145,6 @@ void co_build_graph_structure(copy_opt_t *co); */ void co_free_graph_structure(copy_opt_t *co); -/** - * Solves the problem using mixed integer programming - * @returns 1 iff solution state was optimal - * Uses the OU and the GRAPH data structure - * Dependency of the OU structure can be removed - */ -int co_solve_ilp2(copy_opt_t *co); - /** * Checks if a node is optimizable, viz has something to do with coalescing. * Uses the GRAPH data structure