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