X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeschedtrivial.c;h=4fe8a181fa9a27d72d480a6ce23f572a27228161;hb=c57decb6b15b5490d4c3e9e546d8024556e2263f;hp=8f1f4bc76331c964d48f530c76d71a32b6da2a97;hpb=1ce363f80e6a204d4011f85813362d9bd1d0e7e4;p=libfirm

diff --git a/ir/be/beschedtrivial.c b/ir/be/beschedtrivial.c
index 8f1f4bc76..4fe8a181f 100644
--- a/ir/be/beschedtrivial.c
+++ b/ir/be/beschedtrivial.c
@@ -22,11 +22,8 @@
  * @brief       Trivial node selector.
  * @author      Sebastian Hack
  * @date        29.08.2006
- * @version     $Id$
  */
-#ifdef HAVE_CONFIG_H
 #include "config.h"
-#endif
 
 #include <stdlib.h>
 
@@ -36,55 +33,58 @@
 
 #include "bearch.h"
 #include "belistsched.h"
+#include "bemodule.h"
+#include "besched.h"
 
 /**
  * The trivial selector:
  * Just assure that branches are executed last, otherwise select
  * the first node ready.
  */
-static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set,
-                               ir_nodeset_t *live_set)
+static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set)
 {
-	const arch_env_t *arch_env = block_env;
-	ir_node          *irn      = NULL;
-	ir_nodeset_iterator_t iter;
-	(void) live_set;
+	(void)block_env;
 
 	/* assure that branches and constants are executed last */
 	foreach_ir_nodeset(ready_set, irn, iter) {
-		if (! arch_irn_class_is(arch_env, irn, branch)) {
+		if (!is_cfop(irn)) {
 			return irn;
 		}
 	}
 
 	/* at last: schedule branches */
-	ir_nodeset_iterator_init(&iter, ready_set);
-	irn = ir_nodeset_iterator_next(&iter);
-
-	return irn;
+	return ir_nodeset_first(ready_set);
 }
 
-static void *trivial_init_graph(const list_sched_selector_t *vtab, const be_irg_t *birg)
+static void *trivial_init_graph(ir_graph *irg)
 {
-	(void) vtab;
-	return (void *) be_get_birg_arch_env(birg);
+	(void)irg;
+	return NULL;
 }
 
 static void *trivial_init_block(void *graph_env, ir_node *block)
 {
-	(void) block;
-	return graph_env;
+	(void)graph_env;
+	(void)block;
+	return NULL;
+}
+
+static void sched_trivial(ir_graph *irg)
+{
+	static const list_sched_selector_t trivial_selector = {
+		trivial_init_graph,
+		trivial_init_block,
+		trivial_select,
+		NULL,                /* node_ready */
+		NULL,                /* node_selected */
+		NULL,                /* finish_block */
+		NULL                 /* finish_graph */
+	};
+	be_list_sched_graph(irg, &trivial_selector);
 }
 
-const list_sched_selector_t trivial_selector = {
-	trivial_init_graph,
-	trivial_init_block,
-	trivial_select,
-	NULL,                /* to_appear_in_schedule */
-	NULL,                /* node_ready */
-	NULL,                /* node_selected */
-	NULL,                /* exectime */
-	NULL,                /* latency */
-	NULL,                /* finish_block */
-	NULL                 /* finish_graph */
-};
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trivial)
+void be_init_sched_trivial(void)
+{
+	be_register_scheduler("trivial", sched_trivial);
+}