X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeuses.c;h=dc7f30288cb111ac3d64ee23f2abbc01c2b708a9;hb=4ed245f5007168dab7850942a7ee6b6b29a19817;hp=e8d5b70dcdbf9e7873c886098f3db5b91ec3ca5d;hpb=bc995b6f913f26ecbbf543f7debf4f952d372b69;p=libfirm diff --git a/ir/be/beuses.c b/ir/be/beuses.c index e8d5b70dc..dc7f30288 100644 --- a/ir/be/beuses.c +++ b/ir/be/beuses.c @@ -39,29 +39,16 @@ typedef struct _be_use_t { const ir_node *bl; const ir_node *irn; unsigned next_use; - int is_set; } be_use_t; struct _be_uses_t { set *uses; ir_graph *irg; - firm_dbg_module_t *dbg; + const be_lv_t *lv; const arch_env_t *arch_env; + DEBUG_ONLY(firm_dbg_module_t *dbg;) }; - -#define MIN(a, b) ((a) < (b) ? (a) : (b)) - -static INLINE unsigned sadd(unsigned a, unsigned b) -{ - return a + b; -} - -static INLINE unsigned sdiv(unsigned a, unsigned b) -{ - return a / b; -} - static int cmp_use(const void *a, const void *b, size_t n) { const be_use_t *p = a; @@ -70,16 +57,18 @@ static int cmp_use(const void *a, const void *b, size_t n) } static INLINE be_use_t *get_or_set_use(be_uses_t *uses, - const ir_node *bl, const ir_node *irn, unsigned next_use) + const ir_node *bl, const ir_node *def, unsigned next_use) { - unsigned hash = HASH_COMBINE(HASH_PTR(bl), HASH_PTR(irn)); + unsigned hash = HASH_COMBINE(HASH_PTR(bl), HASH_PTR(def)); be_use_t templ; + be_use_t* result; templ.bl = bl; - templ.irn = irn; - templ.next_use = next_use; - templ.is_set = 0; - return set_insert(uses->uses, &templ, sizeof(templ), hash); + templ.irn = def; + templ.next_use = be_get_next_use(uses, sched_first(bl), 0, def, 0); + result = set_insert(uses->uses, &templ, sizeof(templ), hash); + + return result; } unsigned be_get_next_use(be_uses_t *uses, const ir_node *from, @@ -88,14 +77,8 @@ unsigned be_get_next_use(be_uses_t *uses, const ir_node *from, static unsigned get_next_use_bl(be_uses_t *uses, const ir_node *bl, const ir_node *def) { - be_use_t *u; - - u = get_or_set_use(uses, bl, def, 0); - if(!u->is_set) { - u->is_set = 1; - u->next_use = USES_INFINITY; - u->next_use = be_get_next_use(uses, sched_first(bl), 0, def, 0); - } + be_use_t *u = get_or_set_use(uses, bl, def, 0); + return u->next_use; } @@ -113,11 +96,11 @@ static unsigned get_next_use(be_uses_t *uses, const ir_node *from, unsigned from sched_foreach_from(from, irn) { int i, n; - if(!skip_from_uses) { - for(i = 0, n = get_irn_arity(irn); i < n; ++i) { + if (! skip_from_uses) { + for (i = 0, n = get_irn_arity(irn); i < n; ++i) { ir_node *operand = get_irn_n(irn, i); - if(operand == def) { + if (operand == def) { DBG((uses->dbg, LEVEL_3, "found use of %+F at %+F\n", operand, irn)); return step; } @@ -128,10 +111,13 @@ static unsigned get_next_use(be_uses_t *uses, const ir_node *from, unsigned from step++; } + /* FIXME: quick and dirty hack to prevent ignore nodes (like stack pointer) from being spilled */ + return be_is_live_end(uses->lv, bl, def) ? step : USES_INFINITY; + next_use = USES_INFINITY; foreach_block_succ(bl, succ_edge) { const ir_node *succ_bl = succ_edge->src; - if(get_irn_visited(succ_bl) < visited_nr && (is_live_in(succ_bl, def) || (get_irn_arity(succ_bl) > 1 && is_live_end(bl, def)))) { + if(get_irn_visited(succ_bl) < visited_nr && (be_is_live_in(uses->lv, succ_bl, def) || (get_irn_arity(succ_bl) > 1 && be_is_live_end(uses->lv, bl, def)))) { unsigned next = get_next_use_bl(uses, succ_bl, def); DBG((uses->dbg, LEVEL_2, "\t\tnext use in succ %+F: %d\n", succ_bl, next)); @@ -152,7 +138,7 @@ unsigned be_get_next_use(be_uses_t *uses, const ir_node *from, unsigned from_ste } -be_uses_t *be_begin_uses(ir_graph *irg, const arch_env_t *arch_env, const arch_register_class_t *cls) +be_uses_t *be_begin_uses(ir_graph *irg, const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls) { be_uses_t *uses = xmalloc(sizeof(uses[0])); @@ -160,9 +146,9 @@ be_uses_t *be_begin_uses(ir_graph *irg, const arch_env_t *arch_env, const arch_r uses->arch_env = arch_env; uses->uses = new_set(cmp_use, 512); - uses->dbg = firm_dbg_register("be.uses"); uses->irg = irg; - firm_dbg_set_mask(uses->dbg, DBG_LEVEL); + uses->lv = lv; + FIRM_DBG_REGISTER(uses->dbg, "firm.be.uses"); return uses; }