X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched.c;h=5f87b706aba2d9093756161b362ac7486e5084bb;hb=c6571686bfbfb3c87ae24ae1dc568e685d6cd49a;hp=21060592ec401aca5d2b5a9fc3cdd7deb48baf40;hpb=39f3a8dbd0f00f90b7b12a849d1bf7b9c1329479;p=libfirm diff --git a/ir/be/besched.c b/ir/be/besched.c index 21060592e..5f87b706a 100644 --- a/ir/be/besched.c +++ b/ir/be/besched.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -21,76 +21,34 @@ * @file * @brief Scheduling utilities for nodes in Blocks and Blocks. * @author Sebastian Hack - * @version $Id$ */ -#ifdef HAVE_CONFIG_H -# include "config.h" -#endif +#include "config.h" -#ifdef HAVE_STDLIB_H -# include -#endif +#include -#include "impl.h" #include "irprintf.h" #include "irgwalk.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 "bemodule.h" -#include "bearch_t.h" -#include "besched_t.h" +#include "bearch.h" +#include "besched.h" #include "beutil.h" #include "belistsched.h" +#include "belive.h" -FIRM_IMPL1(sched_get_time_step, 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_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(sched_add_after, ir_node *, ir_node *, ir_node *) -FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *) -FIRM_IMPL1_VOID(sched_init_block, ir_node *) -FIRM_IMPL1_VOID(sched_reset, ir_node *) -FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *) -FIRM_IMPL1_VOID(sched_remove, ir_node *) - -size_t sched_irn_data_offset = 0; - -static void block_sched_dumper(ir_node *block, void *env) -{ - FILE *f = env; - const ir_node *curr; +#include "lc_opts.h" +#include "lc_opts_enum.h" +#include "irtools.h" - ir_fprintf(f, "%+F:\n", block); +#define SCHED_INITIAL_GRANULARITY (1 << 14) - sched_foreach(block, 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 = register_additional_node_data(sizeof(sched_info_t)); -} - -BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched); - -void sched_renumber(const ir_node *block) +static void sched_renumber(const ir_node *block) { ir_node *irn; sched_info_t *inf; @@ -103,82 +61,113 @@ void sched_renumber(const ir_node *block) } } -int sched_skip_cf_predicator(const ir_node *irn, void *data) { - arch_env_t *ae = data; - return arch_irn_class_is(ae, irn, branch); -} - -int sched_skip_phi_predicator(const ir_node *irn, 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) +static inline void sched_set_time_stamp(const ir_node *irn) { - const ir_node *bl = get_block(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)) { + sched_info_t *info = get_irn_sched_info(irn); + const sched_info_t *prev_info = get_irn_sched_info(info->prev); + const sched_info_t *next_info = get_irn_sched_info(info->next); + sched_timestep_t before_ts = prev_info->time_step; + sched_timestep_t after_ts = next_info->time_step; + + /* + * If we are the last, we can give us a big time step, + * else we have to compute our time step from our + * neighbours. + */ + if(before_ts >= after_ts) { + info->time_step = before_ts + SCHED_INITIAL_GRANULARITY; + /* overflow? */ + if (info->time_step <= before_ts) { + sched_renumber(get_nodes_block(irn)); } } else { - if (is_Block(from)) - from = sched_prev(from); - for (curr = from; curr != bl && predicator(curr, data); curr = sched_prev(curr)) { - } + sched_timestep_t ts = (before_ts + after_ts) / 2; + + /* + * If the resolution went out, we have to renumber + * this block. + */ + if(ts == before_ts || ts == after_ts) + sched_renumber(get_nodes_block(irn)); + else + info->time_step = ts; } - - return curr; } -//--------------------------------------------------------------------------- - -typedef struct remove_dead_nodes_env_t_ { - ir_graph *irg; - bitset_t *reachable; -} remove_dead_nodes_env_t; +void sched_add_before(ir_node *before, ir_node *irn) +{ + sched_info_t *info = get_irn_sched_info(irn); + ir_node *next = before; + sched_info_t *next_info = get_irn_sched_info(next); + ir_node *prev = next_info->prev; + sched_info_t *prev_info = get_irn_sched_info(prev); + assert(sched_is_scheduled(before)); + assert(!sched_is_scheduled(irn)); + assert(!is_Proj(before)); + assert(!is_Proj(irn)); + + info->prev = prev; + info->next = next; + prev_info->next = irn; + next_info->prev = irn; + sched_set_time_stamp(irn); +} -/** - * Post-walker: remember all visited nodes in a bitset. - */ -static void mark_dead_nodes_walker(ir_node *node, void *data) +void sched_add_after(ir_node *after, ir_node *irn) { - remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data; - bitset_set(env->reachable, get_irn_idx(node)); + sched_info_t *info = get_irn_sched_info(irn); + ir_node *prev = after; + sched_info_t *prev_info = get_irn_sched_info(prev); + ir_node *next = prev_info->next; + sched_info_t *next_info = get_irn_sched_info(next); + assert(sched_is_scheduled(after)); + assert(!sched_is_scheduled(irn)); + assert(!is_Proj(after)); + assert(!is_Proj(irn)); + + info->prev = prev; + info->next = next; + prev_info->next = irn; + next_info->prev = irn; + sched_set_time_stamp(irn); } -/** - * 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) +void sched_remove(ir_node *irn) { - remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data; - ir_node *node, *next; + sched_info_t *info = get_irn_sched_info(irn); + ir_node *prev = info->prev; + ir_node *next = info->next; + sched_info_t *prev_info = get_irn_sched_info(prev); + sched_info_t *next_info = get_irn_sched_info(next); + assert(sched_is_scheduled(irn)); + + prev_info->next = next; + next_info->prev = prev; + info->next = NULL; + info->prev = NULL; +} - 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); - if (bitset_is_set(env->reachable, get_irn_idx(node))) - continue; - sched_remove(node); - be_kill_node(node); - } -} +static be_module_list_entry_t *schedulers; +static schedule_func scheduler; -void be_remove_dead_nodes_from_schedule(ir_graph *irg) +void be_register_scheduler(const char *name, schedule_func func) { - remove_dead_nodes_env_t env; - env.irg = irg; - env.reachable = bitset_alloca(get_irg_last_idx(irg)); + if (scheduler == NULL) + scheduler = func; + be_add_module_to_list(&schedulers, name, (void*)func); +} - // mark all reachable nodes - irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env); +void be_schedule_graph(ir_graph *irg) +{ + scheduler(irg); +} - // walk schedule and remove non-marked nodes - irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env); +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched) +void be_init_sched(void) +{ + lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); + be_add_module_list_opt(be_grp, "scheduler", "scheduling algorithm", + &schedulers, (void**)&scheduler); }