- irg_walk(get_irg_end_block(irg), NULL, opt_walker, waitq);
-
- /*
- * Optimize keep-alives by removing superfluous ones.
- * Beware: the last transformation might add new keep-alives
- * that keep blocks that are where visited! So, check only the
- * "old" keep-alives, not the new ones!
- *
- * FIXME: it might be better to completely remove this
- * optimization here ...
- */
- for (i = n_ka - 1; i >= 0; --i) {
- ir_node *ka = get_End_keepalive(end, i);
-
- if (irn_visited(ka) && !is_irn_keep(ka)) {
- /* this node can be regularly visited, no need to keep it */
- set_End_keepalive(end, i, get_irg_bad(irg));
- }
- }
- /* now walk again and visit all not yet visited nodes */
- set_irg_visited(current_ir_graph, get_irg_visited(irg) - 1);
- irg_walk(get_irg_end(irg), NULL, opt_walker, waitq);
-
- /* finish the wait queue */
- while (! pdeq_empty(waitq)) {
- ir_node *n = pdeq_getl(waitq);
- if (! is_Bad(n))
+ irg_walk_graph(irg, NULL, opt_walker, waitq);
+
+ /* any optimized nodes are stored in the wait queue,
+ * so if it's not empty, the graph has been changed */
+ changed = !pdeq_empty(waitq);
+
+ while (!pdeq_empty(waitq)) {
+ /* finish the wait queue */
+ while (! pdeq_empty(waitq)) {
+ ir_node *n = (ir_node*)pdeq_getl(waitq);