Lines Matching defs:it
144 // How much we grow the TLAB if we can do it.
380 // Reserve the non moving mem map before the other two since it needs to be at a specific
507 // Remove the main backup space since it slows down the GC to have unused extra spaces.
553 // now. We don't create it earlier to make it clear that you can't use locks during heap
691 // If we are the zygote and don't yet have a zygote space, it means that the zygote fork will
738 // The allocation stack may have non movable objects in it. We need to flush it since the GC
766 // we attempt to disable it.
912 // collection where it's not easily known which objects are alive
976 for (auto* it = allocation_stack_->Begin(), *end = allocation_stack_->End(); it < end; ++it) {
977 mirror::Object* const obj = it->AsMirrorPtr();
1063 auto it = std::find(continuous_spaces_.begin(), continuous_spaces_.end(), continuous_space);
1064 DCHECK(it != continuous_spaces_.end());
1065 continuous_spaces_.erase(it);
1071 auto it = std::find(discontinuous_spaces_.begin(), discontinuous_spaces_.end(),
1073 DCHECK(it != discontinuous_spaces_.end());
1074 discontinuous_spaces_.erase(it);
1077 auto it = std::find(alloc_spaces_.begin(), alloc_spaces_.end(), space->AsAllocSpace());
1078 DCHECK(it != alloc_spaces_.end());
1079 alloc_spaces_.erase(it);
1336 // Launch homogeneous space compaction if it is desired.
1538 // then clear the stack containing it.
1670 // The allocation failed. If the GC is running, block until it completes, and then retry the
1852 // Need SuspendAll here to prevent lock violation if RosAlloc does it during InspectAll.
2032 // Homogeneous space compaction is a copying transition, can't run it if the moving GC disable count
2116 // If someone else beat us to it and changed the collector before we could, exit.
2119 // then it would get blocked on WaitForGcToCompleteLocked.
2148 // pointer space last transition it will be protected.
2163 // Remove the main space so that we don't try to trim it, this doens't work for debug
2167 delete main_space_; // Delete the space since it has been removed.
2373 auto it = bins_.lower_bound(alloc_size);
2374 if (it == bins_.end()) {
2375 // No available space in the bins, place it in the target space instead (grows the zygote
2386 size_t size = it->first;
2387 uintptr_t pos = it->second;
2388 bins_.erase(it); // Erase the old bin which we replace with the new smaller bin.
2437 // The end of the non-moving space may be protected, unprotect it so that we can copy the zygote
2500 // Save the old space so that we can remove it after we complete creating the zygote space.
2594 for (auto* it = stack->Begin(); it != limit; ++it) {
2595 const mirror::Object* obj = it->AsMirrorPtr();
2739 // This gets recalculated in GrowForUtilization. It is important that it is disabled /
2740 // calculated in the same thread so that there aren't any races that can cause it to become
2772 // Print the GC if it is an explicit GC (e.g. Runtime.gc()) or a slow GC
2776 // GC for alloc pauses the allocating thread, so consider it as a pause.
3043 // be live or else how did we find it in the live bitmap?
3045 // The class doesn't count as a reference but we should verify it anyways.
3167 // If the object is not dirty and it is referencing something in the live stack other than
3168 // class, then it must be on a dirty card.
3174 // Card should be either kCardDirty if it got re-dirtied after we aged it, or
3175 // kCardDirty - 1 if it didnt get touched since we aged it.
3244 // We need to sort the live stack since we binary search it.
3252 for (auto* it = live_stack_->Begin(); it != live_stack_->End(); ++it) {
3253 if (!kUseThreadLocalAllocationStack || it->AsMirrorPtr() != nullptr) {
3254 visitor(it->AsMirrorPtr());
3298 auto it = mod_union_tables_.find(space);
3299 if (it == mod_union_tables_.end()) {
3302 return it->second;
3306 auto it = remembered_sets_.find(space);
3307 if (it == remembered_sets_.end()) {
3310 return it->second;
3337 // Image space end is the end of the mirror objects, it is not necessarily page or card
3349 // scan either card. If we end up with the non aged card, we scan it it in the pause.
3382 // Sort the live stack so that we can quickly binary search it later.
3515 // is not the heap task daemon thread, it's considered as a
3519 // it results in log spam. kGcCauseExplicit is already logged in LogGC, so avoid it here too.
3695 // Restore object in case it gets moved.
3829 // a space it will hold its lock and can become a cause of jank.
4016 auto it = remembered_sets_.find(space);
4017 CHECK(it != remembered_sets_.end());
4018 delete it->second;
4019 remembered_sets_.erase(it);