X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespillbelady.c;h=763b1b387599fd797a4ff6ffca9f93d324b2fad2;hb=8dd1d4b07d2638ab224c6b044655facd6026dbd7;hp=dac32ee8d43a3cf495f4de7722f95cd14e4efff7;hpb=1a684155e6dadb818cb3afebe4ae80e2c33a2a48;p=libfirm diff --git a/ir/be/bespillbelady.c b/ir/be/bespillbelady.c index dac32ee8d..763b1b387 100644 --- a/ir/be/bespillbelady.c +++ b/ir/be/bespillbelady.c @@ -1,20 +1,31 @@ -/** - * Author: Daniel Grund, Matthias Braun - * Date: 20.09.2005 - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. +/* + * Copyright (C) 1995-2007 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. * + * 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 -#include -#endif -#ifdef HAVE_ALLOCA_H -#include -#endif - -#ifdef HAVE_MALLOC_H -#include +/** + * @file + * @brief Beladys spillalgorithm. + * @author Daniel Grund, Matthias Braun + * @date 20.09.2005 + * @version $Id$ + */ +#ifdef HAVE_CONFIG_H +#include "config.h" #endif #include "obst.h" @@ -29,11 +40,12 @@ #include "iredges_t.h" #include "ircons_t.h" #include "irprintf.h" +#include "xmalloc.h" #include "beutil.h" -#include "bearch.h" +#include "bearch_t.h" #include "bespillbelady.h" -#include "beuses_t.h" +#include "beuses.h" #include "besched_t.h" #include "beirgmod.h" #include "belive_t.h" @@ -41,6 +53,8 @@ #include "bechordal_t.h" #include "bespilloptions.h" #include "beloopana.h" +#include "beirg_t.h" +#include "bemodule.h" #define DBG_SPILL 1 #define DBG_WSETS 2 @@ -69,7 +83,7 @@ typedef struct _belady_env_t { struct obstack ob; const arch_env_t *arch; const arch_register_class_t *cls; - const be_lv_t *lv; + be_lv_t *lv; be_loopana_t *loop_ana; int n_regs; /** number of regs in this reg-class */ @@ -342,18 +356,29 @@ static void displace(belady_env_t *env, workset_t *new_vals, int is_usage) { static void belady(ir_node *block, void *env); -static loc_t to_take_or_not_to_take(belady_env_t *env, ir_node* first, ir_node *node, ir_node *block, ir_loop *loop) { +/** Decides whether a specific node should be in the start workset or not + * + * @param env belady environment + * @param first + * @param node the node to test + * @param block the block of the node + * @param loop the loop of the node + */ +static loc_t to_take_or_not_to_take(belady_env_t *env, ir_node* first, + ir_node *node, ir_node *block, + ir_loop *loop) +{ be_next_use_t next_use; loc_t loc; loc.time = USES_INFINITY; + loc.irn = node; + (void) block; if (!arch_irn_consider_in_reg_alloc(env->arch, env->cls, node)) { loc.time = USES_INFINITY; return loc; } - loc.irn = node; - /* We have to keep nonspillable nodes in the workingset */ if(arch_irn_get_flags(env->arch, node) & arch_irn_flags_dont_spill) { loc.time = 0; @@ -364,9 +389,12 @@ static loc_t to_take_or_not_to_take(belady_env_t *env, ir_node* first, ir_node * next_use = be_get_next_use(env->uses, first, 0, node, 0); if(USES_IS_INFINITE(next_use.time)) { // the nodes marked as live in shouldn't be dead, so it must be a phi + assert(is_Phi(node)); loc.time = USES_INFINITY; DBG((dbg, DBG_START, " %+F not taken (dead)\n", node)); - assert(is_Phi(node)); + if(is_Phi(node)) { + be_spill_phi(env->senv, node); + } return loc; } @@ -421,8 +449,6 @@ static void compute_live_ins(ir_node *block, void *data) { ARR_APP1(loc_t, delayed, loc); else ARR_APP1(loc_t, starters, loc); - } else { - be_spill_phi(env->senv, irn); } } @@ -441,13 +467,24 @@ static void compute_live_ins(ir_node *block, void *data) { } pressure = be_get_loop_pressure(env->loop_ana, env->cls, loop); + assert(ARR_LEN(delayed) <= (signed)pressure); free_slots = env->n_regs - ARR_LEN(starters); - free_pressure_slots = env->n_regs - pressure; + free_pressure_slots = env->n_regs - (pressure - ARR_LEN(delayed)); free_slots = MIN(free_slots, free_pressure_slots); /* append nodes delayed due to loop structure until start set is full */ for (i = 0; i < ARR_LEN(delayed) && i < free_slots; ++i) { DBG((dbg, DBG_START, " delayed %+F taken\n", delayed[i].irn)); ARR_APP1(loc_t, starters, delayed[i]); + delayed[i].irn = NULL; + } + + /* spill all delayed phis which didn't make it into start workset */ + for (i = ARR_LEN(delayed) - 1; i >= 0; --i) { + ir_node *irn = delayed[i].irn; + if (irn && is_Phi(irn)) { + DBG((dbg, DBG_START, " spilling delayed phi %+F\n", irn)); + be_spill_phi(env->senv, irn); + } } DEL_ARR_F(delayed); @@ -572,9 +609,12 @@ static void belady(ir_node *block, void *data) { /* allocate all values _defined_ by this instruction */ workset_clear(new_vals); if (get_irn_mode(irn) == mode_T) { /* special handling for tuples and projs */ - ir_node *proj; - for(proj=sched_next(irn); is_Proj(proj); proj=sched_next(proj)) + const ir_edge_t *edge; + + foreach_out_edge(irn, edge) { + ir_node *proj = get_edge_src_irn(edge); workset_insert(env, new_vals, proj); + } } else { workset_insert(env, new_vals, irn); } @@ -651,29 +691,43 @@ next_value: } } -void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls) { +/** + * Do spilling for a register class on a graph using the belady heuristic. + * In the transformed graph, the register pressure never exceeds the number + * of available registers. + * + * @param birg The backend graph + * @param cls The register class to spill + */ +static void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls) { be_spill_belady_spill_env(birg, cls, NULL); } void be_spill_belady_spill_env(be_irg_t *birg, const arch_register_class_t *cls, spill_env_t *spill_env) { belady_env_t env; ir_graph *irg = be_get_birg_irg(birg); + int n_regs; - FIRM_DBG_REGISTER(dbg, "firm.be.spill.belady"); - //firm_dbg_set_mask(dbg, DBG_SPILL); + /* some special classes contain only ignore regs, nothing to do then */ + n_regs = cls->n_regs - be_put_ignore_regs(birg, cls, NULL); + if(n_regs == 0) + return; + + be_liveness_assure_sets(be_assure_liveness(birg)); - be_assure_liveness(birg); /* construct control flow loop tree */ if(! (get_irg_loopinfo_state(irg) & loopinfo_cf_consistent)) { construct_cf_backedges(irg); } + be_clear_links(irg); + /* init belady env */ obstack_init(&env.ob); env.arch = birg->main_env->arch_env; env.cls = cls; env.lv = be_get_birg_liveness(birg); - env.n_regs = env.cls->n_regs - be_put_ignore_regs(birg, cls, NULL); + env.n_regs = n_regs; env.ws = new_workset(&env, &env.ob); env.uses = be_begin_uses(irg, env.lv); env.loop_ana = be_new_loop_pressure(birg); @@ -682,9 +736,7 @@ void be_spill_belady_spill_env(be_irg_t *birg, const arch_register_class_t *cls, } else { env.senv = spill_env; } - DEBUG_ONLY(be_set_spill_env_dbg_module(env.senv, dbg);) - be_clear_links(irg); /* Decide which phi nodes will be spilled and place copies for them into the graph */ irg_block_walk_graph(irg, compute_live_ins, NULL, &env); /* Fix high register pressure with belady algorithm */ @@ -709,6 +761,7 @@ void be_init_spillbelady(void) }; be_register_spiller("belady", &belady_spiller); + FIRM_DBG_REGISTER(dbg, "firm.be.spill.belady"); } BE_REGISTER_MODULE_CONSTRUCTOR(be_init_spillbelady);