* You can implement your own list scheduler by implementing these
* functions.
*/
-struct _list_sched_selector_t {
+struct list_sched_selector_t {
/**
* Called before a graph is being scheduled.
* May be NULL.
*
* @param vtab The selector vtab.
- * @param birg The backend graph.
+ * @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 be_irg_t *birg);
+ void *(*init_graph)(const list_sched_selector_t *vtab, ir_graph *irg);
/**
* Called before scheduling starts on a block.
ir_node *(*select)(void *block_env, ir_nodeset_t *ready_set,
ir_nodeset_t *live_set);
- /**
- * 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.
- */
- int (*to_appear_in_schedule)(void *block_env, const ir_node *irn);
-
/**
* This function gets executed after a node finally has been made ready.
* May be NULL.
* head of the schedule. You can walk this list using the functions in
* list.h.
*
- * @param birg The backend irg.
- * @param be_opts The backend options
+ * @param irg The backend irg.
*/
-void list_sched(be_irg_t *birg, be_options_t *be_opts);
+void list_sched(ir_graph *irg);
/**
* List schedule a block.
* Same as list_sched but only for a certain block (needed for ILP fallback).
*/
-void list_sched_single_block(const be_irg_t *birg, ir_node *block, be_options_t *be_opts);
+void list_sched_single_block(ir_graph *irg, ir_node *block);
-#endif /* FIRM_BE_BELISTSCHED_H */
+#endif