diff options
| author | Trevor Saunders <tbsaunde+gcc@tbsaunde.org> | 2016-07-13 02:44:52 +0000 |
|---|---|---|
| committer | Trevor Saunders <tbsaunde@gcc.gnu.org> | 2016-07-13 02:44:52 +0000 |
| commit | 8c6812476a028328a11c68079d1714c9f81b6279 (patch) | |
| tree | b23b2bc969495367f8ea5f18416b898c1494be56 /gcc/tree-ssa-loop-niter.c | |
| parent | fcd215916e0991815853999267824defe1963379 (diff) | |
| download | gcc-8c6812476a028328a11c68079d1714c9f81b6279.zip gcc-8c6812476a028328a11c68079d1714c9f81b6279.tar.gz gcc-8c6812476a028328a11c68079d1714c9f81b6279.tar.bz2 | |
use auto_vec for more local variables
gcc/c/ChangeLog:
2016-07-12 Trevor Saunders <tbsaunde+gcc@tbsaunde.org>
* c-parser.c (c_parser_generic_selection): Make type of variable
auto_vec.
(c_parser_omp_declare_simd): Likewise.
gcc/ChangeLog:
2016-07-12 Trevor Saunders <tbsaunde+gcc@tbsaunde.org>
* cfgexpand.c (expand_used_vars): Make the type of a local variable auto_vec.
* genmatch.c (lower_for): Likewise.
* haifa-sched.c (haifa_sched_init): Likewise.
(add_to_speculative_block): Likewise.
(create_check_block_twin): Likewise.
* predict.c (handle_missing_profiles): Likewise.
* tree-data-ref.c (loop_nest_has_data_refs): Likewise.
* tree-diagnostic.c (maybe_unwind_expanded_macro_loc): Likewise.
* tree-ssa-loop-niter.c (discover_iteration_bound_by_body_walk): Likewise.
(maybe_lower_iteration_bound): Likewise.
* tree-ssa-sccvn.c (DFS): Likewise.
* tree-stdarg.c (reachable_at_most_once): Likewise.
* tree-vect-stmts.c (vectorizable_conversion): Likewise.
(vectorizable_store): Likewise.
From-SVN: r238285
Diffstat (limited to 'gcc/tree-ssa-loop-niter.c')
| -rw-r--r-- | gcc/tree-ssa-loop-niter.c | 6 |
1 files changed, 2 insertions, 4 deletions
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c index 0723752..732e06a 100644 --- a/gcc/tree-ssa-loop-niter.c +++ b/gcc/tree-ssa-loop-niter.c @@ -3438,7 +3438,7 @@ static void discover_iteration_bound_by_body_walk (struct loop *loop) { struct nb_iter_bound *elt; - vec<widest_int> bounds = vNULL; + auto_vec<widest_int> bounds; vec<vec<basic_block> > queues = vNULL; vec<basic_block> queue = vNULL; ptrdiff_t queue_index; @@ -3593,7 +3593,6 @@ discover_iteration_bound_by_body_walk (struct loop *loop) } queues.release (); - bounds.release (); } /* See if every path cross the loop goes through a statement that is known @@ -3606,7 +3605,7 @@ maybe_lower_iteration_bound (struct loop *loop) hash_set<gimple *> *not_executed_last_iteration = NULL; struct nb_iter_bound *elt; bool found_exit = false; - vec<basic_block> queue = vNULL; + auto_vec<basic_block> queue; bitmap visited; /* Collect all statements with interesting (i.e. lower than @@ -3698,7 +3697,6 @@ maybe_lower_iteration_bound (struct loop *loop) } BITMAP_FREE (visited); - queue.release (); delete not_executed_last_iteration; } |