X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt_t.h;h=31068c81c6bc3f00d2e7ad30540d22882b20f336;hb=fef8dc3eff6468d7d65485af8e1ac9884c504e1a;hp=6c5943f77ea14705038e0730c33d244d9109fccd;hpb=c2fcdf7cddd0c74d5b6562e7ddce316f1695d800;p=libfirm diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h index 6c5943f77..31068c81c 100644 --- a/ir/be/becopyopt_t.h +++ b/ir/be/becopyopt_t.h @@ -22,7 +22,6 @@ * @brief Internal header for copy optimization problem. * @author Daniel Grund * @date 12.04.2005 - * @version $Id$ */ #ifndef FIRM_BE_BECOPYOPT_T_H #define FIRM_BE_BECOPYOPT_T_H @@ -32,23 +31,22 @@ #include "set.h" #include "irnode_t.h" -#include "bearch_t.h" +#include "bearch.h" #include "bechordal_t.h" #include "becopyopt.h" /** * Data representing the problem of copy minimization. */ -struct _copy_opt_t { +struct copy_opt_t { be_chordal_env_t *cenv; const arch_register_class_t *cls; - const arch_env_t *aenv; ir_graph *irg; char *name; /**< ProgName__IrgName__RegClassName */ cost_fct_t get_costs; /**< function ptr used to get costs for copies */ /** Representation as optimization units */ - struct list_head units; /**< all units to optimize in specific order */ + struct list_head units; /**< all units to optimize in specific order */ /** Representation in graph structure. Only build on demand */ struct obstack obst; @@ -56,25 +54,27 @@ struct _copy_opt_t { }; /* Helpers */ -#define ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not build") -#define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not build") +#define ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not build") +#define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not build") -#define get_irn_col(co, irn) arch_register_get_index(arch_get_irn_register((co)->aenv, irn)) -#define set_irn_col(co, irn, col) arch_set_irn_register((co)->aenv, irn, arch_register_for_index((co)->cls, col)) -#define is_curr_reg_class(co, irn) (arch_get_irn_reg_class(irn, -1) == (co)->cls) +static inline unsigned get_irn_col(const ir_node *node) +{ + return arch_get_irn_register(node)->index; +} + +static inline void set_irn_col(const arch_register_class_t *cls, ir_node *node, + unsigned color) +{ + const arch_register_t *reg = arch_register_for_index(cls, color); + arch_set_irn_register(node, reg); +} #define list_entry_units(lh) list_entry(lh, unit_t, units) -#define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn))) +#define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn))) -#define get_Perm_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_Perm_Proj(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn))) - -static INLINE int is_2addr_code(const arch_register_req_t *req) -{ - return (req->type & arch_register_req_type_should_be_same) != 0; -} +#define get_Perm_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn))) +#define is_Perm_Proj(irn) (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn))) /****************************************************************************** ____ _ _ _ _ _ _____ _ @@ -89,7 +89,7 @@ static INLINE int is_2addr_code(const arch_register_req_t *req) #define MIS_HEUR_TRIGGER 8 -typedef struct _unit_t { +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 */ @@ -101,7 +101,7 @@ typedef struct _unit_t { 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 */ + struct list_head queue; /**< list of qn's sorted by weight of qn-mis */ } unit_t; @@ -117,16 +117,16 @@ typedef struct _unit_t { |_| |___/ ******************************************************************************/ -typedef struct _neighb_t neighb_t; -typedef struct _affinity_node_t affinity_node_t; +typedef struct neighb_t neighb_t; +typedef struct affinity_node_t affinity_node_t; -struct _neighb_t { +struct neighb_t { neighb_t *next; /** the next neighbour entry*/ const ir_node *irn; /** the neighbour itself */ int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */ }; -struct _affinity_node_t { +struct affinity_node_t { const ir_node *irn; /** a node with affinity edges */ int degree; /** number of affinity edges in the linked list below */ neighb_t *neighbours; /** a linked list of all affinity neighbours */ @@ -134,21 +134,17 @@ struct _affinity_node_t { }; -static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn) { +static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn) +{ affinity_node_t find; ASSERT_GS_AVAIL(co); find.irn = irn; - return set_find(co->nodes, &find, sizeof(find), hash_irn(irn)); + return set_find(affinity_node_t, co->nodes, &find, sizeof(find), hash_irn(irn)); } -#define co_gs_nodes_begin(co) set_first((co)->nodes) -#define co_gs_nodes_next(co) set_next((co)->nodes) -#define co_gs_nodes_break(co) set_break((co)->nodes) - -#define co_gs_foreach_aff_node(co, aff_node) for (aff_node = co_gs_nodes_begin(co); aff_node; aff_node = co_gs_nodes_next(co)) -#define co_gs_foreach_neighb(aff_node, neighb) for (neighb = aff_node->neighbours; neighb; neighb = neighb->next) - +#define co_gs_foreach_aff_node(co, aff_node) foreach_set((co)->nodes, affinity_node_t, (aff_node)) +#define co_gs_foreach_neighb(aff_node, neighb) for (neighb_t *neighb = aff_node->neighbours; neighb; neighb = neighb->next) #endif /* FIRM_BE_BECOPYOPT_T_H */