reordered struct for smaller memory print on 64bit

[libfirm] / ir / common / firm_common_t.h

diff --git a/ir/common/firm_common_t.h b/ir/common/firm_common_t.h
index b89af03..3c37879 100644 (file)
--- a/ir/common/firm_common_t.h
+++ b/ir/common/firm_common_t.h
@@ -1,5 +1,5 @@
 /*
- * 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.
  *
@@ -35,19 +35,6 @@
  *  block with the fragile operation. */
 #define PRECISE_EXC_CONTEXT 1
 
-/** There are two implementations of the Phi node construction.  The first
- *  is faster, but does not work for blocks with more than 2 predecessors.
- *  The second works always but is slower and causes more unnecessary Phi
- *  nodes.
- *  Select the implementations by the following preprocessor flag: */
-#define USE_FAST_PHI_CONSTRUCTION 0
-
-/** Further there are two versions of the fast Phi node construction.
- *  If the following flag is set, new_r_Phi_in uses an explicit stack for
- *  allocating and deallocating Phi nodes.  Else it uses the obstack
- *  as a stack! */
-#define USE_EXPLICIT_PHI_IN_STACK 0
-
 /** If this and DEBUG_libfirm are defined irdump uses the nodeid numbers as
  *  labels for the vcg nodes.  This makes the vcg graph better readable.
  *  Sometimes it's useful to see the pointer values, though. */