This ensures callers take ownership of the returned vector.
Signed-off-by: Trevor Saunders <tbsaunde@tbsaunde.org>
gcc/ChangeLog:
* cfgloop.h (get_loop_hot_path): Return auto_vec<basic_block>.
* cfgloopanal.c (get_loop_hot_path): Likewise.
* tree-ssa-loop-ivcanon.c (tree_estimate_loop_size): Likewise.
extern void doloop_optimize_loops (void);
extern void move_loop_invariants (void);
-extern vec<basic_block> get_loop_hot_path (const class loop *loop);
+extern auto_vec<basic_block> get_loop_hot_path (const class loop *loop);
/* Returns the outermost loop of the loop nest that contains LOOP.*/
static inline class loop *
order against direction of edges from latch. Specially, if
header != latch, latch is the 1-st block. */
-vec<basic_block>
+auto_vec<basic_block>
get_loop_hot_path (const class loop *loop)
{
basic_block bb = loop->header;
gimple_stmt_iterator gsi;
unsigned int i;
bool after_exit;
- vec<basic_block> path = get_loop_hot_path (loop);
+ auto_vec<basic_block> path = get_loop_hot_path (loop);
size->overall = 0;
size->eliminated_by_peeling = 0;
- size->last_iteration_eliminated_by_peeling) > upper_bound)
{
free (body);
- path.release ();
return true;
}
}
size->num_branches_on_hot_path++;
}
}
- path.release ();
+
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "size: %i-%i, last_iteration: %i-%i\n", size->overall,
size->eliminated_by_peeling, size->last_iteration,