X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt_t.h;h=5c12ab8ef2ab152688c26aef3d492295a79fdefb;hb=b9d45e08e23bcf058fa8f2d9e18dd78e8cccd044;hp=be1a598727a6d711a605943567bcab6e590922a2;hpb=79ffe731543f1863e65714e997b91374519d3cc7;p=libfirm

diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h
index be1a59872..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.
@@ -99,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 */
@@ -120,7 +120,7 @@ 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)