X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbecopyilp_t.h;h=eb3ba12cb87e9148dbbbcfe14825a308188e0a43;hb=75c3d36f124dbac5780d9c33cbfc4b30ae8e29a0;hp=1c903e53300f84f7f69e4004d9c472749341f3c5;hpb=719b0dc8377fc55decc4629bf5e523104a82b76f;p=libfirm

diff --git a/ir/be/becopyilp_t.h b/ir/be/becopyilp_t.h
index 1c903e533..eb3ba12cb 100644
--- a/ir/be/becopyilp_t.h
+++ b/ir/be/becopyilp_t.h
@@ -1,27 +1,33 @@
-/**
- * Author:      Daniel Grund
- * Date:		28.02.2006
- * Copyright:   (c) Universitaet Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
  *
- * Common stuff used by all ILP fomulations.
+ * 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.
  */
 
-#ifndef _BECOPYILP_T_H
-#define _BECOPYILP_T_H
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-#ifdef HAVE_ALLOCA_H
-#include <alloca.h>
-#endif
-#ifdef HAVE_MALLOC_H
-#include <malloc.h>
-#endif
+/**
+ * @file
+ * @brief       Common stuff used by all ILP formulations.
+ * @author      Daniel Grund
+ * @date        28.02.2006
+ * @version     $Id$
+ */
+#ifndef FIRM_BE_BECOPYILP_T_H
+#define FIRM_BE_BECOPYILP_T_H
 
-#include "irnode_t.h"
+#include "firm_types.h"
 #include "pset.h"
 #include "becopyopt_t.h"
 
@@ -39,14 +45,14 @@ typedef struct _coloring_suffix_t coloring_suffix_t;
 
 struct _coloring_suffix_t {
 	coloring_suffix_t *next;
-	ir_node *irn;
+	ir_node           *irn;
 };
 
 typedef struct _size_red_t {
-	copy_opt_t *co;
-	pset *all_removed;				/**< All nodes removed during problem size reduction */
-	coloring_suffix_t *col_suff;	/**< Coloring suffix. Reverse would be a PEO prefix */
-	struct obstack ob;
+	copy_opt_t        *co;
+	pset              *all_removed;   /**< All nodes removed during problem size reduction */
+	coloring_suffix_t *col_suff;      /**< Coloring suffix. Reverse would be a PEO prefix */
+	struct obstack    ob;
 } size_red_t;
 
 /**
@@ -80,15 +86,15 @@ void free_size_red(size_red_t *sr);
  *       units (ou's) args could be merged and weights are accumulated.
  *       Is this necessary?
  */
-static INLINE int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg) {
-	int i;
+static inline int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg) {
+	int    i;
 	unit_t *curr;
 
 	/* search optimization unit for phi */
 	list_for_each_entry(unit_t, curr, &co->units, units)
 		if (curr->nodes[0] == root) {
 
-			for (i=1; i<curr->node_count; ++i)
+			for (i = 1; i < curr->node_count; ++i)
 				if (curr->nodes[i] == arg)
 					return curr->costs[i];
 
@@ -109,14 +115,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>
 
-#undef LPP_SOLVE_NET
+#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
@@ -128,26 +133,27 @@ typedef struct _ilp_env_t ilp_env_t;
 typedef void(*ilp_callback)(ilp_env_t*);
 
 struct _ilp_env_t {
-	firm_dbg_module_t *dbg;
-	const copy_opt_t *co;			/**< the copy opt problem */
-	size_red_t *sr;					/**< problem size reduction. removes simple nodes */
-	lpp_t *lp;						/**< the linear programming problem */
-	void *env;
-	ilp_callback build;
-	ilp_callback apply;
-
+	const copy_opt_t *co;   /**< the copy opt problem */
+	size_red_t       *sr;   /**< problem size reduction. removes simple nodes */
+	lpp_t            *lp;   /**< the linear programming problem */
+	void             *env;
+	ilp_callback     build;
+	ilp_callback     apply;
 };
 
-ilp_env_t *new_ilp_env(copy_opt_t *co, firm_dbg_module_t *dbg, ilp_callback build, ilp_callback apply, void *env);
+ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env);
 
-lpp_sol_state_t ilp_go(ilp_env_t *ienv, double time_limit);
+lpp_sol_state_t ilp_go(ilp_env_t *ienv);
 
 void free_ilp_env(ilp_env_t *ienv);
 
 
-/******************************************************************************
+#define name_cdd(buf, char1, int1, int2) \
+			(snprintf(buf, sizeof(buf), "%c_%d_%d", char1, int1, int2), buf)
 
+#define name_cdd_sorted(buf, char1, int1, int2) \
+			name_cdd(buf, char1, MIN(int1, int2), MAX(int1, int2))
 
- *****************************************************************************/
+#endif /* WITH_ILP */
 
-#endif
+#endif /* FIRM_BE_BECOPYILP_T_H */