annotate src/hotspot/share/utilities/hashtable.cpp @ 50313:e57e6addb978

8201505: Use WeakHandle for ProtectionDomainCacheTable and ResolvedMethodTable 8193524: Redefining a method that removes use of 1 or more lambda expressions causes the JVM to hang Summary: Remove oop pointers from runtime data structures. Reviewed-by: lfoltan, stefank Contributed-by: coleen.phillimore@oracle.com, lois.foltan@oracle.com
author coleenp
date Wed, 18 Apr 2018 12:06:53 -0400
parents ea0d0781c63c
children 9042ffe5b7fe
rev   line source
duke@1 1 /*
coleenp@50313 2 * Copyright (c) 2003, 2018, 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"
iklam@49178 35 #include "memory/metaspaceShared.hpp"
stefank@7397 36 #include "memory/resourceArea.hpp"
stefank@7397 37 #include "oops/oop.inline.hpp"
coleenp@50313 38 #include "oops/weakHandle.inline.hpp"
stefank@7397 39 #include "runtime/safepoint.hpp"
stefank@7397 40 #include "utilities/dtrace.hpp"
stefank@7397 41 #include "utilities/hashtable.hpp"
stefank@7397 42 #include "utilities/hashtable.inline.hpp"
iklam@17610 43 #include "utilities/numberSeq.hpp"
duke@1 44
coleenp@8076 45
mgerdin@26421 46 // This hashtable is implemented as an open hash table with a fixed number of buckets.
duke@1 47
mgerdin@26421 48 template <MEMFLAGS F> BasicHashtableEntry<F>* BasicHashtable<F>::new_entry_free_list() {
mgerdin@26421 49 BasicHashtableEntry<F>* entry = NULL;
mgerdin@26421 50 if (_free_list != NULL) {
duke@1 51 entry = _free_list;
duke@1 52 _free_list = _free_list->next();
mgerdin@26421 53 }
mgerdin@26421 54 return entry;
mgerdin@26421 55 }
mgerdin@26421 56
mgerdin@26421 57 // HashtableEntrys are allocated in blocks to reduce the space overhead.
mgerdin@26421 58 template <MEMFLAGS F> BasicHashtableEntry<F>* BasicHashtable<F>::new_entry(unsigned int hashValue) {
mgerdin@26421 59 BasicHashtableEntry<F>* entry = new_entry_free_list();
mgerdin@26421 60
mgerdin@26421 61 if (entry == NULL) {
jrose@1551 62 if (_first_free_entry + _entry_size >= _end_block) {
jrose@1551 63 int block_size = MIN2(512, MAX2((int)_table_size / 2, (int)_number_of_entries));
duke@1 64 int len = _entry_size * block_size;
jrose@1551 65 len = 1 << log2_intptr(len); // round down to power of 2
jrose@1551 66 assert(len >= _entry_size, "");
zgu@13195 67 _first_free_entry = NEW_C_HEAP_ARRAY2(char, len, F, CURRENT_PC);
duke@1 68 _end_block = _first_free_entry + len;
duke@1 69 }
zgu@13195 70 entry = (BasicHashtableEntry<F>*)_first_free_entry;
duke@1 71 _first_free_entry += _entry_size;
duke@1 72 }
duke@1 73
jrose@1551 74 assert(_entry_size % HeapWordSize == 0, "");
duke@1 75 entry->set_hash(hashValue);
duke@1 76 return entry;
duke@1 77 }
duke@1 78
duke@1 79
zgu@13195 80 template <class T, MEMFLAGS F> HashtableEntry<T, F>* Hashtable<T, F>::new_entry(unsigned int hashValue, T obj) {
zgu@13195 81 HashtableEntry<T, F>* entry;
duke@1 82
zgu@13195 83 entry = (HashtableEntry<T, F>*)BasicHashtable<F>::new_entry(hashValue);
coleenp@8076 84 entry->set_literal(obj);
duke@1 85 return entry;
duke@1 86 }
duke@1 87
coleenp@46729 88 // Version of hashtable entry allocation that allocates in the C heap directly.
coleenp@46729 89 // The allocator in blocks is preferable but doesn't have free semantics.
coleenp@46729 90 template <class T, MEMFLAGS F> HashtableEntry<T, F>* Hashtable<T, F>::allocate_new_entry(unsigned int hashValue, T obj) {
coleenp@46729 91 HashtableEntry<T, F>* entry = (HashtableEntry<T, F>*) NEW_C_HEAP_ARRAY(char, this->entry_size(), F);
coleenp@46729 92
coleenp@46729 93 entry->set_hash(hashValue);
coleenp@46729 94 entry->set_literal(obj);
coleenp@46729 95 entry->set_next(NULL);
coleenp@46729 96 return entry;
coleenp@46729 97 }
coleenp@46729 98
coleenp@13087 99 // Check to see if the hashtable is unbalanced. The caller set a flag to
coleenp@13087 100 // rehash at the next safepoint. If this bucket is 60 times greater than the
coleenp@13087 101 // expected average bucket length, it's an unbalanced hashtable.
coleenp@13087 102 // This is somewhat an arbitrary heuristic but if one bucket gets to
coleenp@13087 103 // rehash_count which is currently 100, there's probably something wrong.
coleenp@13087 104
mgerdin@26421 105 template <class T, MEMFLAGS F> bool RehashableHashtable<T, F>::check_rehash_table(int count) {
mgerdin@26421 106 assert(this->table_size() != 0, "underflow");
mgerdin@26421 107 if (count > (((double)this->number_of_entries()/(double)this->table_size())*rehash_multiple)) {
coleenp@13087 108 // Set a flag for the next safepoint, which should be at some guaranteed
coleenp@13087 109 // safepoint interval.
coleenp@13087 110 return true;
coleenp@13087 111 }
coleenp@13087 112 return false;
coleenp@13087 113 }
coleenp@13087 114
coleenp@13087 115 // Create a new table and using alternate hash code, populate the new table
coleenp@13087 116 // with the existing elements. This can be used to change the hash code
coleenp@13087 117 // and could in the future change the size of the table.
coleenp@13087 118
mgerdin@26421 119 template <class T, MEMFLAGS F> void RehashableHashtable<T, F>::move_to(RehashableHashtable<T, F>* new_table) {
coleenp@13199 120
coleenp@13199 121 // Initialize the global seed for hashing.
coleenp@13199 122 _seed = AltHashing::compute_seed();
coleenp@13199 123 assert(seed() != 0, "shouldn't be zero");
coleenp@13199 124
coleenp@13199 125 int saved_entry_count = this->number_of_entries();
coleenp@13087 126
coleenp@13087 127 // Iterate through the table and create a new entry for the new table
coleenp@13087 128 for (int i = 0; i < new_table->table_size(); ++i) {
mgerdin@26421 129 for (HashtableEntry<T, F>* p = this->bucket(i); p != NULL; ) {
zgu@13195 130 HashtableEntry<T, F>* next = p->next();
coleenp@13087 131 T string = p->literal();
coleenp@13087 132 // Use alternate hashing algorithm on the symbol in the first table
coleenp@13728 133 unsigned int hashValue = string->new_hash(seed());
coleenp@13087 134 // Get a new index relative to the new table (can also change size)
coleenp@13087 135 int index = new_table->hash_to_index(hashValue);
coleenp@13087 136 p->set_hash(hashValue);
coleenp@13097 137 // Keep the shared bit in the Hashtable entry to indicate that this entry
coleenp@13097 138 // can't be deleted. The shared bit is the LSB in the _next field so
coleenp@13097 139 // walking the hashtable past these entries requires
coleenp@13097 140 // BasicHashtableEntry::make_ptr() call.
coleenp@13097 141 bool keep_shared = p->is_shared();
andrew@13342 142 this->unlink_entry(p);
coleenp@13087 143 new_table->add_entry(index, p);
coleenp@13097 144 if (keep_shared) {
coleenp@13097 145 p->set_shared();
coleenp@13097 146 }
coleenp@13087 147 p = next;
coleenp@13087 148 }
coleenp@13087 149 }
coleenp@13087 150 // give the new table the free list as well
coleenp@13087 151 new_table->copy_freelist(this);
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
iklam@49178 164 if (!MetaspaceShared::is_in_shared_metaspace(_buckets)) {
coleenp@27880 165 FREE_C_HEAP_ARRAY(HashtableBucket, _buckets);
coleenp@13097 166 }
coleenp@13097 167 _buckets = NULL;
coleenp@13097 168 }
coleenp@13097 169 }
coleenp@13097 170
tschatzl@45114 171 template <MEMFLAGS F> void BasicHashtable<F>::BucketUnlinkContext::free_entry(BasicHashtableEntry<F>* entry) {
tschatzl@45114 172 entry->set_next(_removed_head);
tschatzl@45114 173 _removed_head = entry;
tschatzl@45114 174 if (_removed_tail == NULL) {
tschatzl@45114 175 _removed_tail = entry;
tschatzl@45114 176 }
tschatzl@45114 177 _num_removed++;
tschatzl@45114 178 }
tschatzl@45114 179
tschatzl@45114 180 template <MEMFLAGS F> void BasicHashtable<F>::bulk_free_entries(BucketUnlinkContext* context) {
tschatzl@45114 181 if (context->_num_removed == 0) {
tschatzl@45114 182 assert(context->_removed_head == NULL && context->_removed_tail == NULL,
tschatzl@45114 183 "Zero entries in the unlink context, but elements linked from " PTR_FORMAT " to " PTR_FORMAT,
tschatzl@45114 184 p2i(context->_removed_head), p2i(context->_removed_tail));
tschatzl@45114 185 return;
tschatzl@45114 186 }
tschatzl@45114 187
tschatzl@45114 188 // MT-safe add of the list of BasicHashTableEntrys from the context to the free list.
tschatzl@45114 189 BasicHashtableEntry<F>* current = _free_list;
tschatzl@45114 190 while (true) {
tschatzl@45114 191 context->_removed_tail->set_next(current);
coleenp@47789 192 BasicHashtableEntry<F>* old = Atomic::cmpxchg(context->_removed_head, &_free_list, current);
tschatzl@45114 193 if (old == current) {
tschatzl@45114 194 break;
tschatzl@45114 195 }
tschatzl@45114 196 current = old;
tschatzl@45114 197 }
tschatzl@45114 198 Atomic::add(-context->_num_removed, &_number_of_entries);
tschatzl@45114 199 }
iklam@46746 200 // Copy the table to the shared space.
iklam@46746 201 template <MEMFLAGS F> size_t BasicHashtable<F>::count_bytes_for_table() {
iklam@46746 202 size_t bytes = 0;
iklam@46746 203 bytes += sizeof(intptr_t); // len
coleenp@13097 204
iklam@46746 205 for (int i = 0; i < _table_size; ++i) {
iklam@46746 206 for (BasicHashtableEntry<F>** p = _buckets[i].entry_addr();
iklam@46746 207 *p != NULL;
iklam@46746 208 p = (*p)->next_addr()) {
iklam@46746 209 bytes += entry_size();
iklam@46746 210 }
iklam@46746 211 }
duke@1 212
iklam@46746 213 return bytes;
iklam@46746 214 }
duke@1 215
iklam@46746 216 // Dump the hash table entries (into CDS archive)
iklam@46746 217 template <MEMFLAGS F> void BasicHashtable<F>::copy_table(char* top, char* end) {
iklam@46746 218 assert(is_aligned(top, sizeof(intptr_t)), "bad alignment");
iklam@46746 219 intptr_t *plen = (intptr_t*)(top);
iklam@46746 220 top += sizeof(*plen);
duke@1 221
duke@1 222 int i;
duke@1 223 for (i = 0; i < _table_size; ++i) {
zgu@13195 224 for (BasicHashtableEntry<F>** p = _buckets[i].entry_addr();
iklam@46746 225 *p != NULL;
iklam@46746 226 p = (*p)->next_addr()) {
iklam@46746 227 *p = (BasicHashtableEntry<F>*)memcpy(top, (void*)*p, entry_size());
iklam@46746 228 top += entry_size();
duke@1 229 }
duke@1 230 }
iklam@46746 231 *plen = (char*)(top) - (char*)plen - sizeof(*plen);
iklam@46746 232 assert(top == end, "count_bytes_for_table is wrong");
duke@1 233 // Set the shared bit.
duke@1 234
duke@1 235 for (i = 0; i < _table_size; ++i) {
zgu@13195 236 for (BasicHashtableEntry<F>* p = bucket(i); p != NULL; p = p->next()) {
duke@1 237 p->set_shared();
duke@1 238 }
duke@1 239 }
duke@1 240 }
duke@1 241
coleenp@46742 242 // For oops and Strings the size of the literal is interesting. For other types, nobody cares.
coleenp@46742 243 static int literal_size(ConstantPool*) { return 0; }
coleenp@46742 244 static int literal_size(Klass*) { return 0; }
coleenp@46742 245 #if INCLUDE_ALL_GCS
coleenp@46742 246 static int literal_size(nmethod*) { return 0; }
coleenp@46742 247 #endif
coleenp@46742 248
coleenp@46742 249 static int literal_size(Symbol *symbol) {
iklam@17610 250 return symbol->size() * HeapWordSize;
iklam@17610 251 }
iklam@17610 252
coleenp@46742 253 static int literal_size(oop obj) {
iklam@17610 254 // NOTE: this would over-count if (pre-JDK8) java_lang_Class::has_offset_field() is true,
iklam@17610 255 // and the String.value array is shared by several Strings. However, starting from JDK8,
iklam@17610 256 // the String.value array is not shared anymore.
coleenp@46742 257 if (obj == NULL) {
coleenp@46742 258 return 0;
coleenp@46742 259 } else if (obj->klass() == SystemDictionary::String_klass()) {
coleenp@46742 260 return (obj->size() + java_lang_String::value(obj)->size()) * HeapWordSize;
coleenp@46742 261 } else {
coleenp@46742 262 return obj->size();
coleenp@46742 263 }
iklam@17610 264 }
iklam@17610 265
coleenp@50313 266 static int literal_size(ClassLoaderWeakHandle v) {
coleenp@50313 267 return literal_size(v.peek());
coleenp@50313 268 }
coleenp@50313 269
gziemski@47955 270 template <MEMFLAGS F> bool BasicHashtable<F>::resize(int new_size) {
gziemski@47955 271 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
gziemski@47955 272
gziemski@47955 273 // Allocate new buckets
gziemski@47955 274 HashtableBucket<F>* buckets_new = NEW_C_HEAP_ARRAY2_RETURN_NULL(HashtableBucket<F>, new_size, F, CURRENT_PC);
gziemski@47955 275 if (buckets_new == NULL) {
gziemski@47955 276 return false;
gziemski@47955 277 }
gziemski@47955 278
gziemski@47955 279 // Clear the new buckets
gziemski@47955 280 for (int i = 0; i < new_size; i++) {
gziemski@47955 281 buckets_new[i].clear();
gziemski@47955 282 }
gziemski@47955 283
gziemski@47955 284 int table_size_old = _table_size;
gziemski@47955 285 // hash_to_index() uses _table_size, so switch the sizes now
gziemski@47955 286 _table_size = new_size;
gziemski@47955 287
gziemski@47955 288 // Move entries from the old table to a new table
gziemski@47955 289 for (int index_old = 0; index_old < table_size_old; index_old++) {
gziemski@47955 290 for (BasicHashtableEntry<F>* p = _buckets[index_old].get_entry(); p != NULL; ) {
gziemski@47955 291 BasicHashtableEntry<F>* next = p->next();
gziemski@47955 292 bool keep_shared = p->is_shared();
gziemski@47955 293 int index_new = hash_to_index(p->hash());
gziemski@47955 294
gziemski@47955 295 p->set_next(buckets_new[index_new].get_entry());
gziemski@47955 296 buckets_new[index_new].set_entry(p);
gziemski@47955 297
gziemski@47955 298 if (keep_shared) {
gziemski@47955 299 p->set_shared();
gziemski@47955 300 }
gziemski@47955 301 p = next;
gziemski@47955 302 }
gziemski@47955 303 }
gziemski@47955 304
gziemski@47955 305 // The old backets now can be released
gziemski@47955 306 BasicHashtable<F>::free_buckets();
gziemski@47955 307
gziemski@47955 308 // Switch to the new storage
gziemski@47955 309 _buckets = buckets_new;
gziemski@47955 310
gziemski@47955 311 return true;
gziemski@47955 312 }
coleenp@46742 313
iklam@17610 314 // Dump footprint and bucket length statistics
iklam@17610 315 //
iklam@17610 316 // Note: if you create a new subclass of Hashtable<MyNewType, F>, you will need to
coleenp@46742 317 // add a new function static int literal_size(MyNewType lit)
coleenp@46742 318 // because I can't get template <class T> int literal_size(T) to pick the specializations for Symbol and oop.
coleenp@46742 319 //
coleenp@46742 320 // The StringTable and SymbolTable dumping print how much footprint is used by the String and Symbol
coleenp@46742 321 // literals.
iklam@17610 322
coleenp@46742 323 template <class T, MEMFLAGS F> void Hashtable<T, F>::print_table_statistics(outputStream* st,
coleenp@46742 324 const char *table_name) {
iklam@17610 325 NumberSeq summary;
iklam@17610 326 int literal_bytes = 0;
iklam@17610 327 for (int i = 0; i < this->table_size(); ++i) {
iklam@17610 328 int count = 0;
mgerdin@26421 329 for (HashtableEntry<T, F>* e = this->bucket(i);
iklam@46746 330 e != NULL; e = e->next()) {
iklam@17610 331 count++;
iklam@17610 332 literal_bytes += literal_size(e->literal());
iklam@17610 333 }
iklam@17610 334 summary.add((double)count);
iklam@17610 335 }
iklam@17610 336 double num_buckets = summary.num();
iklam@17610 337 double num_entries = summary.sum();
iklam@17610 338
mgerdin@26421 339 int bucket_bytes = (int)num_buckets * sizeof(HashtableBucket<F>);
iklam@17610 340 int entry_bytes = (int)num_entries * sizeof(HashtableEntry<T, F>);
iklam@17610 341 int total_bytes = literal_bytes + bucket_bytes + entry_bytes;
iklam@17610 342
coleenp@46742 343 int bucket_size = (num_buckets <= 0) ? 0 : (bucket_bytes / num_buckets);
coleenp@46742 344 int entry_size = (num_entries <= 0) ? 0 : (entry_bytes / num_entries);
iklam@17610 345
iklam@17610 346 st->print_cr("%s statistics:", table_name);
coleenp@46742 347 st->print_cr("Number of buckets : %9d = %9d bytes, each %d", (int)num_buckets, bucket_bytes, bucket_size);
coleenp@46742 348 st->print_cr("Number of entries : %9d = %9d bytes, each %d", (int)num_entries, entry_bytes, entry_size);
coleenp@46742 349 if (literal_bytes != 0) {
coleenp@46742 350 double literal_avg = (num_entries <= 0) ? 0 : (literal_bytes / num_entries);
coleenp@46742 351 st->print_cr("Number of literals : %9d = %9d bytes, avg %7.3f", (int)num_entries, literal_bytes, literal_avg);
coleenp@46742 352 }
iklam@17610 353 st->print_cr("Total footprint : %9s = %9d bytes", "", total_bytes);
iklam@17610 354 st->print_cr("Average bucket size : %9.3f", summary.avg());
iklam@17610 355 st->print_cr("Variance of bucket size : %9.3f", summary.variance());
iklam@17610 356 st->print_cr("Std. dev. of bucket size: %9.3f", summary.sd());
iklam@17610 357 st->print_cr("Maximum bucket size : %9d", (int)summary.maximum());
iklam@17610 358 }
iklam@17610 359
duke@1 360
duke@1 361 // Dump the hash table buckets.
duke@1 362
iklam@46746 363 template <MEMFLAGS F> size_t BasicHashtable<F>::count_bytes_for_buckets() {
iklam@46746 364 size_t bytes = 0;
iklam@46746 365 bytes += sizeof(intptr_t); // len
iklam@46746 366 bytes += sizeof(intptr_t); // _number_of_entries
iklam@46746 367 bytes += _table_size * sizeof(HashtableBucket<F>); // the buckets
iklam@46746 368
iklam@46746 369 return bytes;
iklam@46746 370 }
iklam@46746 371
iklam@46746 372 // Dump the buckets (into CDS archive)
iklam@46746 373 template <MEMFLAGS F> void BasicHashtable<F>::copy_buckets(char* top, char* end) {
iklam@46746 374 assert(is_aligned(top, sizeof(intptr_t)), "bad alignment");
zgu@13195 375 intptr_t len = _table_size * sizeof(HashtableBucket<F>);
iklam@46746 376 *(intptr_t*)(top) = len;
iklam@46746 377 top += sizeof(intptr_t);
duke@1 378
iklam@46746 379 *(intptr_t*)(top) = _number_of_entries;
iklam@46746 380 top += sizeof(intptr_t);
duke@1 381
iklam@46746 382 _buckets = (HashtableBucket<F>*)memcpy(top, (void*)_buckets, len);
iklam@46746 383 top += len;
iklam@46746 384
iklam@46746 385 assert(top == end, "count_bytes_for_buckets is wrong");
duke@1 386 }
duke@1 387
duke@1 388 #ifndef PRODUCT
coleenp@50313 389 template <class T> void print_literal(T l) {
coleenp@50313 390 l->print();
coleenp@50313 391 }
coleenp@50313 392
coleenp@50313 393 static void print_literal(ClassLoaderWeakHandle l) {
coleenp@50313 394 l.print();
coleenp@50313 395 }
duke@1 396
zgu@13195 397 template <class T, MEMFLAGS F> void Hashtable<T, F>::print() {
duke@1 398 ResourceMark rm;
duke@1 399
zgu@13195 400 for (int i = 0; i < BasicHashtable<F>::table_size(); i++) {
zgu@13195 401 HashtableEntry<T, F>* entry = bucket(i);
duke@1 402 while(entry != NULL) {
duke@1 403 tty->print("%d : ", i);
coleenp@50313 404 print_literal(entry->literal());
duke@1 405 tty->cr();
duke@1 406 entry = entry->next();
duke@1 407 }
duke@1 408 }
duke@1 409 }
duke@1 410
coleenp@46475 411 template <MEMFLAGS F>
coleenp@46475 412 template <class T> void BasicHashtable<F>::verify_table(const char* table_name) {
coleenp@46475 413 int element_count = 0;
coleenp@46475 414 int max_bucket_count = 0;
coleenp@46545 415 int max_bucket_number = 0;
coleenp@46475 416 for (int index = 0; index < table_size(); index++) {
coleenp@46475 417 int bucket_count = 0;
coleenp@46475 418 for (T* probe = (T*)bucket(index); probe != NULL; probe = probe->next()) {
coleenp@46475 419 probe->verify();
coleenp@46475 420 bucket_count++;
duke@1 421 }
coleenp@46475 422 element_count += bucket_count;
coleenp@46545 423 if (bucket_count > max_bucket_count) {
coleenp@46545 424 max_bucket_count = bucket_count;
coleenp@46545 425 max_bucket_number = index;
coleenp@46545 426 }
duke@1 427 }
coleenp@46475 428 guarantee(number_of_entries() == element_count,
coleenp@46475 429 "Verify of %s failed", table_name);
coleenp@46545 430
coleenp@46545 431 // Log some statistics about the hashtable
coleenp@46545 432 log_info(hashtables)("%s max bucket size %d bucket %d element count %d table size %d", table_name,
coleenp@46545 433 max_bucket_count, max_bucket_number, _number_of_entries, _table_size);
coleenp@46545 434 if (_number_of_entries > 0 && log_is_enabled(Debug, hashtables)) {
coleenp@46545 435 for (int index = 0; index < table_size(); index++) {
coleenp@46545 436 int bucket_count = 0;
coleenp@46545 437 for (T* probe = (T*)bucket(index); probe != NULL; probe = probe->next()) {
coleenp@46545 438 log_debug(hashtables)("bucket %d hash " INTPTR_FORMAT, index, (intptr_t)probe->hash());
coleenp@46545 439 bucket_count++;
coleenp@46545 440 }
coleenp@46545 441 if (bucket_count > 0) {
coleenp@46545 442 log_debug(hashtables)("bucket %d count %d", index, bucket_count);
coleenp@46545 443 }
coleenp@46545 444 }
coleenp@46545 445 }
duke@1 446 }
duke@1 447 #endif // PRODUCT
duke@1 448
coleenp@8076 449 // Explicitly instantiate these types
mgerdin@26422 450 #if INCLUDE_ALL_GCS
mgerdin@26422 451 template class Hashtable<nmethod*, mtGC>;
mgerdin@26422 452 template class HashtableEntry<nmethod*, mtGC>;
mgerdin@26422 453 template class BasicHashtable<mtGC>;
mgerdin@26422 454 #endif
coleenp@13728 455 template class Hashtable<ConstantPool*, mtClass>;
mgerdin@26421 456 template class RehashableHashtable<Symbol*, mtSymbol>;
coleenp@50313 457 template class RehashableHashtable<oop, mtSymbol>;
zgu@13195 458 template class Hashtable<Symbol*, mtSymbol>;
coleenp@13728 459 template class Hashtable<Klass*, mtClass>;
iklam@34257 460 template class Hashtable<InstanceKlass*, mtClass>;
coleenp@50313 461 template class Hashtable<ClassLoaderWeakHandle, mtClass>;
coleenp@46729 462 template class Hashtable<Symbol*, mtModule>;
zgu@13195 463 template class Hashtable<oop, mtSymbol>;
coleenp@50313 464 template class Hashtable<ClassLoaderWeakHandle, mtSymbol>;
zgu@13195 465 template class Hashtable<Symbol*, mtClass>;
zgu@13195 466 template class HashtableEntry<Symbol*, mtSymbol>;
zgu@13195 467 template class HashtableEntry<Symbol*, mtClass>;
zgu@13195 468 template class HashtableEntry<oop, mtSymbol>;
coleenp@50313 469 template class HashtableEntry<ClassLoaderWeakHandle, mtSymbol>;
iklam@46746 470 template class HashtableBucket<mtClass>;
zgu@13195 471 template class BasicHashtableEntry<mtSymbol>;
zgu@13195 472 template class BasicHashtableEntry<mtCode>;
zgu@13195 473 template class BasicHashtable<mtClass>;
iklam@34257 474 template class BasicHashtable<mtClassShared>;
zgu@13195 475 template class BasicHashtable<mtSymbol>;
zgu@13195 476 template class BasicHashtable<mtCode>;
zgu@13195 477 template class BasicHashtable<mtInternal>;
hseigel@38733 478 template class BasicHashtable<mtModule>;
mgronlun@36384 479 #if INCLUDE_TRACE
mgronlun@36384 480 template class Hashtable<Symbol*, mtTracing>;
mgronlun@36384 481 template class HashtableEntry<Symbol*, mtTracing>;
mgronlun@36384 482 template class BasicHashtable<mtTracing>;
mgronlun@36384 483 #endif
kvn@30593 484 template class BasicHashtable<mtCompiler>;
coleenp@46475 485
coleenp@46475 486 template void BasicHashtable<mtClass>::verify_table<DictionaryEntry>(char const*);
coleenp@46475 487 template void BasicHashtable<mtModule>::verify_table<ModuleEntry>(char const*);
coleenp@46475 488 template void BasicHashtable<mtModule>::verify_table<PackageEntry>(char const*);
coleenp@46475 489 template void BasicHashtable<mtClass>::verify_table<ProtectionDomainCacheEntry>(char const*);
coleenp@46545 490 template void BasicHashtable<mtClass>::verify_table<PlaceholderEntry>(char const*);