List schedule selectors have new function which allows the backend to

choose which nodes may appear in schedules and which not

diff --git a/ir/be/besched.c b/ir/be/besched.c
index f856db4..91e99d4 100644 (file)
--- a/ir/be/besched.c
+++ b/ir/be/besched.c
@@ -73,7 +73,7 @@ int sched_verify(const ir_node *block)
   const ir_node *irn;
   int i, n;
   int *save_time_step;
-  ir_node **save_nodes;
+  const ir_node **save_nodes;
   const ir_edge_t *edge;
   pset *scheduled_nodes = pset_new_ptr_default();
 
@@ -152,7 +152,7 @@ int sched_verify(const ir_node *block)
 
   del_pset(scheduled_nodes);
   free(save_time_step);
-  free(save_nodes);
+  free((void *) save_nodes);
   return res;
 }
 

diff --git a/ir/be/besched_t.h b/ir/be/besched_t.h
index 0d37f86..600430e 100644 (file)
--- a/ir/be/besched_t.h
+++ b/ir/be/besched_t.h
@@ -53,7 +53,7 @@ static INLINE int _sched_get_time_step(const ir_node *irn)
  * @param irn The node to check for.
  * @return 1, if the node consumes/produces data, false if not.
  */
-static INLINE int to_appear_in_schedule(ir_node *irn)
+static INLINE int to_appear_in_schedule(const ir_node *irn)
 {
   if(get_irn_opcode(irn) == iro_Start)
        return 1;