X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=56880dbfb390ab97ff5fc84e383448a2ba1b59d9;hb=48f0393daa5d5a14ed7e3e32ee2b090759c9371e;hp=514ef3e1895cb9bd34c31a57fd11b5df5e225134;hpb=f218b1a471440f4d753c1ab59725f166f73da05d;p=libfirm

diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h
index 514ef3e18..56880dbfb 100644
--- a/ir/be/belistsched.h
+++ b/ir/be/belistsched.h
@@ -7,10 +7,13 @@
 #ifndef _FIRM_LIST_SCHED
 #define _FIRM_LIST_SCHED
 
+#include "firm_config.h"
+
 #include "firm_types.h"
 
 #include "benodesets.h"
 #include "bearch_t.h"
+#include "be.h"
 
 typedef struct _list_sched_selector_t list_sched_selector_t;
 
@@ -31,8 +34,8 @@ struct _list_sched_selector_t {
 
 	/**
 	 * Called before scheduling starts on a block.
-	 * @param graph_env The environment.
-	 * @param block The block which is to be scheduled.
+	 * @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 *graph_env, ir_node *block);
@@ -42,15 +45,13 @@ struct _list_sched_selector_t {
 	 * 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.
 	 *
-	 * @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.
-	 * @param ready_list A set containing all ready nodes. Pick one of these
-	 * nodes.
+	 * @param block_env   Some private information as returned by init_block().
+	 * @param sched_head  The schedule so far.
+	 * @param ready_set   A set containing all ready nodes. Pick one of these nodes.
+	 * @param live_set    A set containing all nodes currently alive.
 	 * @return The chosen node.
 	 */
-	ir_node *(*select)(void *block_env, nodeset *ready_set);
+	ir_node *(*select)(void *block_env, nodeset *ready_set, nodeset *live_set);
 
 	/**
 	 * This function decides, if a node should appear in a schedule.
@@ -60,6 +61,38 @@ struct _list_sched_selector_t {
 	 */
 	int (*to_appear_in_schedule)(void *block_env, const ir_node *irn);
 
+	/**
+	 * This function gets executed after a node finally has been made ready.
+	 * @param block_env The block environment.
+	 * @param irn       The node made ready.
+	 * @param pred      The previously scheduled node.
+	 */
+	void (*node_ready)(void *block_env, ir_node *irn, ir_node *pred);
+
+	/**
+	 * This function gets executed after a node finally has been selected.
+	 * @param block_env The block environment.
+	 * @param irn       The selected node.
+	 */
+	void (*node_selected)(void *block_env, ir_node *irn);
+
+	/**
+	 * Returns the execution time of node irn.
+	 */
+	unsigned (*exectime)(void *block_env, const ir_node *irn);
+
+	/**
+	 * Calculates the latency of executing cycle curr_cycle of node curr in cycle pred_cycle
+	 * of node pred.
+	 *
+	 * @param block_env   The block environment.
+	 * @param pred        The previous node.
+	 * @param pred_cycle  The previous node execution cycle.
+	 * @param curr        The current node.
+	 * @param curr_cycle  The current node execution cycle.
+	 */
+	unsigned (*latency)(void *block_env, const ir_node *pred, int pred_cycle, const ir_node *curr, int curr_cycle);
+
 	/**
 	 * Called after a block has been scheduled.
 	 * @param env The environment.
@@ -81,20 +114,43 @@ struct _list_sched_selector_t {
  */
 extern const list_sched_selector_t *trivial_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;
 
+/**
+ * A selector based on trace scheduling as introduced by Muchnik[TM]
+ */
+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;
+
 /**
  * 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 arch_env The architecture environment.
- * @param irg      The graph to schedule.
+ *
+ * @param birg        The backend irg.
+ * @param enable_mris Flag indicating if mris preparation should be done
+ */
+void list_sched(const be_irg_t *birg, be_options_t *be_opts);
+
+#ifdef WITH_LIBCORE
+#include <libcore/lc_opts.h>
+
+/**
+ * Register list scheduler options.
  */
-void list_sched(const arch_env_t *arch_env, ir_graph *irg);
+void list_sched_register_options(lc_opt_entry_t *grp);
+#endif /* WITH_LIBCORE */
 
 #endif /* _FIRM_LIST_SCHED */