};
/* 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 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((co)->aenv, irn, -1) == (co)->cls)
-#define MIN(a,b) ((a<b)?(a):(b))
-#define MAX(a,b) ((a<b)?(b):(a))
-
#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_2addr_code(arch_env, irn, req) (arch_get_register_req(arch_env, req, irn, -1)->type == arch_register_req_type_should_be_same)
+
/******************************************************************************
____ _ _ _ _ _ _____ _
/ __ \ | | | | | | (_) | / ____| |
typedef struct _unit_t {
struct list_head units; /**< chain for all units */
- copy_opt_t *co; /**< the copy_opt this unit belongs to */
+ 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 incurred, 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 min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max independent set */
int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
/* for heuristic */
******************************************************************************/
typedef struct _neighb_t neighb_t;
+typedef struct _affinity_node_t affinity_node_t;
+
struct _neighb_t {
neighb_t *next; /** the next neighbour entry*/
ir_node *irn; /** the neighbour itself */
- int costs; /** the costs of the edge (node_t->irn, neighb_t->irn) */
+ int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */
};
-typedef struct _node_t {
+struct _affinity_node_t {
ir_node *irn; /** a node with affinity edges */
- int count; /** number of affinity edges in the linked list below */
+ int degree; /** number of affinity edges in the linked list below */
neighb_t *neighbours; /** a linked list of all affinity neighbours */
-} node_t;
+ void *data; /** stuff that is attachable. */
+};
+
+
+static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, ir_node *irn) {
+ affinity_node_t find;
+
+ ASSERT_GS_AVAIL(co);
+
+ find.irn = irn;
+ return set_find(co->nodes, &find, sizeof(find), HASH_PTR(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)
#endif