-
-#include <stdlib.h>
+/*
+ * 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$
+ */
+#ifdef HAVE_CONFIG_H
+# include "config.h"
+#endif
+
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
#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 "debug.h"
+#include "bemodule.h"
+#include "bearch_t.h"
#include "besched_t.h"
-#include "besched.h"
+#include "beutil.h"
#include "belistsched.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(sched_add_after, ir_node *, ir_node *, ir_node *)
-FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, 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;
+ 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, const ir_graph *irg)
+void be_sched_dump(FILE *f, ir_graph *irg)
{
- irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f);
+ irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
}
-void be_sched_init(void)
+/* Init the scheduling stuff. */
+void be_init_sched(void)
{
- sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
- firm_dbg_register("be.sched");
+ sched_irn_data_offset = firm_register_additional_node_data(sizeof(sched_info_t));
}
-void be_sched_test(void)
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);
+
+void sched_renumber(const ir_node *block)
{
- int i, n;
- struct obstack obst;
+ 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;
+ }
+}
- obstack_init(&obst);
+int sched_skip_cf_predicator(const ir_node *irn, void *data) {
+ arch_env_t *ae = data;
+ return arch_irn_class_is(ae, irn, branch);
+}
- for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
- ir_graph *irg = get_irp_irg(i);
+int sched_skip_phi_predicator(const ir_node *irn, void *data) {
+ (void) data;
+ return is_Phi(irn);
+}
- list_sched(irg, trivial_selector);
- be_sched_dump(stdout, irg);
+/* Skip nodes in a schedule. */
+ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
+{
+ 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)) {
+ }
}
- obstack_free(&obst, NULL);
+ return curr;
}
-void sched_renumber(const ir_node *block)
+//---------------------------------------------------------------------------
+
+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)
{
- ir_node *irn;
- sched_info_t *inf;
- sched_timestep_t step = 0;
-
- sched_foreach(block, irn) {
- inf = get_irn_sched_info(irn);
- inf->time_step = step;
- step += SCHED_INITIAL_GRANULARITY;
- }
+ remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
+ bitset_set(env->reachable, get_irn_idx(node));
}
+/**
+ * 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);
+
+ if (bitset_is_set(env->reachable, get_irn_idx(node)))
+ continue;
+
+ if(env->lv)
+ be_liveness_remove(env->lv, node);
+ sched_remove(node);
+ be_kill_node(node);
+ }
+}
-int sched_verify(const ir_node *block)
+void be_remove_dead_nodes_from_schedule(be_irg_t *birg)
{
- firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
- int res = 1;
- const ir_node *irn;
- int i, n;
- int *save_time_step;
-
- /* Count the number of nodes in the schedule. */
- n = 0;
- sched_foreach(block, irn)
- n++;
-
- save_time_step = malloc(n * sizeof(save_time_step[0]));
-
- i = 0;
- sched_foreach(block, irn) {
- sched_info_t *info = get_irn_sched_info(irn);
- save_time_step[i] = info->time_step;
- info->time_step = i;
-
- i += 1;
- }
-
- /*
- * Check if each relevant operand of a node is scheduled before
- * the node itself.
- */
- sched_foreach(block, irn) {
- int i, n;
- int step = sched_get_time_step(irn);
-
- for(i = 0, n = get_irn_arity(irn); i < n; i++) {
- ir_node *op = get_irn_n(irn, i);
-
- if(mode_is_datab(get_irn_mode(op))
- && get_nodes_block(op) == block
- && sched_get_time_step(op) > step) {
-
- DBG((dbg_sched, LEVEL_DEFAULT,
- "%n is operand of %n but scheduled after", op, irn));
- res = 0;
- }
- }
- }
-
- /* Check, if the time steps are correct */
- for(i = 1; i < n; ++i) {
- if(save_time_step[i] - save_time_step[i - 1] <= 0) {
- DBG((dbg_sched, LEVEL_DEFAULT,
- "position %d: time step shrinks (from %d to %d)\n",
- i, save_time_step[i - 1], save_time_step[i]));
- res = 0;
- }
- }
-
- /* Restore the old time steps */
- i = 0;
- sched_foreach(block, irn) {
- sched_info_t *info = get_irn_sched_info(irn);
- info->time_step = save_time_step[i++];
- }
-
- free(save_time_step);
- return res;
+ 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);
+
+ // walk schedule and remove non-marked nodes
+ irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);
}
-static void sched_verify_walker(ir_node *irn, void *data)
+static void *sched_irn_init(ir_phase *ph, const ir_node *irn, void *old)
{
- int *res = data;
- *res &= sched_verify(irn);
+ sched_info_t *info = old ? old : phase_alloc(ph, sizeof(*info));
+
+ info->idx = get_irn_idx(irn);
+ INIT_LIST_HEAD(&info->list);
+ info->scheduled = 0;
+ info->time_step = 0;
+ return info;
}
-int sched_verify_irg(ir_graph *irg)
+void be_sched_init_phase(ir_graph *irg)
{
- int res = 1;
- irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
+ init_irg_phase(irg, PHASE_BE_SCHED, 0, sched_irn_init);
+}
- return res;
+void be_sched_free_phase(ir_graph *irg)
+{
+ free_irg_phase(irg, PHASE_BE_SCHED);
}
projects / libfirm / blobdiff