X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=5e2c554cc2d1db60483e3e6329ae42adbd04ac83;hb=a801e68c8aa279117fe7845fb2d4220750131553;hp=8e15ba09866f36750d4b951a092e1f14c1741fa5;hpb=8e0086dfdf3c7706b8bc4ee0e54097b4ed63d1e7;p=libfirm

diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h
index 8e15ba098..5e2c554cc 100644
--- a/ir/be/belistsched.h
+++ b/ir/be/belistsched.h
@@ -14,19 +14,23 @@
 #include "pmap.h"
 #include "list.h"
 
+struct _arch_isa_t;
+
 /**
  * A selector interface which is used by the list schedule framework.
  * You can implement your own list scheduler by implementing these
  * functions.
  */
 typedef struct _list_sched_selector_t {
+
 	/**
 	 * Called before a graph is being scheduled.
+	 * @param isa The isa.
 	 * @param irg The graph.
 	 * @return The environment pointer that is passed to all other
 	 * functions in this struct.
 	 */
-	void *(*init_graph)(ir_graph *irg);
+	void *(*init_graph)(const struct _arch_isa_t *isa, ir_graph *irg);
 
 	/**
 	 * Called before scheduling starts on a block.
@@ -42,7 +46,7 @@ typedef struct _list_sched_selector_t {
 	 * The function does not have to delete the node from the ready set.
 	 *
 	 * @param env Some private information as returned by init_graph().
-	 * @return block_env Some provate information as returned by init_block().
+	 * @return block_env Some private information as returned by init_block().
 	 * @param sched_head The schedule so far.
 	 * @param curr_time The current time step which the picked node
 	 * will be assigned to.
@@ -57,7 +61,7 @@ typedef struct _list_sched_selector_t {
 	/**
 	 * Called after a block has been scheduled.
 	 * @param env The environment.
-	 * @param block_env The per block environemtn as returned by init_block().
+	 * @param block_env The per block environment as returned by init_block().
 	 * @param block The block that has been finished.
 	 */
 	void (*finish_block)(void *env, void *block_env, ir_node *block);
@@ -81,13 +85,9 @@ extern const list_sched_selector_t *trivial_selector;
  * Each block in the graph gets a list head to its link field being the
  * head of the schedule. You can walk this list using the functions in
  * list.h.
+ * @param isa The isa which implements the scheduler.
  * @param irg The graph to schedule.
- * @param sched_obst An obstack to allocate the lists on.
- * @param map Maps each block to a list head giving the schedule.
- * @param select_func A selection function.
  */
-void list_sched(ir_graph *irg, const list_sched_selector_t *select_func);
-
-
+void list_sched(const struct _arch_isa_t *isa, ir_graph *irg);
 
 #endif