X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=fd59bca487623f975ddce8a311bbb7604abb4e1a;hb=945c6c2ceebef5e41c0486c31f49d2319cacb3da;hp=1ffccb49ca68d9889067d433ff1cd2d8743fe395;hpb=1a90f19861b54e47085c18f644260aab97239b32;p=libfirm

diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h
index 1ffccb49c..fd59bca48 100644
--- a/ir/be/belistsched.h
+++ b/ir/be/belistsched.h
@@ -1,38 +1,47 @@
-/**
- * Primitive list scheduling.
- * @date 20.10.2004
- * @author Sebastian Hack
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
-#ifndef _FIRM_LIST_SCHED
-#define _FIRM_LIST_SCHED
+/**
+ * @file
+ * @brief       Common functions for creating listscheduling algorithms
+ * @author      Sebastian Hack
+ * @date        20.10.2004
+ */
+#ifndef FIRM_BE_BELISTSCHED_H
+#define FIRM_BE_BELISTSCHED_H
 
 #include "firm_types.h"
+#include "irnodeset.h"
 
-#include "benodesets.h"
-#include "bearch_t.h"
-
-typedef struct _list_sched_selector_t list_sched_selector_t;
+#include "be.h"
+#include "be_types.h"
+#include "bearch.h"
 
 /**
  * A selector interface which is used by the list schedule framework.
  * You can implement your own list scheduler by implementing these
  * functions.
  */
-struct _list_sched_selector_t {
+typedef struct list_sched_selector_t {
 
 	/**
 	 * Called before a graph is being scheduled.
-	 * @param arch_env The architecture environment.
-	 * @param irg      The graph.
-	 * @return         The environment pointer that is passed to all other functions in this struct.
+	 * May be NULL.
+	 *
+	 * @param irg      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)(ir_graph *irg);
 
 	/**
 	 * Called before scheduling starts on a block.
-	 * @param graph_env The environment.
-	 * @param block The block which is to be scheduled.
+	 * May be NULL.
+	 *
+	 * @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);
@@ -41,44 +50,38 @@ struct _list_sched_selector_t {
 	 * 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.
+	 * MUST be implemented.
 	 *
-	 * @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.
 	 * @return The chosen node.
 	 */
-	ir_node *(*select)(void *block_env, nodeset *ready_set);
+	ir_node *(*select)(void *block_env, ir_nodeset_t *ready_set);
 
 	/**
-	 * This function decides, if a node should appear in a schedule.
+	 * This function gets executed after a node finally has been made ready.
+	 * May be NULL.
+	 *
 	 * @param block_env The block environment.
-	 * @param irn       The node.
-	 * @return 1, if the node should be scheduled, 0 if not.
+	 * @param irn       The node made ready.
+	 * @param pred      The previously scheduled node.
 	 */
-	int (*to_appear_in_schedule)(void *block_env, const ir_node *irn);
+	void (*node_ready)(void *block_env, ir_node *irn, ir_node *pred);
 
 	/**
-	 * 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.
+	 * This function gets executed after a node finally has been selected.
+	 * May be NULL.
 	 *
-	 * @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.
+	 * @param block_env The block environment.
+	 * @param irn       The selected node.
 	 */
-	unsigned (*latency)(void *block_env, const ir_node *pred, int pred_cycle, const ir_node *curr, int curr_cycle);
+	void (*node_selected)(void *block_env, ir_node *irn);
 
 	/**
 	 * Called after a block has been scheduled.
+	 * May be NULL.
+	 *
 	 * @param env The environment.
 	 * @param block_env The per block environment as returned by init_block().
 	 */
@@ -86,31 +89,21 @@ struct _list_sched_selector_t {
 
 	/**
 	 * Called after a whole graph has been scheduled.
+	 * May be NULL.
+	 *
 	 * @param env The environment.
 	 */
 	void (*finish_graph)(void *env);
-
-};
-
-
-/**
- * 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_sched_selector_t;
 
 /**
  * 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 birg The backend irg.
+ *
+ * @param irg     The backend irg.
  */
-void list_sched(const be_irg_t *birg, int disable_mris);
+void be_list_sched_graph(ir_graph *irg, const list_sched_selector_t *selector);
 
-#endif /* _FIRM_LIST_SCHED */
+#endif