X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyheur.c;h=1dfb38f878367304eaaba3e1dcd432aaa3a7a2af;hb=4d7a9507baf1737297cd4f7fc91eab209fd5d398;hp=bf75e77f5f8a28c361ce19e3a6d9b36e415349d7;hpb=73567efae10b02832d0d1817eba56ecc96178424;p=libfirm diff --git a/ir/be/becopyheur.c b/ir/be/becopyheur.c index bf75e77f5..1dfb38f87 100644 --- a/ir/be/becopyheur.c +++ b/ir/be/becopyheur.c @@ -23,18 +23,20 @@ #include #endif +#include "debug.h" #include "xmalloc.h" -#include "becopyopt.h" +#include "becopyopt_t.h" #include "becopystat.h" #include "bitset.h" static firm_dbg_module_t *dbg = NULL; -#define SLOTS_PINNED_GLOBAL 256 +#define SEARCH_FREE_COLORS + +#define SLOTS_PINNED_GLOBAL 64 #define SLOTS_CONFLICTS 8 #define SLOTS_CHANGED_NODES 32 -#define MIN(a,b) ((aou->co->chordal_env, n1, n2)) + if (n1!=n2 && nodes_interfere(qn->ou->co->cenv, n1, n2)) return 1; /* search for recoloring conflicts */ if ((int)n1 < (int)n2) { @@ -156,6 +158,7 @@ static INLINE int qnode_get_new_color(const qnode_t *qn, ir_node *irn) { static INLINE void qnode_set_new_color(const qnode_t *qn, ir_node *irn, int color) { node_stat_t *found = qnode_find_or_insert_node(qn, irn); found->new_color = color; + DBG((dbg, LEVEL_3, "\t col(%+F) := %d\n", irn, color)); } /** @@ -178,8 +181,11 @@ static INLINE int qnode_is_pinned_local(const qnode_t *qn, ir_node *irn) { static INLINE void qnode_pin_local(const qnode_t *qn, ir_node *irn) { node_stat_t *found = qnode_find_or_insert_node(qn, irn); found->pinned_local = 1; + if (found->new_color == NO_COLOR) + found->new_color = get_irn_col(qn->ou->co, irn); } + /** * Possible return values of qnode_color_irn() */ @@ -191,144 +197,112 @@ static INLINE void qnode_pin_local(const qnode_t *qn, ir_node *irn) { * Performs virtual re-coloring of node @p n to color @p col. Virtual colors of * other nodes are changed too, as required to preserve correctness. Function is * aware of local and global pinning. Recursive. - * @param irn The node to set the color for - * @param col The color to set + * + * If irn == trigger the color @p col must be used. (the first recoloring) + * If irn != trigger an arbitrary free color may be used. If no color is free, @p col is used. + * + * @param irn The node to set the color for + * @param col The color to set * @param trigger The irn that caused the wish to change the color of the irn + * External callers must call with trigger = irn + * * @return CHANGE_SAVE iff setting the color is possible, with all transitive effects. * CHANGE_IMPOSSIBLE iff conflicts with reg-constraintsis occured. * Else the first conflicting ir_node encountered is returned. * - * ASSUMPTION: Assumes that a life range of a single value can't be split into - * several smaller intervals where other values can live in between. - * This should be true in SSA. */ static ir_node *qnode_color_irn(const qnode_t *qn, ir_node *irn, int col, const ir_node *trigger) { - ir_node *res; - struct obstack confl_ob; - ir_node **confl, *cn; - int i, irn_col; - const be_chordal_env_t *chordal_env = qn->ou->co->chordal_env; - const arch_env_t *arch_env = get_arch_env(qn->ou->co); - const arch_register_class_t *cls = chordal_env->cls; - - DBG((dbg, LEVEL_3, "\t %+F \tcaused col(%+F) \t%2d --> %2d\n", trigger, irn, qnode_get_new_color(qn, irn), col)); - obstack_init(&confl_ob); - irn_col = qnode_get_new_color(qn, irn); + copy_opt_t *co = qn->ou->co; + const be_chordal_env_t *chordal_env = co->cenv; + const arch_register_class_t *cls = co->cls; + const arch_env_t *arch_env = co->aenv; + int irn_col = qnode_get_new_color(qn, irn); + ir_node *sub_res, *curr; + be_ifg_t *ifg = chordal_env->ifg; + void *iter = be_ifg_neighbours_iter_alloca(ifg); + + DBG((dbg, LEVEL_3, "\t %+F \tcaused col(%+F) \t%2d --> %2d\n", trigger, irn, irn_col, col)); + + /* If the target color is already set do nothing */ if (irn_col == col) { - DBG((dbg, LEVEL_4, "\t Already same color.\n")); - goto ret_save; + DBG((dbg, LEVEL_3, "\t %+F same color\n", irn)); + return CHANGE_SAVE; } + + /* If the irn is pinned, changing color is impossible */ if (pset_find_ptr(pinned_global, irn) || qnode_is_pinned_local(qn, irn)) { - res = irn; - goto ret_confl; + DBG((dbg, LEVEL_3, "\t %+F conflicting\n", irn)); + return irn; } - if (!arch_reg_is_allocatable(arch_env, - irn, - -1, - arch_register_for_index(cls, col))) - goto ret_imposs; - - /* get all nodes which would conflict with this change */ - { - struct obstack q; - int in, out; - ir_node *irn_bl; - - irn_bl = get_nodes_block(irn); - - /* first check for a conflicting node which is 'living in' the irns block */ - { - ir_node *n; - pset *live_ins = put_live_in(irn_bl, pset_new_ptr_default()); - for (n = pset_first(live_ins); n; n = pset_next(live_ins)) { - DBG((dbg, LEVEL_4, "Checking %+F which is live-in at the block\n", n)); - if (arch_irn_has_reg_class(arch_env, n, -1, cls) - && n != trigger && qnode_get_new_color(qn, n) == col - && nodes_interfere(chordal_env, irn, n)) { - - DBG((dbg, LEVEL_4, "\t %+F\ttroubles\n", n)); - obstack_ptr_grow(&confl_ob, n); - pset_break(live_ins); - break; - } - } - del_pset(live_ins); + +#ifdef SEARCH_FREE_COLORS + /* If we resolve conflicts (recursive calls) we can use any unused color. + * In case of the first call @p col must be used. + */ + if (irn != trigger) { + bitset_t *free_cols = bitset_alloca(cls->n_regs); + arch_register_req_t req; + ir_node *curr; + int free_col; + + /* Get all possible colors */ + arch_put_non_ignore_regs(arch_env, cls, free_cols); + + /* Exclude colors not assignable to the irn */ + arch_get_register_req(arch_env, &req, irn, -1); + if (arch_register_req_is(&req, limited)) { + bitset_t *limited = bitset_alloca(cls->n_regs); + req.limited(req.limited_env, limited); + bitset_and(free_cols, limited); } - /* setup the queue of blocks. */ - obstack_init(&q); - obstack_ptr_grow(&q, irn_bl); - in = 1; - out = 0; - - /* process the queue. The code below checks for every block dominated - * by the irns one, and in which the irn is live, if there are - * conflicting nodes */ - while (out < in) { - ir_node *curr_bl, *sub_bl; - int i, max; - - curr_bl = ((ir_node **)obstack_base(&q))[out++]; - - /* Add to the result all nodes in the block, which have - * the target color and interfere with the irn */ - for (i = 0, max = get_irn_n_outs(curr_bl); i < max; ++i) { - ir_node *n = get_irn_out(curr_bl, i); - DBG((dbg, LEVEL_4, "Checking %+F defined in same block\n", n)); - if (arch_irn_has_reg_class(arch_env, n, -1, cls) - && n != trigger && qnode_get_new_color(qn, n) == col - && nodes_interfere(chordal_env, irn, n)) { - DBG((dbg, LEVEL_4, "\t %+F\ttroubles\n", n)); - obstack_ptr_grow(&confl_ob, n); - } - } + /* Exclude the color of the irn, because it must _change_ its color */ + bitset_clear(free_cols, irn_col); - /* If irn lives out check i-dominated blocks where the irn lives in */ - /* Fill the queue */ - if (is_live_out(curr_bl, irn)) { - dominates_for_each(curr_bl, sub_bl) - if (is_live_in(sub_bl, irn)) { - obstack_ptr_grow(&q, sub_bl); - in++; - } - } + /* Exclude all colors used by adjacent nodes */ + be_ifg_foreach_neighbour(ifg, iter, irn, curr) + bitset_clear(free_cols, qnode_get_new_color(qn, curr)); + + free_col = bitset_next_set(free_cols, 0); + + if (free_col != -1) { + qnode_set_new_color(qn, irn, free_col); + return CHANGE_SAVE; } - obstack_free(&q, NULL); - obstack_ptr_grow(&confl_ob, NULL); - confl = (ir_node **) obstack_finish(&confl_ob); } +#endif /* SEARCH_FREE_COLORS */ - /* process all nodes which would conflict with this change */ - for (i = 0, cn = confl[0]; cn; cn = confl[++i]) { - ir_node *sub_res; + /* If target color is not allocatable changing color is impossible */ + if (!arch_reg_is_allocatable(arch_env, irn, -1, arch_register_for_index(cls, col))) { + DBG((dbg, LEVEL_3, "\t %+F impossible\n", irn)); + return CHANGE_IMPOSSIBLE; + } - /* try to color the conflicting node cn with the color of the irn itself */ - sub_res = qnode_color_irn(qn, cn, irn_col, irn); - if (sub_res != CHANGE_SAVE) { - res = sub_res; - goto ret_confl; + /* + * If we arrive here changing color may be possible, but there may be conflicts. + * Try to color all conflicting nodes 'curr' with the color of the irn itself. + */ + be_ifg_foreach_neighbour(ifg, iter, irn, curr) { + DBG((dbg, LEVEL_3, "\t Confl %+F(%d)\n", curr, qnode_get_new_color(qn, curr))); + if (qnode_get_new_color(qn, curr) == col && curr != trigger) { + sub_res = qnode_color_irn(qn, curr, irn_col, irn); + if (sub_res != CHANGE_SAVE) { + be_ifg_neighbours_break(ifg, iter); + return sub_res; + } } } - /* if we arrive here all sub changes can be applied, so it's save to change this irn */ -ret_save: - DBG((dbg, LEVEL_3, "\t %+F save\n", irn)); - obstack_free(&confl_ob, NULL); + /* + * If we arrive here, all conflicts were resolved. + * So it is save to change this irn + */ qnode_set_new_color(qn, irn, col); return CHANGE_SAVE; - -ret_imposs: - DBG((dbg, LEVEL_3, "\t %+F impossible\n", irn)); - obstack_free(&confl_ob, NULL); - return CHANGE_IMPOSSIBLE; - -ret_confl: - DBG((dbg, LEVEL_3, "\t %+F conflicting\n", irn)); - obstack_free(&confl_ob, NULL); - return res; } + /** * Tries to set the colors for all members of this queue node; * to the target color qn->color @@ -377,21 +351,6 @@ static int qnode_try_color(const qnode_t *qn) { return 1; } -typedef int(*confl_f)(const ir_node *a, const ir_node *b, void *data); - -/** - * @param result Gets filled with the computed maximum independent set. - * @param count The size of input arrays / the number of nodes - * @param nodes A set of nodes to copmute the max. ind. set for - * @param weights Weights associated to the nodes in @p nodes - * @param confl Callback function to decide if two values interfere - * @param data Passed into all callbacks - * @return The size of the computed set - */ -//int max_ind_set(ir_node **result, int count, ir_node **nodes, int *weights, confl_f confl, void *data) { -// -//} - /** * Determines a maximum weighted independent set with respect to * the interference and conflict edges of all nodes in a qnode. @@ -437,7 +396,7 @@ static INLINE void qnode_max_ind_set(qnode_t *qn, const unit_t *ou) { best = bitset_alloca(unsafe_count); if (unsafe_count > MIS_HEUR_TRIGGER) { - /* Heuristik: Greedy trial and error form index 0 to unsafe_count-1 */ + /* Heuristic: Greedy trial and error form index 0 to unsafe_count-1 */ for (i=0; ico->chordal_env->cls->n_regs); + const arch_env_t *aenv = ou->co->aenv; + const arch_register_class_t *cls = ou->co->cls; + bitset_t *pos_regs = bitset_alloca(cls->n_regs); + bitset_t *ign_regs = bitset_alloca(cls->n_regs); DBG((dbg, LEVEL_1, "\tOptimizing unit:\n")); for (i=0; inode_count; ++i) @@ -556,7 +518,14 @@ static void ou_optimize(unit_t *ou) { /* init queue */ INIT_LIST_HEAD(&ou->queue); - arch_get_allocatable_regs(get_arch_env(ou->co), ou->nodes[0], -1, ou->co->chordal_env->cls, pos_regs); + + arch_get_allocatable_regs(aenv, ou->nodes[0], -1, pos_regs); + + /* exclude ingore colors */ + arch_put_non_ignore_regs(aenv, cls, ign_regs); + bitset_and(pos_regs, ign_regs); + + /* create new qnode */ bitset_foreach(pos_regs, i) ou_insert_qnode(ou, new_qnode(ou, i)); @@ -570,6 +539,7 @@ static void ou_optimize(unit_t *ou) { /* try */ if (qnode_try_color(curr)) break; + /* no success, so re-insert */ del_set(curr->changed_nodes); curr->changed_nodes = new_set(set_cmp_node_stat_t, SLOTS_CHANGED_NODES); @@ -579,13 +549,14 @@ static void ou_optimize(unit_t *ou) { /* apply the best found qnode */ if (curr->mis_size >= 2) { node_stat_t *ns; + int root_col = qnode_get_new_color(curr, ou->nodes[0]); DBG((dbg, LEVEL_1, "\t Best color: %d Costs: %d << %d << %d\n", curr->color, ou->min_nodes_costs, ou->all_nodes_costs - curr->mis_costs, ou->all_nodes_costs)); /* globally pin root and all args which have the same color */ pset_insert_ptr(pinned_global, ou->nodes[0]); for (i=1; inode_count; ++i) { ir_node *irn = ou->nodes[i]; int nc = qnode_get_new_color(curr, irn); - if (nc != NO_COLOR && nc == qnode_get_new_color(curr, ou->nodes[0])) + if (nc != NO_COLOR && nc == root_col) pset_insert_ptr(pinned_global, irn); } @@ -597,10 +568,6 @@ static void ou_optimize(unit_t *ou) { set_irn_col(ou->co, ns->irn, ns->new_color); } } - /* - * Enable for checking register allocation after each ou - * be_ra_chordal_check(ou->co->chordal_env); - */ } /* free best qnode (curr) and queue */ @@ -609,13 +576,9 @@ static void ou_optimize(unit_t *ou) { free_qnode(curr); } -void co_heur_opt(copy_opt_t *co) { +int co_solve_heuristic(copy_opt_t *co) { unit_t *curr; dbg = firm_dbg_register("ir.be.copyoptheur"); - if (!strcmp(co->name, DEBUG_IRG)) - firm_dbg_set_mask(dbg, DEBUG_IRG_LVL_HEUR); - else - firm_dbg_set_mask(dbg, DEBUG_LVL_HEUR); pinned_global = pset_new_ptr(SLOTS_PINNED_GLOBAL); list_for_each_entry(unit_t, curr, &co->units, units) @@ -623,4 +586,6 @@ void co_heur_opt(copy_opt_t *co) { ou_optimize(curr); del_pset(pinned_global); + + return 0; }