X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbesched.h;h=78edf1345355a111880962b9f1c19ad750db7929;hb=02046d6f22e734521c84dfb2f342cf61e6442c2f;hp=e5a1bf80308cae475582b924a6d24b605a12a5f0;hpb=4cdd9d655a6d671f90f04d964769d2a664c4d734;p=libfirm

diff --git a/ir/be/besched.h b/ir/be/besched.h
index e5a1bf803..78edf1345 100644
--- 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)
 
@@ -54,16 +51,9 @@ ir_node *sched_irg_first(const ir_graph *irg);
   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.
+ * Removes dead nodes from schedule
+ * @param irg  the graph
  */
-ir_node **sched_create_block_schedule(ir_graph *irg);
+void be_remove_dead_nodes_from_schedule(ir_graph *irg);
 
 #endif /* _BESCHED_H */