fixed typo

[libfirm] / ir / be / belistsched.h

diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h
index ac9fd3d..55149c2 100644 (file)
--- a/ir/be/belistsched.h
+++ b/ir/be/belistsched.h
@@ -14,35 +14,40 @@
 #include "pmap.h"
 #include "list.h"
 
+struct _arch_isa_t;
+
+typedef struct _list_sched_selector_t list_sched_selector_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 {
+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 list_sched_selector_t *vtab, const struct _arch_isa_t *isa, ir_graph *irg);
 
        /**
         * Called before scheduling starts on a block.
-        * @param env The environment.
+        * @param graph_env The environment.
         * @param block The block which is to be scheduled.
         * @return A per-block pointer that is additionally passed to select.
         */
-       void *(*init_block)(void *env, ir_node *block);
+       void *(*init_block)(void *graph_env, ir_node *block);
 
        /**
         * The selection function.
         * It picks one node out of the ready list to be scheduled next.
         * 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.
@@ -50,44 +55,56 @@ typedef struct _list_sched_selector_t {
         * nodes.
         * @return The chosen node.
         */
-       ir_node *(*select)(void *env, void *block_env,
-                       const struct list_head *sched_head,
-                       int curr_time, pset *ready_set);
+       ir_node *(*select)(void *block_env, pset *ready_set);
+
+       /**
+        * This function decides, if a node should appear in a schedule.
+        * @param block_env The block environment.
+        * @param irn       The node.
+        * @return 1, if the node should be scheduled, 0 if not.
+        */
+       int (*to_appear_in_schedule)(void *block_env, const ir_node *irn);
 
        /**
         * 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 The block that has been finished.
+        * @param block_env The per block environment as returned by init_block().
         */
-       void (*finish_block)(void *env, void *block_env, ir_node *block);
+       void (*finish_block)(void *block_env);
 
        /**
         * Called after a whole graph has been scheduled.
         * @param env The environment.
-        * @param irg The graph.
         */
-       void (*finish_graph)(void *env, ir_graph *irg);
-} list_sched_selector_t;
+       void (*finish_graph)(void *env);
 
+};
+
+/**
+ * A default implementation of to_appear_in_schedule,
+ * as required in list_sched_selector_t.
+ */
+extern be_default_to_appear_in_schedule(void *env, const ir_node *irn);
 
 /**
  * A trivial selector, that just selects the first ready node.
  */
 extern const list_sched_selector_t *trivial_selector;
 
+/**
+ * A selector that tries to minimize the register pressure.
+ * @note Not really operational yet.
+ */
+extern const list_sched_selector_t *reg_pressure_selector;
+
 /**
  * List schedule a graph.
  * 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 be_sched_imm(ir_graph *irg);
+void list_sched(const struct _arch_isa_t *isa, ir_graph *irg);
 
 #endif