X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnodeset.c;h=abc536393acacdb7130c4df2dd128a0e3e8e7dad;hb=203717b8dd44597fb10c126b33a28528a2432e9c;hp=ec325f5fdca5a98c8af758ae01596c1901b250ab;hpb=73a97ce11cc91fd98375f61100075af77c277629;p=libfirm

diff --git a/ir/ir/irnodeset.c b/ir/ir/irnodeset.c
index ec325f5fd..abc536393 100644
--- a/ir/ir/irnodeset.c
+++ b/ir/ir/irnodeset.c
@@ -21,7 +21,7 @@
  * @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$
  */
@@ -45,7 +45,6 @@
 #endif
 #define KeysEqual(this,key1,key2) (key1) == (key2)
 #define SetRangeEmpty(ptr,size)   memset(ptr, 0, (size) * sizeof((ptr)[0]))
-#define ValueCmp(a,b)             ((int) get_irn_idx(a) - (int) get_irn_idx(b))
 
 #define hashset_init            _ir_nodeset_init
 #define hashset_init_size       ir_nodeset_init_size
@@ -58,25 +57,14 @@
 #define hashset_iterator_next   ir_nodeset_iterator_next
 #define hashset_remove_iterator ir_nodeset_remove_iterator
 
-#ifdef IR_NODESET_USE_ORDERED_SETS
-
-#define hashset_insert_quick    ir_nodeset_insert_quick
-#define hashset_remove_quick    ir_nodeset_remove_quick
-#define hashset_fixup           ir_nodeset_fixup
-#include "arrayset.c"
-
-#else
-
 #include "hashset.c"
 
-#endif /* IR_NODESET_USE_ORDERED_SETS */
-
 void ir_nodeset_init(ir_nodeset_t *nodeset)
 {
 	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);
 }