X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyilp.c;h=b4242fe2b75d543e8bfb0a2cf064eb85b50210ee;hb=f2c2e45eb4e677fef5bf6a8e418b2a22441172d5;hp=b42cad0e72a8d5251331a89e0cdb775c40e682eb;hpb=d6768d8d4427959eb045aafb1d15bd189beaa5dd;p=libfirm diff --git a/ir/be/becopyilp.c b/ir/be/becopyilp.c index b42cad0e7..b4242fe2b 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. * @@ -24,9 +24,7 @@ * @date 28.02.2006 * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif /* HAVE_CONFIG_H */ #include "irtools.h" #include "irprintf.h" @@ -36,8 +34,8 @@ #include "bemodule.h" #include "error.h" -#include -#include +#include "lc_opts.h" +#include "lc_opts_enum.h" #ifdef WITH_ILP @@ -64,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) @@ -95,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(); @@ -108,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, 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)) { + if (sr_is_simplicial(sr, irn)) { coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs)); cs->irn = irn; @@ -156,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); } } @@ -180,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); @@ -211,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; @@ -278,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 */