X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=23b497fc90143d22ae0f31c88449866dea8777f0;hb=ff9b23893ba556b55fb18b0203a804179a4ea5d4;hp=38a0298d5dc46a5706e80e7e93fa577a53e5a7df;hpb=e4766594e9640777c92da56f37dbdce7b41385a0;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index 38a0298d5..23b497fc9 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -1,130 +1,160 @@ /** * Author: Daniel Grund - * Date: 12.04.2005 + * Date: 11.04.2005 * Copyright: (c) Universitaet Karlsruhe * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. * - * Header for copy optimization problem. Analysis and set up of the problem. + * 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 -#include "debug.h" -#include "obst.h" -#include "list.h" -#include "set.h" -#include "pset.h" -#include "bitset.h" +#include -#include "irgraph.h" -#include "irgwalk.h" -#include "irnode.h" -#include "irdom.h" -#include "irouts.h" +#include "firm_types.h" +#include "bechordal.h" -#include "beutil.h" -#include "benumb_t.h" -#include "belive_t.h" -#include "bechordal_t.h" -#include "bearch.h" - -#define MIS_HEUR_TRIGGER 8 - -typedef int(*cost_fct_t)(ir_node*, ir_node*, int); +#ifdef WITH_LIBCORE +#include +extern void co_register_options(lc_opt_entry_t *grp); +#endif /** - * Data representing the problem of copy minimization. + * Flags for dumping the IFG. */ -typedef struct _copy_opt_t { - be_chordal_env_t *chordal_env; - char *name; /**< ProgName__IrgName__RegClass */ - struct list_head units; /**< all units to optimize in specific order */ - cost_fct_t get_costs; /**< function ptr used to get costs for copies */ - struct obstack ob; -} copy_opt_t; +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. */ +}; /** - * A single unit of optimization. Lots of these form a copy-opt problem + * Algorithms. */ -typedef struct _unit_t { - struct list_head units; /**< chain for all units */ - copy_opt_t *co; /**< the copy_opt this unit belongs to */ - int node_count; /**< size of the nodes array */ - ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */ - int *costs; /**< costs[i] are arising, if nodes[i] has a different color */ - int inevitable_costs; /**< sum of costs of all args interfering with root */ - int all_nodes_costs; /**< sum of all costs[i] */ - int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max indep. set */ - int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */ - - /* for heuristic */ - struct list_head queue; /**< list of qn's sorted by weight of qn-mis */ -} unit_t; - -/* Helpers */ -#define get_arch_env(co) ((co)->chordal_env->main_env->arch_env) -#define get_irg(co) ((co)->chordal_env->irg) -#define get_irn_col(co, irn) \ - arch_register_get_index(arch_get_irn_register(get_arch_env(co), irn)) -#define set_irn_col(co, irn, col) \ - arch_set_irn_register(get_arch_env(co), irn, arch_register_for_index(co->chordal_env->cls, col)) +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); -#define list_entry_units(lh) list_entry(lh, unit_t, units) +typedef struct _copy_opt_t copy_opt_t; -#define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn))) -#define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm) -#define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn))) -#define is_Perm_Proj(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn))) -#define is_2addr_code(arch_env, irn, req) (arch_get_register_req(arch_env, req, irn, -1)->type == arch_register_req_type_should_be_same) +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 infos and optimizable nodes. + * Generate the problem. Collect all information and optimizable nodes. */ -copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, int (*get_costs)(ir_node*, ir_node*, int)); +copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs); /** - * Free the space... + * Free the space used... */ void free_copy_opt(copy_opt_t *co); /** - * Checks if a node is optimizable, viz. has somthing to do with coalescing + * Checks if a node is optimizable, viz. has something to do with coalescing * @param arch The architecture environment * @param irn The irn to check - * @param req A register_requirement structure (used to check for 2-addr-code) */ -#define is_optimizable(arch, irn, req) (is_Reg_Phi(irn) || is_Perm_Proj(arch, irn) || is_2addr_code(arch, irn, req)) +int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn); /** * Checks if the irn is a non-interfering argument of a node which 'is_optimizable' */ -int is_optimizable_arg(const copy_opt_t *co, ir_node *irn); +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 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); /** - * All costs equal 1. Using this will reduce the number of copies. + * 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 get_costs_all_one(ir_node *root, ir_node* arg, int pos); +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); + + + + +/** + * 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_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); @@ -132,6 +162,7 @@ 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); @@ -139,18 +170,63 @@ 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); /** - * Solves the problem using a heuristic approach + * 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_heur_opt(copy_opt_t *co); +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 */ -int co_ilp_opt(copy_opt_t *co, double time_limit); +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 */