#include "belive_t.h"
#include "beinsn_t.h"
#include "besched_t.h"
+#include "benodesets.h"
#define DUMP_BEFORE 1
#define DUMP_AFTER 2
new_node.irn = n1;
new_node.degree = 0;
new_node.neighbours = NULL;
- node = set_insert(co->nodes, &new_node, sizeof(new_node), HASH_PTR(new_node.irn));
+ node = set_insert(co->nodes, &new_node, sizeof(new_node), nodeset_hash(new_node.irn));
allocnew = 1;
for (nbr = node->neighbours; nbr; nbr = nbr->next)
ASSERT_GS_AVAIL(co);
new_node.irn = irn;
- n = set_find(co->nodes, &new_node, sizeof(new_node), HASH_PTR(new_node.irn));
+ n = set_find(co->nodes, &new_node, sizeof(new_node), nodeset_hash(new_node.irn));
if (n) {
return (n->degree > 0);
} else