use is_$KIND(n) instead of get_irn_op(n) == op_$KIND.

[libfirm] / ir / be / besched.h

diff --git a/ir/be/besched.h b/ir/be/besched.h
index 9ef2f53..9a9ab2d 100644 (file)
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -20,9 +20,7 @@
 /**
  * @file
  * @brief       data structures for scheduling nodes in basic blocks.
- *              (This file does not contain the scheduling algorithms)
  * @author      Sebastian Hack, Matthias Braun
- * @version     $Id$
  */
 #ifndef FIRM_BE_BESCHED_H
 #define FIRM_BE_BESCHED_H
@@ -43,6 +41,8 @@ static sched_info_t *get_irn_sched_info(const ir_node *node)
 
 /**
  * Check, if the node is scheduled.
+ * Block nodes are reported as scheduled as they mark the begin and end
+ * of the scheduling list.
  * @param irn The node.
  * @return 1, if the node is scheduled, 0 if not.
  */
@@ -52,8 +52,8 @@ static inline bool sched_is_scheduled(const ir_node *irn)
 }
 
 /**
- * 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
+ * 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.
  * @param irn The node.
  * @return The time step in the schedule.
@@ -199,10 +199,10 @@ static inline bool sched_comes_after(const ir_node *n1, const ir_node *n2)
 }
 
 #define sched_foreach_from(from, irn) \
-  for(irn = from; !sched_is_end(irn); irn = sched_next(irn))
+  for (ir_node *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))
+  for (ir_node *irn = from; !sched_is_begin(irn); irn = sched_prev(irn))
 
 /**
  * A shorthand macro for iterating over a schedule.
@@ -221,11 +221,18 @@ static inline bool sched_comes_after(const ir_node *n1, const ir_node *n2)
   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.
+ * Type for a function scheduling a graph
+ */
+typedef void (*schedule_func) (ir_graph *irg);
+
+/**
+ * Register new scheduling algorithm
+ */
+void be_register_scheduler(const char *name, schedule_func func);
+
+/**
+ * schedule a graph with the currenty selected scheduler.
  */
-#define sched_foreach_Phi(block,phi) \
-       for (phi = sched_first(block); is_Phi(phi); phi = sched_next(phi))
+void be_schedule_graph(ir_graph *irg);
 
 #endif