+Mon Jul 24 02:04:52 2000 Jeffrey A Law (law@cygnus.com)
+
+ * gcse.c (alloc_pre_mem, free_pre_mem): Delete unused bitmap
+ 'temp_bitmap'.
+ (pre_delete): Corresponding changes.
+
2000-07-23 Mark Mitchell <mark@codesourcery.com>
* c-semantics.c (make_rtl_for_local_static): Use TREE_ASM_WRITTEN
/* Contains the edge_list returned by pre_edge_lcm. */
static struct edge_list *edge_list;
-static sbitmap *temp_bitmap;
-
/* Redundant insns. */
static sbitmap pre_redundant_insns;
transp = sbitmap_vector_alloc (n_blocks, n_exprs);
comp = sbitmap_vector_alloc (n_blocks, n_exprs);
antloc = sbitmap_vector_alloc (n_blocks, n_exprs);
- temp_bitmap = sbitmap_vector_alloc (n_blocks, n_exprs);
pre_optimal = NULL;
pre_redundant = NULL;
free (transp);
free (comp);
free (antloc);
- free (temp_bitmap);
if (pre_optimal)
free (pre_optimal);
struct expr *expr;
struct occr *occr;
- /* Compute the expressions which are redundant and need to be replaced by
- copies from the reaching reg to the target reg. */
- for (bb = 0; bb < n_basic_blocks; bb++)
- sbitmap_copy (temp_bitmap[bb], pre_delete_map[bb]);
-
changed = 0;
for (i = 0; i < expr_hash_table_size; i++)
for (expr = expr_hash_table[i]; expr != NULL; expr = expr->next_same_hash)
rtx set;
int bb = BLOCK_NUM (insn);
- if (TEST_BIT (temp_bitmap[bb], indx))
+ if (TEST_BIT (pre_delete_map[bb], indx))
{
set = single_set (insn);
if (! set)