X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fstringpool.c;h=747db177b2abcf1b76aa49ee9e6187952ea4cc62;hb=6620d7d7c5f2fe5df0df2b85e143746f76fdd4cf;hp=0cf3be14f88034537f6ed533853d7bff54607e57;hpb=69642df267469dbe186cff7d3caf5f0df8a4d4fa;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/stringpool.c b/gcc/stringpool.c index 0cf3be14f88..747db177b2a 100644 --- a/gcc/stringpool.c +++ b/gcc/stringpool.c @@ -1,11 +1,12 @@ /* String pool for GCC. - Copyright (C) 2000, 2001, 2002, 2003 Free Software Foundation, Inc. + Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010 + Free Software Foundation, Inc. This file is part of GCC. 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 +Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY @@ -14,15 +15,13 @@ 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 GCC; see the file COPYING. If not, write to the Free -Software Foundation, 59 Temple Place - Suite 330, Boston, MA -02111-1307, USA. */ +along with GCC; see the file COPYING3. If not see +. */ -/* String text, identifier text and identifier node allocator. Strings - allocated by ggc_alloc_string are stored in an obstack which is - never shrunk. Identifiers are uniquely stored in a hash table. +/* String text, identifier text and identifier node allocator. + Identifiers are uniquely stored in a hash table. - We have our own private hash table implementation. libiberty's + We use cpplib's hash table implementation. libiberty's hashtab.c is not used because it requires 100% average space overhead per string, which is unacceptable. Also, this algorithm is faster. */ @@ -30,10 +29,10 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA #include "config.h" #include "system.h" #include "coretypes.h" -#include "tm.h" #include "ggc.h" +#include "ggc-internal.h" #include "tree.h" -#include "hashtable.h" +#include "symtab.h" #include "cpplib.h" /* The "" allocated string. */ @@ -41,17 +40,23 @@ const char empty_string[] = ""; /* Character strings, each containing a single decimal digit. Written this way to save space. */ -const char digit_vector[] = { +static const char digit_vector[] = { '0', 0, '1', 0, '2', 0, '3', 0, '4', 0, '5', 0, '6', 0, '7', 0, '8', 0, '9', 0 }; +#define digit_string(d) (digit_vector + ((d) * 2)) + struct ht *ident_hash; -static struct obstack string_stack; static hashnode alloc_node (hash_table *); static int mark_ident (struct cpp_reader *, hashnode, const void *); -static int ht_copy_and_clear (struct cpp_reader *, hashnode, const void *); + +static void * +stringpool_ggc_alloc (size_t x) +{ + return ggc_alloc_atomic (x); +} /* Initialize the string pool. */ void @@ -60,7 +65,7 @@ init_stringpool (void) /* Create with 16K (2^14) entries. */ ident_hash = ht_create (14); ident_hash->alloc_node = alloc_node; - gcc_obstack_init (&string_stack); + ident_hash->alloc_subobject = stringpool_ggc_alloc; } /* Allocate a hash node. */ @@ -72,13 +77,13 @@ alloc_node (hash_table *table ATTRIBUTE_UNUSED) /* Allocate and return a string constant of length LENGTH, containing CONTENTS. If LENGTH is -1, CONTENTS is assumed to be a - nul-terminated string, and the length is calculated using strlen. - If the same string constant has been allocated before, that copy is - returned this time too. */ + nul-terminated string, and the length is calculated using strlen. */ const char * -ggc_alloc_string (const char *contents, int length) +ggc_alloc_string_stat (const char *contents, int length MEM_STAT_DECL) { + char *result; + if (length == -1) length = strlen (contents); @@ -87,8 +92,10 @@ ggc_alloc_string (const char *contents, int length) if (length == 1 && ISDIGIT (contents[0])) return digit_string (contents[0] - '0'); - obstack_grow0 (&string_stack, contents, length); - return obstack_finish (&string_stack); + result = (char *) ggc_alloc_atomic_stat (length + 1 PASS_MEM_STAT); + memcpy (result, contents, length); + result[length] = '\0'; + return (const char *) result; } /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string). @@ -146,7 +153,7 @@ stringpool_statistics (void) { ht_dump_statistics (ident_hash); } - + /* Mark an identifier for GC. */ static int @@ -157,9 +164,18 @@ mark_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h, return 1; } +/* Return true if an identifier should be removed from the table. */ + +static int +maybe_delete_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h, + const void *v ATTRIBUTE_UNUSED) +{ + return !ggc_marked_p (HT_IDENT_TO_GCC_IDENT (h)); +} + /* Mark the trees hanging off the identifier node for GGC. These are - handled specially (not using gengtype) because of the special - treatment for strings. */ + handled specially (not using gengtype) because identifiers are only + roots during one part of compilation. */ void ggc_mark_stringpool (void) @@ -167,13 +183,13 @@ ggc_mark_stringpool (void) ht_forall (ident_hash, mark_ident, NULL); } -/* Strings are _not_ GCed, but this routine exists so that a separate - roots table isn't needed for the few global variables that refer - to strings. */ +/* Purge the identifier hash of identifiers which are no longer + referenced. */ void -gt_ggc_m_S (void *x ATTRIBUTE_UNUSED) +ggc_purge_stringpool (void) { + ht_purge (ident_hash, maybe_delete_ident, NULL); } /* Pointer-walking routine for strings (not very interesting, since @@ -191,87 +207,55 @@ gt_pch_p_S (void *obj ATTRIBUTE_UNUSED, void *x ATTRIBUTE_UNUSED, void gt_pch_n_S (const void *x) { - gt_pch_note_object ((void *)x, (void *)x, >_pch_p_S); + gt_pch_note_object (CONST_CAST (void *, x), CONST_CAST (void *, x), + >_pch_p_S, gt_types_enum_last); } - + /* Handle saving and restoring the string pool for PCH. */ -struct string_pool_data GTY(()) -{ - tree * GTY((length ("%h.nslots"))) entries; +/* SPD is saved in the PCH file and holds the information needed + to restore the string pool. */ + +struct GTY(()) string_pool_data { + ht_identifier_ptr * + GTY((length ("%h.nslots"), + nested_ptr (union tree_node, "%h ? GCC_IDENT_TO_HT_IDENT (%h) : NULL", + "%h ? HT_IDENT_TO_GCC_IDENT (%h) : NULL"))) + entries; unsigned int nslots; unsigned int nelements; }; static GTY(()) struct string_pool_data * spd; -static int -ht_copy_and_clear (cpp_reader *r ATTRIBUTE_UNUSED, hashnode hp, const void *ht2_p) -{ - cpp_hashnode *h = CPP_HASHNODE (hp); - struct ht *ht2 = (struct ht *) ht2_p; - - if (h->type != NT_VOID - && (h->flags & NODE_BUILTIN) == 0) - { - cpp_hashnode *h2 = CPP_HASHNODE (ht_lookup (ht2, - NODE_NAME (h), - NODE_LEN (h), - HT_ALLOC)); - h2->type = h->type; - memcpy (&h2->value, &h->value, sizeof (h->value)); - - h->type = NT_VOID; - memset (&h->value, 0, sizeof (h->value)); - } - return 1; -} - -static struct ht *saved_ident_hash; +/* Save the stringpool data in SPD. */ void gt_pch_save_stringpool (void) { - unsigned int i; - - spd = ggc_alloc (sizeof (*spd)); + spd = ggc_alloc_string_pool_data (); spd->nslots = ident_hash->nslots; spd->nelements = ident_hash->nelements; - spd->entries = ggc_alloc (sizeof (tree *) * spd->nslots); - for (i = 0; i < spd->nslots; i++) - if (ident_hash->entries[i] != NULL) - spd->entries[i] = HT_IDENT_TO_GCC_IDENT (ident_hash->entries[i]); - else - spd->entries[i] = NULL; - - saved_ident_hash = ht_create (14); - saved_ident_hash->alloc_node = alloc_node; - ht_forall (ident_hash, ht_copy_and_clear, saved_ident_hash); + spd->entries = ggc_alloc_vec_ht_identifier_ptr (spd->nslots); + memcpy (spd->entries, ident_hash->entries, + spd->nslots * sizeof (spd->entries[0])); } +/* Return the stringpool to its state before gt_pch_save_stringpool + was called. */ + void gt_pch_fixup_stringpool (void) { - ht_forall (saved_ident_hash, ht_copy_and_clear, ident_hash); - ht_destroy (saved_ident_hash); - saved_ident_hash = 0; } +/* A PCH file has been restored, which loaded SPD; fill the real hash table + from SPD. */ + void gt_pch_restore_stringpool (void) { - unsigned int i; - - ident_hash->nslots = spd->nslots; - ident_hash->nelements = spd->nelements; - ident_hash->entries = xrealloc (ident_hash->entries, - sizeof (hashnode) * spd->nslots); - for (i = 0; i < spd->nslots; i++) - if (spd->entries[i] != NULL) - ident_hash->entries[i] = GCC_IDENT_TO_HT_IDENT (spd->entries[i]); - else - ident_hash->entries[i] = NULL; - + ht_load (ident_hash, spd->entries, spd->nslots, spd->nelements, false); spd = NULL; }