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