X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=23b497fc90143d22ae0f31c88449866dea8777f0;hb=ff9b23893ba556b55fb18b0203a804179a4ea5d4;hp=4b9401bf15d0804e8477728f129a9ba3d7699d8c;hpb=c84cfae34532910cb95a7da3ed4c949fe0b7d6a4;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index 4b9401bf1..23b497fc9 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -1,107 +1,232 @@ /** - * Header for copy optimization problem. Analysis and set up of the problem. - * @author Daniel Grund - * @date 12.04.2005 + * Author: Daniel Grund + * Date: 11.04.2005 + * Copyright: (c) Universitaet Karlsruhe + * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * + * Main file for the optimization reducing the copies needed for: + * - Phi coalescing + * - Register-constrained nodes + * - Two-address code instructions */ #ifndef _BECOPYOPT_H #define _BECOPYOPT_H -#ifdef HAVE_CONFIG_H -#include "config.h" -#endif - -#include #include -#include -#include -#include -#include "debug.h" -#include "obst.h" -#include "list.h" -#include "set.h" -#include "pset.h" -#include "bitset.h" -#include "sp_matrix.h" +#include "firm_types.h" +#include "bechordal.h" -#include "irgraph.h" -#include "irgwalk.h" -#include "irnode.h" -#include "irdom.h" -#include "irouts.h" +#ifdef WITH_LIBCORE +#include +extern void co_register_options(lc_opt_entry_t *grp); +#endif -#include "benumb_t.h" -#include "belive_t.h" -#include "bera_t.h" -#include "bechordal_t.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. */ +}; /** - * TODO THIS EXTERNAL THINGS - * define get_weight to sth representing the _gain_ if node n and m - * have the same color. Must return values MIN_WEIGHT <= . <= MAX_WEIGHT. + * Algorithms. */ -#define get_weight(n,m) 1 -#define is_possible_color(irn, col) 1 -#define MAX_COLORS 32 +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); /** - * A single unit of optimization. Lots of these form a copy-opt problem + * Has to be called during the firm init phase */ -typedef struct _unit_t { - struct list_head units; /**< chain for all units */ - int interf; /**< number of nodes dropped due to interference */ - int node_count; /**< size of the nodes array */ - const ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */ +void be_copy_opt_init(void); - /* for heuristic */ - int mis_size; /**< size of a mis considering only ifg (not coloring conflicts) */ - struct list_head queue; /**< list of (mis/color) sorted by size of mis */ -} unit_t; +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 *); /** - * Data representing the problem of copy minimization. + * Generate the problem. Collect all information and optimizable nodes. */ -typedef struct _copy_opt_t { - ir_graph *irg; /**< the irg which is processed */ - struct list_head units; /**< all units to optimize in right oreder */ - pset *roots; /**< used only temporary for detecting multiple appends */ +copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs); - /* for heuristic */ - pset *pinned_global; /**< optimized nodes should not be altered any more */ -} copy_opt_t; +/** + * Free the space used... + */ +void free_copy_opt(copy_opt_t *co); +/** + * Checks if a node is optimizable, viz. has something to do with coalescing + * @param arch The architecture environment + * @param irn The irn to check + */ +int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn); /** - * Generate the problem. Collect all infos and optimizable nodes. + * Checks if the irn is a non-interfering argument of a node which 'is_optimizable' */ -copy_opt_t *new_copy_opt(ir_graph *irg); +int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn); /** - * Free the space... + * 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. */ -void free_copy_opt(copy_opt_t *co); +int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); /** - * Returns a lower bound for the number of copies needed based on interfering - * arguments and the size of a max indep. set (only ifg-edges) of the other args. + * 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_lower_bound(copy_opt_t *co); +int co_get_costs_exec_freq(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); /** - * Returns the number of arguments interfering with their root node. This also - * is a (worse) lower bound for the number of copies needed. + * 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_interferer_count(copy_opt_t *co); +int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); + + + + +/** + * Build internal optimization units structure + */ +void co_build_ou_structure(copy_opt_t *co); + +/** + * Frees the space used by the opt unit representation. + * Does NOT free the whole copyopt structure + */ +void co_free_ou_structure(copy_opt_t *co); /** * Solves the problem using a heuristic approach + * Uses the OU data structure + */ +int co_solve_heuristic(copy_opt_t *co); + +/** + * Apply Park/Moon coalescing to the graph. + * @param co The copy optimization data structure. */ -void co_heur_opt(copy_opt_t *co); +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. + * Uses the OU data structure + */ +int co_get_max_copy_costs(const copy_opt_t *co); + +/** + * Returns the inevitable costs, i.e. the costs of + * all copy pairs which interfere. + * Uses the OU data structure + */ +int co_get_inevit_copy_costs(const copy_opt_t *co); + +/** + * Returns the current costs the copies are causing. + * The result includes inevitable costs and the costs + * of the copies regarding the current register allocation + * Uses the OU data structure + */ +int co_get_copy_costs(const copy_opt_t *co); + +/** + * Returns a lower bound for the costs of copies in this ou. + * The result includes inevitable costs and the costs of a + * minimal costs caused by the nodes of the ou. + * Uses the OU data structure + */ +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 + */ +void co_build_graph_structure(copy_opt_t *co); + +/** + * Frees the space used by the graph representation. + * Does NOT free the whole copyopt structure + */ +void co_free_graph_structure(copy_opt_t *co); /** * Solves the problem using mixed integer programming + * @returns 1 iff solution state was optimal + * NYI */ -void co_ilp_opt(copy_opt_t *co); +int co_solve_ilp1(copy_opt_t *co, double time_limit); -#endif +/** + * 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 + */ +int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn); + +#endif /* _BECOPYOPT_H */