build_int_cst (type, 1));
incr_at = bsi_last (in->src);
create_iv (niter,
- fold_convert (type, integer_minus_one_node),
+ build_int_cst (type, -1),
NULL_TREE, loop,
&incr_at, false, NULL, &var);
if (n_unroll)
{
sbitmap wont_exit;
- edge *edges_to_remove = xmalloc (sizeof (edge *) * n_unroll);
+ edge *edges_to_remove = XNEWVEC (edge, n_unroll);
unsigned int n_to_remove = 0;
old_cond = COND_EXPR_COND (cond);
/* The main entry point of the pass. Adds canonical induction variables
to the suitable LOOPS. */
-void
+unsigned int
canonicalize_induction_variables (struct loops *loops)
{
unsigned i;
scev_reset ();
if (changed)
- cleanup_tree_cfg_loop ();
+ return TODO_cleanup_cfg;
+ return 0;
}
/* Unroll LOOPS completely if they iterate just few times. Unless
MAY_INCREASE_SIZE is true, perform the unrolling only if the
size of the code does not increase. */
-void
+unsigned int
tree_unroll_loops_completely (struct loops *loops, bool may_increase_size)
{
unsigned i;
scev_reset ();
if (changed)
- cleanup_tree_cfg_loop ();
+ return TODO_cleanup_cfg;
+ return 0;
}
/* Checks whether LOOP is empty. */
/* Remove the empty LOOPS. */
-void
+unsigned int
remove_empty_loops (struct loops *loops)
{
bool changed = false;
if (changed)
{
scev_reset ();
- cleanup_tree_cfg_loop ();
+ return TODO_cleanup_cfg;
}
+ return 0;
}