heap.cc revision 601276abdb746b03675ff945745aa936694d3439
1/* 2 * Copyright (C) 2011 The Android Open Source Project 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17#include "heap.h" 18 19#define ATRACE_TAG ATRACE_TAG_DALVIK 20#include <cutils/trace.h> 21 22#include <limits> 23#include <vector> 24#include <valgrind.h> 25 26#include "base/histogram-inl.h" 27#include "base/stl_util.h" 28#include "common_throws.h" 29#include "cutils/sched_policy.h" 30#include "debugger.h" 31#include "gc/accounting/atomic_stack.h" 32#include "gc/accounting/card_table-inl.h" 33#include "gc/accounting/heap_bitmap-inl.h" 34#include "gc/accounting/mod_union_table.h" 35#include "gc/accounting/mod_union_table-inl.h" 36#include "gc/accounting/remembered_set.h" 37#include "gc/accounting/space_bitmap-inl.h" 38#include "gc/collector/mark_sweep-inl.h" 39#include "gc/collector/partial_mark_sweep.h" 40#include "gc/collector/semi_space.h" 41#include "gc/collector/sticky_mark_sweep.h" 42#include "gc/space/bump_pointer_space.h" 43#include "gc/space/dlmalloc_space-inl.h" 44#include "gc/space/image_space.h" 45#include "gc/space/large_object_space.h" 46#include "gc/space/rosalloc_space-inl.h" 47#include "gc/space/space-inl.h" 48#include "gc/space/zygote_space.h" 49#include "entrypoints/quick/quick_alloc_entrypoints.h" 50#include "heap-inl.h" 51#include "image.h" 52#include "mirror/art_field-inl.h" 53#include "mirror/class-inl.h" 54#include "mirror/object.h" 55#include "mirror/object-inl.h" 56#include "mirror/object_array-inl.h" 57#include "mirror/reference-inl.h" 58#include "object_utils.h" 59#include "os.h" 60#include "reflection.h" 61#include "runtime.h" 62#include "ScopedLocalRef.h" 63#include "scoped_thread_state_change.h" 64#include "sirt_ref.h" 65#include "thread_list.h" 66#include "UniquePtr.h" 67#include "well_known_classes.h" 68 69namespace art { 70 71namespace gc { 72 73static constexpr bool kGCALotMode = false; 74static constexpr size_t kGcAlotInterval = KB; 75// Minimum amount of remaining bytes before a concurrent GC is triggered. 76static constexpr size_t kMinConcurrentRemainingBytes = 128 * KB; 77static constexpr size_t kMaxConcurrentRemainingBytes = 512 * KB; 78 79Heap::Heap(size_t initial_size, size_t growth_limit, size_t min_free, size_t max_free, 80 double target_utilization, size_t capacity, const std::string& image_file_name, 81 CollectorType post_zygote_collector_type, CollectorType background_collector_type, 82 size_t parallel_gc_threads, size_t conc_gc_threads, bool low_memory_mode, 83 size_t long_pause_log_threshold, size_t long_gc_log_threshold, 84 bool ignore_max_footprint, bool use_tlab, bool verify_pre_gc_heap, 85 bool verify_post_gc_heap, bool verify_pre_gc_rosalloc, 86 bool verify_post_gc_rosalloc) 87 : non_moving_space_(nullptr), 88 rosalloc_space_(nullptr), 89 dlmalloc_space_(nullptr), 90 main_space_(nullptr), 91 concurrent_gc_(false), 92 collector_type_(kCollectorTypeNone), 93 post_zygote_collector_type_(post_zygote_collector_type), 94 background_collector_type_(background_collector_type), 95 desired_collector_type_(collector_type_), 96 heap_trim_request_lock_(nullptr), 97 last_trim_time_(0), 98 heap_transition_target_time_(0), 99 heap_trim_request_pending_(false), 100 parallel_gc_threads_(parallel_gc_threads), 101 conc_gc_threads_(conc_gc_threads), 102 low_memory_mode_(low_memory_mode), 103 long_pause_log_threshold_(long_pause_log_threshold), 104 long_gc_log_threshold_(long_gc_log_threshold), 105 ignore_max_footprint_(ignore_max_footprint), 106 have_zygote_space_(false), 107 large_object_threshold_(std::numeric_limits<size_t>::max()), // Starts out disabled. 108 collector_type_running_(kCollectorTypeNone), 109 last_gc_type_(collector::kGcTypeNone), 110 next_gc_type_(collector::kGcTypePartial), 111 capacity_(capacity), 112 growth_limit_(growth_limit), 113 max_allowed_footprint_(initial_size), 114 native_footprint_gc_watermark_(initial_size), 115 native_footprint_limit_(2 * initial_size), 116 native_need_to_run_finalization_(false), 117 // Initially assume we perceive jank in case the process state is never updated. 118 process_state_(kProcessStateJankPerceptible), 119 concurrent_start_bytes_(std::numeric_limits<size_t>::max()), 120 total_bytes_freed_ever_(0), 121 total_objects_freed_ever_(0), 122 num_bytes_allocated_(0), 123 native_bytes_allocated_(0), 124 gc_memory_overhead_(0), 125 verify_missing_card_marks_(false), 126 verify_system_weaks_(false), 127 verify_pre_gc_heap_(verify_pre_gc_heap), 128 verify_post_gc_heap_(verify_post_gc_heap), 129 verify_mod_union_table_(false), 130 verify_pre_gc_rosalloc_(verify_pre_gc_rosalloc), 131 verify_post_gc_rosalloc_(verify_post_gc_rosalloc), 132 allocation_rate_(0), 133 /* For GC a lot mode, we limit the allocations stacks to be kGcAlotInterval allocations. This 134 * causes a lot of GC since we do a GC for alloc whenever the stack is full. When heap 135 * verification is enabled, we limit the size of allocation stacks to speed up their 136 * searching. 137 */ 138 max_allocation_stack_size_(kGCALotMode ? kGcAlotInterval 139 : (kVerifyObjectSupport > kVerifyObjectModeFast) ? KB : MB), 140 current_allocator_(kAllocatorTypeDlMalloc), 141 current_non_moving_allocator_(kAllocatorTypeNonMoving), 142 bump_pointer_space_(nullptr), 143 temp_space_(nullptr), 144 min_free_(min_free), 145 max_free_(max_free), 146 target_utilization_(target_utilization), 147 total_wait_time_(0), 148 total_allocation_time_(0), 149 verify_object_mode_(kVerifyObjectModeDisabled), 150 disable_moving_gc_count_(0), 151 running_on_valgrind_(RUNNING_ON_VALGRIND > 0), 152 use_tlab_(use_tlab) { 153 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { 154 LOG(INFO) << "Heap() entering"; 155 } 156 const bool is_zygote = Runtime::Current()->IsZygote(); 157 // If we aren't the zygote, switch to the default non zygote allocator. This may update the 158 // entrypoints. 159 if (!is_zygote) { 160 desired_collector_type_ = post_zygote_collector_type_; 161 large_object_threshold_ = kDefaultLargeObjectThreshold; 162 } else { 163 if (kMovingCollector) { 164 // We are the zygote, use bump pointer allocation + semi space collector. 165 bool generational = post_zygote_collector_type_ == kCollectorTypeGSS; 166 desired_collector_type_ = generational ? kCollectorTypeGSS : kCollectorTypeSS; 167 } else { 168 desired_collector_type_ = post_zygote_collector_type_; 169 } 170 } 171 ChangeCollector(desired_collector_type_); 172 173 live_bitmap_.reset(new accounting::HeapBitmap(this)); 174 mark_bitmap_.reset(new accounting::HeapBitmap(this)); 175 // Requested begin for the alloc space, to follow the mapped image and oat files 176 byte* requested_alloc_space_begin = nullptr; 177 if (!image_file_name.empty()) { 178 space::ImageSpace* image_space = space::ImageSpace::Create(image_file_name.c_str()); 179 CHECK(image_space != nullptr) << "Failed to create space for " << image_file_name; 180 AddSpace(image_space); 181 // Oat files referenced by image files immediately follow them in memory, ensure alloc space 182 // isn't going to get in the middle 183 byte* oat_file_end_addr = image_space->GetImageHeader().GetOatFileEnd(); 184 CHECK_GT(oat_file_end_addr, image_space->End()); 185 if (oat_file_end_addr > requested_alloc_space_begin) { 186 requested_alloc_space_begin = AlignUp(oat_file_end_addr, kPageSize); 187 } 188 } 189 MemMap* malloc_space_mem_map = nullptr; 190 const char* malloc_space_name = is_zygote ? "zygote space" : "alloc space"; 191 if (is_zygote) { 192 // Allocate a single mem map that is split into the malloc space 193 // and the post zygote non-moving space to put them adjacent. 194 size_t post_zygote_non_moving_space_size = 64 * MB; 195 size_t non_moving_spaces_size = capacity + post_zygote_non_moving_space_size; 196 std::string error_str; 197 malloc_space_mem_map = MemMap::MapAnonymous(malloc_space_name, requested_alloc_space_begin, 198 non_moving_spaces_size, PROT_READ | PROT_WRITE, 199 true, &error_str); 200 CHECK(malloc_space_mem_map != nullptr) << error_str; 201 post_zygote_non_moving_space_mem_map_.reset(malloc_space_mem_map->RemapAtEnd( 202 malloc_space_mem_map->Begin() + capacity, "post zygote non-moving space", 203 PROT_READ | PROT_WRITE, &error_str)); 204 CHECK(post_zygote_non_moving_space_mem_map_.get() != nullptr) << error_str; 205 VLOG(heap) << "malloc space mem map : " << malloc_space_mem_map; 206 VLOG(heap) << "post zygote non-moving space mem map : " 207 << post_zygote_non_moving_space_mem_map_.get(); 208 } else { 209 // Allocate a mem map for the malloc space. 210 std::string error_str; 211 malloc_space_mem_map = MemMap::MapAnonymous(malloc_space_name, requested_alloc_space_begin, 212 capacity, PROT_READ | PROT_WRITE, true, &error_str); 213 CHECK(malloc_space_mem_map != nullptr) << error_str; 214 VLOG(heap) << "malloc space mem map : " << malloc_space_mem_map; 215 } 216 CHECK(malloc_space_mem_map != nullptr); 217 space::MallocSpace* malloc_space; 218 if (kUseRosAlloc) { 219 malloc_space = space::RosAllocSpace::CreateFromMemMap(malloc_space_mem_map, malloc_space_name, 220 kDefaultStartingSize, initial_size, 221 growth_limit, capacity, low_memory_mode_); 222 CHECK(malloc_space != nullptr) << "Failed to create rosalloc space"; 223 } else { 224 malloc_space = space::DlMallocSpace::CreateFromMemMap(malloc_space_mem_map, malloc_space_name, 225 kDefaultStartingSize, initial_size, 226 growth_limit, capacity); 227 CHECK(malloc_space != nullptr) << "Failed to create dlmalloc space"; 228 } 229 VLOG(heap) << "malloc_space : " << malloc_space; 230 if (kMovingCollector) { 231 // TODO: Place bump-pointer spaces somewhere to minimize size of card table. 232 // TODO: Having 3+ spaces as big as the large heap size can cause virtual memory fragmentation 233 // issues. 234 const size_t bump_pointer_space_size = std::min(malloc_space->Capacity(), 128 * MB); 235 bump_pointer_space_ = space::BumpPointerSpace::Create("Bump pointer space", 236 bump_pointer_space_size, nullptr); 237 CHECK(bump_pointer_space_ != nullptr) << "Failed to create bump pointer space"; 238 AddSpace(bump_pointer_space_); 239 temp_space_ = space::BumpPointerSpace::Create("Bump pointer space 2", bump_pointer_space_size, 240 nullptr); 241 CHECK(temp_space_ != nullptr) << "Failed to create bump pointer space"; 242 AddSpace(temp_space_); 243 VLOG(heap) << "bump_pointer_space : " << bump_pointer_space_; 244 VLOG(heap) << "temp_space : " << temp_space_; 245 } 246 non_moving_space_ = malloc_space; 247 malloc_space->SetFootprintLimit(malloc_space->Capacity()); 248 AddSpace(malloc_space); 249 250 // Allocate the large object space. 251 constexpr bool kUseFreeListSpaceForLOS = false; 252 if (kUseFreeListSpaceForLOS) { 253 large_object_space_ = space::FreeListSpace::Create("large object space", nullptr, capacity); 254 } else { 255 large_object_space_ = space::LargeObjectMapSpace::Create("large object space"); 256 } 257 CHECK(large_object_space_ != nullptr) << "Failed to create large object space"; 258 AddSpace(large_object_space_); 259 260 // Compute heap capacity. Continuous spaces are sorted in order of Begin(). 261 CHECK(!continuous_spaces_.empty()); 262 263 // Relies on the spaces being sorted. 264 byte* heap_begin = continuous_spaces_.front()->Begin(); 265 byte* heap_end = continuous_spaces_.back()->Limit(); 266 if (is_zygote) { 267 CHECK(post_zygote_non_moving_space_mem_map_.get() != nullptr); 268 heap_begin = std::min(post_zygote_non_moving_space_mem_map_->Begin(), heap_begin); 269 heap_end = std::max(post_zygote_non_moving_space_mem_map_->End(), heap_end); 270 } 271 size_t heap_capacity = heap_end - heap_begin; 272 273 // Allocate the card table. 274 card_table_.reset(accounting::CardTable::Create(heap_begin, heap_capacity)); 275 CHECK(card_table_.get() != NULL) << "Failed to create card table"; 276 277 // Card cache for now since it makes it easier for us to update the references to the copying 278 // spaces. 279 accounting::ModUnionTable* mod_union_table = 280 new accounting::ModUnionTableCardCache("Image mod-union table", this, GetImageSpace()); 281 CHECK(mod_union_table != nullptr) << "Failed to create image mod-union table"; 282 AddModUnionTable(mod_union_table); 283 284 if (collector::SemiSpace::kUseRememberedSet) { 285 accounting::RememberedSet* non_moving_space_rem_set = 286 new accounting::RememberedSet("Non-moving space remembered set", this, non_moving_space_); 287 CHECK(non_moving_space_rem_set != nullptr) << "Failed to create non-moving space remembered set"; 288 AddRememberedSet(non_moving_space_rem_set); 289 } 290 291 // TODO: Count objects in the image space here. 292 num_bytes_allocated_ = 0; 293 294 // Default mark stack size in bytes. 295 static const size_t default_mark_stack_size = 64 * KB; 296 mark_stack_.reset(accounting::ObjectStack::Create("mark stack", default_mark_stack_size)); 297 allocation_stack_.reset(accounting::ObjectStack::Create("allocation stack", 298 max_allocation_stack_size_)); 299 live_stack_.reset(accounting::ObjectStack::Create("live stack", 300 max_allocation_stack_size_)); 301 302 // It's still too early to take a lock because there are no threads yet, but we can create locks 303 // now. We don't create it earlier to make it clear that you can't use locks during heap 304 // initialization. 305 gc_complete_lock_ = new Mutex("GC complete lock"); 306 gc_complete_cond_.reset(new ConditionVariable("GC complete condition variable", 307 *gc_complete_lock_)); 308 heap_trim_request_lock_ = new Mutex("Heap trim request lock"); 309 last_gc_size_ = GetBytesAllocated(); 310 311 if (ignore_max_footprint_) { 312 SetIdealFootprint(std::numeric_limits<size_t>::max()); 313 concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); 314 } 315 CHECK_NE(max_allowed_footprint_, 0U); 316 317 // Create our garbage collectors. 318 for (size_t i = 0; i < 2; ++i) { 319 const bool concurrent = i != 0; 320 garbage_collectors_.push_back(new collector::MarkSweep(this, concurrent)); 321 garbage_collectors_.push_back(new collector::PartialMarkSweep(this, concurrent)); 322 garbage_collectors_.push_back(new collector::StickyMarkSweep(this, concurrent)); 323 } 324 if (kMovingCollector) { 325 // TODO: Clean this up. 326 bool generational = post_zygote_collector_type_ == kCollectorTypeGSS; 327 semi_space_collector_ = new collector::SemiSpace(this, generational); 328 garbage_collectors_.push_back(semi_space_collector_); 329 } 330 331 if (running_on_valgrind_) { 332 Runtime::Current()->GetInstrumentation()->InstrumentQuickAllocEntryPoints(); 333 } 334 335 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { 336 LOG(INFO) << "Heap() exiting"; 337 } 338} 339 340void Heap::ChangeAllocator(AllocatorType allocator) { 341 if (current_allocator_ != allocator) { 342 // These two allocators are only used internally and don't have any entrypoints. 343 CHECK_NE(allocator, kAllocatorTypeLOS); 344 CHECK_NE(allocator, kAllocatorTypeNonMoving); 345 current_allocator_ = allocator; 346 MutexLock mu(nullptr, *Locks::runtime_shutdown_lock_); 347 SetQuickAllocEntryPointsAllocator(current_allocator_); 348 Runtime::Current()->GetInstrumentation()->ResetQuickAllocEntryPoints(); 349 } 350} 351 352void Heap::DisableCompaction() { 353 if (IsCompactingGC(post_zygote_collector_type_)) { 354 post_zygote_collector_type_ = kCollectorTypeCMS; 355 } 356 if (IsCompactingGC(background_collector_type_)) { 357 background_collector_type_ = post_zygote_collector_type_; 358 } 359 TransitionCollector(post_zygote_collector_type_); 360} 361 362std::string Heap::SafeGetClassDescriptor(mirror::Class* klass) { 363 if (!IsValidContinuousSpaceObjectAddress(klass)) { 364 return StringPrintf("<non heap address klass %p>", klass); 365 } 366 mirror::Class* component_type = klass->GetComponentType<kVerifyNone>(); 367 if (IsValidContinuousSpaceObjectAddress(component_type) && klass->IsArrayClass<kVerifyNone>()) { 368 std::string result("["); 369 result += SafeGetClassDescriptor(component_type); 370 return result; 371 } else if (UNLIKELY(klass->IsPrimitive<kVerifyNone>())) { 372 return Primitive::Descriptor(klass->GetPrimitiveType<kVerifyNone>()); 373 } else if (UNLIKELY(klass->IsProxyClass<kVerifyNone>())) { 374 return Runtime::Current()->GetClassLinker()->GetDescriptorForProxy(klass); 375 } else { 376 mirror::DexCache* dex_cache = klass->GetDexCache<kVerifyNone>(); 377 if (!IsValidContinuousSpaceObjectAddress(dex_cache)) { 378 return StringPrintf("<non heap address dex_cache %p>", dex_cache); 379 } 380 const DexFile* dex_file = dex_cache->GetDexFile(); 381 uint16_t class_def_idx = klass->GetDexClassDefIndex(); 382 if (class_def_idx == DexFile::kDexNoIndex16) { 383 return "<class def not found>"; 384 } 385 const DexFile::ClassDef& class_def = dex_file->GetClassDef(class_def_idx); 386 const DexFile::TypeId& type_id = dex_file->GetTypeId(class_def.class_idx_); 387 return dex_file->GetTypeDescriptor(type_id); 388 } 389} 390 391std::string Heap::SafePrettyTypeOf(mirror::Object* obj) { 392 if (obj == nullptr) { 393 return "null"; 394 } 395 mirror::Class* klass = obj->GetClass<kVerifyNone>(); 396 if (klass == nullptr) { 397 return "(class=null)"; 398 } 399 std::string result(SafeGetClassDescriptor(klass)); 400 if (obj->IsClass()) { 401 result += "<" + SafeGetClassDescriptor(obj->AsClass<kVerifyNone>()) + ">"; 402 } 403 return result; 404} 405 406void Heap::DumpObject(std::ostream& stream, mirror::Object* obj) { 407 if (obj == nullptr) { 408 stream << "(obj=null)"; 409 return; 410 } 411 if (IsAligned<kObjectAlignment>(obj)) { 412 space::Space* space = nullptr; 413 // Don't use find space since it only finds spaces which actually contain objects instead of 414 // spaces which may contain objects (e.g. cleared bump pointer spaces). 415 for (const auto& cur_space : continuous_spaces_) { 416 if (cur_space->HasAddress(obj)) { 417 space = cur_space; 418 break; 419 } 420 } 421 if (space == nullptr) { 422 if (allocator_mem_map_.get() == nullptr || !allocator_mem_map_->HasAddress(obj)) { 423 stream << "obj " << obj << " not a valid heap address"; 424 return; 425 } else if (allocator_mem_map_.get() != nullptr) { 426 allocator_mem_map_->Protect(PROT_READ | PROT_WRITE); 427 } 428 } 429 // Unprotect all the spaces. 430 for (const auto& space : continuous_spaces_) { 431 mprotect(space->Begin(), space->Capacity(), PROT_READ | PROT_WRITE); 432 } 433 stream << "Object " << obj; 434 if (space != nullptr) { 435 stream << " in space " << *space; 436 } 437 mirror::Class* klass = obj->GetClass<kVerifyNone>(); 438 stream << "\nclass=" << klass; 439 if (klass != nullptr) { 440 stream << " type= " << SafePrettyTypeOf(obj); 441 } 442 // Re-protect the address we faulted on. 443 mprotect(AlignDown(obj, kPageSize), kPageSize, PROT_NONE); 444 } 445} 446 447bool Heap::IsCompilingBoot() const { 448 for (const auto& space : continuous_spaces_) { 449 if (space->IsImageSpace() || space->IsZygoteSpace()) { 450 return false; 451 } 452 } 453 return true; 454} 455 456bool Heap::HasImageSpace() const { 457 for (const auto& space : continuous_spaces_) { 458 if (space->IsImageSpace()) { 459 return true; 460 } 461 } 462 return false; 463} 464 465void Heap::IncrementDisableMovingGC(Thread* self) { 466 // Need to do this holding the lock to prevent races where the GC is about to run / running when 467 // we attempt to disable it. 468 ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); 469 MutexLock mu(self, *gc_complete_lock_); 470 ++disable_moving_gc_count_; 471 if (IsCompactingGC(collector_type_running_)) { 472 WaitForGcToCompleteLocked(self); 473 } 474} 475 476void Heap::DecrementDisableMovingGC(Thread* self) { 477 MutexLock mu(self, *gc_complete_lock_); 478 CHECK_GE(disable_moving_gc_count_, 0U); 479 --disable_moving_gc_count_; 480} 481 482void Heap::UpdateProcessState(ProcessState process_state) { 483 if (process_state_ != process_state) { 484 process_state_ = process_state; 485 if (process_state_ == kProcessStateJankPerceptible) { 486 // Transition back to foreground right away to prevent jank. 487 RequestCollectorTransition(post_zygote_collector_type_, 0); 488 } else { 489 // Don't delay for debug builds since we may want to stress test the GC. 490 RequestCollectorTransition(background_collector_type_, kIsDebugBuild ? 0 : 491 kCollectorTransitionWait); 492 } 493 } 494} 495 496void Heap::CreateThreadPool() { 497 const size_t num_threads = std::max(parallel_gc_threads_, conc_gc_threads_); 498 if (num_threads != 0) { 499 thread_pool_.reset(new ThreadPool("Heap thread pool", num_threads)); 500 } 501} 502 503void Heap::VisitObjects(ObjectCallback callback, void* arg) { 504 Thread* self = Thread::Current(); 505 // GCs can move objects, so don't allow this. 506 const char* old_cause = self->StartAssertNoThreadSuspension("Visiting objects"); 507 if (bump_pointer_space_ != nullptr) { 508 // Visit objects in bump pointer space. 509 bump_pointer_space_->Walk(callback, arg); 510 } 511 // TODO: Switch to standard begin and end to use ranged a based loop. 512 for (mirror::Object** it = allocation_stack_->Begin(), **end = allocation_stack_->End(); 513 it < end; ++it) { 514 mirror::Object* obj = *it; 515 if (obj != nullptr && obj->GetClass() != nullptr) { 516 // Avoid the race condition caused by the object not yet being written into the allocation 517 // stack or the class not yet being written in the object. Or, if kUseThreadLocalAllocationStack, 518 // there can be nulls on the allocation stack. 519 callback(obj, arg); 520 } 521 } 522 GetLiveBitmap()->Walk(callback, arg); 523 self->EndAssertNoThreadSuspension(old_cause); 524} 525 526void Heap::MarkAllocStackAsLive(accounting::ObjectStack* stack) { 527 space::ContinuousSpace* space1 = rosalloc_space_ != nullptr ? rosalloc_space_ : non_moving_space_; 528 space::ContinuousSpace* space2 = dlmalloc_space_ != nullptr ? dlmalloc_space_ : non_moving_space_; 529 // This is just logic to handle a case of either not having a rosalloc or dlmalloc space. 530 // TODO: Generalize this to n bitmaps? 531 if (space1 == nullptr) { 532 DCHECK(space2 != nullptr); 533 space1 = space2; 534 } 535 if (space2 == nullptr) { 536 DCHECK(space1 != nullptr); 537 space2 = space1; 538 } 539 MarkAllocStack(space1->GetLiveBitmap(), space2->GetLiveBitmap(), 540 large_object_space_->GetLiveObjects(), stack); 541} 542 543void Heap::DeleteThreadPool() { 544 thread_pool_.reset(nullptr); 545} 546 547void Heap::AddSpace(space::Space* space, bool set_as_default) { 548 DCHECK(space != nullptr); 549 WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); 550 if (space->IsContinuousSpace()) { 551 DCHECK(!space->IsDiscontinuousSpace()); 552 space::ContinuousSpace* continuous_space = space->AsContinuousSpace(); 553 // Continuous spaces don't necessarily have bitmaps. 554 accounting::SpaceBitmap* live_bitmap = continuous_space->GetLiveBitmap(); 555 accounting::SpaceBitmap* mark_bitmap = continuous_space->GetMarkBitmap(); 556 if (live_bitmap != nullptr) { 557 DCHECK(mark_bitmap != nullptr); 558 live_bitmap_->AddContinuousSpaceBitmap(live_bitmap); 559 mark_bitmap_->AddContinuousSpaceBitmap(mark_bitmap); 560 } 561 continuous_spaces_.push_back(continuous_space); 562 if (set_as_default) { 563 if (continuous_space->IsDlMallocSpace()) { 564 dlmalloc_space_ = continuous_space->AsDlMallocSpace(); 565 } else if (continuous_space->IsRosAllocSpace()) { 566 rosalloc_space_ = continuous_space->AsRosAllocSpace(); 567 } 568 } 569 // Ensure that spaces remain sorted in increasing order of start address. 570 std::sort(continuous_spaces_.begin(), continuous_spaces_.end(), 571 [](const space::ContinuousSpace* a, const space::ContinuousSpace* b) { 572 return a->Begin() < b->Begin(); 573 }); 574 } else { 575 DCHECK(space->IsDiscontinuousSpace()); 576 space::DiscontinuousSpace* discontinuous_space = space->AsDiscontinuousSpace(); 577 DCHECK(discontinuous_space->GetLiveObjects() != nullptr); 578 live_bitmap_->AddDiscontinuousObjectSet(discontinuous_space->GetLiveObjects()); 579 DCHECK(discontinuous_space->GetMarkObjects() != nullptr); 580 mark_bitmap_->AddDiscontinuousObjectSet(discontinuous_space->GetMarkObjects()); 581 discontinuous_spaces_.push_back(discontinuous_space); 582 } 583 if (space->IsAllocSpace()) { 584 alloc_spaces_.push_back(space->AsAllocSpace()); 585 } 586} 587 588void Heap::RemoveSpace(space::Space* space) { 589 DCHECK(space != nullptr); 590 WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); 591 if (space->IsContinuousSpace()) { 592 DCHECK(!space->IsDiscontinuousSpace()); 593 space::ContinuousSpace* continuous_space = space->AsContinuousSpace(); 594 // Continuous spaces don't necessarily have bitmaps. 595 accounting::SpaceBitmap* live_bitmap = continuous_space->GetLiveBitmap(); 596 accounting::SpaceBitmap* mark_bitmap = continuous_space->GetMarkBitmap(); 597 if (live_bitmap != nullptr) { 598 DCHECK(mark_bitmap != nullptr); 599 live_bitmap_->RemoveContinuousSpaceBitmap(live_bitmap); 600 mark_bitmap_->RemoveContinuousSpaceBitmap(mark_bitmap); 601 } 602 auto it = std::find(continuous_spaces_.begin(), continuous_spaces_.end(), continuous_space); 603 DCHECK(it != continuous_spaces_.end()); 604 continuous_spaces_.erase(it); 605 if (continuous_space == dlmalloc_space_) { 606 dlmalloc_space_ = nullptr; 607 } else if (continuous_space == rosalloc_space_) { 608 rosalloc_space_ = nullptr; 609 } 610 if (continuous_space == main_space_) { 611 main_space_ = nullptr; 612 } 613 } else { 614 DCHECK(space->IsDiscontinuousSpace()); 615 space::DiscontinuousSpace* discontinuous_space = space->AsDiscontinuousSpace(); 616 DCHECK(discontinuous_space->GetLiveObjects() != nullptr); 617 live_bitmap_->RemoveDiscontinuousObjectSet(discontinuous_space->GetLiveObjects()); 618 DCHECK(discontinuous_space->GetMarkObjects() != nullptr); 619 mark_bitmap_->RemoveDiscontinuousObjectSet(discontinuous_space->GetMarkObjects()); 620 auto it = std::find(discontinuous_spaces_.begin(), discontinuous_spaces_.end(), 621 discontinuous_space); 622 DCHECK(it != discontinuous_spaces_.end()); 623 discontinuous_spaces_.erase(it); 624 } 625 if (space->IsAllocSpace()) { 626 auto it = std::find(alloc_spaces_.begin(), alloc_spaces_.end(), space->AsAllocSpace()); 627 DCHECK(it != alloc_spaces_.end()); 628 alloc_spaces_.erase(it); 629 } 630} 631 632void Heap::RegisterGCAllocation(size_t bytes) { 633 if (this != nullptr) { 634 gc_memory_overhead_.FetchAndAdd(bytes); 635 } 636} 637 638void Heap::RegisterGCDeAllocation(size_t bytes) { 639 if (this != nullptr) { 640 gc_memory_overhead_.FetchAndSub(bytes); 641 } 642} 643 644void Heap::DumpGcPerformanceInfo(std::ostream& os) { 645 // Dump cumulative timings. 646 os << "Dumping cumulative Gc timings\n"; 647 uint64_t total_duration = 0; 648 649 // Dump cumulative loggers for each GC type. 650 uint64_t total_paused_time = 0; 651 for (const auto& collector : garbage_collectors_) { 652 CumulativeLogger& logger = collector->GetCumulativeTimings(); 653 if (logger.GetTotalNs() != 0) { 654 os << Dumpable<CumulativeLogger>(logger); 655 const uint64_t total_ns = logger.GetTotalNs(); 656 const uint64_t total_pause_ns = collector->GetTotalPausedTimeNs(); 657 double seconds = NsToMs(logger.GetTotalNs()) / 1000.0; 658 const uint64_t freed_bytes = collector->GetTotalFreedBytes(); 659 const uint64_t freed_objects = collector->GetTotalFreedObjects(); 660 Histogram<uint64_t>::CumulativeData cumulative_data; 661 collector->GetPauseHistogram().CreateHistogram(&cumulative_data); 662 collector->GetPauseHistogram().PrintConfidenceIntervals(os, 0.99, cumulative_data); 663 os << collector->GetName() << " total time: " << PrettyDuration(total_ns) << "\n" 664 << collector->GetName() << " freed: " << freed_objects 665 << " objects with total size " << PrettySize(freed_bytes) << "\n" 666 << collector->GetName() << " throughput: " << freed_objects / seconds << "/s / " 667 << PrettySize(freed_bytes / seconds) << "/s\n"; 668 total_duration += total_ns; 669 total_paused_time += total_pause_ns; 670 } 671 } 672 uint64_t allocation_time = static_cast<uint64_t>(total_allocation_time_) * kTimeAdjust; 673 if (total_duration != 0) { 674 const double total_seconds = static_cast<double>(total_duration / 1000) / 1000000.0; 675 os << "Total time spent in GC: " << PrettyDuration(total_duration) << "\n"; 676 os << "Mean GC size throughput: " 677 << PrettySize(GetBytesFreedEver() / total_seconds) << "/s\n"; 678 os << "Mean GC object throughput: " 679 << (GetObjectsFreedEver() / total_seconds) << " objects/s\n"; 680 } 681 size_t total_objects_allocated = GetObjectsAllocatedEver(); 682 os << "Total number of allocations: " << total_objects_allocated << "\n"; 683 size_t total_bytes_allocated = GetBytesAllocatedEver(); 684 os << "Total bytes allocated " << PrettySize(total_bytes_allocated) << "\n"; 685 if (kMeasureAllocationTime) { 686 os << "Total time spent allocating: " << PrettyDuration(allocation_time) << "\n"; 687 os << "Mean allocation time: " << PrettyDuration(allocation_time / total_objects_allocated) 688 << "\n"; 689 } 690 os << "Total mutator paused time: " << PrettyDuration(total_paused_time) << "\n"; 691 os << "Total time waiting for GC to complete: " << PrettyDuration(total_wait_time_) << "\n"; 692 os << "Approximate GC data structures memory overhead: " << gc_memory_overhead_; 693} 694 695Heap::~Heap() { 696 VLOG(heap) << "Starting ~Heap()"; 697 STLDeleteElements(&garbage_collectors_); 698 // If we don't reset then the mark stack complains in its destructor. 699 allocation_stack_->Reset(); 700 live_stack_->Reset(); 701 STLDeleteValues(&mod_union_tables_); 702 STLDeleteElements(&continuous_spaces_); 703 STLDeleteElements(&discontinuous_spaces_); 704 delete gc_complete_lock_; 705 VLOG(heap) << "Finished ~Heap()"; 706} 707 708space::ContinuousSpace* Heap::FindContinuousSpaceFromObject(const mirror::Object* obj, 709 bool fail_ok) const { 710 for (const auto& space : continuous_spaces_) { 711 if (space->Contains(obj)) { 712 return space; 713 } 714 } 715 if (!fail_ok) { 716 LOG(FATAL) << "object " << reinterpret_cast<const void*>(obj) << " not inside any spaces!"; 717 } 718 return NULL; 719} 720 721space::DiscontinuousSpace* Heap::FindDiscontinuousSpaceFromObject(const mirror::Object* obj, 722 bool fail_ok) const { 723 for (const auto& space : discontinuous_spaces_) { 724 if (space->Contains(obj)) { 725 return space; 726 } 727 } 728 if (!fail_ok) { 729 LOG(FATAL) << "object " << reinterpret_cast<const void*>(obj) << " not inside any spaces!"; 730 } 731 return NULL; 732} 733 734space::Space* Heap::FindSpaceFromObject(const mirror::Object* obj, bool fail_ok) const { 735 space::Space* result = FindContinuousSpaceFromObject(obj, true); 736 if (result != NULL) { 737 return result; 738 } 739 return FindDiscontinuousSpaceFromObject(obj, true); 740} 741 742struct SoftReferenceArgs { 743 IsMarkedCallback* is_marked_callback_; 744 MarkObjectCallback* mark_callback_; 745 void* arg_; 746}; 747 748mirror::Object* Heap::PreserveSoftReferenceCallback(mirror::Object* obj, void* arg) { 749 SoftReferenceArgs* args = reinterpret_cast<SoftReferenceArgs*>(arg); 750 // TODO: Not preserve all soft references. 751 return args->mark_callback_(obj, args->arg_); 752} 753 754void Heap::ProcessSoftReferences(TimingLogger& timings, bool clear_soft, 755 IsMarkedCallback* is_marked_callback, 756 MarkObjectCallback* mark_object_callback, 757 ProcessMarkStackCallback* process_mark_stack_callback, void* arg) { 758 // Unless required to clear soft references with white references, preserve some white referents. 759 if (!clear_soft) { 760 // Don't clear for sticky GC. 761 SoftReferenceArgs soft_reference_args; 762 soft_reference_args.is_marked_callback_ = is_marked_callback; 763 soft_reference_args.mark_callback_ = mark_object_callback; 764 soft_reference_args.arg_ = arg; 765 // References with a marked referent are removed from the list. 766 soft_reference_queue_.PreserveSomeSoftReferences(&PreserveSoftReferenceCallback, 767 &soft_reference_args); 768 process_mark_stack_callback(arg); 769 } 770} 771 772// Process reference class instances and schedule finalizations. 773void Heap::ProcessReferences(TimingLogger& timings, bool clear_soft, 774 IsMarkedCallback* is_marked_callback, 775 MarkObjectCallback* mark_object_callback, 776 ProcessMarkStackCallback* process_mark_stack_callback, void* arg) { 777 ProcessSoftReferences(timings, clear_soft, is_marked_callback, mark_object_callback, 778 process_mark_stack_callback, arg); 779 timings.StartSplit("(Paused)ProcessReferences"); 780 // Clear all remaining soft and weak references with white referents. 781 soft_reference_queue_.ClearWhiteReferences(cleared_references_, is_marked_callback, arg); 782 weak_reference_queue_.ClearWhiteReferences(cleared_references_, is_marked_callback, arg); 783 timings.EndSplit(); 784 // Preserve all white objects with finalize methods and schedule them for finalization. 785 timings.StartSplit("(Paused)EnqueueFinalizerReferences"); 786 finalizer_reference_queue_.EnqueueFinalizerReferences(cleared_references_, is_marked_callback, 787 mark_object_callback, arg); 788 process_mark_stack_callback(arg); 789 timings.EndSplit(); 790 timings.StartSplit("(Paused)ProcessReferences"); 791 // Clear all f-reachable soft and weak references with white referents. 792 soft_reference_queue_.ClearWhiteReferences(cleared_references_, is_marked_callback, arg); 793 weak_reference_queue_.ClearWhiteReferences(cleared_references_, is_marked_callback, arg); 794 // Clear all phantom references with white referents. 795 phantom_reference_queue_.ClearWhiteReferences(cleared_references_, is_marked_callback, arg); 796 // At this point all reference queues other than the cleared references should be empty. 797 DCHECK(soft_reference_queue_.IsEmpty()); 798 DCHECK(weak_reference_queue_.IsEmpty()); 799 DCHECK(finalizer_reference_queue_.IsEmpty()); 800 DCHECK(phantom_reference_queue_.IsEmpty()); 801 timings.EndSplit(); 802} 803 804// Process the "referent" field in a java.lang.ref.Reference. If the referent has not yet been 805// marked, put it on the appropriate list in the heap for later processing. 806void Heap::DelayReferenceReferent(mirror::Class* klass, mirror::Reference* ref, 807 IsMarkedCallback is_marked_callback, void* arg) { 808 DCHECK_EQ(klass, ref->GetClass()); 809 mirror::Object* referent = ref->GetReferent(); 810 if (referent != nullptr) { 811 mirror::Object* forward_address = is_marked_callback(referent, arg); 812 // Null means that the object is not currently marked. 813 if (forward_address == nullptr) { 814 Thread* self = Thread::Current(); 815 // TODO: Remove these locks, and use atomic stacks for storing references? 816 // We need to check that the references haven't already been enqueued since we can end up 817 // scanning the same reference multiple times due to dirty cards. 818 if (klass->IsSoftReferenceClass()) { 819 soft_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); 820 } else if (klass->IsWeakReferenceClass()) { 821 weak_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); 822 } else if (klass->IsFinalizerReferenceClass()) { 823 finalizer_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); 824 } else if (klass->IsPhantomReferenceClass()) { 825 phantom_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); 826 } else { 827 LOG(FATAL) << "Invalid reference type " << PrettyClass(klass) << " " << std::hex 828 << klass->GetAccessFlags(); 829 } 830 } else if (referent != forward_address) { 831 // Referent is already marked and we need to update it. 832 ref->SetReferent<false>(forward_address); 833 } 834 } 835} 836 837space::ImageSpace* Heap::GetImageSpace() const { 838 for (const auto& space : continuous_spaces_) { 839 if (space->IsImageSpace()) { 840 return space->AsImageSpace(); 841 } 842 } 843 return NULL; 844} 845 846static void MSpaceChunkCallback(void* start, void* end, size_t used_bytes, void* arg) { 847 size_t chunk_size = reinterpret_cast<uint8_t*>(end) - reinterpret_cast<uint8_t*>(start); 848 if (used_bytes < chunk_size) { 849 size_t chunk_free_bytes = chunk_size - used_bytes; 850 size_t& max_contiguous_allocation = *reinterpret_cast<size_t*>(arg); 851 max_contiguous_allocation = std::max(max_contiguous_allocation, chunk_free_bytes); 852 } 853} 854 855void Heap::ThrowOutOfMemoryError(Thread* self, size_t byte_count, bool large_object_allocation) { 856 std::ostringstream oss; 857 size_t total_bytes_free = GetFreeMemory(); 858 oss << "Failed to allocate a " << byte_count << " byte allocation with " << total_bytes_free 859 << " free bytes"; 860 // If the allocation failed due to fragmentation, print out the largest continuous allocation. 861 if (!large_object_allocation && total_bytes_free >= byte_count) { 862 size_t max_contiguous_allocation = 0; 863 for (const auto& space : continuous_spaces_) { 864 if (space->IsMallocSpace()) { 865 // To allow the Walk/InspectAll() to exclusively-lock the mutator 866 // lock, temporarily release the shared access to the mutator 867 // lock here by transitioning to the suspended state. 868 Locks::mutator_lock_->AssertSharedHeld(self); 869 self->TransitionFromRunnableToSuspended(kSuspended); 870 space->AsMallocSpace()->Walk(MSpaceChunkCallback, &max_contiguous_allocation); 871 self->TransitionFromSuspendedToRunnable(); 872 Locks::mutator_lock_->AssertSharedHeld(self); 873 } 874 } 875 oss << "; failed due to fragmentation (largest possible contiguous allocation " 876 << max_contiguous_allocation << " bytes)"; 877 } 878 self->ThrowOutOfMemoryError(oss.str().c_str()); 879} 880 881void Heap::DoPendingTransitionOrTrim() { 882 Thread* self = Thread::Current(); 883 CollectorType desired_collector_type; 884 // Wait until we reach the desired transition time. 885 while (true) { 886 uint64_t wait_time; 887 { 888 MutexLock mu(self, *heap_trim_request_lock_); 889 desired_collector_type = desired_collector_type_; 890 uint64_t current_time = NanoTime(); 891 if (current_time >= heap_transition_target_time_) { 892 break; 893 } 894 wait_time = heap_transition_target_time_ - current_time; 895 } 896 ScopedThreadStateChange tsc(self, kSleeping); 897 usleep(wait_time / 1000); // Usleep takes microseconds. 898 } 899 // Transition the collector if the desired collector type is not the same as the current 900 // collector type. 901 TransitionCollector(desired_collector_type); 902 // Do a heap trim if it is needed. 903 Trim(); 904} 905 906void Heap::Trim() { 907 Thread* self = Thread::Current(); 908 { 909 MutexLock mu(self, *heap_trim_request_lock_); 910 if (!heap_trim_request_pending_ || last_trim_time_ + kHeapTrimWait >= NanoTime()) { 911 return; 912 } 913 last_trim_time_ = NanoTime(); 914 heap_trim_request_pending_ = false; 915 } 916 { 917 // Need to do this before acquiring the locks since we don't want to get suspended while 918 // holding any locks. 919 ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); 920 // Pretend we are doing a GC to prevent background compaction from deleting the space we are 921 // trimming. 922 MutexLock mu(self, *gc_complete_lock_); 923 // Ensure there is only one GC at a time. 924 WaitForGcToCompleteLocked(self); 925 collector_type_running_ = kCollectorTypeHeapTrim; 926 } 927 uint64_t start_ns = NanoTime(); 928 // Trim the managed spaces. 929 uint64_t total_alloc_space_allocated = 0; 930 uint64_t total_alloc_space_size = 0; 931 uint64_t managed_reclaimed = 0; 932 for (const auto& space : continuous_spaces_) { 933 if (space->IsMallocSpace()) { 934 gc::space::MallocSpace* alloc_space = space->AsMallocSpace(); 935 total_alloc_space_size += alloc_space->Size(); 936 managed_reclaimed += alloc_space->Trim(); 937 } 938 } 939 total_alloc_space_allocated = GetBytesAllocated() - large_object_space_->GetBytesAllocated() - 940 bump_pointer_space_->Size(); 941 const float managed_utilization = static_cast<float>(total_alloc_space_allocated) / 942 static_cast<float>(total_alloc_space_size); 943 uint64_t gc_heap_end_ns = NanoTime(); 944 // We never move things in the native heap, so we can finish the GC at this point. 945 FinishGC(self, collector::kGcTypeNone); 946 // Trim the native heap. 947 dlmalloc_trim(0); 948 size_t native_reclaimed = 0; 949 dlmalloc_inspect_all(DlmallocMadviseCallback, &native_reclaimed); 950 uint64_t end_ns = NanoTime(); 951 VLOG(heap) << "Heap trim of managed (duration=" << PrettyDuration(gc_heap_end_ns - start_ns) 952 << ", advised=" << PrettySize(managed_reclaimed) << ") and native (duration=" 953 << PrettyDuration(end_ns - gc_heap_end_ns) << ", advised=" << PrettySize(native_reclaimed) 954 << ") heaps. Managed heap utilization of " << static_cast<int>(100 * managed_utilization) 955 << "%."; 956} 957 958bool Heap::IsValidObjectAddress(const mirror::Object* obj) const { 959 // Note: we deliberately don't take the lock here, and mustn't test anything that would require 960 // taking the lock. 961 if (obj == nullptr) { 962 return true; 963 } 964 return IsAligned<kObjectAlignment>(obj) && FindSpaceFromObject(obj, true) != nullptr; 965} 966 967bool Heap::IsNonDiscontinuousSpaceHeapAddress(const mirror::Object* obj) const { 968 return FindContinuousSpaceFromObject(obj, true) != nullptr; 969} 970 971bool Heap::IsValidContinuousSpaceObjectAddress(const mirror::Object* obj) const { 972 if (obj == nullptr || !IsAligned<kObjectAlignment>(obj)) { 973 return false; 974 } 975 for (const auto& space : continuous_spaces_) { 976 if (space->HasAddress(obj)) { 977 return true; 978 } 979 } 980 return false; 981} 982 983bool Heap::IsLiveObjectLocked(mirror::Object* obj, bool search_allocation_stack, 984 bool search_live_stack, bool sorted) { 985 if (UNLIKELY(!IsAligned<kObjectAlignment>(obj))) { 986 return false; 987 } 988 if (bump_pointer_space_ != nullptr && bump_pointer_space_->HasAddress(obj)) { 989 mirror::Class* klass = obj->GetClass<kVerifyNone>(); 990 if (obj == klass) { 991 // This case happens for java.lang.Class. 992 return true; 993 } 994 return VerifyClassClass(klass) && IsLiveObjectLocked(klass); 995 } else if (temp_space_ != nullptr && temp_space_->HasAddress(obj)) { 996 // If we are in the allocated region of the temp space, then we are probably live (e.g. during 997 // a GC). When a GC isn't running End() - Begin() is 0 which means no objects are contained. 998 return temp_space_->Contains(obj); 999 } 1000 space::ContinuousSpace* c_space = FindContinuousSpaceFromObject(obj, true); 1001 space::DiscontinuousSpace* d_space = NULL; 1002 if (c_space != nullptr) { 1003 if (c_space->GetLiveBitmap()->Test(obj)) { 1004 return true; 1005 } 1006 } else { 1007 d_space = FindDiscontinuousSpaceFromObject(obj, true); 1008 if (d_space != nullptr) { 1009 if (d_space->GetLiveObjects()->Test(obj)) { 1010 return true; 1011 } 1012 } 1013 } 1014 // This is covering the allocation/live stack swapping that is done without mutators suspended. 1015 for (size_t i = 0; i < (sorted ? 1 : 5); ++i) { 1016 if (i > 0) { 1017 NanoSleep(MsToNs(10)); 1018 } 1019 if (search_allocation_stack) { 1020 if (sorted) { 1021 if (allocation_stack_->ContainsSorted(const_cast<mirror::Object*>(obj))) { 1022 return true; 1023 } 1024 } else if (allocation_stack_->Contains(const_cast<mirror::Object*>(obj))) { 1025 return true; 1026 } 1027 } 1028 1029 if (search_live_stack) { 1030 if (sorted) { 1031 if (live_stack_->ContainsSorted(const_cast<mirror::Object*>(obj))) { 1032 return true; 1033 } 1034 } else if (live_stack_->Contains(const_cast<mirror::Object*>(obj))) { 1035 return true; 1036 } 1037 } 1038 } 1039 // We need to check the bitmaps again since there is a race where we mark something as live and 1040 // then clear the stack containing it. 1041 if (c_space != nullptr) { 1042 if (c_space->GetLiveBitmap()->Test(obj)) { 1043 return true; 1044 } 1045 } else { 1046 d_space = FindDiscontinuousSpaceFromObject(obj, true); 1047 if (d_space != nullptr && d_space->GetLiveObjects()->Test(obj)) { 1048 return true; 1049 } 1050 } 1051 return false; 1052} 1053 1054void Heap::DumpSpaces(std::ostream& stream) { 1055 for (const auto& space : continuous_spaces_) { 1056 accounting::SpaceBitmap* live_bitmap = space->GetLiveBitmap(); 1057 accounting::SpaceBitmap* mark_bitmap = space->GetMarkBitmap(); 1058 stream << space << " " << *space << "\n"; 1059 if (live_bitmap != nullptr) { 1060 stream << live_bitmap << " " << *live_bitmap << "\n"; 1061 } 1062 if (mark_bitmap != nullptr) { 1063 stream << mark_bitmap << " " << *mark_bitmap << "\n"; 1064 } 1065 } 1066 for (const auto& space : discontinuous_spaces_) { 1067 stream << space << " " << *space << "\n"; 1068 } 1069} 1070 1071void Heap::VerifyObjectBody(mirror::Object* obj) { 1072 if (this == nullptr && verify_object_mode_ == kVerifyObjectModeDisabled) { 1073 return; 1074 } 1075 // Ignore early dawn of the universe verifications. 1076 if (UNLIKELY(static_cast<size_t>(num_bytes_allocated_.Load()) < 10 * KB)) { 1077 return; 1078 } 1079 CHECK(IsAligned<kObjectAlignment>(obj)) << "Object isn't aligned: " << obj; 1080 mirror::Class* c = obj->GetFieldObject<mirror::Class, kVerifyNone>( 1081 mirror::Object::ClassOffset(), false); 1082 CHECK(c != nullptr) << "Null class in object " << obj; 1083 CHECK(IsAligned<kObjectAlignment>(c)) << "Class " << c << " not aligned in object " << obj; 1084 CHECK(VerifyClassClass(c)); 1085 1086 if (verify_object_mode_ > kVerifyObjectModeFast) { 1087 // Note: the bitmap tests below are racy since we don't hold the heap bitmap lock. 1088 if (!IsLiveObjectLocked(obj)) { 1089 DumpSpaces(); 1090 LOG(FATAL) << "Object is dead: " << obj; 1091 } 1092 } 1093} 1094 1095void Heap::VerificationCallback(mirror::Object* obj, void* arg) { 1096 reinterpret_cast<Heap*>(arg)->VerifyObjectBody(obj); 1097} 1098 1099void Heap::VerifyHeap() { 1100 ReaderMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); 1101 GetLiveBitmap()->Walk(Heap::VerificationCallback, this); 1102} 1103 1104void Heap::RecordFree(ssize_t freed_objects, ssize_t freed_bytes) { 1105 // Use signed comparison since freed bytes can be negative when background compaction foreground 1106 // transitions occurs. This is caused by the moving objects from a bump pointer space to a 1107 // free list backed space typically increasing memory footprint due to padding and binning. 1108 DCHECK_LE(freed_bytes, static_cast<ssize_t>(num_bytes_allocated_.Load())); 1109 DCHECK_GE(freed_objects, 0); 1110 num_bytes_allocated_.FetchAndSub(freed_bytes); 1111 if (Runtime::Current()->HasStatsEnabled()) { 1112 RuntimeStats* thread_stats = Thread::Current()->GetStats(); 1113 thread_stats->freed_objects += freed_objects; 1114 thread_stats->freed_bytes += freed_bytes; 1115 // TODO: Do this concurrently. 1116 RuntimeStats* global_stats = Runtime::Current()->GetStats(); 1117 global_stats->freed_objects += freed_objects; 1118 global_stats->freed_bytes += freed_bytes; 1119 } 1120} 1121 1122mirror::Object* Heap::AllocateInternalWithGc(Thread* self, AllocatorType allocator, 1123 size_t alloc_size, size_t* bytes_allocated, 1124 size_t* usable_size, 1125 mirror::Class** klass) { 1126 mirror::Object* ptr = nullptr; 1127 bool was_default_allocator = allocator == GetCurrentAllocator(); 1128 DCHECK(klass != nullptr); 1129 SirtRef<mirror::Class> sirt_klass(self, *klass); 1130 // The allocation failed. If the GC is running, block until it completes, and then retry the 1131 // allocation. 1132 collector::GcType last_gc = WaitForGcToComplete(self); 1133 if (last_gc != collector::kGcTypeNone) { 1134 // If we were the default allocator but the allocator changed while we were suspended, 1135 // abort the allocation. 1136 if (was_default_allocator && allocator != GetCurrentAllocator()) { 1137 *klass = sirt_klass.get(); 1138 return nullptr; 1139 } 1140 // A GC was in progress and we blocked, retry allocation now that memory has been freed. 1141 ptr = TryToAllocate<true, false>(self, allocator, alloc_size, bytes_allocated, usable_size); 1142 } 1143 1144 // Loop through our different Gc types and try to Gc until we get enough free memory. 1145 for (collector::GcType gc_type : gc_plan_) { 1146 if (ptr != nullptr) { 1147 break; 1148 } 1149 // Attempt to run the collector, if we succeed, re-try the allocation. 1150 bool gc_ran = 1151 CollectGarbageInternal(gc_type, kGcCauseForAlloc, false) != collector::kGcTypeNone; 1152 if (was_default_allocator && allocator != GetCurrentAllocator()) { 1153 *klass = sirt_klass.get(); 1154 return nullptr; 1155 } 1156 if (gc_ran) { 1157 // Did we free sufficient memory for the allocation to succeed? 1158 ptr = TryToAllocate<true, false>(self, allocator, alloc_size, bytes_allocated, usable_size); 1159 } 1160 } 1161 // Allocations have failed after GCs; this is an exceptional state. 1162 if (ptr == nullptr) { 1163 // Try harder, growing the heap if necessary. 1164 ptr = TryToAllocate<true, true>(self, allocator, alloc_size, bytes_allocated, usable_size); 1165 } 1166 if (ptr == nullptr) { 1167 // Most allocations should have succeeded by now, so the heap is really full, really fragmented, 1168 // or the requested size is really big. Do another GC, collecting SoftReferences this time. The 1169 // VM spec requires that all SoftReferences have been collected and cleared before throwing 1170 // OOME. 1171 VLOG(gc) << "Forcing collection of SoftReferences for " << PrettySize(alloc_size) 1172 << " allocation"; 1173 // TODO: Run finalization, but this may cause more allocations to occur. 1174 // We don't need a WaitForGcToComplete here either. 1175 DCHECK(!gc_plan_.empty()); 1176 CollectGarbageInternal(gc_plan_.back(), kGcCauseForAlloc, true); 1177 if (was_default_allocator && allocator != GetCurrentAllocator()) { 1178 *klass = sirt_klass.get(); 1179 return nullptr; 1180 } 1181 ptr = TryToAllocate<true, true>(self, allocator, alloc_size, bytes_allocated, usable_size); 1182 if (ptr == nullptr) { 1183 ThrowOutOfMemoryError(self, alloc_size, false); 1184 } 1185 } 1186 *klass = sirt_klass.get(); 1187 return ptr; 1188} 1189 1190void Heap::SetTargetHeapUtilization(float target) { 1191 DCHECK_GT(target, 0.0f); // asserted in Java code 1192 DCHECK_LT(target, 1.0f); 1193 target_utilization_ = target; 1194} 1195 1196size_t Heap::GetObjectsAllocated() const { 1197 size_t total = 0; 1198 for (space::AllocSpace* space : alloc_spaces_) { 1199 total += space->GetObjectsAllocated(); 1200 } 1201 return total; 1202} 1203 1204size_t Heap::GetObjectsAllocatedEver() const { 1205 return GetObjectsFreedEver() + GetObjectsAllocated(); 1206} 1207 1208size_t Heap::GetBytesAllocatedEver() const { 1209 return GetBytesFreedEver() + GetBytesAllocated(); 1210} 1211 1212class InstanceCounter { 1213 public: 1214 InstanceCounter(const std::vector<mirror::Class*>& classes, bool use_is_assignable_from, uint64_t* counts) 1215 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) 1216 : classes_(classes), use_is_assignable_from_(use_is_assignable_from), counts_(counts) { 1217 } 1218 static void Callback(mirror::Object* obj, void* arg) 1219 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { 1220 InstanceCounter* instance_counter = reinterpret_cast<InstanceCounter*>(arg); 1221 mirror::Class* instance_class = obj->GetClass(); 1222 CHECK(instance_class != nullptr); 1223 for (size_t i = 0; i < instance_counter->classes_.size(); ++i) { 1224 if (instance_counter->use_is_assignable_from_) { 1225 if (instance_counter->classes_[i]->IsAssignableFrom(instance_class)) { 1226 ++instance_counter->counts_[i]; 1227 } 1228 } else if (instance_class == instance_counter->classes_[i]) { 1229 ++instance_counter->counts_[i]; 1230 } 1231 } 1232 } 1233 1234 private: 1235 const std::vector<mirror::Class*>& classes_; 1236 bool use_is_assignable_from_; 1237 uint64_t* const counts_; 1238 DISALLOW_COPY_AND_ASSIGN(InstanceCounter); 1239}; 1240 1241void Heap::CountInstances(const std::vector<mirror::Class*>& classes, bool use_is_assignable_from, 1242 uint64_t* counts) { 1243 // Can't do any GC in this function since this may move classes. 1244 Thread* self = Thread::Current(); 1245 auto* old_cause = self->StartAssertNoThreadSuspension("CountInstances"); 1246 InstanceCounter counter(classes, use_is_assignable_from, counts); 1247 WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); 1248 VisitObjects(InstanceCounter::Callback, &counter); 1249 self->EndAssertNoThreadSuspension(old_cause); 1250} 1251 1252class InstanceCollector { 1253 public: 1254 InstanceCollector(mirror::Class* c, int32_t max_count, std::vector<mirror::Object*>& instances) 1255 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) 1256 : class_(c), max_count_(max_count), instances_(instances) { 1257 } 1258 static void Callback(mirror::Object* obj, void* arg) 1259 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { 1260 DCHECK(arg != nullptr); 1261 InstanceCollector* instance_collector = reinterpret_cast<InstanceCollector*>(arg); 1262 mirror::Class* instance_class = obj->GetClass(); 1263 if (instance_class == instance_collector->class_) { 1264 if (instance_collector->max_count_ == 0 || 1265 instance_collector->instances_.size() < instance_collector->max_count_) { 1266 instance_collector->instances_.push_back(obj); 1267 } 1268 } 1269 } 1270 1271 private: 1272 mirror::Class* class_; 1273 uint32_t max_count_; 1274 std::vector<mirror::Object*>& instances_; 1275 DISALLOW_COPY_AND_ASSIGN(InstanceCollector); 1276}; 1277 1278void Heap::GetInstances(mirror::Class* c, int32_t max_count, 1279 std::vector<mirror::Object*>& instances) { 1280 // Can't do any GC in this function since this may move classes. 1281 Thread* self = Thread::Current(); 1282 auto* old_cause = self->StartAssertNoThreadSuspension("GetInstances"); 1283 InstanceCollector collector(c, max_count, instances); 1284 WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); 1285 VisitObjects(&InstanceCollector::Callback, &collector); 1286 self->EndAssertNoThreadSuspension(old_cause); 1287} 1288 1289class ReferringObjectsFinder { 1290 public: 1291 ReferringObjectsFinder(mirror::Object* object, int32_t max_count, 1292 std::vector<mirror::Object*>& referring_objects) 1293 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) 1294 : object_(object), max_count_(max_count), referring_objects_(referring_objects) { 1295 } 1296 1297 static void Callback(mirror::Object* obj, void* arg) 1298 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { 1299 reinterpret_cast<ReferringObjectsFinder*>(arg)->operator()(obj); 1300 } 1301 1302 // For bitmap Visit. 1303 // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for 1304 // annotalysis on visitors. 1305 void operator()(const mirror::Object* o) const NO_THREAD_SAFETY_ANALYSIS { 1306 collector::MarkSweep::VisitObjectReferences(const_cast<mirror::Object*>(o), *this, true); 1307 } 1308 1309 // For MarkSweep::VisitObjectReferences. 1310 void operator()(mirror::Object* referrer, mirror::Object* object, 1311 const MemberOffset&, bool) const { 1312 if (object == object_ && (max_count_ == 0 || referring_objects_.size() < max_count_)) { 1313 referring_objects_.push_back(referrer); 1314 } 1315 } 1316 1317 private: 1318 mirror::Object* object_; 1319 uint32_t max_count_; 1320 std::vector<mirror::Object*>& referring_objects_; 1321 DISALLOW_COPY_AND_ASSIGN(ReferringObjectsFinder); 1322}; 1323 1324void Heap::GetReferringObjects(mirror::Object* o, int32_t max_count, 1325 std::vector<mirror::Object*>& referring_objects) { 1326 // Can't do any GC in this function since this may move the object o. 1327 Thread* self = Thread::Current(); 1328 auto* old_cause = self->StartAssertNoThreadSuspension("GetReferringObjects"); 1329 ReferringObjectsFinder finder(o, max_count, referring_objects); 1330 WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); 1331 VisitObjects(&ReferringObjectsFinder::Callback, &finder); 1332 self->EndAssertNoThreadSuspension(old_cause); 1333} 1334 1335void Heap::CollectGarbage(bool clear_soft_references) { 1336 // Even if we waited for a GC we still need to do another GC since weaks allocated during the 1337 // last GC will not have necessarily been cleared. 1338 CollectGarbageInternal(gc_plan_.back(), kGcCauseExplicit, clear_soft_references); 1339} 1340 1341void Heap::TransitionCollector(CollectorType collector_type) { 1342 if (collector_type == collector_type_) { 1343 return; 1344 } 1345 VLOG(heap) << "TransitionCollector: " << static_cast<int>(collector_type_) 1346 << " -> " << static_cast<int>(collector_type); 1347 uint64_t start_time = NanoTime(); 1348 uint32_t before_size = GetTotalMemory(); 1349 uint32_t before_allocated = num_bytes_allocated_.Load(); 1350 ThreadList* tl = Runtime::Current()->GetThreadList(); 1351 Thread* self = Thread::Current(); 1352 ScopedThreadStateChange tsc(self, kWaitingPerformingGc); 1353 Locks::mutator_lock_->AssertNotHeld(self); 1354 const bool copying_transition = 1355 IsCompactingGC(background_collector_type_) || IsCompactingGC(post_zygote_collector_type_); 1356 // Busy wait until we can GC (StartGC can fail if we have a non-zero 1357 // compacting_gc_disable_count_, this should rarely occurs). 1358 for (;;) { 1359 { 1360 ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); 1361 MutexLock mu(self, *gc_complete_lock_); 1362 // Ensure there is only one GC at a time. 1363 WaitForGcToCompleteLocked(self); 1364 // GC can be disabled if someone has a used GetPrimitiveArrayCritical but not yet released. 1365 if (!copying_transition || disable_moving_gc_count_ == 0) { 1366 // TODO: Not hard code in semi-space collector? 1367 collector_type_running_ = copying_transition ? kCollectorTypeSS : collector_type; 1368 break; 1369 } 1370 } 1371 usleep(1000); 1372 } 1373 tl->SuspendAll(); 1374 PreGcRosAllocVerification(&semi_space_collector_->GetTimings()); 1375 switch (collector_type) { 1376 case kCollectorTypeSS: 1377 // Fall-through. 1378 case kCollectorTypeGSS: { 1379 mprotect(temp_space_->Begin(), temp_space_->Capacity(), PROT_READ | PROT_WRITE); 1380 CHECK(main_space_ != nullptr); 1381 Compact(temp_space_, main_space_); 1382 DCHECK(allocator_mem_map_.get() == nullptr); 1383 allocator_mem_map_.reset(main_space_->ReleaseMemMap()); 1384 madvise(main_space_->Begin(), main_space_->Size(), MADV_DONTNEED); 1385 // RemoveSpace does not delete the removed space. 1386 space::Space* old_space = main_space_; 1387 RemoveSpace(old_space); 1388 delete old_space; 1389 break; 1390 } 1391 case kCollectorTypeMS: 1392 // Fall through. 1393 case kCollectorTypeCMS: { 1394 if (IsCompactingGC(collector_type_)) { 1395 // TODO: Use mem-map from temp space? 1396 MemMap* mem_map = allocator_mem_map_.release(); 1397 CHECK(mem_map != nullptr); 1398 size_t starting_size = kDefaultStartingSize; 1399 size_t initial_size = kDefaultInitialSize; 1400 mprotect(mem_map->Begin(), initial_size, PROT_READ | PROT_WRITE); 1401 CHECK(main_space_ == nullptr); 1402 if (kUseRosAlloc) { 1403 main_space_ = 1404 space::RosAllocSpace::CreateFromMemMap(mem_map, "alloc space", starting_size, 1405 initial_size, mem_map->Size(), 1406 mem_map->Size(), low_memory_mode_); 1407 } else { 1408 main_space_ = 1409 space::DlMallocSpace::CreateFromMemMap(mem_map, "alloc space", starting_size, 1410 initial_size, mem_map->Size(), 1411 mem_map->Size()); 1412 } 1413 main_space_->SetFootprintLimit(main_space_->Capacity()); 1414 AddSpace(main_space_); 1415 Compact(main_space_, bump_pointer_space_); 1416 } 1417 break; 1418 } 1419 default: { 1420 LOG(FATAL) << "Attempted to transition to invalid collector type"; 1421 break; 1422 } 1423 } 1424 ChangeCollector(collector_type); 1425 PostGcRosAllocVerification(&semi_space_collector_->GetTimings()); 1426 tl->ResumeAll(); 1427 // Can't call into java code with all threads suspended. 1428 EnqueueClearedReferences(); 1429 uint64_t duration = NanoTime() - start_time; 1430 GrowForUtilization(collector::kGcTypeFull, duration); 1431 FinishGC(self, collector::kGcTypeFull); 1432 int32_t after_size = GetTotalMemory(); 1433 int32_t delta_size = before_size - after_size; 1434 int32_t after_allocated = num_bytes_allocated_.Load(); 1435 int32_t delta_allocated = before_allocated - after_allocated; 1436 const std::string saved_bytes_str = 1437 delta_size < 0 ? "-" + PrettySize(-delta_size) : PrettySize(delta_size); 1438 LOG(INFO) << "Heap transition to " << process_state_ << " took " 1439 << PrettyDuration(duration) << " " << PrettySize(before_size) << "->" 1440 << PrettySize(after_size) << " from " << PrettySize(delta_allocated) << " to " 1441 << PrettySize(delta_size) << " saved"; 1442} 1443 1444void Heap::ChangeCollector(CollectorType collector_type) { 1445 // TODO: Only do this with all mutators suspended to avoid races. 1446 if (collector_type != collector_type_) { 1447 collector_type_ = collector_type; 1448 gc_plan_.clear(); 1449 switch (collector_type_) { 1450 case kCollectorTypeSS: 1451 // Fall-through. 1452 case kCollectorTypeGSS: { 1453 concurrent_gc_ = false; 1454 gc_plan_.push_back(collector::kGcTypeFull); 1455 if (use_tlab_) { 1456 ChangeAllocator(kAllocatorTypeTLAB); 1457 } else { 1458 ChangeAllocator(kAllocatorTypeBumpPointer); 1459 } 1460 break; 1461 } 1462 case kCollectorTypeMS: { 1463 concurrent_gc_ = false; 1464 gc_plan_.push_back(collector::kGcTypeSticky); 1465 gc_plan_.push_back(collector::kGcTypePartial); 1466 gc_plan_.push_back(collector::kGcTypeFull); 1467 ChangeAllocator(kUseRosAlloc ? kAllocatorTypeRosAlloc : kAllocatorTypeDlMalloc); 1468 break; 1469 } 1470 case kCollectorTypeCMS: { 1471 concurrent_gc_ = true; 1472 gc_plan_.push_back(collector::kGcTypeSticky); 1473 gc_plan_.push_back(collector::kGcTypePartial); 1474 gc_plan_.push_back(collector::kGcTypeFull); 1475 ChangeAllocator(kUseRosAlloc ? kAllocatorTypeRosAlloc : kAllocatorTypeDlMalloc); 1476 break; 1477 } 1478 default: { 1479 LOG(FATAL) << "Unimplemented"; 1480 } 1481 } 1482 if (concurrent_gc_) { 1483 concurrent_start_bytes_ = 1484 std::max(max_allowed_footprint_, kMinConcurrentRemainingBytes) - kMinConcurrentRemainingBytes; 1485 } else { 1486 concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); 1487 } 1488 } 1489} 1490 1491// Special compacting collector which uses sub-optimal bin packing to reduce zygote space size. 1492class ZygoteCompactingCollector FINAL : public collector::SemiSpace { 1493 public: 1494 explicit ZygoteCompactingCollector(gc::Heap* heap) : SemiSpace(heap, false, "zygote collector"), 1495 bin_live_bitmap_(nullptr), bin_mark_bitmap_(nullptr) { 1496 } 1497 1498 void BuildBins(space::ContinuousSpace* space) { 1499 bin_live_bitmap_ = space->GetLiveBitmap(); 1500 bin_mark_bitmap_ = space->GetMarkBitmap(); 1501 BinContext context; 1502 context.prev_ = reinterpret_cast<uintptr_t>(space->Begin()); 1503 context.collector_ = this; 1504 WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); 1505 // Note: This requires traversing the space in increasing order of object addresses. 1506 bin_live_bitmap_->Walk(Callback, reinterpret_cast<void*>(&context)); 1507 // Add the last bin which spans after the last object to the end of the space. 1508 AddBin(reinterpret_cast<uintptr_t>(space->End()) - context.prev_, context.prev_); 1509 } 1510 1511 private: 1512 struct BinContext { 1513 uintptr_t prev_; // The end of the previous object. 1514 ZygoteCompactingCollector* collector_; 1515 }; 1516 // Maps from bin sizes to locations. 1517 std::multimap<size_t, uintptr_t> bins_; 1518 // Live bitmap of the space which contains the bins. 1519 accounting::SpaceBitmap* bin_live_bitmap_; 1520 // Mark bitmap of the space which contains the bins. 1521 accounting::SpaceBitmap* bin_mark_bitmap_; 1522 1523 static void Callback(mirror::Object* obj, void* arg) 1524 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { 1525 DCHECK(arg != nullptr); 1526 BinContext* context = reinterpret_cast<BinContext*>(arg); 1527 ZygoteCompactingCollector* collector = context->collector_; 1528 uintptr_t object_addr = reinterpret_cast<uintptr_t>(obj); 1529 size_t bin_size = object_addr - context->prev_; 1530 // Add the bin consisting of the end of the previous object to the start of the current object. 1531 collector->AddBin(bin_size, context->prev_); 1532 context->prev_ = object_addr + RoundUp(obj->SizeOf(), kObjectAlignment); 1533 } 1534 1535 void AddBin(size_t size, uintptr_t position) { 1536 if (size != 0) { 1537 bins_.insert(std::make_pair(size, position)); 1538 } 1539 } 1540 1541 virtual bool ShouldSweepSpace(space::ContinuousSpace* space) const { 1542 // Don't sweep any spaces since we probably blasted the internal accounting of the free list 1543 // allocator. 1544 return false; 1545 } 1546 1547 virtual mirror::Object* MarkNonForwardedObject(mirror::Object* obj) 1548 EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_) { 1549 size_t object_size = RoundUp(obj->SizeOf(), kObjectAlignment); 1550 mirror::Object* forward_address; 1551 // Find the smallest bin which we can move obj in. 1552 auto it = bins_.lower_bound(object_size); 1553 if (it == bins_.end()) { 1554 // No available space in the bins, place it in the target space instead (grows the zygote 1555 // space). 1556 size_t bytes_allocated; 1557 forward_address = to_space_->Alloc(self_, object_size, &bytes_allocated, nullptr); 1558 if (to_space_live_bitmap_ != nullptr) { 1559 to_space_live_bitmap_->Set(forward_address); 1560 } else { 1561 GetHeap()->GetNonMovingSpace()->GetLiveBitmap()->Set(forward_address); 1562 GetHeap()->GetNonMovingSpace()->GetMarkBitmap()->Set(forward_address); 1563 } 1564 } else { 1565 size_t size = it->first; 1566 uintptr_t pos = it->second; 1567 bins_.erase(it); // Erase the old bin which we replace with the new smaller bin. 1568 forward_address = reinterpret_cast<mirror::Object*>(pos); 1569 // Set the live and mark bits so that sweeping system weaks works properly. 1570 bin_live_bitmap_->Set(forward_address); 1571 bin_mark_bitmap_->Set(forward_address); 1572 DCHECK_GE(size, object_size); 1573 AddBin(size - object_size, pos + object_size); // Add a new bin with the remaining space. 1574 } 1575 // Copy the object over to its new location. 1576 memcpy(reinterpret_cast<void*>(forward_address), obj, object_size); 1577 if (kUseBrooksPointer) { 1578 obj->AssertSelfBrooksPointer(); 1579 DCHECK_EQ(forward_address->GetBrooksPointer(), obj); 1580 forward_address->SetBrooksPointer(forward_address); 1581 forward_address->AssertSelfBrooksPointer(); 1582 } 1583 return forward_address; 1584 } 1585}; 1586 1587void Heap::UnBindBitmaps() { 1588 for (const auto& space : GetContinuousSpaces()) { 1589 if (space->IsContinuousMemMapAllocSpace()) { 1590 space::ContinuousMemMapAllocSpace* alloc_space = space->AsContinuousMemMapAllocSpace(); 1591 if (alloc_space->HasBoundBitmaps()) { 1592 alloc_space->UnBindBitmaps(); 1593 } 1594 } 1595 } 1596} 1597 1598void Heap::PreZygoteFork() { 1599 CollectGarbageInternal(collector::kGcTypeFull, kGcCauseBackground, false); 1600 static Mutex zygote_creation_lock_("zygote creation lock", kZygoteCreationLock); 1601 Thread* self = Thread::Current(); 1602 MutexLock mu(self, zygote_creation_lock_); 1603 // Try to see if we have any Zygote spaces. 1604 if (have_zygote_space_) { 1605 return; 1606 } 1607 VLOG(heap) << "Starting PreZygoteFork"; 1608 // Trim the pages at the end of the non moving space. 1609 non_moving_space_->Trim(); 1610 non_moving_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); 1611 // Change the collector to the post zygote one. 1612 ChangeCollector(post_zygote_collector_type_); 1613 // TODO: Delete bump_pointer_space_ and temp_pointer_space_? 1614 if (semi_space_collector_ != nullptr) { 1615 // Temporarily disable rosalloc verification because the zygote 1616 // compaction will mess up the rosalloc internal metadata. 1617 ScopedDisableRosAllocVerification disable_rosalloc_verif(this); 1618 ZygoteCompactingCollector zygote_collector(this); 1619 zygote_collector.BuildBins(non_moving_space_); 1620 // Create a new bump pointer space which we will compact into. 1621 space::BumpPointerSpace target_space("zygote bump space", non_moving_space_->End(), 1622 non_moving_space_->Limit()); 1623 // Compact the bump pointer space to a new zygote bump pointer space. 1624 temp_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); 1625 zygote_collector.SetFromSpace(bump_pointer_space_); 1626 zygote_collector.SetToSpace(&target_space); 1627 zygote_collector.Run(kGcCauseCollectorTransition, false); 1628 CHECK(temp_space_->IsEmpty()); 1629 total_objects_freed_ever_ += semi_space_collector_->GetFreedObjects(); 1630 total_bytes_freed_ever_ += semi_space_collector_->GetFreedBytes(); 1631 // Update the end and write out image. 1632 non_moving_space_->SetEnd(target_space.End()); 1633 non_moving_space_->SetLimit(target_space.Limit()); 1634 VLOG(heap) << "Zygote size " << non_moving_space_->Size() << " bytes"; 1635 } 1636 // Save the old space so that we can remove it after we complete creating the zygote space. 1637 space::MallocSpace* old_alloc_space = non_moving_space_; 1638 // Turn the current alloc space into a zygote space and obtain the new alloc space composed of 1639 // the remaining available space. 1640 // Remove the old space before creating the zygote space since creating the zygote space sets 1641 // the old alloc space's bitmaps to nullptr. 1642 RemoveSpace(old_alloc_space); 1643 if (collector::SemiSpace::kUseRememberedSet) { 1644 // Sanity bound check. 1645 FindRememberedSetFromSpace(old_alloc_space)->AssertAllDirtyCardsAreWithinSpace(); 1646 // Remove the remembered set for the now zygote space (the old 1647 // non-moving space). Note now that we have compacted objects into 1648 // the zygote space, the data in the remembered set is no longer 1649 // needed. The zygote space will instead have a mod-union table 1650 // from this point on. 1651 RemoveRememberedSet(old_alloc_space); 1652 } 1653 space::ZygoteSpace* zygote_space = old_alloc_space->CreateZygoteSpace("alloc space", 1654 low_memory_mode_, 1655 &main_space_); 1656 delete old_alloc_space; 1657 CHECK(zygote_space != nullptr) << "Failed creating zygote space"; 1658 AddSpace(zygote_space, false); 1659 CHECK(main_space_ != nullptr); 1660 if (main_space_->IsRosAllocSpace()) { 1661 rosalloc_space_ = main_space_->AsRosAllocSpace(); 1662 } else if (main_space_->IsDlMallocSpace()) { 1663 dlmalloc_space_ = main_space_->AsDlMallocSpace(); 1664 } 1665 main_space_->SetFootprintLimit(main_space_->Capacity()); 1666 AddSpace(main_space_); 1667 have_zygote_space_ = true; 1668 // Enable large object space allocations. 1669 large_object_threshold_ = kDefaultLargeObjectThreshold; 1670 // Create the zygote space mod union table. 1671 accounting::ModUnionTable* mod_union_table = 1672 new accounting::ModUnionTableCardCache("zygote space mod-union table", this, zygote_space); 1673 CHECK(mod_union_table != nullptr) << "Failed to create zygote space mod-union table"; 1674 AddModUnionTable(mod_union_table); 1675 if (collector::SemiSpace::kUseRememberedSet) { 1676 // Add a new remembered set for the new main space. 1677 accounting::RememberedSet* main_space_rem_set = 1678 new accounting::RememberedSet("Main space remembered set", this, main_space_); 1679 CHECK(main_space_rem_set != nullptr) << "Failed to create main space remembered set"; 1680 AddRememberedSet(main_space_rem_set); 1681 } 1682 // Can't use RosAlloc for non moving space due to thread local buffers. 1683 // TODO: Non limited space for non-movable objects? 1684 MemMap* mem_map = post_zygote_non_moving_space_mem_map_.release(); 1685 space::MallocSpace* new_non_moving_space = 1686 space::DlMallocSpace::CreateFromMemMap(mem_map, "Non moving dlmalloc space", kPageSize, 1687 2 * MB, mem_map->Size(), mem_map->Size()); 1688 AddSpace(new_non_moving_space, false); 1689 CHECK(new_non_moving_space != nullptr) << "Failed to create new non-moving space"; 1690 new_non_moving_space->SetFootprintLimit(new_non_moving_space->Capacity()); 1691 non_moving_space_ = new_non_moving_space; 1692 if (collector::SemiSpace::kUseRememberedSet) { 1693 // Add a new remembered set for the post-zygote non-moving space. 1694 accounting::RememberedSet* post_zygote_non_moving_space_rem_set = 1695 new accounting::RememberedSet("Post-zygote non-moving space remembered set", this, 1696 non_moving_space_); 1697 CHECK(post_zygote_non_moving_space_rem_set != nullptr) 1698 << "Failed to create post-zygote non-moving space remembered set"; 1699 AddRememberedSet(post_zygote_non_moving_space_rem_set); 1700 } 1701} 1702 1703void Heap::FlushAllocStack() { 1704 MarkAllocStackAsLive(allocation_stack_.get()); 1705 allocation_stack_->Reset(); 1706} 1707 1708void Heap::MarkAllocStack(accounting::SpaceBitmap* bitmap1, 1709 accounting::SpaceBitmap* bitmap2, 1710 accounting::ObjectSet* large_objects, 1711 accounting::ObjectStack* stack) { 1712 DCHECK(bitmap1 != nullptr); 1713 DCHECK(bitmap2 != nullptr); 1714 mirror::Object** limit = stack->End(); 1715 for (mirror::Object** it = stack->Begin(); it != limit; ++it) { 1716 const mirror::Object* obj = *it; 1717 if (!kUseThreadLocalAllocationStack || obj != nullptr) { 1718 if (bitmap1->HasAddress(obj)) { 1719 bitmap1->Set(obj); 1720 } else if (bitmap2->HasAddress(obj)) { 1721 bitmap2->Set(obj); 1722 } else { 1723 large_objects->Set(obj); 1724 } 1725 } 1726 } 1727} 1728 1729void Heap::SwapSemiSpaces() { 1730 // Swap the spaces so we allocate into the space which we just evacuated. 1731 std::swap(bump_pointer_space_, temp_space_); 1732 bump_pointer_space_->Clear(); 1733} 1734 1735void Heap::Compact(space::ContinuousMemMapAllocSpace* target_space, 1736 space::ContinuousMemMapAllocSpace* source_space) { 1737 CHECK(kMovingCollector); 1738 CHECK_NE(target_space, source_space) << "In-place compaction currently unsupported"; 1739 if (target_space != source_space) { 1740 semi_space_collector_->SetFromSpace(source_space); 1741 semi_space_collector_->SetToSpace(target_space); 1742 semi_space_collector_->Run(kGcCauseCollectorTransition, false); 1743 } 1744} 1745 1746collector::GcType Heap::CollectGarbageInternal(collector::GcType gc_type, GcCause gc_cause, 1747 bool clear_soft_references) { 1748 Thread* self = Thread::Current(); 1749 Runtime* runtime = Runtime::Current(); 1750 // If the heap can't run the GC, silently fail and return that no GC was run. 1751 switch (gc_type) { 1752 case collector::kGcTypePartial: { 1753 if (!have_zygote_space_) { 1754 return collector::kGcTypeNone; 1755 } 1756 break; 1757 } 1758 default: { 1759 // Other GC types don't have any special cases which makes them not runnable. The main case 1760 // here is full GC. 1761 } 1762 } 1763 ScopedThreadStateChange tsc(self, kWaitingPerformingGc); 1764 Locks::mutator_lock_->AssertNotHeld(self); 1765 if (self->IsHandlingStackOverflow()) { 1766 LOG(WARNING) << "Performing GC on a thread that is handling a stack overflow."; 1767 } 1768 bool compacting_gc; 1769 { 1770 gc_complete_lock_->AssertNotHeld(self); 1771 ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); 1772 MutexLock mu(self, *gc_complete_lock_); 1773 // Ensure there is only one GC at a time. 1774 WaitForGcToCompleteLocked(self); 1775 compacting_gc = IsCompactingGC(collector_type_); 1776 // GC can be disabled if someone has a used GetPrimitiveArrayCritical. 1777 if (compacting_gc && disable_moving_gc_count_ != 0) { 1778 LOG(WARNING) << "Skipping GC due to disable moving GC count " << disable_moving_gc_count_; 1779 return collector::kGcTypeNone; 1780 } 1781 collector_type_running_ = collector_type_; 1782 } 1783 1784 if (gc_cause == kGcCauseForAlloc && runtime->HasStatsEnabled()) { 1785 ++runtime->GetStats()->gc_for_alloc_count; 1786 ++self->GetStats()->gc_for_alloc_count; 1787 } 1788 uint64_t gc_start_time_ns = NanoTime(); 1789 uint64_t gc_start_size = GetBytesAllocated(); 1790 // Approximate allocation rate in bytes / second. 1791 uint64_t ms_delta = NsToMs(gc_start_time_ns - last_gc_time_ns_); 1792 // Back to back GCs can cause 0 ms of wait time in between GC invocations. 1793 if (LIKELY(ms_delta != 0)) { 1794 allocation_rate_ = ((gc_start_size - last_gc_size_) * 1000) / ms_delta; 1795 VLOG(heap) << "Allocation rate: " << PrettySize(allocation_rate_) << "/s"; 1796 } 1797 1798 DCHECK_LT(gc_type, collector::kGcTypeMax); 1799 DCHECK_NE(gc_type, collector::kGcTypeNone); 1800 1801 collector::GarbageCollector* collector = nullptr; 1802 // TODO: Clean this up. 1803 if (compacting_gc) { 1804 DCHECK(current_allocator_ == kAllocatorTypeBumpPointer || 1805 current_allocator_ == kAllocatorTypeTLAB); 1806 gc_type = semi_space_collector_->GetGcType(); 1807 CHECK(temp_space_->IsEmpty()); 1808 semi_space_collector_->SetFromSpace(bump_pointer_space_); 1809 semi_space_collector_->SetToSpace(temp_space_); 1810 temp_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); 1811 collector = semi_space_collector_; 1812 gc_type = collector::kGcTypeFull; 1813 } else if (current_allocator_ == kAllocatorTypeRosAlloc || 1814 current_allocator_ == kAllocatorTypeDlMalloc) { 1815 for (const auto& cur_collector : garbage_collectors_) { 1816 if (cur_collector->IsConcurrent() == concurrent_gc_ && 1817 cur_collector->GetGcType() == gc_type) { 1818 collector = cur_collector; 1819 break; 1820 } 1821 } 1822 } else { 1823 LOG(FATAL) << "Invalid current allocator " << current_allocator_; 1824 } 1825 CHECK(collector != nullptr) 1826 << "Could not find garbage collector with concurrent=" << concurrent_gc_ 1827 << " and type=" << gc_type; 1828 ATRACE_BEGIN(StringPrintf("%s %s GC", PrettyCause(gc_cause), collector->GetName()).c_str()); 1829 if (!clear_soft_references) { 1830 clear_soft_references = gc_type != collector::kGcTypeSticky; // TODO: GSS? 1831 } 1832 collector->Run(gc_cause, clear_soft_references || Runtime::Current()->IsZygote()); 1833 total_objects_freed_ever_ += collector->GetFreedObjects(); 1834 total_bytes_freed_ever_ += collector->GetFreedBytes(); 1835 RequestHeapTrim(); 1836 // Enqueue cleared references. 1837 EnqueueClearedReferences(); 1838 // Grow the heap so that we know when to perform the next GC. 1839 GrowForUtilization(gc_type, collector->GetDurationNs()); 1840 if (CareAboutPauseTimes()) { 1841 const size_t duration = collector->GetDurationNs(); 1842 std::vector<uint64_t> pauses = collector->GetPauseTimes(); 1843 // GC for alloc pauses the allocating thread, so consider it as a pause. 1844 bool was_slow = duration > long_gc_log_threshold_ || 1845 (gc_cause == kGcCauseForAlloc && duration > long_pause_log_threshold_); 1846 if (!was_slow) { 1847 for (uint64_t pause : pauses) { 1848 was_slow = was_slow || pause > long_pause_log_threshold_; 1849 } 1850 } 1851 if (was_slow) { 1852 const size_t percent_free = GetPercentFree(); 1853 const size_t current_heap_size = GetBytesAllocated(); 1854 const size_t total_memory = GetTotalMemory(); 1855 std::ostringstream pause_string; 1856 for (size_t i = 0; i < pauses.size(); ++i) { 1857 pause_string << PrettyDuration((pauses[i] / 1000) * 1000) 1858 << ((i != pauses.size() - 1) ? ", " : ""); 1859 } 1860 LOG(INFO) << gc_cause << " " << collector->GetName() 1861 << " GC freed " << collector->GetFreedObjects() << "(" 1862 << PrettySize(collector->GetFreedBytes()) << ") AllocSpace objects, " 1863 << collector->GetFreedLargeObjects() << "(" 1864 << PrettySize(collector->GetFreedLargeObjectBytes()) << ") LOS objects, " 1865 << percent_free << "% free, " << PrettySize(current_heap_size) << "/" 1866 << PrettySize(total_memory) << ", " << "paused " << pause_string.str() 1867 << " total " << PrettyDuration((duration / 1000) * 1000); 1868 if (VLOG_IS_ON(heap)) { 1869 LOG(INFO) << Dumpable<TimingLogger>(collector->GetTimings()); 1870 } 1871 } 1872 } 1873 FinishGC(self, gc_type); 1874 ATRACE_END(); 1875 1876 // Inform DDMS that a GC completed. 1877 Dbg::GcDidFinish(); 1878 return gc_type; 1879} 1880 1881void Heap::FinishGC(Thread* self, collector::GcType gc_type) { 1882 MutexLock mu(self, *gc_complete_lock_); 1883 collector_type_running_ = kCollectorTypeNone; 1884 if (gc_type != collector::kGcTypeNone) { 1885 last_gc_type_ = gc_type; 1886 } 1887 // Wake anyone who may have been waiting for the GC to complete. 1888 gc_complete_cond_->Broadcast(self); 1889} 1890 1891static void RootMatchesObjectVisitor(mirror::Object** root, void* arg, uint32_t /*thread_id*/, 1892 RootType /*root_type*/) { 1893 mirror::Object* obj = reinterpret_cast<mirror::Object*>(arg); 1894 if (*root == obj) { 1895 LOG(INFO) << "Object " << obj << " is a root"; 1896 } 1897} 1898 1899class ScanVisitor { 1900 public: 1901 void operator()(const mirror::Object* obj) const { 1902 LOG(ERROR) << "Would have rescanned object " << obj; 1903 } 1904}; 1905 1906// Verify a reference from an object. 1907class VerifyReferenceVisitor { 1908 public: 1909 explicit VerifyReferenceVisitor(Heap* heap) 1910 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) 1911 : heap_(heap), failed_(false) {} 1912 1913 bool Failed() const { 1914 return failed_; 1915 } 1916 1917 // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for smarter 1918 // analysis on visitors. 1919 void operator()(mirror::Object* obj, mirror::Object* ref, 1920 const MemberOffset& offset, bool /* is_static */) const 1921 NO_THREAD_SAFETY_ANALYSIS { 1922 if (ref == nullptr || IsLive(ref)) { 1923 // Verify that the reference is live. 1924 return; 1925 } 1926 if (!failed_) { 1927 // Print message on only on first failure to prevent spam. 1928 LOG(ERROR) << "!!!!!!!!!!!!!!Heap corruption detected!!!!!!!!!!!!!!!!!!!"; 1929 failed_ = true; 1930 } 1931 if (obj != nullptr) { 1932 accounting::CardTable* card_table = heap_->GetCardTable(); 1933 accounting::ObjectStack* alloc_stack = heap_->allocation_stack_.get(); 1934 accounting::ObjectStack* live_stack = heap_->live_stack_.get(); 1935 byte* card_addr = card_table->CardFromAddr(obj); 1936 LOG(ERROR) << "Object " << obj << " references dead object " << ref << " at offset " 1937 << offset << "\n card value = " << static_cast<int>(*card_addr); 1938 if (heap_->IsValidObjectAddress(obj->GetClass())) { 1939 LOG(ERROR) << "Obj type " << PrettyTypeOf(obj); 1940 } else { 1941 LOG(ERROR) << "Object " << obj << " class(" << obj->GetClass() << ") not a heap address"; 1942 } 1943 1944 // Attmept to find the class inside of the recently freed objects. 1945 space::ContinuousSpace* ref_space = heap_->FindContinuousSpaceFromObject(ref, true); 1946 if (ref_space != nullptr && ref_space->IsMallocSpace()) { 1947 space::MallocSpace* space = ref_space->AsMallocSpace(); 1948 mirror::Class* ref_class = space->FindRecentFreedObject(ref); 1949 if (ref_class != nullptr) { 1950 LOG(ERROR) << "Reference " << ref << " found as a recently freed object with class " 1951 << PrettyClass(ref_class); 1952 } else { 1953 LOG(ERROR) << "Reference " << ref << " not found as a recently freed object"; 1954 } 1955 } 1956 1957 if (ref->GetClass() != nullptr && heap_->IsValidObjectAddress(ref->GetClass()) && 1958 ref->GetClass()->IsClass()) { 1959 LOG(ERROR) << "Ref type " << PrettyTypeOf(ref); 1960 } else { 1961 LOG(ERROR) << "Ref " << ref << " class(" << ref->GetClass() 1962 << ") is not a valid heap address"; 1963 } 1964 1965 card_table->CheckAddrIsInCardTable(reinterpret_cast<const byte*>(obj)); 1966 void* cover_begin = card_table->AddrFromCard(card_addr); 1967 void* cover_end = reinterpret_cast<void*>(reinterpret_cast<size_t>(cover_begin) + 1968 accounting::CardTable::kCardSize); 1969 LOG(ERROR) << "Card " << reinterpret_cast<void*>(card_addr) << " covers " << cover_begin 1970 << "-" << cover_end; 1971 accounting::SpaceBitmap* bitmap = heap_->GetLiveBitmap()->GetContinuousSpaceBitmap(obj); 1972 1973 if (bitmap == nullptr) { 1974 LOG(ERROR) << "Object " << obj << " has no bitmap"; 1975 if (!VerifyClassClass(obj->GetClass())) { 1976 LOG(ERROR) << "Object " << obj << " failed class verification!"; 1977 } 1978 } else { 1979 // Print out how the object is live. 1980 if (bitmap->Test(obj)) { 1981 LOG(ERROR) << "Object " << obj << " found in live bitmap"; 1982 } 1983 if (alloc_stack->Contains(const_cast<mirror::Object*>(obj))) { 1984 LOG(ERROR) << "Object " << obj << " found in allocation stack"; 1985 } 1986 if (live_stack->Contains(const_cast<mirror::Object*>(obj))) { 1987 LOG(ERROR) << "Object " << obj << " found in live stack"; 1988 } 1989 if (alloc_stack->Contains(const_cast<mirror::Object*>(ref))) { 1990 LOG(ERROR) << "Ref " << ref << " found in allocation stack"; 1991 } 1992 if (live_stack->Contains(const_cast<mirror::Object*>(ref))) { 1993 LOG(ERROR) << "Ref " << ref << " found in live stack"; 1994 } 1995 // Attempt to see if the card table missed the reference. 1996 ScanVisitor scan_visitor; 1997 byte* byte_cover_begin = reinterpret_cast<byte*>(card_table->AddrFromCard(card_addr)); 1998 card_table->Scan(bitmap, byte_cover_begin, 1999 byte_cover_begin + accounting::CardTable::kCardSize, scan_visitor); 2000 } 2001 2002 // Search to see if any of the roots reference our object. 2003 void* arg = const_cast<void*>(reinterpret_cast<const void*>(obj)); 2004 Runtime::Current()->VisitRoots(&RootMatchesObjectVisitor, arg); 2005 2006 // Search to see if any of the roots reference our reference. 2007 arg = const_cast<void*>(reinterpret_cast<const void*>(ref)); 2008 Runtime::Current()->VisitRoots(&RootMatchesObjectVisitor, arg); 2009 } else { 2010 LOG(ERROR) << "Root " << ref << " is dead with type " << PrettyTypeOf(ref); 2011 } 2012 } 2013 2014 bool IsLive(mirror::Object* obj) const NO_THREAD_SAFETY_ANALYSIS { 2015 return heap_->IsLiveObjectLocked(obj, true, false, true); 2016 } 2017 2018 static void VerifyRoots(mirror::Object** root, void* arg, uint32_t /*thread_id*/, 2019 RootType /*root_type*/) { 2020 VerifyReferenceVisitor* visitor = reinterpret_cast<VerifyReferenceVisitor*>(arg); 2021 (*visitor)(nullptr, *root, MemberOffset(0), true); 2022 } 2023 2024 private: 2025 Heap* const heap_; 2026 mutable bool failed_; 2027}; 2028 2029// Verify all references within an object, for use with HeapBitmap::Visit. 2030class VerifyObjectVisitor { 2031 public: 2032 explicit VerifyObjectVisitor(Heap* heap) : heap_(heap), failed_(false) {} 2033 2034 void operator()(mirror::Object* obj) const 2035 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { 2036 // Note: we are verifying the references in obj but not obj itself, this is because obj must 2037 // be live or else how did we find it in the live bitmap? 2038 VerifyReferenceVisitor visitor(heap_); 2039 // The class doesn't count as a reference but we should verify it anyways. 2040 collector::MarkSweep::VisitObjectReferences(obj, visitor, true); 2041 if (obj->IsReferenceInstance()) { 2042 mirror::Reference* ref = obj->AsReference(); 2043 visitor(obj, ref->GetReferent(), mirror::Reference::ReferentOffset(), false); 2044 } 2045 failed_ = failed_ || visitor.Failed(); 2046 } 2047 2048 static void VisitCallback(mirror::Object* obj, void* arg) 2049 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { 2050 VerifyObjectVisitor* visitor = reinterpret_cast<VerifyObjectVisitor*>(arg); 2051 visitor->operator()(obj); 2052 } 2053 2054 bool Failed() const { 2055 return failed_; 2056 } 2057 2058 private: 2059 Heap* const heap_; 2060 mutable bool failed_; 2061}; 2062 2063// Must do this with mutators suspended since we are directly accessing the allocation stacks. 2064bool Heap::VerifyHeapReferences() { 2065 Thread* self = Thread::Current(); 2066 Locks::mutator_lock_->AssertExclusiveHeld(self); 2067 // Lets sort our allocation stacks so that we can efficiently binary search them. 2068 allocation_stack_->Sort(); 2069 live_stack_->Sort(); 2070 // Since we sorted the allocation stack content, need to revoke all 2071 // thread-local allocation stacks. 2072 RevokeAllThreadLocalAllocationStacks(self); 2073 VerifyObjectVisitor visitor(this); 2074 // Verify objects in the allocation stack since these will be objects which were: 2075 // 1. Allocated prior to the GC (pre GC verification). 2076 // 2. Allocated during the GC (pre sweep GC verification). 2077 // We don't want to verify the objects in the live stack since they themselves may be 2078 // pointing to dead objects if they are not reachable. 2079 VisitObjects(VerifyObjectVisitor::VisitCallback, &visitor); 2080 // Verify the roots: 2081 Runtime::Current()->VisitRoots(VerifyReferenceVisitor::VerifyRoots, &visitor); 2082 if (visitor.Failed()) { 2083 // Dump mod-union tables. 2084 for (const auto& table_pair : mod_union_tables_) { 2085 accounting::ModUnionTable* mod_union_table = table_pair.second; 2086 mod_union_table->Dump(LOG(ERROR) << mod_union_table->GetName() << ": "); 2087 } 2088 // Dump remembered sets. 2089 for (const auto& table_pair : remembered_sets_) { 2090 accounting::RememberedSet* remembered_set = table_pair.second; 2091 remembered_set->Dump(LOG(ERROR) << remembered_set->GetName() << ": "); 2092 } 2093 DumpSpaces(); 2094 return false; 2095 } 2096 return true; 2097} 2098 2099class VerifyReferenceCardVisitor { 2100 public: 2101 VerifyReferenceCardVisitor(Heap* heap, bool* failed) 2102 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, 2103 Locks::heap_bitmap_lock_) 2104 : heap_(heap), failed_(failed) { 2105 } 2106 2107 // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for 2108 // annotalysis on visitors. 2109 void operator()(mirror::Object* obj, mirror::Object* ref, const MemberOffset& offset, 2110 bool is_static) const NO_THREAD_SAFETY_ANALYSIS { 2111 // Filter out class references since changing an object's class does not mark the card as dirty. 2112 // Also handles large objects, since the only reference they hold is a class reference. 2113 if (ref != NULL && !ref->IsClass()) { 2114 accounting::CardTable* card_table = heap_->GetCardTable(); 2115 // If the object is not dirty and it is referencing something in the live stack other than 2116 // class, then it must be on a dirty card. 2117 if (!card_table->AddrIsInCardTable(obj)) { 2118 LOG(ERROR) << "Object " << obj << " is not in the address range of the card table"; 2119 *failed_ = true; 2120 } else if (!card_table->IsDirty(obj)) { 2121 // TODO: Check mod-union tables. 2122 // Card should be either kCardDirty if it got re-dirtied after we aged it, or 2123 // kCardDirty - 1 if it didnt get touched since we aged it. 2124 accounting::ObjectStack* live_stack = heap_->live_stack_.get(); 2125 if (live_stack->ContainsSorted(const_cast<mirror::Object*>(ref))) { 2126 if (live_stack->ContainsSorted(const_cast<mirror::Object*>(obj))) { 2127 LOG(ERROR) << "Object " << obj << " found in live stack"; 2128 } 2129 if (heap_->GetLiveBitmap()->Test(obj)) { 2130 LOG(ERROR) << "Object " << obj << " found in live bitmap"; 2131 } 2132 LOG(ERROR) << "Object " << obj << " " << PrettyTypeOf(obj) 2133 << " references " << ref << " " << PrettyTypeOf(ref) << " in live stack"; 2134 2135 // Print which field of the object is dead. 2136 if (!obj->IsObjectArray()) { 2137 mirror::Class* klass = is_static ? obj->AsClass() : obj->GetClass(); 2138 CHECK(klass != NULL); 2139 mirror::ObjectArray<mirror::ArtField>* fields = is_static ? klass->GetSFields() 2140 : klass->GetIFields(); 2141 CHECK(fields != NULL); 2142 for (int32_t i = 0; i < fields->GetLength(); ++i) { 2143 mirror::ArtField* cur = fields->Get(i); 2144 if (cur->GetOffset().Int32Value() == offset.Int32Value()) { 2145 LOG(ERROR) << (is_static ? "Static " : "") << "field in the live stack is " 2146 << PrettyField(cur); 2147 break; 2148 } 2149 } 2150 } else { 2151 mirror::ObjectArray<mirror::Object>* object_array = 2152 obj->AsObjectArray<mirror::Object>(); 2153 for (int32_t i = 0; i < object_array->GetLength(); ++i) { 2154 if (object_array->Get(i) == ref) { 2155 LOG(ERROR) << (is_static ? "Static " : "") << "obj[" << i << "] = ref"; 2156 } 2157 } 2158 } 2159 2160 *failed_ = true; 2161 } 2162 } 2163 } 2164 } 2165 2166 private: 2167 Heap* const heap_; 2168 bool* const failed_; 2169}; 2170 2171class VerifyLiveStackReferences { 2172 public: 2173 explicit VerifyLiveStackReferences(Heap* heap) 2174 : heap_(heap), 2175 failed_(false) {} 2176 2177 void operator()(mirror::Object* obj) const 2178 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { 2179 VerifyReferenceCardVisitor visitor(heap_, const_cast<bool*>(&failed_)); 2180 collector::MarkSweep::VisitObjectReferences(const_cast<mirror::Object*>(obj), visitor, true); 2181 } 2182 2183 bool Failed() const { 2184 return failed_; 2185 } 2186 2187 private: 2188 Heap* const heap_; 2189 bool failed_; 2190}; 2191 2192bool Heap::VerifyMissingCardMarks() { 2193 Thread* self = Thread::Current(); 2194 Locks::mutator_lock_->AssertExclusiveHeld(self); 2195 2196 // We need to sort the live stack since we binary search it. 2197 live_stack_->Sort(); 2198 // Since we sorted the allocation stack content, need to revoke all 2199 // thread-local allocation stacks. 2200 RevokeAllThreadLocalAllocationStacks(self); 2201 VerifyLiveStackReferences visitor(this); 2202 GetLiveBitmap()->Visit(visitor); 2203 2204 // We can verify objects in the live stack since none of these should reference dead objects. 2205 for (mirror::Object** it = live_stack_->Begin(); it != live_stack_->End(); ++it) { 2206 if (!kUseThreadLocalAllocationStack || *it != nullptr) { 2207 visitor(*it); 2208 } 2209 } 2210 2211 if (visitor.Failed()) { 2212 DumpSpaces(); 2213 return false; 2214 } 2215 return true; 2216} 2217 2218void Heap::SwapStacks(Thread* self) { 2219 if (kUseThreadLocalAllocationStack) { 2220 live_stack_->AssertAllZero(); 2221 } 2222 allocation_stack_.swap(live_stack_); 2223} 2224 2225void Heap::RevokeAllThreadLocalAllocationStacks(Thread* self) { 2226 // This must be called only during the pause. 2227 CHECK(Locks::mutator_lock_->IsExclusiveHeld(self)); 2228 MutexLock mu(self, *Locks::runtime_shutdown_lock_); 2229 MutexLock mu2(self, *Locks::thread_list_lock_); 2230 std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList(); 2231 for (Thread* t : thread_list) { 2232 t->RevokeThreadLocalAllocationStack(); 2233 } 2234} 2235 2236accounting::ModUnionTable* Heap::FindModUnionTableFromSpace(space::Space* space) { 2237 auto it = mod_union_tables_.find(space); 2238 if (it == mod_union_tables_.end()) { 2239 return nullptr; 2240 } 2241 return it->second; 2242} 2243 2244accounting::RememberedSet* Heap::FindRememberedSetFromSpace(space::Space* space) { 2245 auto it = remembered_sets_.find(space); 2246 if (it == remembered_sets_.end()) { 2247 return nullptr; 2248 } 2249 return it->second; 2250} 2251 2252void Heap::ProcessCards(TimingLogger& timings, bool use_rem_sets) { 2253 // Clear cards and keep track of cards cleared in the mod-union table. 2254 for (const auto& space : continuous_spaces_) { 2255 accounting::ModUnionTable* table = FindModUnionTableFromSpace(space); 2256 accounting::RememberedSet* rem_set = FindRememberedSetFromSpace(space); 2257 if (table != nullptr) { 2258 const char* name = space->IsZygoteSpace() ? "ZygoteModUnionClearCards" : 2259 "ImageModUnionClearCards"; 2260 TimingLogger::ScopedSplit split(name, &timings); 2261 table->ClearCards(); 2262 } else if (use_rem_sets && rem_set != nullptr) { 2263 DCHECK(collector::SemiSpace::kUseRememberedSet && collector_type_ == kCollectorTypeGSS) 2264 << static_cast<int>(collector_type_); 2265 TimingLogger::ScopedSplit split("AllocSpaceRemSetClearCards", &timings); 2266 rem_set->ClearCards(); 2267 } else if (space->GetType() != space::kSpaceTypeBumpPointerSpace) { 2268 TimingLogger::ScopedSplit split("AllocSpaceClearCards", &timings); 2269 // No mod union table for the AllocSpace. Age the cards so that the GC knows that these cards 2270 // were dirty before the GC started. 2271 // TODO: Need to use atomic for the case where aged(cleaning thread) -> dirty(other thread) 2272 // -> clean(cleaning thread). 2273 // The races are we either end up with: Aged card, unaged card. Since we have the checkpoint 2274 // roots and then we scan / update mod union tables after. We will always scan either card. 2275 // If we end up with the non aged card, we scan it it in the pause. 2276 card_table_->ModifyCardsAtomic(space->Begin(), space->End(), AgeCardVisitor(), VoidFunctor()); 2277 } 2278 } 2279} 2280 2281static mirror::Object* IdentityMarkObjectCallback(mirror::Object* obj, void*) { 2282 return obj; 2283} 2284 2285void Heap::PreGcVerification(collector::GarbageCollector* gc) { 2286 ThreadList* thread_list = Runtime::Current()->GetThreadList(); 2287 Thread* self = Thread::Current(); 2288 2289 if (verify_pre_gc_heap_) { 2290 thread_list->SuspendAll(); 2291 { 2292 ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); 2293 if (!VerifyHeapReferences()) { 2294 LOG(FATAL) << "Pre " << gc->GetName() << " heap verification failed"; 2295 } 2296 } 2297 thread_list->ResumeAll(); 2298 } 2299 2300 // Check that all objects which reference things in the live stack are on dirty cards. 2301 if (verify_missing_card_marks_) { 2302 thread_list->SuspendAll(); 2303 { 2304 ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); 2305 SwapStacks(self); 2306 // Sort the live stack so that we can quickly binary search it later. 2307 if (!VerifyMissingCardMarks()) { 2308 LOG(FATAL) << "Pre " << gc->GetName() << " missing card mark verification failed"; 2309 } 2310 SwapStacks(self); 2311 } 2312 thread_list->ResumeAll(); 2313 } 2314 2315 if (verify_mod_union_table_) { 2316 thread_list->SuspendAll(); 2317 ReaderMutexLock reader_lock(self, *Locks::heap_bitmap_lock_); 2318 for (const auto& table_pair : mod_union_tables_) { 2319 accounting::ModUnionTable* mod_union_table = table_pair.second; 2320 mod_union_table->UpdateAndMarkReferences(IdentityMarkObjectCallback, nullptr); 2321 mod_union_table->Verify(); 2322 } 2323 thread_list->ResumeAll(); 2324 } 2325} 2326 2327void Heap::PreSweepingGcVerification(collector::GarbageCollector* gc) { 2328 // Called before sweeping occurs since we want to make sure we are not going so reclaim any 2329 // reachable objects. 2330 if (verify_post_gc_heap_) { 2331 Thread* self = Thread::Current(); 2332 CHECK_NE(self->GetState(), kRunnable); 2333 { 2334 WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); 2335 // Swapping bound bitmaps does nothing. 2336 gc->SwapBitmaps(); 2337 if (!VerifyHeapReferences()) { 2338 LOG(FATAL) << "Pre sweeping " << gc->GetName() << " GC verification failed"; 2339 } 2340 gc->SwapBitmaps(); 2341 } 2342 } 2343} 2344 2345void Heap::PostGcVerification(collector::GarbageCollector* gc) { 2346 if (verify_system_weaks_) { 2347 Thread* self = Thread::Current(); 2348 ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); 2349 collector::MarkSweep* mark_sweep = down_cast<collector::MarkSweep*>(gc); 2350 mark_sweep->VerifySystemWeaks(); 2351 } 2352} 2353 2354void Heap::PreGcRosAllocVerification(TimingLogger* timings) { 2355 if (verify_pre_gc_rosalloc_) { 2356 TimingLogger::ScopedSplit split("PreGcRosAllocVerification", timings); 2357 for (const auto& space : continuous_spaces_) { 2358 if (space->IsRosAllocSpace()) { 2359 VLOG(heap) << "PreGcRosAllocVerification : " << space->GetName(); 2360 space::RosAllocSpace* rosalloc_space = space->AsRosAllocSpace(); 2361 rosalloc_space->Verify(); 2362 } 2363 } 2364 } 2365} 2366 2367void Heap::PostGcRosAllocVerification(TimingLogger* timings) { 2368 if (verify_post_gc_rosalloc_) { 2369 TimingLogger::ScopedSplit split("PostGcRosAllocVerification", timings); 2370 for (const auto& space : continuous_spaces_) { 2371 if (space->IsRosAllocSpace()) { 2372 VLOG(heap) << "PostGcRosAllocVerification : " << space->GetName(); 2373 space::RosAllocSpace* rosalloc_space = space->AsRosAllocSpace(); 2374 rosalloc_space->Verify(); 2375 } 2376 } 2377 } 2378} 2379 2380collector::GcType Heap::WaitForGcToComplete(Thread* self) { 2381 ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); 2382 MutexLock mu(self, *gc_complete_lock_); 2383 return WaitForGcToCompleteLocked(self); 2384} 2385 2386collector::GcType Heap::WaitForGcToCompleteLocked(Thread* self) { 2387 collector::GcType last_gc_type = collector::kGcTypeNone; 2388 uint64_t wait_start = NanoTime(); 2389 while (collector_type_running_ != kCollectorTypeNone) { 2390 ATRACE_BEGIN("GC: Wait For Completion"); 2391 // We must wait, change thread state then sleep on gc_complete_cond_; 2392 gc_complete_cond_->Wait(self); 2393 last_gc_type = last_gc_type_; 2394 ATRACE_END(); 2395 } 2396 uint64_t wait_time = NanoTime() - wait_start; 2397 total_wait_time_ += wait_time; 2398 if (wait_time > long_pause_log_threshold_) { 2399 LOG(INFO) << "WaitForGcToComplete blocked for " << PrettyDuration(wait_time); 2400 } 2401 return last_gc_type; 2402} 2403 2404void Heap::DumpForSigQuit(std::ostream& os) { 2405 os << "Heap: " << GetPercentFree() << "% free, " << PrettySize(GetBytesAllocated()) << "/" 2406 << PrettySize(GetTotalMemory()) << "; " << GetObjectsAllocated() << " objects\n"; 2407 DumpGcPerformanceInfo(os); 2408} 2409 2410size_t Heap::GetPercentFree() { 2411 return static_cast<size_t>(100.0f * static_cast<float>(GetFreeMemory()) / GetTotalMemory()); 2412} 2413 2414void Heap::SetIdealFootprint(size_t max_allowed_footprint) { 2415 if (max_allowed_footprint > GetMaxMemory()) { 2416 VLOG(gc) << "Clamp target GC heap from " << PrettySize(max_allowed_footprint) << " to " 2417 << PrettySize(GetMaxMemory()); 2418 max_allowed_footprint = GetMaxMemory(); 2419 } 2420 max_allowed_footprint_ = max_allowed_footprint; 2421} 2422 2423bool Heap::IsMovableObject(const mirror::Object* obj) const { 2424 if (kMovingCollector) { 2425 DCHECK(!IsInTempSpace(obj)); 2426 if (bump_pointer_space_->HasAddress(obj)) { 2427 return true; 2428 } 2429 // TODO: Refactor this logic into the space itself? 2430 // Objects in the main space are only copied during background -> foreground transitions or 2431 // visa versa. 2432 if (main_space_ != nullptr && main_space_->HasAddress(obj) && 2433 (IsCompactingGC(background_collector_type_) || 2434 IsCompactingGC(post_zygote_collector_type_))) { 2435 return true; 2436 } 2437 } 2438 return false; 2439} 2440 2441bool Heap::IsInTempSpace(const mirror::Object* obj) const { 2442 if (temp_space_->HasAddress(obj) && !temp_space_->Contains(obj)) { 2443 return true; 2444 } 2445 return false; 2446} 2447 2448void Heap::UpdateMaxNativeFootprint() { 2449 size_t native_size = native_bytes_allocated_; 2450 // TODO: Tune the native heap utilization to be a value other than the java heap utilization. 2451 size_t target_size = native_size / GetTargetHeapUtilization(); 2452 if (target_size > native_size + max_free_) { 2453 target_size = native_size + max_free_; 2454 } else if (target_size < native_size + min_free_) { 2455 target_size = native_size + min_free_; 2456 } 2457 native_footprint_gc_watermark_ = target_size; 2458 native_footprint_limit_ = 2 * target_size - native_size; 2459} 2460 2461void Heap::GrowForUtilization(collector::GcType gc_type, uint64_t gc_duration) { 2462 // We know what our utilization is at this moment. 2463 // This doesn't actually resize any memory. It just lets the heap grow more when necessary. 2464 const size_t bytes_allocated = GetBytesAllocated(); 2465 last_gc_size_ = bytes_allocated; 2466 last_gc_time_ns_ = NanoTime(); 2467 size_t target_size; 2468 if (gc_type != collector::kGcTypeSticky) { 2469 // Grow the heap for non sticky GC. 2470 target_size = bytes_allocated / GetTargetHeapUtilization(); 2471 if (target_size > bytes_allocated + max_free_) { 2472 target_size = bytes_allocated + max_free_; 2473 } else if (target_size < bytes_allocated + min_free_) { 2474 target_size = bytes_allocated + min_free_; 2475 } 2476 native_need_to_run_finalization_ = true; 2477 next_gc_type_ = collector::kGcTypeSticky; 2478 } else { 2479 // Based on how close the current heap size is to the target size, decide 2480 // whether or not to do a partial or sticky GC next. 2481 if (bytes_allocated + min_free_ <= max_allowed_footprint_) { 2482 next_gc_type_ = collector::kGcTypeSticky; 2483 } else { 2484 next_gc_type_ = have_zygote_space_ ? collector::kGcTypePartial : collector::kGcTypeFull; 2485 } 2486 // If we have freed enough memory, shrink the heap back down. 2487 if (bytes_allocated + max_free_ < max_allowed_footprint_) { 2488 target_size = bytes_allocated + max_free_; 2489 } else { 2490 target_size = std::max(bytes_allocated, max_allowed_footprint_); 2491 } 2492 } 2493 if (!ignore_max_footprint_) { 2494 SetIdealFootprint(target_size); 2495 if (concurrent_gc_) { 2496 // Calculate when to perform the next ConcurrentGC. 2497 // Calculate the estimated GC duration. 2498 const double gc_duration_seconds = NsToMs(gc_duration) / 1000.0; 2499 // Estimate how many remaining bytes we will have when we need to start the next GC. 2500 size_t remaining_bytes = allocation_rate_ * gc_duration_seconds; 2501 remaining_bytes = std::min(remaining_bytes, kMaxConcurrentRemainingBytes); 2502 remaining_bytes = std::max(remaining_bytes, kMinConcurrentRemainingBytes); 2503 if (UNLIKELY(remaining_bytes > max_allowed_footprint_)) { 2504 // A never going to happen situation that from the estimated allocation rate we will exceed 2505 // the applications entire footprint with the given estimated allocation rate. Schedule 2506 // another GC nearly straight away. 2507 remaining_bytes = kMinConcurrentRemainingBytes; 2508 } 2509 DCHECK_LE(remaining_bytes, max_allowed_footprint_); 2510 DCHECK_LE(max_allowed_footprint_, growth_limit_); 2511 // Start a concurrent GC when we get close to the estimated remaining bytes. When the 2512 // allocation rate is very high, remaining_bytes could tell us that we should start a GC 2513 // right away. 2514 concurrent_start_bytes_ = std::max(max_allowed_footprint_ - remaining_bytes, bytes_allocated); 2515 } 2516 } 2517} 2518 2519void Heap::ClearGrowthLimit() { 2520 growth_limit_ = capacity_; 2521 non_moving_space_->ClearGrowthLimit(); 2522} 2523 2524void Heap::AddFinalizerReference(Thread* self, mirror::Object* object) { 2525 ScopedObjectAccess soa(self); 2526 ScopedLocalRef<jobject> arg(self->GetJniEnv(), soa.AddLocalReference<jobject>(object)); 2527 jvalue args[1]; 2528 args[0].l = arg.get(); 2529 InvokeWithJValues(soa, nullptr, WellKnownClasses::java_lang_ref_FinalizerReference_add, args); 2530} 2531 2532void Heap::EnqueueClearedReferences() { 2533 Thread* self = Thread::Current(); 2534 Locks::mutator_lock_->AssertNotHeld(self); 2535 if (!cleared_references_.IsEmpty()) { 2536 // When a runtime isn't started there are no reference queues to care about so ignore. 2537 if (LIKELY(Runtime::Current()->IsStarted())) { 2538 ScopedObjectAccess soa(self); 2539 ScopedLocalRef<jobject> arg(self->GetJniEnv(), 2540 soa.AddLocalReference<jobject>(cleared_references_.GetList())); 2541 jvalue args[1]; 2542 args[0].l = arg.get(); 2543 InvokeWithJValues(soa, nullptr, WellKnownClasses::java_lang_ref_ReferenceQueue_add, args); 2544 } 2545 cleared_references_.Clear(); 2546 } 2547} 2548 2549void Heap::RequestConcurrentGC(Thread* self) { 2550 // Make sure that we can do a concurrent GC. 2551 Runtime* runtime = Runtime::Current(); 2552 if (runtime == NULL || !runtime->IsFinishedStarting() || runtime->IsShuttingDown(self) || 2553 self->IsHandlingStackOverflow()) { 2554 return; 2555 } 2556 // We already have a request pending, no reason to start more until we update 2557 // concurrent_start_bytes_. 2558 concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); 2559 JNIEnv* env = self->GetJniEnv(); 2560 DCHECK(WellKnownClasses::java_lang_Daemons != nullptr); 2561 DCHECK(WellKnownClasses::java_lang_Daemons_requestGC != nullptr); 2562 env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, 2563 WellKnownClasses::java_lang_Daemons_requestGC); 2564 CHECK(!env->ExceptionCheck()); 2565} 2566 2567void Heap::ConcurrentGC(Thread* self) { 2568 if (Runtime::Current()->IsShuttingDown(self)) { 2569 return; 2570 } 2571 // Wait for any GCs currently running to finish. 2572 if (WaitForGcToComplete(self) == collector::kGcTypeNone) { 2573 // If the we can't run the GC type we wanted to run, find the next appropriate one and try that 2574 // instead. E.g. can't do partial, so do full instead. 2575 if (CollectGarbageInternal(next_gc_type_, kGcCauseBackground, false) == 2576 collector::kGcTypeNone) { 2577 for (collector::GcType gc_type : gc_plan_) { 2578 // Attempt to run the collector, if we succeed, we are done. 2579 if (gc_type > next_gc_type_ && 2580 CollectGarbageInternal(gc_type, kGcCauseBackground, false) != collector::kGcTypeNone) { 2581 break; 2582 } 2583 } 2584 } 2585 } 2586} 2587 2588void Heap::RequestCollectorTransition(CollectorType desired_collector_type, uint64_t delta_time) { 2589 Thread* self = Thread::Current(); 2590 { 2591 MutexLock mu(self, *heap_trim_request_lock_); 2592 if (desired_collector_type_ == desired_collector_type) { 2593 return; 2594 } 2595 heap_transition_target_time_ = std::max(heap_transition_target_time_, NanoTime() + delta_time); 2596 desired_collector_type_ = desired_collector_type; 2597 } 2598 SignalHeapTrimDaemon(self); 2599} 2600 2601void Heap::RequestHeapTrim() { 2602 // GC completed and now we must decide whether to request a heap trim (advising pages back to the 2603 // kernel) or not. Issuing a request will also cause trimming of the libc heap. As a trim scans 2604 // a space it will hold its lock and can become a cause of jank. 2605 // Note, the large object space self trims and the Zygote space was trimmed and unchanging since 2606 // forking. 2607 2608 // We don't have a good measure of how worthwhile a trim might be. We can't use the live bitmap 2609 // because that only marks object heads, so a large array looks like lots of empty space. We 2610 // don't just call dlmalloc all the time, because the cost of an _attempted_ trim is proportional 2611 // to utilization (which is probably inversely proportional to how much benefit we can expect). 2612 // We could try mincore(2) but that's only a measure of how many pages we haven't given away, 2613 // not how much use we're making of those pages. 2614 2615 Thread* self = Thread::Current(); 2616 Runtime* runtime = Runtime::Current(); 2617 if (runtime == nullptr || !runtime->IsFinishedStarting() || runtime->IsShuttingDown(self)) { 2618 // Heap trimming isn't supported without a Java runtime or Daemons (such as at dex2oat time) 2619 // Also: we do not wish to start a heap trim if the runtime is shutting down (a racy check 2620 // as we don't hold the lock while requesting the trim). 2621 return; 2622 } 2623 2624 // Request a heap trim only if we do not currently care about pause times. 2625 if (!CareAboutPauseTimes()) { 2626 { 2627 MutexLock mu(self, *heap_trim_request_lock_); 2628 if (last_trim_time_ + kHeapTrimWait >= NanoTime()) { 2629 // We have done a heap trim in the last kHeapTrimWait nanosecs, don't request another one 2630 // just yet. 2631 return; 2632 } 2633 heap_trim_request_pending_ = true; 2634 } 2635 // Notify the daemon thread which will actually do the heap trim. 2636 SignalHeapTrimDaemon(self); 2637 } 2638} 2639 2640void Heap::SignalHeapTrimDaemon(Thread* self) { 2641 JNIEnv* env = self->GetJniEnv(); 2642 DCHECK(WellKnownClasses::java_lang_Daemons != nullptr); 2643 DCHECK(WellKnownClasses::java_lang_Daemons_requestHeapTrim != nullptr); 2644 env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, 2645 WellKnownClasses::java_lang_Daemons_requestHeapTrim); 2646 CHECK(!env->ExceptionCheck()); 2647} 2648 2649void Heap::RevokeThreadLocalBuffers(Thread* thread) { 2650 if (rosalloc_space_ != nullptr) { 2651 rosalloc_space_->RevokeThreadLocalBuffers(thread); 2652 } 2653 if (bump_pointer_space_ != nullptr) { 2654 bump_pointer_space_->RevokeThreadLocalBuffers(thread); 2655 } 2656} 2657 2658void Heap::RevokeAllThreadLocalBuffers() { 2659 if (rosalloc_space_ != nullptr) { 2660 rosalloc_space_->RevokeAllThreadLocalBuffers(); 2661 } 2662 if (bump_pointer_space_ != nullptr) { 2663 bump_pointer_space_->RevokeAllThreadLocalBuffers(); 2664 } 2665} 2666 2667bool Heap::IsGCRequestPending() const { 2668 return concurrent_start_bytes_ != std::numeric_limits<size_t>::max(); 2669} 2670 2671void Heap::RunFinalization(JNIEnv* env) { 2672 // Can't do this in WellKnownClasses::Init since System is not properly set up at that point. 2673 if (WellKnownClasses::java_lang_System_runFinalization == nullptr) { 2674 CHECK(WellKnownClasses::java_lang_System != nullptr); 2675 WellKnownClasses::java_lang_System_runFinalization = 2676 CacheMethod(env, WellKnownClasses::java_lang_System, true, "runFinalization", "()V"); 2677 CHECK(WellKnownClasses::java_lang_System_runFinalization != nullptr); 2678 } 2679 env->CallStaticVoidMethod(WellKnownClasses::java_lang_System, 2680 WellKnownClasses::java_lang_System_runFinalization); 2681} 2682 2683void Heap::RegisterNativeAllocation(JNIEnv* env, int bytes) { 2684 Thread* self = ThreadForEnv(env); 2685 if (native_need_to_run_finalization_) { 2686 RunFinalization(env); 2687 UpdateMaxNativeFootprint(); 2688 native_need_to_run_finalization_ = false; 2689 } 2690 // Total number of native bytes allocated. 2691 native_bytes_allocated_.FetchAndAdd(bytes); 2692 if (static_cast<size_t>(native_bytes_allocated_) > native_footprint_gc_watermark_) { 2693 collector::GcType gc_type = have_zygote_space_ ? collector::kGcTypePartial : 2694 collector::kGcTypeFull; 2695 2696 // The second watermark is higher than the gc watermark. If you hit this it means you are 2697 // allocating native objects faster than the GC can keep up with. 2698 if (static_cast<size_t>(native_bytes_allocated_) > native_footprint_limit_) { 2699 if (WaitForGcToComplete(self) != collector::kGcTypeNone) { 2700 // Just finished a GC, attempt to run finalizers. 2701 RunFinalization(env); 2702 CHECK(!env->ExceptionCheck()); 2703 } 2704 // If we still are over the watermark, attempt a GC for alloc and run finalizers. 2705 if (static_cast<size_t>(native_bytes_allocated_) > native_footprint_limit_) { 2706 CollectGarbageInternal(gc_type, kGcCauseForNativeAlloc, false); 2707 RunFinalization(env); 2708 native_need_to_run_finalization_ = false; 2709 CHECK(!env->ExceptionCheck()); 2710 } 2711 // We have just run finalizers, update the native watermark since it is very likely that 2712 // finalizers released native managed allocations. 2713 UpdateMaxNativeFootprint(); 2714 } else if (!IsGCRequestPending()) { 2715 if (concurrent_gc_) { 2716 RequestConcurrentGC(self); 2717 } else { 2718 CollectGarbageInternal(gc_type, kGcCauseForAlloc, false); 2719 } 2720 } 2721 } 2722} 2723 2724void Heap::RegisterNativeFree(JNIEnv* env, int bytes) { 2725 int expected_size, new_size; 2726 do { 2727 expected_size = native_bytes_allocated_.Load(); 2728 new_size = expected_size - bytes; 2729 if (UNLIKELY(new_size < 0)) { 2730 ScopedObjectAccess soa(env); 2731 env->ThrowNew(WellKnownClasses::java_lang_RuntimeException, 2732 StringPrintf("Attempted to free %d native bytes with only %d native bytes " 2733 "registered as allocated", bytes, expected_size).c_str()); 2734 break; 2735 } 2736 } while (!native_bytes_allocated_.CompareAndSwap(expected_size, new_size)); 2737} 2738 2739size_t Heap::GetTotalMemory() const { 2740 size_t ret = 0; 2741 for (const auto& space : continuous_spaces_) { 2742 // Currently don't include the image space. 2743 if (!space->IsImageSpace()) { 2744 ret += space->Size(); 2745 } 2746 } 2747 for (const auto& space : discontinuous_spaces_) { 2748 if (space->IsLargeObjectSpace()) { 2749 ret += space->AsLargeObjectSpace()->GetBytesAllocated(); 2750 } 2751 } 2752 return ret; 2753} 2754 2755void Heap::AddModUnionTable(accounting::ModUnionTable* mod_union_table) { 2756 DCHECK(mod_union_table != nullptr); 2757 mod_union_tables_.Put(mod_union_table->GetSpace(), mod_union_table); 2758} 2759 2760void Heap::CheckPreconditionsForAllocObject(mirror::Class* c, size_t byte_count) { 2761 CHECK(c == NULL || (c->IsClassClass() && byte_count >= sizeof(mirror::Class)) || 2762 (c->IsVariableSize() || c->GetObjectSize() == byte_count) || 2763 strlen(ClassHelper(c).GetDescriptor()) == 0); 2764 CHECK_GE(byte_count, sizeof(mirror::Object)); 2765} 2766 2767void Heap::AddRememberedSet(accounting::RememberedSet* remembered_set) { 2768 CHECK(remembered_set != nullptr); 2769 space::Space* space = remembered_set->GetSpace(); 2770 CHECK(space != nullptr); 2771 CHECK(remembered_sets_.find(space) == remembered_sets_.end()); 2772 remembered_sets_.Put(space, remembered_set); 2773 CHECK(remembered_sets_.find(space) != remembered_sets_.end()); 2774} 2775 2776void Heap::RemoveRememberedSet(space::Space* space) { 2777 CHECK(space != nullptr); 2778 auto it = remembered_sets_.find(space); 2779 CHECK(it != remembered_sets_.end()); 2780 remembered_sets_.erase(it); 2781 CHECK(remembered_sets_.find(space) == remembered_sets_.end()); 2782} 2783 2784} // namespace gc 2785} // namespace art 2786