duke@435: /*
stefank@2314:  * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "classfile/dictionary.hpp"
stefank@2314: #include "classfile/systemDictionary.hpp"
stefank@2314: #include "oops/oop.inline.hpp"
stefank@2314: #include "prims/jvmtiRedefineClassesTrace.hpp"
stefank@2314: #include "services/classLoadingService.hpp"
stefank@2314: #include "utilities/hashtable.inline.hpp"
duke@435: 
duke@435: 
duke@435: DictionaryEntry*  Dictionary::_current_class_entry = NULL;
duke@435: int               Dictionary::_current_class_index =    0;
duke@435: 
duke@435: 
duke@435: Dictionary::Dictionary(int table_size)
coleenp@2497:   : TwoOopHashtable<klassOop>(table_size, sizeof(DictionaryEntry)) {
duke@435:   _current_class_index = 0;
duke@435:   _current_class_entry = NULL;
duke@435: };
duke@435: 
duke@435: 
duke@435: 
duke@435: Dictionary::Dictionary(int table_size, HashtableBucket* t,
duke@435:                        int number_of_entries)
coleenp@2497:   : TwoOopHashtable<klassOop>(table_size, sizeof(DictionaryEntry), t, number_of_entries) {
duke@435:   _current_class_index = 0;
duke@435:   _current_class_entry = NULL;
duke@435: };
duke@435: 
duke@435: 
duke@435: DictionaryEntry* Dictionary::new_entry(unsigned int hash, klassOop klass,
duke@435:                                        oop loader) {
duke@435:   DictionaryEntry* entry;
coleenp@2497:   entry = (DictionaryEntry*)Hashtable<klassOop>::new_entry(hash, klass);
duke@435:   entry->set_loader(loader);
duke@435:   entry->set_pd_set(NULL);
duke@435:   return entry;
duke@435: }
duke@435: 
duke@435: 
duke@435: DictionaryEntry* Dictionary::new_entry() {
coleenp@2497:   DictionaryEntry* entry = (DictionaryEntry*)Hashtable<klassOop>::new_entry(0L, NULL);
duke@435:   entry->set_loader(NULL);
duke@435:   entry->set_pd_set(NULL);
duke@435:   return entry;
duke@435: }
duke@435: 
duke@435: 
duke@435: void Dictionary::free_entry(DictionaryEntry* entry) {
duke@435:   // avoid recursion when deleting linked list
duke@435:   while (entry->pd_set() != NULL) {
duke@435:     ProtectionDomainEntry* to_delete = entry->pd_set();
duke@435:     entry->set_pd_set(to_delete->next());
duke@435:     delete to_delete;
duke@435:   }
coleenp@2497:   Hashtable<klassOop>::free_entry(entry);
duke@435: }
duke@435: 
duke@435: 
duke@435: bool DictionaryEntry::contains_protection_domain(oop protection_domain) const {
duke@435: #ifdef ASSERT
duke@435:   if (protection_domain == instanceKlass::cast(klass())->protection_domain()) {
duke@435:     // Ensure this doesn't show up in the pd_set (invariant)
duke@435:     bool in_pd_set = false;
duke@435:     for (ProtectionDomainEntry* current = _pd_set;
duke@435:                                 current != NULL;
duke@435:                                 current = current->next()) {
duke@435:       if (current->protection_domain() == protection_domain) {
duke@435:         in_pd_set = true;
duke@435:         break;
duke@435:       }
duke@435:     }
duke@435:     if (in_pd_set) {
duke@435:       assert(false, "A klass's protection domain should not show up "
duke@435:                     "in its sys. dict. PD set");
duke@435:     }
duke@435:   }
duke@435: #endif /* ASSERT */
duke@435: 
duke@435:   if (protection_domain == instanceKlass::cast(klass())->protection_domain()) {
duke@435:     // Succeeds trivially
duke@435:     return true;
duke@435:   }
duke@435: 
duke@435:   for (ProtectionDomainEntry* current = _pd_set;
duke@435:                               current != NULL;
duke@435:                               current = current->next()) {
duke@435:     if (current->protection_domain() == protection_domain) return true;
duke@435:   }
duke@435:   return false;
duke@435: }
duke@435: 
duke@435: 
duke@435: void DictionaryEntry::add_protection_domain(oop protection_domain) {
duke@435:   assert_locked_or_safepoint(SystemDictionary_lock);
duke@435:   if (!contains_protection_domain(protection_domain)) {
duke@435:     ProtectionDomainEntry* new_head =
duke@435:                 new ProtectionDomainEntry(protection_domain, _pd_set);
duke@435:     // Warning: Preserve store ordering.  The SystemDictionary is read
duke@435:     //          without locks.  The new ProtectionDomainEntry must be
duke@435:     //          complete before other threads can be allowed to see it
duke@435:     //          via a store to _pd_set.
duke@435:     OrderAccess::release_store_ptr(&_pd_set, new_head);
duke@435:   }
duke@435:   if (TraceProtectionDomainVerification && WizardMode) {
duke@435:     print();
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: bool Dictionary::do_unloading(BoolObjectClosure* is_alive) {
jcoomes@1844:   assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
duke@435:   bool class_was_unloaded = false;
duke@435:   int  index = 0; // Defined here for portability! Do not move
duke@435: 
duke@435:   // Remove unloadable entries and classes from system dictionary
duke@435:   // The placeholder array has been handled in always_strong_oops_do.
duke@435:   DictionaryEntry* probe = NULL;
duke@435:   for (index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry** p = bucket_addr(index); *p != NULL; ) {
duke@435:       probe = *p;
duke@435:       klassOop e = probe->klass();
duke@435:       oop class_loader = probe->loader();
duke@435: 
duke@435:       instanceKlass* ik = instanceKlass::cast(e);
duke@435:       if (ik->previous_versions() != NULL) {
duke@435:         // This klass has previous versions so see what we can cleanup
duke@435:         // while it is safe to do so.
duke@435: 
duke@435:         int gc_count = 0;    // leave debugging breadcrumbs
duke@435:         int live_count = 0;
duke@435: 
duke@435:         // RC_TRACE macro has an embedded ResourceMark
duke@435:         RC_TRACE(0x00000200, ("unload: %s: previous version length=%d",
duke@435:           ik->external_name(), ik->previous_versions()->length()));
duke@435: 
duke@435:         for (int i = ik->previous_versions()->length() - 1; i >= 0; i--) {
duke@435:           // check the previous versions array for GC'ed weak refs
duke@435:           PreviousVersionNode * pv_node = ik->previous_versions()->at(i);
dcubed@482:           jobject cp_ref = pv_node->prev_constant_pool();
dcubed@482:           assert(cp_ref != NULL, "cp ref was unexpectedly cleared");
duke@435:           if (cp_ref == NULL) {
duke@435:             delete pv_node;
duke@435:             ik->previous_versions()->remove_at(i);
duke@435:             // Since we are traversing the array backwards, we don't have to
duke@435:             // do anything special with the index.
duke@435:             continue;  // robustness
duke@435:           }
duke@435: 
duke@435:           constantPoolOop pvcp = (constantPoolOop)JNIHandles::resolve(cp_ref);
duke@435:           if (pvcp == NULL) {
duke@435:             // this entry has been GC'ed so remove it
duke@435:             delete pv_node;
duke@435:             ik->previous_versions()->remove_at(i);
duke@435:             // Since we are traversing the array backwards, we don't have to
duke@435:             // do anything special with the index.
duke@435:             gc_count++;
duke@435:             continue;
duke@435:           } else {
duke@435:             RC_TRACE(0x00000200, ("unload: previous version @%d is alive", i));
duke@435:             if (is_alive->do_object_b(pvcp)) {
duke@435:               live_count++;
duke@435:             } else {
duke@435:               guarantee(false, "sanity check");
duke@435:             }
duke@435:           }
duke@435: 
duke@435:           GrowableArray<jweak>* method_refs = pv_node->prev_EMCP_methods();
duke@435:           if (method_refs != NULL) {
duke@435:             RC_TRACE(0x00000200, ("unload: previous methods length=%d",
duke@435:               method_refs->length()));
duke@435:             for (int j = method_refs->length() - 1; j >= 0; j--) {
duke@435:               jweak method_ref = method_refs->at(j);
duke@435:               assert(method_ref != NULL, "weak method ref was unexpectedly cleared");
duke@435:               if (method_ref == NULL) {
duke@435:                 method_refs->remove_at(j);
duke@435:                 // Since we are traversing the array backwards, we don't have to
duke@435:                 // do anything special with the index.
duke@435:                 continue;  // robustness
duke@435:               }
duke@435: 
duke@435:               methodOop method = (methodOop)JNIHandles::resolve(method_ref);
duke@435:               if (method == NULL) {
duke@435:                 // this method entry has been GC'ed so remove it
duke@435:                 JNIHandles::destroy_weak_global(method_ref);
duke@435:                 method_refs->remove_at(j);
duke@435:               } else {
duke@435:                 // RC_TRACE macro has an embedded ResourceMark
duke@435:                 RC_TRACE(0x00000200,
duke@435:                   ("unload: %s(%s): prev method @%d in version @%d is alive",
duke@435:                   method->name()->as_C_string(),
duke@435:                   method->signature()->as_C_string(), j, i));
duke@435:               }
duke@435:             }
duke@435:           }
duke@435:         }
duke@435:         assert(ik->previous_versions()->length() == live_count, "sanity check");
duke@435:         RC_TRACE(0x00000200,
duke@435:           ("unload: previous version stats: live=%d, GC'ed=%d", live_count,
duke@435:           gc_count));
duke@435:       }
duke@435: 
duke@435:       // Non-unloadable classes were handled in always_strong_oops_do
duke@435:       if (!is_strongly_reachable(class_loader, e)) {
duke@435:         // Entry was not visited in phase1 (negated test from phase1)
duke@435:         assert(class_loader != NULL, "unloading entry with null class loader");
duke@435:         oop k_def_class_loader = ik->class_loader();
duke@435: 
duke@435:         // Do we need to delete this system dictionary entry?
duke@435:         bool purge_entry = false;
duke@435: 
duke@435:         // Do we need to delete this system dictionary entry?
duke@435:         if (!is_alive->do_object_b(class_loader)) {
duke@435:           // If the loader is not live this entry should always be
duke@435:           // removed (will never be looked up again). Note that this is
duke@435:           // not the same as unloading the referred class.
duke@435:           if (k_def_class_loader == class_loader) {
duke@435:             // This is the defining entry, so the referred class is about
duke@435:             // to be unloaded.
duke@435:             // Notify the debugger and clean up the class.
duke@435:             guarantee(!is_alive->do_object_b(e),
duke@435:                       "klass should not be live if defining loader is not");
duke@435:             class_was_unloaded = true;
duke@435:             // notify the debugger
duke@435:             if (JvmtiExport::should_post_class_unload()) {
duke@435:               JvmtiExport::post_class_unload(ik->as_klassOop());
duke@435:             }
duke@435: 
duke@435:             // notify ClassLoadingService of class unload
duke@435:             ClassLoadingService::notify_class_unloaded(ik);
duke@435: 
duke@435:             // Clean up C heap
duke@435:             ik->release_C_heap_structures();
duke@435:           }
duke@435:           // Also remove this system dictionary entry.
duke@435:           purge_entry = true;
duke@435: 
duke@435:         } else {
duke@435:           // The loader in this entry is alive. If the klass is dead,
duke@435:           // the loader must be an initiating loader (rather than the
duke@435:           // defining loader). Remove this entry.
duke@435:           if (!is_alive->do_object_b(e)) {
duke@435:             guarantee(!is_alive->do_object_b(k_def_class_loader),
duke@435:                       "defining loader should not be live if klass is not");
duke@435:             // If we get here, the class_loader must not be the defining
duke@435:             // loader, it must be an initiating one.
duke@435:             assert(k_def_class_loader != class_loader,
duke@435:                    "cannot have live defining loader and unreachable klass");
duke@435: 
duke@435:             // Loader is live, but class and its defining loader are dead.
duke@435:             // Remove the entry. The class is going away.
duke@435:             purge_entry = true;
duke@435:           }
duke@435:         }
duke@435: 
duke@435:         if (purge_entry) {
duke@435:           *p = probe->next();
duke@435:           if (probe == _current_class_entry) {
duke@435:             _current_class_entry = NULL;
duke@435:           }
duke@435:           free_entry(probe);
duke@435:           continue;
duke@435:         }
duke@435:       }
duke@435:       p = probe->next_addr();
duke@435:     }
duke@435:   }
duke@435:   return class_was_unloaded;
duke@435: }
duke@435: 
duke@435: 
duke@435: void Dictionary::always_strong_classes_do(OopClosure* blk) {
duke@435:   // Follow all system classes and temporary placeholders in dictionary
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry *probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
coleenp@2497:       klassOop e = probe->klass();
duke@435:       oop class_loader = probe->loader();
duke@435:       if (is_strongly_reachable(class_loader, e)) {
duke@435:         blk->do_oop((oop*)probe->klass_addr());
duke@435:         if (class_loader != NULL) {
duke@435:           blk->do_oop(probe->loader_addr());
duke@435:         }
duke@435:         probe->protection_domain_set_oops_do(blk);
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: //   Just the classes from defining class loaders
duke@435: void Dictionary::classes_do(void f(klassOop)) {
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       klassOop k = probe->klass();
duke@435:       if (probe->loader() == instanceKlass::cast(k)->class_loader()) {
duke@435:         f(k);
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: // Added for initialize_itable_for_klass to handle exceptions
duke@435: //   Just the classes from defining class loaders
duke@435: void Dictionary::classes_do(void f(klassOop, TRAPS), TRAPS) {
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       klassOop k = probe->klass();
duke@435:       if (probe->loader() == instanceKlass::cast(k)->class_loader()) {
duke@435:         f(k, CHECK);
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: //   All classes, and their class loaders
duke@435: //   (added for helpers that use HandleMarks and ResourceMarks)
duke@435: // Don't iterate over placeholders
duke@435: void Dictionary::classes_do(void f(klassOop, oop, TRAPS), TRAPS) {
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       klassOop k = probe->klass();
duke@435:       f(k, probe->loader(), CHECK);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: //   All classes, and their class loaders
duke@435: // Don't iterate over placeholders
duke@435: void Dictionary::classes_do(void f(klassOop, oop)) {
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       klassOop k = probe->klass();
duke@435:       f(k, probe->loader());
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void Dictionary::oops_do(OopClosure* f) {
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       f->do_oop((oop*)probe->klass_addr());
duke@435:       if (probe->loader() != NULL) {
duke@435:         f->do_oop(probe->loader_addr());
duke@435:       }
duke@435:       probe->protection_domain_set_oops_do(f);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void Dictionary::methods_do(void f(methodOop)) {
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       klassOop k = probe->klass();
duke@435:       if (probe->loader() == instanceKlass::cast(k)->class_loader()) {
duke@435:         // only take klass is we have the entry with the defining class loader
duke@435:         instanceKlass::cast(k)->methods_do(f);
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: klassOop Dictionary::try_get_next_class() {
duke@435:   while (true) {
duke@435:     if (_current_class_entry != NULL) {
duke@435:       klassOop k = _current_class_entry->klass();
duke@435:       _current_class_entry = _current_class_entry->next();
duke@435:       return k;
duke@435:     }
duke@435:     _current_class_index = (_current_class_index + 1) % table_size();
duke@435:     _current_class_entry = bucket(_current_class_index);
duke@435:   }
duke@435:   // never reached
duke@435: }
duke@435: 
duke@435: 
duke@435: // Add a loaded class to the system dictionary.
duke@435: // Readers of the SystemDictionary aren't always locked, so _buckets
duke@435: // is volatile. The store of the next field in the constructor is
duke@435: // also cast to volatile;  we do this to ensure store order is maintained
duke@435: // by the compilers.
duke@435: 
coleenp@2497: void Dictionary::add_klass(Symbol* class_name, Handle class_loader,
duke@435:                            KlassHandle obj) {
duke@435:   assert_locked_or_safepoint(SystemDictionary_lock);
duke@435:   assert(obj() != NULL, "adding NULL obj");
coleenp@2497:   assert(Klass::cast(obj())->name() == class_name, "sanity check on name");
duke@435: 
duke@435:   unsigned int hash = compute_hash(class_name, class_loader);
duke@435:   int index = hash_to_index(hash);
duke@435:   DictionaryEntry* entry = new_entry(hash, obj(), class_loader());
duke@435:   add_entry(index, entry);
duke@435: }
duke@435: 
duke@435: 
duke@435: // This routine does not lock the system dictionary.
duke@435: //
duke@435: // Since readers don't hold a lock, we must make sure that system
duke@435: // dictionary entries are only removed at a safepoint (when only one
duke@435: // thread is running), and are added to in a safe way (all links must
duke@435: // be updated in an MT-safe manner).
duke@435: //
duke@435: // Callers should be aware that an entry could be added just after
duke@435: // _buckets[index] is read here, so the caller will not see the new entry.
duke@435: DictionaryEntry* Dictionary::get_entry(int index, unsigned int hash,
coleenp@2497:                                        Symbol* class_name,
duke@435:                                        Handle class_loader) {
coleenp@2497:   oop loader = class_loader();
duke@435:   debug_only(_lookup_count++);
duke@435:   for (DictionaryEntry* entry = bucket(index);
duke@435:                         entry != NULL;
duke@435:                         entry = entry->next()) {
coleenp@2497:     if (entry->hash() == hash && entry->equals(class_name, loader)) {
duke@435:       return entry;
duke@435:     }
duke@435:     debug_only(_lookup_length++);
duke@435:   }
duke@435:   return NULL;
duke@435: }
duke@435: 
duke@435: 
coleenp@2497: klassOop Dictionary::find(int index, unsigned int hash, Symbol* name,
duke@435:                           Handle loader, Handle protection_domain, TRAPS) {
duke@435:   DictionaryEntry* entry = get_entry(index, hash, name, loader);
duke@435:   if (entry != NULL && entry->is_valid_protection_domain(protection_domain)) {
duke@435:     return entry->klass();
duke@435:   } else {
duke@435:     return NULL;
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: klassOop Dictionary::find_class(int index, unsigned int hash,
coleenp@2497:                                 Symbol* name, Handle loader) {
duke@435:   assert_locked_or_safepoint(SystemDictionary_lock);
duke@435:   assert (index == index_for(name, loader), "incorrect index?");
duke@435: 
duke@435:   DictionaryEntry* entry = get_entry(index, hash, name, loader);
duke@435:   return (entry != NULL) ? entry->klass() : (klassOop)NULL;
duke@435: }
duke@435: 
duke@435: 
duke@435: // Variant of find_class for shared classes.  No locking required, as
duke@435: // that table is static.
duke@435: 
duke@435: klassOop Dictionary::find_shared_class(int index, unsigned int hash,
coleenp@2497:                                        Symbol* name) {
duke@435:   assert (index == index_for(name, Handle()), "incorrect index?");
duke@435: 
duke@435:   DictionaryEntry* entry = get_entry(index, hash, name, Handle());
duke@435:   return (entry != NULL) ? entry->klass() : (klassOop)NULL;
duke@435: }
duke@435: 
duke@435: 
duke@435: void Dictionary::add_protection_domain(int index, unsigned int hash,
duke@435:                                        instanceKlassHandle klass,
duke@435:                                        Handle loader, Handle protection_domain,
duke@435:                                        TRAPS) {
coleenp@2497:   Symbol*  klass_name = klass->name();
duke@435:   DictionaryEntry* entry = get_entry(index, hash, klass_name, loader);
duke@435: 
duke@435:   assert(entry != NULL,"entry must be present, we just created it");
duke@435:   assert(protection_domain() != NULL,
duke@435:          "real protection domain should be present");
duke@435: 
duke@435:   entry->add_protection_domain(protection_domain());
duke@435: 
duke@435:   assert(entry->contains_protection_domain(protection_domain()),
duke@435:          "now protection domain should be present");
duke@435: }
duke@435: 
duke@435: 
duke@435: bool Dictionary::is_valid_protection_domain(int index, unsigned int hash,
coleenp@2497:                                             Symbol* name,
duke@435:                                             Handle loader,
duke@435:                                             Handle protection_domain) {
duke@435:   DictionaryEntry* entry = get_entry(index, hash, name, loader);
duke@435:   return entry->is_valid_protection_domain(protection_domain);
duke@435: }
duke@435: 
duke@435: 
duke@435: void Dictionary::reorder_dictionary() {
duke@435: 
duke@435:   // Copy all the dictionary entries into a single master list.
duke@435: 
duke@435:   DictionaryEntry* master_list = NULL;
duke@435:   for (int i = 0; i < table_size(); ++i) {
duke@435:     DictionaryEntry* p = bucket(i);
duke@435:     while (p != NULL) {
duke@435:       DictionaryEntry* tmp;
duke@435:       tmp = p->next();
duke@435:       p->set_next(master_list);
duke@435:       master_list = p;
duke@435:       p = tmp;
duke@435:     }
duke@435:     set_entry(i, NULL);
duke@435:   }
duke@435: 
duke@435:   // Add the dictionary entries back to the list in the correct buckets.
duke@435:   Thread *thread = Thread::current();
duke@435: 
duke@435:   while (master_list != NULL) {
duke@435:     DictionaryEntry* p = master_list;
duke@435:     master_list = master_list->next();
duke@435:     p->set_next(NULL);
coleenp@2497:     Symbol* class_name = instanceKlass::cast((klassOop)(p->klass()))->name();
duke@435:     unsigned int hash = compute_hash(class_name, Handle(thread, p->loader()));
duke@435:     int index = hash_to_index(hash);
duke@435:     p->set_hash(hash);
duke@435:     p->set_next(bucket(index));
duke@435:     set_entry(index, p);
duke@435:   }
duke@435: }
duke@435: 
jrose@1145: SymbolPropertyTable::SymbolPropertyTable(int table_size)
coleenp@2497:   : Hashtable<Symbol*>(table_size, sizeof(SymbolPropertyEntry))
jrose@1145: {
jrose@1145: }
jrose@1145: SymbolPropertyTable::SymbolPropertyTable(int table_size, HashtableBucket* t,
jrose@1145:                                          int number_of_entries)
coleenp@2497:   : Hashtable<Symbol*>(table_size, sizeof(SymbolPropertyEntry), t, number_of_entries)
jrose@1145: {
jrose@1145: }
jrose@1145: 
jrose@1145: 
jrose@1145: SymbolPropertyEntry* SymbolPropertyTable::find_entry(int index, unsigned int hash,
coleenp@2497:                                                      Symbol* sym,
jrose@1862:                                                      intptr_t sym_mode) {
jrose@1862:   assert(index == index_for(sym, sym_mode), "incorrect index?");
jrose@1145:   for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) {
coleenp@2497:     if (p->hash() == hash && p->symbol() == sym && p->symbol_mode() == sym_mode) {
jrose@1145:       return p;
jrose@1145:     }
jrose@1145:   }
jrose@1145:   return NULL;
jrose@1145: }
jrose@1145: 
jrose@1145: 
jrose@1145: SymbolPropertyEntry* SymbolPropertyTable::add_entry(int index, unsigned int hash,
coleenp@2497:                                                     Symbol* sym, intptr_t sym_mode) {
jrose@1145:   assert_locked_or_safepoint(SystemDictionary_lock);
jrose@1862:   assert(index == index_for(sym, sym_mode), "incorrect index?");
jrose@1862:   assert(find_entry(index, hash, sym, sym_mode) == NULL, "no double entry");
jrose@1145: 
coleenp@2497:   SymbolPropertyEntry* p = new_entry(hash, sym, sym_mode);
coleenp@2497:   Hashtable<Symbol*>::add_entry(index, p);
jrose@1145:   return p;
jrose@1145: }
jrose@1145: 
jrose@1145: 
jrose@1145: void SymbolPropertyTable::oops_do(OopClosure* f) {
jrose@1145:   for (int index = 0; index < table_size(); index++) {
jrose@1145:     for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) {
jrose@1145:       if (p->property_oop() != NULL) {
jrose@1145:         f->do_oop(p->property_oop_addr());
jrose@1145:       }
jrose@1145:     }
jrose@1145:   }
jrose@1145: }
jrose@1145: 
jrose@1145: void SymbolPropertyTable::methods_do(void f(methodOop)) {
jrose@1145:   for (int index = 0; index < table_size(); index++) {
jrose@1145:     for (SymbolPropertyEntry* p = bucket(index); p != NULL; p = p->next()) {
jrose@1145:       oop prop = p->property_oop();
jrose@1145:       if (prop != NULL && prop->is_method()) {
jrose@1145:         f((methodOop)prop);
jrose@1145:       }
jrose@1145:     }
jrose@1145:   }
jrose@1145: }
jrose@1145: 
duke@435: 
duke@435: // ----------------------------------------------------------------------------
duke@435: #ifndef PRODUCT
duke@435: 
duke@435: void Dictionary::print() {
duke@435:   ResourceMark rm;
duke@435:   HandleMark   hm;
duke@435: 
duke@435:   tty->print_cr("Java system dictionary (classes=%d)", number_of_entries());
duke@435:   tty->print_cr("^ indicates that initiating loader is different from "
duke@435:                 "defining loader");
duke@435: 
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       if (Verbose) tty->print("%4d: ", index);
duke@435:       klassOop e = probe->klass();
duke@435:       oop class_loader =  probe->loader();
duke@435:       bool is_defining_class =
duke@435:          (class_loader == instanceKlass::cast(e)->class_loader());
duke@435:       tty->print("%s%s", is_defining_class ? " " : "^",
duke@435:                    Klass::cast(e)->external_name());
duke@435:       if (class_loader != NULL) {
duke@435:         tty->print(", loader ");
duke@435:         class_loader->print_value();
duke@435:       }
duke@435:       tty->cr();
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: #endif
duke@435: 
duke@435: void Dictionary::verify() {
duke@435:   guarantee(number_of_entries() >= 0, "Verify of system dictionary failed");
duke@435:   int element_count = 0;
duke@435:   for (int index = 0; index < table_size(); index++) {
duke@435:     for (DictionaryEntry* probe = bucket(index);
duke@435:                           probe != NULL;
duke@435:                           probe = probe->next()) {
duke@435:       klassOop e = probe->klass();
duke@435:       oop class_loader = probe->loader();
duke@435:       guarantee(Klass::cast(e)->oop_is_instance(),
duke@435:                               "Verify of system dictionary failed");
duke@435:       // class loader must be present;  a null class loader is the
duke@435:       // boostrap loader
duke@435:       guarantee(class_loader == NULL || class_loader->is_instance(),
duke@435:                 "checking type of class_loader");
duke@435:       e->verify();
duke@435:       probe->verify_protection_domain_set();
duke@435:       element_count++;
duke@435:     }
duke@435:   }
duke@435:   guarantee(number_of_entries() == element_count,
duke@435:             "Verify of system dictionary failed");
duke@435:   debug_only(verify_lookup_length((double)number_of_entries() / table_size()));
duke@435: }