-typedef struct _node_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;
+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 */
+ void *data; /** stuff that is attachable. */
+};
+
+
+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 (affinity_node_t*)set_find(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 = (affinity_node_t*)co_gs_nodes_begin(co); aff_node != NULL; aff_node = (affinity_node_t*)co_gs_nodes_next(co))
+#define co_gs_foreach_neighb(aff_node, neighb) for (neighb = (neighb_t*)aff_node->neighbours; neighb != NULL; neighb = (neighb_t*)neighb->next)