/art/runtime/gc/accounting/ |
H A D | mod_union_table-inl.h | 31 explicit ModUnionTableToZygoteAllocspace(const std::string& name, Heap* heap, argument 33 : ModUnionTableReferenceCache(name, heap, space) {}
|
H A D | mod_union_table.h | 56 explicit ModUnionTable(const std::string& name, Heap* heap, space::ContinuousSpace* space) argument 58 heap_(heap), 100 explicit ModUnionTableReferenceCache(const std::string& name, Heap* heap, argument 102 : ModUnionTable(name, heap, space) {} 136 explicit ModUnionTableCardCache(const std::string& name, Heap* heap, space::ContinuousSpace* space) argument 137 : ModUnionTable(name, heap, space) {}
|
H A D | remembered_set.h | 49 explicit RememberedSet(const std::string& name, Heap* heap, space::ContinuousSpace* space) argument 50 : name_(name), heap_(heap), space_(space) {}
|
H A D | heap_bitmap.h | 60 explicit HeapBitmap(Heap* heap) : heap_(heap) {} argument
|
H A D | mod_union_table.cc | 27 #include "gc/heap.h" 178 Heap* heap = mod_union_table_->GetHeap(); local 179 space::ContinuousSpace* from_space = heap->FindContinuousSpaceFromObject(obj, false); 180 space::ContinuousSpace* to_space = heap->FindContinuousSpaceFromObject(ref, false); 188 heap->DumpSpaces(LOG(INFO)); 300 if (VLOG_IS_ON(heap)) {
|
/art/runtime/gc/ |
H A D | heap_test.cc | 32 Heap* heap = Runtime::Current()->GetHeap(); local 33 int64_t max_memory_before = heap->GetMaxMemory(); 34 int64_t total_memory_before = heap->GetTotalMemory(); 35 heap->ClearGrowthLimit(); 36 int64_t max_memory_after = heap->GetMaxMemory(); 37 int64_t total_memory_after = heap->GetTotalMemory();
|
H A D | heap-inl.h | 20 #include "heap.h" 276 inline Heap::AllocationTimer::AllocationTimer(Heap* heap, mirror::Object** allocated_obj_ptr) argument 277 : heap_(heap), allocated_obj_ptr_(allocated_obj_ptr) { 314 VLOG(heap) << "Growing heap from " << PrettySize(max_allowed_footprint_) << " to "
|
/art/runtime/gc/collector/ |
H A D | concurrent_copying.h | 28 explicit ConcurrentCopying(Heap* heap, bool generational = false, argument 30 : GarbageCollector(heap,
|
H A D | partial_mark_sweep.cc | 19 #include "gc/heap.h" 28 PartialMarkSweep::PartialMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix) argument 29 : MarkSweep(heap, is_concurrent, name_prefix.empty() ? "partial " : name_prefix) {
|
H A D | sticky_mark_sweep.cc | 17 #include "gc/heap.h" 27 StickyMarkSweep::StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix) argument 28 : PartialMarkSweep(heap, is_concurrent,
|
H A D | partial_mark_sweep.h | 33 explicit PartialMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix = "");
|
H A D | sticky_mark_sweep.h | 33 explicit StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix = "");
|
H A D | garbage_collector.cc | 35 : duration_ns_(0), timings_("GC iteration timing logger", true, VLOG_IS_ON(heap)) { 54 GarbageCollector::GarbageCollector(Heap* heap, const std::string& name) argument 55 : heap_(heap),
|
/art/runtime/ |
H A D | runtime_android.cc | 49 gc::Heap* heap = runtime->GetHeap(); local 50 if (kDumpHeapObjectOnSigsevg && heap != nullptr && info != nullptr) { 51 LOG(INTERNAL_FATAL) << "Dump heap object at fault address: "; 52 heap->DumpObject(LOG(INTERNAL_FATAL), reinterpret_cast<mirror::Object*>(info->si_addr));
|
H A D | class_linker-inl.h | 22 #include "gc/heap-inl.h" 188 gc::Heap* const heap = Runtime::Current()->GetHeap(); member in class:art::gc 194 kMoveFieldArrays ? heap->GetCurrentAllocator() : heap->GetCurrentNonMovingAllocator());
|
/art/runtime/mirror/ |
H A D | object.cc | 29 #include "gc/heap.h" 85 gc::Heap* heap = Runtime::Current()->GetHeap(); local 91 heap->WriteBarrierArray(dest, 0, array->GetLength()); 94 heap->WriteBarrierEveryFieldOf(dest); 97 heap->AddFinalizerReference(self, &dest); 126 gc::Heap* heap = Runtime::Current()->GetHeap(); local 132 if (heap->IsMovableObject(this)) { 133 copy = heap->AllocObject<true>(self, GetClass(), num_bytes, visitor); 135 copy = heap->AllocNonMovableObject<true>(self, GetClass(), num_bytes, visitor);
|
H A D | object_array-inl.h | 23 #include "gc/heap.h" 250 gc::Heap* heap = Runtime::Current()->GetHeap(); local 251 gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() : 252 heap->GetCurrentNonMovingAllocator();
|
/art/compiler/ |
H A D | image_test.cc | 119 gc::Heap* heap = Runtime::Current()->GetHeap(); local 120 ASSERT_TRUE(!heap->GetContinuousSpaces().empty()); 121 gc::space::ContinuousSpace* space = heap->GetNonMovingSpace(); 165 gc::Heap* heap = Runtime::Current()->GetHeap(); local 166 ASSERT_TRUE(heap->HasImageSpace()); 167 ASSERT_TRUE(heap->GetNonMovingSpace()->IsMallocSpace()); 169 gc::space::ImageSpace* image_space = heap->GetImageSpace();
|
H A D | image_writer.cc | 37 #include "gc/heap.h" 132 gc::Heap* heap = Runtime::Current()->GetHeap(); local 133 heap->CollectGarbage(false); // Remove garbage. 452 // Count the number of strings in the heap and put the result in arg as a size_t pointer. 460 // Collect all the java.lang.String in the heap and put them in the output strings_ array. 513 gc::Heap* heap = Runtime::Current()->GetHeap(); local 517 heap->VisitObjects(CountStringsCallback, &total_strings); // Count the strings. 526 heap->VisitObjects(StringCollector::Callback, &string_collector); 703 gc::Heap* heap = Runtime::Current()->GetHeap(); local 705 heap 899 gc::Heap* heap = Runtime::Current()->GetHeap(); local 959 gc::Heap* heap = Runtime::Current()->GetHeap(); local [all...] |
/art/patchoat/ |
H A D | patchoat.h | 27 #include "gc/heap.h" 65 MemMap* heap, off_t delta, TimingLogger* timings) 66 : image_(image), bitmap_(bitmap), heap_(heap), 69 gc::accounting::ContinuousSpaceBitmap* bitmap, MemMap* heap, off_t delta, 71 : oat_file_(oat_file), image_(image), bitmap_(bitmap), heap_(heap), 126 // change the heap. 145 // The heap we are patching. This is not modified. 147 // The heap we are patching. This is not modified. 64 PatchOat(InstructionSet isa, MemMap* image, gc::accounting::ContinuousSpaceBitmap* bitmap, MemMap* heap, off_t delta, TimingLogger* timings) argument 68 PatchOat(InstructionSet isa, ElfFile* oat_file, MemMap* image, gc::accounting::ContinuousSpaceBitmap* bitmap, MemMap* heap, off_t delta, TimingLogger* timings) argument
|
/art/runtime/gc/space/ |
H A D | malloc_space.cc | 21 #include "gc/heap.h" 134 VLOG(heap) << "MallocSpace::MoreCore " << PrettySize(increment); 172 // Trimming the heap should be done by the caller since we may have invalidated the accounting 177 VLOG(heap) << "Begin " << reinterpret_cast<const void*>(begin_) << "\n" 185 VLOG(heap) << "Creating new AllocSpace: "; 186 VLOG(heap) << "Size " << GetMemMap()->Size(); 187 VLOG(heap) << "GrowthLimit " << PrettySize(growth_limit); 188 VLOG(heap) << "Capacity " << PrettySize(capacity); 213 VLOG(heap) << "Failed creating zygote space from space " << GetName(); 215 VLOG(heap) << "zygot [all...] |
H A D | dlmalloc_space.cc | 21 #include "gc/heap.h" 81 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { 105 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { 116 // morecore_start. Don't use an internal dlmalloc lock (as we already hold heap lock). When 120 // Do not allow morecore requests to succeed beyond the initial size of the heap 163 CHECK(Contains(ptr)) << "Free (" << ptr << ") not in bounds of heap " << *this; 200 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this; 218 Heap* heap = Runtime::Current()->GetHeap(); local 219 DlMallocSpace* dlmalloc_space = heap->GetDlMallocSpace(); 223 for (space::ContinuousSpace* space : heap [all...] |
H A D | rosalloc_space.cc | 22 #include "gc/heap.h" 92 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { 118 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { 177 CHECK(Contains(ptr)) << "Free (" << ptr << ") not in bounds of heap " << *this; 211 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this; 229 Heap* heap = Runtime::Current()->GetHeap(); local 230 RosAllocSpace* rosalloc_space = heap->GetRosAllocSpace(rosalloc); 237 VLOG(heap) << "RosAllocSpace::Trim() "; 267 VLOG(heap) << "RosAllocSpace::SetFootprintLimit " << PrettySize(new_size); 268 // Compare against the actual footprint, rather than the Size(), because the heap ma [all...] |
/art/runtime/native/ |
H A D | dalvik_system_VMDebug.cc | 44 "hprof-heap-dump", 45 "hprof-heap-dump-streaming", 250 gc::Heap* heap = Runtime::Current()->GetHeap(); local 251 // We only want reachable instances, so do a GC. Heap::VisitObjects visits all of the heap 253 heap->CollectGarbage(false); 261 heap->CountInstances(classes, countAssignable, &count); 265 // We export the VM internal per-heap-space size/alloc/free metrics 266 // for the zygote space, alloc space (application heap), and the large 282 gc::Heap* heap = Runtime::Current()->GetHeap(); local 283 for (gc::space::ContinuousSpace* space : heap [all...] |
/art/runtime/entrypoints/ |
H A D | entrypoint_utils.cc | 90 gc::Heap* heap = Runtime::Current()->GetHeap(); local 92 // the heap switched the allocator type while we were suspended. 94 heap->GetCurrentAllocator()); 109 gc::Heap* heap = Runtime::Current()->GetHeap(); local 111 // the heap switched the allocator type while we were suspended. 113 heap->GetCurrentAllocator());
|