X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched.c;h=5f87b706aba2d9093756161b362ac7486e5084bb;hb=c6571686bfbfb3c87ae24ae1dc568e685d6cd49a;hp=d23330b248708dbdb4a318c5de97aeb4dc0b86b0;hpb=7015c9ba23a61991d846b318b607025e8081bdfb;p=libfirm

diff --git a/ir/be/besched.c b/ir/be/besched.c
index d23330b24..5f87b706a 100644
--- a/ir/be/besched.c
+++ b/ir/be/besched.c
@@ -1,187 +1,173 @@
-#ifdef HAVE_CONFIG_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
+ */
 #include "config.h"
-#endif
 
 #include <stdlib.h>
 
-#include "impl.h"
 #include "irprintf.h"
 #include "irgwalk.h"
-#include "irnode_t.h"
+#include "firm_types.h"
+#include "irgraph_t.h"
 #include "iredges_t.h"
+#include "ircons.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(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_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_remove, ir_node *)
+#include "lc_opts.h"
+#include "lc_opts_enum.h"
+#include "irtools.h"
 
-size_t sched_irn_data_offset = 0;
+#define SCHED_INITIAL_GRANULARITY (1 << 14)
 
-static void block_sched_dumper(ir_node *block, void *env)
+static void sched_renumber(const ir_node *block)
 {
-	FILE *f = env;
-	const ir_node *curr;
-
-	ir_fprintf(f, "%+F:\n", block);
-	sched_foreach(block, curr) {
-    sched_info_t *info = get_irn_sched_info(curr);
-		ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
+	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)
+static inline void sched_set_time_stamp(const ir_node *irn)
 {
-	irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f);
+	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 {
+		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;
+	}
 }
 
-void be_sched_init(void)
+void sched_add_before(ir_node *before, ir_node *irn)
 {
-	sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
-  firm_dbg_register("be.sched");
+	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);
 }
 
-void be_sched_test(void)
+void sched_add_after(ir_node *after, ir_node *irn)
 {
-	int i, n;
-	struct obstack obst;
-
-	obstack_init(&obst);
-
-	for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
-		ir_graph *irg = get_irp_irg(i);
-
-		list_sched(irg, trivial_selector);
-		be_sched_dump(stdout, irg);
-	}
-
-	obstack_free(&obst, NULL);
+	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);
 }
 
-void sched_renumber(const ir_node *block)
+void sched_remove(ir_node *irn)
 {
-  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;
-  }
+	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;
 }
 
 
-int sched_verify(const ir_node *block)
+
+static be_module_list_entry_t *schedulers;
+static schedule_func           scheduler;
+
+void be_register_scheduler(const char *name, schedule_func func)
 {
-  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;
-  const ir_node **save_nodes;
-  const ir_edge_t *edge;
-  pset *scheduled_nodes = pset_new_ptr_default();
-
-  firm_dbg_set_mask(dbg_sched, -1);
-
-  /* Count the number of nodes in the schedule. */
-  n = 0;
-  sched_foreach(block, irn)
-    n++;
-
-  if(n <= 0)
-    return 1;
-
-  save_time_step = malloc(n * sizeof(save_time_step[0]));
-  save_nodes = malloc(n * sizeof(save_nodes[0]));
-
-  i = 0;
-  sched_foreach(block, irn) {
-    sched_info_t *info = get_irn_sched_info(irn);
-    save_time_step[i] = info->time_step;
-    save_nodes[i] = irn;
-    info->time_step = i;
-    pset_insert_ptr(scheduled_nodes, irn);
-
-    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(to_appear_in_schedule(op)
-          && !is_Phi(irn)
-          && get_nodes_block(op) == block
-          && sched_get_time_step(op) > step) {
-
-          DBG((dbg_sched, LEVEL_DEFAULT,
-                "%+F: %+F is operand of %+F but scheduled after\n", block, 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,
-            "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
-            block, save_nodes[i - 1], i - 1, save_nodes[i], 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++];
-  }
-
-  /* Check for all nodes in the block if they are scheduled. */
-  foreach_out_edge(block, edge) {
-    ir_node *irn = get_edge_src_irn(edge);
-    if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn))
-      DBG((dbg_sched, LEVEL_DEFAULT,
-            "%+F: %+F is in block but not scheduled\n", block, irn));
-  }
-
-  del_pset(scheduled_nodes);
-  free(save_time_step);
-  free(save_nodes);
-  return res;
+	if (scheduler == NULL)
+		scheduler = func;
+	be_add_module_to_list(&schedulers, name, (void*)func);
 }
 
-static void sched_verify_walker(ir_node *irn, void *data)
+void be_schedule_graph(ir_graph *irg)
 {
-  int *res = data;
-  *res &= sched_verify(irn);
+	scheduler(irg);
 }
 
-int sched_verify_irg(ir_graph *irg)
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched)
+void be_init_sched(void)
 {
-  int res = 1;
-  irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
-
-  return res;
+	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);
 }