/* String pool for GCC.
|
/* String pool for GCC.
|
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008
|
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
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
|
the terms of the GNU General Public License as published by the Free
|
Software Foundation; either version 3, or (at your option) any later
|
Software Foundation; either version 3, or (at your option) any later
|
version.
|
version.
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
for more details.
|
for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
/* String text, identifier text and identifier node allocator.
|
/* String text, identifier text and identifier node allocator.
|
Identifiers are uniquely stored in a hash table.
|
Identifiers are uniquely stored in a hash table.
|
|
|
We use cpplib's 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
|
hashtab.c is not used because it requires 100% average space
|
overhead per string, which is unacceptable. Also, this algorithm
|
overhead per string, which is unacceptable. Also, this algorithm
|
is faster. */
|
is faster. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
#include "ggc.h"
|
#include "ggc.h"
|
#include "tree.h"
|
#include "tree.h"
|
#include "symtab.h"
|
#include "symtab.h"
|
#include "cpplib.h"
|
#include "cpplib.h"
|
|
|
/* The "" allocated string. */
|
/* The "" allocated string. */
|
const char empty_string[] = "";
|
const char empty_string[] = "";
|
|
|
/* Character strings, each containing a single decimal digit.
|
/* Character strings, each containing a single decimal digit.
|
Written this way to save space. */
|
Written this way to save space. */
|
const char digit_vector[] = {
|
const char digit_vector[] = {
|
'0', 0, '1', 0, '2', 0, '3', 0, '4', 0,
|
'0', 0, '1', 0, '2', 0, '3', 0, '4', 0,
|
'5', 0, '6', 0, '7', 0, '8', 0, '9', 0
|
'5', 0, '6', 0, '7', 0, '8', 0, '9', 0
|
};
|
};
|
|
|
struct ht *ident_hash;
|
struct ht *ident_hash;
|
|
|
static hashnode alloc_node (hash_table *);
|
static hashnode alloc_node (hash_table *);
|
static int mark_ident (struct cpp_reader *, hashnode, const void *);
|
static int mark_ident (struct cpp_reader *, hashnode, const void *);
|
|
|
static void *
|
static void *
|
stringpool_ggc_alloc (size_t x)
|
stringpool_ggc_alloc (size_t x)
|
{
|
{
|
return ggc_alloc (x);
|
return ggc_alloc (x);
|
}
|
}
|
|
|
/* Initialize the string pool. */
|
/* Initialize the string pool. */
|
void
|
void
|
init_stringpool (void)
|
init_stringpool (void)
|
{
|
{
|
/* Create with 16K (2^14) entries. */
|
/* Create with 16K (2^14) entries. */
|
ident_hash = ht_create (14);
|
ident_hash = ht_create (14);
|
ident_hash->alloc_node = alloc_node;
|
ident_hash->alloc_node = alloc_node;
|
ident_hash->alloc_subobject = stringpool_ggc_alloc;
|
ident_hash->alloc_subobject = stringpool_ggc_alloc;
|
}
|
}
|
|
|
/* Allocate a hash node. */
|
/* Allocate a hash node. */
|
static hashnode
|
static hashnode
|
alloc_node (hash_table *table ATTRIBUTE_UNUSED)
|
alloc_node (hash_table *table ATTRIBUTE_UNUSED)
|
{
|
{
|
return GCC_IDENT_TO_HT_IDENT (make_node (IDENTIFIER_NODE));
|
return GCC_IDENT_TO_HT_IDENT (make_node (IDENTIFIER_NODE));
|
}
|
}
|
|
|
/* Allocate and return a string constant of length LENGTH, containing
|
/* Allocate and return a string constant of length LENGTH, containing
|
CONTENTS. If LENGTH is -1, CONTENTS is assumed to be a
|
CONTENTS. If LENGTH is -1, CONTENTS is assumed to be a
|
nul-terminated string, and the length is calculated using strlen. */
|
nul-terminated string, and the length is calculated using strlen. */
|
|
|
const char *
|
const char *
|
ggc_alloc_string (const char *contents, int length)
|
ggc_alloc_string (const char *contents, int length)
|
{
|
{
|
char *result;
|
char *result;
|
|
|
if (length == -1)
|
if (length == -1)
|
length = strlen (contents);
|
length = strlen (contents);
|
|
|
if (length == 0)
|
if (length == 0)
|
return empty_string;
|
return empty_string;
|
if (length == 1 && ISDIGIT (contents[0]))
|
if (length == 1 && ISDIGIT (contents[0]))
|
return digit_string (contents[0] - '0');
|
return digit_string (contents[0] - '0');
|
|
|
result = GGC_NEWVAR (char, length + 1);
|
result = GGC_NEWVAR (char, length + 1);
|
memcpy (result, contents, length);
|
memcpy (result, contents, length);
|
result[length] = '\0';
|
result[length] = '\0';
|
return (const char *) result;
|
return (const char *) result;
|
}
|
}
|
|
|
/* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
|
/* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
|
If an identifier with that name has previously been referred to,
|
If an identifier with that name has previously been referred to,
|
the same node is returned this time. */
|
the same node is returned this time. */
|
|
|
#undef get_identifier
|
#undef get_identifier
|
|
|
tree
|
tree
|
get_identifier (const char *text)
|
get_identifier (const char *text)
|
{
|
{
|
hashnode ht_node = ht_lookup (ident_hash,
|
hashnode ht_node = ht_lookup (ident_hash,
|
(const unsigned char *) text,
|
(const unsigned char *) text,
|
strlen (text), HT_ALLOC);
|
strlen (text), HT_ALLOC);
|
|
|
/* ht_node can't be NULL here. */
|
/* ht_node can't be NULL here. */
|
return HT_IDENT_TO_GCC_IDENT (ht_node);
|
return HT_IDENT_TO_GCC_IDENT (ht_node);
|
}
|
}
|
|
|
/* Identical to get_identifier, except that the length is assumed
|
/* Identical to get_identifier, except that the length is assumed
|
known. */
|
known. */
|
|
|
tree
|
tree
|
get_identifier_with_length (const char *text, size_t length)
|
get_identifier_with_length (const char *text, size_t length)
|
{
|
{
|
hashnode ht_node = ht_lookup (ident_hash,
|
hashnode ht_node = ht_lookup (ident_hash,
|
(const unsigned char *) text,
|
(const unsigned char *) text,
|
length, HT_ALLOC);
|
length, HT_ALLOC);
|
|
|
/* ht_node can't be NULL here. */
|
/* ht_node can't be NULL here. */
|
return HT_IDENT_TO_GCC_IDENT (ht_node);
|
return HT_IDENT_TO_GCC_IDENT (ht_node);
|
}
|
}
|
|
|
/* If an identifier with the name TEXT (a null-terminated string) has
|
/* If an identifier with the name TEXT (a null-terminated string) has
|
previously been referred to, return that node; otherwise return
|
previously been referred to, return that node; otherwise return
|
NULL_TREE. */
|
NULL_TREE. */
|
|
|
tree
|
tree
|
maybe_get_identifier (const char *text)
|
maybe_get_identifier (const char *text)
|
{
|
{
|
hashnode ht_node;
|
hashnode ht_node;
|
|
|
ht_node = ht_lookup (ident_hash, (const unsigned char *) text,
|
ht_node = ht_lookup (ident_hash, (const unsigned char *) text,
|
strlen (text), HT_NO_INSERT);
|
strlen (text), HT_NO_INSERT);
|
if (ht_node)
|
if (ht_node)
|
return HT_IDENT_TO_GCC_IDENT (ht_node);
|
return HT_IDENT_TO_GCC_IDENT (ht_node);
|
|
|
return NULL_TREE;
|
return NULL_TREE;
|
}
|
}
|
|
|
/* Report some basic statistics about the string pool. */
|
/* Report some basic statistics about the string pool. */
|
|
|
void
|
void
|
stringpool_statistics (void)
|
stringpool_statistics (void)
|
{
|
{
|
ht_dump_statistics (ident_hash);
|
ht_dump_statistics (ident_hash);
|
}
|
}
|
|
|
/* Mark an identifier for GC. */
|
/* Mark an identifier for GC. */
|
|
|
static int
|
static int
|
mark_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h,
|
mark_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h,
|
const void *v ATTRIBUTE_UNUSED)
|
const void *v ATTRIBUTE_UNUSED)
|
{
|
{
|
gt_ggc_m_9tree_node (HT_IDENT_TO_GCC_IDENT (h));
|
gt_ggc_m_9tree_node (HT_IDENT_TO_GCC_IDENT (h));
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Return true if an identifier should be removed from the table. */
|
/* Return true if an identifier should be removed from the table. */
|
|
|
static int
|
static int
|
maybe_delete_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h,
|
maybe_delete_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h,
|
const void *v ATTRIBUTE_UNUSED)
|
const void *v ATTRIBUTE_UNUSED)
|
{
|
{
|
return !ggc_marked_p (HT_IDENT_TO_GCC_IDENT (h));
|
return !ggc_marked_p (HT_IDENT_TO_GCC_IDENT (h));
|
}
|
}
|
|
|
/* Mark the trees hanging off the identifier node for GGC. These are
|
/* Mark the trees hanging off the identifier node for GGC. These are
|
handled specially (not using gengtype) because identifiers are only
|
handled specially (not using gengtype) because identifiers are only
|
roots during one part of compilation. */
|
roots during one part of compilation. */
|
|
|
void
|
void
|
ggc_mark_stringpool (void)
|
ggc_mark_stringpool (void)
|
{
|
{
|
ht_forall (ident_hash, mark_ident, NULL);
|
ht_forall (ident_hash, mark_ident, NULL);
|
}
|
}
|
|
|
/* Purge the identifier hash of identifiers which are no longer
|
/* Purge the identifier hash of identifiers which are no longer
|
referenced. */
|
referenced. */
|
|
|
void
|
void
|
ggc_purge_stringpool (void)
|
ggc_purge_stringpool (void)
|
{
|
{
|
ht_purge (ident_hash, maybe_delete_ident, NULL);
|
ht_purge (ident_hash, maybe_delete_ident, NULL);
|
}
|
}
|
|
|
/* Pointer-walking routine for strings (not very interesting, since
|
/* Pointer-walking routine for strings (not very interesting, since
|
strings don't contain pointers). */
|
strings don't contain pointers). */
|
|
|
void
|
void
|
gt_pch_p_S (void *obj ATTRIBUTE_UNUSED, void *x ATTRIBUTE_UNUSED,
|
gt_pch_p_S (void *obj ATTRIBUTE_UNUSED, void *x ATTRIBUTE_UNUSED,
|
gt_pointer_operator op ATTRIBUTE_UNUSED,
|
gt_pointer_operator op ATTRIBUTE_UNUSED,
|
void *cookie ATTRIBUTE_UNUSED)
|
void *cookie ATTRIBUTE_UNUSED)
|
{
|
{
|
}
|
}
|
|
|
/* PCH pointer-walking routine for strings. */
|
/* PCH pointer-walking routine for strings. */
|
|
|
void
|
void
|
gt_pch_n_S (const void *x)
|
gt_pch_n_S (const void *x)
|
{
|
{
|
gt_pch_note_object (CONST_CAST (void *, x), CONST_CAST (void *, x),
|
gt_pch_note_object (CONST_CAST (void *, x), CONST_CAST (void *, x),
|
>_pch_p_S, gt_types_enum_last);
|
>_pch_p_S, gt_types_enum_last);
|
}
|
}
|
|
|
/* Handle saving and restoring the string pool for PCH. */
|
/* Handle saving and restoring the string pool for PCH. */
|
|
|
/* SPD is saved in the PCH file and holds the information needed
|
/* SPD is saved in the PCH file and holds the information needed
|
to restore the string pool. */
|
to restore the string pool. */
|
|
|
struct GTY(()) string_pool_data {
|
struct GTY(()) string_pool_data {
|
struct ht_identifier * *
|
struct ht_identifier * *
|
GTY((length ("%h.nslots"),
|
GTY((length ("%h.nslots"),
|
nested_ptr (union tree_node, "%h ? GCC_IDENT_TO_HT_IDENT (%h) : NULL",
|
nested_ptr (union tree_node, "%h ? GCC_IDENT_TO_HT_IDENT (%h) : NULL",
|
"%h ? HT_IDENT_TO_GCC_IDENT (%h) : NULL")))
|
"%h ? HT_IDENT_TO_GCC_IDENT (%h) : NULL")))
|
entries;
|
entries;
|
unsigned int nslots;
|
unsigned int nslots;
|
unsigned int nelements;
|
unsigned int nelements;
|
};
|
};
|
|
|
static GTY(()) struct string_pool_data * spd;
|
static GTY(()) struct string_pool_data * spd;
|
|
|
/* Save the stringpool data in SPD. */
|
/* Save the stringpool data in SPD. */
|
|
|
void
|
void
|
gt_pch_save_stringpool (void)
|
gt_pch_save_stringpool (void)
|
{
|
{
|
spd = GGC_NEW (struct string_pool_data);
|
spd = GGC_NEW (struct string_pool_data);
|
spd->nslots = ident_hash->nslots;
|
spd->nslots = ident_hash->nslots;
|
spd->nelements = ident_hash->nelements;
|
spd->nelements = ident_hash->nelements;
|
spd->entries = GGC_NEWVEC (struct ht_identifier *, spd->nslots);
|
spd->entries = GGC_NEWVEC (struct ht_identifier *, spd->nslots);
|
memcpy (spd->entries, ident_hash->entries,
|
memcpy (spd->entries, ident_hash->entries,
|
spd->nslots * sizeof (spd->entries[0]));
|
spd->nslots * sizeof (spd->entries[0]));
|
}
|
}
|
|
|
/* Return the stringpool to its state before gt_pch_save_stringpool
|
/* Return the stringpool to its state before gt_pch_save_stringpool
|
was called. */
|
was called. */
|
|
|
void
|
void
|
gt_pch_fixup_stringpool (void)
|
gt_pch_fixup_stringpool (void)
|
{
|
{
|
}
|
}
|
|
|
/* A PCH file has been restored, which loaded SPD; fill the real hash table
|
/* A PCH file has been restored, which loaded SPD; fill the real hash table
|
from SPD. */
|
from SPD. */
|
|
|
void
|
void
|
gt_pch_restore_stringpool (void)
|
gt_pch_restore_stringpool (void)
|
{
|
{
|
ht_load (ident_hash, spd->entries, spd->nslots, spd->nelements, false);
|
ht_load (ident_hash, spd->entries, spd->nslots, spd->nelements, false);
|
spd = NULL;
|
spd = NULL;
|
}
|
}
|
|
|
#include "gt-stringpool.h"
|
#include "gt-stringpool.h"
|
|
|
