* bitmap.h (BITMAP_XFREE): New.
* flow.c (life_analysis): Use it.
(life_analysis_1): Free blocks.
* combine.c (undo_commit): New.
(try_combine): Use it. Don't zap undobuf.undos.
(combine_instructions): Don't zap undobuf.undos; free the
undobuf.frees list.
* local-alloc.c (local_alloc): Free qty_phys_num_sugg.
* stmt.c (cost_table_): New.
(estimate_case_costs): Use it instead of xmalloc.
* toplev.c (compile_file): Reuse dumpname memory instead
of strdup'ing it.
From-SVN: r30404
+Thu Nov 4 16:44:53 1999 Richard Henderson <rth@cygnus.com>
+
+ * bitmap.h (BITMAP_XFREE): New.
+ * flow.c (life_analysis): Use it.
+ (life_analysis_1): Free blocks.
+
+ * combine.c (undo_commit): New.
+ (try_combine): Use it. Don't zap undobuf.undos.
+ (combine_instructions): Don't zap undobuf.undos; free the
+ undobuf.frees list.
+
+ * local-alloc.c (local_alloc): Free qty_phys_num_sugg.
+
+ * stmt.c (cost_table_): New.
+ (estimate_case_costs): Use it instead of xmalloc.
+
+ * toplev.c (compile_file): Reuse dumpname memory instead
+ of strdup'ing it.
+
Thu Nov 4 16:36:44 1999 Richard Henderson <rth@cygnus.com>
* reg-stack.c (convert_regs_1): Initialize target_stack->top
bitmap_initialize ((bitmap) xmalloc (sizeof (bitmap_head)))
/* Do any cleanup needed on a bitmap when it is no longer used. */
-#define BITMAP_FREE(BITMAP) \
-do { \
- if (BITMAP) \
- { \
- bitmap_clear (BITMAP); \
- (BITMAP) = 0; \
- } \
+#define BITMAP_FREE(BITMAP) \
+do { \
+ if (BITMAP) \
+ { \
+ bitmap_clear (BITMAP); \
+ (BITMAP) = 0; \
+ } \
+} while (0)
+
+/* Do any cleanup needed on an xmalloced bitmap when it is no longer used. */
+#define BITMAP_XFREE(BITMAP) \
+do { \
+ if (BITMAP) \
+ { \
+ bitmap_clear (BITMAP); \
+ free (BITMAP); \
+ (BITMAP) = 0; \
+ } \
} while (0)
/* Do any one-time initializations needed for bitmaps. */
static int contains_muldiv PROTO((rtx));
static rtx try_combine PROTO((rtx, rtx, rtx));
static void undo_all PROTO((void));
+static void undo_commit PROTO((void));
static rtx *find_split_point PROTO((rtx *, rtx));
static rtx subst PROTO((rtx, rtx, rtx, int, int));
static rtx combine_simplify_rtx PROTO((rtx, enum machine_mode, int, int));
combine_merges = 0;
combine_extras = 0;
combine_successes = 0;
- undobuf.undos = undobuf.previous_undos = 0;
combine_max_regno = nregs;
free (reg_last_set_sign_bit_copies);
free (uid_cuid);
+ {
+ struct undo *undo, *next;
+ for (undo = undobuf.frees; undo; undo = next)
+ {
+ next = undo->next;
+ free (undo);
+ }
+ undobuf.frees = 0;
+ }
+
total_attempts += combine_attempts;
total_merges += combine_merges;
total_extras += combine_extras;
return 0;
combine_attempts++;
-
- undobuf.undos = undobuf.previous_undos = 0;
undobuf.other_insn = 0;
/* Save the current high-water-mark so we can free storage if we didn't
}
combine_successes++;
+ undo_commit ();
/* Clear this here, so that subsequent get_last_value calls are not
affected. */
affected. */
subst_prev_insn = NULL_RTX;
}
+
+/* We've committed to accepting the changes we made. Move all
+ of the undos to the free list. */
+
+static void
+undo_commit ()
+{
+ struct undo *undo, *next;
+
+ for (undo = undobuf.undos; undo; undo = next)
+ {
+ next = undo->next;
+ undo->next = undobuf.frees;
+ undobuf.frees = undo;
+ }
+ undobuf.undos = undobuf.previous_undos = 0;
+}
+
\f
/* Find the innermost point within the rtx at LOC, possibly LOC itself,
where we have an arithmetic expression and return that point. LOC will
if (file)
dump_flow_info (file);
- BITMAP_FREE (uid_volatile);
- free (uid_volatile);
+ BITMAP_XFREE (uid_volatile);
free_basic_block_vars (1);
}
blocks = sbitmap_alloc (n_basic_blocks);
sbitmap_ones (blocks);
calculate_global_regs_live (blocks, blocks, flags & PROP_SCAN_DEAD_CODE);
+ sbitmap_free (blocks);
}
/* The only pseudos that are live at the beginning of the function are
free (qty_phys_copy_sugg);
free (qty_phys_num_copy_sugg);
free (qty_phys_sugg);
+ free (qty_phys_num_sugg);
free (qty_birth);
free (qty_death);
free (qty_first_reg);
/* These are used by estimate_case_costs and balance_case_nodes. */
/* This must be a signed type, and non-ANSI compilers lack signed char. */
+static short cost_table_[129];
static short *cost_table;
static int use_cost_table;
\f
if (cost_table == NULL)
{
- cost_table = ((short *) xcalloc (129, sizeof (short))) + 1;
+ cost_table = cost_table_ + 1;
for (i = 0; i < 128; i++)
{
asm_out_file = stdout;
else
{
- int len = strlen (dump_base_name);
- register char *dumpname = (char *) xmalloc (len + 6);
- strcpy (dumpname, dump_base_name);
- strip_off_ending (dumpname, len);
- strcat (dumpname, ".s");
if (asm_file_name == 0)
- asm_file_name = xstrdup (dumpname);
+ {
+ int len = strlen (dump_base_name);
+ char *dumpname = (char *) xmalloc (len + 6);
+ memcpy (dumpname, dump_base_name, len + 1);
+ strip_off_ending (dumpname, len);
+ strcat (dumpname, ".s");
+ asm_file_name = dumpname;
+ }
if (!strcmp (asm_file_name, "-"))
asm_out_file = stdout;
else