1 /*
2 * Copyright (c) 2003, 2016, 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 */
24
25 #include "precompiled.hpp"
26 #include "classfile/classLoaderData.inline.hpp"
27 #include "classfile/sharedClassUtil.hpp"
28 #include "classfile/dictionary.hpp"
29 #include "classfile/systemDictionary.hpp"
30 #include "classfile/systemDictionaryShared.hpp"
31 #include "memory/iterator.hpp"
32 #include "oops/oop.inline.hpp"
33 #include "prims/jvmtiRedefineClassesTrace.hpp"
34 #include "runtime/orderAccess.inline.hpp"
35 #include "utilities/hashtable.inline.hpp"
36
37 DictionaryEntry* Dictionary::_current_class_entry = NULL;
38 int Dictionary::_current_class_index = 0;
39
40 size_t Dictionary::entry_size() {
41 if (DumpSharedSpaces) {
42 return SystemDictionaryShared::dictionary_entry_size();
43 } else {
44 return sizeof(DictionaryEntry);
45 }
46 }
47
48 Dictionary::Dictionary(int table_size)
49 : TwoOopHashtable<Klass*, mtClass>(table_size, (int)entry_size()) {
50 _current_class_index = 0;
51 _current_class_entry = NULL;
52 _pd_cache_table = new ProtectionDomainCacheTable(defaultProtectionDomainCacheSize);
53 };
54
55
56 Dictionary::Dictionary(int table_size, HashtableBucket<mtClass>* t,
57 int number_of_entries)
58 : TwoOopHashtable<Klass*, mtClass>(table_size, (int)entry_size(), t, number_of_entries) {
59 _current_class_index = 0;
60 _current_class_entry = NULL;
61 _pd_cache_table = new ProtectionDomainCacheTable(defaultProtectionDomainCacheSize);
62 };
63
64 ProtectionDomainCacheEntry* Dictionary::cache_get(oop protection_domain) {
65 return _pd_cache_table->get(protection_domain);
66 }
67
68 DictionaryEntry* Dictionary::new_entry(unsigned int hash, Klass* klass,
69 ClassLoaderData* loader_data) {
70 DictionaryEntry* entry = (DictionaryEntry*)Hashtable<Klass*, mtClass>::new_entry(hash, klass);
71 entry->set_loader_data(loader_data);
72 entry->set_pd_set(NULL);
73 assert(klass->is_instance_klass(), "Must be");
74 if (DumpSharedSpaces) {
75 SystemDictionaryShared::init_shared_dictionary_entry(klass, entry);
76 }
77 return entry;
78 }
79
80
81 void Dictionary::free_entry(DictionaryEntry* entry) {
82 // avoid recursion when deleting linked list
83 while (entry->pd_set() != NULL) {
84 ProtectionDomainEntry* to_delete = entry->pd_set();
85 entry->set_pd_set(to_delete->next());
86 delete to_delete;
87 }
88 Hashtable<Klass*, mtClass>::free_entry(entry);
89 }
90
91
92 bool DictionaryEntry::contains_protection_domain(oop protection_domain) const {
93 #ifdef ASSERT
94 if (protection_domain == klass()->protection_domain()) {
95 // Ensure this doesn't show up in the pd_set (invariant)
96 bool in_pd_set = false;
97 for (ProtectionDomainEntry* current = _pd_set;
98 current != NULL;
99 current = current->next()) {
100 if (current->protection_domain() == protection_domain) {
101 in_pd_set = true;
102 break;
103 }
104 }
105 if (in_pd_set) {
106 assert(false, "A klass's protection domain should not show up "
107 "in its sys. dict. PD set");
108 }
109 }
110 #endif /* ASSERT */
111
112 if (protection_domain == klass()->protection_domain()) {
113 // Succeeds trivially
114 return true;
115 }
116
117 for (ProtectionDomainEntry* current = _pd_set;
118 current != NULL;
119 current = current->next()) {
120 if (current->protection_domain() == protection_domain) return true;
121 }
122 return false;
123 }
124
125
126 void DictionaryEntry::add_protection_domain(Dictionary* dict, oop protection_domain) {
127 assert_locked_or_safepoint(SystemDictionary_lock);
128 if (!contains_protection_domain(protection_domain)) {
129 ProtectionDomainCacheEntry* entry = dict->cache_get(protection_domain);
130 ProtectionDomainEntry* new_head =
131 new ProtectionDomainEntry(entry, _pd_set);
132 // Warning: Preserve store ordering. The SystemDictionary is read
133 // without locks. The new ProtectionDomainEntry must be
134 // complete before other threads can be allowed to see it
135 // via a store to _pd_set.
136 OrderAccess::release_store_ptr(&_pd_set, new_head);
137 }
138 if (log_is_enabled(Trace, protectiondomain)) {
139 ResourceMark rm;
140 outputStream* log = LogHandle(protectiondomain)::trace_stream();
141 print(log);
142 }
143 }
144
145
146 void Dictionary::do_unloading() {
147 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
148
149 // Remove unloadable entries and classes from system dictionary
150 // The placeholder array has been handled in always_strong_oops_do.
151 DictionaryEntry* probe = NULL;
152 for (int index = 0; index < table_size(); index++) {
153 for (DictionaryEntry** p = bucket_addr(index); *p != NULL; ) {
154 probe = *p;
155 Klass* e = probe->klass();
156 ClassLoaderData* loader_data = probe->loader_data();
157
158 InstanceKlass* ik = InstanceKlass::cast(e);
159
160 // Non-unloadable classes were handled in always_strong_oops_do
161 if (!is_strongly_reachable(loader_data, e)) {
162 // Entry was not visited in phase1 (negated test from phase1)
163 assert(!loader_data->is_the_null_class_loader_data(), "unloading entry with null class loader");
164 ClassLoaderData* k_def_class_loader_data = ik->class_loader_data();
165
166 // Do we need to delete this system dictionary entry?
167 bool purge_entry = false;
168
169 // Do we need to delete this system dictionary entry?
170 if (loader_data->is_unloading()) {
171 // If the loader is not live this entry should always be
172 // removed (will never be looked up again).
173 purge_entry = true;
174 } else {
175 // The loader in this entry is alive. If the klass is dead,
176 // (determined by checking the defining class loader)
177 // the loader must be an initiating loader (rather than the
178 // defining loader). Remove this entry.
179 if (k_def_class_loader_data->is_unloading()) {
180 // If we get here, the class_loader_data must not be the defining
181 // loader, it must be an initiating one.
182 assert(k_def_class_loader_data != loader_data,
183 "cannot have live defining loader and unreachable klass");
184 // Loader is live, but class and its defining loader are dead.
185 // Remove the entry. The class is going away.
186 purge_entry = true;
187 }
188 }
189
190 if (purge_entry) {
191 *p = probe->next();
192 if (probe == _current_class_entry) {
193 _current_class_entry = NULL;
194 }
195 free_entry(probe);
196 continue;
197 }
198 }
199 p = probe->next_addr();
200 }
201 }
202 }
203
204 void Dictionary::roots_oops_do(OopClosure* strong, OopClosure* weak) {
205 // Skip the strong roots probe marking if the closures are the same.
206 if (strong == weak) {
207 oops_do(strong);
208 return;
209 }
210
211 for (int index = 0; index < table_size(); index++) {
212 for (DictionaryEntry *probe = bucket(index);
213 probe != NULL;
214 probe = probe->next()) {
215 Klass* e = probe->klass();
216 ClassLoaderData* loader_data = probe->loader_data();
217 if (is_strongly_reachable(loader_data, e)) {
218 probe->set_strongly_reachable();
219 }
220 }
221 }
222 _pd_cache_table->roots_oops_do(strong, weak);
223 }
224
225 void Dictionary::remove_classes_in_error_state() {
226 assert(DumpSharedSpaces, "supported only when dumping");
227 DictionaryEntry* probe = NULL;
228 for (int index = 0; index < table_size(); index++) {
229 for (DictionaryEntry** p = bucket_addr(index); *p != NULL; ) {
230 probe = *p;
231 InstanceKlass* ik = InstanceKlass::cast(probe->klass());
232 if (ik->is_in_error_state()) { // purge this entry
233 *p = probe->next();
234 if (probe == _current_class_entry) {
235 _current_class_entry = NULL;
236 }
237 free_entry(probe);
238 ResourceMark rm;
239 tty->print_cr("Preload Warning: Removed error class: %s", ik->external_name());
240 continue;
241 }
242
243 p = probe->next_addr();
244 }
245 }
246 }
247
248 void Dictionary::always_strong_oops_do(OopClosure* blk) {
249 // Follow all system classes and temporary placeholders in dictionary; only
250 // protection domain oops contain references into the heap. In a first
251 // pass over the system dictionary determine which need to be treated as
252 // strongly reachable and mark them as such.
253 for (int index = 0; index < table_size(); index++) {
254 for (DictionaryEntry *probe = bucket(index);
255 probe != NULL;
256 probe = probe->next()) {
257 Klass* e = probe->klass();
258 ClassLoaderData* loader_data = probe->loader_data();
259 if (is_strongly_reachable(loader_data, e)) {
260 probe->set_strongly_reachable();
261 }
262 }
263 }
264 // Then iterate over the protection domain cache to apply the closure on the
265 // previously marked ones.
266 _pd_cache_table->always_strong_oops_do(blk);
267 }
268
269
270 void Dictionary::always_strong_classes_do(KlassClosure* closure) {
271 // Follow all system classes and temporary placeholders in dictionary
272 for (int index = 0; index < table_size(); index++) {
273 for (DictionaryEntry* probe = bucket(index);
274 probe != NULL;
275 probe = probe->next()) {
276 Klass* e = probe->klass();
277 ClassLoaderData* loader_data = probe->loader_data();
278 if (is_strongly_reachable(loader_data, e)) {
279 closure->do_klass(e);
280 }
281 }
282 }
283 }
284
285
286 // Just the classes from defining class loaders
287 void Dictionary::classes_do(void f(Klass*)) {
288 for (int index = 0; index < table_size(); index++) {
289 for (DictionaryEntry* probe = bucket(index);
290 probe != NULL;
291 probe = probe->next()) {
292 Klass* k = probe->klass();
293 if (probe->loader_data() == k->class_loader_data()) {
294 f(k);
295 }
296 }
297 }
298 }
299
300 // Added for initialize_itable_for_klass to handle exceptions
301 // Just the classes from defining class loaders
302 void Dictionary::classes_do(void f(Klass*, TRAPS), TRAPS) {
303 for (int index = 0; index < table_size(); index++) {
304 for (DictionaryEntry* probe = bucket(index);
305 probe != NULL;
306 probe = probe->next()) {
307 Klass* k = probe->klass();
308 if (probe->loader_data() == k->class_loader_data()) {
309 f(k, CHECK);
310 }
311 }
312 }
313 }
314
315 // All classes, and their class loaders
316 // Don't iterate over placeholders
317 void Dictionary::classes_do(void f(Klass*, ClassLoaderData*)) {
318 for (int index = 0; index < table_size(); index++) {
319 for (DictionaryEntry* probe = bucket(index);
320 probe != NULL;
321 probe = probe->next()) {
322 Klass* k = probe->klass();
323 f(k, probe->loader_data());
324 }
325 }
326 }
327
328 void Dictionary::oops_do(OopClosure* f) {
329 // Only the protection domain oops contain references into the heap. Iterate
330 // over all of them.
331 _pd_cache_table->oops_do(f);
332 }
333
334 void Dictionary::methods_do(void f(Method*)) {
335 for (int index = 0; index < table_size(); index++) {
336 for (DictionaryEntry* probe = bucket(index);
337 probe != NULL;
338 probe = probe->next()) {
339 Klass* k = probe->klass();
340 if (probe->loader_data() == k->class_loader_data()) {
341 // only take klass is we have the entry with the defining class loader
342 InstanceKlass::cast(k)->methods_do(f);
343 }
344 }
345 }
346 }
347
348 void Dictionary::unlink(BoolObjectClosure* is_alive) {
349 // Only the protection domain cache table may contain references to the heap
350 // that need to be unlinked.
351 _pd_cache_table->unlink(is_alive);
352 }
353
354 Klass* Dictionary::try_get_next_class() {
355 while (true) {
356 if (_current_class_entry != NULL) {
357 Klass* k = _current_class_entry->klass();
358 _current_class_entry = _current_class_entry->next();
359 return k;
360 }
361 _current_class_index = (_current_class_index + 1) % table_size();
362 _current_class_entry = bucket(_current_class_index);
363 }
364 // never reached
365 }
366
367 // Add a loaded class to the system dictionary.
368 // Readers of the SystemDictionary aren't always locked, so _buckets
369 // is volatile. The store of the next field in the constructor is
370 // also cast to volatile; we do this to ensure store order is maintained
371 // by the compilers.
372
373 void Dictionary::add_klass(Symbol* class_name, ClassLoaderData* loader_data,
374 KlassHandle obj) {
375 assert_locked_or_safepoint(SystemDictionary_lock);
376 assert(obj() != NULL, "adding NULL obj");
377 assert(obj()->name() == class_name, "sanity check on name");
378 assert(loader_data != NULL, "Must be non-NULL");
379
380 unsigned int hash = compute_hash(class_name, loader_data);
381 int index = hash_to_index(hash);
382 DictionaryEntry* entry = new_entry(hash, obj(), loader_data);
383 add_entry(index, entry);
384 }
385
386
387 // This routine does not lock the system dictionary.
388 //
389 // Since readers don't hold a lock, we must make sure that system
390 // dictionary entries are only removed at a safepoint (when only one
391 // thread is running), and are added to in a safe way (all links must
392 // be updated in an MT-safe manner).
393 //
394 // Callers should be aware that an entry could be added just after
395 // _buckets[index] is read here, so the caller will not see the new entry.
396 DictionaryEntry* Dictionary::get_entry(int index, unsigned int hash,
397 Symbol* class_name,
398 ClassLoaderData* loader_data) {
399 debug_only(_lookup_count++);
400 for (DictionaryEntry* entry = bucket(index);
401 entry != NULL;
402 entry = entry->next()) {
403 if (entry->hash() == hash && entry->equals(class_name, loader_data)) {
404 return entry;
405 }
406 debug_only(_lookup_length++);
407 }
408 return NULL;
409 }
410
411
412 Klass* Dictionary::find(int index, unsigned int hash, Symbol* name,
413 ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
414 DictionaryEntry* entry = get_entry(index, hash, name, loader_data);
415 if (entry != NULL && entry->is_valid_protection_domain(protection_domain)) {
416 return entry->klass();
417 } else {
418 return NULL;
419 }
420 }
421
422
423 Klass* Dictionary::find_class(int index, unsigned int hash,
424 Symbol* name, ClassLoaderData* loader_data) {
425 assert_locked_or_safepoint(SystemDictionary_lock);
426 assert (index == index_for(name, loader_data), "incorrect index?");
427
428 DictionaryEntry* entry = get_entry(index, hash, name, loader_data);
429 return (entry != NULL) ? entry->klass() : (Klass*)NULL;
430 }
431
432
433 // Variant of find_class for shared classes. No locking required, as
434 // that table is static.
435
436 Klass* Dictionary::find_shared_class(int index, unsigned int hash,
437 Symbol* name) {
438 assert (index == index_for(name, NULL), "incorrect index?");
439
440 DictionaryEntry* entry = get_entry(index, hash, name, NULL);
441 return (entry != NULL) ? entry->klass() : (Klass*)NULL;
442 }
443
444
445 void Dictionary::add_protection_domain(int index, unsigned int hash,
446 instanceKlassHandle klass,
447 ClassLoaderData* loader_data, Handle protection_domain,
448 TRAPS) {
449 Symbol* klass_name = klass->name();
450 DictionaryEntry* entry = get_entry(index, hash, klass_name, loader_data);
451
452 assert(entry != NULL,"entry must be present, we just created it");
453 assert(protection_domain() != NULL,
454 "real protection domain should be present");
455
456 entry->add_protection_domain(this, protection_domain());
457
458 assert(entry->contains_protection_domain(protection_domain()),
459 "now protection domain should be present");
460 }
461
462
463 bool Dictionary::is_valid_protection_domain(int index, unsigned int hash,
464 Symbol* name,
465 ClassLoaderData* loader_data,
466 Handle protection_domain) {
467 DictionaryEntry* entry = get_entry(index, hash, name, loader_data);
468 return entry->is_valid_protection_domain(protection_domain);
469 }
470
471
472 void Dictionary::reorder_dictionary() {
473
474 // Copy all the dictionary entries into a single master list.
475
476 DictionaryEntry* master_list = NULL;
477 for (int i = 0; i < table_size(); ++i) {
478 DictionaryEntry* p = bucket(i);
479 while (p != NULL) {
480 DictionaryEntry* tmp;
481 tmp = p->next();
482 p->set_next(master_list);
483 master_list = p;
484 p = tmp;
485 }
486 set_entry(i, NULL);
487 }
488
489 // Add the dictionary entries back to the list in the correct buckets.
490 while (master_list != NULL) {
491 DictionaryEntry* p = master_list;
492 master_list = master_list->next();
493 p->set_next(NULL);
494 Symbol* class_name = p->klass()->name();
495 // Since the null class loader data isn't copied to the CDS archive,
496 // compute the hash with NULL for loader data.
497 unsigned int hash = compute_hash(class_name, NULL);
498 int index = hash_to_index(hash);
499 p->set_hash(hash);
500 p->set_loader_data(NULL); // loader_data isn't copied to CDS
501 p->set_next(bucket(index));
502 set_entry(index, p);
503 }
504 }
505
506
507 unsigned int ProtectionDomainCacheTable::compute_hash(oop protection_domain) {
508 return (unsigned int)(protection_domain->identity_hash());
509 }
510
511 int ProtectionDomainCacheTable::index_for(oop protection_domain) {
512 return hash_to_index(compute_hash(protection_domain));
513 }
514
515 ProtectionDomainCacheTable::ProtectionDomainCacheTable(int table_size)
516 : Hashtable<oop, mtClass>(table_size, sizeof(ProtectionDomainCacheEntry))
517 {
518 }
519
520 void ProtectionDomainCacheTable::unlink(BoolObjectClosure* is_alive) {
521 assert(SafepointSynchronize::is_at_safepoint(), "must be");
522 for (int i = 0; i < table_size(); ++i) {
523 ProtectionDomainCacheEntry** p = bucket_addr(i);
524 ProtectionDomainCacheEntry* entry = bucket(i);
525 while (entry != NULL) {
526 if (is_alive->do_object_b(entry->literal())) {
527 p = entry->next_addr();
528 } else {
529 *p = entry->next();
530 free_entry(entry);
531 }
532 entry = *p;
533 }
534 }
535 }
536
537 void ProtectionDomainCacheTable::oops_do(OopClosure* f) {
538 for (int index = 0; index < table_size(); index++) {
539 for (ProtectionDomainCacheEntry* probe = bucket(index);
540 probe != NULL;
541 probe = probe->next()) {
542 probe->oops_do(f);
543 }
544 }
545 }
546
547 void ProtectionDomainCacheTable::roots_oops_do(OopClosure* strong, OopClosure* weak) {
548 for (int index = 0; index < table_size(); index++) {
549 for (ProtectionDomainCacheEntry* probe = bucket(index);
550 probe != NULL;
551 probe = probe->next()) {
552 if (probe->is_strongly_reachable()) {
553 probe->reset_strongly_reachable();
554 probe->oops_do(strong);
555 } else {
556 if (weak != NULL) {
557 probe->oops_do(weak);
558 }
559 }
560 }
561 }
562 }
563
564 uint ProtectionDomainCacheTable::bucket_size() {
565 return sizeof(ProtectionDomainCacheEntry);
566 }
567
568 #ifndef PRODUCT
569 void ProtectionDomainCacheTable::print() {
570 tty->print_cr("Protection domain cache table (table_size=%d, classes=%d)",
571 table_size(), number_of_entries());
572 for (int index = 0; index < table_size(); index++) {
573 for (ProtectionDomainCacheEntry* probe = bucket(index);
574 probe != NULL;
575 probe = probe->next()) {
576 probe->print();
577 }
578 }
579 }
580
581 void ProtectionDomainCacheEntry::print() {
582 tty->print_cr("entry " PTR_FORMAT " value " PTR_FORMAT " strongly_reachable %d next " PTR_FORMAT,
583 p2i(this), p2i(literal()), _strongly_reachable, p2i(next()));
584 }
585 #endif
586
587 void ProtectionDomainCacheTable::verify() {
588 int element_count = 0;
589 for (int index = 0; index < table_size(); index++) {
590 for (ProtectionDomainCacheEntry* probe = bucket(index);
591 probe != NULL;
592 probe = probe->next()) {
593 probe->verify();
594 element_count++;
595 }
596 }
597 guarantee(number_of_entries() == element_count,
598 "Verify of protection domain cache table failed");
599 debug_only(verify_lookup_length((double)number_of_entries() / table_size()));
600 }
601
602 void ProtectionDomainCacheEntry::verify() {
603 guarantee(literal()->is_oop(), "must be an oop");
604 }
605
606 void ProtectionDomainCacheTable::always_strong_oops_do(OopClosure* f) {
607 // the caller marked the protection domain cache entries that we need to apply
608 // the closure on. Only process them.
609 for (int index = 0; index < table_size(); index++) {
610 for (ProtectionDomainCacheEntry* probe = bucket(index);
611 probe != NULL;
612 probe = probe->next()) {
613 if (probe->is_strongly_reachable()) {
614 probe->reset_strongly_reachable();
615 probe->oops_do(f);
616 }
617 }
618 }
619 }
620
621 ProtectionDomainCacheEntry* ProtectionDomainCacheTable::get(oop protection_domain) {
622 unsigned int hash = compute_hash(protection_domain);
623 int index = hash_to_index(hash);
624
625 ProtectionDomainCacheEntry* entry = find_entry(index, protection_domain);
626 if (entry == NULL) {
627 entry = add_entry(index, hash, protection_domain);
628 }
629 return entry;
630 }
631
632 ProtectionDomainCacheEntry* ProtectionDomainCacheTable::find_entry(int index, oop protection_domain) {
633 for (ProtectionDomainCacheEntry* e = bucket(index); e != NULL; e = e->next()) {
634 if (e->protection_domain() == protection_domain) {
635 return e;
636 }
637 }
638
639 return NULL;
640 }
641
642 ProtectionDomainCacheEntry* ProtectionDomainCacheTable::add_entry(int index, unsigned int hash, oop protection_domain) {
643 assert_locked_or_safepoint(SystemDictionary_lock);
644 assert(index == index_for(protection_domain), "incorrect index?");
645 assert(find_entry(index, protection_domain) == NULL, "no double entry");
646
647 ProtectionDomainCacheEntry* p = new_entry(hash, protection_domain);
648 Hashtable<oop, mtClass>::add_entry(index, p);
649 return p;
650 }
651
652 void ProtectionDomainCacheTable::free(ProtectionDomainCacheEntry* to_delete) {
653 unsigned int hash = compute_hash(to_delete->protection_domain());
654 int index = hash_to_index(hash);
655
656 ProtectionDomainCacheEntry** p = bucket_addr(index);
657 ProtectionDomainCacheEntry* entry = bucket(index);
658 while (true) {
659 assert(entry != NULL, "sanity");
660
661 if (entry == to_delete) {
662 *p = entry->next();
663 Hashtable<oop, mtClass>::free_entry(entry);
664 break;
665 } else {
666 p = entry->next_addr();
667 entry = *p;
668 }
669 }
670 }
671
672 SymbolPropertyTable::SymbolPropertyTable(int table_size)
673 : Hashtable<Symbol*, mtSymbol>(table_size, sizeof(SymbolPropertyEntry))
674 {
675 }
676 SymbolPropertyTable::SymbolPropertyTable(int table_size, HashtableBucket<mtSymbol>* t,
677 int number_of_entries)
678 : Hashtable<Symbol*, mtSymbol>(table_size, sizeof(SymbolPropertyEntry), t, number_of_entries)
679 {
680 }
681
682
683 SymbolPropertyEntry* SymbolPropertyTable::find_entry(int index, unsigned int hash,
684 Symbol* sym,
685 intptr_t sym_mode) {
686 assert(index == index_for(sym, sym_mode), "incorrect index?");
687 for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) {
688 if (p->hash() == hash && p->symbol() == sym && p->symbol_mode() == sym_mode) {
689 return p;
690 }
691 }
692 return NULL;
693 }
694
695
696 SymbolPropertyEntry* SymbolPropertyTable::add_entry(int index, unsigned int hash,
697 Symbol* sym, intptr_t sym_mode) {
698 assert_locked_or_safepoint(SystemDictionary_lock);
699 assert(index == index_for(sym, sym_mode), "incorrect index?");
700 assert(find_entry(index, hash, sym, sym_mode) == NULL, "no double entry");
701
702 SymbolPropertyEntry* p = new_entry(hash, sym, sym_mode);
703 Hashtable<Symbol*, mtSymbol>::add_entry(index, p);
704 return p;
705 }
706
707 void SymbolPropertyTable::oops_do(OopClosure* f) {
708 for (int index = 0; index < table_size(); index++) {
709 for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) {
710 if (p->method_type() != NULL) {
711 f->do_oop(p->method_type_addr());
712 }
713 }
714 }
715 }
716
717 void SymbolPropertyTable::methods_do(void f(Method*)) {
718 for (int index = 0; index < table_size(); index++) {
719 for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) {
720 Method* prop = p->method();
721 if (prop != NULL) {
722 f((Method*)prop);
723 }
724 }
725 }
726 }
727
728
729 // ----------------------------------------------------------------------------
730
731 void Dictionary::print(bool details) {
732 ResourceMark rm;
733 HandleMark hm;
734
735 if (details) {
736 tty->print_cr("Java system dictionary (table_size=%d, classes=%d)",
737 table_size(), number_of_entries());
738 tty->print_cr("^ indicates that initiating loader is different from "
739 "defining loader");
740 }
741
742 for (int index = 0; index < table_size(); index++) {
743 for (DictionaryEntry* probe = bucket(index);
744 probe != NULL;
745 probe = probe->next()) {
746 if (Verbose) tty->print("%4d: ", index);
747 Klass* e = probe->klass();
748 ClassLoaderData* loader_data = probe->loader_data();
749 bool is_defining_class =
750 (loader_data == e->class_loader_data());
751 tty->print("%s%s", ((!details) || is_defining_class) ? " " : "^",
752 e->external_name());
753
754 if (details) {
755 tty->print(", loader ");
756 if (loader_data != NULL) {
757 loader_data->print_value();
758 } else {
759 tty->print("NULL");
760 }
761 }
762 tty->cr();
763 }
764 }
765
766 if (details) {
767 tty->cr();
768 _pd_cache_table->print();
769 }
770 tty->cr();
771 }
772
773 void Dictionary::verify() {
774 guarantee(number_of_entries() >= 0, "Verify of system dictionary failed");
775
776 int element_count = 0;
777 for (int index = 0; index < table_size(); index++) {
778 for (DictionaryEntry* probe = bucket(index);
779 probe != NULL;
780 probe = probe->next()) {
781 Klass* e = probe->klass();
782 ClassLoaderData* loader_data = probe->loader_data();
783 guarantee(e->is_instance_klass(),
784 "Verify of system dictionary failed");
785 // class loader must be present; a null class loader is the
786 // boostrap loader
787 guarantee(loader_data != NULL || DumpSharedSpaces ||
788 loader_data->class_loader() == NULL ||
789 loader_data->class_loader()->is_instance(),
790 "checking type of class_loader");
791 e->verify();
792 probe->verify_protection_domain_set();
793 element_count++;
794 }
795 }
796 guarantee(number_of_entries() == element_count,
797 "Verify of system dictionary failed");
798 debug_only(verify_lookup_length((double)number_of_entries() / table_size()));
799
800 _pd_cache_table->verify();
801 }
802