Mon, 24 Dec 2012 11:46:38 -0800
Merge
1 /*
2 * Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #ifndef SHARE_VM_CLASSFILE_DICTIONARY_HPP
26 #define SHARE_VM_CLASSFILE_DICTIONARY_HPP
28 #include "classfile/systemDictionary.hpp"
29 #include "oops/instanceKlass.hpp"
30 #include "oops/oop.hpp"
31 #include "utilities/hashtable.hpp"
33 class DictionaryEntry;
34 class PSPromotionManager;
36 //~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
37 // The data structure for the system dictionary (and the shared system
38 // dictionary).
40 class Dictionary : public TwoOopHashtable<Klass*, mtClass> {
41 friend class VMStructs;
42 private:
43 // current iteration index.
44 static int _current_class_index;
45 // pointer to the current hash table entry.
46 static DictionaryEntry* _current_class_entry;
48 DictionaryEntry* get_entry(int index, unsigned int hash,
49 Symbol* name, ClassLoaderData* loader_data);
51 DictionaryEntry* bucket(int i) {
52 return (DictionaryEntry*)Hashtable<Klass*, mtClass>::bucket(i);
53 }
55 // The following method is not MT-safe and must be done under lock.
56 DictionaryEntry** bucket_addr(int i) {
57 return (DictionaryEntry**)Hashtable<Klass*, mtClass>::bucket_addr(i);
58 }
60 void add_entry(int index, DictionaryEntry* new_entry) {
61 Hashtable<Klass*, mtClass>::add_entry(index, (HashtableEntry<Klass*, mtClass>*)new_entry);
62 }
64 public:
65 Dictionary(int table_size);
66 Dictionary(int table_size, HashtableBucket<mtClass>* t, int number_of_entries);
68 DictionaryEntry* new_entry(unsigned int hash, Klass* klass, ClassLoaderData* loader_data);
70 DictionaryEntry* new_entry();
72 void free_entry(DictionaryEntry* entry);
74 void add_klass(Symbol* class_name, ClassLoaderData* loader_data,KlassHandle obj);
76 Klass* find_class(int index, unsigned int hash,
77 Symbol* name, ClassLoaderData* loader_data);
79 Klass* find_shared_class(int index, unsigned int hash, Symbol* name);
81 // Compiler support
82 Klass* try_get_next_class();
84 // GC support
85 void oops_do(OopClosure* f);
86 void always_strong_oops_do(OopClosure* blk);
88 void always_strong_classes_do(KlassClosure* closure);
90 void classes_do(void f(Klass*));
91 void classes_do(void f(Klass*, TRAPS), TRAPS);
92 void classes_do(void f(Klass*, ClassLoaderData*));
93 void classes_do(void f(Klass*, ClassLoaderData*, TRAPS), TRAPS);
95 void methods_do(void f(Method*));
98 // Classes loaded by the bootstrap loader are always strongly reachable.
99 // If we're not doing class unloading, all classes are strongly reachable.
100 static bool is_strongly_reachable(ClassLoaderData* loader_data, Klass* klass) {
101 assert (klass != NULL, "should have non-null klass");
102 return (loader_data->is_the_null_class_loader_data() || !ClassUnloading);
103 }
105 // Unload (that is, break root links to) all unmarked classes and
106 // loaders. Returns "true" iff something was unloaded.
107 bool do_unloading();
109 // Protection domains
110 Klass* find(int index, unsigned int hash, Symbol* name,
111 ClassLoaderData* loader_data, Handle protection_domain, TRAPS);
112 bool is_valid_protection_domain(int index, unsigned int hash,
113 Symbol* name, ClassLoaderData* loader_data,
114 Handle protection_domain);
115 void add_protection_domain(int index, unsigned int hash,
116 instanceKlassHandle klass, ClassLoaderData* loader_data,
117 Handle protection_domain, TRAPS);
119 // Sharing support
120 void reorder_dictionary();
123 #ifndef PRODUCT
124 void print();
125 #endif
126 void verify();
127 };
129 // The following classes can be in dictionary.cpp, but we need these
130 // to be in header file so that SA's vmStructs can access.
132 class ProtectionDomainEntry :public CHeapObj<mtClass> {
133 friend class VMStructs;
134 public:
135 ProtectionDomainEntry* _next;
136 oop _protection_domain;
138 ProtectionDomainEntry(oop protection_domain, ProtectionDomainEntry* next) {
139 _protection_domain = protection_domain;
140 _next = next;
141 }
143 ProtectionDomainEntry* next() { return _next; }
144 oop protection_domain() { return _protection_domain; }
145 };
147 // An entry in the system dictionary, this describes a class as
148 // { Klass*, loader, protection_domain }.
150 class DictionaryEntry : public HashtableEntry<Klass*, mtClass> {
151 friend class VMStructs;
152 private:
153 // Contains the set of approved protection domains that can access
154 // this system dictionary entry.
155 ProtectionDomainEntry* _pd_set;
156 ClassLoaderData* _loader_data;
158 public:
159 // Tells whether a protection is in the approved set.
160 bool contains_protection_domain(oop protection_domain) const;
161 // Adds a protection domain to the approved set.
162 void add_protection_domain(oop protection_domain);
164 Klass* klass() const { return (Klass*)literal(); }
165 Klass** klass_addr() { return (Klass**)literal_addr(); }
167 DictionaryEntry* next() const {
168 return (DictionaryEntry*)HashtableEntry<Klass*, mtClass>::next();
169 }
171 DictionaryEntry** next_addr() {
172 return (DictionaryEntry**)HashtableEntry<Klass*, mtClass>::next_addr();
173 }
175 ClassLoaderData* loader_data() const { return _loader_data; }
176 void set_loader_data(ClassLoaderData* loader_data) { _loader_data = loader_data; }
178 ProtectionDomainEntry* pd_set() const { return _pd_set; }
179 void set_pd_set(ProtectionDomainEntry* pd_set) { _pd_set = pd_set; }
181 bool has_protection_domain() { return _pd_set != NULL; }
183 // Tells whether the initiating class' protection can access the this _klass
184 bool is_valid_protection_domain(Handle protection_domain) {
185 if (!ProtectionDomainVerification) return true;
186 if (!SystemDictionary::has_checkPackageAccess()) return true;
188 return protection_domain() == NULL
189 ? true
190 : contains_protection_domain(protection_domain());
191 }
194 void protection_domain_set_oops_do(OopClosure* f) {
195 for (ProtectionDomainEntry* current = _pd_set;
196 current != NULL;
197 current = current->_next) {
198 f->do_oop(&(current->_protection_domain));
199 }
200 }
202 void verify_protection_domain_set() {
203 for (ProtectionDomainEntry* current = _pd_set;
204 current != NULL;
205 current = current->_next) {
206 current->_protection_domain->verify();
207 }
208 }
210 bool equals(Symbol* class_name, ClassLoaderData* loader_data) const {
211 Klass* klass = (Klass*)literal();
212 return (InstanceKlass::cast(klass)->name() == class_name &&
213 _loader_data == loader_data);
214 }
216 void print() {
217 int count = 0;
218 for (ProtectionDomainEntry* current = _pd_set;
219 current != NULL;
220 current = current->_next) {
221 count++;
222 }
223 tty->print_cr("pd set = #%d", count);
224 }
225 };
227 // Entry in a SymbolPropertyTable, mapping a single Symbol*
228 // to a managed and an unmanaged pointer.
229 class SymbolPropertyEntry : public HashtableEntry<Symbol*, mtSymbol> {
230 friend class VMStructs;
231 private:
232 intptr_t _symbol_mode; // secondary key
233 Method* _method;
234 oop _method_type;
236 public:
237 Symbol* symbol() const { return literal(); }
239 intptr_t symbol_mode() const { return _symbol_mode; }
240 void set_symbol_mode(intptr_t m) { _symbol_mode = m; }
242 Method* method() const { return _method; }
243 void set_method(Method* p) { _method = p; }
245 oop method_type() const { return _method_type; }
246 oop* method_type_addr() { return &_method_type; }
247 void set_method_type(oop p) { _method_type = p; }
249 SymbolPropertyEntry* next() const {
250 return (SymbolPropertyEntry*)HashtableEntry<Symbol*, mtSymbol>::next();
251 }
253 SymbolPropertyEntry** next_addr() {
254 return (SymbolPropertyEntry**)HashtableEntry<Symbol*, mtSymbol>::next_addr();
255 }
257 void print_on(outputStream* st) const {
258 symbol()->print_value_on(st);
259 st->print("/mode="INTX_FORMAT, symbol_mode());
260 st->print(" -> ");
261 bool printed = false;
262 if (method() != NULL) {
263 method()->print_value_on(st);
264 printed = true;
265 }
266 if (method_type() != NULL) {
267 if (printed) st->print(" and ");
268 st->print(INTPTR_FORMAT, method_type());
269 printed = true;
270 }
271 st->print_cr(printed ? "" : "(empty)");
272 }
273 };
275 // A system-internal mapping of symbols to pointers, both managed
276 // and unmanaged. Used to record the auto-generation of each method
277 // MethodHandle.invoke(S)T, for all signatures (S)T.
278 class SymbolPropertyTable : public Hashtable<Symbol*, mtSymbol> {
279 friend class VMStructs;
280 private:
281 SymbolPropertyEntry* bucket(int i) {
282 return (SymbolPropertyEntry*) Hashtable<Symbol*, mtSymbol>::bucket(i);
283 }
285 // The following method is not MT-safe and must be done under lock.
286 SymbolPropertyEntry** bucket_addr(int i) {
287 return (SymbolPropertyEntry**) Hashtable<Symbol*, mtSymbol>::bucket_addr(i);
288 }
290 void add_entry(int index, SymbolPropertyEntry* new_entry) {
291 ShouldNotReachHere();
292 }
293 void set_entry(int index, SymbolPropertyEntry* new_entry) {
294 ShouldNotReachHere();
295 }
297 SymbolPropertyEntry* new_entry(unsigned int hash, Symbol* symbol, intptr_t symbol_mode) {
298 SymbolPropertyEntry* entry = (SymbolPropertyEntry*) Hashtable<Symbol*, mtSymbol>::new_entry(hash, symbol);
299 // Hashtable with Symbol* literal must increment and decrement refcount.
300 symbol->increment_refcount();
301 entry->set_symbol_mode(symbol_mode);
302 entry->set_method(NULL);
303 entry->set_method_type(NULL);
304 return entry;
305 }
307 public:
308 SymbolPropertyTable(int table_size);
309 SymbolPropertyTable(int table_size, HashtableBucket<mtSymbol>* t, int number_of_entries);
311 void free_entry(SymbolPropertyEntry* entry) {
312 // decrement Symbol refcount here because hashtable doesn't.
313 entry->literal()->decrement_refcount();
314 Hashtable<Symbol*, mtSymbol>::free_entry(entry);
315 }
317 unsigned int compute_hash(Symbol* sym, intptr_t symbol_mode) {
318 // Use the regular identity_hash.
319 return Hashtable<Symbol*, mtSymbol>::compute_hash(sym) ^ symbol_mode;
320 }
322 int index_for(Symbol* name, intptr_t symbol_mode) {
323 return hash_to_index(compute_hash(name, symbol_mode));
324 }
326 // need not be locked; no state change
327 SymbolPropertyEntry* find_entry(int index, unsigned int hash, Symbol* name, intptr_t name_mode);
329 // must be done under SystemDictionary_lock
330 SymbolPropertyEntry* add_entry(int index, unsigned int hash, Symbol* name, intptr_t name_mode);
332 // GC support
333 void oops_do(OopClosure* f);
335 void methods_do(void f(Method*));
337 // Sharing support
338 void reorder_dictionary();
340 #ifndef PRODUCT
341 void print();
342 #endif
343 void verify();
344 };
345 #endif // SHARE_VM_CLASSFILE_DICTIONARY_HPP