remove old #undef

diff --git a/ir/ir/irlinkednodeset.h b/ir/ir/irlinkednodeset.h
index 3ca5c74..63f12e6 100644 (file)
--- a/ir/ir/irlinkednodeset.h
+++ b/ir/ir/irlinkednodeset.h
@@ -29,16 +29,6 @@
 #include "xmalloc.h"
 #include "list.h"
 
-/*
- * sebastian experimental:
- * use ordered arrays as node sets.
- * the guys here have made good experiences with that.
- * Internally we use normal Firm arrays and binary
- * search for locating the elements. Using arrays should
- * give the sets a small footprint.
- */
-#undef IR_NODESET_USE_ORDERED_SETS
-
 typedef struct ir_lnk_nodeset_entry_t {
        ir_node     *node;  /**< the node itself */
        list_head   list;   /**< link field for the list iterator */

diff --git a/ir/ir/irnodeset.h b/ir/ir/irnodeset.h
index 535c144..b97b042 100644 (file)
--- a/ir/ir/irnodeset.h
+++ b/ir/ir/irnodeset.h
@@ -32,16 +32,6 @@
 #include "firm_types.h"
 #include "xmalloc.h"
 
-/*
- * sebastian experimental:
- * use ordered arrays as node sets.
- * the guys here have made good experiences with that.
- * Internally we use normal Firm arrays and binary
- * search for locating the elements. Using arrays should
- * give the sets a small footprint.
- */
-#undef  IR_NODESET_USE_ORDERED_SETS
-
 #define HashSet          ir_nodeset_t
 #define HashSetIterator  ir_nodeset_iterator_t
 #define ValueType        ir_node*