#define SLOTS_CHANGED_NODES 32
#define list_entry_queue(lh) list_entry(lh, qnode_t, queue)
#define SLOTS_CHANGED_NODES 32
#define list_entry_queue(lh) list_entry(lh, qnode_t, queue)
conflict_t c;
DBG((dbg, LEVEL_4, "\t %+F -- %+F\n", n1, n2));
conflict_t c;
DBG((dbg, LEVEL_4, "\t %+F -- %+F\n", n1, n2));
if (n1!=n2 && nodes_interfere(qn->ou->co->cenv, n1, n2))
return 1;
/* search for recoloring conflicts */
if (n1!=n2 && nodes_interfere(qn->ou->co->cenv, n1, n2))
return 1;
/* search for recoloring conflicts */
- return set_find(qn->changed_nodes, &find, sizeof(find), nodeset_hash(irn));
+ return set_find(qn->changed_nodes, &find, sizeof(find), hash_irn(irn));
- return set_insert(qn->changed_nodes, &find, sizeof(find), nodeset_hash(irn));
+ return set_insert(qn->changed_nodes, &find, sizeof(find), hash_irn(irn));