}
block = get_nodes_block(n);
- /* do not move unreachable code (or its predecessors around) since dominance
- * is inalid there */
- if (!is_block_reachable(block))
- return;
/* first move predecessors up */
arity = get_irn_arity(n);
if (is_Bad(new_block))
continue;
- if (is_block_reachable(new_block))
- dca = calc_dom_dca(dca, new_block);
+ assert(is_block_reachable(new_block));
+ dca = calc_dom_dca(dca, new_block);
}
}
} else {
* the users of Proj are our users. */
dca = get_deepest_common_dom_ancestor(succ, dca);
} else {
- /* ignore successors in unreachable code */
- ir_node *succ_blk = get_nodes_block(succ);
- if (!is_block_reachable(succ_blk))
- continue;
+ assert(is_block_reachable(get_nodes_block(succ)));
dca = consumer_dom_dca(dca, succ, node);
}
}
return;
}
- /* don't move unreachable code around */
block = get_nodes_block(n);
- if (!is_block_reachable(block))
- return;
+ assert(is_block_reachable(block));
/* deepest common ancestor in the dominator tree of all nodes'
blocks depending on us; our final placement has to dominate
worklist = new_waitq();
place_early(irg, worklist);
+ /* While GCSE might place nodes in unreachable blocks,
+ * these are now placed in reachable blocks. */
+
/* Note: place_early changes only blocks, no data edges. So, the
* data out edges are still valid, no need to recalculate them here. */
unnecessary executions of the node. */
place_late(irg, worklist);
- set_irg_outs_inconsistent(irg);
- set_irg_loopinfo_inconsistent(irg);
del_waitq(worklist);
}