2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief Internal header for copy optimization problem.
12 #ifndef FIRM_BE_BECOPYOPT_T_H
13 #define FIRM_BE_BECOPYOPT_T_H
21 #include "bechordal_t.h"
22 #include "becopyopt.h"
25 * Data representing the problem of copy minimization.
28 be_chordal_env_t *cenv;
29 const arch_register_class_t *cls;
31 char *name; /**< ProgName__IrgName__RegClassName */
32 cost_fct_t get_costs; /**< function ptr used to get costs for copies */
34 /** Representation as optimization units */
35 struct list_head units; /**< all units to optimize in specific order */
37 /** Representation in graph structure. Only build on demand */
43 #define ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not build")
44 #define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not build")
46 static inline unsigned get_irn_col(const ir_node *node)
48 return arch_get_irn_register(node)->index;
51 static inline void set_irn_col(const arch_register_class_t *cls, ir_node *node,
54 const arch_register_t *reg = arch_register_for_index(cls, color);
55 arch_set_irn_register(node, reg);
58 #define list_entry_units(lh) list_entry(lh, unit_t, units)
60 #define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
62 #define get_Perm_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
63 #define is_Perm_Proj(irn) (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn)))
65 /******************************************************************************
66 ____ _ _ _ _ _ _____ _
67 / __ \ | | | | | | (_) | / ____| |
68 | | | |_ __ | |_| | | |_ __ _| |_ ___ | (___ | |_ ___ _ __ __ _ __ _ ___
69 | | | | '_ \| __| | | | '_ \| | __/ __| \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
70 | |__| | |_) | |_| |__| | | | | | |_\__ \ ____) | || (_) | | | (_| | (_| | __/
71 \____/| .__/ \__|\____/|_| |_|_|\__|___/ |_____/ \__\___/|_| \__,_|\__, |\___|
74 ******************************************************************************/
76 #define MIS_HEUR_TRIGGER 8
78 typedef struct unit_t {
79 struct list_head units; /**< chain for all units */
80 copy_opt_t *co; /**< the copy opt this unit belongs to */
81 int node_count; /**< size of the nodes array */
82 ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
83 int *costs; /**< costs[i] are incurred, if nodes[i] has a different color */
84 int inevitable_costs; /**< sum of costs of all args interfering with root */
85 int all_nodes_costs; /**< sum of all costs[i] */
86 int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max independent set */
87 int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
90 struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
95 /******************************************************************************
98 | | __ _ __ __ _ _ __ | |__ | (___ | |_ ___ _ __ __ _ __ _ ___
99 | | |_ | '__/ _` | '_ \| '_ \ \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
100 | |__| | | | (_| | |_) | | | | ____) | || (_) | | | (_| | (_| | __/
101 \_____|_| \__,_| .__/|_| |_| |_____/ \__\___/|_| \__,_|\__, |\___|
104 ******************************************************************************/
106 typedef struct neighb_t neighb_t;
107 typedef struct affinity_node_t affinity_node_t;
110 neighb_t *next; /** the next neighbour entry*/
111 const ir_node *irn; /** the neighbour itself */
112 int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */
115 struct affinity_node_t {
116 const ir_node *irn; /** a node with affinity edges */
117 int degree; /** number of affinity edges in the linked list below */
118 neighb_t *neighbours; /** a linked list of all affinity neighbours */
119 void *data; /** stuff that is attachable. */
123 static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn)
125 affinity_node_t find;
130 return set_find(affinity_node_t, co->nodes, &find, sizeof(find), hash_irn(irn));
133 #define co_gs_foreach_aff_node(co, aff_node) foreach_set((co)->nodes, affinity_node_t, (aff_node))
134 #define co_gs_foreach_neighb(aff_node, neighb) for (neighb_t *neighb = aff_node->neighbours; neighb; neighb = neighb->next)
136 #endif /* FIRM_BE_BECOPYOPT_T_H */