X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched.c;h=a99113eac8b6ae05d5d2a59a353e05004f23f6df;hb=2cb4a701f143339e07259cf7331c670f5584de63;hp=ae2f9f43dcf54111275b9351b485bc5ccb8b3dc6;hpb=10f8d2d5dd9f9fef27212b9bdad08e122803c46f;p=libfirm diff --git a/ir/be/besched.c b/ir/be/besched.c index ae2f9f43d..a99113eac 100644 --- a/ir/be/besched.c +++ b/ir/be/besched.c @@ -1,57 +1,191 @@ +/* + * 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 Scheduling utilities for nodes in Blocks and Blocks. + * @author Sebastian Hack + * @version $Id$ + */ +#include "config.h" + +#include #include "impl.h" #include "irprintf.h" #include "irgwalk.h" -#include "irnode.h" +#include "firm_types.h" +#include "irgraph_t.h" +#include "iredges_t.h" +#include "ircons.h" +#include "irextbb.h" +#include "irgmod.h" +#include "debug.h" -#include "besched_t.h" +#include "bemodule.h" +#include "bearch.h" #include "besched.h" +#include "beutil.h" #include "belistsched.h" +#include "belive.h" +FIRM_IMPL1(have_sched_info, int, const ir_graph *) FIRM_IMPL1(sched_get_time_step, int, const ir_node *) -FIRM_IMPL1(sched_has_succ, int, const ir_node *) +FIRM_IMPL1(sched_has_next, int, const ir_node *) FIRM_IMPL1(sched_has_prev, int, const ir_node *) -FIRM_IMPL1(sched_succ, ir_node *, const ir_node *) +FIRM_IMPL1(sched_next, ir_node *, const ir_node *) FIRM_IMPL1(sched_prev, ir_node *, const ir_node *) +FIRM_IMPL1(sched_is_scheduled, int, const ir_node *) FIRM_IMPL1(sched_first, ir_node *, const ir_node *) FIRM_IMPL1(sched_last, ir_node *, const ir_node *) +FIRM_IMPL2_VOID(sched_add_after, ir_node *, ir_node *) +FIRM_IMPL2_VOID(sched_add_before, ir_node *, ir_node *) +FIRM_IMPL1_VOID(sched_init_block, ir_node *) +FIRM_IMPL1_VOID(sched_remove, ir_node *) +FIRM_IMPL1_VOID(sched_reset, ir_node *) +FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *) size_t sched_irn_data_offset = 0; static void block_sched_dumper(ir_node *block, void *env) { - FILE *f = env; + FILE *f = env; const ir_node *curr; - ir_fprintf(f, "%n:\n", block); + ir_fprintf(f, "%+F:\n", block); + sched_foreach(block, curr) { - ir_fprintf(f, "\t%n\n", curr); + sched_info_t *info = get_irn_sched_info(curr); + ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr); + } +} + +void be_sched_dump(FILE *f, ir_graph *irg) +{ + irg_block_walk_graph(irg, block_sched_dumper, NULL, f); +} + +/* Init the scheduling stuff. */ +void be_init_sched(void) +{ + sched_irn_data_offset = firm_register_additional_node_data(sizeof(sched_info_t)); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched); + +void sched_renumber(const ir_node *block) +{ + ir_node *irn; + sched_info_t *inf; + sched_timestep_t step = SCHED_INITIAL_GRANULARITY; + + sched_foreach(block, irn) { + inf = get_irn_sched_info(irn); + inf->time_step = step; + step += SCHED_INITIAL_GRANULARITY; } } -void be_sched_dump(FILE *f, const ir_graph *irg) +int sched_skip_cf_predicator(const ir_node *irn, void *data) { - irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f); + (void)data; + return is_cfop(irn); } -void be_sched_init(void) +int sched_skip_phi_predicator(const ir_node *irn, void *data) { + (void) data; + return is_Phi(irn); +} + +/* Skip nodes in a schedule. */ +ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data) { - sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t)); + const ir_node *bl = get_block_const(from); + ir_node *curr; + + if (forward) { + if (is_Block(from)) + from = sched_next(from); + for (curr = from; curr != bl && predicator(curr, data); curr = sched_next(curr)) { + } + } else { + if (is_Block(from)) + from = sched_prev(from); + for (curr = from; curr != bl && predicator(curr, data); curr = sched_prev(curr)) { + } + } + + return curr; } -void be_sched_test(void) +//--------------------------------------------------------------------------- + +typedef struct remove_dead_nodes_env_t_ { + bitset_t *reachable; + ir_graph *irg; + be_lv_t *lv; +} remove_dead_nodes_env_t; + +/** + * Post-walker: remember all visited nodes in a bitset. + */ +static void mark_dead_nodes_walker(ir_node *node, void *data) { - int i, n; - struct obstack obst; + remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data; + bitset_set(env->reachable, get_irn_idx(node)); +} - obstack_init(&obst); +/** + * Post-block-walker: + * Walk through the schedule of every block and remove all dead nodes from it. + */ +static void remove_dead_nodes_walker(ir_node *block, void *data) +{ + remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data; + ir_node *node, *next; + + for (node = sched_first(block); ! sched_is_end(node); node = next) { + /* get next node now, as after calling sched_remove it will be invalid */ + next = sched_next(node); - for(i = 0, n = get_irp_n_irgs(); i < n; ++i) { - ir_graph *irg = get_irp_irg(i); + if (bitset_is_set(env->reachable, get_irn_idx(node))) + continue; - list_sched(irg, trivial_selector, NULL); - be_sched_dump(stdout, irg); + if(env->lv) + be_liveness_remove(env->lv, node); + sched_remove(node); + kill_node(node); } +} + +void be_remove_dead_nodes_from_schedule(be_irg_t *birg) +{ + ir_graph *irg = be_get_birg_irg(birg); + + remove_dead_nodes_env_t env; + env.reachable = bitset_alloca(get_irg_last_idx(irg)); + env.lv = be_get_birg_liveness(birg); + env.irg = irg; + + // mark all reachable nodes + irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env); - obstack_free(&obst, NULL); + // walk schedule and remove non-marked nodes + irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env); }