X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyilp2.c;h=95e6b42d6f7e8b46f614f1977e4e0a2dbc983c6a;hb=1b4cac3471b02b63e9656cd8c876f067766fe482;hp=584fa159cd46abe4694ba25754c59065050634e7;hpb=30cd701b908f9b6fd0c6216d5fe7ef54a80da107;p=libfirm diff --git a/ir/be/becopyilp2.c b/ir/be/becopyilp2.c index 584fa159c..95e6b42d6 100644 --- a/ir/be/becopyilp2.c +++ b/ir/be/becopyilp2.c @@ -1,9 +1,27 @@ -/** - * 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. + * + * 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. + */ + +/** + * @file + * @brief ILP based copy minimization. + * @author Daniel Grund + * @date 28.02.2006 * * ILP formalization using G=(V, E, Q): * - 2 class of variables: coloring vars x_ic and equal color vars y_ij @@ -11,172 +29,245 @@ * - 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 */ - -#ifdef WITH_ILP -#include +#include "be_t.h" +#include "bitset.h" +#include "error.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 +DEBUG_ONLY(static firm_dbg_module_t *dbg;) -typedef struct _local_env_t { - firm_dbg_module_t *dbg; - double time_limit; - int first_x_var, last_x_var; - pmap *nr_2_irn; +typedef struct local_env_t { + int first_x_var; + int last_x_var; + const unsigned *allocatable_colors; } local_env_t; -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); - 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) - if (!sr_is_removed(ienv->sr, irn)) { - int col, cst_idx; - arch_register_req_t req; - int curr_node_color = get_irn_col(ienv->co, irn); - int node_nr = (int)get_irn_node_nr(irn); - local_env_t *lenv = ienv->env; - - pmap_insert(lenv->nr_2_irn, INT_TO_PTR(node_nr), irn); - - arch_get_register_req(ienv->co->aenv, &req, irn, -1); - - /* get assignable colors */ - if (arch_register_req_is(&req, limited)) - req.limited(req.limited_env, colors); - else - arch_put_non_ignore_regs(ienv->co->aenv, req.cls, colors); - - /* add the coloring constraint */ - 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); - lpp_set_start_value(ienv->lp, var_idx, (col == curr_node_color) ? 1.0 : 0.0); - lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1); - - lenv->last_x_var = var_idx; - if (lenv->first_x_var == -1) - lenv->first_x_var = var_idx; - } +static unsigned check_alignment_constraints(ir_node *node) +{ + const arch_register_req_t *req = arch_get_irn_register_req(node); + // For larger than 1 variables, support only aligned constraints + assert((arch_register_req_is(req, aligned) || req->width == 1) && "Unaligned large (width > 1) variables not supported"); + return arch_register_req_is(req, aligned) && req->width > 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); - lpp_set_start_value(ienv->lp, var_idx, 0.0); - lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1); +static void make_color_var_name(char *buf, size_t buf_size, + const ir_node *node, unsigned color) +{ + unsigned node_idx = get_irn_idx(node); + snprintf(buf, buf_size, "x_%u_%u", node_idx, color); +} - lenv->last_x_var = var_idx; - } +static void build_coloring_cstr(ilp_env_t *ienv) +{ + local_env_t *lenv = (local_env_t*)ienv->env; + be_ifg_t *ifg = ienv->co->cenv->ifg; + unsigned n_regs = arch_register_class_n_regs(ienv->co->cls); + const unsigned *allocatable_colors = lenv->allocatable_colors; + nodes_iter_t iter; + ir_node *irn; + char buf[32]; + + unsigned *const colors = rbitset_alloca(n_regs); + be_ifg_foreach_node(ifg, &iter, irn) { + const arch_register_req_t *req; + unsigned col; + int cst_idx; + unsigned curr_node_color; + unsigned has_alignment_cstr; + + if (sr_is_removed(ienv->sr, irn)) + continue; + + has_alignment_cstr = check_alignment_constraints(irn); + + req = arch_get_irn_register_req(irn); + + /* get assignable colors */ + if (arch_register_req_is(req, limited)) { + rbitset_copy(colors, req->limited, n_regs); + } else { + rbitset_copy(colors, allocatable_colors, n_regs); } -} -static void build_interference_cstr(ilp_env_t *ienv) { - lpp_t *lpp = ienv->lp; - be_ifg_t *ifg = ienv->co->cenv->ifg; - int n_colors = arch_register_class_n_regs(ienv->co->cls); - int i, col; + /* add the coloring constraint */ + cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 1.0); + + curr_node_color = get_irn_col(irn); + for (col = 0; col < n_regs; ++col) { + int var_idx; + double val; + if (!rbitset_is_set(colors, col) + || (has_alignment_cstr && ((col % req->width) != 0))) + continue; + + make_color_var_name(buf, sizeof(buf), irn, col); + var_idx = lpp_add_var(ienv->lp, buf, lpp_binary, 0.0); + lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1); + + val = (col == curr_node_color) ? 1.0 : 0.0; + lpp_set_start_value(ienv->lp, var_idx, val); - void *iter = be_ifg_cliques_iter_alloca(ifg); - ir_node **clique = alloca(sizeof(*clique) * n_colors); - int size; + lenv->last_x_var = var_idx; + if (lenv->first_x_var == -1) + lenv->first_x_var = var_idx; + } + + /* add register constraint constraints */ + for (col = 0; col < n_regs; ++col) { + int cst_idx; + int var_idx; + if (rbitset_is_set(colors, col) + // for aligned variable, we set the unaligned part to 0 + && (!has_alignment_cstr || ((col % req->width) == 0))) + continue; + + make_color_var_name(buf, sizeof(buf), irn, col); + cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_equal, 0.0); + var_idx = lpp_add_var(ienv->lp, buf, 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); + + lenv->last_x_var = var_idx; + } + } +} - char buf[16]; +static void build_interference_cstr(ilp_env_t *ienv) +{ + lpp_t *lpp = ienv->lp; + local_env_t *lenv = (local_env_t*)ienv->env; + be_ifg_t *ifg = ienv->co->cenv->ifg; + unsigned n_colors = arch_register_class_n_regs(ienv->co->cls); + ir_node **clique = ALLOCAN(ir_node*, n_colors); + const unsigned *allocatable_colors = lenv->allocatable_colors; + cliques_iter_t iter; + int size; + unsigned col; + int i; /* for each maximal clique */ - be_ifg_foreach_clique(ifg, iter, clique, &size) { - int realsize = 0; + be_ifg_foreach_clique(ifg, &iter, clique, &size) { + unsigned realsize = 0; - for (i=0; isr, clique[i])) ++realsize; + } if (realsize < 2) continue; /* for all colors */ for (col=0; colsr, irn)) { - int var_idx = lpp_get_var_idx(lpp, name_cdd(buf, 'x', (int)get_irn_node_nr(irn), col)); - lpp_set_factor_fast(lpp, cst_idx, var_idx, 1); + char buf[32]; + int var_idx; + unsigned aligment_offset = 0; + + if (sr_is_removed(ienv->sr, irn)) + continue; + + // Use the first part of the large registers for all + // interference, since it is the only colorable one. + if (check_alignment_constraints(irn)) { + const arch_register_req_t *req + = arch_get_irn_register_req(irn); + aligment_offset = col % req->width; } + + make_color_var_name(buf, sizeof(buf), irn, + col - aligment_offset); + var_idx = lpp_get_var_idx(lpp, buf); + lpp_set_factor_fast(lpp, cst_idx, var_idx, 1); } } } } +static void make_affinity_var_name(char *buf, size_t buf_size, + const ir_node *node1, const ir_node *node2) +{ + unsigned n1 = get_irn_idx(node1); + unsigned n2 = get_irn_idx(node2); + if (n1 < n2) { + snprintf(buf, buf_size, "y_%u_%u", n1, n2); + } else { + snprintf(buf, buf_size, "y_%u_%u", n2, n1); + } +} + /** * TODO: Remove the dependency of the opt-units data structure * by walking over all affinity edges. Graph structure * does not provide this walker, yet. */ -static void build_affinity_cstr(ilp_env_t *ienv) { - unit_t *curr; - int n_colors = arch_register_class_n_regs(ienv->co->cls); +static void build_affinity_cstr(ilp_env_t *ienv) +{ + unsigned n_colors = arch_register_class_n_regs(ienv->co->cls); /* for all optimization units */ list_for_each_entry(unit_t, curr, &ienv->co->units, units) { - ir_node *root, *arg; - int root_nr, arg_nr, i, col, y_idx, root_idx, arg_idx; - char buf[16]; - int root_col, arg_col; - - root = curr->nodes[0]; - root_nr = (int) get_irn_node_nr(root); - root_col = get_irn_col(ienv->co, root); + ir_node *root = curr->nodes[0]; + unsigned root_col = get_irn_col(root); + int i; for (i = 1; i < curr->node_count; ++i) { - arg = curr->nodes[i]; - arg_nr = (int) get_irn_node_nr(arg); - arg_col = get_irn_col(ienv->co, arg); + ir_node *arg = curr->nodes[i]; + unsigned arg_col = get_irn_col(arg); + double val; + char buf[32]; + unsigned col; + int y_idx; /* 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]); - lpp_set_start_value(ienv->lp, y_idx, (root_col==arg_col) ? 0.0 : 1.0); + make_affinity_var_name(buf, sizeof(buf), arg, root); + y_idx = lpp_add_var(ienv->lp, buf, lpp_binary, curr->costs[i]); + val = (root_col == arg_col) ? 0.0 : 1.0; + lpp_set_start_value(ienv->lp, y_idx, val); /* add constraints relating the affinity var to the color vars */ for (col=0; collp, NULL, lpp_less, 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)); + int cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_less_equal, 0.0); + int root_idx; + int arg_idx; + + make_color_var_name(buf, sizeof(buf), root, col); + root_idx = lpp_get_var_idx(ienv->lp, buf); + make_color_var_name(buf, sizeof(buf), arg, col); + arg_idx = lpp_get_var_idx(ienv->lp, buf); lpp_set_factor_fast(ienv->lp, cst_idx, root_idx, 1.0); lpp_set_factor_fast(ienv->lp, cst_idx, arg_idx, -1.0); @@ -189,20 +280,24 @@ static void build_affinity_cstr(ilp_env_t *ienv) { /** * Helping stuff for build_clique_star_cstr */ -typedef struct _edge_t { - ir_node *n1, *n2; +typedef struct edge_t { + ir_node *n1; + ir_node *n2; } edge_t; -static int compare_edge_t(const void *k1, const void *k2, size_t size) { - const edge_t *e1 = k1; - const edge_t *e2 = k2; +static int compare_edge_t(const void *k1, const void *k2, size_t size) +{ + const edge_t *e1 = (const edge_t*)k1; + const edge_t *e2 = (const edge_t*)k2; + (void) size; - return ! (e1->n1 == e2->n1 && e1->n2 == e2->n2); + return ! (e1->n1 == e2->n1 && e1->n2 == e2->n2); } -#define HASH_EDGE(e) (HASH_PTR((e)->n1) ^ HASH_PTR((e)->n2)) +#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, size_t *counter) +{ edge_t new_edge; if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) { @@ -213,10 +308,11 @@ static INLINE edge_t *add_edge(set *edges, ir_node *n1, ir_node *n2, int *counte new_edge.n2 = n1; } (*counter)++; - return set_insert(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge)); + return set_insert(edge_t, 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)) { @@ -226,10 +322,11 @@ static INLINE edge_t *find_edge(set *edges, ir_node *n1, ir_node *n2) { new_edge.n1 = n2; new_edge.n2 = n1; } - return set_find(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge)); + return set_find(edge_t, 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, size_t *counter) +{ edge_t new_edge, *e; if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) { @@ -239,7 +336,7 @@ static INLINE void remove_edge(set *edges, ir_node *n1, ir_node *n2, int *counte new_edge.n1 = n2; new_edge.n2 = n1; } - e = set_find(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge)); + e = set_find(edge_t, edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge)); if (e) { e->n1 = NULL; e->n2 = NULL; @@ -247,24 +344,26 @@ static INLINE void remove_edge(set *edges, ir_node *n1, ir_node *n2, int *counte } } -#define pset_foreach(pset, irn) for(irn=pset_first(pset); irn; irn=pset_next(pset)) +#define pset_foreach(pset, irn) foreach_pset((pset), ir_node, (irn)) /** * 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) { - affinity_node_t *aff; - +static void build_clique_star_cstr(ilp_env_t *ienv) +{ /* 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; + int i, o, n_nodes; + size_t n_edges; + + if (arch_irn_is_ignore(aff->irn)) + continue; obstack_init(&ob); edges = new_set(compare_edge_t, 8); @@ -272,27 +371,33 @@ static void build_clique_star_cstr(ilp_env_t *ienv) { /* 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); + nodes = (ir_node**)obstack_finish(&ob); /* get all interference edges between these */ n_edges = 0; - for (i=0; ico->cenv->ifg, nodes[i], nodes[o])) add_edge(edges, nodes[i], nodes[o], &n_edges); + } + } /* cover all these interference edges with maximal cliques */ while (n_edges) { edge_t *e; - pset *clique = pset_new_ptr(8); - int growed; + pset *clique = pset_new_ptr(8); + bool 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(edge_t, edges); !e->n1; e = set_next(edge_t, edges)) {} + + /* we could be stepped out of the loop before the set iterated to the end */ + set_break(edges); pset_insert_ptr(clique, e->n1); pset_insert_ptr(clique, e->n2); @@ -300,22 +405,22 @@ static void build_clique_star_cstr(ilp_env_t *ienv) { /* while the clique is growing */ do { - growed = 0; + growed = false; /* search for a candidate to extend the clique */ for (i=0; ilp, NULL, lpp_greater, pset_count(clique)-1); - center_nr = get_irn_node_nr(center); + cst_idx = lpp_add_cst(ienv->lp, NULL, lpp_greater_equal, pset_count(clique)-1); pset_foreach(clique, member) { - member_nr = get_irn_node_nr(member); - var_idx = lpp_get_var_idx(ienv->lp, name_cdd_sorted(buf, 'y', center_nr, member_nr)); + make_affinity_var_name(buf, sizeof(buf), center, member); + var_idx = lpp_get_var_idx(ienv->lp, buf); lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1.0); } } @@ -359,47 +463,46 @@ static void build_clique_star_cstr(ilp_env_t *ienv) { } } - -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; affinity_node_t *aff; - neighb_t *nbr; /* do not walk backwards or in circles */ 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 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; ilp, name_cdd_sorted(buf, 'y', nr_1, nr_2)); + char buf[32]; + int var_idx; + + make_affinity_var_name(buf, sizeof(buf), curr_path[i-1], curr_path[i]); + var_idx = lpp_get_var_idx(ienv->lp, buf); lpp_set_factor_fast(ienv->lp, cst_idx, var_idx, 1.0); } } @@ -408,29 +511,25 @@ static void extend_path(ilp_env_t *ienv, pdeq *path, ir_node *irn) { goto end; } - - /* recursively extend the path */ aff = get_affinity_info(ienv->co, irn); - co_gs_foreach_neighb(aff, nbr) + co_gs_foreach_neighb(aff, nbr) { extend_path(ienv, path, nbr->irn); - + } end: /* remove the irn */ pdeq_getr(path); - } /** - * Search a path of affinity edges, whose ends are connected - * by an interference edge and there are no other interference - * edges in between. - * Then at least one of these affinity edges must break. + * Search a path of affinity edges, whose ends are connected + * by an interference edge and there are no other interference + * edges in between. + * Then at least one of these affinity edges must break. */ -static void build_path_cstr(ilp_env_t *ienv) { - affinity_node_t *aff_info; - +static void build_path_cstr(ilp_env_t *ienv) +{ /* for each node with affinity edges */ co_gs_foreach_aff_node(ienv->co, aff_info) { pdeq *path = new_pdeq(); @@ -441,11 +540,11 @@ static void build_path_cstr(ilp_env_t *ienv) { } } -static void ilp2_build(ilp_env_t *ienv) { - local_env_t *lenv = ienv->env; +static void ilp2_build(ilp_env_t *ienv) +{ 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); @@ -454,42 +553,46 @@ static void ilp2_build(ilp_env_t *ienv) { lower_bound = co_get_lower_bound(ienv->co) - co_get_inevit_copy_costs(ienv->co); lpp_set_bound(ienv->lp, lower_bound); - lpp_set_time_limit(ienv->lp, lenv->time_limit); } -static void ilp2_apply(ilp_env_t *ienv) { - local_env_t *lenv = ienv->env; - double *sol; - lpp_sol_state_t state; - int i, count; +static void ilp2_apply(ilp_env_t *ienv) +{ + local_env_t *lenv = (local_env_t*)ienv->env; + ir_graph *irg = ienv->co->irg; /* 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); + int i; - 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); - assert(state >= lpp_feasible && "The solution should at least be feasible!"); + printf("WARNING %s: Solution state is not 'optimal': %d\n", + ienv->co->name, (int)state); + if (state < lpp_feasible) { + panic("Copy coalescing solution not feasible!"); + } } for (i=0; i 1-EPSILON) { /* split variable name into components */ - lpp_get_var_name(ienv->lp, lenv->first_x_var+i, var_name, sizeof(var_name)); - - if (sscanf(var_name, "x_%d_%d", &nodenr, &color) == 2) { - ir_node *irn = pmap_get(lenv->nr_2_irn, INT_TO_PTR(nodenr)); - assert(irn && "This node number must be present in the map"); - - set_irn_col(ienv->co, irn, color); - } else - assert(0 && "This should be a x-var"); + unsigned nodenr; + unsigned color; + char var_name[32]; + if (sol[i] <= 1-EPSILON) + continue; + /* split variable name into components */ + lpp_get_var_name(ienv->lp, lenv->first_x_var+i, var_name, sizeof(var_name)); + + if (sscanf(var_name, "x_%u_%u", &nodenr, &color) == 2) { + ir_node *irn = get_idx_irn(irg, nodenr); + set_irn_col(ienv->co->cls, irn, color); + } else { + panic("This should be a x-var"); } } + + xfree(sol); } #ifdef COPYOPT_STAT @@ -501,33 +604,45 @@ static void ilp2_apply(ilp_env_t *ienv) { #endif } -int co_solve_ilp2(copy_opt_t *co, double time_limit) { +/** + * Solves the problem using mixed integer programming + * @returns 1 iff solution state was optimal + * Uses the OU and the GRAPH data structure + * Dependency of the OU structure can be removed + */ +static int co_solve_ilp2(copy_opt_t *co) +{ + unsigned n_regs = arch_register_class_n_regs(co->cls); lpp_sol_state_t sol_state; - ilp_env_t *ienv; - local_env_t my; + ilp_env_t *ienv; + local_env_t my; ASSERT_OU_AVAIL(co); //See build_clique_st ASSERT_GS_AVAIL(co); - my.time_limit = time_limit; my.first_x_var = -1; my.last_x_var = -1; - my.nr_2_irn = pmap_create(); - FIRM_DBG_REGISTER(my.dbg, "firm.be.coilp2"); + FIRM_DBG_REGISTER(dbg, "firm.be.coilp2"); + + unsigned *const allocatable_colors = rbitset_alloca(n_regs); + be_set_allocatable_regs(co->irg, co->cls, allocatable_colors); + my.allocatable_colors = allocatable_colors; ienv = new_ilp_env(co, ilp2_build, ilp2_apply, &my); sol_state = ilp_go(ienv); - pmap_destroy(my.nr_2_irn); free_ilp_env(ienv); return sol_state == lpp_optimal; } -#else /* WITH_ILP */ +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp2) +void be_init_copyilp2(void) +{ + static co_algo_info copyheur = { + co_solve_ilp2, 1 + }; -static void only_that_you_can_compile_without_WITH_ILP_defined(void) { + be_register_copyopt("ilp", ©heur); } - -#endif /* WITH_ILP */