+ op = get_irn_op(current_node);
+ peephole_node = (peephole_opt_func)op->ops.generic;
+ if (peephole_node == NULL)
+ continue;
+
+ DB((dbg, LEVEL_2, "optimize %+F\n", current_node));
+ peephole_node(current_node);
+ assert(!is_Bad(current_node));
+ }
+}
+
+static void kill_node_and_preds(ir_node *node)
+{
+ ir_graph *irg = get_irn_irg(node);
+ int arity, i;
+
+ arity = get_irn_arity(node);
+ for (i = 0; i < arity; ++i) {
+ ir_node *pred = get_irn_n(node, i);
+
+ set_irn_n(node, i, new_r_Bad(irg));
+ if (get_irn_n_edges(pred) != 0)
+ continue;
+
+ kill_node_and_preds(pred);
+ }
+
+ if (!is_Proj(node))
+ sched_remove(node);
+ kill_node(node);
+}
+
+/**
+ * Walk through the block schedule and skip all barrier nodes.
+ */
+static void skip_barrier(ir_node *block, ir_graph *irg)
+{
+ ir_node *irn;
+
+ sched_foreach_reverse(block, irn) {
+ int arity;
+ unsigned *used;
+ size_t n_used;
+ const ir_edge_t *edge, *next;
+
+ if (!be_is_Barrier(irn))
+ continue;
+
+ /* track which outputs are actually used, as we have to create
+ * keep nodes for unused outputs */
+ arity = get_irn_arity(irn);
+ rbitset_alloca(used, arity);
+
+ foreach_out_edge_safe(irn, edge, next) {
+ ir_node *proj = get_edge_src_irn(edge);
+ int pn;
+ ir_node *pred;
+
+ if (is_Anchor(proj))
+ continue;
+
+ pn = (int) get_Proj_proj(proj);
+ pred = get_irn_n(irn, pn);
+
+ rbitset_set(used, pn);
+
+ edges_reroute_kind(proj, pred, EDGE_KIND_NORMAL, irg);
+ edges_reroute_kind(proj, pred, EDGE_KIND_DEP, irg);
+ }
+
+ /* the barrier also had the effect of a Keep for unused inputs.
+ * we now have to create an explicit Keep for them */
+ n_used = rbitset_popcount(used, arity);
+ if (n_used < (size_t) arity) {
+ int n_in = arity - (int) n_used;
+ ir_node **in = ALLOCAN(ir_node*, n_in);
+ int i = 0;
+ int n = 0;
+ ir_node *keep;
+
+ for (i = 0; i < arity; ++i) {
+ if (rbitset_is_set(used, i))
+ continue;
+ assert(n < n_in);
+ in[n++] = get_irn_n(irn, i);
+ }
+ keep = be_new_Barrier(get_nodes_block(irn), n_in, in);
+ keep_alive(keep);
+ sched_add_before(irn, keep);
+ }
+
+ kill_node_and_preds(irn);
+ break;
+ }
+}
+
+/**
+ * Kill the Barrier nodes for better peephole optimization.
+ */
+static void kill_barriers(ir_graph *irg)
+{
+ ir_node *end_blk = get_irg_end_block(irg);
+ ir_node *start_blk = get_irg_start_block(irg);
+ int i;
+
+ /* skip the barrier on all return blocks */
+ for (i = get_Block_n_cfgpreds(end_blk) - 1; i >= 0; --i) {
+ ir_node *be_ret = get_Block_cfgpred(end_blk, i);
+ ir_node *ret_blk = get_nodes_block(be_ret);
+
+ if (ret_blk == start_blk)