#include "bearch.h"
#include "bechordal_t.h"
#include "becopyopt.h"
+#include "benodesets.h"
/**
* Data representing the problem of copy minimization.
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 */
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)