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