X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt_t.h;h=5c12ab8ef2ab152688c26aef3d492295a79fdefb;hb=755e96e2816108e2bef2317b741e49aac230d5bb;hp=3fcb0f791f0bdc4f13a073b7556c77059bd21218;hpb=f2fe4a8abbc656de8910f6258ebf057ea2ac5496;p=libfirm

diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h
index 3fcb0f791..5c12ab8ef 100644
--- a/ir/be/becopyopt_t.h
+++ b/ir/be/becopyopt_t.h
@@ -15,6 +15,7 @@
 #include "bearch.h"
 #include "bechordal_t.h"
 #include "becopyopt.h"
+#include "benodesets.h"
 
 /**
  * Data representing the problem of copy minimization.
@@ -54,6 +55,7 @@ struct _copy_opt_t {
 #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)
 
 
+
 /******************************************************************************
    ____        _   _    _       _ _          _____ _
   / __ \      | | | |  | |     (_) |        / ____| |
@@ -98,7 +100,6 @@ typedef struct _unit_t {
 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 */
@@ -109,6 +110,7 @@ struct _affinity_node_t {
 	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. */
 };
 
 
@@ -118,16 +120,15 @@ static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, ir_node *
 	ASSERT_GS_AVAIL(co);
 
 	find.irn = irn;
-	return set_find(co->nodes, &find, sizeof(find), HASH_PTR(irn));
+	return set_find(co->nodes, &find, sizeof(find), nodeset_hash(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_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