projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
beuses: Remove stale start loop test.
[libfirm]
/
ir
/
be
/
becopyilp_t.h
diff --git
a/ir/be/becopyilp_t.h
b/ir/be/becopyilp_t.h
index
f2454b6
..
7d81745
100644
(file)
--- a/
ir/be/becopyilp_t.h
+++ b/
ir/be/becopyilp_t.h
@@
-1,27
+1,32
@@
-/**
- * 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
+ */
+#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"
#include "pset.h"
#include "becopyopt_t.h"
@@
-35,18
+40,18
@@
*****************************************************************************/
*****************************************************************************/
-typedef struct
_
coloring_suffix_t coloring_suffix_t;
+typedef struct coloring_suffix_t coloring_suffix_t;
-struct
_
coloring_suffix_t {
+struct coloring_suffix_t {
coloring_suffix_t *next;
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;
+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;
} size_red_t;
/**
} size_red_t;
/**
@@
-57,7
+62,7
@@
size_red_t *new_size_red(copy_opt_t *co);
/**
* Checks if a node has already been removed
*/
/**
* Checks if a node has already been removed
*/
-#define sr_is_removed(sr, irn)
pset_find_ptr((sr)->all_removed, irn)
+#define sr_is_removed(sr, irn) pset_find_ptr((sr)->all_removed, irn)
/**
* Virtually remove all nodes not related to the problem
/**
* Virtually remove all nodes not related to the problem
@@
-80,15
+85,14
@@
void free_size_red(size_red_t *sr);
* units (ou's) args could be merged and weights are accumulated.
* Is this necessary?
*/
* 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) {
+static
inline
int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg) {
int i;
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) {
/* 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];
if (curr->nodes[i] == arg)
return curr->costs[i];
@@
-109,31
+113,22
@@
static INLINE int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg)
*****************************************************************************/
*****************************************************************************/
-#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
+#include "lpp.h"
+#include "lpp_net.h"
#define EPSILON 0.00001
#define EPSILON 0.00001
-typedef struct
_
ilp_env_t ilp_env_t;
+typedef struct ilp_env_t ilp_env_t;
typedef void(*ilp_callback)(ilp_env_t*);
typedef void(*ilp_callback)(ilp_env_t*);
-struct
_
ilp_env_t {
- 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;
+struct ilp_env_t {
+ 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, 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);
@@
-142,11
+137,4
@@
lpp_sol_state_t ilp_go(ilp_env_t *ienv);
void free_ilp_env(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
#endif