/*
- * Scheduling utilities for nodes in Blocks and Blocks.
+ * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
*
- * $Id$
+ * 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.
+ */
+
+/**
+ * @file
+ * @brief Scheduling utilities for nodes in Blocks and Blocks.
+ * @author Sebastian Hack
+ * @version $Id$
*/
-#ifndef _BESCHED_H
-#define _BESCHED_H
+#ifndef FIRM_BE_BESCHED_H
+#define FIRM_BE_BESCHED_H
#include <stdio.h>
-#include "firm_types.h"
+#include "irgraph.h"
+#include "irnode.h"
+#include "beirg.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);
+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);
-ir_node *sched_add_before(ir_node *before, ir_node *irn);
-ir_node *sched_add_after(ir_node *before, ir_node *irn);
+void sched_add_before(ir_node *before, ir_node *irn);
+void 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)
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(be_irg_t *birg);
-#endif /* _BESCHED_H */
+#endif /* FIRM_BE_BESCHED_H */