- Added 2 new blockschedulers, a greedy algorithm and an "optimal" ILP that

[libfirm] / ir / be / becopyilp_t.h

diff --git a/ir/be/becopyilp_t.h b/ir/be/becopyilp_t.h
index 5d5600c..56377fc 100644 (file)
--- a/ir/be/becopyilp_t.h
+++ b/ir/be/becopyilp_t.h
@@ -11,9 +11,8 @@
 #ifndef _BECOPYILP_T_H
 #define _BECOPYILP_T_H
 
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
+#include "firm_config.h"
+
 #ifdef HAVE_ALLOCA_H
 #include <alloca.h>
 #endif
@@ -109,14 +108,13 @@ static INLINE int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg)
 
  *****************************************************************************/
 
+#ifdef WITH_ILP
 #include <lpp/lpp.h>
 
 #define LPP_SOLVE_NET
 
 #ifdef LPP_SOLVE_NET
 #  include <lpp/lpp_net.h>
-#  define LPP_HOST "i44pc52"
-#  define LPP_SOLVER "cplex"
 #else
 #  include <lpp/lpp_cplex.h>
 #endif
@@ -134,7 +132,6 @@ struct _ilp_env_t {
        void *env;
        ilp_callback build;
        ilp_callback apply;
-
 };
 
 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env);
@@ -150,4 +147,6 @@ void free_ilp_env(ilp_env_t *ienv);
 #define name_cdd_sorted(buf, char1, int1, int2) \
                        name_cdd(buf, char1, MIN(int1, int2), MAX(int1, int2))
 
+#endif // WITH_ILP
+
 #endif