annotate hotspot/src/share/vm/utilities/hashtable.cpp @ 46746:ea379ebb9447

8072061: Automatically determine optimal sizes for the CDS regions Summary: See new C++ class MetaspaceClosure. Reviewed-by: coleenp, jiangli, mseledtsov
author iklam
date Wed, 02 Aug 2017 18:06:38 -0700
parents 24ec8a039c90
children
rev   line source
duke@1 1 /*
coleenp@46475 2 * Copyright (c) 2003, 2017, Oracle and/or its affiliates. All rights reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
duke@1 7 * published by the Free Software Foundation.
duke@1 8 *
duke@1 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 13 * accompanied this code).
duke@1 14 *
duke@1 15 * You should have received a copy of the GNU General Public License version
duke@1 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 18 *
trims@5547 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@5547 20 * or visit www.oracle.com if you need additional information or have any
trims@5547 21 * questions.
duke@1 22 *
duke@1 23 */
duke@1 24
stefank@7397 25 #include "precompiled.hpp"
coleenp@13199 26 #include "classfile/altHashing.hpp"
coleenp@46475 27 #include "classfile/dictionary.hpp"
goetz@35498 28 #include "classfile/javaClasses.inline.hpp"
coleenp@46475 29 #include "classfile/moduleEntry.hpp"
coleenp@46475 30 #include "classfile/packageEntry.hpp"
coleenp@46545 31 #include "classfile/placeholders.hpp"
coleenp@46475 32 #include "classfile/protectionDomainCache.hpp"
gziemski@24426 33 #include "classfile/stringTable.hpp"
stefank@7397 34 #include "memory/allocation.inline.hpp"
coleenp@13097 35 #include "memory/filemap.hpp"
stefank@7397 36 #include "memory/resourceArea.hpp"
stefank@7397 37 #include "oops/oop.inline.hpp"
stefank@7397 38 #include "runtime/safepoint.hpp"
stefank@7397 39 #include "utilities/dtrace.hpp"
stefank@7397 40 #include "utilities/hashtable.hpp"
stefank@7397 41 #include "utilities/hashtable.inline.hpp"
iklam@17610 42 #include "utilities/numberSeq.hpp"
duke@1 43
coleenp@8076 44
mgerdin@26421 45 // This hashtable is implemented as an open hash table with a fixed number of buckets.
duke@1 46
mgerdin@26421 47 template <MEMFLAGS F> BasicHashtableEntry<F>* BasicHashtable<F>::new_entry_free_list() {
mgerdin@26421 48 BasicHashtableEntry<F>* entry = NULL;
mgerdin@26421 49 if (_free_list != NULL) {
duke@1 50 entry = _free_list;
duke@1 51 _free_list = _free_list->next();
mgerdin@26421 52 }
mgerdin@26421 53 return entry;
mgerdin@26421 54 }
mgerdin@26421 55
mgerdin@26421 56 // HashtableEntrys are allocated in blocks to reduce the space overhead.
mgerdin@26421 57 template <MEMFLAGS F> BasicHashtableEntry<F>* BasicHashtable<F>::new_entry(unsigned int hashValue) {
mgerdin@26421 58 BasicHashtableEntry<F>* entry = new_entry_free_list();
mgerdin@26421 59
mgerdin@26421 60 if (entry == NULL) {
jrose@1551 61 if (_first_free_entry + _entry_size >= _end_block) {
jrose@1551 62 int block_size = MIN2(512, MAX2((int)_table_size / 2, (int)_number_of_entries));
duke@1 63 int len = _entry_size * block_size;
jrose@1551 64 len = 1 << log2_intptr(len); // round down to power of 2
jrose@1551 65 assert(len >= _entry_size, "");
zgu@13195 66 _first_free_entry = NEW_C_HEAP_ARRAY2(char, len, F, CURRENT_PC);
duke@1 67 _end_block = _first_free_entry + len;
duke@1 68 }
zgu@13195 69 entry = (BasicHashtableEntry<F>*)_first_free_entry;
duke@1 70 _first_free_entry += _entry_size;
duke@1 71 }
duke@1 72
jrose@1551 73 assert(_entry_size % HeapWordSize == 0, "");
duke@1 74 entry->set_hash(hashValue);
duke@1 75 return entry;
duke@1 76 }
duke@1 77
duke@1 78
zgu@13195 79 template <class T, MEMFLAGS F> HashtableEntry<T, F>* Hashtable<T, F>::new_entry(unsigned int hashValue, T obj) {
zgu@13195 80 HashtableEntry<T, F>* entry;
duke@1 81
zgu@13195 82 entry = (HashtableEntry<T, F>*)BasicHashtable<F>::new_entry(hashValue);
coleenp@8076 83 entry->set_literal(obj);
duke@1 84 return entry;
duke@1 85 }
duke@1 86
coleenp@46729 87 // Version of hashtable entry allocation that allocates in the C heap directly.
coleenp@46729 88 // The allocator in blocks is preferable but doesn't have free semantics.
coleenp@46729 89 template <class T, MEMFLAGS F> HashtableEntry<T, F>* Hashtable<T, F>::allocate_new_entry(unsigned int hashValue, T obj) {
coleenp@46729 90 HashtableEntry<T, F>* entry = (HashtableEntry<T, F>*) NEW_C_HEAP_ARRAY(char, this->entry_size(), F);
coleenp@46729 91
coleenp@46729 92 entry->set_hash(hashValue);
coleenp@46729 93 entry->set_literal(obj);
coleenp@46729 94 entry->set_next(NULL);
coleenp@46729 95 return entry;
coleenp@46729 96 }
coleenp@46729 97
coleenp@13087 98 // Check to see if the hashtable is unbalanced. The caller set a flag to
coleenp@13087 99 // rehash at the next safepoint. If this bucket is 60 times greater than the
coleenp@13087 100 // expected average bucket length, it's an unbalanced hashtable.
coleenp@13087 101 // This is somewhat an arbitrary heuristic but if one bucket gets to
coleenp@13087 102 // rehash_count which is currently 100, there's probably something wrong.
coleenp@13087 103
mgerdin@26421 104 template <class T, MEMFLAGS F> bool RehashableHashtable<T, F>::check_rehash_table(int count) {
mgerdin@26421 105 assert(this->table_size() != 0, "underflow");
mgerdin@26421 106 if (count > (((double)this->number_of_entries()/(double)this->table_size())*rehash_multiple)) {
coleenp@13087 107 // Set a flag for the next safepoint, which should be at some guaranteed
coleenp@13087 108 // safepoint interval.
coleenp@13087 109 return true;
coleenp@13087 110 }
coleenp@13087 111 return false;
coleenp@13087 112 }
coleenp@13087 113
coleenp@13087 114 // Create a new table and using alternate hash code, populate the new table
coleenp@13087 115 // with the existing elements. This can be used to change the hash code
coleenp@13087 116 // and could in the future change the size of the table.
coleenp@13087 117
mgerdin@26421 118 template <class T, MEMFLAGS F> void RehashableHashtable<T, F>::move_to(RehashableHashtable<T, F>* new_table) {
coleenp@13199 119
coleenp@13199 120 // Initialize the global seed for hashing.
coleenp@13199 121 _seed = AltHashing::compute_seed();
coleenp@13199 122 assert(seed() != 0, "shouldn't be zero");
coleenp@13199 123
coleenp@13199 124 int saved_entry_count = this->number_of_entries();
coleenp@13087 125
coleenp@13087 126 // Iterate through the table and create a new entry for the new table
coleenp@13087 127 for (int i = 0; i < new_table->table_size(); ++i) {
mgerdin@26421 128 for (HashtableEntry<T, F>* p = this->bucket(i); p != NULL; ) {
zgu@13195 129 HashtableEntry<T, F>* next = p->next();
coleenp@13087 130 T string = p->literal();
coleenp@13087 131 // Use alternate hashing algorithm on the symbol in the first table
coleenp@13728 132 unsigned int hashValue = string->new_hash(seed());
coleenp@13087 133 // Get a new index relative to the new table (can also change size)
coleenp@13087 134 int index = new_table->hash_to_index(hashValue);
coleenp@13087 135 p->set_hash(hashValue);
coleenp@13097 136 // Keep the shared bit in the Hashtable entry to indicate that this entry
coleenp@13097 137 // can't be deleted. The shared bit is the LSB in the _next field so
coleenp@13097 138 // walking the hashtable past these entries requires
coleenp@13097 139 // BasicHashtableEntry::make_ptr() call.
coleenp@13097 140 bool keep_shared = p->is_shared();
andrew@13342 141 this->unlink_entry(p);
coleenp@13087 142 new_table->add_entry(index, p);
coleenp@13097 143 if (keep_shared) {
coleenp@13097 144 p->set_shared();
coleenp@13097 145 }
coleenp@13087 146 p = next;
coleenp@13087 147 }
coleenp@13087 148 }
coleenp@13087 149 // give the new table the free list as well
coleenp@13087 150 new_table->copy_freelist(this);
coleenp@13087 151 assert(new_table->number_of_entries() == saved_entry_count, "lost entry on dictionary copy?");
coleenp@13087 152
coleenp@13087 153 // Destroy memory used by the buckets in the hashtable. The memory
coleenp@13087 154 // for the elements has been used in a new table and is not
coleenp@13087 155 // destroyed. The memory reuse will benefit resizing the SystemDictionary
coleenp@13087 156 // to avoid a memory allocation spike at safepoint.
zgu@13195 157 BasicHashtable<F>::free_buckets();
coleenp@13087 158 }
coleenp@13087 159
zgu@13195 160 template <MEMFLAGS F> void BasicHashtable<F>::free_buckets() {
coleenp@13097 161 if (NULL != _buckets) {
coleenp@13097 162 // Don't delete the buckets in the shared space. They aren't
coleenp@13097 163 // allocated by os::malloc
coleenp@13097 164 if (!UseSharedSpaces ||
coleenp@13097 165 !FileMapInfo::current_info()->is_in_shared_space(_buckets)) {
coleenp@27880 166 FREE_C_HEAP_ARRAY(HashtableBucket, _buckets);
coleenp@13097 167 }
coleenp@13097 168 _buckets = NULL;
coleenp@13097 169 }
coleenp@13097 170 }
coleenp@13097 171
tschatzl@45114 172 template <MEMFLAGS F> void BasicHashtable<F>::BucketUnlinkContext::free_entry(BasicHashtableEntry<F>* entry) {
tschatzl@45114 173 entry->set_next(_removed_head);
tschatzl@45114 174 _removed_head = entry;
tschatzl@45114 175 if (_removed_tail == NULL) {
tschatzl@45114 176 _removed_tail = entry;
tschatzl@45114 177 }
tschatzl@45114 178 _num_removed++;
tschatzl@45114 179 }
tschatzl@45114 180
tschatzl@45114 181 template <MEMFLAGS F> void BasicHashtable<F>::bulk_free_entries(BucketUnlinkContext* context) {
tschatzl@45114 182 if (context->_num_removed == 0) {
tschatzl@45114 183 assert(context->_removed_head == NULL && context->_removed_tail == NULL,
tschatzl@45114 184 "Zero entries in the unlink context, but elements linked from " PTR_FORMAT " to " PTR_FORMAT,
tschatzl@45114 185 p2i(context->_removed_head), p2i(context->_removed_tail));
tschatzl@45114 186 return;
tschatzl@45114 187 }
tschatzl@45114 188
tschatzl@45114 189 // MT-safe add of the list of BasicHashTableEntrys from the context to the free list.
tschatzl@45114 190 BasicHashtableEntry<F>* current = _free_list;
tschatzl@45114 191 while (true) {
tschatzl@45114 192 context->_removed_tail->set_next(current);
tschatzl@45114 193 BasicHashtableEntry<F>* old = (BasicHashtableEntry<F>*)Atomic::cmpxchg_ptr(context->_removed_head, &_free_list, current);
tschatzl@45114 194 if (old == current) {
tschatzl@45114 195 break;
tschatzl@45114 196 }
tschatzl@45114 197 current = old;
tschatzl@45114 198 }
tschatzl@45114 199 Atomic::add(-context->_num_removed, &_number_of_entries);
tschatzl@45114 200 }
iklam@46746 201 // Copy the table to the shared space.
iklam@46746 202 template <MEMFLAGS F> size_t BasicHashtable<F>::count_bytes_for_table() {
iklam@46746 203 size_t bytes = 0;
iklam@46746 204 bytes += sizeof(intptr_t); // len
coleenp@13097 205
iklam@46746 206 for (int i = 0; i < _table_size; ++i) {
iklam@46746 207 for (BasicHashtableEntry<F>** p = _buckets[i].entry_addr();
iklam@46746 208 *p != NULL;
iklam@46746 209 p = (*p)->next_addr()) {
iklam@46746 210 bytes += entry_size();
iklam@46746 211 }
iklam@46746 212 }
duke@1 213
iklam@46746 214 return bytes;
iklam@46746 215 }
duke@1 216
iklam@46746 217 // Dump the hash table entries (into CDS archive)
iklam@46746 218 template <MEMFLAGS F> void BasicHashtable<F>::copy_table(char* top, char* end) {
iklam@46746 219 assert(is_aligned(top, sizeof(intptr_t)), "bad alignment");
iklam@46746 220 intptr_t *plen = (intptr_t*)(top);
iklam@46746 221 top += sizeof(*plen);
duke@1 222
duke@1 223 int i;
duke@1 224 for (i = 0; i < _table_size; ++i) {
zgu@13195 225 for (BasicHashtableEntry<F>** p = _buckets[i].entry_addr();
iklam@46746 226 *p != NULL;
iklam@46746 227 p = (*p)->next_addr()) {
iklam@46746 228 *p = (BasicHashtableEntry<F>*)memcpy(top, (void*)*p, entry_size());
iklam@46746 229 top += entry_size();
duke@1 230 }
duke@1 231 }
iklam@46746 232 *plen = (char*)(top) - (char*)plen - sizeof(*plen);
iklam@46746 233 assert(top == end, "count_bytes_for_table is wrong");
duke@1 234 // Set the shared bit.
duke@1 235
duke@1 236 for (i = 0; i < _table_size; ++i) {
zgu@13195 237 for (BasicHashtableEntry<F>* p = bucket(i); p != NULL; p = p->next()) {
duke@1 238 p->set_shared();
duke@1 239 }
duke@1 240 }
duke@1 241 }
duke@1 242
coleenp@46742 243 // For oops and Strings the size of the literal is interesting. For other types, nobody cares.
coleenp@46742 244 static int literal_size(ConstantPool*) { return 0; }
coleenp@46742 245 static int literal_size(Klass*) { return 0; }
coleenp@46742 246 #if INCLUDE_ALL_GCS
coleenp@46742 247 static int literal_size(nmethod*) { return 0; }
coleenp@46742 248 #endif
coleenp@46742 249
coleenp@46742 250 static int literal_size(Symbol *symbol) {
iklam@17610 251 return symbol->size() * HeapWordSize;
iklam@17610 252 }
iklam@17610 253
coleenp@46742 254 static int literal_size(oop obj) {
iklam@17610 255 // NOTE: this would over-count if (pre-JDK8) java_lang_Class::has_offset_field() is true,
iklam@17610 256 // and the String.value array is shared by several Strings. However, starting from JDK8,
iklam@17610 257 // the String.value array is not shared anymore.
coleenp@46742 258 if (obj == NULL) {
coleenp@46742 259 return 0;
coleenp@46742 260 } else if (obj->klass() == SystemDictionary::String_klass()) {
coleenp@46742 261 return (obj->size() + java_lang_String::value(obj)->size()) * HeapWordSize;
coleenp@46742 262 } else {
coleenp@46742 263 return obj->size();
coleenp@46742 264 }
iklam@17610 265 }
iklam@17610 266
coleenp@46742 267
iklam@17610 268 // Dump footprint and bucket length statistics
iklam@17610 269 //
iklam@17610 270 // Note: if you create a new subclass of Hashtable<MyNewType, F>, you will need to
coleenp@46742 271 // add a new function static int literal_size(MyNewType lit)
coleenp@46742 272 // because I can't get template <class T> int literal_size(T) to pick the specializations for Symbol and oop.
coleenp@46742 273 //
coleenp@46742 274 // The StringTable and SymbolTable dumping print how much footprint is used by the String and Symbol
coleenp@46742 275 // literals.
iklam@17610 276
coleenp@46742 277 template <class T, MEMFLAGS F> void Hashtable<T, F>::print_table_statistics(outputStream* st,
coleenp@46742 278 const char *table_name) {
iklam@17610 279 NumberSeq summary;
iklam@17610 280 int literal_bytes = 0;
iklam@17610 281 for (int i = 0; i < this->table_size(); ++i) {
iklam@17610 282 int count = 0;
mgerdin@26421 283 for (HashtableEntry<T, F>* e = this->bucket(i);
iklam@46746 284 e != NULL; e = e->next()) {
iklam@17610 285 count++;
iklam@17610 286 literal_bytes += literal_size(e->literal());
iklam@17610 287 }
iklam@17610 288 summary.add((double)count);
iklam@17610 289 }
iklam@17610 290 double num_buckets = summary.num();
iklam@17610 291 double num_entries = summary.sum();
iklam@17610 292
mgerdin@26421 293 int bucket_bytes = (int)num_buckets * sizeof(HashtableBucket<F>);
iklam@17610 294 int entry_bytes = (int)num_entries * sizeof(HashtableEntry<T, F>);
iklam@17610 295 int total_bytes = literal_bytes + bucket_bytes + entry_bytes;
iklam@17610 296
coleenp@46742 297 int bucket_size = (num_buckets <= 0) ? 0 : (bucket_bytes / num_buckets);
coleenp@46742 298 int entry_size = (num_entries <= 0) ? 0 : (entry_bytes / num_entries);
iklam@17610 299
iklam@17610 300 st->print_cr("%s statistics:", table_name);
coleenp@46742 301 st->print_cr("Number of buckets : %9d = %9d bytes, each %d", (int)num_buckets, bucket_bytes, bucket_size);
coleenp@46742 302 st->print_cr("Number of entries : %9d = %9d bytes, each %d", (int)num_entries, entry_bytes, entry_size);
coleenp@46742 303 if (literal_bytes != 0) {
coleenp@46742 304 double literal_avg = (num_entries <= 0) ? 0 : (literal_bytes / num_entries);
coleenp@46742 305 st->print_cr("Number of literals : %9d = %9d bytes, avg %7.3f", (int)num_entries, literal_bytes, literal_avg);
coleenp@46742 306 }
iklam@17610 307 st->print_cr("Total footprint : %9s = %9d bytes", "", total_bytes);
iklam@17610 308 st->print_cr("Average bucket size : %9.3f", summary.avg());
iklam@17610 309 st->print_cr("Variance of bucket size : %9.3f", summary.variance());
iklam@17610 310 st->print_cr("Std. dev. of bucket size: %9.3f", summary.sd());
iklam@17610 311 st->print_cr("Maximum bucket size : %9d", (int)summary.maximum());
iklam@17610 312 }
iklam@17610 313
duke@1 314
duke@1 315 // Dump the hash table buckets.
duke@1 316
iklam@46746 317 template <MEMFLAGS F> size_t BasicHashtable<F>::count_bytes_for_buckets() {
iklam@46746 318 size_t bytes = 0;
iklam@46746 319 bytes += sizeof(intptr_t); // len
iklam@46746 320 bytes += sizeof(intptr_t); // _number_of_entries
iklam@46746 321 bytes += _table_size * sizeof(HashtableBucket<F>); // the buckets
iklam@46746 322
iklam@46746 323 return bytes;
iklam@46746 324 }
iklam@46746 325
iklam@46746 326 // Dump the buckets (into CDS archive)
iklam@46746 327 template <MEMFLAGS F> void BasicHashtable<F>::copy_buckets(char* top, char* end) {
iklam@46746 328 assert(is_aligned(top, sizeof(intptr_t)), "bad alignment");
zgu@13195 329 intptr_t len = _table_size * sizeof(HashtableBucket<F>);
iklam@46746 330 *(intptr_t*)(top) = len;
iklam@46746 331 top += sizeof(intptr_t);
duke@1 332
iklam@46746 333 *(intptr_t*)(top) = _number_of_entries;
iklam@46746 334 top += sizeof(intptr_t);
duke@1 335
iklam@46746 336 _buckets = (HashtableBucket<F>*)memcpy(top, (void*)_buckets, len);
iklam@46746 337 top += len;
iklam@46746 338
iklam@46746 339 assert(top == end, "count_bytes_for_buckets is wrong");
duke@1 340 }
duke@1 341
duke@1 342 #ifndef PRODUCT
duke@1 343
zgu@13195 344 template <class T, MEMFLAGS F> void Hashtable<T, F>::print() {
duke@1 345 ResourceMark rm;
duke@1 346
zgu@13195 347 for (int i = 0; i < BasicHashtable<F>::table_size(); i++) {
zgu@13195 348 HashtableEntry<T, F>* entry = bucket(i);
duke@1 349 while(entry != NULL) {
duke@1 350 tty->print("%d : ", i);
duke@1 351 entry->literal()->print();
duke@1 352 tty->cr();
duke@1 353 entry = entry->next();
duke@1 354 }
duke@1 355 }
duke@1 356 }
duke@1 357
coleenp@46475 358 template <MEMFLAGS F>
coleenp@46475 359 template <class T> void BasicHashtable<F>::verify_table(const char* table_name) {
coleenp@46475 360 int element_count = 0;
coleenp@46475 361 int max_bucket_count = 0;
coleenp@46545 362 int max_bucket_number = 0;
coleenp@46475 363 for (int index = 0; index < table_size(); index++) {
coleenp@46475 364 int bucket_count = 0;
coleenp@46475 365 for (T* probe = (T*)bucket(index); probe != NULL; probe = probe->next()) {
coleenp@46475 366 probe->verify();
coleenp@46475 367 bucket_count++;
duke@1 368 }
coleenp@46475 369 element_count += bucket_count;
coleenp@46545 370 if (bucket_count > max_bucket_count) {
coleenp@46545 371 max_bucket_count = bucket_count;
coleenp@46545 372 max_bucket_number = index;
coleenp@46545 373 }
duke@1 374 }
coleenp@46475 375 guarantee(number_of_entries() == element_count,
coleenp@46475 376 "Verify of %s failed", table_name);
coleenp@46545 377
coleenp@46545 378 // Log some statistics about the hashtable
coleenp@46545 379 log_info(hashtables)("%s max bucket size %d bucket %d element count %d table size %d", table_name,
coleenp@46545 380 max_bucket_count, max_bucket_number, _number_of_entries, _table_size);
coleenp@46545 381 if (_number_of_entries > 0 && log_is_enabled(Debug, hashtables)) {
coleenp@46545 382 for (int index = 0; index < table_size(); index++) {
coleenp@46545 383 int bucket_count = 0;
coleenp@46545 384 for (T* probe = (T*)bucket(index); probe != NULL; probe = probe->next()) {
coleenp@46545 385 log_debug(hashtables)("bucket %d hash " INTPTR_FORMAT, index, (intptr_t)probe->hash());
coleenp@46545 386 bucket_count++;
coleenp@46545 387 }
coleenp@46545 388 if (bucket_count > 0) {
coleenp@46545 389 log_debug(hashtables)("bucket %d count %d", index, bucket_count);
coleenp@46545 390 }
coleenp@46545 391 }
coleenp@46545 392 }
duke@1 393 }
duke@1 394 #endif // PRODUCT
duke@1 395
coleenp@8076 396 // Explicitly instantiate these types
mgerdin@26422 397 #if INCLUDE_ALL_GCS
mgerdin@26422 398 template class Hashtable<nmethod*, mtGC>;
mgerdin@26422 399 template class HashtableEntry<nmethod*, mtGC>;
mgerdin@26422 400 template class BasicHashtable<mtGC>;
mgerdin@26422 401 #endif
coleenp@13728 402 template class Hashtable<ConstantPool*, mtClass>;
mgerdin@26421 403 template class RehashableHashtable<Symbol*, mtSymbol>;
mgerdin@26421 404 template class RehashableHashtable<oopDesc*, mtSymbol>;
zgu@13195 405 template class Hashtable<Symbol*, mtSymbol>;
coleenp@13728 406 template class Hashtable<Klass*, mtClass>;
iklam@34257 407 template class Hashtable<InstanceKlass*, mtClass>;
zgu@13195 408 template class Hashtable<oop, mtClass>;
coleenp@46729 409 template class Hashtable<Symbol*, mtModule>;
hseigel@20282 410 #if defined(SOLARIS) || defined(CHECK_UNHANDLED_OOPS)
zgu@13195 411 template class Hashtable<oop, mtSymbol>;
mgerdin@26421 412 template class RehashableHashtable<oop, mtSymbol>;
hseigel@20282 413 #endif // SOLARIS || CHECK_UNHANDLED_OOPS
zgu@13195 414 template class Hashtable<oopDesc*, mtSymbol>;
zgu@13195 415 template class Hashtable<Symbol*, mtClass>;
zgu@13195 416 template class HashtableEntry<Symbol*, mtSymbol>;
zgu@13195 417 template class HashtableEntry<Symbol*, mtClass>;
zgu@13195 418 template class HashtableEntry<oop, mtSymbol>;
iklam@46746 419 template class HashtableBucket<mtClass>;
zgu@13195 420 template class BasicHashtableEntry<mtSymbol>;
zgu@13195 421 template class BasicHashtableEntry<mtCode>;
zgu@13195 422 template class BasicHashtable<mtClass>;
iklam@34257 423 template class BasicHashtable<mtClassShared>;
zgu@13195 424 template class BasicHashtable<mtSymbol>;
zgu@13195 425 template class BasicHashtable<mtCode>;
zgu@13195 426 template class BasicHashtable<mtInternal>;
hseigel@38733 427 template class BasicHashtable<mtModule>;
mgronlun@36384 428 #if INCLUDE_TRACE
mgronlun@36384 429 template class Hashtable<Symbol*, mtTracing>;
mgronlun@36384 430 template class HashtableEntry<Symbol*, mtTracing>;
mgronlun@36384 431 template class BasicHashtable<mtTracing>;
mgronlun@36384 432 #endif
kvn@30593 433 template class BasicHashtable<mtCompiler>;
coleenp@46475 434
coleenp@46475 435 template void BasicHashtable<mtClass>::verify_table<DictionaryEntry>(char const*);
coleenp@46475 436 template void BasicHashtable<mtModule>::verify_table<ModuleEntry>(char const*);
coleenp@46475 437 template void BasicHashtable<mtModule>::verify_table<PackageEntry>(char const*);
coleenp@46475 438 template void BasicHashtable<mtClass>::verify_table<ProtectionDomainCacheEntry>(char const*);
coleenp@46545 439 template void BasicHashtable<mtClass>::verify_table<PlaceholderEntry>(char const*);