X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=38a0298d5dc46a5706e80e7e93fa577a53e5a7df;hb=f804d333c7b5459c3c1a6bfc188ecdc54346be73;hp=e68717102de8fc13e2fb0b768baf14573e4c133d;hpb=bc6aa15e71b0fe97accfbe566c027049828ea513;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index e68717102..38a0298d5 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -7,10 +7,6 @@ * Header for copy optimization problem. Analysis and set up of the problem. */ -/* - * TODO: get_nodes_block(get_irn_n(get_nodes_block(phi), i)); --> get_ifgblock_nodeblock - */ - #ifndef _BECOPYOPT_H #define _BECOPYOPT_H @@ -20,7 +16,6 @@ #include "set.h" #include "pset.h" #include "bitset.h" -#include "sp_matrix.h" #include "irgraph.h" #include "irgwalk.h" @@ -34,10 +29,7 @@ #include "bechordal_t.h" #include "bearch.h" -#define DEBUG_IRG "NONE spec.c__main__datab" -#define DEBUG_LVL_CO LEVEL_1 -#define DEBUG_LVL_HEUR LEVEL_1 -#define DEBUG_LVL_ILP LEVEL_1 +#define MIS_HEUR_TRIGGER 8 typedef int(*cost_fct_t)(ir_node*, ir_node*, int); @@ -47,8 +39,7 @@ typedef int(*cost_fct_t)(ir_node*, ir_node*, int); 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 right order */ - pset *roots; /**< used only temporary for detecting multiple appends */ + 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; @@ -62,25 +53,32 @@ typedef struct _unit_t { 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 complete_costs; /**< sum of all costs[i] */ - int minimal_costs; /**< a lower bound for this ou, considering only ifg (not coloring conflicts) */ - - //TODO Think of the ordering. - int avg_costs; /**< average costs. controls the order of ou's. */ + 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 (mis/color) sorted by size of mis */ + 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(co->chordal_env->arch_env, irn, 0, arch_register_for_index(co->chordal_env->cls, col)) + arch_set_irn_register(get_arch_env(co), irn, arch_register_for_index(co->chordal_env->cls, col)) -#define get_irn_col(co, irn) \ - arch_register_get_index(arch_get_irn_register(co->chordal_env->arch_env, irn, 0)) #define list_entry_units(lh) list_entry(lh, unit_t, units) +#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) + /** * Generate the problem. Collect all infos and optimizable nodes. @@ -92,23 +90,13 @@ copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, int (*get_costs)(ir_node */ void free_copy_opt(copy_opt_t *co); - -#define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm) - -/** - * A copy is a proj haning out of perm node - */ -#define is_Copy(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn))) - -/** - * returns the corresponding argument of the perm node for a copy - */ -#define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn))) - /** - * Checks if a node is optimizable, viz. is a target of a 'copy-op' + * Checks if a node is optimizable, viz. has somthing 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_env, irn) (is_Phi(irn) || is_Copy(arch_env, irn)) +#define is_optimizable(arch, irn, req) (is_Reg_Phi(irn) || is_Perm_Proj(arch, irn) || is_2addr_code(arch, irn, req)) /** * Checks if the irn is a non-interfering argument of a node which 'is_optimizable' @@ -117,9 +105,7 @@ int is_optimizable_arg(const copy_opt_t *co, ir_node *irn); /** * Computes the costs of a copy according to loop depth - * @param root, arg: clear. - * @param pos: -1 for perm-copies. - * Else the argument position of arg in the phi node root. + * @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); @@ -131,13 +117,28 @@ int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos); int get_costs_all_one(ir_node *root, ir_node* arg, int pos); /** - * Returns the current costs the copies are causing + * Returns the maximal costs possible, i.e. the costs if all + * pairs would be assigned different registers. + */ +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. + */ +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 */ int co_get_copy_costs(const copy_opt_t *co); /** - * Returns a lower bound for the costs of copies based on interfering - * arguments and the size of a max indep. set (only ifg-edges) of the other args. + * 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. */ int co_get_lower_bound(const copy_opt_t *co); @@ -148,7 +149,8 @@ void co_heur_opt(copy_opt_t *co); /** * Solves the problem using mixed integer programming + * @returns 1 iff solution state was optimal */ -void co_ilp_opt(copy_opt_t *co); +int co_ilp_opt(copy_opt_t *co, double time_limit); #endif