X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fberaextern.c;h=5ed39aa2cd1998e3d80859cccc69a46959443527;hb=857cb493902e7d54651141fd600f980c383d5fe6;hp=95f55f6749e713c246af1e0430bf4c7f20796574;hpb=33aa570d83562ebdb01369780e01b64fd0fa644d;p=libfirm diff --git a/ir/be/beraextern.c b/ir/be/beraextern.c index 95f55f674..5ed39aa2c 100644 --- a/ir/be/beraextern.c +++ b/ir/be/beraextern.c @@ -6,94 +6,99 @@ * * Implementation of the RA-Interface for an external, (non-SSA) register allocator. * - * The external register allocator is a program taking 2 arguments: - * 1) An input file in which the cfg is defined - * 2) An output file containing the essential actions performed during allocation + * The external register allocator is a program: + * PROG -i INPUTFILE -o OUTPUTFILE + * + * 1) Input file defines the interference graph + * 2) Output file contains the instructions to perform * The input file format ---------------------- -inputfile ::= regs cfg . +inputfile ::= regs nodes interf affinities . regs ::= 'regs' regcount . // Anzahl der register (0..regcount-1), die zur Verfuegung stehen -cfg ::= 'cfg' ident '{' block* edge* '}' . // Steuerflussgraph der Prozedur - -block ::= 'block' block-nr '{' insn* '}' . // Grundblock im cfg versehen mit einer nummer +nodes ::= 'nodes' '{' node* '}' . // All nodes in the graph -edge ::= 'cf-edge' block-nr block-nr . // Steuerflusskante src-->tgt +node ::= node-info + | node-info '<' reg-nr '>' . // Reg-nr is present in case of constraints -insn ::= gen-insn // Befehl in einem block - | copy-insn . +node-info ::= node-nr spill-costs . -gen-insn ::= 'insn' insn-nr '{' uses defs '}' . -copy-insn ::= 'copy' insn-nr '{' uses defs '}' . +interf ::= 'interferences' '{' i-edge* '}' . // Interference edges of the graph -defs ::= 'def' var-list . // Liste der definierten/verwendeten Variablen -uses ::= 'use' var-list . +i-edge ::= '(' node-nr ',' node-nr ')' . -var-list ::= var-ref - | var-ref var-list . +affinities ::= 'affinities' '{' a-edge* '}' . // Affinity edges of the graph -var-ref ::= var-nr - | var-nr '<' reg-nr '>' . // reg-nr gibt register constraint an. +a-edge ::= '(' node-nr ',' node-nr ',' weight ')' . -ident ::= non-whitespace-char* . -regcount, block-nr, insn-nr, reg-nr, var-nr ::= integer . - +weight, regcount, node-nr ::= int32 . +spill-costs ::= int32 . // negative spill costs indicate unspillable The output file format ----------------------- -outputfile ::= action* . +outputfile ::= spills | allocs . -action ::= 'spill' loc var-nr // insert a spill spill(var-nr); - | 'reload' loc var-nr var-nr // insert a reload var-nr[1] := reload(var-nr[2]); - | 'copy' loc var-nr var-nr // insert a copy var-nr[1] := var-nr[2]; - | 'assign' var-nr reg-nr . // assign var-nr the register reg-nr +spills ::= 'spills' node-nr+ . -loc ::= 'before' insn-nr - | 'after' insn-nr . +allocs ::= 'allocs' alloc* . -TODO - * - * End of file format docu */ +alloc ::= node-nr reg-nr . + + +******** End of file format docu ********/ #ifdef HAVE_CONFIG_H #include "config.h" #endif -#ifdef WIN32 -#include -#else -#include +#ifdef HAVE_MALLOC_H + #include +#endif +#ifdef HAVE_ALLOCA_H + #include #endif #include #include +#include #ifdef WITH_LIBCORE #include #include #endif -#include "pmap.h" +#include "set.h" #include "pset.h" +#include "pmap.h" #include "bitset.h" #include "irprintf_t.h" #include "irnode_t.h" #include "irgraph_t.h" #include "irgwalk.h" +#include "iredges_t.h" +#include "irdom_t.h" #include "phiclass.h" #include "beraextern.h" +#include "beabi.h" #include "bearch.h" #include "benode_t.h" -#include "besched.h" +#include "beirgmod.h" +#include "besched_t.h" #include "beutil.h" +#include "belive_t.h" +#include "beinsn_t.h" + +#include "bessadestrsimple.h" + +#define DBG_LEVEL 2 /** * Environment with all the needed stuff @@ -102,63 +107,16 @@ typedef struct _be_raext_env_t { arch_env_t *aenv; const arch_register_class_t *cls; ir_graph *irg; + dom_front_info_t *dom_info; - FILE *f; /**< file handle used for out- and input file */ - pmap *vars; /**< maps variable numbers (int) to the corresponding SSA-values (pset of irns) */ - pmap *blocks; /**< maps block numbers (int) to the block (ir_node*) having that node_nr */ + FILE *f; /**< file handle used for out- and input file */ + set *vars; /**< contains all be_var_info_t */ + int n_cls_vars; /**< length of the array cls_vars */ + be_var_info_t **cls_vars; /**< only the var_infos for current cls. needed for double iterating */ + DEBUG_ONLY(firm_dbg_module_t *dbg;) } be_raext_env_t; -/****************************************************************************** - ____ _ _ - / __ \ | | (_) - | | | |_ __ | |_ _ ___ _ __ ___ - | | | | '_ \| __| |/ _ \| '_ \/ __| - | |__| | |_) | |_| | (_) | | | \__ \ - \____/| .__/ \__|_|\___/|_| |_|___/ - | | - |_| - *****************************************************************************/ - - -static void ssa_destr_simple(be_raext_env_t *); -static void ssa_destr_rastello(be_raext_env_t *); -static void be_ra_extern_main(const be_main_env_t *env, ir_graph *irg); - -static void (*ssa_destr)(be_raext_env_t*) = ssa_destr_simple; -static char callee[128] = "echo"; -#ifdef WITH_LIBCORE - -static const lc_opt_enum_const_ptr_items_t ssa_destr_items[] = { - { "simple", ssa_destr_simple }, - { "rastello", ssa_destr_rastello }, - { NULL, NULL } -}; - -static lc_opt_enum_const_ptr_var_t ssa_destr_var = { - (const void **) &ssa_destr, ssa_destr_items -}; - -static const lc_opt_table_entry_t be_ra_extern_options[] = { - LC_OPT_ENT_ENUM_FUNC_PTR("ssa_destr", "SSA destruction flavor", &ssa_destr_var), - LC_OPT_ENT_STR("callee", "The external program to call", callee, sizeof(callee)), - { NULL } -}; - -static void be_ra_extern_register_options(lc_opt_entry_t *root) { - lc_opt_entry_t *grp = lc_opt_get_grp(root, "ext"); - - lc_opt_add_table(grp, be_ra_extern_options); -} - -#endif /* WITH_LIBCORE */ - -const be_ra_t be_ra_external_allocator = { -#ifdef WITH_LIBCORE - be_ra_extern_register_options, -#endif - be_ra_extern_main -}; /****************************************************************************** _ _ _ @@ -171,6 +129,10 @@ const be_ra_t be_ra_external_allocator = { |_| *****************************************************************************/ + +#define pset_foreach(pset, irn) for(irn=pset_first(pset); irn; irn=pset_next(pset)) +#define set_foreach(set, e) for(e=set_first(set); e; e=set_next(set)) + /** * Checks if _the_ result of the irn belongs to the * current register class (raenv->cls) @@ -178,203 +140,124 @@ const be_ra_t be_ra_external_allocator = { */ #define is_res_in_reg_class(irn) arch_irn_has_reg_class(raenv->aenv, irn, -1, raenv->cls) +static INLINE ir_node *get_first_non_phi(pset *s) { + ir_node *irn; -/** - * Checks if the irn uses or defines values of the - * current register class (raenv->cls) - */ -static INLINE int is_sth_in_reg_class(be_raext_env_t *raenv, const ir_node *irn) { - int max, i; - - /* check arguments */ - for (i=0, max=get_irn_arity(irn); iaenv, get_irn_n(irn, i), -1, raenv->cls)) - return 1; - - /* check result(s) */ - if (get_irn_mode(irn) == mode_T) { - ir_node *proj; - for (proj = sched_next(irn); is_Proj(proj); proj = sched_next(proj)) - if (arch_irn_has_reg_class(raenv->aenv, proj, -1, raenv->cls)) - return 1; - return 0; - } else { - return arch_irn_has_reg_class(raenv->aenv, irn, -1, raenv->cls); - } + pset_foreach(s, irn) + if (!is_Phi(irn)) { + pset_break(s); + return irn; + } - assert(0 && "Where did you come from???"); + assert(0 && "There must be a non-phi-irn in this"); + return NULL; } -/****************************************************************************** - _____ _____ _____ _ - / ____/ ____| /\ | __ \ | | - | (___| (___ / \ ______| | | | ___ ___| |_ _ __ - \___ \\___ \ / /\ \______| | | |/ _ \/ __| __| '__| - ____) |___) / ____ \ | |__| | __/\__ \ |_| | - |_____/_____/_/ \_\ |_____/ \___||___/\__|_| - - *****************************************************************************/ - -#define mark_as_done(irn, pos) set_irn_link(irn, INT_TO_PTR(pos+1)) -#define has_been_done(irn, pos) (PTR_TO_INT(get_irn_link(irn)) > pos) +static INLINE ir_node *get_first_phi(pset *s) { + ir_node *irn; -/** - * Insert a copy for the argument of @p start_phi found at position @p pos. - * Also searches a phi-loop of arbitrary length to detect and resolve - * the class of phi-swap-problems. To search for a loop recursion is used. - * - * 1) Simplest case (phi with a non-phi arg): - * A single copy is inserted. - * - * 2) Phi chain (phi (with phi-arg)* with non=phi arg): - * Several copies are placed, each after returning from recursion. - * - * 3) Phi-loop: - * On detection a loop breaker is inserted, which is a copy of the start_phi. - * This copy then pretends beeing the argumnent of the last phi. - * Now case 2) can be used. - * - * The values of @p start_phi and @p pos never change during recursion. - * - * @p raenv Environment with all the stuff needed - * @p start_phi Phi node to process - * @p pos Argument position to insert copy/copies for - * @p curr_phi Phi node currently processed during recursion. Equals start_phi on initial call - * - * @return NULL If no copy is necessary - * NULL If the phi has already been processed at this pos - * Link field is used to keep track of processed positions - * In all other cases the ir_node *copy which was placed is returned. - */ -static ir_node *insert_copies(be_raext_env_t *raenv, ir_node *start_phi, int pos, ir_node *curr_phi) { - ir_node *arg = get_irn_n(curr_phi, pos); - ir_node *arg_blk = get_nodes_block(arg); - ir_node *pred_blk = get_Block_cfgpred_block(get_nodes_block(curr_phi), pos); - ir_node *curr_cpy, *last_cpy; - - assert(is_Phi(start_phi) && is_Phi(curr_phi)); - - if (has_been_done(start_phi, pos)) - return NULL; - - /* In case this is a 'normal' phi we insert into - * the schedule before the pred_blk irn */ - last_cpy = pred_blk; - - /* If we detect a loop stop recursion. */ - if (arg == start_phi) { - ir_node *loop_breaker; - if (start_phi == curr_phi) { - /* Phi directly uses itself. No copy necessary */ - return NULL; + pset_foreach(s, irn) + if (is_Phi(irn)) { + pset_break(s); + return irn; } - /* At least 2 phis are involved */ - /* Insert a loop breaking copy (an additional variable T) */ - loop_breaker = be_new_Copy(raenv->cls, raenv->irg, pred_blk, start_phi); - sched_add_before(pred_blk, loop_breaker); - - arg = loop_breaker; - } + assert(0 && "There must be a phi in this"); + return NULL; +} - /* If arg is a phi in the same block we have to continue search */ - if (is_Phi(arg) && arg_blk == get_nodes_block(start_phi)) - last_cpy = insert_copies(raenv, start_phi, pos, arg); +static int get_loop_weight(ir_node *irn) { + int cost = 0; + ir_loop *loop = get_irn_loop(get_nodes_block(irn)); - /* Insert copy of argument (may be the loop-breaker) */ - curr_cpy = be_new_Copy(raenv->cls, raenv->irg, pred_blk, arg); - set_irn_n(curr_phi, pos, curr_cpy); - mark_as_done(curr_phi, pos); - sched_add_before(last_cpy, curr_cpy); - return curr_cpy; + if (loop) { + int d = get_loop_depth(loop); + cost = d*d; + } + return cost+1; } +#define get_const_weight(irn) (1) -/** - * Perform simple SSA-destruction with copies. - * The order of processing _must_ be - * for all positions { - * for all phis { - * doit - * } - * } - * else the magic to keep track of processed phi-positions will fail in - * function 'insert_copies' - */ -static void ssa_destr_simple_walker(ir_node *blk, void *env) { - be_raext_env_t *raenv = env; - int pos, max; - ir_node *phi; +#define get_spill_weight(irn) get_loop_weight(irn) +#define get_reload_weight(irn) get_loop_weight(irn) +#define get_affinity_weight(irn) get_loop_weight(irn) + +/****************************************************************************** + _____ _ _____ _ + / ____| | | / ____| (_) + | | ___ _ __ ___| |_ _ __ | | ___ _ __ _ ___ ___ + | | / _ \| '_ \/ __| __| '__| | | / _ \| '_ \| |/ _ \/ __| + | |___| (_) | | | \__ \ |_| | | |___| (_) | |_) | | __/\__ \ + \_____\___/|_| |_|___/\__|_| \_____\___/| .__/|_|\___||___/ + | | + |_| + *****************************************************************************/ - /* for all argument positions of the phis */ - for (pos=0, max=get_irn_arity(blk); posirn); + int i; - /* for all phi nodes (which are scheduled first) */ - sched_foreach(blk, phi) { - if (!is_Phi(phi)) - break; + for(i = 0; i < insn->use_start; ++i) { + be_operand_t *op = &insn->ops[i]; - raenv->cls = arch_get_irn_reg_class(raenv->aenv, phi, -1); - insert_copies(raenv, phi, pos, phi); + if(op->has_constraints) { + ir_node *cpy = be_new_Copy(op->req.cls, env->irg, bl, op->carrier); + sched_add_before(insn->next_insn, cpy); + edges_reroute(op->carrier, cpy, env->irg); } } -} + for(i = insn->use_start; i < insn->n_ops; ++i) { + be_operand_t *op = &insn->ops[i]; -static void ssa_destr_simple(be_raext_env_t *raenv) { - be_clear_links(raenv->irg); - irg_block_walk_graph(raenv->irg, ssa_destr_simple_walker, NULL, raenv); + if(op->has_constraints) { + ir_node *cpy = be_new_Copy(op->req.cls, env->irg, bl, op->carrier); + sched_add_before(insn->irn, cpy); + set_irn_n(insn->irn, op->pos, cpy); + be_set_constr_limited(cpy, BE_OUT_POS(0), &op->req); + } + } } +static void handle_constraints_block(ir_node *bl, void *data) +{ + be_raext_env_t *raenv = data; + int active = bl != get_irg_start_block(raenv->irg); -static void ssa_destr_rastello(be_raext_env_t *raenv) { - phi_class_compute(raenv->irg); - //TODO irg_block_walk_graph(irg, ssa_destr_rastello, NULL, &raenv); -} + ir_node *irn; + be_insn_env_t ie; + struct obstack obst; -/****************************************************************************** - __ __ _ ___ __ __ - \ \ / / | | |__ \ \ \ / / - \ \ / /_ _| |___ ) | \ \ / /_ _ _ __ ___ - \ \/ / _` | / __| / / \ \/ / _` | '__/ __| - \ / (_| | \__ \ / /_ \ / (_| | | \__ \ - \/ \__,_|_|___/ |____| \/ \__,_|_| |___/ - *****************************************************************************/ + ie.cls = raenv->cls; + ie.aenv = raenv->aenv; + ie.obst = &obst; + ie.ignore_colors = NULL; + obstack_init(&obst); -#define pmap_insert_sth(pmap, key, val) pmap_insert(pmap, (void *)key, (void *)val) -#define pmap_get_sth(pmap, key) pmap_get(pmap, (void *)key) -#define set_var_nr(irn, nr) set_irn_link(irn, INT_TO_PTR(nr)) -#define get_var_nr(irn) PTR_TO_INT(get_irn_link(irn)) + irn = sched_first(bl); + while(!sched_is_end(irn)) { + be_insn_t *insn = be_scan_insn(&ie, irn); -/** - * Define variables (numbers) for all SSA-values. - * All values in a phi class get assigned the same variable name. - * The link field maps values to the var-name - */ -static void values_to_vars(ir_node *irn, void *env) { - be_raext_env_t *raenv = env; - ir_node *n; - int nr; - pset *vals; + if(insn->has_constraints) + handle_constraints_insn(raenv, insn); - vals = get_phi_class(irn); + if(be_is_Barrier(irn)) + active = !active; - if (!vals) { - /* not a phi class member, value == var */ - vals = pset_new_ptr(1); - pset_insert_ptr(vals, irn); + irn = insn->next_insn; + obstack_free(&obst, insn); } +} - /* value to var mapping */ - n = pset_first(vals); - nr = get_irn_node_nr(n); - for (; n; n=pset_next(vals)) - set_var_nr(irn, nr); - - /* var to values mapping */ - pmap_insert_sth(raenv->vars, nr, vals); +static void handle_constraints(be_raext_env_t *raenv) { + irg_block_walk_graph(raenv->irg, NULL, handle_constraints_block, raenv); } + + + /****************************************************************************** _____ | __ \ @@ -387,6 +270,24 @@ static void values_to_vars(ir_node *irn, void *env) { *****************************************************************************/ +static void extract_vars_of_cls(be_raext_env_t *raenv) { + int count = 0; + be_var_info_t *vi; + + raenv->cls_vars = xmalloc(set_count(raenv->vars) * sizeof(*raenv->cls_vars)); + assert(raenv->cls_vars); + + set_foreach(raenv->vars, vi) + if (is_res_in_reg_class(get_first_non_phi(vi->values))) + raenv->cls_vars[count++] = vi; + + raenv->cls_vars = realloc(raenv->cls_vars, count * sizeof(*raenv->cls_vars)); + assert(raenv->cls_vars); + + raenv->n_cls_vars = count; +} + + /** * Check if node irn has a limited-constraint at position pos. * If yes, dump it to FILE raenv->f @@ -398,101 +299,139 @@ static INLINE void dump_constraint(be_raext_env_t *raenv, ir_node *irn, int pos) arch_get_register_req(raenv->aenv, &req, irn, pos); if (arch_register_req_is(&req, limited)) { int reg_nr; - req.limited(irn, pos, bs); + req.limited(req.limited_env, bs); reg_nr = bitset_next_set(bs, 0); - fprintf(raenv->f, " <%d>", reg_nr); + fprintf(raenv->f, "<%d>", reg_nr); assert(-1 == bitset_next_set(bs, reg_nr+1) && "Constraints with more than 1 possible register are not supported"); } } +#define UNSPILLABLE -1 -/** - * Dump all blocks and instructions in that block - */ -static void dump_blocks(ir_node *blk, void *env) { - be_raext_env_t *raenv = env; +static INLINE int get_spill_costs(be_raext_env_t *raenv, be_var_info_t *vi) { ir_node *irn; + int c_spills=0, c_reloads=0; + + pset_foreach(vi->values, irn) { + if (arch_irn_is(raenv->aenv, irn, ignore) || be_is_Reload(irn)) { + pset_break(vi->values); + return UNSPILLABLE; + } + + if (is_Phi(irn)) { + /* number of reloads is the number of non-phi uses of all values of this var */ + const ir_edge_t *edge; + foreach_out_edge(irn, edge) + if (!is_Phi(edge->src)) + c_reloads += get_reload_weight(edge->src); + } else { + /* number of spills is the number of non-phi values for this var */ + c_spills += get_spill_weight(irn); + } + } + + return c_spills + c_reloads; +} + +static void dump_nodes(be_raext_env_t *raenv) { FILE *f = raenv->f; - int nr = get_irn_node_nr(blk); + int i; - pmap_insert_sth(raenv->blocks, nr, blk); + fprintf(f, "\nnodes {\n"); - /* begin block scope */ - fprintf(f, "\n"); - fprintf(f, " block %d {\n", nr); + for (i=0; in_cls_vars; ++i) { + be_var_info_t *vi = raenv->cls_vars[i]; - /* for each instruction */ - for(irn=sched_first(blk); !sched_is_end(irn); irn=sched_next(irn)) { - int max, i; - if (is_Phi(irn) || !is_sth_in_reg_class(raenv, irn)) + if (vi->var_nr == SET_REMOVED) continue; - if (be_is_Copy(irn)) - fprintf(f, " copy"); - else - fprintf(f, " insn"); - - fprintf(f, " %ld {\n", get_irn_node_nr(irn)); - - /* - * print all uses - */ - fprintf(f, " use"); - for (i=0, max=get_irn_arity(irn); iaenv, arg, -1, raenv->cls)) { - fprintf(f, " %d", get_var_nr(arg)); - dump_constraint(raenv, irn, i); - } - } - fprintf(f,"\n"); - - /* - * print all defs - */ - fprintf(f, " def"); - /* special handling of projs */ - if (get_irn_mode(irn) == mode_T) { - for (irn = sched_next(irn); is_Proj(irn); irn = sched_next(irn)) - if (arch_irn_has_reg_class(raenv->aenv, irn, -1, raenv->cls)) { - fprintf(f, " %d", get_var_nr(irn)); - dump_constraint(raenv, irn, -1); - } - irn = sched_prev(irn); /* for outer loop */ - } else { - if (arch_irn_has_reg_class(raenv->aenv, irn, -1, raenv->cls)) { - fprintf(f, " %d", get_var_nr(irn)); - dump_constraint(raenv, irn, -1); - } - } - fprintf(f,"\n"); - - fprintf(f, " }\n"); + fprintf(f, "%d %d", vi->var_nr, get_spill_costs(raenv, vi)); + dump_constraint(raenv, get_first_non_phi(vi->values), -1); + fprintf(f, "\n"); } - /* end the block scope */ - fprintf(f, " }\n"); + fprintf(f, "}\n"); + fflush(f); } -/** - * Dump all control flow edges of this irg - */ -static void dump_edges(ir_node *blk, void *env) { +static void dump_interferences(be_raext_env_t *raenv) { + int i,o; + be_var_info_t *vi1, *vi2; + ir_node *irn1, *irn2; + FILE *f = raenv->f; + + fprintf(f, "\ninterferences {\n"); + + for (i=0; in_cls_vars; ++i) { + vi1 = raenv->cls_vars[i]; + + if (vi1->var_nr == SET_REMOVED) + continue; + + for (o=i+1; on_cls_vars; ++o) { + vi2 = raenv->cls_vars[o]; + + if (vi2->var_nr == SET_REMOVED) + continue; + + pset_foreach(vi1->values, irn1) + pset_foreach(vi2->values, irn2) + if (values_interfere(irn1, irn2)) { + pset_break(vi1->values); + pset_break(vi2->values); + fprintf(f, "(%d, %d)\n", vi1->var_nr, vi2->var_nr); + goto NextVar; + } + +NextVar: ; + } + } + fprintf(f, "}\n"); +} + +static void dump_affinities_walker(ir_node *irn, void *env) { be_raext_env_t *raenv = env; - int i, max; + arch_register_req_t req; + int pos, max; + be_var_info_t *vi1, *vi2; - if (get_irg_start_block(get_irn_irg(blk)) == blk) + if (arch_get_irn_reg_class(raenv->aenv, irn, -1) != raenv->cls || arch_irn_is(raenv->aenv, irn, ignore)) return; - /* dump cf edges in the flow-order "pred succ" */ - for (i=0, max=get_irn_arity(blk); if, " cf_edge %ld %ld\n", get_irn_node_nr(pred), get_irn_node_nr(blk)); + vi1 = be_get_var_info(irn); + + /* copies have affinities */ + if (arch_irn_classify(raenv->aenv, irn) == arch_irn_class_copy) { + ir_node *other = be_get_Copy_op(irn); + + if (! arch_irn_is(raenv->aenv, other, ignore)) { + vi2 = be_get_var_info(other); + + fprintf(raenv->f, "(%d, %d, %d)\n", vi1->var_nr, vi2->var_nr, get_affinity_weight(irn)); + } + } + + + /* should_be_equal constraints are affinites */ + for (pos = 0, max = get_irn_arity(irn); posaenv, &req, irn, pos); + + if (arch_register_req_is(&req, should_be_same) && arch_irn_is(raenv->aenv, req.other_same, ignore)) { + vi2 = be_get_var_info(req.other_same); + + fprintf(raenv->f, "(%d, %d, %d)\n", vi1->var_nr, vi2->var_nr, get_affinity_weight(irn)); + } } } +static void dump_affinities(be_raext_env_t *raenv) { + fprintf(raenv->f, "\naffinities {\n"); + irg_walk_graph(raenv->irg, NULL, dump_affinities_walker, raenv); + fprintf(raenv->f, "}\n"); +} + /** * Dump all information needed by the external * register allocator to a single file. @@ -502,22 +441,22 @@ static void dump_to_file(be_raext_env_t *raenv, char *filename) { if (!(f = fopen(filename, "wt"))) { fprintf(stderr, "Could not open file %s for writing\n", filename); + assert(0); exit(0xdeadbeef); } raenv->f = f; + /* dump register info */ fprintf(f, "regs %d\n", arch_register_class_n_regs(raenv->cls)); - fprintf(f, "cfg %s {\n", filename); - irg_block_walk_graph(raenv->irg, NULL, dump_blocks, raenv); - irg_block_walk_graph(raenv->irg, NULL, dump_edges, raenv); - - fprintf(f, "}\n"); + /* dump the interference graph */ + dump_nodes(raenv); + dump_interferences(raenv); + dump_affinities(raenv); fclose(f); } - /****************************************************************************** ______ _ | ____| | | @@ -531,14 +470,16 @@ static void dump_to_file(be_raext_env_t *raenv, char *filename) { * Execute the external register allocator specified in the * firm-option firm.be.ra.ext.callee */ -static void execute(char *out_file, char *result_file) { +static void execute(char *prog_to_call, char *out_file, char *result_file) { char cmd_line[1024]; int ret_status; - snprintf(cmd_line, sizeof(cmd_line), "%s %s %s", callee, out_file, result_file); + snprintf(cmd_line, sizeof(cmd_line), "%s -i %s -o %s", prog_to_call, out_file, result_file); + cmd_line[sizeof(cmd_line) - 1] = '\0'; ret_status = system(cmd_line); assert(ret_status != -1 && "Invokation of external register allocator failed"); + assert(ret_status == 0 && "External register allocator is unhappy with sth."); } /****************************************************************************** @@ -552,69 +493,186 @@ static void execute(char *out_file, char *result_file) { |_| |_| |___/ *****************************************************************************/ -#define pset_foreach(pset, irn) for(irn=pset_first(pset); irn; irn=pset_next(pset)) +/** + * Spill a variable and add reloads before all uses. + */ +static INLINE void var_add_spills_and_reloads(be_raext_env_t *raenv, int var_nr) { + be_var_info_t *vi = be_var_find(raenv->vars, var_nr); + ir_node *spill=NULL, *ctx, *irn; + ir_mode *mode; + const ir_edge_t *edge, *ne; + pset *spills = pset_new_ptr(4); /* the spills of this variable */ + pset *reloads = pset_new_ptr(4); /* the reloads of this variable */ + int new_size, n_spills, n_reloads; + + assert(vi && "Variable nr does not exist!"); + assert(pset_count(vi->values) && "There are no values associated to this variable"); + + /* the spill context is set to an arbitrary node of the phi-class, + * or the node itself if it is not member of a phi class + */ + if (pset_count(vi->values) == 1) + ctx = get_first_non_phi(vi->values); + else + ctx = get_first_phi(vi->values); + + DBG((raenv->dbg, LEVEL_2, "Spill context: %+F\n", ctx)); + + /* for each value of this variable insert the spills */ + pset_foreach(vi->values, irn) { + if (is_Phi(irn)) { + sched_remove(irn); + continue; + } -#define INVALID_FILE_FORMAT assert(0 && "Invalid file format.") + /* all ordinary nodes must be spilled */ + DBG((raenv->dbg, LEVEL_2, " spilling %+F\n", irn)); + spill = be_spill(raenv->aenv, irn, ctx); + + /* remember the spill */ + pset_insert_ptr(spills, spill); + } + + assert(spill && "There must be at least one non-phi-node"); + + mode = get_irn_mode(get_irn_n(spill, be_pos_Spill_val)); + + /* insert reloads and wire them arbitrary*/ + pset_foreach(vi->values, irn) + foreach_out_edge_safe(irn, edge, ne) { + ir_node *reload, *src = edge->src; + if (is_Phi(src) || be_is_Spill(src)) + continue; + + /* all real uses must be reloaded */ + DBG((raenv->dbg, LEVEL_2, " reloading before %+F\n", src)); + reload = be_reload(raenv->aenv, raenv->cls, edge->src, mode, spill); + set_irn_n(edge->src, edge->pos, reload); + + /* remember the reload */ + pset_insert_ptr(reloads, reload); + } + + /* correct the reload->spill pointers... */ + be_ssa_constr_set(raenv->dom_info, spills); + + + /****** correct the variable <--> values mapping: ****** + * + * - if we had a phi class it gets split into several new variables + * - all reloads are new variables + */ + n_spills = pset_count(spills); + n_reloads = pset_count(reloads); -static INLINE int get_location(const char *s, size_t len) { - if (!strncmp(s, "before", len)) - return 1; - if (!strncmp(s, "after", len)) - return 0; - INVALID_FILE_FORMAT; - return -1; + /* first make room for new pointers in the cls_var array */ + new_size = raenv->n_cls_vars + n_reloads + ((n_spills>1) ? n_spills : 0); + raenv->cls_vars = realloc(raenv->cls_vars, (new_size) * sizeof(*raenv->cls_vars)); + assert(raenv->cls_vars && "Out of mem!?"); + + /* if we had a real phi-class, we must... */ + if (pset_count(spills) > 1) { + /* ...remove the old variable corresponding to the phi class */ + vi->var_nr = SET_REMOVED; + + /* ...add new vars for each non-phi-member */ + pset_foreach(spills, irn) { + ir_node *spilled = get_irn_n(irn, be_pos_Spill_val); + raenv->cls_vars[raenv->n_cls_vars++] = be_var_add_value(raenv->vars, get_irn_node_nr(spilled), spilled); + } + } + + /* add new variables for all reloads */ + pset_foreach(reloads, irn) { + assert(get_irn_node_nr(irn) != 1089); + raenv->cls_vars[raenv->n_cls_vars++] = be_var_add_value(raenv->vars, get_irn_node_nr(irn), irn); + } + + del_pset(spills); + del_pset(reloads); } +#define INVALID_FILE_FORMAT assert(0 && "Invalid file format.") +#define BUFLEN 32 +#define BUFCONV " %32s " + /** * Read in the actions performed by the external allocator. * Apply these transformations to the irg. + * @return 1 if an allocation was read in. 0 otherwise. */ -static void read_and_apply_results(be_raext_env_t *raenv, char *filename) { +static int read_and_apply_results(be_raext_env_t *raenv, char *filename) { FILE *f; - pmap_entry *pme; + char buf[BUFLEN]; + int is_allocation = 0; if (!(f = fopen(filename, "rt"))) { fprintf(stderr, "Could not open file %s for reading\n", filename); + assert(0); exit(0xdeadbeef); } raenv->f = f; - /* parse the file */ - while (!feof(f)) { - int loc, var_use, var_def, reg_nr; - char where[16]; + /* read the action */ + if (fscanf(f, BUFCONV, buf) != 1) + INVALID_FILE_FORMAT; + + /* do we spill */ + if (!strcmp(buf, "spills")) { + int var_nr; + while (fscanf(f, " %d ", &var_nr) == 1) + var_add_spills_and_reloads(raenv, var_nr); + } else - /* assign register */ - if (fscanf(f, " assign %d %d ", &var_use, ®_nr) == 2) { - pset *vals = pmap_get_sth(raenv->vars, var_use); + /* or do we allocate */ + if (!strcmp(buf, "allocs")) { + int var_nr, reg_nr; + + is_allocation = 1; + while (fscanf(f, " %d %d ", &var_nr, ®_nr) == 2) { ir_node *irn; + pset *vals = be_get_var_values(raenv->vars, var_nr); - assert(vals && "Variable does not (yet?) exist!"); + assert(vals && "Variable nr does not exist!"); pset_foreach(vals, irn) - arch_set_irn_register(raenv->aenv, irn, arch_register_for_index(raenv->cls, var_use)); + arch_set_irn_register(raenv->aenv, irn, arch_register_for_index(raenv->cls, reg_nr)); } + } else + INVALID_FILE_FORMAT; - /* handle a reload */ - else if (fscanf(f, " reload %s %d %d %d ", &where, &loc, &var_def, &var_use) == 4) { - int before = get_location(where, sizeof(where)); - /* TODO */ - } + if (!feof(f)) + INVALID_FILE_FORMAT; - /* handle a spill */ - else if (fscanf(f, " spill %6s %d %d ", &where, &loc, &var_use) == 3) { - int before = get_location(where, sizeof(where)); - /* TODO */ - } + fclose(f); - else - INVALID_FILE_FORMAT; - } + return is_allocation; +} - fclose(f); +static void check_allocation(be_raext_env_t *raenv) { + int i, o; + + for (i=0; in_cls_vars; ++i) { + be_var_info_t *vi1 = raenv->cls_vars[i]; + + if (vi1->var_nr == SET_REMOVED) + continue; + + for (o=0; ocls_vars[o]; + ir_node *irn1, *irn2; - /* Free the psets holding the variable-equivalence classes */ - pmap_foreach(raenv->vars, pme) - del_pset(pme->value); + if (vi2->var_nr == SET_REMOVED) + continue; + + pset_foreach(vi1->values, irn1) + pset_foreach(vi2->values, irn2) + if (values_interfere(irn1, irn2) && arch_get_irn_register(raenv->aenv, irn1) == arch_get_irn_register(raenv->aenv, irn2)) { + dump_ir_block_graph_sched(raenv->irg, "ERROR"); + ir_fprintf(stdout, "SSA values %+F and %+F interfere. They belong to varible %d and %d respectively.\n", irn1, irn2, vi1->var_nr, vi2->var_nr); + assert(0 && "ERROR graph dumped"); + } + } + } } /****************************************************************************** @@ -626,6 +684,14 @@ static void read_and_apply_results(be_raext_env_t *raenv, char *filename) { |_| |_|\__,_|_|_| |_| *****************************************************************************/ +/** + * Default values for options + */ +static set* (*ssa_destr)(ir_graph*,const arch_env_t*) = be_ssa_destr_simple; +static char callee[128] = "\"E:/user/kimohoff/public/register allocator\""; +//static char callee[128] = "/ben/kimohoff/ipd-registerallocator/register_allocator"; + + /** * Allocate registers with an external program using a text-file interface. * @@ -635,40 +701,114 @@ static void read_and_apply_results(be_raext_env_t *raenv, char *filename) { * Read in results and apply them * */ -static void be_ra_extern_main(const be_main_env_t *env, ir_graph *irg) { - be_raext_env_t raenv; +static be_ra_timer_t *be_ra_extern_main(const be_irg_t *bi) { + be_main_env_t *env = bi->main_env; + ir_graph *irg = bi->irg; + + be_raext_env_t raenv; int clsnr, clss; - raenv.irg = irg; - raenv.aenv = env->arch_env; - raenv.vars = pmap_create(); - raenv.blocks = pmap_create(); + compute_doms(irg); + edges_assure(irg); + + raenv.irg = irg; + raenv.aenv = env->arch_env; + raenv.dom_info = be_compute_dominance_frontiers(irg); + FIRM_DBG_REGISTER(raenv.dbg, "firm.be.raextern"); + + /* Insert copies for constraints */ + for(clsnr = 0, clss = arch_isa_get_n_reg_class(raenv.aenv->isa); clsnr < clss; ++clsnr) { + raenv.cls = arch_isa_get_reg_class(raenv.aenv->isa, clsnr); + handle_constraints(&raenv); + } - /* SSA destruction */ - ssa_destr(&raenv); + be_dump(irg, "-extern-constr", dump_ir_block_graph_sched); - be_clear_links(irg); - phi_class_compute(irg); - irg_walk_graph(irg, values_to_vars, NULL, &raenv); + /* SSA destruction respectively transformation into "Conventional SSA" */ + raenv.vars = be_ssa_destr_simple(irg, env->arch_env); + be_dump(irg, "-extern-ssadestr", dump_ir_block_graph_sched); - dump_ir_block_graph_sched(irg, "-extern-ssadestr"); /* For all register classes */ for(clsnr = 0, clss = arch_isa_get_n_reg_class(raenv.aenv->isa); clsnr < clss; ++clsnr) { + int done, round = 1; char out[256], in[256]; raenv.cls = arch_isa_get_reg_class(raenv.aenv->isa, clsnr); - ir_snprintf(out, sizeof(out), "%F-%s.ra", irg, raenv.cls->name); - ir_snprintf(in, sizeof(in), "%F-%s.ra.res", irg, raenv.cls->name); - dump_to_file(&raenv, out); + extract_vars_of_cls(&raenv); - execute(out, in); + do { + ir_snprintf(out, sizeof(out), "%F-%s-%d.ra", irg, raenv.cls->name, round); + ir_snprintf(in, sizeof(in), "%F-%s-%d.ra.res", irg, raenv.cls->name, round); - read_and_apply_results(&raenv, in); + be_liveness(irg); + + dump_to_file(&raenv, out); + execute(callee, out, in); + done = read_and_apply_results(&raenv, in); + be_abi_fix_stack_nodes(bi->abi); + + ir_snprintf(in, sizeof(in), "-extern-%s-round-%d", raenv.cls->name, round); + be_dump(irg, in, dump_ir_block_graph_sched); + + round++; + } while (!done); + + check_allocation(&raenv); + + free(raenv.cls_vars); } + be_dump(irg, "-extern-alloc", dump_ir_block_graph_sched); + /* Clean up */ - pmap_destroy(raenv.blocks); - pmap_destroy(raenv.vars); + free_ssa_destr_simple(raenv.vars); + be_free_dominance_frontiers(raenv.dom_info); + + return NULL; } + +/****************************************************************************** + ____ _ _ + / __ \ | | (_) + | | | |_ __ | |_ _ ___ _ __ ___ + | | | | '_ \| __| |/ _ \| '_ \/ __| + | |__| | |_) | |_| | (_) | | | \__ \ + \____/| .__/ \__|_|\___/|_| |_|___/ + | | + |_| + *****************************************************************************/ + +#ifdef WITH_LIBCORE + + +static const lc_opt_enum_func_ptr_items_t ssa_destr_items[] = { + { "simple", (int (*)()) be_ssa_destr_simple }, /* TODO make (void*) casts nicer */ + { NULL, NULL } +}; + +static lc_opt_enum_func_ptr_var_t ssa_destr_var = { + (int (**)()) &ssa_destr, ssa_destr_items +}; + +static const lc_opt_table_entry_t be_ra_extern_options[] = { + LC_OPT_ENT_ENUM_FUNC_PTR("ssa_destr", "SSA destruction flavor", &ssa_destr_var), + LC_OPT_ENT_STR("callee", "The external program to call", callee, sizeof(callee)), + { NULL } +}; + +static void be_ra_extern_register_options(lc_opt_entry_t *root) { + lc_opt_entry_t *grp = lc_opt_get_grp(root, "ext"); + + lc_opt_add_table(grp, be_ra_extern_options); +} + +#endif /* WITH_LIBCORE */ + +const be_ra_t be_ra_external_allocator = { +#ifdef WITH_LIBCORE + be_ra_extern_register_options, +#endif + be_ra_extern_main +};