X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal.c;h=e084b8c5d53ed9a318d5162d63326e23c056df73;hb=3e2a1de2fc4b08ebd26778c1eac1a8bd9751d90f;hp=d172253592997cdd6a3535dd4b4154f4e69844e6;hpb=1631f8aca0f030511c4078f346e9a2117c8279b6;p=libfirm diff --git a/ir/be/bechordal.c b/ir/be/bechordal.c index d17225359..e084b8c5d 100644 --- a/ir/be/bechordal.c +++ b/ir/be/bechordal.c @@ -1,23 +1,30 @@ -/** - * Chordal register allocation. - * @author Sebastian Hack - * @date 8.12.2004 +/* + * 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. * - * Copyright (C) Universitaet Karlsruhe - * Released under the GPL + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ -#ifdef HAVE_CONFIG_H +/** + * @file + * @brief Chordal register allocation. + * @author Sebastian Hack + * @date 08.12.2004 + * @version $Id$ + */ #include "config.h" -#endif - -#ifdef HAVE_MALLOC_H -#include -#endif - -#ifdef HAVE_ALLOCA_H -#include -#endif #include @@ -25,8 +32,10 @@ #include "pset.h" #include "list.h" #include "bitset.h" +#include "raw_bitset.h" #include "iterator.h" #include "bipartite.h" +#include "hungarian.h" #include "irmode_t.h" #include "irgraph_t.h" @@ -34,145 +43,65 @@ #include "irgwalk.h" #include "irdump.h" #include "irdom.h" +#include "irtools.h" +#include "irbitset.h" #include "debug.h" -#include "xmalloc.h" +#include "iredges.h" #include "beutil.h" #include "besched.h" -#include "benumb_t.h" -#include "besched_t.h" +#include "besched.h" #include "belive_t.h" -#include "benode_t.h" +#include "benode.h" #include "bearch.h" #include "beirgmod.h" #include "beifg.h" #include "beinsn_t.h" - +#include "bestatevent.h" +#include "beirg.h" +#include "beintlive_t.h" +#include "bera.h" #include "bechordal_t.h" #include "bechordal_draw.h" +#include "bemodule.h" +#include "bearch.h" +#include "bechordal_common.h" -#define DBG_LEVEL SET_LEVEL_0 -#define DBG_LEVEL_CHECK SET_LEVEL_0 +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) #define NO_COLOR (-1) -#define MAX(x, y) ((x) > (y) ? (x) : (y)) -#define MIN(x, y) ((x) < (y) ? (x) : (y)) - #define DUMP_INTERVALS typedef struct _be_chordal_alloc_env_t { be_chordal_env_t *chordal_env; - pset *pre_colored; /**< Set of precolored nodes. */ - bitset_t *live; /**< A liveness bitset. */ - bitset_t *tmp_colors; /**< An auxiliary bitset which is as long as the number of colors in the class. */ - bitset_t *colors; /**< The color mask. */ - bitset_t *in_colors; /**< Colors used by live in values. */ - int colors_n; /**< The number of colors. */ - DEBUG_ONLY(firm_dbg_module_t *constr_dbg;) /**< Debug output for the constraint handler. */ + pset *pre_colored; /**< Set of precolored nodes. */ + bitset_t *live; /**< A liveness bitset. */ + bitset_t *tmp_colors; /**< An auxiliary bitset which is as long as the number of colors in the class. */ + bitset_t *colors; /**< The color mask. */ + bitset_t *in_colors; /**< Colors used by live in values. */ + int colors_n; /**< The number of colors. */ } be_chordal_alloc_env_t; -#include "fourcc.h" - -/* Make a fourcc for border checking. */ -#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D') - +#if 0 static void check_border_list(struct list_head *head) { - border_t *x; - list_for_each_entry(border_t, x, head, list) { - assert(x->magic == BORDER_FOURCC); - } + border_t *x; + list_for_each_entry(border_t, x, head, list) { + assert(x->magic == BORDER_FOURCC); + } } static void check_heads(be_chordal_env_t *env) { - pmap_entry *ent; - for(ent = pmap_first(env->border_heads); ent; ent = pmap_next(env->border_heads)) { - /* ir_printf("checking border list of block %+F\n", ent->key); */ - check_border_list(ent->value); - } -} - - -/** - * Add an interval border to the list of a block's list - * of interval border. - * @note You always have to create the use before the def. - * @param env The environment. - * @param head The list head to enqueue the borders. - * @param irn The node (value) the border belongs to. - * @param pressure The pressure at this point in time. - * @param step A time step for the border. - * @param is_def Is the border a use or a def. - * @return The created border. - */ -static INLINE border_t *border_add(be_chordal_env_t *env, struct list_head *head, - ir_node *irn, unsigned step, unsigned pressure, - unsigned is_def, unsigned is_real) -{ - border_t *b; - - if(!is_def) { - border_t *def; - - b = obstack_alloc(&env->obst, sizeof(*b)); - - /* also allocate the def and tie it to the use. */ - def = obstack_alloc(&env->obst, sizeof(*def)); - memset(def, 0, sizeof(*def)); - b->other_end = def; - def->other_end = b; - - /* - * Set the link field of the irn to the def. - * This strongly relies on the fact, that the use is always - * made before the def. - */ - set_irn_link(irn, def); - - b->magic = BORDER_FOURCC; - def->magic = BORDER_FOURCC; + pmap_entry *ent; + for (ent = pmap_first(env->border_heads); ent; ent = pmap_next(env->border_heads)) { + /* ir_printf("checking border list of block %+F\n", ent->key); */ + check_border_list(ent->value); } - - /* - * If the def is encountered, the use was made and so was the - * the def node (see the code above). It was placed into the - * link field of the irn, so we can get it there. - */ - else { - b = get_irn_link(irn); - - assert(b && b->magic == BORDER_FOURCC && "Illegal border encountered"); - } - - b->pressure = pressure; - b->is_def = is_def; - b->is_real = is_real; - b->irn = irn; - b->step = step; - list_add_tail(&b->list, head); - DBG((env->dbg, LEVEL_5, "\t\t%s adding %+F, step: %d\n", is_def ? "def" : "use", irn, step)); - - - return b; } - -/** - * Check, if an irn is of the register class currently under processing. - * @param env The chordal environment. - * @param irn The node. - * @return 1, if the node is of that register class, 0 if not. - */ -static INLINE int has_reg_class(const be_chordal_env_t *env, const ir_node *irn) -{ - // return arch_irn_has_reg_class(env->main_env->arch_env, irn, -1, env->cls); - return arch_irn_consider_in_reg_alloc(env->birg->main_env->arch_env, env->cls, irn); -} - -#define has_limited_constr(req, irn) \ - (arch_get_register_req(arch_env, (req), irn, -1) && (req)->type == arch_register_req_type_limited) +#endif static int get_next_free_reg(const be_chordal_alloc_env_t *alloc_env, bitset_t *colors) { @@ -186,366 +115,306 @@ static bitset_t *get_decisive_partner_regs(bitset_t *bs, const be_operand_t *o1, { bitset_t *res = bs; - if(!o1) { + if (!o1) { bitset_copy(bs, o2->regs); return bs; } - if(!o2) { + if (!o2) { bitset_copy(bs, o1->regs); return bs; } - assert(o1->req.cls == o2->req.cls); + assert(o1->req->cls == o2->req->cls || ! o1->req->cls || ! o2->req->cls); - if(bitset_contains(o1->regs, o2->regs)) + if (bitset_contains(o1->regs, o2->regs)) { bitset_copy(bs, o1->regs); - else if(bitset_contains(o2->regs, o1->regs)) + } else if (bitset_contains(o2->regs, o1->regs)) { bitset_copy(bs, o2->regs); - else + } else { res = NULL; + } return res; } -static be_insn_t *chordal_scan_insn(be_chordal_alloc_env_t *env, ir_node *irn) -{ - be_insn_env_t ie; - - ie.ignore_colors = env->chordal_env->ignore_colors; - ie.aenv = env->chordal_env->birg->main_env->arch_env; - ie.obst = &env->chordal_env->obst; - ie.cls = env->chordal_env->cls; - return be_scan_insn(&ie, irn); -} - static void pair_up_operands(const be_chordal_alloc_env_t *alloc_env, be_insn_t *insn) { const be_chordal_env_t *env = alloc_env->chordal_env; - - int n_uses = be_insn_n_uses(insn); - int n_defs = be_insn_n_defs(insn); - bitset_t *bs = bitset_alloca(env->cls->n_regs); - bipartite_t *bp = bipartite_new(n_defs, n_uses); - int *pairing = alloca(MAX(n_defs, n_uses) * sizeof(pairing[0])); - - int i, j; + bitset_t *bs = bitset_alloca(env->cls->n_regs); + int i; + int j; /* - For each out operand, try to find an in operand which can be assigned the - same register as the out operand. + * For each out operand, try to find an in operand which can be assigned the + * same register as the out operand. */ - for(j = 0; j < insn->use_start; ++j) { + for (j = 0; j < insn->use_start; ++j) { + int smallest = -1; + int smallest_n_regs = 2 * env->cls->n_regs + 1; be_operand_t *out_op = &insn->ops[j]; /* Try to find an in operand which has ... */ - for(i = insn->use_start; i < insn->n_ops; ++i) { + for (i = insn->use_start; i < insn->n_ops; ++i) { + int n_total; const be_operand_t *op = &insn->ops[i]; - /* - The in operand can only be paired with a def, if the node defining the - operand's value does not interfere with the instruction itself. That - would mean, that it is live at the instruction, so no result of the instruction - can have the same register as the operand. - - Furthermore, tow operands can be paired, if the admissible registers - of one are a subset of the other's. We record the operand whose constraints - count in the decisive array. - */ - if(!values_interfere(op->irn, op->carrier)) { - if(get_decisive_partner_regs(bs, out_op, op)) - bipartite_add(bp, j, i - insn->use_start); - } - } - } - - /* Compute the pairing. */ - bipartite_matching(bp, pairing); - for(i = 0; i < insn->use_start; ++i) { - int p = pairing[i] + insn->use_start; - - if(p >= insn->use_start) { - insn->ops[i].partner = &insn->ops[p]; - insn->ops[p].partner = &insn->ops[i]; - } - } - - bipartite_free(bp); -} - - -static ir_node *pre_process_constraints(be_chordal_alloc_env_t *alloc_env, be_insn_t **the_insn) -{ - be_chordal_env_t *env = alloc_env->chordal_env; - const arch_env_t *aenv = env->birg->main_env->arch_env; - be_insn_t *insn = *the_insn; - ir_node *bl = get_nodes_block(insn->irn); - ir_node *copy = NULL; - ir_node *perm = NULL; - bitset_t *out_constr = bitset_alloca(env->cls->n_regs); - bitset_t *bs = bitset_alloca(env->cls->n_regs); - DEBUG_ONLY(firm_dbg_module_t *dbg = alloc_env->constr_dbg;) - - int i; - - assert(insn->has_constraints && "only do this for constrained nodes"); + if (op->partner != NULL) + continue; + if (be_values_interfere(env->birg->lv, op->irn, op->carrier)) + continue; - /* - Collect all registers that occur in output constraints. - This is necessary, since if the insn has one of these as an input constraint - and the corresponding operand interferes with the insn, the operand must - be copied. - */ - for(i = 0; i < insn->use_start; ++i) { - be_operand_t *op = &insn->ops[i]; - if(op->has_constraints) - bitset_or(out_constr, op->regs); - } - - /* - Now, figure out which input operand must be copied since it has input - constraints which are also output constraints. - */ - for(i = insn->use_start; i < insn->n_ops; ++i) { - be_operand_t *op = &insn->ops[i]; - if(op->has_constraints && (values_interfere(op->carrier, insn->irn) || arch_irn_is(aenv, op->carrier, ignore))) { + bitset_clear_all(bs); bitset_copy(bs, op->regs); - bitset_and(bs, out_constr); - - /* - The operand (interfering with the node) has input constraints - which also occur as output constraints, so insert a copy. - */ - if(bitset_popcnt(bs) > 0) { - copy = be_new_Copy(op->req.cls, env->irg, bl, op->carrier); - insn->ops[i].carrier = copy; - sched_add_before(insn->irn, copy); - - DBG((dbg, LEVEL_2, "adding copy for interfering and constrained op %+F\n", op->carrier)); - } - } - } - - /* - Make the Perm, recompute liveness and re-scan the insn since the - in operands are now the Projs of the Perm. - */ - perm = insert_Perm_after(aenv, env->cls, env->dom_front, sched_prev(insn->irn)); - - /* Registers are propagated by insert_Perm_after(). Clean them here! */ - if(perm) { - const ir_edge_t *edge; + bitset_and(bs, out_op->regs); + n_total = bitset_popcnt(op->regs) + bitset_popcnt(out_op->regs); - foreach_out_edge(perm, edge) { - ir_node *proj = get_edge_src_irn(edge); - arch_set_irn_register(aenv, proj, NULL); + if (!bitset_is_empty(bs) && n_total < smallest_n_regs) { + smallest = i; + smallest_n_regs = n_total; + } } - /* - We also have to re-build the insn since the input operands are now the Projs of - the Perm. Recomputing liveness is also a good idea if a Perm is inserted, since - the live sets may change. - */ - be_liveness(env->irg); - obstack_free(&env->obst, insn); - *the_insn = insn = chordal_scan_insn(alloc_env, insn->irn); - - /* - Copy the input constraints of the insn to the Perm as output - constraints. Succeeding phases (coalescing will need that). - */ - for(i = insn->use_start; i < insn->n_ops; ++i) { - be_operand_t *op = &insn->ops[i]; - ir_node *proj = op->carrier; - /* - Note that the predecessor must not be a Proj of the Perm, - since ignore-nodes are not Perm'ed. - */ - if(op->has_constraints && is_Proj(proj) && get_Proj_pred(proj) == perm) { - be_set_constr_limited(perm, BE_OUT_POS(get_Proj_proj(proj)), &op->req); + if (smallest >= 0) { + be_operand_t *partner = &insn->ops[smallest]; + for (i = insn->use_start; i < insn->n_ops; ++i) { + if (insn->ops[i].carrier == partner->carrier) + insn->ops[i].partner = out_op; } + + out_op->partner = partner; + partner->partner = out_op; } } - - return perm; } -static ir_node *handle_constraints(be_chordal_alloc_env_t *alloc_env, ir_node *irn, int *silent) +static ir_node *handle_constraints(be_chordal_alloc_env_t *alloc_env, + ir_node *irn, int *silent) { + int n_regs; + bitset_t *bs; + ir_node **alloc_nodes; + //hungarian_problem_t *bp; + int *assignment; + pmap *partners; + int i, n_alloc; + bitset_pos_t col; + const ir_edge_t *edge; + ir_node *perm = NULL; + //int match_res, cost; be_chordal_env_t *env = alloc_env->chordal_env; - void *base = obstack_base(&env->obst); - be_insn_t *insn = chordal_scan_insn(alloc_env, irn); + void *base = obstack_base(env->obst); + be_insn_t *insn = chordal_scan_insn(env, irn); ir_node *res = insn->next_insn; int be_silent = *silent; + bipartite_t *bp; - if(insn->pre_colored) { + if (insn->pre_colored) { int i; - for(i = 0; i < insn->use_start; ++i) + for (i = 0; i < insn->use_start; ++i) pset_insert_ptr(alloc_env->pre_colored, insn->ops[i].carrier); } /* - If the current node is a barrier toggle the silent flag. - If we are in the start block, we are ought to be silent at the beginning, - so the toggling activates the constraint handling but skips the barrier. - If we are in the end block we handle the in requirements of the barrier - and set the rest to silent. - */ - if(be_is_Barrier(irn)) + * If the current node is a barrier toggle the silent flag. + * If we are in the start block, we are ought to be silent at the beginning, + * so the toggling activates the constraint handling but skips the barrier. + * If we are in the end block we handle the in requirements of the barrier + * and set the rest to silent. + */ + if (be_is_Barrier(irn)) *silent = !*silent; - if(be_silent) + if (be_silent) goto end; /* - Perms inserted before the constraint handling phase are considered to be - correctly precolored. These Perms arise during the ABI handling phase. - */ - if(insn->has_constraints) { - const arch_env_t *aenv = env->birg->main_env->arch_env; - int n_regs = env->cls->n_regs; - bitset_t *bs = bitset_alloca(n_regs); - ir_node **alloc_nodes = alloca(n_regs * sizeof(alloc_nodes[0])); - bipartite_t *bp = bipartite_new(n_regs, n_regs); - int *assignment = alloca(n_regs * sizeof(assignment[0])); - pmap *partners = pmap_create(); - DEBUG_ONLY(firm_dbg_module_t *dbg = alloc_env->constr_dbg;) - - int i, n_alloc; - long col; - const ir_edge_t *edge; - ir_node *perm = NULL; + * Perms inserted before the constraint handling phase are considered to be + * correctly precolored. These Perms arise during the ABI handling phase. + */ + if (!insn->has_constraints) + goto end; - /* - prepare the constraint handling of this node. - Perms are constructed and Copies are created for constrained values - interfering with the instruction. - */ - perm = pre_process_constraints(alloc_env, &insn); + n_regs = env->cls->n_regs; + bs = bitset_alloca(n_regs); + alloc_nodes = ALLOCAN(ir_node*, n_regs); + //bp = hungarian_new(n_regs, n_regs, 2, HUNGARIAN_MATCH_PERFECT); + bp = bipartite_new(n_regs, n_regs); + assignment = ALLOCAN(int, n_regs); + partners = pmap_create(); - /* find suitable in operands to the out operands of the node. */ - pair_up_operands(alloc_env, insn); + /* + * prepare the constraint handling of this node. + * Perms are constructed and Copies are created for constrained values + * interfering with the instruction. + */ + perm = pre_process_constraints(alloc_env->chordal_env, &insn); - /* - look at the in/out operands and add each operand (and its possible partner) - to a bipartite graph (left: nodes with partners, right: admissible colors). - */ - for(i = 0, n_alloc = 0; i < insn->n_ops; ++i) { - be_operand_t *op = &insn->ops[i]; + /* find suitable in operands to the out operands of the node. */ + pair_up_operands(alloc_env, insn); - /* - If the operand has no partner or the partner has not been marked - for allocation, determine the admissible registers and mark it - for allocation by associating the node and its partner with the - set of admissible registers via a bipartite graph. - */ - if(!op->partner || !pmap_contains(partners, op->partner->carrier)) { + /* + * look at the in/out operands and add each operand (and its possible partner) + * to a bipartite graph (left: nodes with partners, right: admissible colors). + */ + for (i = 0, n_alloc = 0; i < insn->n_ops; ++i) { + be_operand_t *op = &insn->ops[i]; - pmap_insert(partners, op->carrier, op->partner ? op->partner->carrier : NULL); - alloc_nodes[n_alloc] = op->carrier; + /* + * If the operand has no partner or the partner has not been marked + * for allocation, determine the admissible registers and mark it + * for allocation by associating the node and its partner with the + * set of admissible registers via a bipartite graph. + */ + if (!op->partner || !pmap_contains(partners, op->partner->carrier)) { + ir_node *partner = op->partner ? op->partner->carrier : NULL; + int i; + + pmap_insert(partners, op->carrier, partner); + if (partner != NULL) + pmap_insert(partners, partner, op->carrier); + + /* don't insert a node twice */ + for (i = 0; i < n_alloc; ++i) { + if (alloc_nodes[i] == op->carrier) { + break; + } + } + if (i < n_alloc) + continue; - DBG((dbg, LEVEL_2, "\tassociating %+F and %+F\n", op->carrier, op->partner ? op->partner->carrier : NULL)); + alloc_nodes[n_alloc] = op->carrier; - bitset_clear_all(bs); - get_decisive_partner_regs(bs, op, op->partner); + DBG((dbg, LEVEL_2, "\tassociating %+F and %+F\n", op->carrier, + partner)); - DBG((dbg, LEVEL_2, "\tallowed registers for %+F: %B\n", op->carrier, bs)); + bitset_clear_all(bs); + get_decisive_partner_regs(bs, op, op->partner); - bitset_foreach(bs, col) - bipartite_add(bp, n_alloc, col); + DBG((dbg, LEVEL_2, "\tallowed registers for %+F: %B\n", op->carrier, + bs)); - n_alloc++; + bitset_foreach(bs, col) { + //hungarian_add(bp, n_alloc, col, 1); + bipartite_add(bp, n_alloc, col); } - } - /* - Put all nodes which live by the constrained instruction also to the - allocation bipartite graph. They are considered unconstrained. - */ - if(perm) { - foreach_out_edge(perm, edge) { - ir_node *proj = get_edge_src_irn(edge); - - assert(is_Proj(proj)); - - if(values_interfere(proj, irn) && !pmap_contains(partners, proj)) { - assert(n_alloc < n_regs); - alloc_nodes[n_alloc] = proj; - pmap_insert(partners, proj, NULL); - - bitset_clear_all(bs); - arch_put_non_ignore_regs(aenv, env->cls, bs); - bitset_foreach(bs, col) - bipartite_add(bp, n_alloc, col); - - n_alloc++; - } - } + n_alloc++; } + } + + /* + * Put all nodes which live through the constrained instruction also to the + * allocation bipartite graph. They are considered unconstrained. + */ + if (perm != NULL) { + foreach_out_edge(perm, edge) { + int i; + ir_node *proj = get_edge_src_irn(edge); - /* Compute a valid register allocation. */ - bipartite_matching(bp, assignment); + assert(is_Proj(proj)); - /* Assign colors obtained from the matching. */ - for(i = 0; i < n_alloc; ++i) { - const arch_register_t *reg; - ir_node *nodes[2]; - int j; + if (!be_values_interfere(env->birg->lv, proj, irn) + || pmap_contains(partners, proj)) + continue; + + /* don't insert a node twice */ + for (i = 0; i < n_alloc; ++i) { + if (alloc_nodes[i] == proj) { + break; + } + } + if (i < n_alloc) + continue; - assert(assignment[i] >= 0 && "there must have been a register assigned"); - reg = arch_register_for_index(env->cls, assignment[i]); - nodes[0] = alloc_nodes[i]; - nodes[1] = pmap_get(partners, alloc_nodes[i]); + assert(n_alloc < n_regs); - for(j = 0; j < 2; ++j) { - if(!nodes[j]) - continue; + alloc_nodes[n_alloc] = proj; + pmap_insert(partners, proj, NULL); - arch_set_irn_register(aenv, nodes[j], reg); - pset_hinsert_ptr(alloc_env->pre_colored, nodes[j]); - DBG((dbg, LEVEL_2, "\tsetting %+F to register %s\n", nodes[j], reg->name)); + bitset_clear_all(bs); + arch_put_non_ignore_regs(env->cls, bs); + bitset_andnot(bs, env->ignore_colors); + bitset_foreach(bs, col) { + //hungarian_add(bp, n_alloc, col, 1); + bipartite_add(bp, n_alloc, col); } + + n_alloc++; } + } + /* Compute a valid register allocation. */ +#if 0 + hungarian_prepare_cost_matrix(bp, HUNGARIAN_MODE_MAXIMIZE_UTIL); + match_res = hungarian_solve(bp, assignment, &cost, 1); + assert(match_res == 0 && "matching failed"); +#else + bipartite_matching(bp, assignment); +#endif - /* Allocate the non-constrained Projs of the Perm. */ - if(perm) { + /* Assign colors obtained from the matching. */ + for (i = 0; i < n_alloc; ++i) { + const arch_register_t *reg; + ir_node *irn; - bitset_clear_all(bs); + assert(assignment[i] >= 0 && "there must have been a register assigned"); + reg = arch_register_for_index(env->cls, assignment[i]); + assert(! (reg->type & arch_register_type_ignore)); + + irn = alloc_nodes[i]; + if (irn != NULL) { + arch_set_irn_register(irn, reg); + (void) pset_hinsert_ptr(alloc_env->pre_colored, irn); + DBG((dbg, LEVEL_2, "\tsetting %+F to register %s\n", irn, reg->name)); + } - /* Put the colors of all Projs in a bitset. */ - foreach_out_edge(perm, edge) { - ir_node *proj = get_edge_src_irn(edge); - const arch_register_t *reg = arch_get_irn_register(aenv, proj); + irn = pmap_get(partners, alloc_nodes[i]); + if (irn != NULL) { + arch_set_irn_register(irn, reg); + (void) pset_hinsert_ptr(alloc_env->pre_colored, irn); + DBG((dbg, LEVEL_2, "\tsetting %+F to register %s\n", irn, reg->name)); + } + } - if(reg != NULL) - bitset_set(bs, reg->index); - } + /* Allocate the non-constrained Projs of the Perm. */ + if (perm != NULL) { + bitset_clear_all(bs); - /* Assign the not yet assigned Projs of the Perm a suitable color. */ - foreach_out_edge(perm, edge) { - ir_node *proj = get_edge_src_irn(edge); - const arch_register_t *reg = arch_get_irn_register(aenv, proj); + /* Put the colors of all Projs in a bitset. */ + foreach_out_edge(perm, edge) { + ir_node *proj = get_edge_src_irn(edge); + const arch_register_t *reg = arch_get_irn_register(proj); - DBG((dbg, LEVEL_2, "\tchecking reg of %+F: %s\n", proj, reg ? reg->name : "")); + if (reg != NULL) + bitset_set(bs, reg->index); + } - if(reg == NULL) { - col = get_next_free_reg(alloc_env, bs); - reg = arch_register_for_index(env->cls, col); - bitset_set(bs, reg->index); - arch_set_irn_register(aenv, proj, reg); - pset_insert_ptr(alloc_env->pre_colored, proj); - DBG((dbg, LEVEL_2, "\tsetting %+F to register %s\n", proj, reg->name)); - } + /* Assign the not yet assigned Projs of the Perm a suitable color. */ + foreach_out_edge(perm, edge) { + ir_node *proj = get_edge_src_irn(edge); + const arch_register_t *reg = arch_get_irn_register(proj); + + DBG((dbg, LEVEL_2, "\tchecking reg of %+F: %s\n", proj, reg ? reg->name : "")); + + if (reg == NULL) { + col = get_next_free_reg(alloc_env, bs); + reg = arch_register_for_index(env->cls, col); + bitset_set(bs, reg->index); + arch_set_irn_register(proj, reg); + pset_insert_ptr(alloc_env->pre_colored, proj); + DBG((dbg, LEVEL_2, "\tsetting %+F to register %s\n", proj, reg->name)); } } - - pmap_destroy(partners); } + bipartite_free(bp); + //hungarian_free(bp); + pmap_destroy(partners); + end: - obstack_free(&env->obst, base); + obstack_free(env->obst, base); return res; } @@ -558,135 +427,22 @@ end: */ static void constraints(ir_node *bl, void *data) { - be_chordal_alloc_env_t *env = data; - - /* - Start silent in the start block. - The silence remains until the first barrier is seen. - Each other block is begun loud. - */ - int silent = bl == get_irg_start_block(get_irn_irg(bl)); - ir_node *irn; - - /* - If the block is the start block search the barrier and - start handling constraints from there. - */ - - for(irn = sched_first(bl); !sched_is_end(irn);) { - irn = handle_constraints(env, irn, &silent); - } -} - -/** - * Annotate the register pressure to the nodes and compute - * the liveness intervals. - * @param block The block to do it for. - * @param env_ptr The environment. - */ -static void pressure(ir_node *block, void *env_ptr) -{ -/* Convenience macro for a def */ -#define border_def(irn, step, real) \ - border_add(env, head, irn, step, pressure--, 1, real) - -/* Convenience macro for a use */ -#define border_use(irn, step, real) \ - border_add(env, head, irn, step, ++pressure, 0, real) - - be_chordal_alloc_env_t *alloc_env = env_ptr; - be_chordal_env_t *env = alloc_env->chordal_env; - bitset_t *live = alloc_env->live; - ir_node *irn; - DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;) - - int i, n; - unsigned step = 0; - unsigned pressure = 0; - struct list_head *head; - pset *live_in = put_live_in(block, pset_new_ptr_default()); - pset *live_end = put_live_end(block, pset_new_ptr_default()); - - DBG((dbg, LEVEL_1, "Computing pressure in block %+F\n", block)); - bitset_clear_all(live); - - /* Set up the border list in the block info */ - head = obstack_alloc(&env->obst, sizeof(*head)); - INIT_LIST_HEAD(head); - assert(pmap_get(env->border_heads, block) == NULL); - pmap_insert(env->border_heads, block, head); - - /* - * Make final uses of all values live out of the block. - * They are necessary to build up real intervals. - */ - for(irn = pset_first(live_end); irn; irn = pset_next(live_end)) { - if(has_reg_class(env, irn)) { - DBG((dbg, LEVEL_3, "\tMaking live: %+F/%d\n", irn, get_irn_graph_nr(irn))); - bitset_set(live, get_irn_graph_nr(irn)); - border_use(irn, step, 0); - } - } - ++step; - /* - * Determine the last uses of a value inside the block, since they are - * relevant for the interval borders. + * Start silent in the start block. + * The silence remains until the first barrier is seen. + * Each other block is begun loud. */ - sched_foreach_reverse(block, irn) { - DBG((dbg, LEVEL_1, "\tinsn: %+F, pressure: %d\n", irn, pressure)); - DBG((dbg, LEVEL_2, "\tlive: %b\n", live)); - - /* - * If the node defines some value, which can put into a - * register of the current class, make a border for it. - */ - if(has_reg_class(env, irn)) { - int nr = get_irn_graph_nr(irn); - - bitset_clear(live, nr); - border_def(irn, step, 1); - } - - /* - * If the node is no phi node we can examine the uses. - */ - if(!is_Phi(irn)) { - for(i = 0, n = get_irn_arity(irn); i < n; ++i) { - ir_node *op = get_irn_n(irn, i); - - if(has_reg_class(env, op)) { - int nr = get_irn_graph_nr(op); - - DBG((dbg, LEVEL_4, "\t\tpos: %d, use: %+F\n", i, op)); - - if(!bitset_is_set(live, nr)) { - border_use(op, step, 1); - bitset_set(live, nr); - } - } - } - } - ++step; - } + int silent = bl == get_irg_start_block(get_irn_irg(bl)); + be_chordal_alloc_env_t *env = data; + ir_node *irn; /* - * Add initial defs for all values live in. + * If the block is the start block search the barrier and + * start handling constraints from there. */ - for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) { - if(has_reg_class(env, irn)) { - - /* Mark the value live in. */ - bitset_set(live, get_irn_graph_nr(irn)); - - /* Add the def */ - border_def(irn, step, 0); - } + for (irn = sched_first(bl); !sched_is_end(irn);) { + irn = handle_constraints(env, irn, &silent); } - - - del_pset(live_in); - del_pset(live_end); } static void assign(ir_node *block, void *env_ptr) @@ -696,13 +452,12 @@ static void assign(ir_node *block, void *env_ptr) bitset_t *live = alloc_env->live; bitset_t *colors = alloc_env->colors; bitset_t *in_colors = alloc_env->in_colors; - const arch_env_t *arch_env = env->birg->main_env->arch_env; - DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;) + struct list_head *head = get_block_border_head(env, block); + be_lv_t *lv = env->birg->lv; const ir_node *irn; border_t *b; - struct list_head *head = get_block_border_head(env, block); - pset *live_in = put_live_in(block, pset_new_ptr_default()); + int idx; bitset_clear_all(colors); bitset_clear_all(live); @@ -712,7 +467,7 @@ static void assign(ir_node *block, void *env_ptr) DBG((dbg, LEVEL_4, "\tusedef chain for block\n")); list_for_each_entry(border_t, b, head, list) { DBG((dbg, LEVEL_4, "\t%s %+F/%d\n", b->is_def ? "def" : "use", - b->irn, get_irn_graph_nr(b->irn))); + b->irn, get_irn_idx(b->irn))); } /* @@ -720,93 +475,98 @@ static void assign(ir_node *block, void *env_ptr) * Since their colors have already been assigned (The dominators were * allocated before), we have to mark their colors as used also. */ - for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) { - if(has_reg_class(env, irn)) { - const arch_register_t *reg = arch_get_irn_register(arch_env, irn); + be_lv_foreach(lv, block, be_lv_state_in, idx) { + irn = be_lv_get_irn(lv, block, idx); + if (has_reg_class(env, irn)) { + const arch_register_t *reg = arch_get_irn_register(irn); int col; assert(reg && "Node must have been assigned a register"); col = arch_register_get_index(reg); + DBG((dbg, LEVEL_4, "%+F has reg %s\n", irn, reg->name)); + /* Mark the color of the live in value as used. */ bitset_set(colors, col); bitset_set(in_colors, col); /* Mark the value live in. */ - bitset_set(live, get_irn_graph_nr(irn)); + bitset_set(live, get_irn_idx(irn)); } } /* - * Mind that the sequence - * of defs from back to front defines a perfect + * Mind that the sequence of defs from back to front defines a perfect * elimination order. So, coloring the definitions from first to last * will work. */ list_for_each_entry_reverse(border_t, b, head, list) { ir_node *irn = b->irn; - int nr = get_irn_graph_nr(irn); + int nr = get_irn_idx(irn); + int ignore = arch_irn_is_ignore(irn); /* * Assign a color, if it is a local def. Global defs already have a * color. */ - if(b->is_def && !is_live_in(block, irn)) { + if (b->is_def && !be_is_live_in(lv, block, irn)) { const arch_register_t *reg; int col = NO_COLOR; - if(pset_find_ptr(alloc_env->pre_colored, irn)) { - reg = arch_get_irn_register(arch_env, irn); + if (ignore || pset_find_ptr(alloc_env->pre_colored, irn)) { + reg = arch_get_irn_register(irn); col = reg->index; assert(!bitset_is_set(colors, col) && "pre-colored register must be free"); - } - - else { + } else { col = get_next_free_reg(alloc_env, colors); reg = arch_register_for_index(env->cls, col); - assert(arch_get_irn_register(arch_env, irn) == NULL && "This node must not have been assigned a register yet"); + assert(arch_get_irn_register(irn) == NULL && "This node must not have been assigned a register yet"); assert(!arch_register_type_is(reg, ignore) && "Must not assign ignore register"); } bitset_set(colors, col); - arch_set_irn_register(arch_env, irn, reg); + arch_set_irn_register(irn, reg); - DBG((dbg, LEVEL_1, "\tassigning register %s(%d) to %+F\n", - arch_register_get_name(reg), col, irn)); + DBG((dbg, LEVEL_1, "\tassigning register %s(%d) to %+F\n", arch_register_get_name(reg), col, irn)); assert(!bitset_is_set(live, nr) && "Value's definition must not have been encountered"); bitset_set(live, nr); - } - - /* Clear the color upon a use. */ - else if(!b->is_def) { - const arch_register_t *reg = arch_get_irn_register(arch_env, irn); + } else if (!b->is_def) { + /* Clear the color upon a use. */ + const arch_register_t *reg = arch_get_irn_register(irn); int col; assert(reg && "Register must have been assigned"); col = arch_register_get_index(reg); - assert(bitset_is_set(live, nr) && "Cannot have a non live use"); +#ifndef NDEBUG + if (!arch_register_type_is(reg, ignore)) { + assert(bitset_is_set(live, nr) && "Cannot have a non live use"); + } +#endif bitset_clear(colors, col); bitset_clear(live, nr); } } - - del_pset(live_in); } void be_ra_chordal_color(be_chordal_env_t *chordal_env) { be_chordal_alloc_env_t env; char buf[256]; + be_lv_t *lv; + be_irg_t *birg = chordal_env->birg; + const arch_register_class_t *cls = chordal_env->cls; - int colors_n = arch_register_class_n_regs(chordal_env->cls); + int colors_n = arch_register_class_n_regs(cls); ir_graph *irg = chordal_env->irg; + lv = be_assure_liveness(birg); + be_liveness_assure_sets(lv); + be_liveness_assure_chk(lv); - if(get_irg_dom_state(irg) != dom_consistent) - compute_doms(irg); + assure_doms(irg); env.chordal_env = chordal_env; env.colors_n = colors_n; @@ -814,35 +574,47 @@ void be_ra_chordal_color(be_chordal_env_t *chordal_env) env.tmp_colors = bitset_alloca(colors_n); env.in_colors = bitset_alloca(colors_n); env.pre_colored = pset_new_ptr_default(); - FIRM_DBG_REGISTER(env.constr_dbg, "firm.be.chordal.constr"); + be_timer_push(T_CONSTR); /* Handle register targeting constraints */ dom_tree_walk_irg(irg, constraints, NULL, &env); - if(chordal_env->opts->dump_flags & BE_CH_DUMP_CONSTR) { + if (chordal_env->opts->dump_flags & BE_CH_DUMP_CONSTR) { snprintf(buf, sizeof(buf), "-%s-constr", chordal_env->cls->name); be_dump(chordal_env->irg, buf, dump_ir_block_graph_sched); } - be_numbering(irg); - env.live = bitset_malloc(get_graph_node_count(chordal_env->irg)); + be_timer_pop(T_CONSTR); + + env.live = bitset_malloc(get_irg_last_idx(chordal_env->irg)); /* First, determine the pressure */ - dom_tree_walk_irg(irg, pressure, NULL, &env); + dom_tree_walk_irg(irg, create_borders, NULL, env.chordal_env); /* Assign the colors */ dom_tree_walk_irg(irg, assign, NULL, &env); - be_numbering_done(irg); - - if(chordal_env->opts->dump_flags & BE_CH_DUMP_TREE_INTV) { - plotter_t *plotter; + if (chordal_env->opts->dump_flags & BE_CH_DUMP_TREE_INTV) { + plotter_t *plotter; ir_snprintf(buf, sizeof(buf), "ifg_%s_%F.eps", chordal_env->cls->name, irg); - plotter = new_plotter_ps(buf); - draw_interval_tree(&draw_chordal_def_opts, chordal_env, plotter); - plotter_free(plotter); + plotter = new_plotter_ps(buf); + draw_interval_tree(&draw_chordal_def_opts, chordal_env, plotter); + plotter_free(plotter); } + bitset_free(env.live); del_pset(env.pre_colored); } + +void be_init_chordal(void) +{ + static be_ra_chordal_coloring_t coloring = { + be_ra_chordal_color + }; + FIRM_DBG_REGISTER(dbg, "firm.be.chordal"); + + be_register_chordal_coloring("default", &coloring); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal);