X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyilp.c;h=dd79748b641d6f9587c5eb784cd2986be8c01941;hb=2814a774ee584b3c19ff3c87b3775ff46859b21e;hp=fcd1dba451e1e87685566e302e282945e9fa62a6;hpb=da48a7f7266cfe6274fc4d159d63bba245724222;p=libfirm diff --git a/ir/be/becopyilp.c b/ir/be/becopyilp.c index fcd1dba45..dd79748b6 100644 --- a/ir/be/becopyilp.c +++ b/ir/be/becopyilp.c @@ -1,18 +1,41 @@ -/** - * 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. + */ + +/** + * @file + * @brief Common stuff used by all ILP formulations. + * @author Daniel Grund + * @date 28.02.2006 + * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif /* HAVE_CONFIG_H */ + +#include "irtools.h" +#include "irprintf.h" #include "bestatevent.h" -#include "beirg_t.h" +#include "beirg.h" +#include "bemodule.h" +#include "error.h" + +#include "lc_opts.h" +#include "lc_opts_enum.h" #ifdef WITH_ILP @@ -22,11 +45,8 @@ static int time_limit = 60; static int solve_net = 1; static int solve_log = 0; -static int dump_flags = 0; +static unsigned dump_flags = 0; -#ifdef WITH_LIBCORE -#include -#include static const lc_opt_enum_mask_items_t dump_items[] = { { "ilp", DUMP_ILP }, { "sol", DUMP_SOL }, @@ -42,7 +62,7 @@ static const lc_opt_table_entry_t options[] = { 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 }; void be_init_copyilp(void) @@ -57,8 +77,6 @@ void be_init_copyilp(void) } BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp); -#endif /* WITH_LIBCORE */ - #include "becopyilp_t.h" #include "beifg_t.h" @@ -75,7 +93,7 @@ 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 *res = XMALLOC(size_red_t); res->co = co; res->all_removed = pset_new_ptr_default(); @@ -88,19 +106,20 @@ 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 int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) +{ + be_ifg_t *ifg = sr->co->cenv->ifg; + void *iter = be_ifg_neighbours_iter_alloca(ifg); + 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) 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->aenv, &req, irn, -1); + const arch_register_req_t *req = arch_get_register_req_out(irn); - 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)); + 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 = OALLOC(&sr->ob, coloring_suffix_t); cs->irn = irn; cs->next = sr->col_suff; @@ -136,10 +153,9 @@ void sr_remove(size_red_t *sr) { pset_insert_ptr(sr->all_removed, irn); redo = 1; - } + } } } - be_ifg_nodes_break(ifg, iter); } } @@ -160,9 +176,8 @@ void sr_reinsert(size_red_t *sr) { 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)); + bitset_set(used_cols, get_irn_col(other)); } - be_ifg_neighbours_break(ifg, iter); /* now all bits not set are possible colors */ free_col = bitset_next_clear(used_cols, 0); @@ -191,8 +206,7 @@ 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 *res = XMALLOC(ilp_env_t); res->co = co; res->build = build; @@ -230,7 +244,15 @@ lpp_sol_state_t ilp_go(ilp_env_t *ienv) { be_stat_ev_dbl("co_ilp_sol_time", ienv->lp->sol_time); if(dump_flags & DUMP_ILP) { - FILE *f = be_chordal_open(ienv->co->cenv, "", "-co.ilp"); + char buf[128]; + FILE *f; + + ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", ienv->co->cenv->irg, + ienv->co->cenv->cls->name); + f = fopen(buf, "wt"); + if(f == NULL) { + panic("Couldn't open '%s' for writing", buf); + } lpp_dump_plain(ienv->lp, f); fclose(f); } @@ -250,7 +272,7 @@ void free_ilp_env(ilp_env_t *ienv) { #else /* WITH_ILP */ -static INLINE void only_that_you_can_compile_without_WITH_ILP_defined(void) { +static inline void only_that_you_can_compile_without_WITH_ILP_defined(void) { } #endif /* WITH_ILP */