X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespillbelady.c;h=08aa8d5a6dc05441ea63446f288fbbdb4835fe2d;hb=50234c949b8432ee8db8e45079cad83a6383fa49;hp=bf1628943a5719beac430a1e27a85cc0d7aa5928;hpb=fd36bead18e3a2d5d6d5b9129c15c1c959e8c8a7;p=libfirm diff --git a/ir/be/bespillbelady.c b/ir/be/bespillbelady.c index bf1628943..08aa8d5a6 100644 --- a/ir/be/bespillbelady.c +++ b/ir/be/bespillbelady.c @@ -4,17 +4,27 @@ * Copyright: (c) Universitaet Karlsruhe * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. */ +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif +#ifdef HAVE_ALLOCA_H #include +#endif + +#ifdef HAVE_MALLOC_H +#include +#endif + #include "obst.h" #include "set.h" #include "pset.h" #include "irgraph.h" #include "irnode.h" #include "irmode.h" -#include "ircons.h" #include "irgwalk.h" #include "iredges_t.h" +#include "ircons_t.h" #include "beutil.h" #include "bearch.h" @@ -24,55 +34,24 @@ #include "beirgmod.h" #include "belive_t.h" #include "benode_t.h" - -#define MIN(a,b) (((a)<(b))?(a):(b)) - -#define DBG_DECIDE 1 -#define DBG_WSETS 2 -#define DBG_FIX 4 -#define DBG_SPILL 8 -#define DBG_TRACE 32 -#define DEBUG_LVL (DBG_DECIDE | DBG_WSETS | DBG_FIX | DBG_SPILL) +#include "bechordal_t.h" + +#define DBG_SPILL 1 +#define DBG_WSETS 2 +#define DBG_FIX 4 +#define DBG_DECIDE 8 +#define DBG_START 16 +#define DBG_TRACE 64 +#define DEBUG_LVL SET_LEVEL_0 //(DBG_START | DBG_DECIDE | DBG_WSETS | DBG_FIX | DBG_SPILL) static firm_dbg_module_t *dbg = NULL; +#define MIN(a,b) (((a)<(b))?(a):(b)) +#define SINGLE_START_PROJS typedef struct _workset_t workset_t; -typedef struct _block_info_t block_info_t; -typedef struct _reloader_t reloader_t; -typedef struct _spill_info_t spill_info_t; -typedef struct _spill_ctx_t spill_ctx_t; -typedef struct _belady_env_t belady_env_t; - -struct _workset_t { - belady_env_t *bel; - int i; /**< used for iteration */ - int len; /**< current length */ - loc_t vals[1]; /**< inlined array of the values/distances in this working set */ -}; - -struct _block_info_t { - workset_t *ws_start, *ws_end; -}; - -struct _reloader_t { - reloader_t *next; - ir_node *reloader; -}; -struct _spill_info_t { - ir_node *spilled_node; - reloader_t *reloaders; -}; - -struct _spill_ctx_t { - ir_node *spilled; /**< The spilled node. */ - ir_node *user; /**< The node this spill is for. */ - ir_node *spill; /**< The spill itself. */ -}; - -struct _belady_env_t { +typedef struct _belady_env_t { struct obstack ob; - const be_main_session_env_t *session; const be_node_factory_t *factory; const arch_env_t *arch; const arch_register_class_t *cls; @@ -83,24 +62,21 @@ struct _belady_env_t { ir_node *instr; /**< current instruction */ unsigned instr_nr; /**< current instruction number (relative to block start) */ pset *used; /**< holds the values used (so far) in the current BB */ - set *spills; /**< all spill_info_t's, which must be placed */ - set *spill_ctxs; /**< all spill contexts (multiple spilling and stop recursion) */ - pset *mem_phis; /**< all phis which must be converted to memory phis */ + spill_env_t *senv; /* see bespill.h */ pset *reloads; /**< all reload nodes placed */ -}; +} belady_env_t; -static int set_cmp_spillinfo(const void *x, const void *y, size_t size) { - const spill_info_t *xx = x; - const spill_info_t *yy = y; - return ! (xx->spilled_node == yy->spilled_node); -} +struct _workset_t { + belady_env_t *bel; + int i; /**< used for iteration */ + int len; /**< current length */ + loc_t vals[1]; /**< inlined array of the values/distances in this working set */ +}; -static int set_cmp_spillctx(const void *a, const void *b, size_t n) { - const spill_ctx_t *p = a; - const spill_ctx_t *q = b; - return !(p->user == q->user && p->spilled == q->spilled); -} +typedef struct _block_info_t { + workset_t *ws_start, *ws_end; +} block_info_t; /** * Alloc a new workset on obstack @p ob with maximum size @p max @@ -128,10 +104,9 @@ static INLINE workset_t *workset_clone(struct obstack *ob, workset_t *ws) { */ static INLINE void workset_insert(workset_t *ws, ir_node *val) { int i; - assert(ws->len < ws->bel->n_regs && "Workset already full!"); /* check for current regclass */ - if (arch_get_irn_reg_class(ws->bel->arch, val, 0) != ws->bel->cls) { - DBG((dbg, 0, "Dropped %+F\n", val)); + if (arch_get_irn_reg_class(ws->bel->arch, val, -1) != ws->bel->cls) { + DBG((dbg, DBG_DECIDE, "Dropped %+F\n", val)); return; } @@ -141,6 +116,7 @@ static INLINE void workset_insert(workset_t *ws, ir_node *val) { return; /* insert val */ + assert(ws->len < ws->bel->n_regs && "Workset already full!"); ws->vals[ws->len++].irn = val; } @@ -151,13 +127,12 @@ static INLINE void workset_insert(workset_t *ws, ir_node *val) { */ static INLINE void workset_bulk_insert(workset_t *ws, int cnt, ir_node **vals) { int i, o; - assert(ws->len + cnt <= ws->bel->n_regs && "Workset does not have enough room!"); for(o=0; obel->arch, val, 0) != ws->bel->cls) { + if (arch_get_irn_reg_class(ws->bel->arch, val, -1) != ws->bel->cls) { DBG((dbg, DBG_TRACE, "Wrong reg class\n")); goto no_insert; } @@ -170,6 +145,7 @@ static INLINE void workset_bulk_insert(workset_t *ws, int cnt, ir_node **vals) { } /* insert val */ + assert(ws->len < ws->bel->n_regs && "Workset does not have enough room!"); ws->vals[ws->len++].irn = val; DBG((dbg, DBG_TRACE, "Inserted\n")); @@ -201,7 +177,7 @@ static INLINE void workset_remove(workset_t *ws, ir_node *val) { } } -static INLINE int workset_contains(const workset_t *ws, ir_node *val) { +static INLINE int workset_contains(const workset_t *ws, const ir_node *val) { int i; for(i=0; ilen; ++i) if (ws->vals[i].irn == val) @@ -220,6 +196,16 @@ static INLINE int workset_contains(const workset_t *ws, ir_node *val) { #define workset_sort(ws) qsort((ws)->vals, (ws)->len, sizeof((ws)->vals[0]), loc_compare); +static int is_mem_phi(const ir_node *irn, void *data) { + workset_t *sws; + ir_node *blk = get_nodes_block(irn); + + DBG((dbg, DBG_SPILL, "Is %+F a mem-phi?\n", irn)); + sws = ((block_info_t *) get_irn_link(blk))->ws_start; + DBG((dbg, DBG_SPILL, " %d\n", !workset_contains(sws, irn))); + return !workset_contains(sws, irn); +} + /** * Collects all values live-in at block @p blk and all phi results in this block. * Then it adds the best values (at most n_regs) to the ws. @@ -238,18 +224,20 @@ static void build_start_set(belady_env_t *bel, ir_node *blk) { first = sched_first(blk); count = 0; sched_foreach(blk, irn) - if (is_Phi(irn) && arch_get_irn_reg_class(bel->arch, irn, 0) == bel->cls) { + if (is_Phi(irn) && arch_get_irn_reg_class(bel->arch, irn, -1) == bel->cls) { loc.irn = irn; - loc.time = be_get_next_use(bel->uses, first, 0, irn); + loc.time = be_get_next_use(bel->uses, first, 0, irn, 0); + DBG((dbg, DBG_START, " %+F next-use %d\n", loc.irn, loc.time)); obstack_grow(&ob, &loc, sizeof(loc)); count++; } else break; live_foreach(blk, li) - if (live_is_in(li) && arch_get_irn_reg_class(bel->arch, li->irn, 0) == bel->cls) { + if (live_is_in(li) && arch_get_irn_reg_class(bel->arch, li->irn, -1) == bel->cls) { loc.irn = (ir_node *)li->irn; - loc.time = be_get_next_use(bel->uses, first, 0, li->irn); + loc.time = be_get_next_use(bel->uses, first, 0, li->irn, 0); + DBG((dbg, DBG_START, " %+F next-use %d\n", loc.irn, loc.time)); obstack_grow(&ob, &loc, sizeof(loc)); count++; } @@ -292,22 +280,8 @@ static void displace(belady_env_t *bel, workset_t *new_vals, int is_usage) { if (!workset_contains(ws, val)) { DBG((dbg, DBG_DECIDE, " insert %+F\n", val)); to_insert[demand++] = val; - - if (is_usage) { - spill_info_t si, *found; - reloader_t *rld; - - /* find the spill info or create it */ - si.spilled_node = val; - si.reloaders = NULL; - found = set_insert(bel->spills, &si, sizeof(si), HASH_PTR(si.spilled_node)); - - /* insert the reloader into the linked list */ - rld = obstack_alloc(&bel->ob, sizeof(*rld)); - rld->reloader = bel->instr; - rld->next = found->reloaders; - found->reloaders = rld; - } + if (is_usage) + be_add_reload(bel->senv, val, bel->instr); } else DBG((dbg, DBG_DECIDE, " skip %+F\n", val)); } @@ -324,7 +298,7 @@ static void displace(belady_env_t *bel, workset_t *new_vals, int is_usage) { if (len > max_allowed) { /* get current next-use distance */ for (i=0; ilen; ++i) - workset_set_time(ws, i, be_get_next_use(bel->uses, bel->instr, bel->instr_nr, workset_get_val(ws, i))); + workset_set_time(ws, i, be_get_next_use(bel->uses, bel->instr, bel->instr_nr, workset_get_val(ws, i), !is_usage)); /* sort entries by increasing nextuse-distance*/ workset_sort(ws); @@ -362,6 +336,9 @@ static void decide(ir_node *blk, void *env) { belady_env_t *bel = env; workset_t *new_vals; ir_node *irn; +#ifdef SINGLE_START_PROJS + ir_node *start_blk = get_irg_start_block(get_irn_irg(blk)); +#endif block_info_t *blk_info = obstack_alloc(&bel->ob, sizeof(*blk_info)); set_irn_link(blk, blk_info); @@ -381,13 +358,26 @@ static void decide(ir_node *blk, void *env) { bel->instr_nr = 0; new_vals = new_workset(&bel->ob, bel); sched_foreach(blk, irn) { - DBG((dbg, DBG_DECIDE, " %+F\n", irn)); + assert(workset_get_length(bel->ws) <= bel->n_regs && "Too much values in workset!"); + +#ifdef SINGLE_START_PROJS + if (is_Phi(irn) || + (is_Proj(irn) && blk!=start_blk) || + (get_irn_mode(irn) == mode_T && blk==start_blk)) { + DBG((dbg, DBG_DECIDE, " ...%+F skipped\n", irn)); + continue; + } +#else /* projs are handled with the tuple value. * Phis are no real instr (see insert_starters) * instr_nr does not increase */ - if (is_Proj(irn) || is_Phi(irn)) + if (is_Proj(irn) || is_Phi(irn)) { + DBG((dbg, DBG_DECIDE, " ...%+F skipped\n", irn)); continue; + } +#endif + DBG((dbg, DBG_DECIDE, " ...%+F\n", irn)); /* set instruction in the workset */ bel->instr = irn; @@ -423,18 +413,19 @@ static void decide(ir_node *blk, void *env) { } /** - * 'decide' is block-local and makes assumtions + * 'decide' is block-local and makes assumptions * about the set of live-ins. Thus we must adapt the * live-outs to the live-ins at each block-border. */ static void fix_block_borders(ir_node *blk, void *env) { + workset_t *wsb; belady_env_t *bel = env; int i, max; DBG((dbg, DBG_FIX, "\n")); DBG((dbg, DBG_FIX, "Fixing %+F\n", blk)); - workset_t *wsb = ((block_info_t *)get_irn_link(blk))->ws_start; + wsb = ((block_info_t *)get_irn_link(blk))->ws_start; /* process all pred blocks */ for (i=0, max=get_irn_arity(blk); ispills, &si, sizeof(si), HASH_PTR(si.spilled_node)); - - /* insert the reloader into the linked list. - * the schedule position depends on the cf-situation of the block */ - rld = obstack_alloc(&bel->ob, sizeof(*rld)); - rld->reloader = (max==1) ? sched_skip(sched_first(blk), 1, sched_skip_phi_predicator, NULL) : pred; - rld->next = found->reloaders; - found->reloaders = rld; - - DBG((dbg, DBG_FIX, " reload %+F before %+F\n", irnb, rld->reloader)); + DBG((dbg, DBG_FIX, " reload %+F\n", irnb)); + be_add_reload_on_edge(bel->senv, irnb, blk, i); next_value: /*epsilon statement :)*/; @@ -479,183 +459,69 @@ next_value: } } -static INLINE spill_ctx_t *get_spill_ctx(set *sc, ir_node *to_spill, ir_node *ctx_irn) { - spill_ctx_t templ; - - templ.spilled = to_spill; - templ.user = ctx_irn; - templ.spill = NULL; - - return set_insert(sc, &templ, sizeof(templ), HASH_COMBINE(HASH_PTR(to_spill), HASH_PTR(ctx_irn))); -} - -static INLINE ir_node *spill_irn(belady_env_t *bel, ir_node *irn, ir_node *ctx_irn) { - spill_ctx_t *ctx; - DBG((dbg, DBG_SPILL, "spill_irn %+F\n", irn)); - - ctx = get_spill_ctx(bel->spill_ctxs, irn, ctx_irn); - if(!ctx->spill) - ctx->spill = be_spill(bel->factory, bel->arch, irn); - - return ctx->spill; -} - /** - * If the first usage of a phi result would be out of memory - * there is no sense in allocating a register for it. - * Thus we spill it and all its operands to the same spill slot. - * Therefore the phi/dataB becomes a phi/Memory + * Removes all used reloads from bel->reloads. + * The remaining nodes in bel->reloads will be removed from the graph. */ -static ir_node *spill_phi(belady_env_t *bel, ir_node *phi, ir_node *ctx_irn) { - int i, n = get_irn_arity(phi); - ir_node **ins, *bl = get_nodes_block(phi); - ir_graph *irg = get_irn_irg(bl); - spill_ctx_t *ctx; - - assert(is_Phi(phi)); - DBG((dbg, DBG_SPILL, "spill_phi %+F\n", phi)); - - /* search an existing spill for this context */ - ctx = get_spill_ctx(bel->spill_ctxs, phi, ctx_irn); - - /* if not found spill the phi */ - if(!ctx->spill) { - /* build a new PhiM with dummy in-array */ - ins = malloc(n * sizeof(ins[0])); - for(i=0; ispill = new_r_Phi(bel->session->irg, bl, n, ins, mode_M); - free(ins); - - /* re-wire the phiM */ - for(i=0; imem_phis, arg)) - sub_res = spill_phi(bel, arg, ctx_irn); - else - sub_res = spill_irn(bel, arg, ctx_irn); - - set_irn_n(ctx->spill, i, sub_res); - } - } - return ctx->spill; -} - -static ir_node *spill_node(belady_env_t *bel, ir_node *to_spill) { - ir_node *res; - if (pset_find_ptr(bel->mem_phis, to_spill)) - res = spill_phi(bel, to_spill, to_spill); - else - res = spill_irn(bel, to_spill, to_spill); - - return res; +static void rescue_used_reloads(ir_node *irn, void *env) { + pset *rlds = (pset *)env; + if (pset_find_ptr(rlds, irn)) + pset_remove_ptr(rlds, irn); } -static void insert_spills_reloads(ir_graph *irg, belady_env_t *bel) { +/** + * Finds all unused reloads and remove them from the schedule + * Also removes spills if they are not used anymore after removing reloads + */ +static void remove_unused_reloads(ir_graph *irg, belady_env_t *bel) { ir_node *irn; - spill_info_t *si; - struct obstack ob; - obstack_init(&ob); - - /* get all special spilled phis */ - for(si = set_first(bel->spills); si; si = set_next(bel->spills)) { - irn = si->spilled_node; - if (is_Phi(irn)) { - ir_node *blk = get_nodes_block(irn); - workset_t *sws = ((block_info_t *)get_irn_link(blk))->ws_start; - if (!workset_contains(sws, irn)) - pset_insert_ptr(bel->mem_phis, irn); - } - } - - /* process each spilled node */ - for(si = set_first(bel->spills); si; si = set_next(bel->spills)) { - reloader_t *rld; - ir_node **reloads; - int n_reloads = 0; - ir_mode *mode = get_irn_mode(si->spilled_node); - - /* go through all reloads for this spill */ - for(rld = si->reloaders; rld; rld = rld->next) { - /* the spill for this reloader */ - ir_node *spill = spill_node(bel, si->spilled_node); - - /* the reload */ - ir_node *bl = is_Block(rld->reloader) ? rld->reloader : get_nodes_block(rld->reloader); - ir_node *reload = new_Reload(bel->factory, bel->cls, irg, bl, mode, spill); - pset_insert_ptr(bel->reloads, reload); - - /* remember the reaload */ - obstack_ptr_grow(&ob, reload); - sched_add_before(rld->reloader, reload); - n_reloads++; - } - assert(n_reloads > 0); - reloads = obstack_finish(&ob); - be_introduce_copies_ignore(bel->session->dom_front, si->spilled_node, n_reloads, reloads, bel->mem_phis); - obstack_free(&ob, reloads); - } + irg_walk_graph(irg, rescue_used_reloads, NULL, bel->reloads); + for(irn = pset_first(bel->reloads); irn; irn = pset_next(bel->reloads)) { + ir_node *spill; + DBG((dbg, DBG_SPILL, "Removing %+F before %+F in %+F\n", irn, sched_next(irn), get_nodes_block(irn))); - obstack_free(&ob, NULL); + spill = get_irn_n(irn, 0); - /* remove all special phis form the irg and the schedule */ - for(irn = pset_first(bel->mem_phis); irn; irn = pset_next(bel->mem_phis)) { - int i, n; - for(i = 0, n = get_irn_arity(irn); i < n; ++i) - set_irn_n(irn, i, new_r_Bad(irg)); + /* remove reload */ + set_irn_n(irn, 0, new_Bad()); sched_remove(irn); - } -} -/** - * Removes all used reloads from bel->reloads. - * The remaining nodes in bel->reloads will be removed from the graph. - */ -static void rescue_used_reloads(ir_node *irn, void *env) { - pset *rlds = ((belady_env_t *)env)->reloads; - if (pset_find_ptr(rlds, irn)) - pset_remove_ptr(rlds, irn); + /* if spill not used anymore, remove it too + * test of regclass is necessary since spill may be a phi-M */ + if (get_irn_n_edges(spill) == 0 && bel->cls == arch_get_irn_reg_class(bel->arch, spill, -1)) { + set_irn_n(spill, 0, new_Bad()); + sched_remove(spill); + } + } } -void be_spill_belady(const be_main_session_env_t *session, const arch_register_class_t *cls) { - ir_node *irn; +void be_spill_belady(const be_chordal_env_t *chordal_env) { + belady_env_t bel; dbg = firm_dbg_register("ir.be.spillbelady"); firm_dbg_set_mask(dbg, DEBUG_LVL); /* init belady env */ - belady_env_t *bel = alloca(sizeof(*bel)); - obstack_init(&bel->ob); - bel->session = session; - bel->factory = session->main_env->node_factory; - bel->arch = session->main_env->arch_env; - bel->cls = cls; - bel->n_regs = arch_register_class_n_regs(cls); - bel->ws = new_workset(&bel->ob, bel); - bel->uses = be_begin_uses(session->irg, session->main_env->arch_env, cls); - bel->spills = new_set(set_cmp_spillinfo, 32); - bel->spill_ctxs = new_set(set_cmp_spillctx, 32); - bel->mem_phis = pset_new_ptr_default(); - bel->reloads = pset_new_ptr_default(); + obstack_init(&bel.ob); + bel.factory = chordal_env->main_env->node_factory; + bel.arch = chordal_env->main_env->arch_env; + bel.cls = chordal_env->cls; + bel.n_regs = arch_register_class_n_regs(bel.cls); + bel.ws = new_workset(&bel.ob, &bel); + bel.uses = be_begin_uses(chordal_env->irg, chordal_env->main_env->arch_env, bel.cls); + bel.senv = be_new_spill_env(dbg, chordal_env, is_mem_phi, NULL); + bel.reloads = pset_new_ptr_default(); /* do the work */ - irg_block_walk_graph(session->irg, decide, NULL, bel); - irg_block_walk_graph(session->irg, fix_block_borders, NULL, bel); - insert_spills_reloads(session->irg, bel); - - /* find all unused reloads and remove them from the schedule */ - irg_walk_graph(session->irg, rescue_used_reloads, NULL, bel); - for(irn = pset_first(bel->reloads); irn; irn = pset_next(bel->reloads)) - sched_remove(irn); + irg_block_walk_graph(chordal_env->irg, decide, NULL, &bel); + irg_block_walk_graph(chordal_env->irg, fix_block_borders, NULL, &bel); + be_insert_spills_reloads(bel.senv, bel.reloads); + remove_unused_reloads(chordal_env->irg, &bel); /* clean up */ - del_pset(bel->reloads); - del_pset(bel->mem_phis); - del_set(bel->spill_ctxs); - del_set(bel->spills); - be_end_uses(bel->uses); - obstack_free(&bel->ob, NULL); + del_pset(bel.reloads); + be_delete_spill_env(bel.senv); + be_end_uses(bel.uses); + obstack_free(&bel.ob, NULL); }