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

diff --git a/ir/be/besched.c b/ir/be/besched.c
index 9c8563609..5f87b706a 100644
--- a/ir/be/besched.c
+++ b/ir/be/besched.c
@@ -1,47 +1,173 @@
+/*
+ * 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"
+
+#include <stdlib.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 "irgmod.h"
+#include "debug.h"
 
+#include "bemodule.h"
+#include "bearch.h"
 #include "besched.h"
+#include "beutil.h"
 #include "belistsched.h"
+#include "belive.h"
+
+#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_node *irn;
+	sched_info_t *inf;
+	sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
 
-	ir_fprintf(f, "%n:\n", block);
-	sched_foreach(block, curr) {
-		ir_fprintf(f, "\t%n\n", curr);
+	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));
+	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;
+	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));
 
-	obstack_init(&obst);
+	info->prev = prev;
+	info->next = next;
+	prev_info->next = irn;
+	next_info->prev = irn;
+	sched_set_time_stamp(irn);
+}
 
-	for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
-		ir_graph *irg = get_irp_irg(i);
+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));
 
-		list_sched(irg, trivial_selector, NULL);
-		be_sched_dump(stdout, irg);
-	}
+	prev_info->next = next;
+	next_info->prev = prev;
+	info->next      = NULL;
+	info->prev      = NULL;
+}
 
-	obstack_free(&obst, NULL);
+
+
+static be_module_list_entry_t *schedulers;
+static schedule_func           scheduler;
+
+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_schedule_graph(ir_graph *irg)
+{
+	scheduler(irg);
+}
+
+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);
 }