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/df-core.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/df-core.c')
| -rw-r--r-- | gcc/df-core.c | 8 |
1 files changed, 2 insertions, 6 deletions
diff --git a/gcc/df-core.c b/gcc/df-core.c index 19f4d3dae8c..98787a768c6 100644 --- a/gcc/df-core.c +++ b/gcc/df-core.c @@ -1303,14 +1303,13 @@ loop_post_order_compute (int *post_order, struct loop *loop) edge_iterator *stack; int sp; int post_order_num = 0; - bitmap visited; /* Allocate stack for back-tracking up CFG. */ stack = XNEWVEC (edge_iterator, loop->num_nodes + 1); sp = 0; /* Allocate bitmap to track nodes that have been visited. */ - visited = BITMAP_ALLOC (NULL); + auto_bitmap visited; /* Push the first edge on to the stack. */ stack[sp++] = ei_start (loop_preheader_edge (loop)->src->succs); @@ -1352,7 +1351,6 @@ loop_post_order_compute (int *post_order, struct loop *loop) } free (stack); - BITMAP_FREE (visited); return post_order_num; } @@ -1367,14 +1365,13 @@ loop_inverted_post_order_compute (int *post_order, struct loop *loop) edge_iterator *stack; int sp; int post_order_num = 0; - bitmap visited; /* Allocate stack for back-tracking up CFG. */ stack = XNEWVEC (edge_iterator, loop->num_nodes + 1); sp = 0; /* Allocate bitmap to track nodes that have been visited. */ - visited = BITMAP_ALLOC (NULL); + auto_bitmap visited; /* Put all latches into the initial work list. In theory we'd want to start from loop exits but then we'd have the special case of @@ -1420,7 +1417,6 @@ loop_inverted_post_order_compute (int *post_order, struct loop *loop) } free (stack); - BITMAP_FREE (visited); return post_order_num; } |