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_t affinity_t;
+
struct _neighb_t {
neighb_t *next; /** the next neighbour entry*/
int costs; /** the costs of the edge (node_t->irn, neighb_t->irn) */
};
-typedef struct _node_t {
+struct _affinity_t {
ir_node *irn; /** a node with affinity edges */
int count; /** number of affinity edges in the linked list below */
neighb_t *neighbours; /** a linked list of all affinity neighbours */
-} node_t;
+};
+
+
+static INLINE affinity_t *get_affinity_info(const copy_opt_t *co, ir_node *irn) {
+ affinity_t find;
+
+ 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