+ clear_defs(current_node);
+ set_uses(current_node);
+
+ op = get_irn_op(current_node);
+ peephole_node = (peephole_opt_func)op->ops.generic;
+ if (peephole_node == NULL)
+ continue;
+
+ peephole_node(current_node);
+ assert(!is_Bad(current_node));
+ }
+}
+
+static void kill_node_and_preds(ir_node *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_Bad());
+ 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 *ret_blk, ir_graph *irg) {
+ ir_node *irn;
+
+ sched_foreach_reverse(ret_blk, irn) {
+ const ir_edge_t *edge, *next;
+
+ if (!be_is_Barrier(irn))
+ continue;
+
+ 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);
+
+ edges_reroute_kind(proj, pred, EDGE_KIND_NORMAL, irg);
+ edges_reroute_kind(proj, pred, EDGE_KIND_DEP, irg);
+ }
+
+ 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;
+ 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);
+
+ skip_barrier(ret_blk, irg);
+ }
+
+ /* skip the barrier on the start block */
+ start_blk = get_irg_start_block(irg);
+ skip_barrier(start_blk, irg);
+}
+
+/**
+ * Check whether the node has only one user. Explicitly ignore the anchor.
+ */
+static int has_only_one_user(ir_node *node)
+{
+ int n = get_irn_n_edges(node);
+ const ir_edge_t *edge;
+
+ if (n <= 1)
+ return 1;
+
+ if (n > 2)
+ return 0;
+
+ foreach_out_edge(node, edge) {
+ ir_node *src = get_edge_src_irn(edge);
+ if (is_Anchor(src))
+ return 1;
+ }
+
+ return 0;
+}
+
+/*
+ * Tries to optimize a beIncSP node with its previous IncSP node.
+ * Must be run from a be_peephole_opt() context.
+ */
+ir_node *be_peephole_IncSP_IncSP(ir_node *node)
+{
+ int pred_offs;
+ int curr_offs;
+ int offs;
+ ir_node *pred = be_get_IncSP_pred(node);
+
+ if (!be_is_IncSP(pred))
+ return node;
+
+ if (!has_only_one_user(pred))
+ return node;
+
+ pred_offs = be_get_IncSP_offset(pred);
+ curr_offs = be_get_IncSP_offset(node);
+
+ if (pred_offs == BE_STACK_FRAME_SIZE_EXPAND) {
+ if (curr_offs != BE_STACK_FRAME_SIZE_SHRINK) {
+ return node;