X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespillbelady.c;h=59de03b4e4b5a57ed978d88ae9b3c461b70c14f4;hb=8938d107e5c4fd70e921a182360f01f8bbda26cc;hp=15519a32721ea21c77188efa8c5f92cc65d20774;hpb=75bf25f6a379c7c681518e861ea56bfad50c05bd;p=libfirm diff --git a/ir/be/bespillbelady.c b/ir/be/bespillbelady.c index 15519a327..59de03b4e 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 */ @@ -315,7 +329,12 @@ static void displace(belady_env_t *env, workset_t *new_vals, int is_usage) { for (i = max_allowed; i < ws->len; ++i) { ir_node *irn = ws->vals[i].irn; - DBG((dbg, DBG_DECIDE, " disposing %+F (%u)\n", irn, workset_get_time(ws, i))); + DBG((dbg, DBG_DECIDE, " disposing %+F (%u)\n", irn, + workset_get_time(ws, i))); + + if(!USES_IS_INFINITE(ws->vals[i].time)) { + be_add_spill(env->senv, irn, env->instr); + } if (is_Phi(irn)) continue; @@ -357,14 +376,14 @@ static loc_t to_take_or_not_to_take(belady_env_t *env, ir_node* first, 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; @@ -378,6 +397,9 @@ static loc_t to_take_or_not_to_take(belady_env_t *env, ir_node* first, assert(is_Phi(node)); loc.time = USES_INFINITY; DBG((dbg, DBG_START, " %+F not taken (dead)\n", node)); + if(is_Phi(node)) { + be_spill_phi(env->senv, node); + } return loc; } @@ -432,8 +454,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); } } @@ -452,7 +472,7 @@ 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) <= pressure); + assert(ARR_LEN(delayed) <= (signed)pressure); free_slots = env->n_regs - ARR_LEN(starters); free_pressure_slots = env->n_regs - (pressure - ARR_LEN(delayed)); free_slots = MIN(free_slots, free_pressure_slots); @@ -460,6 +480,16 @@ static void compute_live_ins(ir_node *block, void *data) { 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); ++i) { + ir_node *irn = delayed[i].irn; + if (irn && is_Phi(irn) && get_nodes_block(irn) == block) { + DBG((dbg, DBG_START, " spilling delayed phi %+F\n", irn)); + be_spill_phi(env->senv, irn); + } } DEL_ARR_F(delayed); @@ -584,9 +614,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); } @@ -609,84 +642,115 @@ static void belady(ir_node *block, void *data) { * 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 *block, void *data) { - belady_env_t *env = data; - workset_t *wsb; - ir_graph *irg = get_irn_irg(block); - ir_node *startblock = get_irg_start_block(irg); - int i, max, iter, iter2; - - if(block == startblock) - return; +static void fix_block_borders(ir_node *block, void *data) +{ + ir_graph *irg = get_irn_irg(block); + ir_node *startblock = get_irg_start_block(irg); + belady_env_t *env = data; + workset_t *start_workset; + int arity; + int i; + int iter; + + if(block == startblock) + return; DBG((dbg, DBG_FIX, "\n")); DBG((dbg, DBG_FIX, "Fixing %+F\n", block)); - wsb = get_block_info(block)->ws_start; + start_workset = get_block_info(block)->ws_start; /* process all pred blocks */ - for (i=0, max=get_irn_arity(block); iws_end; + arity = get_irn_arity(block); + for (i = 0; i < arity; ++i) { + ir_node *pred = get_Block_cfgpred_block(block, i); + workset_t *workset_pred_end = get_block_info(pred)->ws_end; + ir_node *node; DBG((dbg, DBG_FIX, " Pred %+F\n", pred)); - workset_foreach(wsb, irnb, iter) { - /* if irnb is a phi of the current block we reload - * the corresponding argument, else irnb itself */ - if(is_Phi(irnb) && block == get_nodes_block(irnb)) { - irnb = get_irn_n(irnb, i); + /* spill all values not used anymore */ + workset_foreach(workset_pred_end, node, iter) { + ir_node *n2; + int iter2; + int found = 0; + workset_foreach(start_workset, n2, iter2) { + if(n2 == node) { + found = 1; + break; + } + /* note that we do not look at phi inputs, becuase the values + * will be either live-end and need no spill or + * they have other users in which must be somewhere else in the + * workset */ + } - // we might have unknowns as argument for the phi - if(!arch_irn_consider_in_reg_alloc(env->arch, env->cls, irnb)) - continue; + if(!found && be_is_live_out(env->lv, pred, node)) { + ir_node *insert_point + = be_get_end_of_block_insertion_point(pred); + DBG((dbg, DBG_SPILL, "Spill %+F before %+F\n", node, + insert_point)); + be_add_spill(env->senv, node, insert_point); } + } - /* Unknowns are available everywhere */ - if(get_irn_opcode(irnb) == iro_Unknown) - continue; + /* reload missing values in predecessors */ + workset_foreach(start_workset, node, iter) { + /* if node is a phi of the current block we reload + * the corresponding argument, else node itself */ + if(is_Phi(node) && block == get_nodes_block(node)) { + node = get_irn_n(node, i); - /* check if irnb is in a register at end of pred */ - workset_foreach(wsp, irnp, iter2) { - if (irnb == irnp) - goto next_value; + /* we might have unknowns as argument for the phi */ + if(!arch_irn_consider_in_reg_alloc(env->arch, env->cls, node)) + continue; } - /* irnb is not in memory at the end of pred, so we have to reload it */ - DBG((dbg, DBG_FIX, " reload %+F\n", irnb)); - DBG((dbg, DBG_SPILL, "Reload %+F before %+F,%d\n", irnb, block, i)); - be_add_reload_on_edge(env->senv, irnb, block, i, env->cls, 1); + /* check if node is in a register at end of pred */ + if(workset_contains(workset_pred_end, node)) + continue; -next_value: - /*epsilon statement :)*/; + /* node is not in memory at the end of pred -> reload it */ + DBG((dbg, DBG_FIX, " reload %+F\n", node)); + DBG((dbg, DBG_SPILL, "Reload %+F before %+F,%d\n", node, block, i)); + be_add_reload_on_edge(env->senv, node, block, i, env->cls, 1); } } } -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); + n_regs = cls->n_regs - be_put_ignore_regs(birg, cls, NULL); + be_liveness_assure_sets(be_assure_liveness(birg)); - be_invalidate_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); @@ -695,24 +759,24 @@ 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 */ irg_block_walk_graph(irg, NULL, belady, &env); /* belady was block-local, fix the global flow by adding reloads on the edges */ irg_block_walk_graph(irg, fix_block_borders, NULL, &env); + + be_end_uses(env.uses); + be_free_loop_pressure(env.loop_ana); + obstack_free(&env.ob, NULL); + /* Insert spill/reload nodes into the graph and fix usages */ be_insert_spills_reloads(env.senv); /* clean up */ if(spill_env == NULL) be_delete_spill_env(env.senv); - be_end_uses(env.uses); - be_free_loop_pressure(env.loop_ana); - obstack_free(&env.ob, NULL); } void be_init_spillbelady(void) @@ -722,6 +786,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);