X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=f3a971b6902ae59a8671ce80e0bd6347d46eb44f;hb=3f807bf48426a29da4129ff29c44a4b4690c45f6;hp=53d1e8ac6d25059ddbac33d0ecb8e979bd2b8d9e;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm

diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h
index 53d1e8ac6..f3a971b69 100644
--- a/ir/be/belistsched.h
+++ b/ir/be/belistsched.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -18,20 +18,20 @@
  */
 
 /**
- * Primitive list scheduling.
- * @date 20.10.2004
- * @author Sebastian Hack
+ * @file
+ * @brief       Primitive list scheduling with different node selectors.
+ * @author      Sebastian Hack
+ * @date        20.10.2004
+ * @version     $Id$
  */
-#ifndef _FIRM_LIST_SCHED
-#define _FIRM_LIST_SCHED
-
-#include "firm_config.h"
+#ifndef FIRM_BE_BELISTSCHED_H
+#define FIRM_BE_BELISTSCHED_H
 
 #include "firm_types.h"
-
 #include "irnodeset.h"
-#include "bearch_t.h"
+
 #include "be.h"
+#include "bearch.h"
 #include "beirg.h"
 
 typedef struct _list_sched_selector_t list_sched_selector_t;
@@ -45,11 +45,11 @@ struct _list_sched_selector_t {
 
 	/**
 	 * Called before a graph is being scheduled.
-	 * @param arch_env The architecture environment.
-	 * @param irg      The graph.
+	 * @param vtab     The selector vtab.
+	 * @param birg     The backend graph.
 	 * @return         The environment pointer that is passed to all other functions in this struct.
 	 */
-	void *(*init_graph)(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg);
+	void *(*init_graph)(const list_sched_selector_t *vtab, const be_irg_t *birg);
 
 	/**
 	 * Called before scheduling starts on a block.
@@ -132,26 +132,31 @@ struct _list_sched_selector_t {
 /**
  * A trivial selector, that just selects the first ready node.
  */
-extern const list_sched_selector_t *trivial_selector;
+extern const list_sched_selector_t trivial_selector;
 
-extern const list_sched_selector_t *random_selector;
+extern const list_sched_selector_t random_selector;
 
 /**
  * A selector that tries to minimize the register pressure.
  * @note Not really operational yet.
  */
-extern const list_sched_selector_t *reg_pressure_selector;
+extern const list_sched_selector_t reg_pressure_selector;
 
 /**
  * A selector based on trace scheduling as introduced by Muchnik[TM]
  */
-extern const list_sched_selector_t *muchnik_selector;
+extern const list_sched_selector_t muchnik_selector;
 
 /**
  * A selector based on trace scheduling as introduced by Muchnik[TM]
  * but using the mueller heuristic selector.
  */
-extern const list_sched_selector_t *heuristic_selector;
+extern const list_sched_selector_t heuristic_selector;
+
+/**
+ * A selector based on the strong normal form theorem
+ */
+extern const list_sched_selector_t normal_selector;
 
 /**
  * List schedule a graph.
@@ -162,7 +167,7 @@ extern const list_sched_selector_t *heuristic_selector;
  * @param birg    The backend irg.
  * @param be_opts The backend options
  */
-void list_sched(const be_irg_t *birg, be_options_t *be_opts);
+void list_sched(be_irg_t *birg, be_options_t *be_opts);
 
 /**
  * List schedule a block.
@@ -170,4 +175,4 @@ void list_sched(const be_irg_t *birg, be_options_t *be_opts);
  */
 void list_sched_single_block(const be_irg_t *birg, ir_node *block, be_options_t *be_opts);
 
-#endif /* _FIRM_LIST_SCHED */
+#endif /* FIRM_BE_BELISTSCHED_H */