Commit 5a660bff by Daniel Berlin Committed by Jeff Law

gcse.c, [...]: s/free on sbitmap vectors/sbitmap_vector_free on sbitmap vectors/g

        * gcse.c, lcm.c, sched-deps.c:
        s/free on sbitmap vectors/sbitmap_vector_free on sbitmap vectors/g

        * flow.c (flow_loops_find): Free dom if we found no loops, since
        we aren't going to save it.

        * lcm.c (pre_edge_rev_lcm): Free st_antin, st_antout when we are
        done.

From-SVN: r43938
parent 1a9485cf
2001-07-11 Daniel Berlin <dan@cgsoftware.com>
* gcse.c, lcm.c, sched-deps.c:
s/free on sbitmap vectors/sbitmap_vector_free on sbitmap vectors/g
* flow.c (flow_loops_find): Free dom if we found no loops, since
we aren't going to save it.
* lcm.c (pre_edge_rev_lcm): Free st_antin, st_antout when we are
done.
Wed Jul 11 09:00:48 2001 Jeffrey A Law (law@cygnus.com) Wed Jul 11 09:00:48 2001 Jeffrey A Law (law@cygnus.com)
* ssa-ccp.c (ssa_fast_dce): Free worklist when completed. * ssa-ccp.c (ssa_fast_dce): Free worklist when completed.
......
...@@ -9017,6 +9017,10 @@ flow_loops_find (loops, flags) ...@@ -9017,6 +9017,10 @@ flow_loops_find (loops, flags)
sbitmap_free (headers); sbitmap_free (headers);
} }
else
{
sbitmap_vector_free (dom);
}
loops->num = num_loops; loops->num = num_loops;
......
...@@ -1051,7 +1051,7 @@ free_gcse_mem () ...@@ -1051,7 +1051,7 @@ free_gcse_mem ()
free (reg_set_bitmap); free (reg_set_bitmap);
free (reg_set_in_block); sbitmap_vector_free (reg_set_in_block);
free (mem_set_in_block); free (mem_set_in_block);
/* re-Cache any INSN_LIST nodes we have allocated. */ /* re-Cache any INSN_LIST nodes we have allocated. */
{ {
...@@ -2959,10 +2959,10 @@ alloc_rd_mem (n_blocks, n_insns) ...@@ -2959,10 +2959,10 @@ alloc_rd_mem (n_blocks, n_insns)
static void static void
free_rd_mem () free_rd_mem ()
{ {
free (rd_kill); sbitmap_vector_free (rd_kill);
free (rd_gen); sbitmap_vector_free (rd_gen);
free (reaching_defs); sbitmap_vector_free (reaching_defs);
free (rd_out); sbitmap_vector_free (rd_out);
} }
/* Add INSN to the kills of BB. REGNO, set in BB, is killed by INSN. */ /* Add INSN to the kills of BB. REGNO, set in BB, is killed by INSN. */
...@@ -3101,10 +3101,10 @@ alloc_avail_expr_mem (n_blocks, n_exprs) ...@@ -3101,10 +3101,10 @@ alloc_avail_expr_mem (n_blocks, n_exprs)
static void static void
free_avail_expr_mem () free_avail_expr_mem ()
{ {
free (ae_kill); sbitmap_vector_free (ae_kill);
free (ae_gen); sbitmap_vector_free (ae_gen);
free (ae_in); sbitmap_vector_free (ae_in);
free (ae_out); sbitmap_vector_free (ae_out);
} }
/* Compute the set of available expressions generated in each basic block. */ /* Compute the set of available expressions generated in each basic block. */
...@@ -3751,10 +3751,10 @@ alloc_cprop_mem (n_blocks, n_sets) ...@@ -3751,10 +3751,10 @@ alloc_cprop_mem (n_blocks, n_sets)
static void static void
free_cprop_mem () free_cprop_mem ()
{ {
free (cprop_pavloc); sbitmap_vector_free (cprop_pavloc);
free (cprop_absaltered); sbitmap_vector_free (cprop_absaltered);
free (cprop_avin); sbitmap_vector_free (cprop_avin);
free (cprop_avout); sbitmap_vector_free (cprop_avout);
} }
/* For each block, compute whether X is transparent. X is either an /* For each block, compute whether X is transparent. X is either an
...@@ -4462,24 +4462,23 @@ alloc_pre_mem (n_blocks, n_exprs) ...@@ -4462,24 +4462,23 @@ alloc_pre_mem (n_blocks, n_exprs)
static void static void
free_pre_mem () free_pre_mem ()
{ {
free (transp); sbitmap_vector_free (transp);
free (comp); sbitmap_vector_free (comp);
/* ANTLOC and AE_KILL are freed just after pre_lcm finishes. */ /* ANTLOC and AE_KILL are freed just after pre_lcm finishes. */
if (pre_optimal) if (pre_optimal)
free (pre_optimal); sbitmap_vector_free (pre_optimal);
if (pre_redundant) if (pre_redundant)
free (pre_redundant); sbitmap_vector_free (pre_redundant);
if (pre_insert_map) if (pre_insert_map)
free (pre_insert_map); sbitmap_vector_free (pre_insert_map);
if (pre_delete_map) if (pre_delete_map)
free (pre_delete_map); sbitmap_vector_free (pre_delete_map);
if (ae_in) if (ae_in)
free (ae_in); sbitmap_vector_free (ae_in);
if (ae_out) if (ae_out)
free (ae_out); sbitmap_vector_free (ae_out);
transp = comp = NULL; transp = comp = NULL;
pre_optimal = pre_redundant = pre_insert_map = pre_delete_map = NULL; pre_optimal = pre_redundant = pre_insert_map = pre_delete_map = NULL;
...@@ -4537,9 +4536,9 @@ compute_pre_data () ...@@ -4537,9 +4536,9 @@ compute_pre_data ()
edge_list = pre_edge_lcm (gcse_file, n_exprs, transp, comp, antloc, edge_list = pre_edge_lcm (gcse_file, n_exprs, transp, comp, antloc,
ae_kill, &pre_insert_map, &pre_delete_map); ae_kill, &pre_insert_map, &pre_delete_map);
free (antloc); sbitmap_vector_free (antloc);
antloc = NULL; antloc = NULL;
free (ae_kill); sbitmap_vector_free (ae_kill);
ae_kill = NULL; ae_kill = NULL;
free (trapping_expr); free (trapping_expr);
} }
...@@ -4907,7 +4906,7 @@ pre_edge_insert (edge_list, index_map) ...@@ -4907,7 +4906,7 @@ pre_edge_insert (edge_list, index_map)
} }
} }
free (inserted); sbitmap_vector_free (inserted);
return did_insert; return did_insert;
} }
...@@ -5587,10 +5586,10 @@ delete_null_pointer_checks (f) ...@@ -5587,10 +5586,10 @@ delete_null_pointer_checks (f)
free (block_reg); free (block_reg);
/* Free bitmaps. */ /* Free bitmaps. */
free (npi.nonnull_local); sbitmap_vector_free (npi.nonnull_local);
free (npi.nonnull_killed); sbitmap_vector_free (npi.nonnull_killed);
free (nonnull_avin); sbitmap_vector_free (nonnull_avin);
free (nonnull_avout); sbitmap_vector_free (nonnull_avout);
} }
/* Code Hoisting variables and subroutines. */ /* Code Hoisting variables and subroutines. */
...@@ -5635,16 +5634,16 @@ alloc_code_hoist_mem (n_blocks, n_exprs) ...@@ -5635,16 +5634,16 @@ alloc_code_hoist_mem (n_blocks, n_exprs)
static void static void
free_code_hoist_mem () free_code_hoist_mem ()
{ {
free (antloc); sbitmap_vector_free (antloc);
free (transp); sbitmap_vector_free (transp);
free (comp); sbitmap_vector_free (comp);
free (hoist_vbein); sbitmap_vector_free (hoist_vbein);
free (hoist_vbeout); sbitmap_vector_free (hoist_vbeout);
free (hoist_exprs); sbitmap_vector_free (hoist_exprs);
free (transpout); sbitmap_vector_free (transpout);
free (dominators); sbitmap_vector_free (dominators);
} }
/* Compute the very busy expressions at entry/exit from each block. /* Compute the very busy expressions at entry/exit from each block.
...@@ -7026,19 +7025,19 @@ free_store_memory () ...@@ -7026,19 +7025,19 @@ free_store_memory ()
free_ldst_mems (); free_ldst_mems ();
if (ae_gen) if (ae_gen)
free (ae_gen); sbitmap_vector_free (ae_gen);
if (ae_kill) if (ae_kill)
free (ae_kill); sbitmap_vector_free (ae_kill);
if (transp) if (transp)
free (transp); sbitmap_vector_free (transp);
if (st_antloc) if (st_antloc)
free (st_antloc); sbitmap_vector_free (st_antloc);
if (pre_insert_map) if (pre_insert_map)
free (pre_insert_map); sbitmap_vector_free (pre_insert_map);
if (pre_delete_map) if (pre_delete_map)
free (pre_delete_map); sbitmap_vector_free (pre_delete_map);
if (reg_set_in_block) if (reg_set_in_block)
free (reg_set_in_block); sbitmap_vector_free (reg_set_in_block);
ae_gen = ae_kill = transp = st_antloc = NULL; ae_gen = ae_kill = transp = st_antloc = NULL;
pre_insert_map = pre_delete_map = reg_set_in_block = NULL; pre_insert_map = pre_delete_map = reg_set_in_block = NULL;
...@@ -7067,7 +7066,7 @@ store_motion () ...@@ -7067,7 +7066,7 @@ store_motion ()
num_stores = compute_store_table (); num_stores = compute_store_table ();
if (num_stores == 0) if (num_stores == 0)
{ {
free (reg_set_in_block); sbitmap_vector_free (reg_set_in_block);
end_alias_analysis (); end_alias_analysis ();
return; return;
} }
......
...@@ -422,7 +422,7 @@ pre_edge_lcm (file, n_exprs, transp, avloc, antloc, kill, insert, delete) ...@@ -422,7 +422,7 @@ pre_edge_lcm (file, n_exprs, transp, avloc, antloc, kill, insert, delete)
avin = sbitmap_vector_alloc (n_basic_blocks, n_exprs); avin = sbitmap_vector_alloc (n_basic_blocks, n_exprs);
avout = sbitmap_vector_alloc (n_basic_blocks, n_exprs); avout = sbitmap_vector_alloc (n_basic_blocks, n_exprs);
compute_available (avloc, kill, avout, avin); compute_available (avloc, kill, avout, avin);
free (avin); sbitmap_vector_free (avin);
/* Compute global anticipatability. */ /* Compute global anticipatability. */
antin = sbitmap_vector_alloc (n_basic_blocks, n_exprs); antin = sbitmap_vector_alloc (n_basic_blocks, n_exprs);
...@@ -446,9 +446,9 @@ pre_edge_lcm (file, n_exprs, transp, avloc, antloc, kill, insert, delete) ...@@ -446,9 +446,9 @@ pre_edge_lcm (file, n_exprs, transp, avloc, antloc, kill, insert, delete)
dump_sbitmap_vector (file, "earliest", "", earliest, num_edges); dump_sbitmap_vector (file, "earliest", "", earliest, num_edges);
#endif #endif
free (antout); sbitmap_vector_free (antout);
free (antin); sbitmap_vector_free (antin);
free (avout); sbitmap_vector_free (avout);
later = sbitmap_vector_alloc (num_edges, n_exprs); later = sbitmap_vector_alloc (num_edges, n_exprs);
...@@ -464,14 +464,14 @@ pre_edge_lcm (file, n_exprs, transp, avloc, antloc, kill, insert, delete) ...@@ -464,14 +464,14 @@ pre_edge_lcm (file, n_exprs, transp, avloc, antloc, kill, insert, delete)
} }
#endif #endif
free (earliest); sbitmap_vector_free (earliest);
*insert = sbitmap_vector_alloc (num_edges, n_exprs); *insert = sbitmap_vector_alloc (num_edges, n_exprs);
*delete = sbitmap_vector_alloc (n_basic_blocks, n_exprs); *delete = sbitmap_vector_alloc (n_basic_blocks, n_exprs);
compute_insert_delete (edge_list, antloc, later, laterin, *insert, *delete); compute_insert_delete (edge_list, antloc, later, laterin, *insert, *delete);
free (laterin); sbitmap_vector_free (laterin);
free (later); sbitmap_vector_free (later);
#ifdef LCM_DEBUG_INFO #ifdef LCM_DEBUG_INFO
if (file) if (file)
...@@ -791,8 +791,11 @@ pre_edge_rev_lcm (file, n_exprs, transp, st_avloc, st_antloc, kill, ...@@ -791,8 +791,11 @@ pre_edge_rev_lcm (file, n_exprs, transp, st_avloc, st_antloc, kill,
dump_sbitmap_vector (file, "farthest", "", farthest, num_edges); dump_sbitmap_vector (file, "farthest", "", farthest, num_edges);
#endif #endif
free (st_avin); sbitmap_vector_free (st_antin);
free (st_avout); sbitmap_vector_free (st_antout);
sbitmap_vector_free (st_avin);
sbitmap_vector_free (st_avout);
nearer = sbitmap_vector_alloc (num_edges, n_exprs); nearer = sbitmap_vector_alloc (num_edges, n_exprs);
...@@ -809,15 +812,15 @@ pre_edge_rev_lcm (file, n_exprs, transp, st_avloc, st_antloc, kill, ...@@ -809,15 +812,15 @@ pre_edge_rev_lcm (file, n_exprs, transp, st_avloc, st_antloc, kill,
} }
#endif #endif
free (farthest); sbitmap_vector_free (farthest);
*insert = sbitmap_vector_alloc (num_edges, n_exprs); *insert = sbitmap_vector_alloc (num_edges, n_exprs);
*delete = sbitmap_vector_alloc (n_basic_blocks, n_exprs); *delete = sbitmap_vector_alloc (n_basic_blocks, n_exprs);
compute_rev_insert_delete (edge_list, st_avloc, nearer, nearerout, compute_rev_insert_delete (edge_list, st_avloc, nearer, nearerout,
*insert, *delete); *insert, *delete);
free (nearerout); sbitmap_vector_free (nearerout);
free (nearer); sbitmap_vector_free (nearer);
#ifdef LCM_DEBUG_INFO #ifdef LCM_DEBUG_INFO
if (file) if (file)
...@@ -827,7 +830,6 @@ pre_edge_rev_lcm (file, n_exprs, transp, st_avloc, st_antloc, kill, ...@@ -827,7 +830,6 @@ pre_edge_rev_lcm (file, n_exprs, transp, st_avloc, st_antloc, kill,
n_basic_blocks); n_basic_blocks);
} }
#endif #endif
return edge_list; return edge_list;
} }
......
...@@ -1541,14 +1541,14 @@ free_dependency_caches () ...@@ -1541,14 +1541,14 @@ free_dependency_caches ()
{ {
if (true_dependency_cache) if (true_dependency_cache)
{ {
free (true_dependency_cache); sbitmap_vector_free (true_dependency_cache);
true_dependency_cache = NULL; true_dependency_cache = NULL;
free (anti_dependency_cache); sbitmap_vector_free (anti_dependency_cache);
anti_dependency_cache = NULL; anti_dependency_cache = NULL;
free (output_dependency_cache); sbitmap_vector_free (output_dependency_cache);
output_dependency_cache = NULL; output_dependency_cache = NULL;
#ifdef ENABLE_CHECKING #ifdef ENABLE_CHECKING
free (forward_dependency_cache); sbitmap_vector_free (forward_dependency_cache);
forward_dependency_cache = NULL; forward_dependency_cache = NULL;
#endif #endif
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment