/**
* Called before a graph is being scheduled.
+ * May be NULL.
+ *
* @param vtab The selector vtab.
* @param birg The backend graph.
* @return The environment pointer that is passed to all other functions in this struct.
/**
* Called before scheduling starts on a block.
+ * 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.
* 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.
*
* @param block_env Some private information as returned by init_block().
* @param sched_head The schedule so far.
/**
* This function decides, if a node should appear in a schedule.
+ * May be NULL.
+ *
* @param block_env The block environment.
* @param irn The node.
* @return 1, if the node should be scheduled, 0 if not.
/**
* 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 made ready.
* @param pred The previously scheduled node.
/**
* This function gets executed after a node finally has been selected.
+ * May be NULL.
+ *
* @param block_env The block environment.
* @param irn The selected node.
*/
/**
* Returns the execution time of node irn.
+ * May be NULL.
+ *
+ * @param block_env The block environment.
+ * @param irn The selected node.
*/
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.
+ * May be NULL.
*
* @param block_env The block environment.
* @param pred The previous node.
/**
* 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().
*/
/**
* Called after a whole graph has been scheduled.
+ * May be NULL.
+ *
* @param env The environment.
*/
void (*finish_graph)(void *env);
-
};
*/
extern const list_sched_selector_t trivial_selector;
+/**
+ * A trivial selector that selects a pseudo-random-node (deterministic).
+ */
extern const list_sched_selector_t random_selector;
/**
/**
* A selector based on trace scheduling as introduced by Muchnik[TM]
- * but using the mueller heuristic selector.
+ * but using the Mueller heuristic selector.
*/
extern const list_sched_selector_t heuristic_selector;
/**
- * A selector based on the strong normal form theorem
+ * A selector based on the strong normal form theorem (ie minimizing
+ * the register pressure).
*/
extern const list_sched_selector_t normal_selector;