diff options
| author | Trevor Saunders <tbsaunde+gcc@tbsaunde.org> | 2017-05-14 00:38:48 +0000 |
|---|---|---|
| committer | Trevor Saunders <tbsaunde@gcc.gnu.org> | 2017-05-14 00:38:48 +0000 |
| commit | 0e3de1d41eb6179eac75c8ae44c16c1ba1d2f5dd (patch) | |
| tree | 6de1ecd2f719b8ec208ed45a232c64387837fa79 /gcc/tree-ssanames.c | |
| parent | 792bb49bb0732500fe4e87fbeae4aee3cb187112 (diff) | |
use auto_bitmap more
gcc/ChangeLog:
2017-05-13 Trevor Saunders <tbsaunde+gcc@tbsaunde.org>
* bt-load.c (combine_btr_defs): Use auto_bitmap to manage bitmap
lifetime.
(migrate_btr_def): Likewise.
* cfgloop.c (get_loop_body_in_bfs_order): Likewise.
* df-core.c (loop_post_order_compute): Likewise.
(loop_inverted_post_order_compute): Likewise.
* hsa-common.h: Likewise.
* hsa-gen.c (hsa_bb::~hsa_bb): Likewise.
* init-regs.c (initialize_uninitialized_regs): Likewise.
* ipa-inline.c (resolve_noninline_speculation): Likewise.
(inline_small_functions): Likewise.
* ipa-reference.c (ipa_reference_write_optimization_summary): Likewise.
* ira.c (combine_and_move_insns): Likewise.
(build_insn_chain): Likewise.
* loop-invariant.c (find_invariants): Likewise.
* lower-subreg.c (propagate_pseudo_copies): Likewise.
* predict.c (tree_predict_by_opcode): Likewise.
(predict_paths_leading_to): Likewise.
(predict_paths_leading_to_edge): Likewise.
(estimate_loops_at_level): Likewise.
(estimate_loops): Likewise.
* shrink-wrap.c (try_shrink_wrapping): Likewise.
(spread_components): Likewise.
* tree-cfg.c (remove_edge_and_dominated_blocks): Likewise.
* tree-loop-distribution.c (rdg_build_partitions): Likewise.
* tree-predcom.c (tree_predictive_commoning_loop): Likewise.
* tree-ssa-coalesce.c (coalesce_ssa_name): Likewise.
* tree-ssa-phionlycprop.c (pass_phi_only_cprop::execute): Likewise.
* tree-ssa-pre.c (remove_dead_inserted_code): Likewise.
* tree-ssa-sink.c (nearest_common_dominator_of_uses): Likewise.
* tree-ssa-threadupdate.c (compute_path_counts): Likewise.
(mark_threaded_blocks): Likewise.
(thread_through_all_blocks): Likewise.
* tree-ssa.c (verify_ssa): Likewise.
(execute_update_addresses_taken): Likewise.
* tree-ssanames.c (verify_ssaname_freelists): Likewise.
From-SVN: r248021
Diffstat (limited to 'gcc/tree-ssanames.c')
| -rw-r--r-- | gcc/tree-ssanames.c | 10 |
1 files changed, 3 insertions, 7 deletions
diff --git a/gcc/tree-ssanames.c b/gcc/tree-ssanames.c index 6487542eb8f..353c7b1906a 100644 --- a/gcc/tree-ssanames.c +++ b/gcc/tree-ssanames.c @@ -127,7 +127,7 @@ verify_ssaname_freelists (struct function *fun) if (!gimple_in_ssa_p (fun)) return; - bitmap names_in_il = BITMAP_ALLOC (NULL); + auto_bitmap names_in_il; /* Walk the entire IL noting every SSA_NAME we see. */ basic_block bb; @@ -165,7 +165,7 @@ verify_ssaname_freelists (struct function *fun) /* Now walk the free list noting what we find there and verifying there are no duplicates. */ - bitmap names_in_freelists = BITMAP_ALLOC (NULL); + auto_bitmap names_in_freelists; if (FREE_SSANAMES (fun)) { for (unsigned int i = 0; i < FREE_SSANAMES (fun)->length (); i++) @@ -221,7 +221,7 @@ verify_ssaname_freelists (struct function *fun) unsigned int i; bitmap_iterator bi; - bitmap all_names = BITMAP_ALLOC (NULL); + auto_bitmap all_names; bitmap_set_range (all_names, UNUSED_NAME_VERSION + 1, num_ssa_names - 1); bitmap_ior_into (names_in_il, names_in_freelists); @@ -230,10 +230,6 @@ verify_ssaname_freelists (struct function *fun) EXECUTE_IF_AND_COMPL_IN_BITMAP(all_names, names_in_il, UNUSED_NAME_VERSION + 1, i, bi) gcc_assert (!ssa_name (i)); - - BITMAP_FREE (all_names); - BITMAP_FREE (names_in_freelists); - BITMAP_FREE (names_in_il); } /* Move all SSA_NAMEs from FREE_SSA_NAMES_QUEUE to FREE_SSA_NAMES. |