X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fggc.h;h=3a88e1654790afef0584da6f52e0fb5d550d3437;hb=658fc6b4e6c918222cc8ec22e1f396e0cda0fe28;hp=3f55a21736b81e31e5e9d34373717a7f7d2debb8;hpb=9ffd5d6d55f198455c1715b04476596dd7a6a898;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/ggc.h b/gcc/ggc.h index 3f55a21736b..3a88e165479 100644 --- a/gcc/ggc.h +++ b/gcc/ggc.h @@ -1,200 +1,266 @@ /* Garbage collection for the GNU compiler. - Copyright (C) 1998, 1999 Free Software Foundation, Inc. + Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003 + 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 FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. +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 Software Foundation, 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ +You should have received a copy of the GNU General Public License +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 "gansidecl.h" +#ifndef GCC_GGC_H +#define GCC_GGC_H /* Symbols are marked with `ggc' for `gcc gc' so as not to interfere with an external gc library that might be linked in. */ -/* Language-specific code defines this variable to be either one (if - it wants garbage collection), or zero (if it does not). */ -extern int ggc_p; - -/* These structures are defined in various headers throughout the - compiler. However, rather than force everyone who includes this - header to include all the headers in which they are declared, we - just forward-declare them here. */ -struct eh_status; -struct emit_status; -struct expr_status; -struct hash_table; -struct label_node; -struct rtvec_def; -struct stmt_status; -union tree_node; -struct varasm_status; -struct varray_head_tag; - /* Constants for general use. */ -extern char *empty_string; - -/* Manipulate global roots that are needed between calls to gc. */ -void ggc_add_root PROTO ((void *base, int nelt, int size, void (*)(void *))); -void ggc_add_rtx_root PROTO ((struct rtx_def **, int nelt)); -void ggc_add_tree_root PROTO ((union tree_node **, int nelt)); -void ggc_add_string_root PROTO ((char **, int nelt)); -void ggc_add_tree_varray_root PROTO ((struct varray_head_tag **, int nelt)); -void ggc_add_tree_hash_table_root PROTO ((struct hash_table **, int nelt)); -void ggc_del_root PROTO ((void *base)); - -/* Mark nodes from the gc_add_root callback. These functions follow - pointers to mark other objects too. */ -extern void ggc_mark_tree_varray PROTO ((struct varray_head_tag *)); -extern void ggc_mark_tree_hash_table PROTO ((struct hash_table *)); -extern void ggc_mark_roots PROTO((void)); - -extern void ggc_mark_rtx_children PROTO ((struct rtx_def *)); -extern void ggc_mark_rtvec_children PROTO ((struct rtvec_def *)); -extern void ggc_mark_tree_children PROTO ((union tree_node *)); - -#define ggc_mark_rtx(EXPR) \ - do { \ - rtx r__ = (EXPR); \ - if (r__ != NULL && ! ggc_set_mark (r__)) \ - ggc_mark_rtx_children (r__); \ - } while (0) +extern const char empty_string[]; /* empty string */ +extern const char digit_vector[]; /* "0" .. "9" */ +#define digit_string(d) (digit_vector + ((d) * 2)) + +/* Internal functions and data structures used by the GTY + machinery. */ + +/* The first parameter is a pointer to a pointer, the second a cookie. */ +typedef void (*gt_pointer_operator) (void *, void *); + +#include "gtype-desc.h" + +/* One of these applies its third parameter (with cookie in the fourth + parameter) to each pointer in the object pointed to by the first + parameter, using the second parameter. */ +typedef void (*gt_note_pointers) (void *, void *, gt_pointer_operator, + void *); + +/* One of these is called before objects are re-ordered in memory. + The first parameter is the original object, the second is the + subobject that has had its pointers reordered, the third parameter + can compute the new values of a pointer when given the cookie in + the fourth parameter. */ +typedef void (*gt_handle_reorder) (void *, void *, gt_pointer_operator, + void *); + +/* Used by the gt_pch_n_* routines. Register an object in the hash table. */ +extern int gt_pch_note_object (void *, void *, gt_note_pointers); + +/* Used by the gt_pch_n_* routines. Register that an object has a reorder + function. */ +extern void gt_pch_note_reorder (void *, void *, gt_handle_reorder); + +/* Mark the object in the first parameter and anything it points to. */ +typedef void (*gt_pointer_walker) (void *); + +/* Structures for the easy way to mark roots. + In an array, terminated by having base == NULL.*/ +struct ggc_root_tab { + void *base; + size_t nelt; + size_t stride; + gt_pointer_walker cb; + gt_pointer_walker pchw; +}; +#define LAST_GGC_ROOT_TAB { NULL, 0, 0, NULL, NULL } +/* Pointers to arrays of ggc_root_tab, terminated by NULL. */ +extern const struct ggc_root_tab * const gt_ggc_rtab[]; +extern const struct ggc_root_tab * const gt_ggc_deletable_rtab[]; +extern const struct ggc_root_tab * const gt_pch_cache_rtab[]; +extern const struct ggc_root_tab * const gt_pch_scalar_rtab[]; + +/* Structure for hash table cache marking. */ +struct htab; +struct ggc_cache_tab { + struct htab * *base; + size_t nelt; + size_t stride; + gt_pointer_walker cb; + gt_pointer_walker pchw; + int (*marked_p) (const void *); +}; +#define LAST_GGC_CACHE_TAB { NULL, 0, 0, NULL, NULL, NULL } +/* Pointers to arrays of ggc_cache_tab, terminated by NULL. */ +extern const struct ggc_cache_tab * const gt_ggc_cache_rtab[]; + +/* If EXPR is not NULL and previously unmarked, mark it and evaluate + to true. Otherwise evaluate to false. */ +#define ggc_test_and_set_mark(EXPR) \ + ((EXPR) != NULL && ((void *) (EXPR)) != (void *) 1 && ! ggc_set_mark (EXPR)) -#define ggc_mark_tree(EXPR) \ +#define ggc_mark(EXPR) \ do { \ - tree t__ = (EXPR); \ - if (t__ != NULL && ! ggc_set_mark (t__)) \ - ggc_mark_tree_children (t__); \ + const void *const a__ = (EXPR); \ + if (a__ != NULL && a__ != (void *) 1) \ + ggc_set_mark (a__); \ } while (0) -#define ggc_mark_rtvec(EXPR) \ - do { \ - rtvec v__ = (EXPR); \ - if (v__ != NULL && ! ggc_set_mark (v__)) \ - ggc_mark_rtvec_children (v__); \ - } while (0) +/* Actually set the mark on a particular region of memory, but don't + follow pointers. This function is called by ggc_mark_*. It + returns zero if the object was not previously marked; nonzero if + the object was already marked, or if, for any other reason, + pointers in this data structure should not be traversed. */ +extern int ggc_set_mark (const void *); -#define ggc_mark_string(EXPR) \ - do { \ - char *s__ = (EXPR); \ - if (s__ != NULL) \ - ggc_set_mark (s__); \ - } while (0) +/* Return 1 if P has been marked, zero otherwise. + P must have been allocated by the GC allocator; it mustn't point to + static objects, stack variables, or memory allocated with malloc. */ +extern int ggc_marked_p (const void *); -#define ggc_mark(EXPR) \ - do { \ - void *a__ = (EXPR); \ - if (a__ != NULL) \ - ggc_set_mark (a__); \ - } while (0) +/* Mark the entries in the string pool. */ +extern void ggc_mark_stringpool (void); + +/* Call ggc_set_mark on all the roots. */ + +extern void ggc_mark_roots (void); + +/* Save and restore the string pool entries for PCH. */ + +extern void gt_pch_save_stringpool (void); +extern void gt_pch_fixup_stringpool (void); +extern void gt_pch_restore_stringpool (void); + +/* PCH and GGC handling for strings, mostly trivial. */ -/* Mark, but only if it was allocated in collectable memory. */ -extern void ggc_mark_if_gcable PROTO ((void *)); +extern void gt_pch_p_S (void *, void *, gt_pointer_operator, void *); +extern void gt_pch_n_S (const void *); +extern void gt_ggc_m_S (void *); -/* A GC implementation must provide these functions. */ +/* Initialize the string pool. */ +extern void init_stringpool (void); -/* Initialize the garbage collector. */ -extern void init_ggc PROTO ((void)); +/* A GC implementation must provide these functions. They are internal + to the GC system. */ + +/* Initialize the garbage collector. */ +extern void init_ggc (void); /* Start a new GGC context. Memory allocated in previous contexts will not be collected while the new context is active. */ -extern void ggc_push_context PROTO ((void)); +extern void ggc_push_context (void); /* Finish a GC context. Any uncollected memory in the new context will be merged with the old context. */ -extern void ggc_pop_context PROTO ((void)); +extern void ggc_pop_context (void); -/* Allocation. */ +struct ggc_pch_data; -/* The internal primitive. */ -void *ggc_alloc_obj PROTO ((size_t, int)); +/* Return a new ggc_pch_data structure. */ +extern struct ggc_pch_data *init_ggc_pch (void); -#define ggc_alloc_rtx(NSLOTS) \ - ((struct rtx_def *) ggc_alloc_obj (sizeof (struct rtx_def) \ - + ((NSLOTS) - 1) * sizeof (rtunion), 1)) +/* The second parameter and third parameters give the address and size + of an object. Update the ggc_pch_data structure with as much of + that information as is necessary. */ +extern void ggc_pch_count_object (struct ggc_pch_data *, void *, size_t); -#define ggc_alloc_rtvec(NELT) \ - ((struct rtvec_def *) ggc_alloc_obj (sizeof (struct rtvec_def) \ - + ((NELT) - 1) * sizeof (rtx), 1)) +/* Return the total size of the data to be written to hold all + the objects previously passed to ggc_pch_count_object. */ +extern size_t ggc_pch_total_size (struct ggc_pch_data *); -#define ggc_alloc_tree(LENGTH) \ - ((union tree_node *) ggc_alloc_obj ((LENGTH), 1)) +/* The objects, when read, will most likely be at the address + in the second parameter. */ +extern void ggc_pch_this_base (struct ggc_pch_data *, void *); -#define ggc_alloc(SIZE) ggc_alloc_obj((SIZE), 0) +/* Assuming that the objects really do end up at the address + passed to ggc_pch_this_base, return the address of this object. */ +extern char *ggc_pch_alloc_object (struct ggc_pch_data *, void *, size_t); -char *ggc_alloc_string PROTO ((const char *contents, int length)); +/* Write out any initial information required. */ +extern void ggc_pch_prepare_write (struct ggc_pch_data *, FILE *); +/* Write out this object, including any padding. */ +extern void ggc_pch_write_object (struct ggc_pch_data *, FILE *, void *, + void *, size_t); +/* All objects have been written, write out any final information + required. */ +extern void ggc_pch_finish (struct ggc_pch_data *, FILE *); -/* Invoke the collector. This is really just a hint, but in the case of - the simple collector, the only time it will happen. */ -void ggc_collect PROTO ((void)); +/* A PCH file has just been read in at the address specified second + parameter. Set up the GC implementation for the new objects. */ +extern void ggc_pch_read (FILE *, void *); -/* Actually set the mark on a particular region of memory, but don't - follow pointers. This function is called by ggc_mark_*. It - returns zero if the object was not previously marked; non-zero if - the object was already marked, or if, for any other reason, - pointers in this data structure should not be traversed. */ -int ggc_set_mark PROTO ((void *)); + +/* Allocation. */ + +/* The internal primitive. */ +extern void *ggc_alloc (size_t); +/* Like ggc_alloc, but allocates cleared memory. */ +extern void *ggc_alloc_cleared (size_t); +/* Resize a block. */ +extern void *ggc_realloc (void *, size_t); +/* Like ggc_alloc_cleared, but performs a multiplication. */ +extern void *ggc_calloc (size_t, size_t); + +#define ggc_alloc_rtx(NSLOTS) \ + ((rtx) ggc_alloc (sizeof (struct rtx_def) \ + + ((NSLOTS) - 1) * sizeof (rtunion))) -/* Callbacks to the languages. */ +#define ggc_alloc_rtvec(NELT) \ + ((rtvec) ggc_alloc (sizeof (struct rtvec_def) \ + + ((NELT) - 1) * sizeof (rtx))) + +#define ggc_alloc_tree(LENGTH) ((tree) ggc_alloc (LENGTH)) + +#define htab_create_ggc(SIZE, HASH, EQ, DEL) \ + htab_create_alloc (SIZE, HASH, EQ, DEL, ggc_calloc, NULL) -/* This is the language's opportunity to mark nodes held through - the lang_specific hooks in the tree. */ -void lang_mark_tree PROTO ((union tree_node *)); +#define splay_tree_new_ggc(COMPARE) \ + splay_tree_new_with_allocator (COMPARE, NULL, NULL, \ + &ggc_splay_alloc, &ggc_splay_dont_free, \ + NULL) +extern void *ggc_splay_alloc (int, void *); +extern void ggc_splay_dont_free (void *, void *); -/* The FALSE_LABEL_STACK, declared in except.h, has - language-dependent semantics. Each front-end should define this - function appropriately. */ -void lang_mark_false_label_stack PROTO ((struct label_node *)); +/* Allocate a gc-able string, and fill it with LENGTH bytes from CONTENTS. + If LENGTH is -1, then CONTENTS is assumed to be a + null-terminated string and the memory sized accordingly. */ +extern const char *ggc_alloc_string (const char *contents, int length); -/* Mark functions for various structs scattered about. */ +/* Make a copy of S, in GC-able memory. */ +#define ggc_strdup(S) ggc_alloc_string((S), -1) + +/* Invoke the collector. Garbage collection occurs only when this + function is called, not during allocations. */ +extern void ggc_collect (void); + +/* Return the number of bytes allocated at the indicated address. */ +extern size_t ggc_get_size (const void *); -void mark_eh_status PROTO ((struct eh_status *)); -void mark_emit_status PROTO ((struct emit_status *)); -void mark_expr_status PROTO ((struct expr_status *)); -void mark_stmt_status PROTO ((struct stmt_status *)); -void mark_varasm_status PROTO ((struct varasm_status *)); -void mark_optab PROTO ((void *)); +/* Write out all GCed objects to F. */ +extern void gt_pch_save (FILE *f); +/* Read objects previously saved with gt_pch_save from F. */ +extern void gt_pch_restore (FILE *f); + /* Statistics. */ /* This structure contains the statistics common to all collectors. Particular collectors can extend this structure. */ -typedef struct ggc_statistics +typedef struct ggc_statistics { - /* The Ith element is the number of nodes allocated with code I. */ - unsigned num_trees[256]; - /* The Ith element is the number of bytes allocated by nodes with - code I. */ - size_t size_trees[256]; - /* The Ith element is the number of nodes allocated with code I. */ - unsigned num_rtxs[256]; - /* The Ith element is the number of bytes allocated by nodes with - code I. */ - size_t size_rtxs[256]; - /* The total size of the tree nodes allocated. */ - size_t total_size_trees; - /* The total size of the RTL nodes allocated. */ - size_t total_size_rtxs; - /* The total number of tree nodes allocated. */ - unsigned total_num_trees; - /* The total number of RTL nodes allocated. */ - unsigned total_num_rtxs; + /* At present, we don't really gather any interesting statistics. */ + int unused; } ggc_statistics; -/* Return the number of bytes allocated at the indicated address. */ -size_t ggc_get_size PROTO ((void *)); - /* Used by the various collectors to gather and print statistics that do not depend on the collector in use. */ -void ggc_print_statistics PROTO ((FILE *, ggc_statistics *)); +extern void ggc_print_common_statistics (FILE *, ggc_statistics *); + +/* Print allocation statistics. */ +extern void ggc_print_statistics (void); +extern void stringpool_statistics (void); + +/* Heuristics. */ +extern int ggc_min_expand_heuristic (void); +extern int ggc_min_heapsize_heuristic (void); +extern void init_ggc_heuristics (void); + +#endif