From 68e866451e08b9056f9454df2622fe71c28c5517 Mon Sep 17 00:00:00 2001 From: Jeffrey A Law Date: Mon, 24 Jul 2000 15:32:05 +0000 Subject: [PATCH] gcse.c (alloc_avail_expr_mem): Kill unused 'u_bitmap'. * gcse.c (alloc_avail_expr_mem): Kill unused 'u_bitmap'. (free_avail_expr_mem, alloc_pre_mem, free_pre_mem): Corresponding changes. From-SVN: r35225 --- gcc/ChangeLog | 4 ++++ gcc/gcse.c | 16 ---------------- 2 files changed, 4 insertions(+), 16 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 32e7e5d..9e9a681 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,5 +1,9 @@ Mon Jul 24 02:04:52 2000 Jeffrey A Law (law@cygnus.com) + * gcse.c (alloc_avail_expr_mem): Kill unused 'u_bitmap'. + (free_avail_expr_mem, alloc_pre_mem, free_pre_mem): Corresponding + changes. + * gcse.c (free_pre_mem): Do not free ANTLOC and AE_KILL here. (compute_pre_data): Do it here instead. diff --git a/gcc/gcse.c b/gcc/gcse.c index 618a434..f879ea7 100644 --- a/gcc/gcse.c +++ b/gcc/gcse.c @@ -494,13 +494,6 @@ static int copy_prop_count; Normally they'd be defined a bit later, but `rd_gen' needs to be declared sooner. */ -/* A bitmap of all ones for implementing the algorithm for available - expressions and reaching definitions. */ -/* ??? Available expression bitmaps have a different size than reaching - definition bitmaps. This should be the larger of the two, however, it - is not currently used for reaching definitions. */ -static sbitmap u_bitmap; - /* Each block has a bitmap of each type. The length of each blocks bitmap is: @@ -2663,9 +2656,6 @@ alloc_avail_expr_mem (n_blocks, n_exprs) ae_out = (sbitmap *) sbitmap_vector_alloc (n_blocks, n_exprs); sbitmap_vector_zero (ae_out, n_basic_blocks); - - u_bitmap = (sbitmap) sbitmap_alloc (n_exprs); - sbitmap_ones (u_bitmap); } static void @@ -2675,7 +2665,6 @@ free_avail_expr_mem () free (ae_gen); free (ae_in); free (ae_out); - free (u_bitmap); } /* Compute the set of available expressions generated in each basic block. */ @@ -4057,7 +4046,6 @@ alloc_pre_mem (n_blocks, n_exprs) pre_delete_map = NULL; ae_in = NULL; ae_out = NULL; - u_bitmap = NULL; transpout = sbitmap_vector_alloc (n_blocks, n_exprs); ae_kill = sbitmap_vector_alloc (n_blocks, n_exprs); @@ -4089,14 +4077,10 @@ free_pre_mem () free (ae_in); if (ae_out) free (ae_out); - if (u_bitmap) - free (u_bitmap); transp = comp = NULL; pre_optimal = pre_redundant = pre_insert_map = pre_delete_map = NULL; transpout = ae_in = ae_out = NULL; - u_bitmap = NULL; - } /* Top level routine to do the dataflow analysis needed by PRE. */ -- 2.7.4