1 /* String pool for GCC. 2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010 3 Free Software Foundation, Inc. 4 5 This file is part of GCC. 6 7 GCC is free software; you can redistribute it and/or modify it under 8 the terms of the GNU General Public License as published by the Free 9 Software Foundation; either version 3, or (at your option) any later 10 version. 11 12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY 13 WARRANTY; without even the implied warranty of MERCHANTABILITY or 14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 for more details. 16 17 You should have received a copy of the GNU General Public License 18 along with GCC; see the file COPYING3. If not see 19 <http://www.gnu.org/licenses/>. */ 20 21 /* String text, identifier text and identifier node allocator. 22 Identifiers are uniquely stored in a hash table. 23 24 We use cpplib's hash table implementation. libiberty's 25 hashtab.c is not used because it requires 100% average space 26 overhead per string, which is unacceptable. Also, this algorithm 27 is faster. */ 28 29 #include "config.h" 30 #include "system.h" 31 #include "coretypes.h" 32 #include "ggc.h" 33 #include "ggc-internal.h" 34 #include "tree.h" 35 #include "symtab.h" 36 #include "cpplib.h" 37 38 /* The "" allocated string. */ 39 const char empty_string[] = ""; 40 41 /* Character strings, each containing a single decimal digit. 42 Written this way to save space. */ 43 static const char digit_vector[] = { 44 '0', 0, '1', 0, '2', 0, '3', 0, '4', 0, 45 '5', 0, '6', 0, '7', 0, '8', 0, '9', 0 46 }; 47 48 #define digit_string(d) (digit_vector + ((d) * 2)) 49 50 struct ht *ident_hash; 51 52 static hashnode alloc_node (hash_table *); 53 static int mark_ident (struct cpp_reader *, hashnode, const void *); 54 55 static void * 56 stringpool_ggc_alloc (size_t x) 57 { 58 return ggc_alloc_atomic (x); 59 } 60 61 /* Initialize the string pool. */ 62 void 63 init_stringpool (void) 64 { 65 /* Create with 16K (2^14) entries. */ 66 ident_hash = ht_create (14); 67 ident_hash->alloc_node = alloc_node; 68 ident_hash->alloc_subobject = stringpool_ggc_alloc; 69 } 70 71 /* Allocate a hash node. */ 72 static hashnode 73 alloc_node (hash_table *table ATTRIBUTE_UNUSED) 74 { 75 return GCC_IDENT_TO_HT_IDENT (make_node (IDENTIFIER_NODE)); 76 } 77 78 /* Allocate and return a string constant of length LENGTH, containing 79 CONTENTS. If LENGTH is -1, CONTENTS is assumed to be a 80 nul-terminated string, and the length is calculated using strlen. */ 81 82 const char * 83 ggc_alloc_string_stat (const char *contents, int length MEM_STAT_DECL) 84 { 85 char *result; 86 87 if (length == -1) 88 length = strlen (contents); 89 90 if (length == 0) 91 return empty_string; 92 if (length == 1 && ISDIGIT (contents[0])) 93 return digit_string (contents[0] - '0'); 94 95 result = (char *) ggc_alloc_atomic_stat (length + 1 PASS_MEM_STAT); 96 memcpy (result, contents, length); 97 result[length] = '\0'; 98 return (const char *) result; 99 } 100 101 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string). 102 If an identifier with that name has previously been referred to, 103 the same node is returned this time. */ 104 105 #undef get_identifier 106 107 tree 108 get_identifier (const char *text) 109 { 110 hashnode ht_node = ht_lookup (ident_hash, 111 (const unsigned char *) text, 112 strlen (text), HT_ALLOC); 113 114 /* ht_node can't be NULL here. */ 115 return HT_IDENT_TO_GCC_IDENT (ht_node); 116 } 117 118 /* Identical to get_identifier, except that the length is assumed 119 known. */ 120 121 tree 122 get_identifier_with_length (const char *text, size_t length) 123 { 124 hashnode ht_node = ht_lookup (ident_hash, 125 (const unsigned char *) text, 126 length, HT_ALLOC); 127 128 /* ht_node can't be NULL here. */ 129 return HT_IDENT_TO_GCC_IDENT (ht_node); 130 } 131 132 /* If an identifier with the name TEXT (a null-terminated string) has 133 previously been referred to, return that node; otherwise return 134 NULL_TREE. */ 135 136 tree 137 maybe_get_identifier (const char *text) 138 { 139 hashnode ht_node; 140 141 ht_node = ht_lookup (ident_hash, (const unsigned char *) text, 142 strlen (text), HT_NO_INSERT); 143 if (ht_node) 144 return HT_IDENT_TO_GCC_IDENT (ht_node); 145 146 return NULL_TREE; 147 } 148 149 /* Report some basic statistics about the string pool. */ 150 151 void 152 stringpool_statistics (void) 153 { 154 ht_dump_statistics (ident_hash); 155 } 156 157 /* Mark an identifier for GC. */ 158 159 static int 160 mark_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h, 161 const void *v ATTRIBUTE_UNUSED) 162 { 163 gt_ggc_m_9tree_node (HT_IDENT_TO_GCC_IDENT (h)); 164 return 1; 165 } 166 167 /* Return true if an identifier should be removed from the table. */ 168 169 static int 170 maybe_delete_ident (struct cpp_reader *pfile ATTRIBUTE_UNUSED, hashnode h, 171 const void *v ATTRIBUTE_UNUSED) 172 { 173 return !ggc_marked_p (HT_IDENT_TO_GCC_IDENT (h)); 174 } 175 176 /* Mark the trees hanging off the identifier node for GGC. These are 177 handled specially (not using gengtype) because identifiers are only 178 roots during one part of compilation. */ 179 180 void 181 ggc_mark_stringpool (void) 182 { 183 ht_forall (ident_hash, mark_ident, NULL); 184 } 185 186 /* Purge the identifier hash of identifiers which are no longer 187 referenced. */ 188 189 void 190 ggc_purge_stringpool (void) 191 { 192 ht_purge (ident_hash, maybe_delete_ident, NULL); 193 } 194 195 /* Pointer-walking routine for strings (not very interesting, since 196 strings don't contain pointers). */ 197 198 void 199 gt_pch_p_S (void *obj ATTRIBUTE_UNUSED, void *x ATTRIBUTE_UNUSED, 200 gt_pointer_operator op ATTRIBUTE_UNUSED, 201 void *cookie ATTRIBUTE_UNUSED) 202 { 203 } 204 205 /* PCH pointer-walking routine for strings. */ 206 207 void 208 gt_pch_n_S (const void *x) 209 { 210 gt_pch_note_object (CONST_CAST (void *, x), CONST_CAST (void *, x), 211 >_pch_p_S, gt_types_enum_last); 212 } 213 214 /* Handle saving and restoring the string pool for PCH. */ 215 216 /* SPD is saved in the PCH file and holds the information needed 217 to restore the string pool. */ 218 219 struct GTY(()) string_pool_data { 220 ht_identifier_ptr * 221 GTY((length ("%h.nslots"), 222 nested_ptr (union tree_node, "%h ? GCC_IDENT_TO_HT_IDENT (%h) : NULL", 223 "%h ? HT_IDENT_TO_GCC_IDENT (%h) : NULL"))) 224 entries; 225 unsigned int nslots; 226 unsigned int nelements; 227 }; 228 229 static GTY(()) struct string_pool_data * spd; 230 231 /* Save the stringpool data in SPD. */ 232 233 void 234 gt_pch_save_stringpool (void) 235 { 236 spd = ggc_alloc_string_pool_data (); 237 spd->nslots = ident_hash->nslots; 238 spd->nelements = ident_hash->nelements; 239 spd->entries = ggc_alloc_vec_ht_identifier_ptr (spd->nslots); 240 memcpy (spd->entries, ident_hash->entries, 241 spd->nslots * sizeof (spd->entries[0])); 242 } 243 244 /* Return the stringpool to its state before gt_pch_save_stringpool 245 was called. */ 246 247 void 248 gt_pch_fixup_stringpool (void) 249 { 250 } 251 252 /* A PCH file has been restored, which loaded SPD; fill the real hash table 253 from SPD. */ 254 255 void 256 gt_pch_restore_stringpool (void) 257 { 258 ht_load (ident_hash, spd->entries, spd->nslots, spd->nelements, false); 259 spd = NULL; 260 } 261 262 #include "gt-stringpool.h" 263