X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyilp.c;h=340d97de53ac8e299aa56040e21dc596fb417a9a;hb=df2faee01a5832057bb3ca0ba5f67e979c916e19;hp=ad3953793e5746638a20f5f6f803e49a49e7b29c;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm diff --git a/ir/be/becopyilp.c b/ir/be/becopyilp.c index ad3953793..340d97de5 100644 --- a/ir/be/becopyilp.c +++ b/ir/be/becopyilp.c @@ -1,5 +1,5 @@ /* - * 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. * @@ -18,36 +18,32 @@ */ /** - * Author: Daniel Grund - * Date: 28.02.2006 - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. - * - * Common stuff used by all ILP fomulations. - * + * @file + * @brief Common stuff used by all ILP formulations. + * @author Daniel Grund + * @date 28.02.2006 */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif /* HAVE_CONFIG_H */ +#include + +#include "be_t.h" #include "irtools.h" #include "irprintf.h" -#include "bestatevent.h" -#include "beirg_t.h" +#include "statev_t.h" #include "bemodule.h" #include "error.h" -#include -#include +#include "lpp.h" -#ifdef WITH_ILP +#include "lc_opts.h" +#include "lc_opts_enum.h" #define DUMP_ILP 1 #define DUMP_SOL 2 static int time_limit = 60; -static int solve_net = 1; static int solve_log = 0; static unsigned dump_flags = 0; @@ -63,12 +59,12 @@ static lc_opt_enum_mask_var_t dump_var = { static const lc_opt_table_entry_t options[] = { LC_OPT_ENT_INT ("limit", "time limit for solving in seconds (0 for unlimited)", &time_limit), - LC_OPT_ENT_BOOL ("net", "solve over the net", &solve_net), LC_OPT_ENT_BOOL ("log", "show ilp solving log", &solve_log), LC_OPT_ENT_ENUM_MASK("dump", "dump flags", &dump_var), - { NULL } + LC_OPT_LAST }; +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp) void be_init_copyilp(void) { lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); @@ -80,10 +76,8 @@ void be_init_copyilp(void) lc_opt_add_table(ilp_grp, options); } -BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp); - #include "becopyilp_t.h" -#include "beifg_t.h" +#include "beifg.h" /****************************************************************************** _____ _ _ _ _ @@ -96,8 +90,9 @@ BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp); *****************************************************************************/ -size_red_t *new_size_red(copy_opt_t *co) { - size_red_t *res = xmalloc(sizeof(*res)); +size_red_t *new_size_red(copy_opt_t *co) +{ + size_red_t *res = XMALLOC(size_red_t); res->co = co; res->all_removed = pset_new_ptr_default(); @@ -110,91 +105,121 @@ size_red_t *new_size_red(copy_opt_t *co) { /** * Checks if a node is simplicial in the graph heeding the already removed nodes. */ -static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) { - int i, o, size = 0; - ir_node **all, *curr; - be_ifg_t *ifg = sr->co->cenv->ifg; - void *iter = be_ifg_neighbours_iter_alloca(ifg); - - all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all)); +static inline bool sr_is_simplicial(size_red_t *sr, const ir_node *ifn) +{ + be_ifg_t *ifg = sr->co->cenv->ifg; + neighbours_iter_t iter; + ir_node **all = ALLOCAN(ir_node*, be_ifg_degree(ifg, ifn)); + ir_node *curr; + int size = 0; + int i; + int o; /* get all non-removed neighbors */ - be_ifg_foreach_neighbour(ifg, iter, ifn, curr) + be_ifg_foreach_neighbour(ifg, &iter, ifn, curr) if (!sr_is_removed(sr, curr)) all[size++] = curr; - be_ifg_neighbours_break(ifg, iter); /* check if these form a clique */ for (i=0; ico->cenv->ifg; - void *iter = be_ifg_nodes_iter_alloca(ifg); + nodes_iter_t iter; while (redo) { - redo = 0; - be_ifg_foreach_node(ifg, iter, irn) { - const arch_register_req_t *req; - - req = arch_get_register_req(sr->co->aenv, irn, -1); - - if (!arch_register_req_is(req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) { - if (sr_is_simplicial(sr, irn)) { - coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs)); - - cs->irn = irn; - cs->next = sr->col_suff; - sr->col_suff = cs; - - pset_insert_ptr(sr->all_removed, irn); - - redo = 1; - } - } + redo = false; + be_ifg_foreach_node(ifg, &iter, irn) { + const arch_register_req_t *req = arch_get_irn_register_req(irn); + coloring_suffix_t *cs; + + if (arch_register_req_is(req, limited) || sr_is_removed(sr, irn)) + continue; + if (co_gs_is_optimizable(sr->co, irn)) + continue; + if (!sr_is_simplicial(sr, irn)) + continue; + + cs = OALLOC(&sr->ob, coloring_suffix_t); + cs->irn = irn; + cs->next = sr->col_suff; + sr->col_suff = cs; + + pset_insert_ptr(sr->all_removed, irn); + + redo = true; } - be_ifg_nodes_break(ifg, iter); } } -void sr_reinsert(size_red_t *sr) { +void sr_reinsert(size_red_t *sr) +{ coloring_suffix_t *cs; + ir_graph *irg = sr->co->irg; be_ifg_t *ifg = sr->co->cenv->ifg; - bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(sr->co->cls)); - void *iter = be_ifg_neighbours_iter_alloca(ifg); + unsigned n_regs = arch_register_class_n_regs(sr->co->cls); + + unsigned *const allocatable_cols = rbitset_alloca(n_regs); + be_set_allocatable_regs(irg, sr->co->cls, allocatable_cols); + + unsigned *const possible_cols = rbitset_alloca(n_regs); + neighbours_iter_t iter; /* color the removed nodes in right order */ for (cs = sr->col_suff; cs; cs = cs->next) { - int free_col; - ir_node *other, *irn; + unsigned free_col; + ir_node *other; + ir_node *irn = cs->irn; - /* get free color by inspecting all neighbors */ - irn = cs->irn; - bitset_clear_all(used_cols); + rbitset_copy(possible_cols, allocatable_cols, n_regs); - be_ifg_foreach_neighbour(ifg, iter, irn, other) { - if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */ - bitset_set(used_cols, get_irn_col(sr->co, other)); + /* get free color by inspecting all neighbors */ + be_ifg_foreach_neighbour(ifg, &iter, irn, other) { + const arch_register_req_t *cur_req; + unsigned cur_col; + + /* only inspect nodes which are in graph right now */ + if (sr_is_removed(sr, other)) + continue; + + cur_req = arch_get_irn_register_req(other); + cur_col = get_irn_col(other); + + /* Invalidate all single size register when it is a large one */ + do { + rbitset_clear(possible_cols, cur_col); + ++cur_col; + } while ((cur_col % cur_req->width) != 0); } - be_ifg_neighbours_break(ifg, iter); /* now all bits not set are possible colors */ - free_col = bitset_next_clear(used_cols, 0); - assert(free_col != -1 && "No free color found. This can not be."); - set_irn_col(sr->co, irn, free_col); + /* take one that matches the alignment constraint */ + free_col = 0; + assert(!rbitset_is_empty(possible_cols, n_regs) && "No free color found. This can not be."); + while (true) { + free_col = (unsigned)rbitset_next(possible_cols, free_col, true); + if (free_col % arch_get_irn_register_req(irn)->width == 0) + break; + ++free_col; + assert(free_col < n_regs); + } + set_irn_col(sr->co->cls, irn, free_col); pset_remove_ptr(sr->all_removed, irn); /* irn is back in graph again */ } } -void free_size_red(size_red_t *sr) { +void free_size_red(size_red_t *sr) +{ del_pset(sr->all_removed); obstack_free(&sr->ob, NULL); free(sr); @@ -212,9 +237,9 @@ void free_size_red(size_red_t *sr) { #include -ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) { - ilp_env_t *res = xmalloc(sizeof(*res)); - assert(res); +ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) +{ + ilp_env_t *res = XMALLOC(ilp_env_t); res->co = co; res->build = build; @@ -225,46 +250,39 @@ ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, v return res; } -lpp_sol_state_t ilp_go(ilp_env_t *ienv) { - be_main_env_t *main_env = ienv->co->cenv->birg->main_env; +lpp_sol_state_t ilp_go(ilp_env_t *ienv) +{ + ir_graph *irg = ienv->co->irg; sr_remove(ienv->sr); ienv->build(ienv); - lpp_set_time_limit(ienv->lp, time_limit); - - if(solve_log) - lpp_set_log(ienv->lp, stdout); - - if(solve_net) - lpp_solve_net(ienv->lp, main_env->options->ilp_server, main_env->options->ilp_solver); - else { -#ifdef LPP_SOLVE_NET - fprintf(stderr, "can only solve ilp over the net\n"); -#else - lpp_solve_cplex(ienv->lp); -#endif - } - be_stat_ev_dbl("co_ilp_objval", ienv->lp->objval); - be_stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound); - be_stat_ev ("co_ilp_iter", ienv->lp->iterations); - be_stat_ev_dbl("co_ilp_sol_time", ienv->lp->sol_time); - - if(dump_flags & DUMP_ILP) { + if (dump_flags & DUMP_ILP) { char buf[128]; FILE *f; - ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", ienv->co->cenv->irg, + ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", irg, ienv->co->cenv->cls->name); f = fopen(buf, "wt"); - if(f == NULL) { + if (f == NULL) { panic("Couldn't open '%s' for writing", buf); } lpp_dump_plain(ienv->lp, f); fclose(f); } + lpp_set_time_limit(ienv->lp, time_limit); + if (solve_log) + lpp_set_log(ienv->lp, stdout); + + lpp_solve(ienv->lp, be_options.ilp_server, be_options.ilp_solver); + + //stat_ev_dbl("co_ilp_objval", ienv->lp->objval); + //stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound); + stat_ev_int("co_ilp_iter", lpp_get_iter_cnt(ienv->lp)); + stat_ev_dbl("co_ilp_sol_time", lpp_get_sol_time(ienv->lp)); + ienv->apply(ienv); sr_reinsert(ienv->sr); @@ -272,15 +290,9 @@ lpp_sol_state_t ilp_go(ilp_env_t *ienv) { return lpp_get_sol_state(ienv->lp); } -void free_ilp_env(ilp_env_t *ienv) { +void free_ilp_env(ilp_env_t *ienv) +{ free_size_red(ienv->sr); - free_lpp(ienv->lp); + lpp_free(ienv->lp); free(ienv); } - -#else /* WITH_ILP */ - -static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) { -} - -#endif /* WITH_ILP */