X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyheur2.c;h=8f257c005a2de4b41fbf6005d1cd2bd5cb4f2b60;hb=f2c2e45eb4e677fef5bf6a8e418b2a22441172d5;hp=780974af4d6cc6073bb0777e6f36eff541e4e970;hpb=48f893878b07f6e334389ff52abda5cc2adbf179;p=libfirm diff --git a/ir/be/becopyheur2.c b/ir/be/becopyheur2.c index 780974af4..8f257c005 100644 --- a/ir/be/becopyheur2.c +++ b/ir/be/becopyheur2.c @@ -1,18 +1,33 @@ +/* + * 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. + */ /** - * More experiments on coalescing. - * @author Sebastian Hack - * @date 14.04.2006 + * @file + * @brief More experiments on coalescing. + * @author Sebastian Hack + * @date 14.04.2006 + * @version $Id$ */ - -#ifdef HAVE_CONFIG_H #include "config.h" -#endif -#ifdef WITH_LIBCORE -#include -#include -#endif /* WITH_LIBCORE */ +#include "lc_opts.h" +#include "lc_opts_enum.h" #include #include @@ -20,6 +35,7 @@ #include "list.h" #include "pdeq.h" #include "bitset.h" +#include "raw_bitset.h" #include "debug.h" #include "bitfiddle.h" @@ -30,24 +46,23 @@ #include "irprintf.h" #include "irtools.h" +#include "bemodule.h" #include "beabi.h" #include "benode_t.h" #include "becopyopt.h" #include "becopyopt_t.h" #include "bechordal_t.h" +#include "beirg_t.h" #define DUMP_BEFORE 1 #define DUMP_AFTER 2 #define DUMP_CLOUD 4 #define DUMP_ALL 2 * DUMP_CLOUD - 1 -static int dump_flags = 0; -static int subtree_iter = 4; -static int max_depth = 20; -static double constr_factor = 0.9; - -/* Options using libcore */ -#ifdef WITH_LIBCORE +static unsigned dump_flags = 0; +static int subtree_iter = 4; +static int max_depth = 20; +static double constr_factor = 0.9; static const lc_opt_enum_mask_items_t dump_items[] = { { "before", DUMP_BEFORE }, @@ -62,19 +77,24 @@ static lc_opt_enum_mask_var_t dump_var = { }; static const lc_opt_table_entry_t options[] = { - LC_OPT_ENT_ENUM_MASK("dump", "dump ifg before, after or after each cloud", &dump_var), - LC_OPT_ENT_INT ("iter", "iterations for subtree nodes (standard: 3)", &subtree_iter), + LC_OPT_ENT_ENUM_MASK("dump", "dump ifg cloud", &dump_var), + LC_OPT_ENT_INT ("iter", "iterations for subtree nodes", &subtree_iter), LC_OPT_ENT_DBL ("cf", "factor of constraint importance (between 0.0 and 1.0)", &constr_factor), - LC_OPT_ENT_INT ("max", "maximum recursion depth (default 20)", &max_depth), - { NULL } + LC_OPT_ENT_INT ("max", "maximum recursion depth", &max_depth), + LC_OPT_LAST }; -void be_co2_register_options(lc_opt_entry_t *grp) +void be_init_copyheur2(void) { - lc_opt_entry_t *co2_grp = lc_opt_get_grp(grp, "co2"); + lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); + lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra"); + lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal"); + lc_opt_entry_t *co2_grp = lc_opt_get_grp(chordal_grp, "co2"); + lc_opt_add_table(co2_grp, options); } -#endif + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyheur2); /* ____ _ _ @@ -101,7 +121,7 @@ typedef struct { } col_cost_pair_t; typedef struct { - phase_t ph; + ir_phase ph; copy_opt_t *co; bitset_t *ignore_regs; co2_irn_t *touched; @@ -112,7 +132,7 @@ typedef struct { } co2_t; struct _co2_irn_t { - ir_node *irn; + const ir_node *irn; affinity_node_t *aff; co2_irn_t *touched_next; col_t tmp_col; @@ -172,7 +192,7 @@ typedef struct { #define get_co2_irn(co2, irn) ((co2_irn_t *) phase_get_or_set_irn_data(&co2->ph, irn)) #define get_co2_cloud_irn(co2, irn) ((co2_cloud_irn_t *) phase_get_or_set_irn_data(&co2->ph, irn)) -static void *co2_irn_init(phase_t *ph, ir_node *irn, void *data) +static void *co2_irn_init(ir_phase *ph, const ir_node *irn, void *data) { co2_t *env = (co2_t *) ph; affinity_node_t *a = get_affinity_info(env->co, irn); @@ -182,7 +202,7 @@ static void *co2_irn_init(phase_t *ph, ir_node *irn, void *data) memset(ci, 0, size); INIT_LIST_HEAD(&ci->changed_list); ci->touched_next = env->touched; - ci->orig_col = get_irn_col(env->co, irn); + ci->orig_col = get_irn_col(irn); env->touched = ci; ci->irn = irn; ci->aff = a; @@ -200,8 +220,8 @@ static void *co2_irn_init(phase_t *ph, ir_node *irn, void *data) static int cmp_clouds_gt(const void *a, const void *b) { - const co2_cloud_t **p = a; - const co2_cloud_t **q = b; + const co2_cloud_t * const *p = a; + const co2_cloud_t * const *q = b; double c = CLOUD_WEIGHT(*p); double d = CLOUD_WEIGHT(*q); return QSORT_CMP(d, c); @@ -227,29 +247,35 @@ int cmp_edges(const void *a, const void *b) return QSORT_CMP(q->costs, p->costs); } -static col_t get_col(co2_t *env, ir_node *irn) +static col_t get_col(co2_t *env, const ir_node *irn) { co2_irn_t *ci = get_co2_irn(env, irn); return ci->tmp_fixed ? ci->tmp_col : ci->orig_col; } -static INLINE int color_is_fix(co2_t *env, ir_node *irn) +static inline int color_is_fix(co2_t *env, const ir_node *irn) { co2_irn_t *ci = get_co2_irn(env, irn); return ci->fixed || ci->tmp_fixed; } -static INLINE bitset_t *get_adm(co2_t *env, co2_irn_t *ci) +static inline bitset_t *get_adm(co2_t *env, co2_irn_t *ci) { - if(!ci->adm_cache) { - arch_register_req_t req; + if(ci->adm_cache == NULL) { + const arch_register_req_t *req; ci->adm_cache = bitset_obstack_alloc(phase_obst(&env->ph), env->n_regs); - arch_get_register_req(env->co->aenv, &req, ci->irn, BE_OUT_POS(0)); - if(arch_register_req_is(&req, limited)) { - req.limited(req.limited_env, ci->adm_cache); + req = arch_get_register_req_out(ci->irn); + + if(arch_register_req_is(req, limited)) { + int i, n; + + n = env->n_regs; + for(i = 0; i < n; ++i) { + if(rbitset_is_set(req->limited, i)) + bitset_set(ci->adm_cache, i); + } ci->is_constrained = 1; - } - else { + } else { bitset_copy(ci->adm_cache, env->ignore_regs); bitset_flip_all(ci->adm_cache); } @@ -258,40 +284,39 @@ static INLINE bitset_t *get_adm(co2_t *env, co2_irn_t *ci) return ci->adm_cache; } -static INLINE bitset_t *admissible_colors(co2_t *env, co2_irn_t *ci, bitset_t *bs) +static inline bitset_t *admissible_colors(co2_t *env, co2_irn_t *ci, bitset_t *bs) { bitset_copy(bs, get_adm(env, ci)); return bs; } -static INLINE int is_color_admissible(co2_t *env, co2_irn_t *ci, col_t col) +static inline int is_color_admissible(co2_t *env, co2_irn_t *ci, col_t col) { bitset_t *bs = get_adm(env, ci); return bitset_is_set(bs, col); } -static INLINE int is_constrained(co2_t *env, co2_irn_t *ci) +static inline int is_constrained(co2_t *env, co2_irn_t *ci) { if(!ci->adm_cache) get_adm(env, ci); return ci->is_constrained; } -static void incur_constraint_costs(co2_t *env, ir_node *irn, col_cost_pair_t *col_costs, int costs) +static void incur_constraint_costs(co2_t *env, const ir_node *irn, col_cost_pair_t *col_costs, int costs) { - bitset_t *aux = bitset_alloca(env->co->cls->n_regs); - arch_register_req_t req; - - arch_get_register_req(env->co->aenv, &req, irn, BE_OUT_POS(0)); + const arch_register_req_t *req = arch_get_register_req_out(irn); - if(arch_register_req_is(&req, limited)) { - bitset_pos_t elm; - int n_constr; + if (arch_register_req_is(req, limited)) { + unsigned n_regs = env->co->cls->n_regs; + unsigned n_constr = 0; + unsigned i; - req.limited(req.limited_env, aux); - n_constr = bitset_popcnt(aux); - bitset_foreach(aux, elm) { - col_costs[elm].costs = add_saturated(col_costs[elm].costs, costs / n_constr); + n_constr = rbitset_popcnt(req->limited, n_regs); + for (i = 0; i < n_regs; ++i) { + if (rbitset_is_set(req->limited, i)) { + col_costs[i].costs = add_saturated(col_costs[i].costs, costs / n_constr); + } } } } @@ -308,14 +333,14 @@ static void incur_constraint_costs(co2_t *env, ir_node *irn, col_cost_pair_t *co */ static void determine_color_costs(co2_t *env, co2_irn_t *ci, col_cost_pair_t *col_costs) { - ir_node *irn = ci->irn; + const ir_node *irn = ci->irn; be_ifg_t *ifg = env->co->cenv->ifg; int n_regs = env->co->cls->n_regs; bitset_t *forb = bitset_alloca(n_regs); affinity_node_t *a = ci->aff; bitset_pos_t elm; - ir_node *pos; + const ir_node *pos; void *it; int i; @@ -371,6 +396,7 @@ static void single_color_cost(co2_t *env, co2_irn_t *ci, col_t col, col_cost_pai seq[i].costs = INT_MAX; } + (void) ci; assert(is_color_admissible(env, ci, col)); seq[col].col = 0; seq[0].col = col; @@ -395,15 +421,14 @@ static void materialize_coloring(struct list_head *h) } } -static int change_color_not(co2_t *env, ir_node *irn, col_t not_col, struct list_head *parent_changed, int depth); +static int change_color_not(co2_t *env, const ir_node *irn, col_t not_col, struct list_head *parent_changed, int depth); -static int recolor(co2_t *env, ir_node *irn, col_cost_pair_t *col_list, struct list_head *parent_changed, int depth) +static int recolor(co2_t *env, const ir_node *irn, col_cost_pair_t *col_list, struct list_head *parent_changed, int depth) { int n_regs = env->co->cls->n_regs; be_ifg_t *ifg = env->co->cenv->ifg; co2_irn_t *ci = get_co2_irn(env, irn); int res = 0; - int n_aff = 0; int i; @@ -416,7 +441,7 @@ static int recolor(co2_t *env, ir_node *irn, col_cost_pair_t *col_list, struct l int neigh_ok = 1; struct list_head changed; - ir_node *n; + const ir_node *n; void *it; DBG((env->dbg, LEVEL_3, "\t\t%2{firm:indent}trying color %d(%d) on %+F\n", depth, tgt_col, costs, irn)); @@ -483,7 +508,7 @@ static int recolor(co2_t *env, ir_node *irn, col_cost_pair_t *col_list, struct l return res; } -static int change_color_not(co2_t *env, ir_node *irn, col_t not_col, struct list_head *parent_changed, int depth) +static int change_color_not(co2_t *env, const ir_node *irn, col_t not_col, struct list_head *parent_changed, int depth) { co2_irn_t *ci = get_co2_irn(env, irn); int res = 0; @@ -505,7 +530,7 @@ static int change_color_not(co2_t *env, ir_node *irn, col_t not_col, struct list /* The node has the color it should not have _and_ has not been visited yet. */ if(!color_is_fix(env, irn)) { int n_regs = env->co->cls->n_regs; - col_cost_pair_t *csts = alloca(n_regs * sizeof(csts[0])); + col_cost_pair_t *csts = ALLOCAN(col_cost_pair_t, n_regs); /* Get the costs for giving the node a specific color. */ determine_color_costs(env, ci, csts); @@ -524,7 +549,7 @@ static int change_color_not(co2_t *env, ir_node *irn, col_t not_col, struct list return res; } -static int change_color_single(co2_t *env, ir_node *irn, col_t tgt_col, struct list_head *parent_changed, int depth) +static int change_color_single(co2_t *env, const ir_node *irn, col_t tgt_col, struct list_head *parent_changed, int depth) { co2_irn_t *ci = get_co2_irn(env, irn); col_t col = get_col(env, irn); @@ -546,7 +571,7 @@ static int change_color_single(co2_t *env, ir_node *irn, col_t tgt_col, struct l if(!color_is_fix(env, irn) && is_color_admissible(env, ci, tgt_col)) { int n_regs = env->co->cls->n_regs; - col_cost_pair_t *seq = alloca(n_regs * sizeof(seq[0])); + col_cost_pair_t *seq = ALLOCAN(col_cost_pair_t, n_regs); /* Get the costs for giving the node a specific color. */ single_color_cost(env, ci, tgt_col, seq); @@ -602,7 +627,7 @@ static void node_color_badness(co2_cloud_irn_t *ci, int *badness) bitset_t *bs = bitset_alloca(n_regs); bitset_pos_t elm; - ir_node *irn; + const ir_node *irn; void *it; admissible_colors(env, &ci->inh, bs); @@ -671,9 +696,9 @@ static void unfix_subtree(co2_cloud_irn_t *ci) static int coalesce_top_down(co2_cloud_irn_t *ci, int child_nr, int depth) { co2_t *env = ci->cloud->env; - col_cost_pair_t *seq = alloca(env->n_regs * sizeof(seq[0])); + col_cost_pair_t *seq = ALLOCAN(col_cost_pair_t, env->n_regs); int is_root = ci->mst_parent == ci; - col_t parent_col = is_root ? -1 : get_col(env, ci->mst_parent->inh.irn); + col_t parent_col = is_root ? (col_t) -1 : get_col(env, ci->mst_parent->inh.irn); int min_badness = INT_MAX; int best_col_costs = INT_MAX; int best_col = -1; @@ -703,7 +728,6 @@ static int coalesce_top_down(co2_cloud_irn_t *ci, int child_nr, int depth) INIT_LIST_HEAD(&changed); for(i = 0; i < (best_col < 0 ? n_regs : n_iter); ++i) { col_t col = seq[i].col; - int costs = seq[i].costs; int add_cost = !is_root && col != parent_col ? ci->mst_costs : 0; int subtree_costs, sum_costs; @@ -834,7 +858,7 @@ static co2_cloud_t *new_cloud(co2_t *env, affinity_node_t *a) static void apply_coloring(co2_cloud_irn_t *ci, col_t col, int depth) { - ir_node *irn = ci->inh.irn; + const ir_node *irn = ci->inh.irn; int *front = FRONT_BASE(ci, col); int i, ok; struct list_head changed; @@ -864,16 +888,13 @@ static void process_cloud(co2_cloud_t *cloud) co2_t *env = cloud->env; int n_regs = env->n_regs; int n_edges = 0; - int *mst_edges = xmalloc(cloud->n_memb * cloud->n_memb * sizeof(mst_edges[0])); + int *mst_edges = XMALLOCNZ(int, cloud->n_memb * cloud->n_memb); pdeq *q; - struct list_head changed; edge_t *edges; int i; int best_col; - memset(mst_edges, 0, cloud->n_memb * cloud->n_memb * sizeof(mst_edges[0])); - /* Collect all edges in the cloud on an obstack and sort the increasingly */ obstack_init(&cloud->obst); for(i = 0; i < cloud->n_memb; ++i) { @@ -956,7 +977,7 @@ static void process_cloud(co2_cloud_t *cloud) DBG((env->dbg, LEVEL_3, "mst:\n")); for(i = 0; i < cloud->n_memb; ++i) { - co2_cloud_irn_t *ci = cloud->seq[i]; + DEBUG_ONLY(co2_cloud_irn_t *ci = cloud->seq[i]); DBG((env->dbg, LEVEL_3, "\t%+F -> %+F\n", ci->inh.irn, ci->mst_parent->inh.irn)); } @@ -1030,13 +1051,13 @@ static void process(co2_t *env) co2_cloud_irn_t *ci = get_co2_cloud_irn(env, a->irn); if(!ci->cloud) { - co2_cloud_t *cloud = new_cloud(env, a); + new_cloud(env, a); n_clouds++; } } i = 0; - clouds = xmalloc(n_clouds * sizeof(clouds[0])); + clouds = XMALLOCN(co2_cloud_t*, n_clouds); list_for_each_entry(co2_cloud_t, pos, &env->cloud_head, list) clouds[i++] = pos; qsort(clouds, n_clouds, sizeof(clouds[0]), cmp_clouds_gt); @@ -1056,7 +1077,8 @@ static void process(co2_t *env) FILE *f; ir_snprintf(buf, sizeof(buf), "ifg_%F_%s_cloud_%d.dot", env->co->irg, env->co->cls->name, i); - if(f = fopen(buf, "wt")) { + f = fopen(buf, "wt"); + if(f != NULL) { be_ifg_dump_dot(env->co->cenv->ifg, env->co->irg, f, &ifg_dot_cb, env); fclose(f); } @@ -1070,12 +1092,11 @@ static void process(co2_t *env) static void writeback_colors(co2_t *env) { - const arch_env_t *aenv = env->co->aenv; co2_irn_t *irn; for(irn = env->touched; irn; irn = irn->touched_next) { const arch_register_t *reg = arch_register_for_index(env->co->cls, irn->orig_col); - arch_set_irn_register(aenv, irn->irn, reg); + arch_set_irn_register((ir_node*)irn->irn, reg); } } @@ -1089,9 +1110,9 @@ static void writeback_colors(co2_t *env) |_| |___/ */ -static const char *get_dot_color_name(int col) +static const char *get_dot_color_name(size_t col) { - static const char *names[] = { + static const char *const names[] = { "blue", "red", "green", @@ -1125,15 +1146,14 @@ static const char *get_dot_color_name(int col) "palevioletred" }; - return col < sizeof(names)/sizeof(names[0]) ? names[col] : "white"; + return col < (sizeof(names)/sizeof(names[0])) ? names[col] : "white"; } -static const char *get_dot_shape_name(co2_t *env, co2_irn_t *ci) +static const char *get_dot_shape_name(co2_irn_t *ci) { - arch_register_req_t req; + const arch_register_req_t *req = arch_get_register_req_out(ci->irn); - arch_get_register_req(env->co->aenv, &req, ci->irn, BE_OUT_POS(0)); - if(arch_register_req_is(&req, limited)) + if(arch_register_req_is(req, limited)) return "diamond"; if(ci->fixed) @@ -1147,13 +1167,15 @@ static const char *get_dot_shape_name(co2_t *env, co2_irn_t *ci) static void ifg_dump_graph_attr(FILE *f, void *self) { + (void) self; fprintf(f, "overlay=false"); } static int ifg_is_dump_node(void *self, ir_node *irn) { - co2_t *env = self; - return !arch_irn_is(env->co->aenv, irn, ignore); + const arch_register_req_t *req = arch_get_register_req_out(irn); + (void)self; + return !(req->type & arch_register_req_type_ignore); } static void ifg_dump_node_attr(FILE *f, void *self, ir_node *irn) @@ -1170,11 +1192,11 @@ static void ifg_dump_node_attr(FILE *f, void *self, ir_node *irn) peri = 2; if(cci->cloud && cci->cloud->mst_root) - snprintf(buf, sizeof(buf), "%+F", cci->cloud->mst_root->inh.irn); + ir_snprintf(buf, sizeof(buf), "%+F", cci->cloud->mst_root->inh.irn); } ir_fprintf(f, "label=\"%+F%s\" style=filled peripheries=%d color=%s shape=%s", irn, buf, peri, - get_dot_color_name(get_col(env, irn)), get_dot_shape_name(env, ci)); + get_dot_color_name(get_col(env, irn)), get_dot_shape_name(ci)); } static void ifg_dump_at_end(FILE *file, void *self) @@ -1220,27 +1242,26 @@ static be_ifg_dump_dot_cb_t ifg_dot_cb = { }; -void co_solve_heuristic_new(copy_opt_t *co) +int co_solve_heuristic_new(copy_opt_t *co) { - char buf[256]; + char buf[256]; co2_t env; - FILE *f; + FILE *f; - phase_init(&env.ph, "co2", co->cenv->birg->irg, PHASE_DEFAULT_GROWTH, co2_irn_init); + phase_init(&env.ph, "co2", co->cenv->birg->irg, PHASE_DEFAULT_GROWTH, co2_irn_init, NULL); env.touched = NULL; env.visited = 0; env.co = co; env.n_regs = co->cls->n_regs; env.ignore_regs = bitset_alloca(co->cls->n_regs); - arch_put_non_ignore_regs(co->aenv, co->cls, env.ignore_regs); - bitset_flip_all(env.ignore_regs); - be_abi_put_ignore_regs(co->cenv->birg->abi, co->cls, env.ignore_regs); + be_put_ignore_regs(co->cenv->birg, co->cls, env.ignore_regs); FIRM_DBG_REGISTER(env.dbg, "firm.be.co2"); INIT_LIST_HEAD(&env.cloud_head); if(dump_flags & DUMP_BEFORE) { ir_snprintf(buf, sizeof(buf), "ifg_%F_%s_before.dot", co->irg, co->cls->name); - if(f = fopen(buf, "wt")) { + f = fopen(buf, "wt"); + if (f != NULL) { be_ifg_dump_dot(co->cenv->ifg, co->irg, f, &ifg_dot_cb, &env); fclose(f); } @@ -1250,7 +1271,8 @@ void co_solve_heuristic_new(copy_opt_t *co) if(dump_flags & DUMP_AFTER) { ir_snprintf(buf, sizeof(buf), "ifg_%F_%s_after.dot", co->irg, co->cls->name); - if(f = fopen(buf, "wt")) { + f = fopen(buf, "wt"); + if (f != NULL) { be_ifg_dump_dot(co->cenv->ifg, co->irg, f, &ifg_dot_cb, &env); fclose(f); } @@ -1258,4 +1280,5 @@ void co_solve_heuristic_new(copy_opt_t *co) writeback_colors(&env); phase_free(&env.ph); + return 0; }