- if (is_Block(from))
- from = sched_prev(from);
- for (curr = from; curr != bl && predicator(curr, data); curr = sched_prev(curr)) {
- }
- }
-
- return curr;
-}
-
-//---------------------------------------------------------------------------
-
-typedef struct remove_dead_nodes_env_t_ {
- bitset_t *reachable;
- ir_graph *irg;
- be_lv_t *lv;
-} remove_dead_nodes_env_t;
-
-/**
- * Post-walker: remember all visited nodes in a bitset.
- */
-static void mark_dead_nodes_walker(ir_node *node, void *data)
-{
- remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
- bitset_set(env->reachable, get_irn_idx(node));
-}
-
-/**
- * Post-block-walker:
- * Walk through the schedule of every block and remove all dead nodes from it.
- */
-static void remove_dead_nodes_walker(ir_node *block, void *data)
-{
- remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
- ir_node *node, *next;
-
- for (node = sched_first(block); ! sched_is_end(node); node = next) {
- /* get next node now, as after calling sched_remove it will be invalid */
- next = sched_next(node);
-
- if (bitset_is_set(env->reachable, get_irn_idx(node)))
- continue;
-
- if (env->lv)
- be_liveness_remove(env->lv, node);
- sched_remove(node);
- kill_node(node);
+ sched_timestep_t ts = (before_ts + after_ts) / 2;
+
+ /*
+ * If the resolution went out, we have to renumber
+ * this block.
+ */
+ if(ts == before_ts || ts == after_ts)
+ sched_renumber(get_nodes_block(irn));
+ else
+ info->time_step = ts;