#define HashSetIterator ir_nodemap_iterator_t
#define ValueType ir_nodemap_entry_t
#define NullValue null_nodemap_entry
-#define KeyType const ir_node*
+#define KeyType ir_node*
#define ConstKeyType const ir_node*
#define GetKey(value) (value).node
#define InitData(self,value,key) (value).node = (key)
-#ifdef DEBUG_libfirm
#define Hash(self,key) ((unsigned)((key)->node_nr))
-#else
-#define Hash(self,key) HASH_PTR(key)
-#endif
#define KeysEqual(self,key1,key2) (key1) == (key2)
#define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
#define EntrySetEmpty(value) (value).node = NULL
return entry->data;
}
-void ir_nodemap_insert(ir_nodemap_t *self, const ir_node *node, void *data)
+void ir_nodemap_insert(ir_nodemap_t *self, ir_node *node, void *data)
{
ir_nodemap_entry_t *entry = _ir_nodemap_insert(self, node);
entry->data = data;