X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched.h;h=a7b8699bfcb589ca31e95eb23371edeab9a0b195;hb=9a6232862313e1e255e8039f2d2144cde9f671ad;hp=be4b2800310cb75e8e016d41d29a452376043b18;hpb=7bf9fdac5c995fc159253d5dacf51802db724409;p=libfirm

diff --git a/ir/be/besched.h b/ir/be/besched.h
index be4b28003..a7b8699bf 100644
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -1,5 +1,5 @@
 /*
- * 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.
  *
@@ -79,13 +79,18 @@ void    sched_remove(const ir_node *irn);
 #define sched_foreach_reverse(block,irn) \
   sched_foreach_reverse_from(sched_last(block), irn)
 
+/**
+ * A shorthand macro for iterating over all Phi nodes of a schedule.
+ * @param block The block.
+ * @param phi A ir node pointer used as an iterator.
+ */
+#define sched_foreach_Phi(block,phi) \
+	for (phi = sched_first(block); is_Phi(phi); phi = sched_next(phi))
+
 /**
  * Removes dead nodes from schedule
  * @param irg  the graph
  */
 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