X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbesched.h;h=c7fbab2c36d559902be09c1424b0fafefd876b20;hb=27ad03859f9b1a5f96354f01fb9ce3801738aa81;hp=06bfdf7091306b597cc2a243ee73976aa8366651;hpb=8ccaa22c4f8f4585c5989bee969a75b7ac974032;p=libfirm

diff --git a/ir/be/besched.h b/ir/be/besched.h
index 06bfdf709..c7fbab2c3 100644
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -1,22 +1,66 @@
+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
 
-#ifndef _BESCHED_H
-#define _BESCHED_H
+/**
+ * @file
+ * @brief       Scheduling utilities for nodes in Blocks and Blocks.
+ * @author      Sebastian Hack
+ * @version     $Id$
+ */
+#ifndef FIRM_BE_BESCHED_H
+#define FIRM_BE_BESCHED_H
 
 #include <stdio.h>
+
 #include "irgraph.h"
 #include "irnode.h"
+#include "beirg.h"
+
+void be_sched_dump(FILE *f, ir_graph *irg);
+
+/**
+ * returns the time step of a node. Each node in a block has a timestep
+ * unique to that block. a node schedule before another node has a lower
+ * timestep than this node.
+ */
+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);
+int     sched_is_scheduled(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);
+void    sched_add_before(ir_node *before, ir_node *irn);
+void    sched_add_after(ir_node *after, 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)
 
-void be_sched_dump(FILE *f, const ir_graph *irg);
+#define sched_foreach_from(from, irn) \
+  for(irn = from; !sched_is_end(irn); irn = sched_next(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_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 +68,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 +76,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(be_irg_t *birg);
 
-#endif
+#endif /* FIRM_BE_BESCHED_H */