/*
- * 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.
*
* @brief ILP based copy minimization.
* @author Daniel Grund
* @date 28.02.2006
- * @version $Id$
*
* ILP formalization using G=(V, E, Q):
* - 2 class of variables: coloring vars x_ic and equal color vars y_ij
* - Clique-star constraints
*
*
- * \min \sum_{ (i,j) \in Q } w_ij y_ij
+ * \min \sum_{ (i,j) \in Q } w_ij y_ij
*
- * \sum_c x_nc = 1 n \in N, c \in C
+ * \sum_c x_nc = 1 n \in N, c \in C
*
- * x_nc = 0 n \in N, c \not\in C(n)
+ * x_nc = 0 n \in N, c \not\in C(n)
*
- * \sum x_nc <= 1 x_nc \in Clique \in AllCliques, c \in C
+ * \sum x_nc <= 1 x_nc \in Clique \in AllCliques, c \in C
*
- * \sum_{e \in p} y_e >= 1 p \in P path constraints
+ * \sum_{e \in p} y_e >= 1 p \in P path constraints
*
- * \sum_{e \in cs} y_e >= |cs| - 1 cs \in CP clique-star constraints
+ * \sum_{e \in cs} y_e >= |cs| - 1 cs \in CP clique-star constraints
*
- * x_nc, y_ij \in N, w_ij \in R^+
+ * x_nc, y_ij \in N, w_ij \in R^+
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif /* HAVE_CONFIG_H */
-
-#include "firm_config.h"
-
-#ifdef WITH_ILP
#include "bitset.h"
#include "raw_bitset.h"
#include "pdeq.h"
-#include "irtools.h"
+#include "util.h"
#include "irgwalk.h"
#include "becopyilp_t.h"
-#include "beifg_t.h"
-#include "besched_t.h"
+#include "beifg.h"
+#include "besched.h"
+#include "bemodule.h"
#define DEBUG_LVL 1
-typedef struct _local_env_t {
+typedef struct local_env_t {
double time_limit;
int first_x_var, last_x_var;
int n_colors;
DEBUG_ONLY(firm_dbg_module_t *dbg;)
} local_env_t;
-static void build_coloring_cstr(ilp_env_t *ienv) {
+static void build_coloring_cstr(ilp_env_t *ienv)
+{
be_ifg_t *ifg = ienv->co->cenv->ifg;
- void *iter = be_ifg_nodes_iter_alloca(ifg);
+ nodes_iter_t iter;
bitset_t *colors;
ir_node *irn;
char buf[16];
colors = bitset_alloca(arch_register_class_n_regs(ienv->co->cls));
- be_ifg_foreach_node(ifg, iter, irn)
+ be_ifg_foreach_node(ifg, &iter, irn)
if (!sr_is_removed(ienv->sr, irn)) {
- bitset_pos_t col;
+ size_t col;
int cst_idx;
const arch_register_req_t *req;
- int curr_node_color = get_irn_col(ienv->co, irn);
+ int curr_node_color = get_irn_col(irn);
int node_nr = (int)get_irn_idx(irn);
local_env_t *lenv = ienv->env;
pmap_insert(lenv->nr_2_irn, INT_TO_PTR(node_nr), irn);
- req = arch_get_register_req(ienv->co->aenv, irn, -1);
+ req = arch_get_irn_register_req(irn);
bitset_clear_all(colors);
cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 1.0);
bitset_foreach(colors, col) {
- int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, col), lpp_binary, 0.0);
+ int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, (int)col), lpp_binary, 0.0);
lpp_set_start_value(ienv->lp, var_idx, (col == (unsigned) curr_node_color) ? 1.0 : 0.0);
lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1);
/* add register constraint constraints */
bitset_foreach_clear(colors, col) {
int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 0.0);
- int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, col), lpp_binary, 0.0);
+ int var_idx = lpp_add_var(ienv->lp, name_cdd(buf, 'x', node_nr, (int)col), lpp_binary, 0.0);
lpp_set_start_value(ienv->lp, var_idx, 0.0);
lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1);
}
}
-static void build_interference_cstr(ilp_env_t *ienv) {
- lpp_t *lpp = ienv->lp;
- local_env_t *lenv = ienv->env;
- be_ifg_t *ifg = ienv->co->cenv->ifg;
- int n_colors = lenv->n_colors;
- int i, col;
-
- void *iter = be_ifg_cliques_iter_alloca(ifg);
- ir_node **clique = alloca(sizeof(*clique) * n_colors);
- int size;
+static void build_interference_cstr(ilp_env_t *ienv)
+{
+ lpp_t *lpp = ienv->lp;
+ local_env_t *lenv = ienv->env;
+ be_ifg_t *ifg = ienv->co->cenv->ifg;
+ int n_colors = lenv->n_colors;
+ cliques_iter_t iter;
+ ir_node **clique = ALLOCAN(ir_node*, n_colors);
+ int size;
+ int col;
+ int i;
char buf[16];
/* for each maximal clique */
- be_ifg_foreach_clique(ifg, iter, clique, &size) {
+ be_ifg_foreach_clique(ifg, &iter, clique, &size) {
int realsize = 0;
for (i=0; i<size; ++i)
/* for all colors */
for (col=0; col<n_colors; ++col) {
- int cst_idx = lpp_add_cst(lpp, NULL, lpp_less, 1.0);
+ int cst_idx = lpp_add_cst(lpp, NULL, lpp_less_equal, 1.0);
/* for each member of this clique */
for (i=0; i<size; ++i) {
* by walking over all affinity edges. Graph structure
* does not provide this walker, yet.
*/
-static void build_affinity_cstr(ilp_env_t *ienv) {
+static void build_affinity_cstr(ilp_env_t *ienv)
+{
local_env_t *lenv = ienv->env;
int n_colors = lenv->n_colors;
unit_t *curr;
root = curr->nodes[0];
root_nr = (int) get_irn_idx(root);
- root_col = get_irn_col(ienv->co, root);
+ root_col = get_irn_col(root);
for (i = 1; i < curr->node_count; ++i) {
arg = curr->nodes[i];
arg_nr = (int) get_irn_idx(arg);
- arg_col = get_irn_col(ienv->co, arg);
+ arg_col = get_irn_col(arg);
/* add a new affinity variable */
y_idx = lpp_add_var(ienv->lp, name_cdd_sorted(buf, 'y', root_nr, arg_nr), lpp_binary, curr->costs[i]);
/* add constraints relating the affinity var to the color vars */
for (col=0; col<n_colors; ++col) {
- int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_less, 0.0);
+ int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_less_equal, 0.0);
root_idx = lpp_get_var_idx(ienv->lp, name_cdd(buf, 'x', root_nr, col));
arg_idx = lpp_get_var_idx(ienv->lp, name_cdd(buf, 'x', arg_nr, col));
/**
* Helping stuff for build_clique_star_cstr
*/
-typedef struct _edge_t {
+typedef struct edge_t {
ir_node *n1, *n2;
} edge_t;
-static int compare_edge_t(const void *k1, const void *k2, size_t size) {
+static int compare_edge_t(const void *k1, const void *k2, size_t size)
+{
const edge_t *e1 = k1;
const edge_t *e2 = k2;
(void) size;
#define HASH_EDGE(e) (hash_irn((e)->n1) ^ hash_irn((e)->n2))
-static INLINE edge_t *add_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
+static inline edge_t *add_edge(set *edges, ir_node *n1, ir_node *n2, int *counter)
+{
edge_t new_edge;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
return set_insert(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
}
-static INLINE edge_t *find_edge(set *edges, ir_node *n1, ir_node *n2) {
+static inline edge_t *find_edge(set *edges, ir_node *n1, ir_node *n2)
+{
edge_t new_edge;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
return set_find(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
}
-static INLINE void remove_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
+static inline void remove_edge(set *edges, ir_node *n1, ir_node *n2, int *counter)
+{
edge_t new_edge, *e;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
}
}
-#define pset_foreach(pset, irn) for(irn=pset_first(pset); irn; irn=pset_next(pset))
+#define pset_foreach(pset, irn) for (irn=pset_first(pset); irn; irn=pset_next(pset))
/**
* Search for an interference clique and an external node
* with affinity edges to all nodes of the clique.
* At most 1 node of the clique can be colored equally with the external node.
*/
-static void build_clique_star_cstr(ilp_env_t *ienv) {
+static void build_clique_star_cstr(ilp_env_t *ienv)
+{
affinity_node_t *aff;
/* for each node with affinity edges */
co_gs_foreach_aff_node(ienv->co, aff) {
struct obstack ob;
neighb_t *nbr;
- ir_node *center = aff->irn;
+ const ir_node *center = aff->irn;
ir_node **nodes;
set *edges;
int i, o, n_nodes, n_edges;
+ if (arch_irn_is_ignore(aff->irn))
+ continue;
+
obstack_init(&ob);
edges = new_set(compare_edge_t, 8);
/* get all affinity neighbours */
n_nodes = 0;
co_gs_foreach_neighb(aff, nbr) {
- obstack_ptr_grow(&ob, nbr->irn);
- ++n_nodes;
+ if (!arch_irn_is_ignore(nbr->irn)) {
+ obstack_ptr_grow(&ob, nbr->irn);
+ ++n_nodes;
+ }
}
nodes = obstack_finish(&ob);
int growed;
/* get 2 starting nodes to form a clique */
- for (e=set_first(edges); !e->n1; e=set_next(edges))
- /*nothing*/ ;
+ for (e=set_first(edges); !e->n1; e=set_next(edges)) {
+ }
/* we could be stepped out of the loop before the set iterated to the end */
set_break(edges);
int var_idx, cst_idx, center_nr, member_nr;
char buf[16];
- cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_greater, pset_count(clique)-1);
+ cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_greater_equal, pset_count(clique)-1);
center_nr = get_irn_idx(center);
pset_foreach(clique, member) {
}
-static void extend_path(ilp_env_t *ienv, pdeq *path, ir_node *irn) {
+static void extend_path(ilp_env_t *ienv, pdeq *path, const ir_node *irn)
+{
be_ifg_t *ifg = ienv->co->cenv->ifg;
int i, len;
ir_node **curr_path;
if (pdeq_contains(path, irn))
return;
+ if (arch_irn_is_ignore(irn))
+ return;
+
/* insert the new irn */
pdeq_putr(path, irn);
/* check for forbidden interferences */
- len = pdeq_len(path);
- curr_path = alloca(len * sizeof(*curr_path));
+ len = pdeq_len(path);
+ curr_path = ALLOCAN(ir_node*, len);
pdeq_copyl(path, (const void **)curr_path);
for (i=1; i<len; ++i)
/* And a path of length 2 is covered by a clique star constraint. */
if (len > 2) {
/* finally build the constraint */
- int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_greater, 1.0);
+ int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_greater_equal, 1.0);
for (i=1; i<len; ++i) {
char buf[16];
int nr_1 = get_irn_idx(curr_path[i-1]);
* edges in between.
* Then at least one of these affinity edges must break.
*/
-static void build_path_cstr(ilp_env_t *ienv) {
+static void build_path_cstr(ilp_env_t *ienv)
+{
affinity_node_t *aff_info;
/* for each node with affinity edges */
}
}
-static void ilp2_build(ilp_env_t *ienv) {
+static void ilp2_build(ilp_env_t *ienv)
+{
local_env_t *lenv = ienv->env;
int lower_bound;
- ienv->lp = new_lpp(ienv->co->name, lpp_minimize);
+ ienv->lp = lpp_new(ienv->co->name, lpp_minimize);
build_coloring_cstr(ienv);
build_interference_cstr(ienv);
build_affinity_cstr(ienv);
lpp_set_time_limit(ienv->lp, lenv->time_limit);
}
-static void ilp2_apply(ilp_env_t *ienv) {
+static void ilp2_apply(ilp_env_t *ienv)
+{
local_env_t *lenv = ienv->env;
- double *sol;
- lpp_sol_state_t state;
- int i, count;
+ int i;
/* first check if there was sth. to optimize */
if (lenv->first_x_var >= 0) {
+ int count = lenv->last_x_var - lenv->first_x_var + 1;
+ double *sol = XMALLOCN(double, count);
+ lpp_sol_state_t state = lpp_get_solution(ienv->lp, sol, lenv->first_x_var, lenv->last_x_var);
- count = lenv->last_x_var - lenv->first_x_var + 1;
- sol = xmalloc(count * sizeof(sol[0]));
- state = lpp_get_solution(ienv->lp, sol, lenv->first_x_var, lenv->last_x_var);
if (state != lpp_optimal) {
- printf("WARNING %s: Solution state is not 'optimal': %d\n", ienv->co->name, state);
+ printf("WARNING %s: Solution state is not 'optimal': %d\n", ienv->co->name, (int)state);
assert(state >= lpp_feasible && "The solution should at least be feasible!");
}
assert(0 && "This should be a x-var");
}
}
+
+ xfree(sol);
}
#ifdef COPYOPT_STAT
#endif
}
-int co_solve_ilp2(copy_opt_t *co) {
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp2)
+void be_init_copyilp2(void)
+{
+ static co_algo_info copyheur = {
+ co_solve_ilp2, 1
+ };
+
+ be_register_copyopt("ilp", ©heur);
+}
+
+int co_solve_ilp2(copy_opt_t *co)
+{
lpp_sol_state_t sol_state;
ilp_env_t *ienv;
local_env_t my;
my.normal_colors = bitset_alloca(arch_register_class_n_regs(co->cls));
bitset_clear_all(my.normal_colors);
- arch_put_non_ignore_regs(co->aenv, co->cls, my.normal_colors);
- my.n_colors = bitset_popcnt(my.normal_colors);
+ be_put_allocatable_regs(co->irg, co->cls, my.normal_colors);
+ my.n_colors = bitset_popcount(my.normal_colors);
ienv = new_ilp_env(co, ilp2_build, ilp2_apply, &my);
return sol_state == lpp_optimal;
}
-
-#else /* WITH_ILP */
-
-static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) {
-}
-
-#endif /* WITH_ILP */
projects / libfirm / blobdiff