+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
/**
* Author: Daniel Grund
* Date: 17.05.2005
* CVS-ID: $Id$
*
* ILP formalization using:
- * - 2 classes of vars: Nodes- and optimality variables.
- * - Clique constraints
- * - Path constraints
- * - Clique path constraints
+ * ????
*/
#ifdef HAVE_CONFIG_H
#define DEBUG_LVL 1
typedef struct _my_env_t {
- int foo;
+ int dummy;
} my_env_t;
-static void ilp1_build(ilp_env_t *ienv) {
- ienv->lp = new_lpp(ienv->co->name, lpp_minimize);
-
-}
-
-static void ilp1_apply(ilp_env_t *ienv) {
-
-}
-
int co_solve_ilp1(copy_opt_t *co, double time_limit) {
return 1;
}
-
#else /* WITH_ILP */
-static void only_that_you_can_compile_without_WITH_ILP_defined(void) {
+static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
}
#endif /* WITH_ILP */