author | coleenp |
Thu, 18 May 2017 08:17:52 -0400 | |
changeset 46475 | 75902cea18af |
parent 46435 | 3f6cac9867d4 |
child 46488 | 01c282163d38 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
44897 | 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:
1
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1
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:
1
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#ifndef SHARE_VM_UTILITIES_HASHTABLE_HPP |
26 |
#define SHARE_VM_UTILITIES_HASHTABLE_HPP |
|
27 |
||
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
13342
diff
changeset
|
28 |
#include "classfile/classLoaderData.hpp" |
7397 | 29 |
#include "memory/allocation.hpp" |
30 |
#include "oops/oop.hpp" |
|
8076
96d498ec7ae1
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
7397
diff
changeset
|
31 |
#include "oops/symbol.hpp" |
7397 | 32 |
#include "runtime/handles.hpp" |
33 |
||
1 | 34 |
// This is a generic hashtable, designed to be used for the symbol |
35 |
// and string tables. |
|
36 |
// |
|
37 |
// It is implemented as an open hash table with a fixed number of buckets. |
|
38 |
// |
|
39 |
// %note: |
|
40 |
// - TableEntrys are allocated in blocks to reduce the space overhead. |
|
41 |
||
42 |
||
43 |
||
13195 | 44 |
template <MEMFLAGS F> class BasicHashtableEntry : public CHeapObj<F> { |
1 | 45 |
friend class VMStructs; |
46 |
private: |
|
47 |
unsigned int _hash; // 32-bit hash for item |
|
48 |
||
49 |
// Link to next element in the linked list for this bucket. EXCEPT |
|
50 |
// bit 0 set indicates that this entry is shared and must not be |
|
51 |
// unlinked from the table. Bit 0 is set during the dumping of the |
|
52 |
// archive. Since shared entries are immutable, _next fields in the |
|
53 |
// shared entries will not change. New entries will always be |
|
54 |
// unshared and since pointers are align, bit 0 will always remain 0 |
|
55 |
// with no extra effort. |
|
13195 | 56 |
BasicHashtableEntry<F>* _next; |
1 | 57 |
|
58 |
// Windows IA64 compiler requires subclasses to be able to access these |
|
59 |
protected: |
|
60 |
// Entry objects should not be created, they should be taken from the |
|
61 |
// free list with BasicHashtable.new_entry(). |
|
62 |
BasicHashtableEntry() { ShouldNotReachHere(); } |
|
63 |
// Entry objects should not be destroyed. They should be placed on |
|
64 |
// the free list instead with BasicHashtable.free_entry(). |
|
65 |
~BasicHashtableEntry() { ShouldNotReachHere(); } |
|
66 |
||
67 |
public: |
|
68 |
||
69 |
unsigned int hash() const { return _hash; } |
|
70 |
void set_hash(unsigned int hash) { _hash = hash; } |
|
71 |
unsigned int* hash_addr() { return &_hash; } |
|
72 |
||
13195 | 73 |
static BasicHashtableEntry<F>* make_ptr(BasicHashtableEntry<F>* p) { |
1 | 74 |
return (BasicHashtableEntry*)((intptr_t)p & -2); |
75 |
} |
|
76 |
||
13195 | 77 |
BasicHashtableEntry<F>* next() const { |
1 | 78 |
return make_ptr(_next); |
79 |
} |
|
80 |
||
13195 | 81 |
void set_next(BasicHashtableEntry<F>* next) { |
1 | 82 |
_next = next; |
83 |
} |
|
84 |
||
13195 | 85 |
BasicHashtableEntry<F>** next_addr() { |
1 | 86 |
return &_next; |
87 |
} |
|
88 |
||
89 |
bool is_shared() const { |
|
90 |
return ((intptr_t)_next & 1) != 0; |
|
91 |
} |
|
92 |
||
93 |
void set_shared() { |
|
13195 | 94 |
_next = (BasicHashtableEntry<F>*)((intptr_t)_next | 1); |
1 | 95 |
} |
96 |
}; |
|
97 |
||
98 |
||
99 |
||
13195 | 100 |
template <class T, MEMFLAGS F> class HashtableEntry : public BasicHashtableEntry<F> { |
1 | 101 |
friend class VMStructs; |
102 |
private: |
|
8076
96d498ec7ae1
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
7397
diff
changeset
|
103 |
T _literal; // ref to item in table. |
1 | 104 |
|
105 |
public: |
|
106 |
// Literal |
|
8076
96d498ec7ae1
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
7397
diff
changeset
|
107 |
T literal() const { return _literal; } |
96d498ec7ae1
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
7397
diff
changeset
|
108 |
T* literal_addr() { return &_literal; } |
96d498ec7ae1
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
7397
diff
changeset
|
109 |
void set_literal(T s) { _literal = s; } |
1 | 110 |
|
111 |
HashtableEntry* next() const { |
|
13195 | 112 |
return (HashtableEntry*)BasicHashtableEntry<F>::next(); |
1 | 113 |
} |
114 |
HashtableEntry** next_addr() { |
|
13195 | 115 |
return (HashtableEntry**)BasicHashtableEntry<F>::next_addr(); |
1 | 116 |
} |
117 |
}; |
|
118 |
||
119 |
||
120 |
||
13195 | 121 |
template <MEMFLAGS F> class HashtableBucket : public CHeapObj<F> { |
1 | 122 |
friend class VMStructs; |
123 |
private: |
|
124 |
// Instance variable |
|
13195 | 125 |
BasicHashtableEntry<F>* _entry; |
1 | 126 |
|
127 |
public: |
|
128 |
// Accessing |
|
46475
75902cea18af
8166848: Performance bug: SystemDictionary - optimization
coleenp
parents:
46435
diff
changeset
|
129 |
void clear() { _entry = NULL; } |
1 | 130 |
|
131 |
// The following methods use order access methods to avoid race |
|
132 |
// conditions in multiprocessor systems. |
|
13195 | 133 |
BasicHashtableEntry<F>* get_entry() const; |
134 |
void set_entry(BasicHashtableEntry<F>* l); |
|
1 | 135 |
|
136 |
// The following method is not MT-safe and must be done under lock. |
|
13195 | 137 |
BasicHashtableEntry<F>** entry_addr() { return &_entry; } |
39982
1a3808e3f4d9
8138760: [JVMCI] VM warning: Performance bug: SystemDictionary lookup_count=21831450 lookup_length=1275207287 average=58.411479 load=5.572844
gziemski
parents:
34666
diff
changeset
|
138 |
|
1 | 139 |
}; |
140 |
||
141 |
||
13195 | 142 |
template <MEMFLAGS F> class BasicHashtable : public CHeapObj<F> { |
1 | 143 |
friend class VMStructs; |
144 |
||
145 |
public: |
|
146 |
BasicHashtable(int table_size, int entry_size); |
|
147 |
BasicHashtable(int table_size, int entry_size, |
|
13195 | 148 |
HashtableBucket<F>* buckets, int number_of_entries); |
1 | 149 |
|
150 |
// Sharing support. |
|
151 |
void copy_buckets(char** top, char* end); |
|
152 |
void copy_table(char** top, char* end); |
|
153 |
||
154 |
// Bucket handling |
|
34666 | 155 |
int hash_to_index(unsigned int full_hash) const { |
1 | 156 |
int h = full_hash % _table_size; |
157 |
assert(h >= 0 && h < _table_size, "Illegal hash value"); |
|
158 |
return h; |
|
159 |
} |
|
160 |
||
161 |
private: |
|
162 |
// Instance variables |
|
163 |
int _table_size; |
|
13195 | 164 |
HashtableBucket<F>* _buckets; |
165 |
BasicHashtableEntry<F>* _free_list; |
|
1 | 166 |
char* _first_free_entry; |
167 |
char* _end_block; |
|
168 |
int _entry_size; |
|
169 |
int _number_of_entries; |
|
170 |
||
171 |
protected: |
|
172 |
||
173 |
#ifdef ASSERT |
|
46475
75902cea18af
8166848: Performance bug: SystemDictionary - optimization
coleenp
parents:
46435
diff
changeset
|
174 |
void verify_lookup_length(int max_bucket_count, const char *table_name); |
1 | 175 |
#endif |
176 |
||
177 |
void initialize(int table_size, int entry_size, int number_of_entries); |
|
178 |
||
179 |
// Accessor |
|
180 |
int entry_size() const { return _entry_size; } |
|
181 |
||
182 |
// The following method is MT-safe and may be used with caution. |
|
34666 | 183 |
BasicHashtableEntry<F>* bucket(int i) const; |
1 | 184 |
|
185 |
// The following method is not MT-safe and must be done under lock. |
|
13195 | 186 |
BasicHashtableEntry<F>** bucket_addr(int i) { return _buckets[i].entry_addr(); } |
1 | 187 |
|
26421
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
188 |
// Attempt to get an entry from the free list |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
189 |
BasicHashtableEntry<F>* new_entry_free_list(); |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
190 |
|
1 | 191 |
// Table entry management |
13195 | 192 |
BasicHashtableEntry<F>* new_entry(unsigned int hashValue); |
1 | 193 |
|
13087 | 194 |
// Used when moving the entry to another table |
195 |
// Clean up links, but do not add to free_list |
|
13195 | 196 |
void unlink_entry(BasicHashtableEntry<F>* entry) { |
13087 | 197 |
entry->set_next(NULL); |
198 |
--_number_of_entries; |
|
199 |
} |
|
200 |
||
201 |
// Move over freelist and free block for allocation |
|
202 |
void copy_freelist(BasicHashtable* src) { |
|
203 |
_free_list = src->_free_list; |
|
204 |
src->_free_list = NULL; |
|
205 |
_first_free_entry = src->_first_free_entry; |
|
206 |
src->_first_free_entry = NULL; |
|
207 |
_end_block = src->_end_block; |
|
208 |
src->_end_block = NULL; |
|
209 |
} |
|
210 |
||
211 |
// Free the buckets in this hashtable |
|
13097
c146b608d91f
7178670: runtime/7158800/BadUtf8.java fails in SymbolTable::rehash_table
coleenp
parents:
13087
diff
changeset
|
212 |
void free_buckets(); |
13087 | 213 |
|
1 | 214 |
public: |
11628
13155c0c00b4
7114376: Make system dictionary hashtable bucket array size configurable
acorn
parents:
8921
diff
changeset
|
215 |
int table_size() { return _table_size; } |
13195 | 216 |
void set_entry(int index, BasicHashtableEntry<F>* entry); |
1 | 217 |
|
13195 | 218 |
void add_entry(int index, BasicHashtableEntry<F>* entry); |
1 | 219 |
|
13195 | 220 |
void free_entry(BasicHashtableEntry<F>* entry); |
1 | 221 |
|
222 |
int number_of_entries() { return _number_of_entries; } |
|
223 |
||
46475
75902cea18af
8166848: Performance bug: SystemDictionary - optimization
coleenp
parents:
46435
diff
changeset
|
224 |
template <class T> void verify_table(const char* table_name) PRODUCT_RETURN; |
1 | 225 |
}; |
226 |
||
227 |
||
13195 | 228 |
template <class T, MEMFLAGS F> class Hashtable : public BasicHashtable<F> { |
1 | 229 |
friend class VMStructs; |
230 |
||
231 |
public: |
|
232 |
Hashtable(int table_size, int entry_size) |
|
13195 | 233 |
: BasicHashtable<F>(table_size, entry_size) { } |
1 | 234 |
|
235 |
Hashtable(int table_size, int entry_size, |
|
13195 | 236 |
HashtableBucket<F>* buckets, int number_of_entries) |
237 |
: BasicHashtable<F>(table_size, entry_size, buckets, number_of_entries) { } |
|
1 | 238 |
|
239 |
// Debugging |
|
240 |
void print() PRODUCT_RETURN; |
|
241 |
||
242 |
protected: |
|
243 |
||
8076
96d498ec7ae1
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
7397
diff
changeset
|
244 |
unsigned int compute_hash(Symbol* name) { |
1 | 245 |
return (unsigned int) name->identity_hash(); |
246 |
} |
|
247 |
||
8076
96d498ec7ae1
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
7397
diff
changeset
|
248 |
int index_for(Symbol* name) { |
13342
76a5de64aa62
7186278: Build error after CR#6995781 / 7151532 with GCC 4.7.0
andrew
parents:
13199
diff
changeset
|
249 |
return this->hash_to_index(compute_hash(name)); |
1 | 250 |
} |
251 |
||
252 |
// Table entry management |
|
13195 | 253 |
HashtableEntry<T, F>* new_entry(unsigned int hashValue, T obj); |
1 | 254 |
|
255 |
// The following method is MT-safe and may be used with caution. |
|
34666 | 256 |
HashtableEntry<T, F>* bucket(int i) const { |
13195 | 257 |
return (HashtableEntry<T, F>*)BasicHashtable<F>::bucket(i); |
1 | 258 |
} |
259 |
||
260 |
// The following method is not MT-safe and must be done under lock. |
|
13195 | 261 |
HashtableEntry<T, F>** bucket_addr(int i) { |
262 |
return (HashtableEntry<T, F>**)BasicHashtable<F>::bucket_addr(i); |
|
1 | 263 |
} |
13087 | 264 |
|
26421
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
265 |
}; |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
266 |
|
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
267 |
template <class T, MEMFLAGS F> class RehashableHashtable : public Hashtable<T, F> { |
44897 | 268 |
friend class VMStructs; |
26421
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
269 |
protected: |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
270 |
|
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
271 |
enum { |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
272 |
rehash_count = 100, |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
273 |
rehash_multiple = 60 |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
274 |
}; |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
275 |
|
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
276 |
// Check that the table is unbalanced |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
277 |
bool check_rehash_table(int count); |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
278 |
|
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
279 |
public: |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
280 |
RehashableHashtable(int table_size, int entry_size) |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
281 |
: Hashtable<T, F>(table_size, entry_size) { } |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
282 |
|
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
283 |
RehashableHashtable(int table_size, int entry_size, |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
284 |
HashtableBucket<F>* buckets, int number_of_entries) |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
285 |
: Hashtable<T, F>(table_size, entry_size, buckets, number_of_entries) { } |
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
286 |
|
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
287 |
|
13087 | 288 |
// Function to move these elements into the new table. |
26421
37d88e604ad0
8056084: Refactor Hashtable to allow implementations without rehashing support
mgerdin
parents:
23187
diff
changeset
|
289 |
void move_to(RehashableHashtable<T, F>* new_table); |
13199
025b0984feea
7181200: JVM new hashing code breaks SA in product mode
coleenp
parents:
13195
diff
changeset
|
290 |
static bool use_alternate_hashcode() { return _seed != 0; } |
22757
b2cbb3680b4f
8033792: AltHashing used jint for imprecise bit shifting
minqi
parents:
22234
diff
changeset
|
291 |
static juint seed() { return _seed; } |
13199
025b0984feea
7181200: JVM new hashing code breaks SA in product mode
coleenp
parents:
13195
diff
changeset
|
292 |
|
17610
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
293 |
static int literal_size(Symbol *symbol); |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
294 |
static int literal_size(oop oop); |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
295 |
|
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
296 |
// The following two are currently not used, but are needed anyway because some |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
297 |
// C++ compilers (MacOS and Solaris) force the instantiation of |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
298 |
// Hashtable<ConstantPool*, mtClass>::dump_table() even though we never call this function |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
299 |
// in the VM code. |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
300 |
static int literal_size(ConstantPool *cp) {Unimplemented(); return 0;} |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
301 |
static int literal_size(Klass *k) {Unimplemented(); return 0;} |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
302 |
|
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
303 |
void dump_table(outputStream* st, const char *table_name); |
c6857feaac47
8014262: PrintStringTableStatistics should include more footprint info
iklam
parents:
13728
diff
changeset
|
304 |
|
13199
025b0984feea
7181200: JVM new hashing code breaks SA in product mode
coleenp
parents:
13195
diff
changeset
|
305 |
private: |
22757
b2cbb3680b4f
8033792: AltHashing used jint for imprecise bit shifting
minqi
parents:
22234
diff
changeset
|
306 |
static juint _seed; |
1 | 307 |
}; |
308 |
||
309 |
||
22921
ee35d5c0b1dc
8034839: jvm hangs with gc/gctests/LoadUnloadGC test
anoll
parents:
22757
diff
changeset
|
310 |
// Versions of hashtable where two handles are used to compute the index. |
1 | 311 |
|
13195 | 312 |
template <class T, MEMFLAGS F> class TwoOopHashtable : public Hashtable<T, F> { |
1 | 313 |
friend class VMStructs; |
314 |
protected: |
|
315 |
TwoOopHashtable(int table_size, int entry_size) |
|
13195 | 316 |
: Hashtable<T, F>(table_size, entry_size) {} |
1 | 317 |
|
13195 | 318 |
TwoOopHashtable(int table_size, int entry_size, HashtableBucket<F>* t, |
1 | 319 |
int number_of_entries) |
13195 | 320 |
: Hashtable<T, F>(table_size, entry_size, t, number_of_entries) {} |
1 | 321 |
|
322 |
public: |
|
34666 | 323 |
unsigned int compute_hash(const Symbol* name, const ClassLoaderData* loader_data) const { |
1 | 324 |
unsigned int name_hash = name->identity_hash(); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
13342
diff
changeset
|
325 |
// loader is null with CDS |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
13342
diff
changeset
|
326 |
assert(loader_data != NULL || UseSharedSpaces || DumpSharedSpaces, |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
13342
diff
changeset
|
327 |
"only allowed with shared spaces"); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
13342
diff
changeset
|
328 |
unsigned int loader_hash = loader_data == NULL ? 0 : loader_data->identity_hash(); |
1 | 329 |
return name_hash ^ loader_hash; |
330 |
} |
|
331 |
||
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
13342
diff
changeset
|
332 |
int index_for(Symbol* name, ClassLoaderData* loader_data) { |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
13342
diff
changeset
|
333 |
return this->hash_to_index(compute_hash(name, loader_data)); |
1 | 334 |
} |
335 |
}; |
|
7397 | 336 |
|
337 |
#endif // SHARE_VM_UTILITIES_HASHTABLE_HPP |