/* * Copyright (C) 2011 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 "image_writer.h" #include #include #include #include #include #include #include #include #include "art_field-inl.h" #include "art_method-inl.h" #include "base/callee_save_type.h" #include "base/enums.h" #include "base/globals.h" #include "base/logging.h" // For VLOG. #include "base/stl_util.h" #include "base/unix_file/fd_file.h" #include "class_linker-inl.h" #include "class_root.h" #include "compiled_method.h" #include "dex/dex_file-inl.h" #include "dex/dex_file_types.h" #include "driver/compiler_options.h" #include "elf/elf_utils.h" #include "elf_file.h" #include "entrypoints/entrypoint_utils-inl.h" #include "gc/accounting/card_table-inl.h" #include "gc/accounting/heap_bitmap.h" #include "gc/accounting/space_bitmap-inl.h" #include "gc/collector/concurrent_copying.h" #include "gc/heap-visit-objects-inl.h" #include "gc/heap.h" #include "gc/space/large_object_space.h" #include "gc/space/region_space.h" #include "gc/space/space-inl.h" #include "gc/verification.h" #include "handle_scope-inl.h" #include "image-inl.h" #include "imt_conflict_table.h" #include "intern_table-inl.h" #include "jni/jni_internal.h" #include "linear_alloc.h" #include "lock_word.h" #include "mirror/array-inl.h" #include "mirror/class-inl.h" #include "mirror/class_ext-inl.h" #include "mirror/class_loader.h" #include "mirror/dex_cache-inl.h" #include "mirror/dex_cache.h" #include "mirror/executable.h" #include "mirror/method.h" #include "mirror/object-inl.h" #include "mirror/object-refvisitor-inl.h" #include "mirror/object_array-alloc-inl.h" #include "mirror/object_array-inl.h" #include "mirror/string-inl.h" #include "oat.h" #include "oat_file.h" #include "oat_file_manager.h" #include "optimizing/intrinsic_objects.h" #include "runtime.h" #include "scoped_thread_state_change-inl.h" #include "subtype_check.h" #include "utils/dex_cache_arrays_layout-inl.h" #include "well_known_classes.h" using ::art::mirror::Class; using ::art::mirror::DexCache; using ::art::mirror::Object; using ::art::mirror::ObjectArray; using ::art::mirror::String; namespace art { namespace linker { static ArrayRef MaybeCompressData(ArrayRef source, ImageHeader::StorageMode image_storage_mode, /*out*/ std::vector* storage) { const uint64_t compress_start_time = NanoTime(); switch (image_storage_mode) { case ImageHeader::kStorageModeLZ4: { storage->resize(LZ4_compressBound(source.size())); size_t data_size = LZ4_compress_default( reinterpret_cast(const_cast(source.data())), reinterpret_cast(storage->data()), source.size(), storage->size()); storage->resize(data_size); break; } case ImageHeader::kStorageModeLZ4HC: { // Bound is same as non HC. storage->resize(LZ4_compressBound(source.size())); size_t data_size = LZ4_compress_HC( reinterpret_cast(const_cast(source.data())), reinterpret_cast(storage->data()), source.size(), storage->size(), LZ4HC_CLEVEL_MAX); storage->resize(data_size); break; } case ImageHeader::kStorageModeUncompressed: { return source; } default: { LOG(FATAL) << "Unsupported"; UNREACHABLE(); } } DCHECK(image_storage_mode == ImageHeader::kStorageModeLZ4 || image_storage_mode == ImageHeader::kStorageModeLZ4HC); VLOG(compiler) << "Compressed from " << source.size() << " to " << storage->size() << " in " << PrettyDuration(NanoTime() - compress_start_time); if (kIsDebugBuild) { std::vector decompressed(source.size()); const size_t decompressed_size = LZ4_decompress_safe( reinterpret_cast(storage->data()), reinterpret_cast(decompressed.data()), storage->size(), decompressed.size()); CHECK_EQ(decompressed_size, decompressed.size()); CHECK_EQ(memcmp(source.data(), decompressed.data(), source.size()), 0) << image_storage_mode; } return ArrayRef(*storage); } // Separate objects into multiple bins to optimize dirty memory use. static constexpr bool kBinObjects = true; ObjPtr> AllocateBootImageLiveObjects( Thread* self, Runtime* runtime) REQUIRES_SHARED(Locks::mutator_lock_) { ClassLinker* class_linker = runtime->GetClassLinker(); // The objects used for the Integer.valueOf() intrinsic must remain live even if references // to them are removed using reflection. Image roots are not accessible through reflection, // so the array we construct here shall keep them alive. StackHandleScope<1> hs(self); Handle> integer_cache = hs.NewHandle(IntrinsicObjects::LookupIntegerCache(self, class_linker)); size_t live_objects_size = enum_cast(ImageHeader::kIntrinsicObjectsStart) + ((integer_cache != nullptr) ? (/* cache */ 1u + integer_cache->GetLength()) : 0u); ObjPtr> live_objects = mirror::ObjectArray::Alloc( self, GetClassRoot>(class_linker), live_objects_size); int32_t index = 0u; auto set_entry = [&](ImageHeader::BootImageLiveObjects entry, ObjPtr value) REQUIRES_SHARED(Locks::mutator_lock_) { DCHECK_EQ(index, enum_cast(entry)); live_objects->Set(index, value); ++index; }; set_entry(ImageHeader::kOomeWhenThrowingException, runtime->GetPreAllocatedOutOfMemoryErrorWhenThrowingException()); set_entry(ImageHeader::kOomeWhenThrowingOome, runtime->GetPreAllocatedOutOfMemoryErrorWhenThrowingOOME()); set_entry(ImageHeader::kOomeWhenHandlingStackOverflow, runtime->GetPreAllocatedOutOfMemoryErrorWhenHandlingStackOverflow()); set_entry(ImageHeader::kNoClassDefFoundError, runtime->GetPreAllocatedNoClassDefFoundError()); set_entry(ImageHeader::kClearedJniWeakSentinel, runtime->GetSentinel().Read()); DCHECK_EQ(index, enum_cast(ImageHeader::kIntrinsicObjectsStart)); if (integer_cache != nullptr) { live_objects->Set(index++, integer_cache.Get()); for (int32_t i = 0, length = integer_cache->GetLength(); i != length; ++i) { live_objects->Set(index++, integer_cache->Get(i)); } } CHECK_EQ(index, live_objects->GetLength()); if (kIsDebugBuild && integer_cache != nullptr) { CHECK_EQ(integer_cache.Get(), IntrinsicObjects::GetIntegerValueOfCache(live_objects)); for (int32_t i = 0, len = integer_cache->GetLength(); i != len; ++i) { CHECK_EQ(integer_cache->GetWithoutChecks(i), IntrinsicObjects::GetIntegerValueOfObject(live_objects, i)); } } return live_objects; } ObjPtr ImageWriter::GetAppClassLoader() const REQUIRES_SHARED(Locks::mutator_lock_) { return compiler_options_.IsAppImage() ? ObjPtr::DownCast(Thread::Current()->DecodeJObject(app_class_loader_)) : nullptr; } bool ImageWriter::IsImageDexCache(ObjPtr dex_cache) const { // For boot image, we keep all dex caches. if (compiler_options_.IsBootImage()) { return true; } // Dex caches already in the boot image do not belong to the image being written. if (IsInBootImage(dex_cache.Ptr())) { return false; } // Dex caches for the boot class path components that are not part of the boot image // cannot be garbage collected in PrepareImageAddressSpace() but we do not want to // include them in the app image. if (!ContainsElement(compiler_options_.GetDexFilesForOatFile(), dex_cache->GetDexFile())) { return false; } return true; } static void ClearDexFileCookies() REQUIRES_SHARED(Locks::mutator_lock_) { auto visitor = [](Object* obj) REQUIRES_SHARED(Locks::mutator_lock_) { DCHECK(obj != nullptr); Class* klass = obj->GetClass(); if (klass == WellKnownClasses::ToClass(WellKnownClasses::dalvik_system_DexFile)) { ArtField* field = jni::DecodeArtField(WellKnownClasses::dalvik_system_DexFile_cookie); // Null out the cookie to enable determinism. b/34090128 field->SetObject(obj, nullptr); } }; Runtime::Current()->GetHeap()->VisitObjects(visitor); } bool ImageWriter::PrepareImageAddressSpace(bool preload_dex_caches, TimingLogger* timings) { target_ptr_size_ = InstructionSetPointerSize(compiler_options_.GetInstructionSet()); Thread* const self = Thread::Current(); gc::Heap* const heap = Runtime::Current()->GetHeap(); { ScopedObjectAccess soa(self); { TimingLogger::ScopedTiming t("PruneNonImageClasses", timings); PruneNonImageClasses(); // Remove junk } if (compiler_options_.IsAppImage()) { TimingLogger::ScopedTiming t("ClearDexFileCookies", timings); // Clear dex file cookies for app images to enable app image determinism. This is required // since the cookie field contains long pointers to DexFiles which are not deterministic. // b/34090128 ClearDexFileCookies(); } } { TimingLogger::ScopedTiming t("CollectGarbage", timings); heap->CollectGarbage(/* clear_soft_references */ false); // Remove garbage. } if (kIsDebugBuild) { ScopedObjectAccess soa(self); CheckNonImageClassesRemoved(); } { // All remaining weak interns are referenced. Promote them to strong interns. Whether a // string was strongly or weakly interned, we shall make it strongly interned in the image. TimingLogger::ScopedTiming t("PromoteInterns", timings); ScopedObjectAccess soa(self); Runtime::Current()->GetInternTable()->PromoteWeakToStrong(); } if (preload_dex_caches) { TimingLogger::ScopedTiming t("PreloadDexCaches", timings); // Preload deterministic contents to the dex cache arrays we're going to write. ScopedObjectAccess soa(self); ObjPtr class_loader = GetAppClassLoader(); std::vector> dex_caches = FindDexCaches(self); for (ObjPtr dex_cache : dex_caches) { if (!IsImageDexCache(dex_cache)) { continue; // Boot image DexCache is not written to the app image. } PreloadDexCache(dex_cache, class_loader); } } { TimingLogger::ScopedTiming t("CalculateNewObjectOffsets", timings); ScopedObjectAccess soa(self); CalculateNewObjectOffsets(); } // Obtain class count for debugging purposes if (VLOG_IS_ON(compiler) && compiler_options_.IsAppImage()) { ScopedObjectAccess soa(self); size_t app_image_class_count = 0; for (ImageInfo& info : image_infos_) { info.class_table_->Visit([&](ObjPtr klass) REQUIRES_SHARED(Locks::mutator_lock_) { if (!IsInBootImage(klass.Ptr())) { ++app_image_class_count; } // Indicate that we would like to continue visiting classes. return true; }); } VLOG(compiler) << "Dex2Oat:AppImage:classCount = " << app_image_class_count; } // This needs to happen after CalculateNewObjectOffsets since it relies on intern_table_bytes_ and // bin size sums being calculated. TimingLogger::ScopedTiming t("AllocMemory", timings); return AllocMemory(); } void ImageWriter::CopyMetadata() { DCHECK(compiler_options_.IsAppImage()); CHECK_EQ(image_infos_.size(), 1u); const ImageInfo& image_info = image_infos_.back(); std::vector image_sections = image_info.CreateImageSections().second; auto* sfo_section_base = reinterpret_cast( image_info.image_.Begin() + image_sections[ImageHeader::kSectionStringReferenceOffsets].Offset()); std::copy(image_info.string_reference_offsets_.begin(), image_info.string_reference_offsets_.end(), sfo_section_base); } bool ImageWriter::IsInternedAppImageStringReference(ObjPtr referred_obj) const { return referred_obj != nullptr && !IsInBootImage(referred_obj.Ptr()) && referred_obj->IsString() && referred_obj == Runtime::Current()->GetInternTable()->LookupStrong( Thread::Current(), referred_obj->AsString()); } // Helper class that erases the image file if it isn't properly flushed and closed. class ImageWriter::ImageFileGuard { public: ImageFileGuard() noexcept = default; ImageFileGuard(ImageFileGuard&& other) noexcept = default; ImageFileGuard& operator=(ImageFileGuard&& other) noexcept = default; ~ImageFileGuard() { if (image_file_ != nullptr) { // Failure, erase the image file. image_file_->Erase(); } } void reset(File* image_file) { image_file_.reset(image_file); } bool operator==(std::nullptr_t) { return image_file_ == nullptr; } bool operator!=(std::nullptr_t) { return image_file_ != nullptr; } File* operator->() const { return image_file_.get(); } bool WriteHeaderAndClose(const std::string& image_filename, const ImageHeader* image_header) { // The header is uncompressed since it contains whether the image is compressed or not. if (!image_file_->PwriteFully(image_header, sizeof(ImageHeader), 0)) { PLOG(ERROR) << "Failed to write image file header " << image_filename; return false; } // FlushCloseOrErase() takes care of erasing, so the destructor does not need // to do that whether the FlushCloseOrErase() succeeds or fails. std::unique_ptr image_file = std::move(image_file_); if (image_file->FlushCloseOrErase() != 0) { PLOG(ERROR) << "Failed to flush and close image file " << image_filename; return false; } return true; } private: std::unique_ptr image_file_; }; bool ImageWriter::Write(int image_fd, const std::vector& image_filenames, size_t component_count) { // If image_fd or oat_fd are not kInvalidFd then we may have empty strings in image_filenames or // oat_filenames. CHECK(!image_filenames.empty()); if (image_fd != kInvalidFd) { CHECK_EQ(image_filenames.size(), 1u); } DCHECK(!oat_filenames_.empty()); CHECK_EQ(image_filenames.size(), oat_filenames_.size()); Thread* const self = Thread::Current(); { ScopedObjectAccess soa(self); for (size_t i = 0; i < oat_filenames_.size(); ++i) { CreateHeader(i, component_count); CopyAndFixupNativeData(i); } } { // TODO: heap validation can't handle these fix up passes. ScopedObjectAccess soa(self); Runtime::Current()->GetHeap()->DisableObjectValidation(); CopyAndFixupObjects(); } if (compiler_options_.IsAppImage()) { CopyMetadata(); } // Primary image header shall be written last for two reasons. First, this ensures // that we shall not end up with a valid primary image and invalid secondary image. // Second, its checksum shall include the checksums of the secondary images (XORed). // This way only the primary image checksum needs to be checked to determine whether // any of the images or oat files are out of date. (Oat file checksums are included // in the image checksum calculation.) ImageHeader* primary_header = reinterpret_cast(image_infos_[0].image_.Begin()); ImageFileGuard primary_image_file; for (size_t i = 0; i < image_filenames.size(); ++i) { const std::string& image_filename = image_filenames[i]; ImageInfo& image_info = GetImageInfo(i); ImageFileGuard image_file; if (image_fd != kInvalidFd) { // Ignore image_filename, it is supplied only for better diagnostic. image_file.reset(new File(image_fd, unix_file::kCheckSafeUsage)); // Empty the file in case it already exists. if (image_file != nullptr) { TEMP_FAILURE_RETRY(image_file->SetLength(0)); TEMP_FAILURE_RETRY(image_file->Flush()); } } else { image_file.reset(OS::CreateEmptyFile(image_filename.c_str())); } if (image_file == nullptr) { LOG(ERROR) << "Failed to open image file " << image_filename; return false; } // Make file world readable if we have created it, i.e. when not passed as file descriptor. if (image_fd == -1 && !compiler_options_.IsAppImage() && fchmod(image_file->Fd(), 0644) != 0) { PLOG(ERROR) << "Failed to make image file world readable: " << image_filename; return false; } // Image data size excludes the bitmap and the header. ImageHeader* const image_header = reinterpret_cast(image_info.image_.Begin()); // Block sources (from the image). const bool is_compressed = image_storage_mode_ != ImageHeader::kStorageModeUncompressed; std::vector> block_sources; std::vector blocks; // Add a set of solid blocks such that no block is larger than the maximum size. A solid block // is a block that must be decompressed all at once. auto add_blocks = [&](uint32_t offset, uint32_t size) { while (size != 0u) { const uint32_t cur_size = std::min(size, compiler_options_.MaxImageBlockSize()); block_sources.emplace_back(offset, cur_size); offset += cur_size; size -= cur_size; } }; add_blocks(sizeof(ImageHeader), image_header->GetImageSize() - sizeof(ImageHeader)); // Checksum of compressed image data and header. uint32_t image_checksum = adler32(0L, Z_NULL, 0); image_checksum = adler32(image_checksum, reinterpret_cast(image_header), sizeof(ImageHeader)); // Copy and compress blocks. size_t out_offset = sizeof(ImageHeader); for (const std::pair block : block_sources) { ArrayRef raw_image_data(image_info.image_.Begin() + block.first, block.second); std::vector compressed_data; ArrayRef image_data = MaybeCompressData(raw_image_data, image_storage_mode_, &compressed_data); if (!is_compressed) { // For uncompressed, preserve alignment since the image will be directly mapped. out_offset = block.first; } // Fill in the compressed location of the block. blocks.emplace_back(ImageHeader::Block( image_storage_mode_, /*data_offset=*/ out_offset, /*data_size=*/ image_data.size(), /*image_offset=*/ block.first, /*image_size=*/ block.second)); // Write out the image + fields + methods. if (!image_file->PwriteFully(image_data.data(), image_data.size(), out_offset)) { PLOG(ERROR) << "Failed to write image file data " << image_filename; image_file->Erase(); return false; } out_offset += image_data.size(); image_checksum = adler32(image_checksum, image_data.data(), image_data.size()); } // Write the block metadata directly after the image sections. // Note: This is not part of the mapped image and is not preserved after decompressing, it's // only used for image loading. For this reason, only write it out for compressed images. if (is_compressed) { // Align up since the compressed data is not necessarily aligned. out_offset = RoundUp(out_offset, alignof(ImageHeader::Block)); CHECK(!blocks.empty()); const size_t blocks_bytes = blocks.size() * sizeof(blocks[0]); if (!image_file->PwriteFully(&blocks[0], blocks_bytes, out_offset)) { PLOG(ERROR) << "Failed to write image blocks " << image_filename; image_file->Erase(); return false; } image_header->blocks_offset_ = out_offset; image_header->blocks_count_ = blocks.size(); out_offset += blocks_bytes; } // Data size includes everything except the bitmap. image_header->data_size_ = out_offset - sizeof(ImageHeader); // Update and write the bitmap section. Note that the bitmap section is relative to the // possibly compressed image. ImageSection& bitmap_section = image_header->GetImageSection(ImageHeader::kSectionImageBitmap); // Align up since data size may be unaligned if the image is compressed. out_offset = RoundUp(out_offset, kPageSize); bitmap_section = ImageSection(out_offset, bitmap_section.Size()); if (!image_file->PwriteFully(image_info.image_bitmap_.Begin(), bitmap_section.Size(), bitmap_section.Offset())) { PLOG(ERROR) << "Failed to write image file bitmap " << image_filename; return false; } int err = image_file->Flush(); if (err < 0) { PLOG(ERROR) << "Failed to flush image file " << image_filename << " with result " << err; return false; } // Calculate the image checksum of the remaining data. image_checksum = adler32(image_checksum, reinterpret_cast(image_info.image_bitmap_.Begin()), bitmap_section.Size()); image_header->SetImageChecksum(image_checksum); if (VLOG_IS_ON(compiler)) { const size_t separately_written_section_size = bitmap_section.Size(); const size_t total_uncompressed_size = image_info.image_size_ + separately_written_section_size; const size_t total_compressed_size = out_offset + separately_written_section_size; VLOG(compiler) << "Dex2Oat:uncompressedImageSize = " << total_uncompressed_size; if (total_uncompressed_size != total_compressed_size) { VLOG(compiler) << "Dex2Oat:compressedImageSize = " << total_compressed_size; } } CHECK_EQ(bitmap_section.End(), static_cast(image_file->GetLength())) << "Bitmap should be at the end of the file"; // Write header last in case the compiler gets killed in the middle of image writing. // We do not want to have a corrupted image with a valid header. // Delay the writing of the primary image header until after writing secondary images. if (i == 0u) { primary_image_file = std::move(image_file); } else { if (!image_file.WriteHeaderAndClose(image_filename, image_header)) { return false; } // Update the primary image checksum with the secondary image checksum. primary_header->SetImageChecksum(primary_header->GetImageChecksum() ^ image_checksum); } } DCHECK(primary_image_file != nullptr); if (!primary_image_file.WriteHeaderAndClose(image_filenames[0], primary_header)) { return false; } return true; } size_t ImageWriter::GetImageOffset(mirror::Object* object, size_t oat_index) const { BinSlot bin_slot = GetImageBinSlot(object, oat_index); const ImageInfo& image_info = GetImageInfo(oat_index); size_t offset = image_info.GetBinSlotOffset(bin_slot.GetBin()) + bin_slot.GetOffset(); DCHECK_LT(offset, image_info.image_end_); return offset; } void ImageWriter::SetImageBinSlot(mirror::Object* object, BinSlot bin_slot) { DCHECK(object != nullptr); DCHECK(!IsImageBinSlotAssigned(object)); // Before we stomp over the lock word, save the hash code for later. LockWord lw(object->GetLockWord(false)); switch (lw.GetState()) { case LockWord::kFatLocked: FALLTHROUGH_INTENDED; case LockWord::kThinLocked: { std::ostringstream oss; bool thin = (lw.GetState() == LockWord::kThinLocked); oss << (thin ? "Thin" : "Fat") << " locked object " << object << "(" << object->PrettyTypeOf() << ") found during object copy"; if (thin) { oss << ". Lock owner:" << lw.ThinLockOwner(); } LOG(FATAL) << oss.str(); UNREACHABLE(); } case LockWord::kUnlocked: // No hash, don't need to save it. break; case LockWord::kHashCode: DCHECK(saved_hashcode_map_.find(object) == saved_hashcode_map_.end()); saved_hashcode_map_.emplace(object, lw.GetHashCode()); break; default: LOG(FATAL) << "Unreachable."; UNREACHABLE(); } object->SetLockWord(LockWord::FromForwardingAddress(bin_slot.Uint32Value()), /*as_volatile=*/ false); DCHECK_EQ(object->GetLockWord(false).ReadBarrierState(), 0u); DCHECK(IsImageBinSlotAssigned(object)); } void ImageWriter::PrepareDexCacheArraySlots() { // Prepare dex cache array starts based on the ordering specified in the CompilerOptions. // Set the slot size early to avoid DCHECK() failures in IsImageBinSlotAssigned() // when AssignImageBinSlot() assigns their indexes out or order. for (const DexFile* dex_file : compiler_options_.GetDexFilesForOatFile()) { auto it = dex_file_oat_index_map_.find(dex_file); DCHECK(it != dex_file_oat_index_map_.end()) << dex_file->GetLocation(); ImageInfo& image_info = GetImageInfo(it->second); image_info.dex_cache_array_starts_.Put( dex_file, image_info.GetBinSlotSize(Bin::kDexCacheArray)); DexCacheArraysLayout layout(target_ptr_size_, dex_file); image_info.IncrementBinSlotSize(Bin::kDexCacheArray, layout.Size()); } ClassLinker* class_linker = Runtime::Current()->GetClassLinker(); Thread* const self = Thread::Current(); ReaderMutexLock mu(self, *Locks::dex_lock_); for (const ClassLinker::DexCacheData& data : class_linker->GetDexCachesData()) { ObjPtr dex_cache = ObjPtr::DownCast(self->DecodeJObject(data.weak_root)); if (dex_cache == nullptr || !IsImageDexCache(dex_cache)) { continue; } const DexFile* dex_file = dex_cache->GetDexFile(); CHECK(dex_file_oat_index_map_.find(dex_file) != dex_file_oat_index_map_.end()) << "Dex cache should have been pruned " << dex_file->GetLocation() << "; possibly in class path"; DexCacheArraysLayout layout(target_ptr_size_, dex_file); // Empty dex files will not have a "valid" DexCacheArraysLayout. if (dex_file->NumTypeIds() + dex_file->NumStringIds() + dex_file->NumMethodIds() + dex_file->NumFieldIds() + dex_file->NumProtoIds() + dex_file->NumCallSiteIds() != 0) { DCHECK(layout.Valid()); } size_t oat_index = GetOatIndexForDexFile(dex_file); ImageInfo& image_info = GetImageInfo(oat_index); uint32_t start = image_info.dex_cache_array_starts_.Get(dex_file); DCHECK_EQ(dex_file->NumTypeIds() != 0u, dex_cache->GetResolvedTypes() != nullptr); AddDexCacheArrayRelocation(dex_cache->GetResolvedTypes(), start + layout.TypesOffset(), oat_index); DCHECK_EQ(dex_file->NumMethodIds() != 0u, dex_cache->GetResolvedMethods() != nullptr); AddDexCacheArrayRelocation(dex_cache->GetResolvedMethods(), start + layout.MethodsOffset(), oat_index); DCHECK_EQ(dex_file->NumFieldIds() != 0u, dex_cache->GetResolvedFields() != nullptr); AddDexCacheArrayRelocation(dex_cache->GetResolvedFields(), start + layout.FieldsOffset(), oat_index); DCHECK_EQ(dex_file->NumStringIds() != 0u, dex_cache->GetStrings() != nullptr); AddDexCacheArrayRelocation(dex_cache->GetStrings(), start + layout.StringsOffset(), oat_index); AddDexCacheArrayRelocation(dex_cache->GetResolvedMethodTypes(), start + layout.MethodTypesOffset(), oat_index); AddDexCacheArrayRelocation(dex_cache->GetResolvedCallSites(), start + layout.CallSitesOffset(), oat_index); // Preresolved strings aren't part of the special layout. GcRoot* preresolved_strings = dex_cache->GetPreResolvedStrings(); if (preresolved_strings != nullptr) { DCHECK(!IsInBootImage(preresolved_strings)); // Add the array to the metadata section. const size_t count = dex_cache->NumPreResolvedStrings(); auto bin = BinTypeForNativeRelocationType(NativeObjectRelocationType::kGcRootPointer); for (size_t i = 0; i < count; ++i) { native_object_relocations_.emplace(&preresolved_strings[i], NativeObjectRelocation { oat_index, image_info.GetBinSlotSize(bin), NativeObjectRelocationType::kGcRootPointer }); image_info.IncrementBinSlotSize(bin, sizeof(GcRoot)); } } } } void ImageWriter::AddDexCacheArrayRelocation(void* array, size_t offset, size_t oat_index) { if (array != nullptr) { DCHECK(!IsInBootImage(array)); native_object_relocations_.emplace(array, NativeObjectRelocation { oat_index, offset, NativeObjectRelocationType::kDexCacheArray }); } } void ImageWriter::AddMethodPointerArray(ObjPtr arr) { DCHECK(arr != nullptr); if (kIsDebugBuild) { for (size_t i = 0, len = arr->GetLength(); i < len; i++) { ArtMethod* method = arr->GetElementPtrSize(i, target_ptr_size_); if (method != nullptr && !method->IsRuntimeMethod()) { ObjPtr klass = method->GetDeclaringClass(); CHECK(klass == nullptr || KeepClass(klass)) << Class::PrettyClass(klass) << " should be a kept class"; } } } // kBinArtMethodClean picked arbitrarily, just required to differentiate between ArtFields and // ArtMethods. pointer_arrays_.emplace(arr.Ptr(), Bin::kArtMethodClean); } ImageWriter::Bin ImageWriter::AssignImageBinSlot(mirror::Object* object, size_t oat_index) { DCHECK(object != nullptr); size_t object_size = object->SizeOf(); // The magic happens here. We segregate objects into different bins based // on how likely they are to get dirty at runtime. // // Likely-to-dirty objects get packed together into the same bin so that // at runtime their page dirtiness ratio (how many dirty objects a page has) is // maximized. // // This means more pages will stay either clean or shared dirty (with zygote) and // the app will use less of its own (private) memory. Bin bin = Bin::kRegular; if (kBinObjects) { // // Changing the bin of an object is purely a memory-use tuning. // It has no change on runtime correctness. // // Memory analysis has determined that the following types of objects get dirtied // the most: // // * Dex cache arrays are stored in a special bin. The arrays for each dex cache have // a fixed layout which helps improve generated code (using PC-relative addressing), // so we pre-calculate their offsets separately in PrepareDexCacheArraySlots(). // Since these arrays are huge, most pages do not overlap other objects and it's not // really important where they are for the clean/dirty separation. Due to their // special PC-relative addressing, we arbitrarily keep them at the end. // * Class'es which are verified [their clinit runs only at runtime] // - classes in general [because their static fields get overwritten] // - initialized classes with all-final statics are unlikely to be ever dirty, // so bin them separately // * Art Methods that are: // - native [their native entry point is not looked up until runtime] // - have declaring classes that aren't initialized // [their interpreter/quick entry points are trampolines until the class // becomes initialized] // // We also assume the following objects get dirtied either never or extremely rarely: // * Strings (they are immutable) // * Art methods that aren't native and have initialized declared classes // // We assume that "regular" bin objects are highly unlikely to become dirtied, // so packing them together will not result in a noticeably tighter dirty-to-clean ratio. // if (object->IsClass()) { bin = Bin::kClassVerified; ObjPtr klass = object->AsClass(); // Add non-embedded vtable to the pointer array table if there is one. ObjPtr vtable = klass->GetVTable(); if (vtable != nullptr) { AddMethodPointerArray(vtable); } ObjPtr iftable = klass->GetIfTable(); if (iftable != nullptr) { for (int32_t i = 0; i < klass->GetIfTableCount(); ++i) { if (iftable->GetMethodArrayCount(i) > 0) { AddMethodPointerArray(iftable->GetMethodArray(i)); } } } // Move known dirty objects into their own sections. This includes: // - classes with dirty static fields. if (dirty_image_objects_ != nullptr && dirty_image_objects_->find(klass->PrettyDescriptor()) != dirty_image_objects_->end()) { bin = Bin::kKnownDirty; } else if (klass->GetStatus() == ClassStatus::kVisiblyInitialized) { bin = Bin::kClassInitialized; // If the class's static fields are all final, put it into a separate bin // since it's very likely it will stay clean. uint32_t num_static_fields = klass->NumStaticFields(); if (num_static_fields == 0) { bin = Bin::kClassInitializedFinalStatics; } else { // Maybe all the statics are final? bool all_final = true; for (uint32_t i = 0; i < num_static_fields; ++i) { ArtField* field = klass->GetStaticField(i); if (!field->IsFinal()) { all_final = false; break; } } if (all_final) { bin = Bin::kClassInitializedFinalStatics; } } } } else if (object->GetClass()->IsStringClass()) { bin = Bin::kString; // Strings are almost always immutable (except for object header). } else if (object->GetClass() == GetClassRoot()) { // Instance of java lang object, probably a lock object. This means it will be dirty when we // synchronize on it. bin = Bin::kMiscDirty; } else if (object->IsDexCache()) { // Dex file field becomes dirty when the image is loaded. bin = Bin::kMiscDirty; } // else bin = kBinRegular } // Assign the oat index too. DCHECK(oat_index_map_.find(object) == oat_index_map_.end()); oat_index_map_.emplace(object, oat_index); ImageInfo& image_info = GetImageInfo(oat_index); size_t offset_delta = RoundUp(object_size, kObjectAlignment); // 64-bit alignment // How many bytes the current bin is at (aligned). size_t current_offset = image_info.GetBinSlotSize(bin); // Move the current bin size up to accommodate the object we just assigned a bin slot. image_info.IncrementBinSlotSize(bin, offset_delta); BinSlot new_bin_slot(bin, current_offset); SetImageBinSlot(object, new_bin_slot); image_info.IncrementBinSlotCount(bin, 1u); // Grow the image closer to the end by the object we just assigned. image_info.image_end_ += offset_delta; return bin; } bool ImageWriter::WillMethodBeDirty(ArtMethod* m) const { if (m->IsNative()) { return true; } ObjPtr declaring_class = m->GetDeclaringClass(); // Initialized is highly unlikely to dirty since there's no entry points to mutate. return declaring_class == nullptr || declaring_class->GetStatus() != ClassStatus::kVisiblyInitialized; } bool ImageWriter::IsImageBinSlotAssigned(mirror::Object* object) const { DCHECK(object != nullptr); // We always stash the bin slot into a lockword, in the 'forwarding address' state. // If it's in some other state, then we haven't yet assigned an image bin slot. if (object->GetLockWord(false).GetState() != LockWord::kForwardingAddress) { return false; } else if (kIsDebugBuild) { LockWord lock_word = object->GetLockWord(false); size_t offset = lock_word.ForwardingAddress(); BinSlot bin_slot(offset); size_t oat_index = GetOatIndex(object); const ImageInfo& image_info = GetImageInfo(oat_index); DCHECK_LT(bin_slot.GetOffset(), image_info.GetBinSlotSize(bin_slot.GetBin())) << "bin slot offset should not exceed the size of that bin"; } return true; } ImageWriter::BinSlot ImageWriter::GetImageBinSlot(mirror::Object* object, size_t oat_index) const { DCHECK(object != nullptr); DCHECK(IsImageBinSlotAssigned(object)); LockWord lock_word = object->GetLockWord(false); size_t offset = lock_word.ForwardingAddress(); // TODO: ForwardingAddress should be uint32_t DCHECK_LE(offset, std::numeric_limits::max()); BinSlot bin_slot(static_cast(offset)); DCHECK_LT(bin_slot.GetOffset(), GetImageInfo(oat_index).GetBinSlotSize(bin_slot.GetBin())); return bin_slot; } void ImageWriter::UpdateImageBinSlotOffset(mirror::Object* object, size_t oat_index, size_t new_offset) { BinSlot old_bin_slot = GetImageBinSlot(object, oat_index); DCHECK_LT(new_offset, GetImageInfo(oat_index).GetBinSlotSize(old_bin_slot.GetBin())); BinSlot new_bin_slot(old_bin_slot.GetBin(), new_offset); object->SetLockWord(LockWord::FromForwardingAddress(new_bin_slot.Uint32Value()), /*as_volatile=*/ false); DCHECK_EQ(object->GetLockWord(false).ReadBarrierState(), 0u); DCHECK(IsImageBinSlotAssigned(object)); } bool ImageWriter::AllocMemory() { for (ImageInfo& image_info : image_infos_) { const size_t length = RoundUp(image_info.CreateImageSections().first, kPageSize); std::string error_msg; image_info.image_ = MemMap::MapAnonymous("image writer image", length, PROT_READ | PROT_WRITE, /*low_4gb=*/ false, &error_msg); if (UNLIKELY(!image_info.image_.IsValid())) { LOG(ERROR) << "Failed to allocate memory for image file generation: " << error_msg; return false; } // Create the image bitmap, only needs to cover mirror object section which is up to image_end_. CHECK_LE(image_info.image_end_, length); image_info.image_bitmap_ = gc::accounting::ContinuousSpaceBitmap::Create( "image bitmap", image_info.image_.Begin(), RoundUp(image_info.image_end_, kPageSize)); if (!image_info.image_bitmap_.IsValid()) { LOG(ERROR) << "Failed to allocate memory for image bitmap"; return false; } } return true; } static bool IsBootClassLoaderClass(ObjPtr klass) REQUIRES_SHARED(Locks::mutator_lock_) { return klass->GetClassLoader() == nullptr; } bool ImageWriter::IsBootClassLoaderNonImageClass(mirror::Class* klass) { return IsBootClassLoaderClass(klass) && !IsInBootImage(klass); } // This visitor follows the references of an instance, recursively then prune this class // if a type of any field is pruned. class ImageWriter::PruneObjectReferenceVisitor { public: PruneObjectReferenceVisitor(ImageWriter* image_writer, bool* early_exit, std::unordered_set* visited, bool* result) : image_writer_(image_writer), early_exit_(early_exit), visited_(visited), result_(result) {} ALWAYS_INLINE void VisitRootIfNonNull( mirror::CompressedReference* root ATTRIBUTE_UNUSED) const REQUIRES_SHARED(Locks::mutator_lock_) { } ALWAYS_INLINE void VisitRoot( mirror::CompressedReference* root ATTRIBUTE_UNUSED) const REQUIRES_SHARED(Locks::mutator_lock_) { } ALWAYS_INLINE void operator() (ObjPtr obj, MemberOffset offset, bool is_static ATTRIBUTE_UNUSED) const REQUIRES_SHARED(Locks::mutator_lock_) { mirror::Object* ref = obj->GetFieldObject(offset); if (ref == nullptr || visited_->find(ref) != visited_->end()) { return; } ObjPtr> class_roots = Runtime::Current()->GetClassLinker()->GetClassRoots(); ObjPtr klass = ref->IsClass() ? ref->AsClass() : ref->GetClass(); if (klass == GetClassRoot(class_roots) || klass == GetClassRoot(class_roots)) { // Prune all classes using reflection because the content they held will not be fixup. *result_ = true; } if (ref->IsClass()) { *result_ = *result_ || image_writer_->PruneImageClassInternal(ref->AsClass(), early_exit_, visited_); } else { // Record the object visited in case of circular reference. visited_->emplace(ref); *result_ = *result_ || image_writer_->PruneImageClassInternal(klass, early_exit_, visited_); ref->VisitReferences(*this, *this); // Clean up before exit for next call of this function. visited_->erase(ref); } } ALWAYS_INLINE void operator() (ObjPtr klass ATTRIBUTE_UNUSED, ObjPtr ref) const REQUIRES_SHARED(Locks::mutator_lock_) { operator()(ref, mirror::Reference::ReferentOffset(), /* is_static */ false); } private: ImageWriter* image_writer_; bool* early_exit_; std::unordered_set* visited_; bool* const result_; }; bool ImageWriter::PruneImageClass(ObjPtr klass) { bool early_exit = false; std::unordered_set visited; return PruneImageClassInternal(klass, &early_exit, &visited); } bool ImageWriter::PruneImageClassInternal( ObjPtr klass, bool* early_exit, std::unordered_set* visited) { DCHECK(early_exit != nullptr); DCHECK(visited != nullptr); DCHECK(compiler_options_.IsAppImage() || compiler_options_.IsBootImageExtension()); if (klass == nullptr || IsInBootImage(klass.Ptr())) { return false; } auto found = prune_class_memo_.find(klass.Ptr()); if (found != prune_class_memo_.end()) { // Already computed, return the found value. return found->second; } // Circular dependencies, return false but do not store the result in the memoization table. if (visited->find(klass.Ptr()) != visited->end()) { *early_exit = true; return false; } visited->emplace(klass.Ptr()); bool result = IsBootClassLoaderClass(klass); std::string temp; // Prune if not an image class, this handles any broken sets of image classes such as having a // class in the set but not it's superclass. result = result || !compiler_options_.IsImageClass(klass->GetDescriptor(&temp)); bool my_early_exit = false; // Only for ourselves, ignore caller. // Remove classes that failed to verify since we don't want to have java.lang.VerifyError in the // app image. if (klass->IsErroneous()) { result = true; } else { ObjPtr ext(klass->GetExtData()); CHECK(ext.IsNull() || ext->GetVerifyError() == nullptr) << klass->PrettyClass(); } if (!result) { // Check interfaces since these wont be visited through VisitReferences.) ObjPtr if_table = klass->GetIfTable(); for (size_t i = 0, num_interfaces = klass->GetIfTableCount(); i < num_interfaces; ++i) { result = result || PruneImageClassInternal(if_table->GetInterface(i), &my_early_exit, visited); } } if (klass->IsObjectArrayClass()) { result = result || PruneImageClassInternal(klass->GetComponentType(), &my_early_exit, visited); } // Check static fields and their classes. if (klass->IsResolved() && klass->NumReferenceStaticFields() != 0) { size_t num_static_fields = klass->NumReferenceStaticFields(); // Presumably GC can happen when we are cross compiling, it should not cause performance // problems to do pointer size logic. MemberOffset field_offset = klass->GetFirstReferenceStaticFieldOffset( Runtime::Current()->GetClassLinker()->GetImagePointerSize()); for (size_t i = 0u; i < num_static_fields; ++i) { mirror::Object* ref = klass->GetFieldObject(field_offset); if (ref != nullptr) { if (ref->IsClass()) { result = result || PruneImageClassInternal(ref->AsClass(), &my_early_exit, visited); } else { mirror::Class* type = ref->GetClass(); result = result || PruneImageClassInternal(type, &my_early_exit, visited); if (!result) { // For non-class case, also go through all the types mentioned by it's fields' // references recursively to decide whether to keep this class. bool tmp = false; PruneObjectReferenceVisitor visitor(this, &my_early_exit, visited, &tmp); ref->VisitReferences(visitor, visitor); result = result || tmp; } } } field_offset = MemberOffset(field_offset.Uint32Value() + sizeof(mirror::HeapReference)); } } result = result || PruneImageClassInternal(klass->GetSuperClass(), &my_early_exit, visited); // Remove the class if the dex file is not in the set of dex files. This happens for classes that // are from uses-library if there is no profile. b/30688277 ObjPtr dex_cache = klass->GetDexCache(); if (dex_cache != nullptr) { result = result || dex_file_oat_index_map_.find(dex_cache->GetDexFile()) == dex_file_oat_index_map_.end(); } // Erase the element we stored earlier since we are exiting the function. auto it = visited->find(klass.Ptr()); DCHECK(it != visited->end()); visited->erase(it); // Only store result if it is true or none of the calls early exited due to circular // dependencies. If visited is empty then we are the root caller, in this case the cycle was in // a child call and we can remember the result. if (result == true || !my_early_exit || visited->empty()) { prune_class_memo_[klass.Ptr()] = result; } *early_exit |= my_early_exit; return result; } bool ImageWriter::KeepClass(ObjPtr klass) { if (klass == nullptr) { return false; } if (IsInBootImage(klass.Ptr())) { // Already in boot image, return true. DCHECK(!compiler_options_.IsBootImage()); return true; } std::string temp; if (!compiler_options_.IsImageClass(klass->GetDescriptor(&temp))) { return false; } if (compiler_options_.IsAppImage()) { // For app images, we need to prune classes that // are defined by the boot class path we're compiling against but not in // the boot image spaces since these may have already been loaded at // run time when this image is loaded. Keep classes in the boot image // spaces we're compiling against since we don't want to re-resolve these. return !PruneImageClass(klass); } return true; } class ImageWriter::PruneClassesVisitor : public ClassVisitor { public: PruneClassesVisitor(ImageWriter* image_writer, ObjPtr class_loader) : image_writer_(image_writer), class_loader_(class_loader), classes_to_prune_(), defined_class_count_(0u) { } bool operator()(ObjPtr klass) override REQUIRES_SHARED(Locks::mutator_lock_) { if (!image_writer_->KeepClass(klass.Ptr())) { classes_to_prune_.insert(klass.Ptr()); if (klass->GetClassLoader() == class_loader_) { ++defined_class_count_; } } return true; } size_t Prune() REQUIRES_SHARED(Locks::mutator_lock_) { ClassTable* class_table = Runtime::Current()->GetClassLinker()->ClassTableForClassLoader(class_loader_); for (mirror::Class* klass : classes_to_prune_) { std::string storage; const char* descriptor = klass->GetDescriptor(&storage); bool result = class_table->Remove(descriptor); DCHECK(result); DCHECK(!class_table->Remove(descriptor)) << descriptor; } return defined_class_count_; } private: ImageWriter* const image_writer_; const ObjPtr class_loader_; std::unordered_set classes_to_prune_; size_t defined_class_count_; }; class ImageWriter::PruneClassLoaderClassesVisitor : public ClassLoaderVisitor { public: explicit PruneClassLoaderClassesVisitor(ImageWriter* image_writer) : image_writer_(image_writer), removed_class_count_(0) {} void Visit(ObjPtr class_loader) override REQUIRES_SHARED(Locks::mutator_lock_) { PruneClassesVisitor classes_visitor(image_writer_, class_loader); ClassTable* class_table = Runtime::Current()->GetClassLinker()->ClassTableForClassLoader(class_loader); class_table->Visit(classes_visitor); removed_class_count_ += classes_visitor.Prune(); } size_t GetRemovedClassCount() const { return removed_class_count_; } private: ImageWriter* const image_writer_; size_t removed_class_count_; }; void ImageWriter::VisitClassLoaders(ClassLoaderVisitor* visitor) { WriterMutexLock mu(Thread::Current(), *Locks::classlinker_classes_lock_); visitor->Visit(nullptr); // Visit boot class loader. Runtime::Current()->GetClassLinker()->VisitClassLoaders(visitor); } void ImageWriter::ClearDexCache(ObjPtr dex_cache) { // Clear methods. mirror::MethodDexCacheType* resolved_methods = dex_cache->GetResolvedMethods(); for (size_t slot_idx = 0, num = dex_cache->NumResolvedMethods(); slot_idx != num; ++slot_idx) { auto pair = mirror::DexCache::GetNativePairPtrSize(resolved_methods, slot_idx, target_ptr_size_); if (pair.object != nullptr) { dex_cache->ClearResolvedMethod(pair.index, target_ptr_size_); } } // Clear fields. mirror::FieldDexCacheType* resolved_fields = dex_cache->GetResolvedFields(); for (size_t slot_idx = 0, num = dex_cache->NumResolvedFields(); slot_idx != num; ++slot_idx) { auto pair = mirror::DexCache::GetNativePairPtrSize(resolved_fields, slot_idx, target_ptr_size_); if (pair.object != nullptr) { dex_cache->ClearResolvedField(pair.index, target_ptr_size_); } } // Clear types. for (size_t slot_idx = 0, num = dex_cache->NumResolvedTypes(); slot_idx != num; ++slot_idx) { mirror::TypeDexCachePair pair = dex_cache->GetResolvedTypes()[slot_idx].load(std::memory_order_relaxed); if (!pair.object.IsNull()) { dex_cache->ClearResolvedType(dex::TypeIndex(pair.index)); } } // Clear strings. for (size_t slot_idx = 0, num = dex_cache->NumStrings(); slot_idx != num; ++slot_idx) { mirror::StringDexCachePair pair = dex_cache->GetStrings()[slot_idx].load(std::memory_order_relaxed); if (!pair.object.IsNull()) { dex_cache->ClearString(dex::StringIndex(pair.index)); } } } void ImageWriter::PreloadDexCache(ObjPtr dex_cache, ObjPtr class_loader) { // To ensure deterministic contents of the hash-based arrays, each slot shall contain // the candidate with the lowest index. As we're processing entries in increasing index // order, this means trying to look up the entry for the current index if the slot is // empty or if it contains a higher index. Runtime* runtime = Runtime::Current(); ClassLinker* class_linker = runtime->GetClassLinker(); const DexFile& dex_file = *dex_cache->GetDexFile(); // Preload the methods array and make the contents deterministic. mirror::MethodDexCacheType* resolved_methods = dex_cache->GetResolvedMethods(); dex::TypeIndex last_class_idx; // Initialized to invalid index. ObjPtr last_class = nullptr; for (size_t i = 0, num = dex_cache->GetDexFile()->NumMethodIds(); i != num; ++i) { uint32_t slot_idx = dex_cache->MethodSlotIndex(i); auto pair = mirror::DexCache::GetNativePairPtrSize(resolved_methods, slot_idx, target_ptr_size_); uint32_t stored_index = pair.index; ArtMethod* method = pair.object; if (method != nullptr && i > stored_index) { continue; // Already checked. } // Check if the referenced class is in the image. Note that we want to check the referenced // class rather than the declaring class to preserve the semantics, i.e. using a MethodId // results in resolving the referenced class and that can for example throw OOME. const dex::MethodId& method_id = dex_file.GetMethodId(i); if (method_id.class_idx_ != last_class_idx) { last_class_idx = method_id.class_idx_; last_class = class_linker->LookupResolvedType(last_class_idx, dex_cache, class_loader); } if (method == nullptr || i < stored_index) { if (last_class != nullptr) { // Try to resolve the method with the class linker, which will insert // it into the dex cache if successful. method = class_linker->FindResolvedMethod(last_class, dex_cache, class_loader, i); DCHECK(method == nullptr || dex_cache->GetResolvedMethod(i, target_ptr_size_) == method); } } else { DCHECK_EQ(i, stored_index); DCHECK(last_class != nullptr); } } // Preload the fields array and make the contents deterministic. mirror::FieldDexCacheType* resolved_fields = dex_cache->GetResolvedFields(); last_class_idx = dex::TypeIndex(); // Initialized to invalid index. last_class = nullptr; for (size_t i = 0, end = dex_file.NumFieldIds(); i < end; ++i) { uint32_t slot_idx = dex_cache->FieldSlotIndex(i); auto pair = mirror::DexCache::GetNativePairPtrSize(resolved_fields, slot_idx, target_ptr_size_); uint32_t stored_index = pair.index; ArtField* field = pair.object; if (field != nullptr && i > stored_index) { continue; // Already checked. } // Check if the referenced class is in the image. Note that we want to check the referenced // class rather than the declaring class to preserve the semantics, i.e. using a FieldId // results in resolving the referenced class and that can for example throw OOME. const dex::FieldId& field_id = dex_file.GetFieldId(i); if (field_id.class_idx_ != last_class_idx) { last_class_idx = field_id.class_idx_; last_class = class_linker->LookupResolvedType(last_class_idx, dex_cache, class_loader); if (last_class != nullptr && !KeepClass(last_class)) { last_class = nullptr; } } if (field == nullptr || i < stored_index) { if (last_class != nullptr) { // Try to resolve the field with the class linker, which will insert // it into the dex cache if successful. field = class_linker->FindResolvedFieldJLS(last_class, dex_cache, class_loader, i); DCHECK(field == nullptr || dex_cache->GetResolvedField(i, target_ptr_size_) == field); } } else { DCHECK_EQ(i, stored_index); DCHECK(last_class != nullptr); } } // Preload the types array and make the contents deterministic. // This is done after fields and methods as their lookup can touch the types array. for (size_t i = 0, end = dex_cache->GetDexFile()->NumTypeIds(); i < end; ++i) { dex::TypeIndex type_idx(i); uint32_t slot_idx = dex_cache->TypeSlotIndex(type_idx); mirror::TypeDexCachePair pair = dex_cache->GetResolvedTypes()[slot_idx].load(std::memory_order_relaxed); uint32_t stored_index = pair.index; ObjPtr klass = pair.object.Read(); if (klass == nullptr || i < stored_index) { klass = class_linker->LookupResolvedType(type_idx, dex_cache, class_loader); DCHECK(klass == nullptr || dex_cache->GetResolvedType(type_idx) == klass); } } // Preload the strings array and make the contents deterministic. for (size_t i = 0, end = dex_cache->GetDexFile()->NumStringIds(); i < end; ++i) { dex::StringIndex string_idx(i); uint32_t slot_idx = dex_cache->StringSlotIndex(string_idx); mirror::StringDexCachePair pair = dex_cache->GetStrings()[slot_idx].load(std::memory_order_relaxed); uint32_t stored_index = pair.index; ObjPtr string = pair.object.Read(); if (string == nullptr || i < stored_index) { string = class_linker->LookupString(string_idx, dex_cache); DCHECK(string == nullptr || dex_cache->GetResolvedString(string_idx) == string); } } } void ImageWriter::PruneNonImageClasses() { Runtime* runtime = Runtime::Current(); ClassLinker* class_linker = runtime->GetClassLinker(); Thread* self = Thread::Current(); ScopedAssertNoThreadSuspension sa(__FUNCTION__); // Prune uses-library dex caches. Only prune the uses-library dex caches since we want to make // sure the other ones don't get unloaded before the OatWriter runs. class_linker->VisitClassTables( [&](ClassTable* table) REQUIRES_SHARED(Locks::mutator_lock_) { table->RemoveStrongRoots( [&](GcRoot root) REQUIRES_SHARED(Locks::mutator_lock_) { ObjPtr obj = root.Read(); if (obj->IsDexCache()) { // Return true if the dex file is not one of the ones in the map. return dex_file_oat_index_map_.find(obj->AsDexCache()->GetDexFile()) == dex_file_oat_index_map_.end(); } // Return false to avoid removing. return false; }); }); // Remove the undesired classes from the class roots. { PruneClassLoaderClassesVisitor class_loader_visitor(this); VisitClassLoaders(&class_loader_visitor); VLOG(compiler) << "Pruned " << class_loader_visitor.GetRemovedClassCount() << " classes"; } // Completely clear DexCaches. They shall be re-filled in PreloadDexCaches if requested. std::vector> dex_caches = FindDexCaches(self); for (ObjPtr dex_cache : dex_caches) { ClearDexCache(dex_cache); } // Drop the array class cache in the ClassLinker, as these are roots holding those classes live. class_linker->DropFindArrayClassCache(); // Clear to save RAM. prune_class_memo_.clear(); } std::vector> ImageWriter::FindDexCaches(Thread* self) { std::vector> dex_caches; ClassLinker* class_linker = Runtime::Current()->GetClassLinker(); ReaderMutexLock mu2(self, *Locks::dex_lock_); dex_caches.reserve(class_linker->GetDexCachesData().size()); for (const ClassLinker::DexCacheData& data : class_linker->GetDexCachesData()) { if (self->IsJWeakCleared(data.weak_root)) { continue; } dex_caches.push_back(self->DecodeJObject(data.weak_root)->AsDexCache()); } return dex_caches; } void ImageWriter::CheckNonImageClassesRemoved() { auto visitor = [&](Object* obj) REQUIRES_SHARED(Locks::mutator_lock_) { if (obj->IsClass() && !IsInBootImage(obj)) { ObjPtr klass = obj->AsClass(); if (!KeepClass(klass)) { DumpImageClasses(); CHECK(KeepClass(klass)) << Runtime::Current()->GetHeap()->GetVerification()->FirstPathFromRootSet(klass); } } }; gc::Heap* heap = Runtime::Current()->GetHeap(); heap->VisitObjects(visitor); } void ImageWriter::DumpImageClasses() { for (const std::string& image_class : compiler_options_.GetImageClasses()) { LOG(INFO) << " " << image_class; } } ObjPtr> ImageWriter::CollectDexCaches(Thread* self, size_t oat_index) const { std::unordered_set image_dex_files; for (auto& pair : dex_file_oat_index_map_) { const DexFile* image_dex_file = pair.first; size_t image_oat_index = pair.second; if (oat_index == image_oat_index) { image_dex_files.insert(image_dex_file); } } // build an Object[] of all the DexCaches used in the source_space_. // Since we can't hold the dex lock when allocating the dex_caches // ObjectArray, we lock the dex lock twice, first to get the number // of dex caches first and then lock it again to copy the dex // caches. We check that the number of dex caches does not change. ClassLinker* class_linker = Runtime::Current()->GetClassLinker(); size_t dex_cache_count = 0; { ReaderMutexLock mu(self, *Locks::dex_lock_); // Count number of dex caches not in the boot image. for (const ClassLinker::DexCacheData& data : class_linker->GetDexCachesData()) { ObjPtr dex_cache = ObjPtr::DownCast(self->DecodeJObject(data.weak_root)); if (dex_cache == nullptr) { continue; } const DexFile* dex_file = dex_cache->GetDexFile(); if (IsImageDexCache(dex_cache)) { dex_cache_count += image_dex_files.find(dex_file) != image_dex_files.end() ? 1u : 0u; } } } ObjPtr> dex_caches = ObjectArray::Alloc( self, GetClassRoot>(class_linker), dex_cache_count); CHECK(dex_caches != nullptr) << "Failed to allocate a dex cache array."; { ReaderMutexLock mu(self, *Locks::dex_lock_); size_t non_image_dex_caches = 0; // Re-count number of non image dex caches. for (const ClassLinker::DexCacheData& data : class_linker->GetDexCachesData()) { ObjPtr dex_cache = ObjPtr::DownCast(self->DecodeJObject(data.weak_root)); if (dex_cache == nullptr) { continue; } const DexFile* dex_file = dex_cache->GetDexFile(); if (IsImageDexCache(dex_cache)) { non_image_dex_caches += image_dex_files.find(dex_file) != image_dex_files.end() ? 1u : 0u; } } CHECK_EQ(dex_cache_count, non_image_dex_caches) << "The number of non-image dex caches changed."; size_t i = 0; for (const ClassLinker::DexCacheData& data : class_linker->GetDexCachesData()) { ObjPtr dex_cache = ObjPtr::DownCast(self->DecodeJObject(data.weak_root)); if (dex_cache == nullptr) { continue; } const DexFile* dex_file = dex_cache->GetDexFile(); if (IsImageDexCache(dex_cache) && image_dex_files.find(dex_file) != image_dex_files.end()) { dex_caches->Set(i, dex_cache.Ptr()); ++i; } } } return dex_caches; } ObjPtr> ImageWriter::CreateImageRoots( size_t oat_index, Handle> boot_image_live_objects) const { Runtime* runtime = Runtime::Current(); ClassLinker* class_linker = runtime->GetClassLinker(); Thread* self = Thread::Current(); StackHandleScope<2> hs(self); Handle> dex_caches(hs.NewHandle(CollectDexCaches(self, oat_index))); // build an Object[] of the roots needed to restore the runtime int32_t image_roots_size = ImageHeader::NumberOfImageRoots(compiler_options_.IsAppImage()); Handle> image_roots(hs.NewHandle(ObjectArray::Alloc( self, GetClassRoot>(class_linker), image_roots_size))); image_roots->Set(ImageHeader::kDexCaches, dex_caches.Get()); image_roots->Set(ImageHeader::kClassRoots, class_linker->GetClassRoots()); if (!compiler_options_.IsAppImage()) { DCHECK(boot_image_live_objects != nullptr); image_roots->Set(ImageHeader::kBootImageLiveObjects, boot_image_live_objects.Get()); } else { DCHECK(boot_image_live_objects == nullptr); image_roots->Set(ImageHeader::kAppImageClassLoader, GetAppClassLoader()); } for (int32_t i = 0; i != image_roots_size; ++i) { CHECK(image_roots->Get(i) != nullptr); } return image_roots.Get(); } void ImageWriter::RecordNativeRelocations(ObjPtr obj, size_t oat_index) { if (obj->IsString()) { ObjPtr str = obj->AsString(); InternTable* intern_table = Runtime::Current()->GetInternTable(); Thread* const self = Thread::Current(); if (intern_table->LookupStrong(self, str) == str) { DCHECK(std::none_of(image_infos_.begin(), image_infos_.end(), [=](ImageInfo& info) REQUIRES_SHARED(Locks::mutator_lock_) { return info.intern_table_->LookupStrong(self, str) != nullptr; })); ObjPtr interned = GetImageInfo(oat_index).intern_table_->InternStrongImageString(str); DCHECK_EQ(interned, obj); } } else if (obj->IsDexCache()) { DCHECK_EQ(oat_index, GetOatIndexForDexFile(obj->AsDexCache()->GetDexFile())); } else if (obj->IsClass()) { // Visit and assign offsets for fields and field arrays. ObjPtr as_klass = obj->AsClass(); DCHECK_EQ(oat_index, GetOatIndexForClass(as_klass)); DCHECK(!as_klass->IsErroneous()) << as_klass->GetStatus(); if (compiler_options_.IsAppImage()) { // Extra sanity, no boot loader classes should be left! CHECK(!IsBootClassLoaderClass(as_klass)) << as_klass->PrettyClass(); } LengthPrefixedArray* fields[] = { as_klass->GetSFieldsPtr(), as_klass->GetIFieldsPtr(), }; ImageInfo& image_info = GetImageInfo(oat_index); if (!compiler_options_.IsAppImage()) { // Note: Avoid locking to prevent lock order violations from root visiting; // image_info.class_table_ is only accessed from the image writer. image_info.class_table_->InsertWithoutLocks(as_klass); } for (LengthPrefixedArray* cur_fields : fields) { // Total array length including header. if (cur_fields != nullptr) { const size_t header_size = LengthPrefixedArray::ComputeSize(0); // Forward the entire array at once. auto it = native_object_relocations_.find(cur_fields); CHECK(it == native_object_relocations_.end()) << "Field array " << cur_fields << " already forwarded"; size_t offset = image_info.GetBinSlotSize(Bin::kArtField); DCHECK(!IsInBootImage(cur_fields)); native_object_relocations_.emplace( cur_fields, NativeObjectRelocation { oat_index, offset, NativeObjectRelocationType::kArtFieldArray }); offset += header_size; // Forward individual fields so that we can quickly find where they belong. for (size_t i = 0, count = cur_fields->size(); i < count; ++i) { // Need to forward arrays separate of fields. ArtField* field = &cur_fields->At(i); auto it2 = native_object_relocations_.find(field); CHECK(it2 == native_object_relocations_.end()) << "Field at index=" << i << " already assigned " << field->PrettyField() << " static=" << field->IsStatic(); DCHECK(!IsInBootImage(field)); native_object_relocations_.emplace( field, NativeObjectRelocation { oat_index, offset, NativeObjectRelocationType::kArtField }); offset += sizeof(ArtField); } image_info.IncrementBinSlotSize( Bin::kArtField, header_size + cur_fields->size() * sizeof(ArtField)); DCHECK_EQ(offset, image_info.GetBinSlotSize(Bin::kArtField)); } } // Visit and assign offsets for methods. size_t num_methods = as_klass->NumMethods(); if (num_methods != 0) { bool any_dirty = false; for (auto& m : as_klass->GetMethods(target_ptr_size_)) { if (WillMethodBeDirty(&m)) { any_dirty = true; break; } } NativeObjectRelocationType type = any_dirty ? NativeObjectRelocationType::kArtMethodDirty : NativeObjectRelocationType::kArtMethodClean; Bin bin_type = BinTypeForNativeRelocationType(type); // Forward the entire array at once, but header first. const size_t method_alignment = ArtMethod::Alignment(target_ptr_size_); const size_t method_size = ArtMethod::Size(target_ptr_size_); const size_t header_size = LengthPrefixedArray::ComputeSize(0, method_size, method_alignment); LengthPrefixedArray* array = as_klass->GetMethodsPtr(); auto it = native_object_relocations_.find(array); CHECK(it == native_object_relocations_.end()) << "Method array " << array << " already forwarded"; size_t offset = image_info.GetBinSlotSize(bin_type); DCHECK(!IsInBootImage(array)); native_object_relocations_.emplace(array, NativeObjectRelocation { oat_index, offset, any_dirty ? NativeObjectRelocationType::kArtMethodArrayDirty : NativeObjectRelocationType::kArtMethodArrayClean }); image_info.IncrementBinSlotSize(bin_type, header_size); for (auto& m : as_klass->GetMethods(target_ptr_size_)) { AssignMethodOffset(&m, type, oat_index); } (any_dirty ? dirty_methods_ : clean_methods_) += num_methods; } // Assign offsets for all runtime methods in the IMT since these may hold conflict tables // live. if (as_klass->ShouldHaveImt()) { ImTable* imt = as_klass->GetImt(target_ptr_size_); if (TryAssignImTableOffset(imt, oat_index)) { // Since imt's can be shared only do this the first time to not double count imt method // fixups. for (size_t i = 0; i < ImTable::kSize; ++i) { ArtMethod* imt_method = imt->Get(i, target_ptr_size_); DCHECK(imt_method != nullptr); if (imt_method->IsRuntimeMethod() && !IsInBootImage(imt_method) && !NativeRelocationAssigned(imt_method)) { AssignMethodOffset(imt_method, NativeObjectRelocationType::kRuntimeMethod, oat_index); } } } } } else if (obj->IsClassLoader()) { // Register the class loader if it has a class table. // The fake boot class loader should not get registered. ObjPtr class_loader = obj->AsClassLoader(); if (class_loader->GetClassTable() != nullptr) { DCHECK(compiler_options_.IsAppImage()); if (class_loader == GetAppClassLoader()) { ImageInfo& image_info = GetImageInfo(oat_index); // Note: Avoid locking to prevent lock order violations from root visiting; // image_info.class_table_ table is only accessed from the image writer // and class_loader->GetClassTable() is iterated but not modified. image_info.class_table_->CopyWithoutLocks(*class_loader->GetClassTable()); } } } } bool ImageWriter::NativeRelocationAssigned(void* ptr) const { return native_object_relocations_.find(ptr) != native_object_relocations_.end(); } bool ImageWriter::TryAssignImTableOffset(ImTable* imt, size_t oat_index) { // No offset, or already assigned. if (imt == nullptr || IsInBootImage(imt) || NativeRelocationAssigned(imt)) { return false; } // If the method is a conflict method we also want to assign the conflict table offset. ImageInfo& image_info = GetImageInfo(oat_index); const size_t size = ImTable::SizeInBytes(target_ptr_size_); native_object_relocations_.emplace( imt, NativeObjectRelocation { oat_index, image_info.GetBinSlotSize(Bin::kImTable), NativeObjectRelocationType::kIMTable}); image_info.IncrementBinSlotSize(Bin::kImTable, size); return true; } void ImageWriter::TryAssignConflictTableOffset(ImtConflictTable* table, size_t oat_index) { // No offset, or already assigned. if (table == nullptr || NativeRelocationAssigned(table)) { return; } CHECK(!IsInBootImage(table)); // If the method is a conflict method we also want to assign the conflict table offset. ImageInfo& image_info = GetImageInfo(oat_index); const size_t size = table->ComputeSize(target_ptr_size_); native_object_relocations_.emplace( table, NativeObjectRelocation { oat_index, image_info.GetBinSlotSize(Bin::kIMTConflictTable), NativeObjectRelocationType::kIMTConflictTable}); image_info.IncrementBinSlotSize(Bin::kIMTConflictTable, size); } void ImageWriter::AssignMethodOffset(ArtMethod* method, NativeObjectRelocationType type, size_t oat_index) { DCHECK(!IsInBootImage(method)); CHECK(!NativeRelocationAssigned(method)) << "Method " << method << " already assigned " << ArtMethod::PrettyMethod(method); if (method->IsRuntimeMethod()) { TryAssignConflictTableOffset(method->GetImtConflictTable(target_ptr_size_), oat_index); } ImageInfo& image_info = GetImageInfo(oat_index); Bin bin_type = BinTypeForNativeRelocationType(type); size_t offset = image_info.GetBinSlotSize(bin_type); native_object_relocations_.emplace(method, NativeObjectRelocation { oat_index, offset, type }); image_info.IncrementBinSlotSize(bin_type, ArtMethod::Size(target_ptr_size_)); } class ImageWriter::LayoutHelper { public: explicit LayoutHelper(ImageWriter* image_writer) : image_writer_(image_writer) { bin_objects_.resize(image_writer_->image_infos_.size()); for (auto& inner : bin_objects_) { inner.resize(enum_cast(Bin::kMirrorCount)); } } void ProcessDexFileObjects(Thread* self) REQUIRES_SHARED(Locks::mutator_lock_); void ProcessRoots(VariableSizedHandleScope* handles) REQUIRES_SHARED(Locks::mutator_lock_); void ProcessWorkQueue() REQUIRES_SHARED(Locks::mutator_lock_); void VerifyImageBinSlotsAssigned() REQUIRES_SHARED(Locks::mutator_lock_); void FinalizeBinSlotOffsets() REQUIRES_SHARED(Locks::mutator_lock_); /* * Collects the string reference info necessary for loading app images. * * Because AppImages may contain interned strings that must be deduplicated * with previously interned strings when loading the app image, we need to * visit references to these strings and update them to point to the correct * string. To speed up the visiting of references at load time we include * a list of offsets to string references in the AppImage. */ void CollectStringReferenceInfo(Thread* self) REQUIRES_SHARED(Locks::mutator_lock_); private: class CollectClassesVisitor; class CollectRootsVisitor; class CollectStringReferenceVisitor; class VisitReferencesVisitor; using WorkQueue = std::deque, size_t>>; void VisitReferences(ObjPtr obj, size_t oat_index) REQUIRES_SHARED(Locks::mutator_lock_); bool TryAssignBinSlot(ObjPtr obj, size_t oat_index) REQUIRES_SHARED(Locks::mutator_lock_); ImageWriter* const image_writer_; // Work list of for objects. Everything in the queue must already be // assigned a bin slot. WorkQueue work_queue_; // Objects for individual bins. Indexed by `oat_index` and `bin`. // Cannot use ObjPtr<> because of invalidation in Heap::VisitObjects(). dchecked_vector>> bin_objects_; }; class ImageWriter::LayoutHelper::CollectClassesVisitor : public ClassVisitor { public: explicit CollectClassesVisitor(ImageWriter* image_writer) : image_writer_(image_writer), dex_files_(image_writer_->compiler_options_.GetDexFilesForOatFile()) {} bool operator()(ObjPtr klass) override REQUIRES_SHARED(Locks::mutator_lock_) { if (!image_writer_->IsInBootImage(klass.Ptr())) { ObjPtr component_type = klass; size_t dimension = 0u; while (component_type->IsArrayClass()) { ++dimension; component_type = component_type->GetComponentType(); } DCHECK(!component_type->IsProxyClass()); size_t dex_file_index; uint32_t class_def_index = 0u; if (UNLIKELY(component_type->IsPrimitive())) { DCHECK(image_writer_->compiler_options_.IsBootImage()); dex_file_index = 0u; class_def_index = enum_cast(component_type->GetPrimitiveType()); } else { auto it = std::find(dex_files_.begin(), dex_files_.end(), &component_type->GetDexFile()); DCHECK(it != dex_files_.end()) << klass->PrettyDescriptor(); dex_file_index = std::distance(dex_files_.begin(), it) + 1u; // 0 is for primitive types. class_def_index = component_type->GetDexClassDefIndex(); } klasses_.push_back({klass, dex_file_index, class_def_index, dimension}); } return true; } WorkQueue SortAndReleaseClasses() REQUIRES_SHARED(Locks::mutator_lock_) { std::sort(klasses_.begin(), klasses_.end()); WorkQueue result; size_t last_dex_file_index = static_cast(-1); size_t last_oat_index = static_cast(-1); for (const ClassEntry& entry : klasses_) { if (last_dex_file_index != entry.dex_file_index) { if (UNLIKELY(entry.dex_file_index == 0u)) { last_oat_index = GetDefaultOatIndex(); // Primitive type. } else { uint32_t dex_file_index = entry.dex_file_index - 1u; // 0 is for primitive types. last_oat_index = image_writer_->GetOatIndexForDexFile(dex_files_[dex_file_index]); } last_dex_file_index = entry.dex_file_index; } result.emplace_back(entry.klass, last_oat_index); } klasses_.clear(); return result; } private: struct ClassEntry { ObjPtr klass; // We shall sort classes by dex file, class def index and array dimension. size_t dex_file_index; uint32_t class_def_index; size_t dimension; bool operator<(const ClassEntry& other) const { return std::tie(dex_file_index, class_def_index, dimension) < std::tie(other.dex_file_index, other.class_def_index, other.dimension); } }; ImageWriter* const image_writer_; ArrayRef dex_files_; std::deque klasses_; }; class ImageWriter::LayoutHelper::CollectRootsVisitor { public: CollectRootsVisitor() = default; std::vector> ReleaseRoots() { std::vector> roots; roots.swap(roots_); return roots; } void VisitRootIfNonNull(StackReference* ref) { if (!ref->IsNull()) { roots_.push_back(ref->AsMirrorPtr()); } } private: std::vector> roots_; }; class ImageWriter::LayoutHelper::CollectStringReferenceVisitor { public: explicit CollectStringReferenceVisitor( const ImageWriter* image_writer, size_t oat_index, std::vector* const string_reference_offsets, ObjPtr current_obj) : image_writer_(image_writer), oat_index_(oat_index), string_reference_offsets_(string_reference_offsets), current_obj_(current_obj) {} void VisitRootIfNonNull(mirror::CompressedReference* root) const REQUIRES_SHARED(Locks::mutator_lock_) { if (!root->IsNull()) { VisitRoot(root); } } void VisitRoot(mirror::CompressedReference* root) const REQUIRES_SHARED(Locks::mutator_lock_) { // Only dex caches have native String roots. These are collected separately. DCHECK(current_obj_->IsDexCache() || !image_writer_->IsInternedAppImageStringReference(root->AsMirrorPtr())) << mirror::Object::PrettyTypeOf(current_obj_); } // Collects info for managed fields that reference managed Strings. void operator() (ObjPtr obj, MemberOffset member_offset, bool is_static ATTRIBUTE_UNUSED) const REQUIRES_SHARED(Locks::mutator_lock_) { ObjPtr referred_obj = obj->GetFieldObject(member_offset); if (image_writer_->IsInternedAppImageStringReference(referred_obj)) { size_t base_offset = image_writer_->GetImageOffset(current_obj_.Ptr(), oat_index_); string_reference_offsets_->emplace_back(base_offset, member_offset.Uint32Value()); } } ALWAYS_INLINE void operator() (ObjPtr klass ATTRIBUTE_UNUSED, ObjPtr ref) const REQUIRES_SHARED(Locks::mutator_lock_) { operator()(ref, mirror::Reference::ReferentOffset(), /* is_static */ false); } private: const ImageWriter* const image_writer_; const size_t oat_index_; std::vector* const string_reference_offsets_; const ObjPtr current_obj_; }; class ImageWriter::LayoutHelper::VisitReferencesVisitor { public: VisitReferencesVisitor(LayoutHelper* helper, size_t oat_index) : helper_(helper), oat_index_(oat_index) {} // Fix up separately since we also need to fix up method entrypoints. ALWAYS_INLINE void VisitRootIfNonNull(mirror::CompressedReference* root) const REQUIRES_SHARED(Locks::mutator_lock_) { if (!root->IsNull()) { VisitRoot(root); } } ALWAYS_INLINE void VisitRoot(mirror::CompressedReference* root) const REQUIRES_SHARED(Locks::mutator_lock_) { root->Assign(VisitReference(root->AsMirrorPtr())); } ALWAYS_INLINE void operator() (ObjPtr obj, MemberOffset offset, bool is_static ATTRIBUTE_UNUSED) const REQUIRES_SHARED(Locks::mutator_lock_) { mirror::Object* ref = obj->GetFieldObject(offset); obj->SetFieldObject(offset, VisitReference(ref)); } ALWAYS_INLINE void operator() (ObjPtr klass ATTRIBUTE_UNUSED, ObjPtr ref) const REQUIRES_SHARED(Locks::mutator_lock_) { operator()(ref, mirror::Reference::ReferentOffset(), /* is_static */ false); } private: mirror::Object* VisitReference(mirror::Object* ref) const REQUIRES_SHARED(Locks::mutator_lock_) { if (helper_->TryAssignBinSlot(ref, oat_index_)) { // Remember how many objects we're adding at the front of the queue as we want // to reverse that range to process these references in the order of addition. helper_->work_queue_.emplace_front(ref, oat_index_); } if (ClassLinker::kAppImageMayContainStrings && helper_->image_writer_->compiler_options_.IsAppImage() && helper_->image_writer_->IsInternedAppImageStringReference(ref)) { helper_->image_writer_->image_infos_[oat_index_].num_string_references_ += 1u; } return ref; } LayoutHelper* const helper_; const size_t oat_index_; }; void ImageWriter::LayoutHelper::ProcessDexFileObjects(Thread* self) { Runtime* runtime = Runtime::Current(); ClassLinker* class_linker = runtime->GetClassLinker(); // To ensure deterministic output, populate the work queue with objects in a pre-defined order. // Note: If we decide to implement a profile-guided layout, this is the place to do so. // Get initial work queue with the image classes and assign their bin slots. CollectClassesVisitor visitor(image_writer_); class_linker->VisitClasses(&visitor); DCHECK(work_queue_.empty()); work_queue_ = visitor.SortAndReleaseClasses(); for (const std::pair, size_t>& entry : work_queue_) { DCHECK(entry.first->IsClass()); bool assigned = TryAssignBinSlot(entry.first, entry.second); DCHECK(assigned); } // Assign bin slots to strings and dex caches. for (const DexFile* dex_file : image_writer_->compiler_options_.GetDexFilesForOatFile()) { auto it = image_writer_->dex_file_oat_index_map_.find(dex_file); DCHECK(it != image_writer_->dex_file_oat_index_map_.end()) << dex_file->GetLocation(); const size_t oat_index = it->second; // Assign bin slots for strings defined in this dex file in StringId (lexicographical) order. InternTable* const intern_table = runtime->GetInternTable(); for (size_t i = 0, count = dex_file->NumStringIds(); i < count; ++i) { uint32_t utf16_length; const char* utf8_data = dex_file->StringDataAndUtf16LengthByIdx(dex::StringIndex(i), &utf16_length); ObjPtr string = intern_table->LookupStrong(self, utf16_length, utf8_data); if (string != nullptr && !image_writer_->IsInBootImage(string.Ptr())) { // Try to assign bin slot to this string but do not add it to the work list. // The only reference in a String is its class, processed above for the boot image. bool assigned = TryAssignBinSlot(string, oat_index); DCHECK(assigned || // We could have seen the same string in an earlier dex file. dex_file != image_writer_->compiler_options_.GetDexFilesForOatFile().front()); } } // Assign bin slot to this file's dex cache and add it to the end of the work queue. ObjPtr dex_cache = class_linker->FindDexCache(self, *dex_file); DCHECK(dex_cache != nullptr); bool assigned = TryAssignBinSlot(dex_cache, oat_index); DCHECK(assigned); work_queue_.emplace_back(dex_cache, oat_index); } // Since classes and dex caches have been assigned to their bins, when we process a class // we do not follow through the class references or dex caches, so we correctly process // only objects actually belonging to that class before taking a new class from the queue. // If multiple class statics reference the same object (directly or indirectly), the object // is treated as belonging to the first encountered referencing class. ProcessWorkQueue(); } void ImageWriter::LayoutHelper::ProcessRoots(VariableSizedHandleScope* handles) { // Assing bin slots to the image objects referenced by `handles`, add them to the work queue // and process the work queue. These objects are the image roots and boot image live objects // and they reference other objects needed for the image, for example the array of dex cache // references, or the pre-allocated exceptions for the boot image. DCHECK(work_queue_.empty()); CollectRootsVisitor visitor; handles->VisitRoots(visitor); for (ObjPtr root : visitor.ReleaseRoots()) { if (TryAssignBinSlot(root, GetDefaultOatIndex())) { work_queue_.emplace_back(root, GetDefaultOatIndex()); } } ProcessWorkQueue(); } void ImageWriter::LayoutHelper::ProcessWorkQueue() { while (!work_queue_.empty()) { std::pair, size_t> pair = work_queue_.front(); work_queue_.pop_front(); VisitReferences(/*obj=*/ pair.first, /*oat_index=*/ pair.second); } } void ImageWriter::LayoutHelper::VerifyImageBinSlotsAssigned() { std::vector carveout; if (image_writer_->compiler_options_.IsAppImage()) { // Exclude boot class path dex caches that are not part of the boot image. // Also exclude their locations if they have not been visited through another path. ClassLinker* class_linker = Runtime::Current()->GetClassLinker(); Thread* self = Thread::Current(); ReaderMutexLock mu(self, *Locks::dex_lock_); for (const ClassLinker::DexCacheData& data : class_linker->GetDexCachesData()) { ObjPtr dex_cache = ObjPtr::DownCast(self->DecodeJObject(data.weak_root)); if (dex_cache == nullptr || image_writer_->IsInBootImage(dex_cache.Ptr()) || ContainsElement(image_writer_->compiler_options_.GetDexFilesForOatFile(), dex_cache->GetDexFile())) { continue; } CHECK(!image_writer_->IsImageBinSlotAssigned(dex_cache.Ptr())); carveout.push_back(dex_cache.Ptr()); ObjPtr location = dex_cache->GetLocation(); if (!image_writer_->IsImageBinSlotAssigned(location.Ptr())) { carveout.push_back(location.Ptr()); } } } std::vector missed_objects; auto ensure_bin_slots_assigned = [&](mirror::Object* obj) REQUIRES_SHARED(Locks::mutator_lock_) { if (!image_writer_->IsInBootImage(obj)) { if (!UNLIKELY(image_writer_->IsImageBinSlotAssigned(obj))) { // Ignore the `carveout` objects. if (ContainsElement(carveout, obj)) { return; } // Ignore finalizer references for the dalvik.system.DexFile objects referenced by // the app class loader. if (obj->IsFinalizerReferenceInstance()) { ArtField* ref_field = obj->GetClass()->FindInstanceField("referent", "Ljava/lang/Object;"); CHECK(ref_field != nullptr); ObjPtr ref = ref_field->GetObject(obj); CHECK(ref != nullptr); CHECK(image_writer_->IsImageBinSlotAssigned(ref.Ptr())); ObjPtr klass = ref->GetClass(); CHECK(klass == WellKnownClasses::ToClass(WellKnownClasses::dalvik_system_DexFile)); // Note: The app class loader is used only for checking against the runtime // class loader, the dex file cookie is cleared and therefore we do not need // to run the finalizer even if we implement app image objects collection. ArtField* field = jni::DecodeArtField(WellKnownClasses::dalvik_system_DexFile_cookie); CHECK(field->GetObject(ref) == nullptr); return; } if (obj->IsString()) { // Ignore interned strings. These may come from reflection interning method names. // TODO: Make dex file strings weak interns and GC them before writing the image. Runtime* runtime = Runtime::Current(); ObjPtr interned = runtime->GetInternTable()->LookupStrong(Thread::Current(), obj->AsString()); if (interned == obj) { return; } } missed_objects.push_back(obj); } } }; Runtime::Current()->GetHeap()->VisitObjects(ensure_bin_slots_assigned); if (!missed_objects.empty()) { const gc::Verification* v = Runtime::Current()->GetHeap()->GetVerification(); size_t num_missed_objects = missed_objects.size(); size_t num_paths = std::min(num_missed_objects, 5u); // Do not flood the output. ArrayRef missed_objects_head = ArrayRef(missed_objects).SubArray(/*pos=*/ 0u, /*length=*/ num_paths); for (mirror::Object* obj : missed_objects_head) { LOG(ERROR) << "Image object without assigned bin slot: " << mirror::Object::PrettyTypeOf(obj) << " " << obj << " " << v->FirstPathFromRootSet(obj); } LOG(FATAL) << "Found " << num_missed_objects << " objects without assigned bin slots."; } } void ImageWriter::LayoutHelper::FinalizeBinSlotOffsets() { // Calculate bin slot offsets and adjust for region padding if needed. const size_t region_size = image_writer_->region_size_; const size_t num_image_infos = image_writer_->image_infos_.size(); for (size_t oat_index = 0; oat_index != num_image_infos; ++oat_index) { ImageInfo& image_info = image_writer_->image_infos_[oat_index]; size_t bin_offset = image_writer_->image_objects_offset_begin_; for (size_t i = 0; i != kNumberOfBins; ++i) { Bin bin = enum_cast(i); switch (bin) { case Bin::kArtMethodClean: case Bin::kArtMethodDirty: { bin_offset = RoundUp(bin_offset, ArtMethod::Alignment(image_writer_->target_ptr_size_)); break; } case Bin::kDexCacheArray: bin_offset = RoundUp(bin_offset, DexCacheArraysLayout::Alignment(image_writer_->target_ptr_size_)); break; case Bin::kImTable: case Bin::kIMTConflictTable: { bin_offset = RoundUp(bin_offset, static_cast(image_writer_->target_ptr_size_)); break; } default: { // Normal alignment. } } image_info.bin_slot_offsets_[i] = bin_offset; // If the bin is for mirror objects, we may need to add region padding and update offsets. if (i < enum_cast(Bin::kMirrorCount) && region_size != 0u) { const size_t offset_after_header = bin_offset - sizeof(ImageHeader); size_t remaining_space = RoundUp(offset_after_header + 1u, region_size) - offset_after_header; // Exercise the loop below in debug builds to get coverage. if (kIsDebugBuild || remaining_space < image_info.bin_slot_sizes_[i]) { // The bin crosses a region boundary. Add padding if needed. size_t object_offset = 0u; size_t padding = 0u; for (mirror::Object* object : bin_objects_[oat_index][i]) { BinSlot bin_slot = image_writer_->GetImageBinSlot(object, oat_index); DCHECK_EQ(enum_cast(bin_slot.GetBin()), i); DCHECK_EQ(bin_slot.GetOffset() + padding, object_offset); size_t object_size = RoundUp(object->SizeOf(), kObjectAlignment); auto add_padding = [&](bool tail_region) { DCHECK_NE(remaining_space, 0u); DCHECK_LT(remaining_space, region_size); DCHECK_ALIGNED(remaining_space, kObjectAlignment); // TODO When copying to heap regions, leave the tail region padding zero-filled. if (!tail_region || true) { image_info.padding_offsets_.push_back(bin_offset + object_offset); } image_info.bin_slot_sizes_[i] += remaining_space; padding += remaining_space; object_offset += remaining_space; remaining_space = region_size; }; if (object_size > remaining_space) { // Padding needed if we're not at region boundary (with a multi-region object). if (remaining_space != region_size) { // TODO: Instead of adding padding, we should consider reordering the bins // or objects to reduce wasted space. add_padding(/*tail_region=*/ false); } DCHECK_EQ(remaining_space, region_size); // For huge objects, adjust the remaining space to hold the object and some more. if (object_size > region_size) { remaining_space = RoundUp(object_size + 1u, region_size); } } else if (remaining_space == object_size) { // Move to the next region, no padding needed. remaining_space += region_size; } DCHECK_GT(remaining_space, object_size); remaining_space -= object_size; image_writer_->UpdateImageBinSlotOffset(object, oat_index, object_offset); object_offset += object_size; // Add padding to the tail region of huge objects if not region-aligned. if (object_size > region_size && remaining_space != region_size) { DCHECK(!IsAlignedParam(object_size, region_size)); add_padding(/*tail_region=*/ true); } } image_writer_->region_alignment_wasted_ += padding; image_info.image_end_ += padding; } } bin_offset += image_info.bin_slot_sizes_[i]; } // NOTE: There may be additional padding between the bin slots and the intern table. DCHECK_EQ( image_info.image_end_, image_info.GetBinSizeSum(Bin::kMirrorCount) + image_writer_->image_objects_offset_begin_); } VLOG(image) << "Space wasted for region alignment " << image_writer_->region_alignment_wasted_; } void ImageWriter::LayoutHelper::CollectStringReferenceInfo(Thread* self) { size_t managed_string_refs = 0u; size_t total_string_refs = 0u; const size_t num_image_infos = image_writer_->image_infos_.size(); for (size_t oat_index = 0; oat_index != num_image_infos; ++oat_index) { ImageInfo& image_info = image_writer_->image_infos_[oat_index]; DCHECK(image_info.string_reference_offsets_.empty()); image_info.string_reference_offsets_.reserve(image_info.num_string_references_); for (size_t i = 0; i < enum_cast(Bin::kMirrorCount); ++i) { for (mirror::Object* obj : bin_objects_[oat_index][i]) { CollectStringReferenceVisitor visitor(image_writer_, oat_index, &image_info.string_reference_offsets_, obj); /* * References to managed strings can occur either in the managed heap or in * native memory regions. Information about managed references is collected * by the CollectStringReferenceVisitor and directly added to the image info. * * Native references to managed strings can only occur through DexCache * objects. This is verified by the visitor in debug mode and the references * are collected separately below. */ obj->VisitReferences(visitor, visitor); } } managed_string_refs += image_info.string_reference_offsets_.size(); // Collect dex cache string arrays. for (const DexFile* dex_file : image_writer_->compiler_options_.GetDexFilesForOatFile()) { if (image_writer_->GetOatIndexForDexFile(dex_file) == oat_index) { ObjPtr dex_cache = Runtime::Current()->GetClassLinker()->FindDexCache(self, *dex_file); DCHECK(dex_cache != nullptr); size_t base_offset = image_writer_->GetImageOffset(dex_cache.Ptr(), oat_index); // Visit all string cache entries. mirror::StringDexCacheType* strings = dex_cache->GetStrings(); const size_t num_strings = dex_cache->NumStrings(); for (uint32_t index = 0; index != num_strings; ++index) { ObjPtr referred_string = strings[index].load().object.Read(); if (image_writer_->IsInternedAppImageStringReference(referred_string)) { image_info.string_reference_offsets_.emplace_back( SetDexCacheStringNativeRefTag(base_offset), index); } } // Visit all pre-resolved string entries. GcRoot* preresolved_strings = dex_cache->GetPreResolvedStrings(); const size_t num_pre_resolved_strings = dex_cache->NumPreResolvedStrings(); for (uint32_t index = 0; index != num_pre_resolved_strings; ++index) { ObjPtr referred_string = preresolved_strings[index].Read(); if (image_writer_->IsInternedAppImageStringReference(referred_string)) { image_info.string_reference_offsets_.emplace_back( SetDexCachePreResolvedStringNativeRefTag(base_offset), index); } } } } total_string_refs += image_info.string_reference_offsets_.size(); // Check that we collected the same number of string references as we saw in the previous pass. CHECK_EQ(image_info.string_reference_offsets_.size(), image_info.num_string_references_); } VLOG(compiler) << "Dex2Oat:AppImage:stringReferences = " << total_string_refs << " (managed: " << managed_string_refs << ", native: " << (total_string_refs - managed_string_refs) << ")"; } void ImageWriter::LayoutHelper::VisitReferences(ObjPtr obj, size_t oat_index) { size_t old_work_queue_size = work_queue_.size(); VisitReferencesVisitor visitor(this, oat_index); // Walk references and assign bin slots for them. obj->VisitReferences( visitor, visitor); // Put the added references in the queue in the order in which they were added. // The visitor just pushes them to the front as it visits them. DCHECK_LE(old_work_queue_size, work_queue_.size()); size_t num_added = work_queue_.size() - old_work_queue_size; std::reverse(work_queue_.begin(), work_queue_.begin() + num_added); } bool ImageWriter::LayoutHelper::TryAssignBinSlot(ObjPtr obj, size_t oat_index) { if (obj == nullptr || image_writer_->IsInBootImage(obj.Ptr())) { // Object is null or already in the image, there is no work to do. return false; } bool assigned = false; if (!image_writer_->IsImageBinSlotAssigned(obj.Ptr())) { image_writer_->RecordNativeRelocations(obj, oat_index); Bin bin = image_writer_->AssignImageBinSlot(obj.Ptr(), oat_index); bin_objects_[oat_index][enum_cast(bin)].push_back(obj.Ptr()); assigned = true; } return assigned; } static ObjPtr> GetBootImageLiveObjects() REQUIRES_SHARED(Locks::mutator_lock_) { gc::Heap* heap = Runtime::Current()->GetHeap(); DCHECK(!heap->GetBootImageSpaces().empty()); const ImageHeader& primary_header = heap->GetBootImageSpaces().front()->GetImageHeader(); return ObjPtr>::DownCast( primary_header.GetImageRoot(ImageHeader::kBootImageLiveObjects)); } void ImageWriter::CalculateNewObjectOffsets() { Thread* const self = Thread::Current(); Runtime* const runtime = Runtime::Current(); VariableSizedHandleScope handles(self); MutableHandle> boot_image_live_objects = handles.NewHandle( compiler_options_.IsBootImage() ? AllocateBootImageLiveObjects(self, runtime) : (compiler_options_.IsBootImageExtension() ? GetBootImageLiveObjects() : nullptr)); std::vector>> image_roots; for (size_t i = 0, size = oat_filenames_.size(); i != size; ++i) { image_roots.push_back(handles.NewHandle(CreateImageRoots(i, boot_image_live_objects))); } gc::Heap* const heap = runtime->GetHeap(); // Leave space for the header, but do not write it yet, we need to // know where image_roots is going to end up image_objects_offset_begin_ = RoundUp(sizeof(ImageHeader), kObjectAlignment); // 64-bit-alignment // Write the image runtime methods. image_methods_[ImageHeader::kResolutionMethod] = runtime->GetResolutionMethod(); image_methods_[ImageHeader::kImtConflictMethod] = runtime->GetImtConflictMethod(); image_methods_[ImageHeader::kImtUnimplementedMethod] = runtime->GetImtUnimplementedMethod(); image_methods_[ImageHeader::kSaveAllCalleeSavesMethod] = runtime->GetCalleeSaveMethod(CalleeSaveType::kSaveAllCalleeSaves); image_methods_[ImageHeader::kSaveRefsOnlyMethod] = runtime->GetCalleeSaveMethod(CalleeSaveType::kSaveRefsOnly); image_methods_[ImageHeader::kSaveRefsAndArgsMethod] = runtime->GetCalleeSaveMethod(CalleeSaveType::kSaveRefsAndArgs); image_methods_[ImageHeader::kSaveEverythingMethod] = runtime->GetCalleeSaveMethod(CalleeSaveType::kSaveEverything); image_methods_[ImageHeader::kSaveEverythingMethodForClinit] = runtime->GetCalleeSaveMethod(CalleeSaveType::kSaveEverythingForClinit); image_methods_[ImageHeader::kSaveEverythingMethodForSuspendCheck] = runtime->GetCalleeSaveMethod(CalleeSaveType::kSaveEverythingForSuspendCheck); // Visit image methods first to have the main runtime methods in the first image. for (auto* m : image_methods_) { CHECK(m != nullptr); CHECK(m->IsRuntimeMethod()); DCHECK_EQ(!compiler_options_.IsBootImage(), IsInBootImage(m)) << "Trampolines should be in boot image"; if (!IsInBootImage(m)) { AssignMethodOffset(m, NativeObjectRelocationType::kRuntimeMethod, GetDefaultOatIndex()); } } // Deflate monitors before we visit roots since deflating acquires the monitor lock. Acquiring // this lock while holding other locks may cause lock order violations. { auto deflate_monitor = [](mirror::Object* obj) REQUIRES_SHARED(Locks::mutator_lock_) { Monitor::Deflate(Thread::Current(), obj); }; heap->VisitObjects(deflate_monitor); } // From this point on, there shall be no GC anymore and no objects shall be allocated. // We can now assign a BitSlot to each object and store it in its lockword. LayoutHelper layout_helper(this); layout_helper.ProcessDexFileObjects(self); layout_helper.ProcessRoots(&handles); // Verify that all objects have assigned image bin slots. layout_helper.VerifyImageBinSlotsAssigned(); // Calculate size of the dex cache arrays slot and prepare offsets. PrepareDexCacheArraySlots(); // Calculate the sizes of the intern tables, class tables, and fixup tables. for (ImageInfo& image_info : image_infos_) { // Calculate how big the intern table will be after being serialized. InternTable* const intern_table = image_info.intern_table_.get(); CHECK_EQ(intern_table->WeakSize(), 0u) << " should have strong interned all the strings"; if (intern_table->StrongSize() != 0u) { image_info.intern_table_bytes_ = intern_table->WriteToMemory(nullptr); } // Calculate the size of the class table. ReaderMutexLock mu(self, *Locks::classlinker_classes_lock_); DCHECK_EQ(image_info.class_table_->NumReferencedZygoteClasses(), 0u); if (image_info.class_table_->NumReferencedNonZygoteClasses() != 0u) { image_info.class_table_bytes_ += image_info.class_table_->WriteToMemory(nullptr); } } // Finalize bin slot offsets. This may add padding for regions. layout_helper.FinalizeBinSlotOffsets(); // Collect string reference info for app images. if (ClassLinker::kAppImageMayContainStrings && compiler_options_.IsAppImage()) { layout_helper.CollectStringReferenceInfo(self); } // Calculate image offsets. size_t image_offset = 0; for (ImageInfo& image_info : image_infos_) { image_info.image_begin_ = global_image_begin_ + image_offset; image_info.image_offset_ = image_offset; image_info.image_size_ = RoundUp(image_info.CreateImageSections().first, kPageSize); // There should be no gaps until the next image. image_offset += image_info.image_size_; } size_t i = 0; for (ImageInfo& image_info : image_infos_) { image_info.image_roots_address_ = PointerToLowMemUInt32(GetImageAddress(image_roots[i].Get())); i++; } // Update the native relocations by adding their bin sums. for (auto& pair : native_object_relocations_) { NativeObjectRelocation& relocation = pair.second; Bin bin_type = BinTypeForNativeRelocationType(relocation.type); ImageInfo& image_info = GetImageInfo(relocation.oat_index); relocation.offset += image_info.GetBinSlotOffset(bin_type); } // Remember the boot image live objects as raw pointer. No GC can happen anymore. boot_image_live_objects_ = boot_image_live_objects.Get(); } std::pair> ImageWriter::ImageInfo::CreateImageSections() const { std::vector sections(ImageHeader::kSectionCount); // Do not round up any sections here that are represented by the bins since it // will break offsets. /* * Objects section */ sections[ImageHeader::kSectionObjects] = ImageSection(0u, image_end_); /* * Field section */ sections[ImageHeader::kSectionArtFields] = ImageSection(GetBinSlotOffset(Bin::kArtField), GetBinSlotSize(Bin::kArtField)); /* * Method section */ sections[ImageHeader::kSectionArtMethods] = ImageSection(GetBinSlotOffset(Bin::kArtMethodClean), GetBinSlotSize(Bin::kArtMethodClean) + GetBinSlotSize(Bin::kArtMethodDirty)); /* * IMT section */ sections[ImageHeader::kSectionImTables] = ImageSection(GetBinSlotOffset(Bin::kImTable), GetBinSlotSize(Bin::kImTable)); /* * Conflict Tables section */ sections[ImageHeader::kSectionIMTConflictTables] = ImageSection(GetBinSlotOffset(Bin::kIMTConflictTable), GetBinSlotSize(Bin::kIMTConflictTable)); /* * Runtime Methods section */ sections[ImageHeader::kSectionRuntimeMethods] = ImageSection(GetBinSlotOffset(Bin::kRuntimeMethod), GetBinSlotSize(Bin::kRuntimeMethod)); /* * DexCache Arrays section. */ const ImageSection& dex_cache_arrays_section = sections[ImageHeader::kSectionDexCacheArrays] = ImageSection(GetBinSlotOffset(Bin::kDexCacheArray), GetBinSlotSize(Bin::kDexCacheArray)); /* * Interned Strings section */ // Round up to the alignment the string table expects. See HashSet::WriteToMemory. size_t cur_pos = RoundUp(dex_cache_arrays_section.End(), sizeof(uint64_t)); const ImageSection& interned_strings_section = sections[ImageHeader::kSectionInternedStrings] = ImageSection(cur_pos, intern_table_bytes_); /* * Class Table section */ // Obtain the new position and round it up to the appropriate alignment. cur_pos = RoundUp(interned_strings_section.End(), sizeof(uint64_t)); const ImageSection& class_table_section = sections[ImageHeader::kSectionClassTable] = ImageSection(cur_pos, class_table_bytes_); /* * String Field Offsets section */ // Round up to the alignment of the offsets we are going to store. cur_pos = RoundUp(class_table_section.End(), sizeof(uint32_t)); // The size of string_reference_offsets_ can't be used here because it hasn't // been filled with AppImageReferenceOffsetInfo objects yet. The // num_string_references_ value is calculated separately, before we can // compute the actual offsets. const ImageSection& string_reference_offsets = sections[ImageHeader::kSectionStringReferenceOffsets] = ImageSection(cur_pos, sizeof(string_reference_offsets_[0]) * num_string_references_); /* * Metadata section. */ // Round up to the alignment of the offsets we are going to store. cur_pos = RoundUp(string_reference_offsets.End(), mirror::DexCache::PreResolvedStringsAlignment()); const ImageSection& metadata_section = sections[ImageHeader::kSectionMetadata] = ImageSection(cur_pos, GetBinSlotSize(Bin::kMetadata)); // Return the number of bytes described by these sections, and the sections // themselves. return make_pair(metadata_section.End(), std::move(sections)); } void ImageWriter::CreateHeader(size_t oat_index, size_t component_count) { ImageInfo& image_info = GetImageInfo(oat_index); const uint8_t* oat_file_begin = image_info.oat_file_begin_; const uint8_t* oat_file_end = oat_file_begin + image_info.oat_loaded_size_; const uint8_t* oat_data_end = image_info.oat_data_begin_ + image_info.oat_size_; uint32_t image_reservation_size = image_info.image_size_; DCHECK_ALIGNED(image_reservation_size, kPageSize); uint32_t current_component_count = 1u; if (compiler_options_.IsAppImage()) { DCHECK_EQ(oat_index, 0u); DCHECK_EQ(component_count, current_component_count); } else { DCHECK(image_infos_.size() == 1u || image_infos_.size() == component_count) << image_infos_.size() << " " << component_count; if (oat_index == 0u) { const ImageInfo& last_info = image_infos_.back(); const uint8_t* end = last_info.oat_file_begin_ + last_info.oat_loaded_size_; DCHECK_ALIGNED(image_info.image_begin_, kPageSize); image_reservation_size = dchecked_integral_cast(RoundUp(end - image_info.image_begin_, kPageSize)); current_component_count = component_count; } else { image_reservation_size = 0u; current_component_count = 0u; } } // Compute boot image checksums for the primary component, leave as 0 otherwise. uint32_t boot_image_components = 0u; uint32_t boot_image_checksums = 0u; if (oat_index == 0u) { const std::vector& image_spaces = Runtime::Current()->GetHeap()->GetBootImageSpaces(); DCHECK_EQ(image_spaces.empty(), compiler_options_.IsBootImage()); for (size_t i = 0u, size = image_spaces.size(); i != size; ) { const ImageHeader& header = image_spaces[i]->GetImageHeader(); boot_image_components += header.GetComponentCount(); boot_image_checksums ^= header.GetImageChecksum(); DCHECK_LE(header.GetImageSpaceCount(), size - i); i += header.GetImageSpaceCount(); } } // Create the image sections. auto section_info_pair = image_info.CreateImageSections(); const size_t image_end = section_info_pair.first; std::vector& sections = section_info_pair.second; // Finally bitmap section. const size_t bitmap_bytes = image_info.image_bitmap_.Size(); auto* bitmap_section = §ions[ImageHeader::kSectionImageBitmap]; *bitmap_section = ImageSection(RoundUp(image_end, kPageSize), RoundUp(bitmap_bytes, kPageSize)); if (VLOG_IS_ON(compiler)) { LOG(INFO) << "Creating header for " << oat_filenames_[oat_index]; size_t idx = 0; for (const ImageSection& section : sections) { LOG(INFO) << static_cast(idx) << " " << section; ++idx; } LOG(INFO) << "Methods: clean=" << clean_methods_ << " dirty=" << dirty_methods_; LOG(INFO) << "Image roots address=" << std::hex << image_info.image_roots_address_ << std::dec; LOG(INFO) << "Image begin=" << std::hex << reinterpret_cast(global_image_begin_) << " Image offset=" << image_info.image_offset_ << std::dec; LOG(INFO) << "Oat file begin=" << std::hex << reinterpret_cast(oat_file_begin) << " Oat data begin=" << reinterpret_cast(image_info.oat_data_begin_) << " Oat data end=" << reinterpret_cast(oat_data_end) << " Oat file end=" << reinterpret_cast(oat_file_end); } // Create the header, leave 0 for data size since we will fill this in as we are writing the // image. new (image_info.image_.Begin()) ImageHeader( image_reservation_size, current_component_count, PointerToLowMemUInt32(image_info.image_begin_), image_end, sections.data(), image_info.image_roots_address_, image_info.oat_checksum_, PointerToLowMemUInt32(oat_file_begin), PointerToLowMemUInt32(image_info.oat_data_begin_), PointerToLowMemUInt32(oat_data_end), PointerToLowMemUInt32(oat_file_end), boot_image_begin_, boot_image_size_, boot_image_components, boot_image_checksums, static_cast(target_ptr_size_)); } ArtMethod* ImageWriter::GetImageMethodAddress(ArtMethod* method) { NativeObjectRelocation relocation = GetNativeRelocation(method); const ImageInfo& image_info = GetImageInfo(relocation.oat_index); CHECK_GE(relocation.offset, image_info.image_end_) << "ArtMethods should be after Objects"; return reinterpret_cast(image_info.image_begin_ + relocation.offset); } const void* ImageWriter::GetIntrinsicReferenceAddress(uint32_t intrinsic_data) { DCHECK(compiler_options_.IsBootImage()); switch (IntrinsicObjects::DecodePatchType(intrinsic_data)) { case IntrinsicObjects::PatchType::kIntegerValueOfArray: { const uint8_t* base_address = reinterpret_cast(GetImageAddress(boot_image_live_objects_)); MemberOffset data_offset = IntrinsicObjects::GetIntegerValueOfArrayDataOffset(boot_image_live_objects_); return base_address + data_offset.Uint32Value(); } case IntrinsicObjects::PatchType::kIntegerValueOfObject: { uint32_t index = IntrinsicObjects::DecodePatchIndex(intrinsic_data); ObjPtr value = IntrinsicObjects::GetIntegerValueOfObject(boot_image_live_objects_, index); return GetImageAddress(value.Ptr()); } } LOG(FATAL) << "UNREACHABLE"; UNREACHABLE(); } class ImageWriter::FixupRootVisitor : public RootVisitor { public: explicit FixupRootVisitor(ImageWriter* image_writer) : image_writer_(image_writer) { } void VisitRoots(mirror::Object*** roots ATTRIBUTE_UNUSED, size_t count ATTRIBUTE_UNUSED, const RootInfo& info ATTRIBUTE_UNUSED) override REQUIRES_SHARED(Locks::mutator_lock_) { LOG(FATAL) << "Unsupported"; } void VisitRoots(mirror::CompressedReference** roots, size_t count, const RootInfo& info ATTRIBUTE_UNUSED) override REQUIRES_SHARED(Locks::mutator_lock_) { for (size_t i = 0; i < count; ++i) { // Copy the reference. Since we do not have the address for recording the relocation, // it needs to be recorded explicitly by the user of FixupRootVisitor. ObjPtr old_ptr = roots[i]->AsMirrorPtr(); roots[i]->Assign(image_writer_->GetImageAddress(old_ptr.Ptr())); } } private: ImageWriter* const image_writer_; }; void ImageWriter::CopyAndFixupImTable(ImTable* orig, ImTable* copy) { for (size_t i = 0; i < ImTable::kSize; ++i) { ArtMethod* method = orig->Get(i, target_ptr_size_); void** address = reinterpret_cast(copy->AddressOfElement(i, target_ptr_size_)); CopyAndFixupPointer(address, method); DCHECK_EQ(copy->Get(i, target_ptr_size_), NativeLocationInImage(method)); } } void ImageWriter::CopyAndFixupImtConflictTable(ImtConflictTable* orig, ImtConflictTable* copy) { const size_t count = orig->NumEntries(target_ptr_size_); for (size_t i = 0; i < count; ++i) { ArtMethod* interface_method = orig->GetInterfaceMethod(i, target_ptr_size_); ArtMethod* implementation_method = orig->GetImplementationMethod(i, target_ptr_size_); CopyAndFixupPointer(copy->AddressOfInterfaceMethod(i, target_ptr_size_), interface_method); CopyAndFixupPointer( copy->AddressOfImplementationMethod(i, target_ptr_size_), implementation_method); DCHECK_EQ(copy->GetInterfaceMethod(i, target_ptr_size_), NativeLocationInImage(interface_method)); DCHECK_EQ(copy->GetImplementationMethod(i, target_ptr_size_), NativeLocationInImage(implementation_method)); } } void ImageWriter::CopyAndFixupNativeData(size_t oat_index) { const ImageInfo& image_info = GetImageInfo(oat_index); // Copy ArtFields and methods to their locations and update the array for convenience. for (auto& pair : native_object_relocations_) { NativeObjectRelocation& relocation = pair.second; // Only work with fields and methods that are in the current oat file. if (relocation.oat_index != oat_index) { continue; } auto* dest = image_info.image_.Begin() + relocation.offset; DCHECK_GE(dest, image_info.image_.Begin() + image_info.image_end_); DCHECK(!IsInBootImage(pair.first)); switch (relocation.type) { case NativeObjectRelocationType::kArtField: { memcpy(dest, pair.first, sizeof(ArtField)); CopyAndFixupReference( reinterpret_cast(dest)->GetDeclaringClassAddressWithoutBarrier(), reinterpret_cast(pair.first)->GetDeclaringClass()); break; } case NativeObjectRelocationType::kRuntimeMethod: case NativeObjectRelocationType::kArtMethodClean: case NativeObjectRelocationType::kArtMethodDirty: { CopyAndFixupMethod(reinterpret_cast(pair.first), reinterpret_cast(dest), oat_index); break; } // For arrays, copy just the header since the elements will get copied by their corresponding // relocations. case NativeObjectRelocationType::kArtFieldArray: { memcpy(dest, pair.first, LengthPrefixedArray::ComputeSize(0)); break; } case NativeObjectRelocationType::kArtMethodArrayClean: case NativeObjectRelocationType::kArtMethodArrayDirty: { size_t size = ArtMethod::Size(target_ptr_size_); size_t alignment = ArtMethod::Alignment(target_ptr_size_); memcpy(dest, pair.first, LengthPrefixedArray::ComputeSize(0, size, alignment)); // Clear padding to avoid non-deterministic data in the image. // Historical note: We also did that to placate Valgrind. reinterpret_cast*>(dest)->ClearPadding(size, alignment); break; } case NativeObjectRelocationType::kDexCacheArray: // Nothing to copy here, everything is done in FixupDexCache(). break; case NativeObjectRelocationType::kIMTable: { ImTable* orig_imt = reinterpret_cast(pair.first); ImTable* dest_imt = reinterpret_cast(dest); CopyAndFixupImTable(orig_imt, dest_imt); break; } case NativeObjectRelocationType::kIMTConflictTable: { auto* orig_table = reinterpret_cast(pair.first); CopyAndFixupImtConflictTable( orig_table, new(dest)ImtConflictTable(orig_table->NumEntries(target_ptr_size_), target_ptr_size_)); break; } case NativeObjectRelocationType::kGcRootPointer: { auto* orig_pointer = reinterpret_cast*>(pair.first); auto* dest_pointer = reinterpret_cast*>(dest); CopyAndFixupReference(dest_pointer->AddressWithoutBarrier(), orig_pointer->Read()); break; } } } // Fixup the image method roots. auto* image_header = reinterpret_cast(image_info.image_.Begin()); for (size_t i = 0; i < ImageHeader::kImageMethodsCount; ++i) { ArtMethod* method = image_methods_[i]; CHECK(method != nullptr); CopyAndFixupPointer( reinterpret_cast(&image_header->image_methods_[i]), method, PointerSize::k32); } FixupRootVisitor root_visitor(this); // Write the intern table into the image. if (image_info.intern_table_bytes_ > 0) { const ImageSection& intern_table_section = image_header->GetInternedStringsSection(); InternTable* const intern_table = image_info.intern_table_.get(); uint8_t* const intern_table_memory_ptr = image_info.image_.Begin() + intern_table_section.Offset(); const size_t intern_table_bytes = intern_table->WriteToMemory(intern_table_memory_ptr); CHECK_EQ(intern_table_bytes, image_info.intern_table_bytes_); // Fixup the pointers in the newly written intern table to contain image addresses. InternTable temp_intern_table; // Note that we require that ReadFromMemory does not make an internal copy of the elements so // that the VisitRoots() will update the memory directly rather than the copies. // This also relies on visit roots not doing any verification which could fail after we update // the roots to be the image addresses. temp_intern_table.AddTableFromMemory(intern_table_memory_ptr, VoidFunctor(), /*is_boot_image=*/ false); CHECK_EQ(temp_intern_table.Size(), intern_table->Size()); temp_intern_table.VisitRoots(&root_visitor, kVisitRootFlagAllRoots); // Record relocations. (The root visitor does not get to see the slot addresses.) MutexLock lock(Thread::Current(), *Locks::intern_table_lock_); DCHECK(!temp_intern_table.strong_interns_.tables_.empty()); DCHECK(!temp_intern_table.strong_interns_.tables_[0].Empty()); // Inserted at the beginning. } // Write the class table(s) into the image. class_table_bytes_ may be 0 if there are multiple // class loaders. Writing multiple class tables into the image is currently unsupported. if (image_info.class_table_bytes_ > 0u) { const ImageSection& class_table_section = image_header->GetClassTableSection(); uint8_t* const class_table_memory_ptr = image_info.image_.Begin() + class_table_section.Offset(); Thread* self = Thread::Current(); ReaderMutexLock mu(self, *Locks::classlinker_classes_lock_); ClassTable* table = image_info.class_table_.get(); CHECK(table != nullptr); const size_t class_table_bytes = table->WriteToMemory(class_table_memory_ptr); CHECK_EQ(class_table_bytes, image_info.class_table_bytes_); // Fixup the pointers in the newly written class table to contain image addresses. See // above comment for intern tables. ClassTable temp_class_table; temp_class_table.ReadFromMemory(class_table_memory_ptr); CHECK_EQ(temp_class_table.NumReferencedZygoteClasses(), table->NumReferencedNonZygoteClasses() + table->NumReferencedZygoteClasses()); UnbufferedRootVisitor visitor(&root_visitor, RootInfo(kRootUnknown)); temp_class_table.VisitRoots(visitor); // Record relocations. (The root visitor does not get to see the slot addresses.) // Note that the low bits in the slots contain bits of the descriptors' hash codes // but the relocation works fine for these "adjusted" references. ReaderMutexLock lock(self, temp_class_table.lock_); DCHECK(!temp_class_table.classes_.empty()); DCHECK(!temp_class_table.classes_[0].empty()); // The ClassSet was inserted at the beginning. } } void ImageWriter::FixupPointerArray(mirror::Object* dst, mirror::PointerArray* arr, Bin array_type) { CHECK(arr->IsIntArray() || arr->IsLongArray()) << arr->GetClass()->PrettyClass() << " " << arr; // Fixup int and long pointers for the ArtMethod or ArtField arrays. const size_t num_elements = arr->GetLength(); CopyAndFixupReference( dst->GetFieldObjectReferenceAddr(Class::ClassOffset()), arr->GetClass()); auto* dest_array = down_cast(dst); for (size_t i = 0, count = num_elements; i < count; ++i) { void* elem = arr->GetElementPtrSize(i, target_ptr_size_); if (kIsDebugBuild && elem != nullptr && !IsInBootImage(elem)) { auto it = native_object_relocations_.find(elem); if (UNLIKELY(it == native_object_relocations_.end())) { if (it->second.IsArtMethodRelocation()) { auto* method = reinterpret_cast(elem); LOG(FATAL) << "No relocation entry for ArtMethod " << method->PrettyMethod() << " @ " << method << " idx=" << i << "/" << num_elements << " with declaring class " << Class::PrettyClass(method->GetDeclaringClass()); } else { CHECK_EQ(array_type, Bin::kArtField); auto* field = reinterpret_cast(elem); LOG(FATAL) << "No relocation entry for ArtField " << field->PrettyField() << " @ " << field << " idx=" << i << "/" << num_elements << " with declaring class " << Class::PrettyClass(field->GetDeclaringClass()); } UNREACHABLE(); } } CopyAndFixupPointer(dest_array->ElementAddress(i, target_ptr_size_), elem); } } void ImageWriter::CopyAndFixupObject(Object* obj) { if (!IsImageBinSlotAssigned(obj)) { return; } size_t oat_index = GetOatIndex(obj); size_t offset = GetImageOffset(obj, oat_index); ImageInfo& image_info = GetImageInfo(oat_index); auto* dst = reinterpret_cast(image_info.image_.Begin() + offset); DCHECK_LT(offset, image_info.image_end_); const auto* src = reinterpret_cast(obj); image_info.image_bitmap_.Set(dst); // Mark the obj as live. const size_t n = obj->SizeOf(); if (kIsDebugBuild && region_size_ != 0u) { const size_t offset_after_header = offset - sizeof(ImageHeader); const size_t next_region = RoundUp(offset_after_header, region_size_); if (offset_after_header != next_region) { // If the object is not on a region bondary, it must not be cross region. CHECK_LT(offset_after_header, next_region) << "offset_after_header=" << offset_after_header << " size=" << n; CHECK_LE(offset_after_header + n, next_region) << "offset_after_header=" << offset_after_header << " size=" << n; } } DCHECK_LE(offset + n, image_info.image_.Size()); memcpy(dst, src, n); // Write in a hash code of objects which have inflated monitors or a hash code in their monitor // word. const auto it = saved_hashcode_map_.find(obj); dst->SetLockWord(it != saved_hashcode_map_.end() ? LockWord::FromHashCode(it->second, 0u) : LockWord::Default(), false); if (kUseBakerReadBarrier && gc::collector::ConcurrentCopying::kGrayDirtyImmuneObjects) { // Treat all of the objects in the image as marked to avoid unnecessary dirty pages. This is // safe since we mark all of the objects that may reference non immune objects as gray. CHECK(dst->AtomicSetMarkBit(0, 1)); } FixupObject(obj, dst); } // Rewrite all the references in the copied object to point to their image address equivalent class ImageWriter::FixupVisitor { public: FixupVisitor(ImageWriter* image_writer, Object* copy) : image_writer_(image_writer), copy_(copy) { } // Ignore class roots since we don't have a way to map them to the destination. These are handled // with other logic. void VisitRootIfNonNull(mirror::CompressedReference* root ATTRIBUTE_UNUSED) const {} void VisitRoot(mirror::CompressedReference* root ATTRIBUTE_UNUSED) const {} void operator()(ObjPtr obj, MemberOffset offset, bool is_static ATTRIBUTE_UNUSED) const REQUIRES_SHARED(Locks::mutator_lock_) REQUIRES(Locks::heap_bitmap_lock_) { ObjPtr ref = obj->GetFieldObject(offset); // Copy the reference and record the fixup if necessary. image_writer_->CopyAndFixupReference( copy_->GetFieldObjectReferenceAddr(offset), ref); } // java.lang.ref.Reference visitor. void operator()(ObjPtr klass ATTRIBUTE_UNUSED, ObjPtr ref) const REQUIRES_SHARED(Locks::mutator_lock_) REQUIRES(Locks::heap_bitmap_lock_) { operator()(ref, mirror::Reference::ReferentOffset(), /* is_static */ false); } protected: ImageWriter* const image_writer_; mirror::Object* const copy_; }; void ImageWriter::CopyAndFixupObjects() { auto visitor = [&](Object* obj) REQUIRES_SHARED(Locks::mutator_lock_) { DCHECK(obj != nullptr); CopyAndFixupObject(obj); }; Runtime::Current()->GetHeap()->VisitObjects(visitor); // Fill the padding objects since they are required for in order traversal of the image space. for (ImageInfo& image_info : image_infos_) { for (const size_t start_offset : image_info.padding_offsets_) { const size_t offset_after_header = start_offset - sizeof(ImageHeader); size_t remaining_space = RoundUp(offset_after_header + 1u, region_size_) - offset_after_header; DCHECK_NE(remaining_space, 0u); DCHECK_LT(remaining_space, region_size_); Object* dst = reinterpret_cast(image_info.image_.Begin() + start_offset); ObjPtr object_class = GetClassRoot(); DCHECK_ALIGNED_PARAM(remaining_space, object_class->GetObjectSize()); Object* end = dst + remaining_space / object_class->GetObjectSize(); Class* image_object_class = GetImageAddress(object_class.Ptr()); while (dst != end) { dst->SetClass(image_object_class); dst->SetLockWord(LockWord::Default(), /*as_volatile=*/ false); image_info.image_bitmap_.Set(dst); // Mark the obj as live. ++dst; } } } // We no longer need the hashcode map, values have already been copied to target objects. saved_hashcode_map_.clear(); } class ImageWriter::FixupClassVisitor final : public FixupVisitor { public: FixupClassVisitor(ImageWriter* image_writer, Object* copy) : FixupVisitor(image_writer, copy) {} void operator()(ObjPtr obj, MemberOffset offset, bool is_static ATTRIBUTE_UNUSED) const REQUIRES(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { DCHECK(obj->IsClass()); FixupVisitor::operator()(obj, offset, /*is_static*/false); } void operator()(ObjPtr klass ATTRIBUTE_UNUSED, ObjPtr ref ATTRIBUTE_UNUSED) const REQUIRES_SHARED(Locks::mutator_lock_) REQUIRES(Locks::heap_bitmap_lock_) { LOG(FATAL) << "Reference not expected here."; } }; ImageWriter::NativeObjectRelocation ImageWriter::GetNativeRelocation(void* obj) { DCHECK(obj != nullptr); DCHECK(!IsInBootImage(obj)); auto it = native_object_relocations_.find(obj); CHECK(it != native_object_relocations_.end()) << obj << " spaces " << Runtime::Current()->GetHeap()->DumpSpaces(); return it->second; } template std::string PrettyPrint(T* ptr) REQUIRES_SHARED(Locks::mutator_lock_) { std::ostringstream oss; oss << ptr; return oss.str(); } template <> std::string PrettyPrint(ArtMethod* method) REQUIRES_SHARED(Locks::mutator_lock_) { return ArtMethod::PrettyMethod(method); } template T* ImageWriter::NativeLocationInImage(T* obj) { if (obj == nullptr || IsInBootImage(obj)) { return obj; } else { NativeObjectRelocation relocation = GetNativeRelocation(obj); const ImageInfo& image_info = GetImageInfo(relocation.oat_index); return reinterpret_cast(image_info.image_begin_ + relocation.offset); } } template T* ImageWriter::NativeCopyLocation(T* obj) { const NativeObjectRelocation relocation = GetNativeRelocation(obj); const ImageInfo& image_info = GetImageInfo(relocation.oat_index); return reinterpret_cast(image_info.image_.Begin() + relocation.offset); } class ImageWriter::NativeLocationVisitor { public: explicit NativeLocationVisitor(ImageWriter* image_writer) : image_writer_(image_writer) {} template T* operator()(T* ptr, void** dest_addr) const REQUIRES_SHARED(Locks::mutator_lock_) { if (ptr != nullptr) { image_writer_->CopyAndFixupPointer(dest_addr, ptr); } // TODO: The caller shall overwrite the value stored by CopyAndFixupPointer() // with the value we return here. We should try to avoid the duplicate work. return image_writer_->NativeLocationInImage(ptr); } private: ImageWriter* const image_writer_; }; void ImageWriter::FixupClass(mirror::Class* orig, mirror::Class* copy) { orig->FixupNativePointers(copy, target_ptr_size_, NativeLocationVisitor(this)); FixupClassVisitor visitor(this, copy); ObjPtr(orig)->VisitReferences(visitor, visitor); if (kBitstringSubtypeCheckEnabled && !compiler_options_.IsBootImage()) { // When we call SubtypeCheck::EnsureInitialize, it Assigns new bitstring // values to the parent of that class. // // Every time this happens, the parent class has to mutate to increment // the "Next" value. // // If any of these parents are in the boot image, the changes [in the parents] // would be lost when the app image is reloaded. // // To prevent newly loaded classes (not in the app image) from being reassigned // the same bitstring value as an existing app image class, uninitialize // all the classes in the app image. // // On startup, the class linker will then re-initialize all the app // image bitstrings. See also ClassLinker::AddImageSpace. // // FIXME: Deal with boot image extensions. MutexLock subtype_check_lock(Thread::Current(), *Locks::subtype_check_lock_); // Lock every time to prevent a dcheck failure when we suspend with the lock held. SubtypeCheck::ForceUninitialize(copy); } // Remove the clinitThreadId. This is required for image determinism. copy->SetClinitThreadId(static_cast(0)); // We never emit kRetryVerificationAtRuntime, instead we mark the class as // resolved and the class will therefore be re-verified at runtime. if (orig->ShouldVerifyAtRuntime()) { copy->SetStatusInternal(ClassStatus::kResolved); } } void ImageWriter::FixupObject(Object* orig, Object* copy) { DCHECK(orig != nullptr); DCHECK(copy != nullptr); if (kUseBakerReadBarrier) { orig->AssertReadBarrierState(); } if (orig->IsIntArray() || orig->IsLongArray()) { // Is this a native pointer array? auto it = pointer_arrays_.find(down_cast(orig)); if (it != pointer_arrays_.end()) { // Should only need to fixup every pointer array exactly once. FixupPointerArray(copy, down_cast(orig), it->second); pointer_arrays_.erase(it); return; } } if (orig->IsClass()) { FixupClass(orig->AsClass().Ptr(), down_cast(copy)); } else { ObjPtr> class_roots = Runtime::Current()->GetClassLinker()->GetClassRoots(); ObjPtr klass = orig->GetClass(); if (klass == GetClassRoot(class_roots) || klass == GetClassRoot(class_roots)) { // Need to go update the ArtMethod. auto* dest = down_cast(copy); auto* src = down_cast(orig); ArtMethod* src_method = src->GetArtMethod(); CopyAndFixupPointer(dest, mirror::Executable::ArtMethodOffset(), src_method); } else if (klass == GetClassRoot(class_roots)) { FixupDexCache(down_cast(orig), down_cast(copy)); } else if (klass->IsClassLoaderClass()) { mirror::ClassLoader* copy_loader = down_cast(copy); // If src is a ClassLoader, set the class table to null so that it gets recreated by the // ClassLoader. copy_loader->SetClassTable(nullptr); // Also set allocator to null to be safe. The allocator is created when we create the class // table. We also never expect to unload things in the image since they are held live as // roots. copy_loader->SetAllocator(nullptr); } FixupVisitor visitor(this, copy); orig->VisitReferences(visitor, visitor); } } template void ImageWriter::FixupDexCacheArrayEntry(std::atomic>* orig_array, std::atomic>* new_array, uint32_t array_index) { static_assert(sizeof(std::atomic>) == sizeof(mirror::DexCachePair), "Size check for removing std::atomic<>."); mirror::DexCachePair* orig_pair = reinterpret_cast*>(&orig_array[array_index]); mirror::DexCachePair* new_pair = reinterpret_cast*>(&new_array[array_index]); CopyAndFixupReference( new_pair->object.AddressWithoutBarrier(), orig_pair->object.Read()); new_pair->index = orig_pair->index; } template void ImageWriter::FixupDexCacheArrayEntry(std::atomic>* orig_array, std::atomic>* new_array, uint32_t array_index) { static_assert( sizeof(std::atomic>) == sizeof(mirror::NativeDexCachePair), "Size check for removing std::atomic<>."); if (target_ptr_size_ == PointerSize::k64) { DexCache::ConversionPair64* orig_pair = reinterpret_cast(orig_array) + array_index; DexCache::ConversionPair64* new_pair = reinterpret_cast(new_array) + array_index; *new_pair = *orig_pair; // Copy original value and index. if (orig_pair->first != 0u) { CopyAndFixupPointer( reinterpret_cast(&new_pair->first), reinterpret_cast64(orig_pair->first)); } } else { DexCache::ConversionPair32* orig_pair = reinterpret_cast(orig_array) + array_index; DexCache::ConversionPair32* new_pair = reinterpret_cast(new_array) + array_index; *new_pair = *orig_pair; // Copy original value and index. if (orig_pair->first != 0u) { CopyAndFixupPointer( reinterpret_cast(&new_pair->first), reinterpret_cast32(orig_pair->first)); } } } void ImageWriter::FixupDexCacheArrayEntry(GcRoot* orig_array, GcRoot* new_array, uint32_t array_index) { CopyAndFixupReference( new_array[array_index].AddressWithoutBarrier(), orig_array[array_index].Read()); } template void ImageWriter::FixupDexCacheArray(DexCache* orig_dex_cache, DexCache* copy_dex_cache, MemberOffset array_offset, uint32_t size) { EntryType* orig_array = orig_dex_cache->GetFieldPtr64(array_offset); DCHECK_EQ(orig_array != nullptr, size != 0u); if (orig_array != nullptr) { // Though the DexCache array fields are usually treated as native pointers, we clear // the top 32 bits for 32-bit targets. CopyAndFixupPointer(copy_dex_cache, array_offset, orig_array, PointerSize::k64); EntryType* new_array = NativeCopyLocation(orig_array); for (uint32_t i = 0; i != size; ++i) { FixupDexCacheArrayEntry(orig_array, new_array, i); } } } void ImageWriter::FixupDexCache(DexCache* orig_dex_cache, DexCache* copy_dex_cache) { FixupDexCacheArray(orig_dex_cache, copy_dex_cache, DexCache::StringsOffset(), orig_dex_cache->NumStrings()); FixupDexCacheArray(orig_dex_cache, copy_dex_cache, DexCache::ResolvedTypesOffset(), orig_dex_cache->NumResolvedTypes()); FixupDexCacheArray(orig_dex_cache, copy_dex_cache, DexCache::ResolvedMethodsOffset(), orig_dex_cache->NumResolvedMethods()); FixupDexCacheArray(orig_dex_cache, copy_dex_cache, DexCache::ResolvedFieldsOffset(), orig_dex_cache->NumResolvedFields()); FixupDexCacheArray(orig_dex_cache, copy_dex_cache, DexCache::ResolvedMethodTypesOffset(), orig_dex_cache->NumResolvedMethodTypes()); FixupDexCacheArray>(orig_dex_cache, copy_dex_cache, DexCache::ResolvedCallSitesOffset(), orig_dex_cache->NumResolvedCallSites()); if (orig_dex_cache->GetPreResolvedStrings() != nullptr) { CopyAndFixupPointer(copy_dex_cache, DexCache::PreResolvedStringsOffset(), orig_dex_cache->GetPreResolvedStrings(), PointerSize::k64); } // Remove the DexFile pointers. They will be fixed up when the runtime loads the oat file. Leaving // compiler pointers in here will make the output non-deterministic. copy_dex_cache->SetDexFile(nullptr); } const uint8_t* ImageWriter::GetOatAddress(StubType type) const { DCHECK_LE(type, StubType::kLast); // If we are compiling a boot image extension or app image, // we need to use the stubs of the primary boot image. if (!compiler_options_.IsBootImage()) { // Use the current image pointers. const std::vector& image_spaces = Runtime::Current()->GetHeap()->GetBootImageSpaces(); DCHECK(!image_spaces.empty()); const OatFile* oat_file = image_spaces[0]->GetOatFile(); CHECK(oat_file != nullptr); const OatHeader& header = oat_file->GetOatHeader(); switch (type) { // TODO: We could maybe clean this up if we stored them in an array in the oat header. case StubType::kQuickGenericJNITrampoline: return static_cast(header.GetQuickGenericJniTrampoline()); case StubType::kJNIDlsymLookupTrampoline: return static_cast(header.GetJniDlsymLookupTrampoline()); case StubType::kJNIDlsymLookupCriticalTrampoline: return static_cast(header.GetJniDlsymLookupCriticalTrampoline()); case StubType::kQuickIMTConflictTrampoline: return static_cast(header.GetQuickImtConflictTrampoline()); case StubType::kQuickResolutionTrampoline: return static_cast(header.GetQuickResolutionTrampoline()); case StubType::kQuickToInterpreterBridge: return static_cast(header.GetQuickToInterpreterBridge()); default: UNREACHABLE(); } } const ImageInfo& primary_image_info = GetImageInfo(0); return GetOatAddressForOffset(primary_image_info.GetStubOffset(type), primary_image_info); } const uint8_t* ImageWriter::GetQuickCode(ArtMethod* method, const ImageInfo& image_info) { DCHECK(!method->IsResolutionMethod()) << method->PrettyMethod(); DCHECK_NE(method, Runtime::Current()->GetImtConflictMethod()) << method->PrettyMethod(); DCHECK(!method->IsImtUnimplementedMethod()) << method->PrettyMethod(); DCHECK(method->IsInvokable()) << method->PrettyMethod(); DCHECK(!IsInBootImage(method)) << method->PrettyMethod(); // Use original code if it exists. Otherwise, set the code pointer to the resolution // trampoline. // Quick entrypoint: const void* quick_oat_entry_point = method->GetEntryPointFromQuickCompiledCodePtrSize(target_ptr_size_); const uint8_t* quick_code; if (UNLIKELY(IsInBootImage(method->GetDeclaringClass().Ptr()))) { DCHECK(method->IsCopied()); // If the code is not in the oat file corresponding to this image (e.g. default methods) quick_code = reinterpret_cast(quick_oat_entry_point); } else { uint32_t quick_oat_code_offset = PointerToLowMemUInt32(quick_oat_entry_point); quick_code = GetOatAddressForOffset(quick_oat_code_offset, image_info); } if (quick_code == nullptr) { // If we don't have code, use generic jni / interpreter bridge. // Both perform class initialization check if needed. quick_code = method->IsNative() ? GetOatAddress(StubType::kQuickGenericJNITrampoline) : GetOatAddress(StubType::kQuickToInterpreterBridge); } else if (NeedsClinitCheckBeforeCall(method) && !method->GetDeclaringClass()->IsVisiblyInitialized()) { // If we do have code but the method needs a class initialization check before calling // that code, install the resolution stub that will perform the check. quick_code = GetOatAddress(StubType::kQuickResolutionTrampoline); } return quick_code; } void ImageWriter::CopyAndFixupMethod(ArtMethod* orig, ArtMethod* copy, size_t oat_index) { if (orig->IsAbstract()) { // Ignore the single-implementation info for abstract method. // Do this on orig instead of copy, otherwise there is a crash due to methods // are copied before classes. // TODO: handle fixup of single-implementation method for abstract method. orig->SetHasSingleImplementation(false); orig->SetSingleImplementation( nullptr, Runtime::Current()->GetClassLinker()->GetImagePointerSize()); } memcpy(copy, orig, ArtMethod::Size(target_ptr_size_)); CopyAndFixupReference( copy->GetDeclaringClassAddressWithoutBarrier(), orig->GetDeclaringClassUnchecked()); // OatWriter replaces the code_ with an offset value. Here we re-adjust to a pointer relative to // oat_begin_ // The resolution method has a special trampoline to call. Runtime* runtime = Runtime::Current(); const void* quick_code; if (orig->IsRuntimeMethod()) { ImtConflictTable* orig_table = orig->GetImtConflictTable(target_ptr_size_); if (orig_table != nullptr) { // Special IMT conflict method, normal IMT conflict method or unimplemented IMT method. quick_code = GetOatAddress(StubType::kQuickIMTConflictTrampoline); CopyAndFixupPointer(copy, ArtMethod::DataOffset(target_ptr_size_), orig_table); } else if (UNLIKELY(orig == runtime->GetResolutionMethod())) { quick_code = GetOatAddress(StubType::kQuickResolutionTrampoline); } else { bool found_one = false; for (size_t i = 0; i < static_cast(CalleeSaveType::kLastCalleeSaveType); ++i) { auto idx = static_cast(i); if (runtime->HasCalleeSaveMethod(idx) && runtime->GetCalleeSaveMethod(idx) == orig) { found_one = true; break; } } CHECK(found_one) << "Expected to find callee save method but got " << orig->PrettyMethod(); CHECK(copy->IsRuntimeMethod()); CHECK(copy->GetEntryPointFromQuickCompiledCode() == nullptr); quick_code = nullptr; } } else { // We assume all methods have code. If they don't currently then we set them to the use the // resolution trampoline. Abstract methods never have code and so we need to make sure their // use results in an AbstractMethodError. We use the interpreter to achieve this. if (UNLIKELY(!orig->IsInvokable())) { quick_code = GetOatAddress(StubType::kQuickToInterpreterBridge); } else { const ImageInfo& image_info = image_infos_[oat_index]; quick_code = GetQuickCode(orig, image_info); // JNI entrypoint: if (orig->IsNative()) { // The native method's pointer is set to a stub to lookup via dlsym. // Note this is not the code_ pointer, that is handled above. StubType stub_type = orig->IsCriticalNative() ? StubType::kJNIDlsymLookupCriticalTrampoline : StubType::kJNIDlsymLookupTrampoline; copy->SetEntryPointFromJniPtrSize(GetOatAddress(stub_type), target_ptr_size_); } else { CHECK(copy->GetDataPtrSize(target_ptr_size_) == nullptr); } } } if (quick_code != nullptr) { copy->SetEntryPointFromQuickCompiledCodePtrSize(quick_code, target_ptr_size_); } } size_t ImageWriter::ImageInfo::GetBinSizeSum(Bin up_to) const { DCHECK_LE(static_cast(up_to), kNumberOfBins); return std::accumulate(&bin_slot_sizes_[0], &bin_slot_sizes_[0] + static_cast(up_to), /*init*/ static_cast(0)); } ImageWriter::BinSlot::BinSlot(uint32_t lockword) : lockword_(lockword) { // These values may need to get updated if more bins are added to the enum Bin static_assert(kBinBits == 3, "wrong number of bin bits"); static_assert(kBinShift == 27, "wrong number of shift"); static_assert(sizeof(BinSlot) == sizeof(LockWord), "BinSlot/LockWord must have equal sizes"); DCHECK_LT(GetBin(), Bin::kMirrorCount); DCHECK_ALIGNED(GetOffset(), kObjectAlignment); } ImageWriter::BinSlot::BinSlot(Bin bin, uint32_t index) : BinSlot(index | (static_cast(bin) << kBinShift)) { DCHECK_EQ(index, GetOffset()); } ImageWriter::Bin ImageWriter::BinSlot::GetBin() const { return static_cast((lockword_ & kBinMask) >> kBinShift); } uint32_t ImageWriter::BinSlot::GetOffset() const { return lockword_ & ~kBinMask; } ImageWriter::Bin ImageWriter::BinTypeForNativeRelocationType(NativeObjectRelocationType type) { switch (type) { case NativeObjectRelocationType::kArtField: case NativeObjectRelocationType::kArtFieldArray: return Bin::kArtField; case NativeObjectRelocationType::kArtMethodClean: case NativeObjectRelocationType::kArtMethodArrayClean: return Bin::kArtMethodClean; case NativeObjectRelocationType::kArtMethodDirty: case NativeObjectRelocationType::kArtMethodArrayDirty: return Bin::kArtMethodDirty; case NativeObjectRelocationType::kDexCacheArray: return Bin::kDexCacheArray; case NativeObjectRelocationType::kRuntimeMethod: return Bin::kRuntimeMethod; case NativeObjectRelocationType::kIMTable: return Bin::kImTable; case NativeObjectRelocationType::kIMTConflictTable: return Bin::kIMTConflictTable; case NativeObjectRelocationType::kGcRootPointer: return Bin::kMetadata; } UNREACHABLE(); } size_t ImageWriter::GetOatIndex(mirror::Object* obj) const { if (!IsMultiImage()) { return GetDefaultOatIndex(); } auto it = oat_index_map_.find(obj); DCHECK(it != oat_index_map_.end()) << obj; return it->second; } size_t ImageWriter::GetOatIndexForDexFile(const DexFile* dex_file) const { if (!IsMultiImage()) { return GetDefaultOatIndex(); } auto it = dex_file_oat_index_map_.find(dex_file); DCHECK(it != dex_file_oat_index_map_.end()) << dex_file->GetLocation(); return it->second; } size_t ImageWriter::GetOatIndexForClass(ObjPtr klass) const { while (klass->IsArrayClass()) { klass = klass->GetComponentType(); } if (UNLIKELY(klass->IsPrimitive())) { DCHECK(klass->GetDexCache() == nullptr); return GetDefaultOatIndex(); } else { DCHECK(klass->GetDexCache() != nullptr); return GetOatIndexForDexFile(&klass->GetDexFile()); } } void ImageWriter::UpdateOatFileLayout(size_t oat_index, size_t oat_loaded_size, size_t oat_data_offset, size_t oat_data_size) { DCHECK_GE(oat_loaded_size, oat_data_offset); DCHECK_GE(oat_loaded_size - oat_data_offset, oat_data_size); const uint8_t* images_end = image_infos_.back().image_begin_ + image_infos_.back().image_size_; DCHECK(images_end != nullptr); // Image space must be ready. for (const ImageInfo& info : image_infos_) { DCHECK_LE(info.image_begin_ + info.image_size_, images_end); } ImageInfo& cur_image_info = GetImageInfo(oat_index); cur_image_info.oat_file_begin_ = images_end + cur_image_info.oat_offset_; cur_image_info.oat_loaded_size_ = oat_loaded_size; cur_image_info.oat_data_begin_ = cur_image_info.oat_file_begin_ + oat_data_offset; cur_image_info.oat_size_ = oat_data_size; if (compiler_options_.IsAppImage()) { CHECK_EQ(oat_filenames_.size(), 1u) << "App image should have no next image."; return; } // Update the oat_offset of the next image info. if (oat_index + 1u != oat_filenames_.size()) { // There is a following one. ImageInfo& next_image_info = GetImageInfo(oat_index + 1u); next_image_info.oat_offset_ = cur_image_info.oat_offset_ + oat_loaded_size; } } void ImageWriter::UpdateOatFileHeader(size_t oat_index, const OatHeader& oat_header) { ImageInfo& cur_image_info = GetImageInfo(oat_index); cur_image_info.oat_checksum_ = oat_header.GetChecksum(); if (oat_index == GetDefaultOatIndex()) { // Primary oat file, read the trampolines. cur_image_info.SetStubOffset(StubType::kJNIDlsymLookupTrampoline, oat_header.GetJniDlsymLookupTrampolineOffset()); cur_image_info.SetStubOffset(StubType::kJNIDlsymLookupCriticalTrampoline, oat_header.GetJniDlsymLookupCriticalTrampolineOffset()); cur_image_info.SetStubOffset(StubType::kQuickGenericJNITrampoline, oat_header.GetQuickGenericJniTrampolineOffset()); cur_image_info.SetStubOffset(StubType::kQuickIMTConflictTrampoline, oat_header.GetQuickImtConflictTrampolineOffset()); cur_image_info.SetStubOffset(StubType::kQuickResolutionTrampoline, oat_header.GetQuickResolutionTrampolineOffset()); cur_image_info.SetStubOffset(StubType::kQuickToInterpreterBridge, oat_header.GetQuickToInterpreterBridgeOffset()); } } ImageWriter::ImageWriter( const CompilerOptions& compiler_options, uintptr_t image_begin, ImageHeader::StorageMode image_storage_mode, const std::vector& oat_filenames, const std::unordered_map& dex_file_oat_index_map, jobject class_loader, const HashSet* dirty_image_objects) : compiler_options_(compiler_options), boot_image_begin_(Runtime::Current()->GetHeap()->GetBootImagesStartAddress()), boot_image_size_(Runtime::Current()->GetHeap()->GetBootImagesSize()), global_image_begin_(reinterpret_cast(image_begin)), image_objects_offset_begin_(0), target_ptr_size_(InstructionSetPointerSize(compiler_options.GetInstructionSet())), image_infos_(oat_filenames.size()), dirty_methods_(0u), clean_methods_(0u), app_class_loader_(class_loader), boot_image_live_objects_(nullptr), image_storage_mode_(image_storage_mode), oat_filenames_(oat_filenames), dex_file_oat_index_map_(dex_file_oat_index_map), dirty_image_objects_(dirty_image_objects) { DCHECK(compiler_options.IsBootImage() || compiler_options.IsBootImageExtension() || compiler_options.IsAppImage()); DCHECK_EQ(compiler_options.IsBootImage(), boot_image_begin_ == 0u); DCHECK_EQ(compiler_options.IsBootImage(), boot_image_size_ == 0u); CHECK_NE(image_begin, 0U); std::fill_n(image_methods_, arraysize(image_methods_), nullptr); CHECK_EQ(compiler_options.IsBootImage(), Runtime::Current()->GetHeap()->GetBootImageSpaces().empty()) << "Compiling a boot image should occur iff there are no boot image spaces loaded"; if (compiler_options_.IsAppImage()) { // Make sure objects are not crossing region boundaries for app images. region_size_ = gc::space::RegionSpace::kRegionSize; } } ImageWriter::ImageInfo::ImageInfo() : intern_table_(new InternTable), class_table_(new ClassTable) {} template void ImageWriter::CopyAndFixupReference(DestType* dest, ObjPtr src) { static_assert(std::is_same>::value || std::is_same>::value, "DestType must be a Compressed-/HeapReference."); dest->Assign(GetImageAddress(src.Ptr())); } void ImageWriter::CopyAndFixupPointer(void** target, void* value, PointerSize pointer_size) { void* new_value = NativeLocationInImage(value); if (pointer_size == PointerSize::k32) { *reinterpret_cast(target) = reinterpret_cast32(new_value); } else { *reinterpret_cast(target) = reinterpret_cast64(new_value); } DCHECK(value != nullptr); } void ImageWriter::CopyAndFixupPointer(void** target, void* value) REQUIRES_SHARED(Locks::mutator_lock_) { CopyAndFixupPointer(target, value, target_ptr_size_); } void ImageWriter::CopyAndFixupPointer( void* object, MemberOffset offset, void* value, PointerSize pointer_size) { void** target = reinterpret_cast(reinterpret_cast(object) + offset.Uint32Value()); return CopyAndFixupPointer(target, value, pointer_size); } void ImageWriter::CopyAndFixupPointer(void* object, MemberOffset offset, void* value) { return CopyAndFixupPointer(object, offset, value, target_ptr_size_); } } // namespace linker } // namespace art