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 06bfdf7..78edf13 100644 (file)
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -1,22 +1,38 @@
-
+/*
+ * Scheduling utilities for nodes in Blocks and Blocks.
+ *
+ * $Id$
+ */
 #ifndef _BESCHED_H
 #define _BESCHED_H
 
 #include <stdio.h>
-#include "irgraph.h"
-#include "irnode.h"
 
-void be_sched_dump(FILE *f, const ir_graph *irg);
+#include "firm_types.h"
+
+void be_sched_dump(FILE *f, ir_graph *irg);
+
+int     sched_get_time_step(const ir_node *irn);
+int     sched_has_next(const ir_node *irn);
+int     sched_has_prev(const ir_node *irn);
+ir_node *sched_next(const ir_node *irn);
+ir_node *sched_prev(const ir_node *irn);
+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);
+
+#define sched_is_end(irn) is_Block(irn)
+#define sched_is_begin(irn) is_Block(irn)
 
-int (sched_get_time_step)(const ir_node *irn);
-int (sched_has_next)(const ir_node *irn);
-int (sched_has_prev)(const ir_node *irn);
-ir_node *(sched_next)(const ir_node *irn);
-ir_node *(sched_prev)(const ir_node *irn);
-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_before)(ir_node *before, ir_node *irn);
+#define sched_foreach_from(from, irn) \
+  for(irn = from; !sched_is_end(irn); irn = sched_next(irn))
+
+#define sched_foreach_reverse_from(from, irn) \
+  for(irn = from; !sched_is_begin(irn); irn = sched_prev(irn))
 
 /**
  * A shorthand macro for iterating over a schedule.
@@ -24,7 +40,7 @@ ir_node *(sched_add_before)(ir_node *before, ir_node *irn);
  * @param irn A ir node pointer used as an iterator.
  */
 #define sched_foreach(block,irn) \
-       for(irn = sched_first(block); sched_has_next(irn); irn = sched_next(irn))
+       sched_foreach_from(sched_first(block), irn)
 
 /**
  * A shorthand macro for reversely iterating over a schedule.
@@ -32,6 +48,12 @@ ir_node *(sched_add_before)(ir_node *before, ir_node *irn);
  * @param irn A ir node pointer used as an iterator.
  */
 #define sched_foreach_reverse(block,irn) \
-       for(irn = sched_last(block); sched_has_prev(irn); irn = sched_prev(irn))
+  sched_foreach_reverse_from(sched_last(block), irn)
+
+/**
+ * Removes dead nodes from schedule
+ * @param irg  the graph
+ */
+void be_remove_dead_nodes_from_schedule(ir_graph *irg);
 
-#endif
+#endif /* _BESCHED_H */