/* Loop header copying on trees.
- Copyright (C) 2004 Free Software Foundation, Inc.
+ Copyright (C) 2004, 2005 Free Software Foundation, Inc.
This file is part of GCC.
return false;
gcc_assert (EDGE_COUNT (header->succs) > 0);
- if (EDGE_COUNT (header->succs) == 1)
+ if (single_succ_p (header))
return false;
if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest)
&& flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 1)->dest))
/* If this is not the original loop header, we want it to have just
one predecessor in order to match the && pattern. */
- if (header != loop->header && EDGE_COUNT (header->preds) >= 2)
+ if (header != loop->header && !single_pred_p (header))
return false;
last = last_stmt (header);
loops = loop_optimizer_init (dump_file);
if (!loops)
return;
- rewrite_into_loop_closed_ssa ();
+ rewrite_into_loop_closed_ssa (NULL);
/* We do not try to keep the information about irreducible regions
up-to-date. */
/* Ensure that the header will have just the latch as a predecessor
inside the loop. */
- if (EDGE_COUNT (exit->dest->preds) > 1)
- exit = EDGE_SUCC (loop_split_edge_with (exit, NULL), 0);
+ if (!single_pred_p (exit->dest))
+ exit = single_succ_edge (loop_split_edge_with (exit, NULL));
if (!tree_duplicate_sese_region (loop_preheader_edge (loop), exit,
bbs, n_bbs, NULL))