/* Simple garbage collection for the GNU compiler.
- Copyright (C) 1999, 2000 Free Software Foundation, Inc.
+ Copyright (C) 1999, 2000, 2001 Free Software Foundation, Inc.
-This file is part of GNU CC.
+This file is part of GCC.
-GNU CC is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 2, or (at your option) any
-later version.
+GCC is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free
+Software Foundation; either version 2, or (at your option) any later
+version.
-GNU CC is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+GCC is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
-along with GNU CC; see the file COPYING. If not, write to the Free
+along with GCC; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */
#include "tree.h"
#include "tm_p.h"
#include "hash.h"
+#include "hashtab.h"
#include "varray.h"
#include "ggc.h"
/* Statistics about the allocation. */
static ggc_statistics *ggc_stats;
+/* The FALSE_LABEL_STACK, declared in except.h, has language-dependent
+ semantics. If a front-end needs to mark the false label stack, it
+ should set this pointer to a non-NULL value. Otherwise, no marking
+ will be done. */
+void (*lang_mark_false_label_stack) PARAMS ((struct label_node *));
+
/* Trees that have been marked, but whose children still need marking. */
varray_type ggc_pending_trees;
static void ggc_mark_rtx_varray_ptr PARAMS ((void *));
static void ggc_mark_tree_varray_ptr PARAMS ((void *));
static void ggc_mark_tree_hash_table_ptr PARAMS ((void *));
-static void ggc_mark_string_ptr PARAMS ((void *));
+static int ggc_htab_delete PARAMS ((void **, void *));
static void ggc_mark_trees PARAMS ((void));
-static boolean ggc_mark_tree_hash_table_entry PARAMS ((struct hash_entry *,
- hash_table_key));
+static bool ggc_mark_tree_hash_table_entry PARAMS ((struct hash_entry *,
+ hash_table_key));
/* Maintain global roots that are preserved during GC. */
ggc_mark_tree_hash_table_ptr);
}
-/* Register an array of strings as a GC root. */
-
-void
-ggc_add_string_root (base, nelt)
- char **base;
- int nelt;
-{
- ggc_add_root (base, nelt, sizeof (char *), ggc_mark_string_ptr);
-}
-
/* Remove the previously registered GC root at BASE. */
void
abort();
}
+/* Add a hash table to be scanned when all roots have been processed. We
+ delete any entry in the table that has not been marked. */
+
+struct d_htab_root
+{
+ struct d_htab_root *next;
+ htab_t htab;
+ ggc_htab_marked_p marked_p;
+ ggc_htab_mark mark;
+};
+
+static struct d_htab_root *d_htab_roots;
+
+/* Add X, an htab, to a list of htabs that contain objects which are allocated
+ from GC memory. Once all other roots are marked, we check each object in
+ the htab to see if it has already been marked. If not, it is deleted.
+
+ MARKED_P, if specified, is a function that returns 1 if the entry is to
+ be considered as "marked". If not present, the data structure pointed to
+ by the htab slot is tested. This function should be supplied if some
+ other object (such as something pointed to by that object) should be tested
+ in which case the function tests whether that object (or objects) are
+ marked (using ggc_marked_p) and returns nonzero if it is.
+
+ MARK, if specified, is a function that is passed the contents of a slot
+ that has been determined to have been "marked" (via the above function)
+ and marks any other objects pointed to by that object. For example,
+ we might have a hash table of memory attribute blocks, which are pointed
+ to by a MEM RTL but have a pointer to a DECL. MARKED_P in that case will
+ not be specified because we want to know if the attribute block is pointed
+ to by the MEM, but MARK must be specified because if the block has been
+ marked, we need to mark the DECL. */
+
+void
+ggc_add_deletable_htab (x, marked_p, mark)
+ PTR x;
+ ggc_htab_marked_p marked_p;
+ ggc_htab_mark mark;
+{
+ struct d_htab_root *r
+ = (struct d_htab_root *) xmalloc (sizeof (struct d_htab_root));
+
+ r->next = d_htab_roots;
+ r->htab = (htab_t) x;
+ r->marked_p = marked_p ? marked_p : ggc_marked_p;
+ r->mark = mark;
+ d_htab_roots = r;
+}
+
+/* Process a slot of an htab by deleting it if it has not been marked. */
+
+static int
+ggc_htab_delete (slot, info)
+ void **slot;
+ void *info;
+{
+ struct d_htab_root *r = (struct d_htab_root *) info;
+
+ if (! (*r->marked_p) (*slot))
+ htab_clear_slot (r->htab, slot);
+ else if (r->mark)
+ (*r->mark) (*slot);
+
+ return 1;
+}
+
/* Iterate through all registered roots and mark each element. */
void
ggc_mark_roots ()
{
- struct ggc_root* x;
+ struct ggc_root *x;
+ struct d_htab_root *y;
VARRAY_TREE_INIT (ggc_pending_trees, 4096, "ggc_pending_trees");
/* Mark all the queued up trees, and their children. */
ggc_mark_trees ();
VARRAY_FREE (ggc_pending_trees);
+
+ /* Now scan all hash tables that have objects which are to be deleted if
+ they are not already marked. Since these may mark more trees, we need
+ to reinitialize that varray. */
+ VARRAY_TREE_INIT (ggc_pending_trees, 1024, "ggc_pending_trees");
+
+ for (y = d_htab_roots; y != NULL; y = y->next)
+ htab_traverse (y->htab, ggc_htab_delete, (PTR) y);
+ ggc_mark_trees ();
+ VARRAY_FREE (ggc_pending_trees);
}
/* R had not been previously marked, but has now been marked via
ggc_stats->size_rtxs[(int) code] += ggc_get_size (r);
}
- /* ??? If (some of) these are really pass-dependant info, do we
+ /* ??? If (some of) these are really pass-dependent info, do we
have any right poking our noses in? */
switch (code)
{
+ case MEM:
+ ggc_mark (MEM_ATTRS (r));
+ break;
case JUMP_INSN:
ggc_mark_rtx (JUMP_LABEL (r));
break;
case CODE_LABEL:
ggc_mark_rtx (LABEL_REFS (r));
- ggc_mark_string (LABEL_ALTERNATE_NAME (r));
break;
case LABEL_REF:
ggc_mark_rtx (LABEL_NEXTREF (r));
break;
default:
- if (NOTE_LINE_NUMBER (r) >= 0)
- {
- case NOTE_INSN_DELETED_LABEL:
- ggc_mark_string (NOTE_SOURCE_FILE (r));
- }
break;
}
break;
case 'V': case 'E':
ggc_mark_rtvec (XVEC (r, i));
break;
- case 'S': case 's':
- ggc_mark_if_gcable (XSTR (r, i));
- break;
}
}
}
ggc_mark_tree (TREE_IMAGPART (t));
break;
- case STRING_CST:
- ggc_mark_string (TREE_STRING_POINTER (t));
- break;
-
case PARM_DECL:
ggc_mark_rtx (DECL_INCOMING_RTL (t));
break;
break;
case IDENTIFIER_NODE:
- ggc_mark_string (IDENTIFIER_POINTER (t));
lang_mark_tree (t);
continue;
switch (TREE_CODE_CLASS (code))
{
case 'd': /* A decl node. */
- ggc_mark_string (DECL_SOURCE_FILE (t));
ggc_mark_tree (DECL_SIZE (t));
ggc_mark_tree (DECL_SIZE_UNIT (t));
ggc_mark_tree (DECL_NAME (t));
ggc_mark_tree (DECL_RESULT_FLD (t));
ggc_mark_tree (DECL_INITIAL (t));
ggc_mark_tree (DECL_ABSTRACT_ORIGIN (t));
- ggc_mark_tree (DECL_ASSEMBLER_NAME (t));
ggc_mark_tree (DECL_SECTION_NAME (t));
- ggc_mark_tree (DECL_MACHINE_ATTRIBUTES (t));
- ggc_mark_rtx (DECL_RTL (t));
+ ggc_mark_tree (DECL_ATTRIBUTES (t));
+ if (DECL_RTL_SET_P (t))
+ ggc_mark_rtx (DECL_RTL (t));
ggc_mark_rtx (DECL_LIVE_RANGE_RTL (t));
ggc_mark_tree (DECL_VINDEX (t));
+ if (DECL_ASSEMBLER_NAME_SET_P (t))
+ ggc_mark_tree (DECL_ASSEMBLER_NAME (t));
+ if (TREE_CODE (t) == FUNCTION_DECL)
+ {
+ ggc_mark_tree (DECL_SAVED_TREE (t));
+ ggc_mark_tree (DECL_INLINED_FNS (t));
+ if (DECL_SAVED_INSNS (t))
+ ggc_mark_struct_function (DECL_SAVED_INSNS (t));
+ }
lang_mark_tree (t);
break;
ggc_mark_tree (TYPE_NEXT_VARIANT (t));
ggc_mark_tree (TYPE_MAIN_VARIANT (t));
ggc_mark_tree (TYPE_BINFO (t));
- ggc_mark_tree (TYPE_NONCOPIED_PARTS (t));
ggc_mark_tree (TYPE_CONTEXT (t));
lang_mark_tree (t);
break;
ggc_mark_tree (VARRAY_TREE (v, i));
}
-/* Mark the hash table-entry HE. It's key field is really a tree. */
+/* Mark the hash table-entry HE. Its key field is really a tree. */
-static boolean
+static bool
ggc_mark_tree_hash_table_entry (he, k)
struct hash_entry *he;
hash_table_key k ATTRIBUTE_UNUSED;
ggc_mark_tree_hash_table (*(struct hash_table **) elt);
}
-/* Type-correct function to pass to ggc_add_root. It just forwards
- ELT (which is really a char **) to ggc_mark_string. */
-
-static void
-ggc_mark_string_ptr (elt)
- void *elt;
-{
- ggc_mark_string (*(char **) elt);
-}
-
-/* Allocate a gc-able string. If CONTENTS is null, then the memory will
- be uninitialized. If LENGTH is -1, then CONTENTS is assumed to be a
- null-terminated string and the memory sized accordingly. Otherwise,
- the memory is filled with LENGTH bytes from CONTENTS. */
-
-char *
-ggc_alloc_string (contents, length)
- const char *contents;
- int length;
-{
- char *string;
-
- if (length < 0)
- {
- if (contents == NULL)
- return NULL;
- length = strlen (contents);
- }
-
- string = (char *) ggc_alloc (length + 1);
- if (contents != NULL)
- memcpy (string, contents, length);
- string[length] = 0;
-
- return string;
-}
-
/* Allocate a block of memory, then clear it. */
void *
ggc_alloc_cleared (size)
}
/* Print statistics that are independent of the collector in use. */
+#define SCALE(x) ((unsigned long) ((x) < 1024*10 \
+ ? (x) \
+ : ((x) < 1024*1024*10 \
+ ? (x) / 1024 \
+ : (x) / (1024*1024))))
+#define LABEL(x) ((x) < 1024*10 ? ' ' : ((x) < 1024*1024*10 ? 'k' : 'M'))
void
-ggc_print_statistics (stream, stats)
+ggc_print_common_statistics (stream, stats)
FILE *stream;
ggc_statistics *stats;
{
}
/* Print the statistics for trees. */
- fprintf (stream, "%-22s%-16s%-16s%-7s\n", "Code",
+ fprintf (stream, "\n%-17s%10s %16s %10s\n", "Tree",
"Number", "Bytes", "% Total");
for (code = 0; code < MAX_TREE_CODES; ++code)
if (ggc_stats->num_trees[code])
{
- fprintf (stream, "%s%*s%-15u %-15lu %7.3f\n",
+ fprintf (stream, "%-17s%10u%16ld%c %10.3f\n",
tree_code_name[code],
- 22 - (int) strlen (tree_code_name[code]), "",
ggc_stats->num_trees[code],
- (unsigned long) ggc_stats->size_trees[code],
+ SCALE (ggc_stats->size_trees[code]),
+ LABEL (ggc_stats->size_trees[code]),
(100 * ((double) ggc_stats->size_trees[code])
/ ggc_stats->total_size_trees));
}
fprintf (stream,
- "%-22s%-15u %-15lu\n", "Total",
+ "%-17s%10u%16ld%c\n", "Total",
ggc_stats->total_num_trees,
- (unsigned long) ggc_stats->total_size_trees);
+ SCALE (ggc_stats->total_size_trees),
+ LABEL (ggc_stats->total_size_trees));
/* Print the statistics for RTL. */
- fprintf (stream, "\n%-22s%-16s%-16s%-7s\n", "Code",
+ fprintf (stream, "\n%-17s%10s %16s %10s\n", "RTX",
"Number", "Bytes", "% Total");
for (code = 0; code < NUM_RTX_CODE; ++code)
if (ggc_stats->num_rtxs[code])
{
- fprintf (stream, "%s%*s%-15u %-15lu %7.3f\n",
+ fprintf (stream, "%-17s%10u%16ld%c %10.3f\n",
rtx_name[code],
- 22 - (int) strlen (rtx_name[code]), "",
ggc_stats->num_rtxs[code],
- (unsigned long) ggc_stats->size_rtxs[code],
+ SCALE (ggc_stats->size_rtxs[code]),
+ LABEL (ggc_stats->size_rtxs[code]),
(100 * ((double) ggc_stats->size_rtxs[code])
/ ggc_stats->total_size_rtxs));
}
fprintf (stream,
- "%-22s%-15u %-15lu\n", "Total",
+ "%-17s%10u%16ld%c\n", "Total",
ggc_stats->total_num_rtxs,
- (unsigned long) ggc_stats->total_size_rtxs);
-
+ SCALE (ggc_stats->total_size_rtxs),
+ LABEL (ggc_stats->total_size_rtxs));
/* Don't gather statistics any more. */
ggc_stats = NULL;
OSDN Git Service
