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