/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
* @file
* @author Matthias Braun
* @date 30.03.2007
- * @brief A nodeset. This should be prefered over a simple pset, because it
+ * @brief A nodeset. This should be preferred over a simple pset, because it
tries to guarantee deterministic behavior.
* @version $Id$
*/
#define NullValue NULL
#define DeletedValue ((ir_node*)-1)
#ifdef DEBUG_libfirm
-#define Hash(this,value) ((unsigned)((value)->node_nr))
+#define Hash(this,key) ((unsigned)((key)->node_nr))
#else
-#define Hash(this,value) HASH_PTR(value)
+#define Hash(this,key) HASH_PTR(key)
#endif
#define KeysEqual(this,key1,key2) (key1) == (key2)
#define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
ir_nodeset_init_size(nodeset, 16);
}
-int ir_nodeset_contains(const ir_nodeset_t *this, const ir_node *node)
+int ir_nodeset_contains(const ir_nodeset_t *nodeset, const ir_node *node)
{
- return _ir_nodeset_find(this, node) != NULL;
+ return _ir_nodeset_find(nodeset, node);
}