| /art/tools/ahat/src/main/com/android/ahat/ |
| D | HeapTable.java | 44 long getSize(T element, AhatHeap heap); in getSize() argument
57 for (AhatHeap heap : snapshot.getHeaps()) { in render()
58 if (hasNonZeroEntry(heap, config, elements)) { in render()
59 heaps.add(heap); in render()
67 for (AhatHeap heap : heaps) { in render()
68 subcols.add(new Column(heap.getName(), Column.Align.RIGHT)); in render()
88 for (AhatHeap heap : heaps) { in render()
89 long size = config.getSize(elem, heap); in render()
90 long basesize = config.getSize(base, heap.getBaseline()); in render()
110 for (AhatHeap heap : heaps) { in render()
[all …]
|
| D | OverviewHandler.java | 62 for (AhatHeap heap : mSnapshot.getHeaps()) { in printHeapSizes()
63 Size size = heap.getSize(); in printHeapSizes()
64 Size base = heap.getBaseline().getSize(); in printHeapSizes()
66 SizeTable.row(doc, DocString.text(heap.getName()), size, base); in printHeapSizes()
|
| D | SiteHandler.java | 63 public long getSize(Site element, AhatHeap heap) { in handle()
64 return element.getSize(heap).getSize(); in handle()
104 site.getId(), info.heap.getName(), className), in handle()
107 DocString.text(info.heap.getName()), in handle()
|
| D | DominatedList.java | 57 public long getSize(AhatInstance element, AhatHeap heap) { in getSize() argument
58 return element.getRetainedSize(heap).getSize(); in getSize()
|
| /art/tools/amm/models/ |
| D | JavaHeap.md | 3 The value of the Java heap model is the sum of bytes of Java objects allocated
4 on the Java heap. It can be calculated using:
8 A Java heap dump is used for an actionable breakdown of the Java heap.
|
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| D | Site.java | 77 public AhatHeap heap; field in Site.ObjectsInfo
100 ObjectsInfo(AhatHeap heap, AhatClassObj classObj) { in ObjectsInfo() argument
101 this.heap = heap; in ObjectsInfo()
217 AhatHeap heap = inst.getHeap(); in prepareForUse() local
219 ObjectsInfo info = getObjectsInfo(heap, inst.getClassObj()); in prepareForUse()
222 mSizesByHeap[heap.getIndex()] = mSizesByHeap[heap.getIndex()].plus(size); in prepareForUse()
230 ObjectsInfo info = getObjectsInfo(childInfo.heap, childInfo.classObj); in prepareForUse()
249 public Size getSize(AhatHeap heap) { in getSize() argument
250 return mSizesByHeap[heap.getIndex()]; in getSize()
284 ObjectsInfo getObjectsInfo(AhatHeap heap, AhatClassObj classObj) { in getObjectsInfo() argument
[all …]
|
| D | AhatSnapshot.java | 60 for (AhatHeap heap : mHeaps) { in AhatSnapshot()
61 heap.addToSize(mSuperRoot.getRetainedSize(heap)); in AhatSnapshot()
103 for (AhatHeap heap : getHeaps()) { in getHeap()
104 if (heap.getName().equals(name)) { in getHeap()
105 return heap; in getHeap()
|
| D | Sort.java | 68 public InstanceByHeapRetainedSize(AhatHeap heap) { in InstanceByHeapRetainedSize() argument
69 mHeap = heap; in InstanceByHeapRetainedSize()
165 public SiteByHeapSize(AhatHeap heap) { in SiteByHeapSize() argument
166 mHeap = heap; in SiteByHeapSize()
231 return a.heap.getName().compareTo(b.heap.getName());
|
| /art/runtime/gc/ |
| D | allocation_record.cc | 142 VLOG(heap) << "Start SweepAllocationRecords()"; in SweepAllocationRecords()
170 VLOG(heap) << "Deleted " << count_deleted << " allocation records"; in SweepAllocationRecords()
171 VLOG(heap) << "Updated " << count_moved << " allocation records"; in SweepAllocationRecords()
219 Heap* heap = Runtime::Current()->GetHeap(); in SetAllocTrackingEnabled() local
223 if (heap->IsAllocTrackingEnabled()) { in SetAllocTrackingEnabled()
226 AllocRecordObjectMap* records = heap->GetAllocationRecords(); in SetAllocTrackingEnabled()
229 heap->SetAllocationRecords(records); in SetAllocTrackingEnabled()
247 heap->SetAllocTrackingEnabled(true); in SetAllocTrackingEnabled()
254 if (!heap->IsAllocTrackingEnabled()) { in SetAllocTrackingEnabled()
257 heap->SetAllocTrackingEnabled(false); in SetAllocTrackingEnabled()
[all …]
|
| D | heap_test.cc | 52 Heap* heap = Runtime::Current()->GetHeap(); in TEST_F() local
53 int64_t max_memory_before = heap->GetMaxMemory(); in TEST_F()
54 int64_t total_memory_before = heap->GetTotalMemory(); in TEST_F()
55 heap->ClearGrowthLimit(); in TEST_F()
56 int64_t max_memory_after = heap->GetMaxMemory(); in TEST_F()
57 int64_t total_memory_after = heap->GetTotalMemory(); in TEST_F()
|
| D | verification.h | 40 explicit Verification(gc::Heap* heap) : heap_(heap) {} in Verification() argument
|
| /art/tools/ahat/ |
| D | README.txt | 5 Launch an http server for viewing the given Android heap dump FILE.
11 Use the proguard map FILE to deobfuscate the heap dump.
13 Diff the heap dump against the given baseline heap dump FILE.
15 Use the proguard map FILE to deobfuscate the baseline heap dump.
19 * Dim 'image' and 'zygote' heap sizes slightly? Why do we even show these?
22 * Show site context and heap and class filter in "Objects" view?
27 * For HeapTable with single heap shown, the heap name isn't centered?
42 * That we can open a hprof without an 'app' heap and show a tabulation of
43 objects normally sorted by 'app' heap by default.
87 Add support for diffing two heap dumps.
[all …]
|
| /art/runtime/native/ |
| D | dalvik_system_VMDebug.cc | 279 gc::Heap* const heap = Runtime::Current()->GetHeap(); in VMDebug_countInstancesOfClass() local
288 heap->CountInstances(classes, countAssignable, &count); in VMDebug_countInstancesOfClass()
297 gc::Heap* const heap = Runtime::Current()->GetHeap(); in VMDebug_countInstancesOfClasses() local
311 heap->CountInstances(classes, countAssignable, &counts[0]); in VMDebug_countInstancesOfClasses()
347 gc::Heap* const heap = Runtime::Current()->GetHeap(); in VMDebug_getInstancesOfClasses() local
354 heap->GetInstances(hs2, h_class, includeAssignable, /* max_count */ 0, raw_instances); in VMDebug_getInstancesOfClasses()
387 gc::Heap* heap = Runtime::Current()->GetHeap(); in VMDebug_getHeapSpaceStats() local
390 for (gc::space::ContinuousSpace* space : heap->GetContinuousSpaces()) { in VMDebug_getHeapSpaceStats()
408 for (gc::space::DiscontinuousSpace* space : heap->GetDiscontinuousSpaces()) { in VMDebug_getHeapSpaceStats()
446 gc::Heap* heap = Runtime::Current()->GetHeap(); in VMDebug_getRuntimeStatInternal() local
[all …]
|
| /art/test/104-growth-limit/ |
| D | info.txt | 2 conventions, can be cleared and the resulting heap is at least as large
3 as the growth limited heap.
|
| /art/runtime/gc/accounting/ |
| D | mod_union_table-inl.h | 32 Heap* heap, in ModUnionTableToZygoteAllocspace() argument
34 : ModUnionTableReferenceCache(name, heap, space) {} in ModUnionTableToZygoteAllocspace()
|
| D | mod_union_table.h | 59 explicit ModUnionTable(const std::string& name, Heap* heap, space::ContinuousSpace* space) in ModUnionTable() argument
61 heap_(heap), in ModUnionTable()
121 explicit ModUnionTableReferenceCache(const std::string& name, Heap* heap, in ModUnionTableReferenceCache() argument
123 : ModUnionTable(name, heap, space) {} in ModUnionTableReferenceCache()
169 explicit ModUnionTableCardCache(const std::string& name, Heap* heap,
|
| D | remembered_set.h | 50 explicit RememberedSet(const std::string& name, Heap* heap, space::ContinuousSpace* space) in RememberedSet() argument
51 : name_(name), heap_(heap), space_(space) {} in RememberedSet()
|
| /art/tools/cpp-define-generator/ |
| D | constant_heap.def | 17 // Export heap values.
20 #include "gc/heap.h"
23 // Size of references to the heap on the stack.
|
| /art/runtime/gc/collector/ |
| D | partial_mark_sweep.cc | 28 PartialMarkSweep::PartialMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix) in PartialMarkSweep() argument
29 : MarkSweep(heap, is_concurrent, name_prefix.empty() ? "partial " : name_prefix) { in PartialMarkSweep()
|
| D | sticky_mark_sweep.cc | 31 StickyMarkSweep::StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix) in StickyMarkSweep() argument
32 : PartialMarkSweep(heap, is_concurrent, name_prefix.empty() ? "sticky " : name_prefix) { in StickyMarkSweep()
|
| /art/runtime/ |
| D | read_barrier-inl.h | 80 gc::Heap* heap = Runtime::Current()->GetHeap(); in Barrier() local
81 if (heap != nullptr && heap->GetReadBarrierTable()->IsSet(old_ref)) { in Barrier()
208 gc::Heap* heap = Runtime::Current()->GetHeap(); in IsDuringStartup() local
209 if (heap == nullptr) { in IsDuringStartup()
213 if (heap->CurrentCollectorType() != gc::kCollectorTypeCC) { in IsDuringStartup()
217 gc::collector::ConcurrentCopying* collector = heap->ConcurrentCopyingCollector(); in IsDuringStartup()
|
| /art/runtime/gc/space/ |
| D | malloc_space.cc | 139 VLOG(heap) << "MallocSpace::MoreCore " << PrettySize(increment); in MoreCore()
183 VLOG(heap) << "Begin " << reinterpret_cast<const void*>(begin_) << "\n" in CreateZygoteSpace()
191 VLOG(heap) << "Creating new AllocSpace: "; in CreateZygoteSpace()
192 VLOG(heap) << "Size " << GetMemMap()->Size(); in CreateZygoteSpace()
193 VLOG(heap) << "GrowthLimit " << PrettySize(growth_limit); in CreateZygoteSpace()
194 VLOG(heap) << "Capacity " << PrettySize(capacity); in CreateZygoteSpace()
219 VLOG(heap) << "Failed creating zygote space from space " << GetName(); in CreateZygoteSpace()
221 VLOG(heap) << "zygote space creation done"; in CreateZygoteSpace()
|
| /art/runtime/mirror/ |
| D | object.cc | 121 gc::Heap* heap = Runtime::Current()->GetHeap(); in CopyObject() local
127 heap->WriteBarrierArray(dest, 0, array->GetLength()); in CopyObject()
130 heap->WriteBarrierEveryFieldOf(dest); in CopyObject()
156 gc::Heap* heap = Runtime::Current()->GetHeap(); in Clone() local
162 if (heap->IsMovableObject(this)) { in Clone()
163 copy = heap->AllocObject<true>(self, GetClass(), num_bytes, visitor); in Clone()
165 copy = heap->AllocNonMovableObject<true>(self, GetClass(), num_bytes, visitor); in Clone()
168 heap->AddFinalizerReference(self, ©); in Clone()
|
| D | array.cc | 135 auto* heap = Runtime::Current()->GetHeap(); in CopyOf() local
136 gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() : in CopyOf()
137 heap->GetCurrentNonMovingAllocator(); in CopyOf()
|
| /art/test/617-clinit-oome/ |
| D | expected.txt | 1 Filling heap
|