/* * Copyright (C) 2015 The Android Open Source Project * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include "class_table.h" #include "mirror/class-inl.h" namespace art { ClassTable::ClassTable() : lock_("Class loader classes", kClassLoaderClassesLock) { Runtime* const runtime = Runtime::Current(); classes_.push_back(ClassSet(runtime->GetHashTableMinLoadFactor(), runtime->GetHashTableMaxLoadFactor())); } void ClassTable::FreezeSnapshot() { WriterMutexLock mu(Thread::Current(), lock_); classes_.push_back(ClassSet()); } bool ClassTable::Contains(mirror::Class* klass) { ReaderMutexLock mu(Thread::Current(), lock_); for (ClassSet& class_set : classes_) { auto it = class_set.Find(GcRoot<mirror::Class>(klass)); if (it != class_set.end()) { return it->Read() == klass; } } return false; } mirror::Class* ClassTable::LookupByDescriptor(mirror::Class* klass) { ReaderMutexLock mu(Thread::Current(), lock_); for (ClassSet& class_set : classes_) { auto it = class_set.Find(GcRoot<mirror::Class>(klass)); if (it != class_set.end()) { return it->Read(); } } return nullptr; } mirror::Class* ClassTable::UpdateClass(const char* descriptor, mirror::Class* klass, size_t hash) { WriterMutexLock mu(Thread::Current(), lock_); // Should only be updating latest table. auto existing_it = classes_.back().FindWithHash(descriptor, hash); if (kIsDebugBuild && existing_it == classes_.back().end()) { for (const ClassSet& class_set : classes_) { if (class_set.FindWithHash(descriptor, hash) != class_set.end()) { LOG(FATAL) << "Updating class found in frozen table " << descriptor; } } LOG(FATAL) << "Updating class not found " << descriptor; } mirror::Class* const existing = existing_it->Read(); CHECK_NE(existing, klass) << descriptor; CHECK(!existing->IsResolved()) << descriptor; CHECK_EQ(klass->GetStatus(), mirror::Class::kStatusResolving) << descriptor; CHECK(!klass->IsTemp()) << descriptor; VerifyObject(klass); // Update the element in the hash set with the new class. This is safe to do since the descriptor // doesn't change. *existing_it = GcRoot<mirror::Class>(klass); return existing; } size_t ClassTable::NumZygoteClasses() const { ReaderMutexLock mu(Thread::Current(), lock_); size_t sum = 0; for (size_t i = 0; i < classes_.size() - 1; ++i) { sum += classes_[i].Size(); } return sum; } size_t ClassTable::NumNonZygoteClasses() const { ReaderMutexLock mu(Thread::Current(), lock_); return classes_.back().Size(); } mirror::Class* ClassTable::Lookup(const char* descriptor, size_t hash) { ReaderMutexLock mu(Thread::Current(), lock_); for (ClassSet& class_set : classes_) { auto it = class_set.FindWithHash(descriptor, hash); if (it != class_set.end()) { return it->Read(); } } return nullptr; } void ClassTable::Insert(mirror::Class* klass) { WriterMutexLock mu(Thread::Current(), lock_); classes_.back().Insert(GcRoot<mirror::Class>(klass)); } void ClassTable::InsertWithHash(mirror::Class* klass, size_t hash) { WriterMutexLock mu(Thread::Current(), lock_); classes_.back().InsertWithHash(GcRoot<mirror::Class>(klass), hash); } bool ClassTable::Remove(const char* descriptor) { WriterMutexLock mu(Thread::Current(), lock_); for (ClassSet& class_set : classes_) { auto it = class_set.Find(descriptor); if (it != class_set.end()) { class_set.Erase(it); return true; } } return false; } uint32_t ClassTable::ClassDescriptorHashEquals::operator()(const GcRoot<mirror::Class>& root) const { std::string temp; return ComputeModifiedUtf8Hash(root.Read()->GetDescriptor(&temp)); } bool ClassTable::ClassDescriptorHashEquals::operator()(const GcRoot<mirror::Class>& a, const GcRoot<mirror::Class>& b) const { DCHECK_EQ(a.Read()->GetClassLoader(), b.Read()->GetClassLoader()); std::string temp; return a.Read()->DescriptorEquals(b.Read()->GetDescriptor(&temp)); } bool ClassTable::ClassDescriptorHashEquals::operator()(const GcRoot<mirror::Class>& a, const char* descriptor) const { return a.Read()->DescriptorEquals(descriptor); } uint32_t ClassTable::ClassDescriptorHashEquals::operator()(const char* descriptor) const { return ComputeModifiedUtf8Hash(descriptor); } bool ClassTable::InsertStrongRoot(mirror::Object* obj) { WriterMutexLock mu(Thread::Current(), lock_); DCHECK(obj != nullptr); for (GcRoot<mirror::Object>& root : strong_roots_) { if (root.Read() == obj) { return false; } } strong_roots_.push_back(GcRoot<mirror::Object>(obj)); return true; } size_t ClassTable::WriteToMemory(uint8_t* ptr) const { ReaderMutexLock mu(Thread::Current(), lock_); ClassSet combined; // Combine all the class sets in case there are multiple, also adjusts load factor back to // default in case classes were pruned. for (const ClassSet& class_set : classes_) { for (const GcRoot<mirror::Class>& root : class_set) { combined.Insert(root); } } const size_t ret = combined.WriteToMemory(ptr); // Sanity check. if (kIsDebugBuild && ptr != nullptr) { size_t read_count; ClassSet class_set(ptr, /*make copy*/false, &read_count); class_set.Verify(); } return ret; } size_t ClassTable::ReadFromMemory(uint8_t* ptr) { size_t read_count = 0; AddClassSet(ClassSet(ptr, /*make copy*/false, &read_count)); return read_count; } void ClassTable::AddClassSet(ClassSet&& set) { WriterMutexLock mu(Thread::Current(), lock_); classes_.insert(classes_.begin(), std::move(set)); } void ClassTable::ClearStrongRoots() { WriterMutexLock mu(Thread::Current(), lock_); strong_roots_.clear(); } } // namespace art