BugFix: when a node in schedule got exchanged, it is turned into Bad: do not set...

[libfirm] / ir / be / besched.h

diff --git a/ir/be/besched.h b/ir/be/besched.h
index 5cffe1f..78edf13 100644 (file)
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -21,13 +21,10 @@ ir_node *sched_first(const ir_node *block);
 ir_node *sched_last(const ir_node *block);
 ir_node *sched_add_before(ir_node *before, ir_node *irn);
 ir_node *sched_add_after(ir_node *before, ir_node *irn);
+void    sched_init_block(ir_node *block);
+void    sched_reset(ir_node *node);
 void    sched_remove(ir_node *irn);
 
-/**
- * Returns the first block of a graphs block schedule.
- */
-ir_node *sched_irg_first(const ir_graph *irg);
-
 #define sched_is_end(irn) is_Block(irn)
 #define sched_is_begin(irn) is_Block(irn)
 
@@ -53,19 +50,6 @@ ir_node *sched_irg_first(const ir_graph *irg);
 #define sched_foreach_reverse(block,irn) \
   sched_foreach_reverse_from(sched_last(block), irn)
 
-/**
- * Calculates a block schedule. The schedule is returned as
- * an array allocated on the irg's obstack.
- *
- * @param irg  the graph to be scheduled
- *
- * @return A list of all blocks in schedule order. This list is
- *         allocated on irg's obstack and is freed if the graph is destroyed.
- *
- * This function implements a simple extended block scheduling algorithm.
- */
-ir_node **sched_create_block_schedule(ir_graph *irg);
-
 /**
  * Removes dead nodes from schedule
  * @param irg  the graph