-static void skip_barrier(ir_node *ret_blk, ir_graph *irg) {
- ir_node *irn;
-
- sched_foreach_reverse(ret_blk, irn) {
- if (be_is_Barrier(irn)) {
- const ir_edge_t *edge, *next;
-
- foreach_out_edge_safe(irn, edge, next) {
- ir_node *proj = get_edge_src_irn(edge);
- int pn = (int)get_Proj_proj(proj);
- ir_node *pred = get_irn_n(irn, pn);
-
- edges_reroute_kind(proj, pred, EDGE_KIND_NORMAL, irg);
- edges_reroute_kind(proj, pred, EDGE_KIND_DEP, irg);
- }
- sched_remove(irn);
- kill_node(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);
+bool be_has_only_one_user(ir_node *node)
+{
+ int n = get_irn_n_edges(node);
+ int n_users;
+ const ir_edge_t *edge;
+
+ if (n <= 1)
+ return 1;
+
+ n_users = 0;
+ foreach_out_edge(node, edge) {
+ ir_node *src = get_edge_src_irn(edge);
+ /* ignore anchor and keep-alive edges */
+ if (is_Anchor(src) || is_End(src))
+ continue;
+ n_users++;