/*
- * 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.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
* @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 <stdlib.h>
-#endif
+#include <stdlib.h>
-#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(have_sched_info, int, const ir_graph *)
-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_VOID(sched_add_after, const ir_node *, const ir_node *)
-FIRM_IMPL2_VOID(sched_add_before, const ir_node *, const ir_node *)
-FIRM_IMPL1_VOID(sched_init_block, const ir_node *)
-FIRM_IMPL1_VOID(sched_reset, const ir_node *)
-FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
-FIRM_IMPL1_VOID(sched_remove, const 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)
+static void sched_renumber(ir_node *const block)
{
- 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;
}
}
-int sched_skip_cf_predicator(const ir_node *irn, void *data)
-{
- (void)data;
- return arch_irn_class_is(irn, branch);
-}
-
-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)
+static inline void sched_set_time_stamp(const ir_node *irn)
{
- 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)) {
+ 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_ {
- 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)
+void sched_add_before(ir_node *before, 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 *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-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_add_after(ir_node *after, ir_node *irn)
{
- 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);
-
- if (bitset_is_set(env->reachable, get_irn_idx(node)))
- continue;
+ 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);
+}
- if(env->lv)
- be_liveness_remove(env->lv, node);
- sched_remove(node);
- kill_node(node);
- }
+void sched_remove(ir_node *irn)
+{
+ 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;
}
-void be_remove_dead_nodes_from_schedule(be_irg_t *birg)
+void sched_replace(ir_node *const old, ir_node *const irn)
{
- ir_graph *irg = be_get_birg_irg(birg);
+ assert(sched_is_scheduled(old));
+ assert(!sched_is_scheduled(irn));
- 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;
+ sched_info_t *const old_info = get_irn_sched_info(old);
+ sched_info_t *const irn_info = get_irn_sched_info(irn);
+ *irn_info = *old_info;
- // mark all reachable nodes
- irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
+ old_info->prev = NULL;
+ old_info->next = NULL;
- // walk schedule and remove non-marked nodes
- irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);
+ ir_node *const prev = irn_info->prev;
+ ir_node *const next = irn_info->next;
+ get_irn_sched_info(prev)->next = irn;
+ get_irn_sched_info(next)->prev = irn;
}
-static void *sched_irn_init(ir_phase *ph, const ir_node *irn, void *old)
-{
- sched_info_t *info = old ? old : phase_alloc(ph, sizeof(*info));
+static be_module_list_entry_t *schedulers;
+static schedule_func scheduler;
- info->idx = get_irn_idx(irn);
- INIT_LIST_HEAD(&info->list);
- info->scheduled = 0;
- info->time_step = 0;
- return info;
+void be_register_scheduler(const char *name, schedule_func func)
+{
+ if (scheduler == NULL)
+ scheduler = func;
+ be_add_module_to_list(&schedulers, name, (void*)func);
}
-void be_sched_init_phase(ir_graph *irg)
+void be_schedule_graph(ir_graph *irg)
{
- init_irg_phase(irg, PHASE_BE_SCHED, 0, sched_irn_init);
+ scheduler(irg);
}
-void be_sched_free_phase(ir_graph *irg)
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched)
+void be_init_sched(void)
{
- free_irg_phase(irg, PHASE_BE_SCHED);
+ 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);
}
projects / libfirm / blobdiff