X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeschedmris.c;h=8ac256e1fc97ecaed4b4e7f50acc38cc43930f4c;hb=ccdf802c598f7adc5e35fff42fed029c59f48a57;hp=88f292b36ef02c790994054246e8aa456396f2b0;hpb=f262930b86ccb30ae0b33a17946f8365b30dcb45;p=libfirm diff --git a/ir/be/beschedmris.c b/ir/be/beschedmris.c index 88f292b36..8ac256e1f 100644 --- a/ir/be/beschedmris.c +++ b/ir/be/beschedmris.c @@ -1,10 +1,33 @@ +/* + * Copyright (C) 1995-2008 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. + */ + /** + * @file + * @brief Implements a list scheduler for the MRIS algorithm. + * @author Sebastian Hack + * @date 04.04.2006 + * @version $Id$ + * * Implements a list scheduler for the MRIS algorithm in: * Govindarajan, Yang, Amaral, Zhang, Gao * Minimum Register Instruction Sequencing to Reduce Register Spills * in out-of-order issue superscalar architectures - * @author Sebastian Hack - * @date 04.04.2006 */ #ifdef HAVE_CONFIG_H #include "config.h" @@ -24,15 +47,15 @@ #include "irgwalk.h" #include "irtools.h" #include "irbitset.h" - #include "height.h" #include "benode_t.h" #include "besched_t.h" #include "beschedmris.h" +#include "beirg.h" struct _mris_env_t { - phase_t ph; + ir_phase ph; heights_t *heights; const arch_env_t *aenv; ir_graph *irg; @@ -56,9 +79,10 @@ typedef struct _mris_irn_t { #define get_mris_irn(env, irn) ((mris_irn_t *) phase_get_or_set_irn_data(&env->ph, irn)) #define foreach_lineage(env, pos, tmp) list_for_each_entry_safe(mris_irn_t, pos, tmp, &(env)->lineage_head, lineage_list) -static void *mris_irn_data_init(phase_t *ph, ir_node *irn, void *data) +static void *mris_irn_data_init(ir_phase *ph, const ir_node *irn, void *data) { mris_irn_t *mi = data ? data : phase_alloc(ph, sizeof(mi[0])); + (void) irn; memset(mi, 0, sizeof(mi[0])); INIT_LIST_HEAD(&mi->lineage_list); return mi; @@ -221,6 +245,7 @@ static INLINE ir_node *skip_Projs(ir_node *irn) return is_Proj(irn) ? skip_Projs(get_Proj_pred(irn)) : irn; } +#if 0 static void replace_tuple_by_repr_proj(mris_env_t *env, ir_node **in) { int i; @@ -247,34 +272,37 @@ static void replace_tuple_by_repr_proj(mris_env_t *env, ir_node **in) } } } +#endif static void lineage_formation(mris_env_t *env) { - firm_dbg_module_t *dbg = env->dbg; - nodeset *nodes = new_nodeset(128); + DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg); + ir_nodeset_t nodes; + const ir_edge_t *edge; - const ir_edge_t *edge; + ir_nodeset_init(&nodes); foreach_out_edge(env->bl, edge) { ir_node *irn = get_edge_src_irn(edge); if(to_appear(env, irn)) - nodeset_insert(nodes, irn); + ir_nodeset_insert(&nodes, irn); } - while(nodeset_count(nodes) > 0) { + while(ir_nodeset_size(&nodes) > 0) { mris_irn_t *mi; - ir_node *irn; - ir_node *highest_node = NULL; - ir_node *lowest_desc = NULL; - ir_node *start; + ir_node *irn; + ir_node *highest_node = NULL; + ir_node *lowest_desc = NULL; + ir_node *start; mris_irn_t *start_mi; + ir_nodeset_iterator_t iter; ir_node **in; int recompute_height = 0; unsigned curr_height = 0; /* search the highest node which is not yet in a lineage. */ - for(irn = nodeset_first(nodes); irn; irn = nodeset_next(nodes)) { + foreach_ir_nodeset(&nodes, irn, iter) { unsigned height = get_irn_height(env->heights, irn); if(height > curr_height) { highest_node = irn; @@ -293,7 +321,7 @@ static void lineage_formation(mris_env_t *env) mi->lineage_next = NULL; mi->lineage_end = NULL; list_add(&mi->lineage_list, &env->lineage_head); - nodeset_remove(nodes, highest_node); + ir_nodeset_remove(&nodes, highest_node); /* put all descendants in an array. @@ -338,7 +366,6 @@ static void lineage_formation(mris_env_t *env) assert(i < n && "could not find operand"); //replace_tuple_by_repr_proj(env, &in[1]); - (void) replace_tuple_by_repr_proj; if(!is_Proj(lowest_desc)) add_irn_dep(lowest_desc, in[1]); } @@ -351,7 +378,7 @@ static void lineage_formation(mris_env_t *env) start_mi->lineage_end = lowest_desc; lowest_mi->lineage_start = start; - nodeset_remove(nodes, lowest_desc); + ir_nodeset_remove(&nodes, lowest_desc); } /* else we cannot extend this lineage, so break. */ @@ -370,6 +397,8 @@ static void lineage_formation(mris_env_t *env) if(recompute_height) heights_recompute(env->heights); } + + ir_nodeset_destroy(&nodes); } static int fuse_two_lineages(mris_env_t *env, mris_irn_t *u, mris_irn_t *v) @@ -485,17 +514,18 @@ void dump_ir_block_graph_mris(mris_env_t *env, const char *suffix) { mris_env_t *be_sched_mris_preprocess(const be_irg_t *birg) { mris_env_t *env = xmalloc(sizeof(env[0])); + ir_graph *irg = be_get_birg_irg(birg); - phase_init(&env->ph, "mris", birg->irg, 2 * PHASE_DEFAULT_GROWTH, mris_irn_data_init); - env->aenv = birg->main_env->arch_env; - env->irg = birg->irg; + phase_init(&env->ph, "mris", irg, 2 * PHASE_DEFAULT_GROWTH, mris_irn_data_init, NULL); + env->aenv = be_get_birg_arch_env(birg); + env->irg = irg; env->visited = 0; - env->heights = heights_new(birg->irg); + env->heights = heights_new(irg); INIT_LIST_HEAD(&env->lineage_head); FIRM_DBG_REGISTER(env->dbg, "firm.be.sched.mris"); obstack_init(&env->obst); - irg_walk_graph(env->irg, firm_clear_link, NULL, NULL); - irg_block_walk_graph(birg->irg, block_walker, NULL, env); + irg_walk_graph(irg, firm_clear_link, NULL, NULL); + irg_block_walk_graph(irg, block_walker, NULL, env); obstack_free(&env->obst, NULL); // dump_ir_block_graph_mris(env, "-mris"); return env;