#ifndef _FIRM_LIST_SCHED
#define _FIRM_LIST_SCHED
-#include "irgraph.h"
-#include "irnode.h"
+#include "firm_config.h"
-#include "pset.h"
-#include "pmap.h"
-#include "list.h"
+#include "firm_types.h"
-struct _arch_isa_t;
+#include "benodesets.h"
+#include "bearch_t.h"
+#include "be.h"
typedef struct _list_sched_selector_t 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.
+ * @param arch_env The architecture environment.
+ * @param irg The 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 struct _arch_isa_t *isa, ir_graph *irg);
+ void *(*init_graph)(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg);
/**
* 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);
* 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, pset *ready_set);
+ ir_node *(*select)(void *block_env, nodeset *ready_set, nodeset *live_set);
/**
- * This function descides, if a node should appear in a schedule.
+ * 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);
+ /**
+ * 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.
};
-/**
- * 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;
+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 isa The isa which implements the scheduler.
- * @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 struct _arch_isa_t *isa, ir_graph *irg);
+void list_sched_register_options(lc_opt_entry_t *grp);
+#endif /* WITH_LIBCORE */
-#endif
+#endif /* _FIRM_LIST_SCHED */
projects / libfirm / blobdiff