X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal.c;h=d2b414cb1a0b501a4d839783d04505cb62323f27;hb=91f9fd8a65f0db8bcf956cfe54ac4cca394c45e8;hp=f7c7d4c75afdb96ca3ada0eb0da5ea1932d7624f;hpb=48398403237b6bbc2e7d6fb46e22cff0f1d2d032;p=libfirm diff --git a/ir/be/bechordal.c b/ir/be/bechordal.c index f7c7d4c75..d2b414cb1 100644 --- a/ir/be/bechordal.c +++ b/ir/be/bechordal.c @@ -1,15 +1,29 @@ -/** - * 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. * - * Copyright (C) Universitaet Karlsruhe - * Released under the GPL + * 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. */ -#ifdef HAVE_CONFIG_H +/** + * @file + * @brief Chordal register allocation. + * @author Sebastian Hack + * @date 08.12.2004 + */ #include "config.h" -#endif #include @@ -17,7 +31,9 @@ #include "pset.h" #include "list.h" #include "bitset.h" -#include "iterator.h" +#include "raw_bitset.h" +#include "bipartite.h" +#include "hungarian.h" #include "irmode_t.h" #include "irgraph_t.h" @@ -25,391 +41,357 @@ #include "irgwalk.h" #include "irdump.h" #include "irdom.h" +#include "irtools.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.h" #include "bearch.h" - +#include "beirgmod.h" +#include "beifg.h" +#include "beinsn_t.h" +#include "statev_t.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 0 //SET_LEVEL_4 -#define NO_COLOR (-1) - -#undef DUMP_INTERVALS -#undef DUMP_PRESSURE -#undef DUMP_IFG - -#if defined(DUMP_IFG) && !defined(BUILD_GRAPH) -#error Must define BUILD_GRAPH to be able to dump it. -#endif - - -#include "fourcc.h" - -/* Make a fourcc for border checking. */ -#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D') - -static firm_dbg_module_t *dbg; +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) -#ifdef BUILD_GRAPH +typedef struct be_chordal_alloc_env_t { + be_chordal_env_t *chordal_env; -#define IF_EDGE_HASH(e) ((e)->src) -#define IF_NODE_HASH(n) ((n)->nnr) + 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. */ +} be_chordal_alloc_env_t; -static int if_edge_cmp(const void *p1, const void *p2, size_t size) +static int get_next_free_reg(const be_chordal_alloc_env_t *alloc_env, bitset_t *colors) { - const if_edge_t *e1 = p1; - const if_edge_t *e2 = p2; - - return !(e1->src == e2->src && e1->tgt == e2->tgt); + bitset_t *tmp = alloc_env->tmp_colors; + bitset_copy(tmp, colors); + bitset_flip_all(tmp); + bitset_and(tmp, alloc_env->chordal_env->allocatable_regs); + return bitset_next_set(tmp, 0); } -static int if_node_cmp(const void *p1, const void *p2, size_t size) +static bitset_t const *get_decisive_partner_regs(be_operand_t const *const o1) { - const if_node_t *n1 = p1; - const if_node_t *n2 = p2; - - return n1->nnr != n2->nnr; -} + be_operand_t const *const o2 = o1->partner; + assert(!o2 || o1->req->cls == o2->req->cls); -static INLINE if_edge_t *edge_init(if_edge_t *edge, int src, int tgt) -{ - /* Bring the smaller entry to src. */ - if(src > tgt) { - edge->src = tgt; - edge->tgt = src; + if (!o2 || bitset_contains(o1->regs, o2->regs)) { + return o1->regs; + } else if (bitset_contains(o2->regs, o1->regs)) { + return o2->regs; } else { - edge->src = src; - edge->tgt = tgt; + return NULL; } - - return edge; -} - -static INLINE void add_if(const be_chordal_env_t *env, int src, int tgt) -{ - if_edge_t edge; - if_node_t node, *src_node, *tgt_node; - /* insert edge */ - edge_init(&edge, src, tgt); - set_insert(env->edges, &edge, sizeof(edge), IF_EDGE_HASH(&edge)); - - /* insert nodes */ - node.nnr = src; - node.neighb = pset_new_ptr(8); - src_node = set_insert(env->nodes, &node, sizeof(node), IF_NODE_HASH(&node)); - node.nnr = tgt; - node.neighb = pset_new_ptr(8); - tgt_node = set_insert(env->nodes, &node, sizeof(node), IF_NODE_HASH(&node)); - - /* insert neighbors into nodes */ - pset_insert_ptr(src_node->neighb, tgt_node); - pset_insert_ptr(tgt_node->neighb, src_node); } -static INLINE int are_connected(const be_chordal_env_t *env, int src, int tgt) +static void pair_up_operands(const be_chordal_alloc_env_t *alloc_env, be_insn_t *insn) { - if_edge_t edge; - edge_init(&edge, src, tgt); - return set_find(env->edges, &edge, sizeof(edge), IF_EDGE_HASH(&edge)) != NULL; -} - -int ifg_has_edge(const be_chordal_env_t *env, const if_node_t *n1, const if_node_t* n2) { - return are_connected(env, n1->nnr, n2->nnr); -} + const be_chordal_env_t *env = alloc_env->chordal_env; + bitset_t *bs = bitset_alloca(env->cls->n_regs); + int i; + int j; -#ifdef DUMP_IFG - -static void dump_ifg(const be_chordal_env_t *env) -{ - FILE *f; - set *edges = env->edges; - ir_graph *irg = env->irg; - char filename[128]; - - ir_snprintf(filename, sizeof(filename), "ifg_%s_%F.dot", env->cls->name, irg); - - if((f = fopen(filename, "wt")) != NULL) { - bitset_pos_t pos; - int n_edges = 0; - if_edge_t *edge; - bitset_t *bs = bitset_malloc(get_graph_node_count(irg)); - - ir_fprintf(f, "graph \"%F\" {\n", irg); - fprintf(f, "\tnode [shape=box,style=filled]\n"); - - for(edge = set_first(edges); edge; edge = set_next(edges)) { - bitset_set(bs, edge->src); - bitset_set(bs, edge->tgt); - n_edges++; + /* + * 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) { + be_operand_t *smallest = NULL; + int smallest_n_regs = 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) { + int n_total; + be_operand_t *op = &insn->ops[i]; + be_lv_t *lv; + + if (op->partner != NULL) + continue; + lv = be_get_irg_liveness(env->irg); + if (be_values_interfere(lv, op->irn, op->carrier)) + continue; + + bitset_copy(bs, op->regs); + bitset_and(bs, out_op->regs); + n_total = bitset_popcount(op->regs); + + if (!bitset_is_empty(bs) && n_total < smallest_n_regs) { + smallest = op; + smallest_n_regs = n_total; + } } - fprintf(f, "\tx [label=\"nodes: %u, edges: %d\"]\n", bitset_popcnt(bs), n_edges); - - bitset_foreach(bs, pos) { - int nr = (int) pos; - ir_node *irn = get_irn_for_graph_nr(irg, nr); - - ir_fprintf(f, "\tn%d [label=\"%+F\"]\n", nr, irn); - } + if (smallest != NULL) { + for (i = insn->use_start; i < insn->n_ops; ++i) { + if (insn->ops[i].carrier == smallest->carrier) + insn->ops[i].partner = out_op; + } - for(edge = set_first(edges); edge; edge = set_next(edges)) { - fprintf(f, "\tn%d -- n%d [len=5]\n", edge->src, edge->tgt); + out_op->partner = smallest; + smallest->partner = out_op; } - - fprintf(f, "}\n"); - fclose(f); - - bitset_free(bs); } - } -#endif /* DUMP_IFG */ - -#endif /* BUILD_GRAPH */ - -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); - } -} - -static void check_heads(be_chordal_env_t *env) +static void handle_constraints(be_chordal_alloc_env_t *alloc_env, + ir_node *irn) { - 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); - } -} + int n_regs; + ir_node **alloc_nodes; + //hungarian_problem_t *bp; + int *assignment; + pmap *partners; + int i, n_alloc; + 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 = be_scan_insn(env, irn); + bipartite_t *bp; + + if (insn->pre_colored) { + int i; + for (i = 0; i < insn->use_start; ++i) + pset_insert_ptr(alloc_env->pre_colored, insn->ops[i].carrier); + } + /* + * 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 || is_Phi(irn)) + goto end; -/** - * 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; + n_regs = env->cls->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(); - if(!is_def) { - border_t *def; + /* + * 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); - b = obstack_alloc(&env->obst, sizeof(*b)); + /* find suitable in operands to the out operands of the node. */ + pair_up_operands(alloc_env, insn); - /* 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; + /* + * 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]; /* - * 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. + * 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. */ - set_irn_link(irn, def); + 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; - b->magic = BORDER_FOURCC; - def->magic = BORDER_FOURCC; - } + alloc_nodes[n_alloc] = op->carrier; - /* - * 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"); - } + DBG((dbg, LEVEL_2, "\tassociating %+F and %+F\n", op->carrier, + partner)); - b->pressure = pressure; - b->is_def = is_def; - b->is_real = is_real; - b->irn = irn; - b->step = step; - check_heads(env); - list_add_tail(&b->list, head); - check_heads(env); - DBG((dbg, LEVEL_5, "\t\t%s adding %+F, step: %d\n", - is_def ? "def" : "use", irn, step)); + bitset_t const *const bs = get_decisive_partner_regs(op); + if (bs) { + DBG((dbg, LEVEL_2, "\tallowed registers for %+F: %B\n", op->carrier, bs)); + bitset_foreach(bs, col) { + //hungarian_add(bp, n_alloc, col, 1); + bipartite_add(bp, n_alloc, col); + } + } else { + DBG((dbg, LEVEL_2, "\tallowed registers for %+F: none\n", op->carrier)); + } - return b; -} + n_alloc++; + } + } -static INLINE int has_reg_class(const be_chordal_env_t *env, const ir_node *irn) -{ - return arch_irn_has_reg_class(env->arch_env, irn, arch_pos_make_out(0), env->cls); -} + /* + * 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); + be_lv_t *lv = be_get_irg_liveness(env->irg); + + assert(is_Proj(proj)); + + if (!be_values_interfere(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; -/** - * 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_env_t *env = env_ptr; - bitset_t *live = env->live; - ir_node *irn; - - 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()); - const arch_register_class_t *cls = env->cls; - - 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); + assert(n_alloc < n_regs); - /* - * 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)) { - DBG((dbg, LEVEL_3, "\tMaking live: %+F/%d\n", irn, get_irn_graph_nr(irn))); - bitset_set(live, get_irn_graph_nr(irn)); - if(has_reg_class(env, irn)) - border_use(irn, step, 0); - } - ++step; + alloc_nodes[n_alloc] = proj; + pmap_insert(partners, proj, NULL); - /* - * Determine the last uses of a value inside the block, since they are - * relevant for the interval borders. - */ - 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)) { - bitset_pos_t elm; - int nr = get_irn_graph_nr(irn); + bitset_foreach(env->allocatable_regs, col) { + //hungarian_add(bp, n_alloc, col, 1); + bipartite_add(bp, n_alloc, col); + } - bitset_clear(live, nr); - border_def(irn, step, 1); + n_alloc++; + } + } -#ifdef BUILD_GRAPH - bitset_foreach(live, elm) - add_if(env, nr, (int) elm); + /* 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_dump_f(stderr, bp);*/ + bipartite_matching(bp, assignment); #endif - } - /* - * 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); + /* Assign colors obtained from the matching. */ + for (i = 0; i < n_alloc; ++i) { + const arch_register_t *reg; + ir_node *irn; - if(has_reg_class(env, op)) { - int nr = get_irn_graph_nr(op); + assert(assignment[i] >= 0 && "there must have been a register assigned (node not register pressure faithful?)"); + reg = arch_register_for_index(env->cls, assignment[i]); - DBG((dbg, LEVEL_4, "\t\tpos: %d, use: %+F\n", i, op)); + 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)); + } - if(!bitset_is_set(live, nr)) { - border_use(op, step, 1); - bitset_set(live, nr); - } - } - } + irn = pmap_get(ir_node, 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)); } - ++step; } - /* - * Add initial defs for all values live in. - */ - for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) { - if(has_reg_class(env, irn)) { + /* Allocate the non-constrained Projs of the Perm. */ + if (perm != NULL) { + /* Put the colors of all Projs in a bitset. */ + bitset_t *const bs = bitset_alloca(n_regs); + foreach_out_edge(perm, edge) { + ir_node *proj = get_edge_src_irn(edge); + const arch_register_t *reg = arch_get_irn_register(proj); - /* Mark the value live in. */ - bitset_set(live, get_irn_graph_nr(irn)); + if (reg != NULL) + bitset_set(bs, reg->index); + } - /* Add the def */ - border_def(irn, step, 0); + /* 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) { + size_t const 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)); + } } } - check_heads(env); + bipartite_free(bp); + //hungarian_free(bp); + pmap_destroy(partners); - del_pset(live_in); - del_pset(live_end); +end: + obstack_free(env->obst, base); } -static void assign(ir_node *block, void *env_ptr) +/** + * Handle constraint nodes in each basic block. + * handle_constraints() inserts Perm nodes which perm + * over all values live at the constrained node right in front + * of the constrained node. These Perms signal a constrained node. + * For further comments, refer to handle_constraints(). + */ +static void constraints(ir_node *bl, void *data) { - be_chordal_env_t *env = env_ptr; - struct obstack *obst = &env->obst; - bitset_t *live = env->live; - bitset_t *colors = env->colors; - bitset_t *in_colors = env->in_colors; - const arch_register_class_t *cls = env->cls; - - /* Mark the obstack level and allocate the temporary tmp_colors */ - void *obstack_level = obstack_base(obst); - /*bitset_t *tmp_colors = bitset_obstack_alloc(obst, env->colors_n);*/ - - 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()); + be_chordal_alloc_env_t *env = (be_chordal_alloc_env_t*)data; + ir_node *irn; - check_heads(env); + for (irn = sched_first(bl); !sched_is_end(irn);) { + ir_node *const next = sched_next(irn); + handle_constraints(env, irn); + irn = next; + } +} +static void assign(ir_node *block, void *env_ptr) +{ + be_chordal_alloc_env_t *alloc_env = (be_chordal_alloc_env_t*)env_ptr; + be_chordal_env_t *env = alloc_env->chordal_env; + bitset_t *live = alloc_env->live; + bitset_t *colors = alloc_env->colors; + struct list_head *head = get_block_border_head(env, block); + be_lv_t *lv = be_get_irg_liveness(env->irg); - bitset_clear_all(live); bitset_clear_all(colors); - bitset_clear_all(in_colors); + bitset_clear_all(live); DBG((dbg, LEVEL_4, "Assigning colors for block %+F\n", block)); DBG((dbg, LEVEL_4, "\tusedef chain for block\n")); - list_for_each_entry(border_t, b, head, list) { + foreach_border_head(head, b) { 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))); } /* @@ -417,20 +399,19 @@ 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(env->arch_env, irn, 0); - int col; + be_lv_foreach(lv, block, be_lv_state_in, irn) { + if (arch_irn_consider_in_reg_alloc(env->cls, irn)) { + const arch_register_t *reg = arch_get_irn_register(irn); - assert(reg && "Node must have been assigned a register"); - col = arch_register_get_index(reg); + assert(reg && "Node must have been assigned a register"); + DBG((dbg, LEVEL_4, "%+F has reg %s\n", irn, reg->name)); /* Mark the color of the live in value as used. */ + int const col = reg->index; 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)); } } @@ -439,197 +420,113 @@ static void assign(ir_node *block, void *env_ptr) * elimination order. So, coloring the definitions from first to last * will work. */ - list_for_each_entry_reverse(border_t, b, head, list) { + foreach_border_head(head, b) { 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)) { - const arch_register_t *reg; - int col = NO_COLOR; - - DBG((dbg, LEVEL_4, "\tcolors in use: %b\n", colors)); - - col = bitset_next_clear(colors, 0); - reg = arch_register_for_index(env->cls, col); + if (b->is_def && !be_is_live_in(lv, block, irn)) { + const arch_register_t *reg; + int col; - assert(arch_get_irn_register(env->arch_env, irn, 0) == NULL - && "This node must not have been assigned a register yet"); - assert(!bitset_is_set(live, nr) && "Value's definition must not have been encountered"); + 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 { + col = get_next_free_reg(alloc_env, colors); + reg = arch_register_for_index(env->cls, col); + assert(arch_get_irn_register(irn) == NULL && "This node must not have been assigned a register yet"); + } bitset_set(colors, col); - bitset_set(live, nr); + arch_set_irn_register(irn, reg); - arch_set_irn_register(env->arch_env, irn, 0, reg); - DBG((dbg, LEVEL_1, "\tassigning register %s(%d) to %+F\n", - arch_register_get_name(reg), col, irn)); - } - - /* Clear the color upon a use. */ - else if(!b->is_def) { - const arch_register_t *reg = arch_get_irn_register(env->arch_env, irn, 0); - int col; + DBG((dbg, LEVEL_1, "\tassigning register %s(%d) to %+F\n", reg->name, col, irn)); - assert(reg && "Register must have been assigned"); + assert(!bitset_is_set(live, nr) && "Value's definition must not have been encountered"); + bitset_set(live, nr); + } else if (!b->is_def) { + /* Clear the color upon a use. */ + const arch_register_t *reg = arch_get_irn_register(irn); - col = arch_register_get_index(reg); - assert(bitset_is_set(live, nr) && "Cannot have a non live use"); + assert(reg && "Register must have been assigned"); - bitset_clear(colors, col); + bitset_clear(colors, reg->index); bitset_clear(live, nr); } } - - /* Free the auxillary data on the obstack. */ - //obstack_free(obst, obstack_level); - - del_pset(live_in); -} - -void be_ra_chordal_init(void) -{ - dbg = firm_dbg_register(DBG_CHORDAL); - firm_dbg_set_mask(dbg, DBG_LEVEL); } -be_chordal_env_t *be_ra_chordal(ir_graph *irg, - const arch_env_t *arch_env, - const arch_register_class_t *cls) +static void be_ra_chordal_color(be_chordal_env_t *const chordal_env) { - int node_count = get_graph_node_count(irg); - int colors_n = arch_register_class_n_regs(cls); - be_chordal_env_t *env = malloc(sizeof(*env)); + be_chordal_alloc_env_t env; + char buf[256]; + const arch_register_class_t *cls = chordal_env->cls; - if(get_irg_dom_state(irg) != dom_consistent) - compute_doms(irg); + int colors_n = arch_register_class_n_regs(cls); + ir_graph *irg = chordal_env->irg; - obstack_init(&env->obst); + be_assure_live_sets(irg); + assure_doms(irg); -#ifdef BUILD_GRAPH - env->edges = new_set(if_edge_cmp, node_count); - env->nodes = new_set(if_node_cmp, node_count); -#endif - - env->live = bitset_obstack_alloc(&env->obst, node_count); - env->colors = bitset_obstack_alloc(&env->obst, colors_n); - env->in_colors = bitset_obstack_alloc(&env->obst, colors_n); - env->colors_n = colors_n; - env->cls = cls; - env->arch_env = arch_env; - env->irg = irg; - env->border_heads = pmap_create(); + env.chordal_env = chordal_env; + env.colors = bitset_alloca(colors_n); + env.tmp_colors = bitset_alloca(colors_n); + env.pre_colored = pset_new_ptr_default(); - /* First, determine the pressure */ - dom_tree_walk_irg(irg, pressure, NULL, env); + be_timer_push(T_SPLIT); - /* Insert probable spills */ - be_ra_chordal_spill(env); - - /* Assign the colors */ - dom_tree_walk_irg(irg, assign, NULL, env); + if (chordal_env->opts->dump_flags & BE_CH_DUMP_SPLIT) { + snprintf(buf, sizeof(buf), "%s-split", chordal_env->cls->name); + dump_ir_graph(chordal_env->irg, buf); + } -#ifdef DUMP_IFG - dump_ifg(env); -#endif + be_timer_pop(T_SPLIT); -#ifdef DUMP_INTERVALS - { - char buf[128]; - plotter_t *plotter; + be_timer_push(T_CONSTR); - ir_snprintf(buf, sizeof(buf), "ifg_%s_%F.eps", cls->name, irg); - plotter = new_plotter_ps(buf); + /* Handle register targeting constraints */ + dom_tree_walk_irg(irg, constraints, NULL, &env); - draw_interval_tree(&draw_chordal_def_opts, env, plotter, arch_env, cls); - plotter_free(plotter); + if (chordal_env->opts->dump_flags & BE_CH_DUMP_CONSTR) { + snprintf(buf, sizeof(buf), "%s-constr", chordal_env->cls->name); + dump_ir_graph(chordal_env->irg, buf); } -#endif - return env; -} -void be_ra_chordal_check(be_chordal_env_t *chordal_env) { - const arch_env_t *arch_env; - struct obstack ob; - pmap_entry *pme; - ir_node **nodes, *n1, *n2; - int i, o; - - arch_env = chordal_env->arch_env; - - /* Collect all irns */ - obstack_init(&ob); - pmap_foreach(chordal_env->border_heads, pme) { - border_t *curr; - struct list_head *head = pme->value; - list_for_each_entry(border_t, curr, head, list) - if (curr->is_def && curr->is_real) - if (arch_get_irn_reg_class(arch_env, curr->irn, arch_pos_make_out(0)) == chordal_env->cls) - obstack_ptr_grow(&ob, curr->irn); - } - obstack_ptr_grow(&ob, NULL); - nodes = (ir_node **) obstack_finish(&ob); + be_timer_pop(T_CONSTR); - /* Check them */ - for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) { - const arch_register_t *n1_reg, *n2_reg; + env.live = bitset_malloc(get_irg_last_idx(chordal_env->irg)); - n1_reg = arch_get_irn_register(arch_env, n1, 0); - if (!arch_reg_is_allocatable(arch_env, n1, arch_pos_make_out(0), n1_reg)) { - DBG((dbg, 0, "Register assigned to %+F is not allowed\n", n1)); - assert(0 && "Register constraint does not hold"); - } - for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) { - n2_reg = arch_get_irn_register(arch_env, n2, 0); - if (nodes_interfere(chordal_env, n1, n2) && n1_reg == n2_reg) { - DBG((dbg, 0, "Values %+F and %+F interfere and have the same regiseter assigned\n", n1, n2)); - assert(0 && "Interfering values have the same color!"); - } - } - } - obstack_free(&ob, NULL); -} - -/* BETTER #ifdef BUILD_GRAPH --> faster version of checker with edges */ + /* First, determine the pressure */ + dom_tree_walk_irg(irg, create_borders, NULL, env.chordal_env); -void be_ra_chordal_done(be_chordal_env_t *env) -{ -#ifdef BUILD_GRAPH - { - if_node_t *ifn; - for(ifn = set_first(env->nodes); ifn; ifn = set_next(env->nodes)) - free(ifn->neighb); - free(env->nodes); - free(env->edges); + /* Assign the colors */ + dom_tree_walk_irg(irg, assign, NULL, &env); + + 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); } -#endif - pmap_destroy(env->border_heads); - obstack_free(&env->obst, NULL); - free(env); + bitset_free(env.live); + del_pset(env.pre_colored); } - - -int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b) +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal) +void be_init_chordal(void) { -#ifdef BUILD_GRAPH - return are_connected(env, get_irn_graph_nr(a), get_irn_graph_nr(b)); -#else - return values_interfere(a, b); -#endif /* BUILD_GRAPH */ -} - -#ifdef BUILD_GRAPH + static be_ra_chordal_coloring_t coloring = { + be_ra_chordal_color + }; + FIRM_DBG_REGISTER(dbg, "firm.be.chordal"); -set *be_ra_get_ifg_edges(const be_chordal_env_t *env) { - return env->edges; + be_register_chordal_coloring("default", &coloring); } - -set *be_ra_get_ifg_nodes(const be_chordal_env_t *env) { - return env->nodes; -} - -#endif