/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
* unique to that block. a node schedule before another node has a lower
* timestep than this node.
*/
+int have_sched_info(const 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);
*/
void be_remove_dead_nodes_from_schedule(be_irg_t *birg);
-void be_sched_init_phase(ir_graph *irg);
-void be_sched_free_phase(ir_graph *irg);
-
-#endif /* FIRM_BE_BESCHED_H */
+#endif