src/share/vm/classfile/symbolTable.hpp

Wed, 04 Jul 2012 15:55:45 -0400

author
coleenp
date
Wed, 04 Jul 2012 15:55:45 -0400
changeset 3904
ace99a6ffc83
parent 3900
d2a62e0f25eb
child 3969
1d7922586cf6
permissions
-rw-r--r--

7181200: JVM new hashing code breaks SA in product mode
Summary: Made new_hash() overloaded rather than a virtual function so SA code doesn't need to be changed.
Reviewed-by: kvn, acorn, dholmes, fparain

duke@435 1 /*
coleenp@3682 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #ifndef SHARE_VM_CLASSFILE_SYMBOLTABLE_HPP
stefank@2314 26 #define SHARE_VM_CLASSFILE_SYMBOLTABLE_HPP
stefank@2314 27
stefank@2314 28 #include "memory/allocation.inline.hpp"
coleenp@2497 29 #include "oops/symbol.hpp"
stefank@2314 30 #include "utilities/hashtable.hpp"
stefank@2314 31
coleenp@2497 32 // The symbol table holds all Symbol*s and corresponding interned strings.
coleenp@2497 33 // Symbol*s and literal strings should be canonicalized.
duke@435 34 //
duke@435 35 // The interned strings are created lazily.
duke@435 36 //
duke@435 37 // It is implemented as an open hash table with a fixed number of buckets.
duke@435 38 //
duke@435 39 // %note:
duke@435 40 // - symbolTableEntrys are allocated in blocks to reduce the space overhead.
duke@435 41
duke@435 42 class BoolObjectClosure;
coleenp@3865 43 class outputStream;
duke@435 44
duke@435 45
coleenp@2497 46 // Class to hold a newly created or referenced Symbol* temporarily in scope.
coleenp@2497 47 // new_symbol() and lookup() will create a Symbol* if not already in the
coleenp@2497 48 // symbol table and add to the symbol's reference count.
coleenp@2497 49 // probe() and lookup_only() will increment the refcount if symbol is found.
coleenp@2497 50 class TempNewSymbol : public StackObj {
coleenp@2497 51 Symbol* _temp;
coleenp@2497 52
coleenp@2497 53 public:
coleenp@2497 54 TempNewSymbol() : _temp(NULL) {}
coleenp@2497 55 // Creating or looking up a symbol increments the symbol's reference count
coleenp@2497 56 TempNewSymbol(Symbol *s) : _temp(s) {}
coleenp@2497 57
coleenp@2497 58 // Operator= increments reference count.
coleenp@2497 59 void operator=(const TempNewSymbol &s) {
coleenp@2497 60 _temp = s._temp;
coleenp@2497 61 if (_temp !=NULL) _temp->increment_refcount();
coleenp@2497 62 }
coleenp@2497 63
coleenp@2497 64 // Decrement reference counter so it can go away if it's unique
coleenp@2497 65 ~TempNewSymbol() { if (_temp != NULL) _temp->decrement_refcount(); }
coleenp@2497 66
coleenp@2497 67 // Operators so they can be used like Symbols
coleenp@2497 68 Symbol* operator -> () const { return _temp; }
coleenp@2497 69 bool operator == (Symbol* o) const { return _temp == o; }
coleenp@2497 70 // Sneaky conversion function
coleenp@2497 71 operator Symbol*() { return _temp; }
coleenp@2497 72 };
coleenp@2497 73
zgu@3900 74 class SymbolTable : public Hashtable<Symbol*, mtSymbol> {
duke@435 75 friend class VMStructs;
coleenp@2497 76 friend class ClassFileParser;
duke@435 77
duke@435 78 private:
duke@435 79 // The symbol table
duke@435 80 static SymbolTable* _the_table;
duke@435 81
coleenp@3865 82 // Set if one bucket is out of balance due to hash algorithm deficiency
coleenp@3865 83 static bool _needs_rehashing;
coleenp@3865 84
coleenp@2497 85 // For statistics
coleenp@2497 86 static int symbols_removed;
coleenp@2497 87 static int symbols_counted;
coleenp@2497 88
coleenp@3682 89 Symbol* allocate_symbol(const u1* name, int len, bool c_heap, TRAPS); // Assumes no characters larger than 0x7F
coleenp@2497 90
duke@435 91 // Adding elements
coleenp@3682 92 Symbol* basic_add(int index, u1* name, int len, unsigned int hashValue,
coleenp@3682 93 bool c_heap, TRAPS);
coleenp@3682 94
coleenp@3682 95 bool basic_add(Handle class_loader, constantPoolHandle cp, int names_count,
duke@435 96 const char** names, int* lengths, int* cp_indices,
duke@435 97 unsigned int* hashValues, TRAPS);
duke@435 98
coleenp@3682 99 static void new_symbols(Handle class_loader, constantPoolHandle cp,
coleenp@3682 100 int names_count,
coleenp@2497 101 const char** name, int* lengths,
coleenp@2497 102 int* cp_indices, unsigned int* hashValues,
coleenp@2497 103 TRAPS) {
coleenp@3682 104 add(class_loader, cp, names_count, name, lengths, cp_indices, hashValues, THREAD);
coleenp@2497 105 }
coleenp@2497 106
duke@435 107 // Table size
duke@435 108 enum {
duke@435 109 symbol_table_size = 20011
duke@435 110 };
duke@435 111
coleenp@2497 112 Symbol* lookup(int index, const char* name, int len, unsigned int hash);
duke@435 113
duke@435 114 SymbolTable()
zgu@3900 115 : Hashtable<Symbol*, mtSymbol>(symbol_table_size, sizeof (HashtableEntry<Symbol*, mtSymbol>)) {}
duke@435 116
zgu@3900 117 SymbolTable(HashtableBucket<mtSymbol>* t, int number_of_entries)
zgu@3900 118 : Hashtable<Symbol*, mtSymbol>(symbol_table_size, sizeof (HashtableEntry<Symbol*, mtSymbol>), t,
duke@435 119 number_of_entries) {}
duke@435 120
coleenp@3682 121 // Arena for permanent symbols (null class loader) that are never unloaded
coleenp@3682 122 static Arena* _arena;
coleenp@3682 123 static Arena* arena() { return _arena; } // called for statistics
duke@435 124
coleenp@3682 125 static void initialize_symbols(int arena_alloc_size = 0);
duke@435 126 public:
duke@435 127 enum {
coleenp@3682 128 symbol_alloc_batch_size = 8,
coleenp@3682 129 // Pick initial size based on java -version size measurements
coleenp@3682 130 symbol_alloc_arena_size = 360*K
duke@435 131 };
duke@435 132
duke@435 133 // The symbol table
duke@435 134 static SymbolTable* the_table() { return _the_table; }
duke@435 135
duke@435 136 static void create_table() {
duke@435 137 assert(_the_table == NULL, "One symbol table allowed.");
duke@435 138 _the_table = new SymbolTable();
coleenp@3682 139 initialize_symbols(symbol_alloc_arena_size);
duke@435 140 }
duke@435 141
zgu@3900 142 static void create_table(HashtableBucket<mtSymbol>* t, int length,
duke@435 143 int number_of_entries) {
duke@435 144 assert(_the_table == NULL, "One symbol table allowed.");
zgu@3900 145 assert(length == symbol_table_size * sizeof(HashtableBucket<mtSymbol>),
duke@435 146 "bad shared symbol size.");
duke@435 147 _the_table = new SymbolTable(t, number_of_entries);
coleenp@3682 148 // if CDS give symbol table a default arena size since most symbols
coleenp@3682 149 // are already allocated in the shared misc section.
coleenp@3682 150 initialize_symbols();
duke@435 151 }
duke@435 152
coleenp@3875 153 static unsigned int hash_symbol(const char* s, int len);
coleenp@3865 154
coleenp@2497 155 static Symbol* lookup(const char* name, int len, TRAPS);
duke@435 156 // lookup only, won't add. Also calculate hash.
coleenp@2497 157 static Symbol* lookup_only(const char* name, int len, unsigned int& hash);
duke@435 158 // Only copy to C string to be added if lookup failed.
coleenp@2497 159 static Symbol* lookup(const Symbol* sym, int begin, int end, TRAPS);
coleenp@2497 160
coleenp@2497 161 static void release(Symbol* sym);
duke@435 162
phh@3427 163 // Look up the address of the literal in the SymbolTable for this Symbol*
phh@3427 164 static Symbol** lookup_symbol_addr(Symbol* sym);
phh@3427 165
jrose@1100 166 // jchar (utf16) version of lookups
coleenp@2497 167 static Symbol* lookup_unicode(const jchar* name, int len, TRAPS);
coleenp@2497 168 static Symbol* lookup_only_unicode(const jchar* name, int len, unsigned int& hash);
jrose@1100 169
coleenp@3682 170 static void add(Handle class_loader, constantPoolHandle cp, int names_count,
duke@435 171 const char** names, int* lengths, int* cp_indices,
duke@435 172 unsigned int* hashValues, TRAPS);
duke@435 173
coleenp@2497 174 // Release any dead symbols
coleenp@2497 175 static void unlink();
coleenp@2497 176
coleenp@2497 177 // iterate over symbols
coleenp@2497 178 static void symbols_do(SymbolClosure *cl);
coleenp@2497 179
coleenp@2497 180 // Symbol creation
coleenp@2497 181 static Symbol* new_symbol(const char* utf8_buffer, int length, TRAPS) {
coleenp@2497 182 assert(utf8_buffer != NULL, "just checking");
coleenp@2497 183 return lookup(utf8_buffer, length, THREAD);
duke@435 184 }
coleenp@2497 185 static Symbol* new_symbol(const char* name, TRAPS) {
coleenp@2497 186 return new_symbol(name, (int)strlen(name), THREAD);
coleenp@2497 187 }
coleenp@2497 188 static Symbol* new_symbol(const Symbol* sym, int begin, int end, TRAPS) {
coleenp@2497 189 assert(begin <= end && end <= sym->utf8_length(), "just checking");
coleenp@2497 190 return lookup(sym, begin, end, THREAD);
duke@435 191 }
duke@435 192
coleenp@3682 193 // Create a symbol in the arena for symbols that are not deleted
coleenp@3682 194 static Symbol* new_permanent_symbol(const char* name, TRAPS);
coleenp@3682 195
duke@435 196 // Symbol lookup
coleenp@2497 197 static Symbol* lookup(int index, const char* name, int len, TRAPS);
duke@435 198
duke@435 199 // Needed for preloading classes in signatures when compiling.
duke@435 200 // Returns the symbol is already present in symbol table, otherwise
duke@435 201 // NULL. NO ALLOCATION IS GUARANTEED!
coleenp@2497 202 static Symbol* probe(const char* name, int len) {
jrose@1100 203 unsigned int ignore_hash;
jrose@1100 204 return lookup_only(name, len, ignore_hash);
jrose@1100 205 }
coleenp@2497 206 static Symbol* probe_unicode(const jchar* name, int len) {
jrose@1100 207 unsigned int ignore_hash;
jrose@1100 208 return lookup_only_unicode(name, len, ignore_hash);
jrose@1100 209 }
duke@435 210
duke@435 211 // Histogram
duke@435 212 static void print_histogram() PRODUCT_RETURN;
coleenp@2497 213 static void print() PRODUCT_RETURN;
duke@435 214
duke@435 215 // Debugging
duke@435 216 static void verify();
coleenp@3865 217 static void dump(outputStream* st);
duke@435 218
duke@435 219 // Sharing
duke@435 220 static void copy_buckets(char** top, char*end) {
zgu@3900 221 the_table()->Hashtable<Symbol*, mtSymbol>::copy_buckets(top, end);
duke@435 222 }
duke@435 223 static void copy_table(char** top, char*end) {
zgu@3900 224 the_table()->Hashtable<Symbol*, mtSymbol>::copy_table(top, end);
duke@435 225 }
duke@435 226 static void reverse(void* boundary = NULL) {
zgu@3900 227 the_table()->Hashtable<Symbol*, mtSymbol>::reverse(boundary);
duke@435 228 }
coleenp@3865 229
coleenp@3865 230 // Rehash the symbol table if it gets out of balance
coleenp@3865 231 static void rehash_table();
coleenp@3865 232 static bool needs_rehashing() { return _needs_rehashing; }
duke@435 233 };
duke@435 234
zgu@3900 235 class StringTable : public Hashtable<oop, mtSymbol> {
duke@435 236 friend class VMStructs;
duke@435 237
duke@435 238 private:
duke@435 239 // The string table
duke@435 240 static StringTable* _the_table;
duke@435 241
coleenp@3865 242 // Set if one bucket is out of balance due to hash algorithm deficiency
coleenp@3865 243 static bool _needs_rehashing;
coleenp@3865 244
duke@435 245 static oop intern(Handle string_or_null, jchar* chars, int length, TRAPS);
duke@435 246 oop basic_add(int index, Handle string_or_null, jchar* name, int len,
duke@435 247 unsigned int hashValue, TRAPS);
duke@435 248
duke@435 249 oop lookup(int index, jchar* chars, int length, unsigned int hashValue);
duke@435 250
zgu@3900 251 StringTable() : Hashtable<oop, mtSymbol>((int)StringTableSize,
zgu@3900 252 sizeof (HashtableEntry<oop, mtSymbol>)) {}
duke@435 253
zgu@3900 254 StringTable(HashtableBucket<mtSymbol>* t, int number_of_entries)
zgu@3900 255 : Hashtable<oop, mtSymbol>((int)StringTableSize, sizeof (HashtableEntry<oop, mtSymbol>), t,
jcoomes@2660 256 number_of_entries) {}
duke@435 257 public:
duke@435 258 // The string table
duke@435 259 static StringTable* the_table() { return _the_table; }
duke@435 260
duke@435 261 static void create_table() {
duke@435 262 assert(_the_table == NULL, "One string table allowed.");
duke@435 263 _the_table = new StringTable();
duke@435 264 }
duke@435 265
zgu@3900 266 static void create_table(HashtableBucket<mtSymbol>* t, int length,
duke@435 267 int number_of_entries) {
duke@435 268 assert(_the_table == NULL, "One string table allowed.");
zgu@3900 269 assert((size_t)length == StringTableSize * sizeof(HashtableBucket<mtSymbol>),
duke@435 270 "bad shared string size.");
duke@435 271 _the_table = new StringTable(t, number_of_entries);
duke@435 272 }
duke@435 273
duke@435 274 // GC support
duke@435 275 // Delete pointers to otherwise-unreachable objects.
coleenp@2497 276 static void unlink(BoolObjectClosure* cl);
duke@435 277
duke@435 278 // Invoke "f->do_oop" on the locations of all oops in the table.
coleenp@2497 279 static void oops_do(OopClosure* f);
duke@435 280
coleenp@3865 281 // Hashing algorithm, used as the hash value used by the
coleenp@3865 282 // StringTable for bucket selection and comparison (stored in the
coleenp@3865 283 // HashtableEntry structures). This is used in the String.intern() method.
coleenp@3875 284 static unsigned int hash_string(const jchar* s, int len);
coleenp@3865 285
coleenp@3865 286 // Internal test.
coleenp@3865 287 static void test_alt_hash() PRODUCT_RETURN;
coleenp@3865 288
duke@435 289 // Probing
coleenp@2497 290 static oop lookup(Symbol* symbol);
duke@435 291
duke@435 292 // Interning
coleenp@2497 293 static oop intern(Symbol* symbol, TRAPS);
duke@435 294 static oop intern(oop string, TRAPS);
duke@435 295 static oop intern(const char *utf8_string, TRAPS);
duke@435 296
duke@435 297 // Debugging
duke@435 298 static void verify();
coleenp@3865 299 static void dump(outputStream* st);
duke@435 300
duke@435 301 // Sharing
duke@435 302 static void copy_buckets(char** top, char*end) {
zgu@3900 303 the_table()->Hashtable<oop, mtSymbol>::copy_buckets(top, end);
duke@435 304 }
duke@435 305 static void copy_table(char** top, char*end) {
zgu@3900 306 the_table()->Hashtable<oop, mtSymbol>::copy_table(top, end);
duke@435 307 }
duke@435 308 static void reverse() {
zgu@3900 309 the_table()->Hashtable<oop, mtSymbol>::reverse();
duke@435 310 }
coleenp@3865 311
coleenp@3865 312 // Rehash the symbol table if it gets out of balance
coleenp@3865 313 static void rehash_table();
coleenp@3865 314 static bool needs_rehashing() { return _needs_rehashing; }
duke@435 315 };
stefank@2314 316 #endif // SHARE_VM_CLASSFILE_SYMBOLTABLE_HPP

mercurial