Searched defs:heap (Results 1 - 25 of 60) sorted by relevance

123

/art/runtime/gc/accounting/
H A Dmod_union_table-inl.h32 Heap* heap,
34 : ModUnionTableReferenceCache(name, heap, space) {}
31 ModUnionTableToZygoteAllocspace(const std::string& name, Heap* heap, space::ContinuousSpace* space) argument
H A Dheap_bitmap.h67 explicit HeapBitmap(Heap* heap) : heap_(heap) {} argument
H A Dremembered_set.h50 explicit RememberedSet(const std::string& name, Heap* heap, space::ContinuousSpace* space) argument
51 : name_(name), heap_(heap), space_(space) {}
H A Dmod_union_table.h51 explicit ModUnionTable(const std::string& name, Heap* heap, space::ContinuousSpace* space) argument
53 heap_(heap),
113 explicit ModUnionTableReferenceCache(const std::string& name, Heap* heap, argument
115 : ModUnionTable(name, heap, space) {}
161 explicit ModUnionTableCardCache(const std::string& name, Heap* heap,
H A Dmod_union_table_test.cc121 const std::string& name, Heap* heap, space::ContinuousSpace* space,
123 : ModUnionTableReferenceCache(name, heap, space), target_space_(target_space) {}
181 gc::Heap* const heap = runtime->GetHeap(); member in class:art::gc::accounting::gc
183 auto* space = heap->GetNonMovingSpace();
192 heap->AddSpace(other_space.get());
264 heap->RemoveSpace(other_space.get());
120 ModUnionTableRefCacheToSpace( const std::string& name, Heap* heap, space::ContinuousSpace* space, space::ContinuousSpace* target_space) argument
/art/runtime/gc/collector/
H A Dpartial_mark_sweep.cc19 #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 Dsticky_mark_sweep.cc17 #include "gc/heap.h"
27 StickyMarkSweep::StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix) argument
28 : PartialMarkSweep(heap, is_concurrent, name_prefix.empty() ? "sticky " : name_prefix) {
H A Dgarbage_collector.cc31 #include "gc/heap.h"
43 : duration_ns_(0), timings_("GC iteration timing logger", true, VLOG_IS_ON(heap)) {
63 GarbageCollector::GarbageCollector(Heap* heap, const std::string& name) argument
64 : heap_(heap),
/art/runtime/gc/
H A Dverification.h40 explicit Verification(gc::Heap* heap) : heap_(heap) {} argument
H A Dheap_test.cc33 Heap* heap = Runtime::Current()->GetHeap(); local
34 int64_t max_memory_before = heap->GetMaxMemory();
35 int64_t total_memory_before = heap->GetTotalMemory();
36 heap->ClearGrowthLimit();
37 int64_t max_memory_after = heap->GetMaxMemory();
38 int64_t total_memory_after = heap->GetTotalMemory();
H A Dreference_queue.cc21 #include "heap.h"
75 Heap* heap = Runtime::Current()->GetHeap(); local
76 if (kUseBakerOrBrooksReadBarrier && heap->CurrentCollectorType() == kCollectorTypeCC &&
77 heap->ConcurrentCopyingCollector()->IsActive()) {
82 collector::ConcurrentCopying* concurrent_copying = heap->ConcurrentCopyingCollector();
H A Dallocation_record.cc140 VLOG(heap) << "Start SweepAllocationRecords()";
168 VLOG(heap) << "Deleted " << count_deleted << " allocation records";
169 VLOG(heap) << "Updated " << count_moved << " allocation records";
217 Heap* heap = Runtime::Current()->GetHeap(); local
221 if (heap->IsAllocTrackingEnabled()) {
224 AllocRecordObjectMap* records = heap->GetAllocationRecords();
227 heap->SetAllocationRecords(records);
245 heap->SetAllocTrackingEnabled(true);
252 if (!heap->IsAllocTrackingEnabled()) {
255 heap
279 Heap* const heap = Runtime::Current()->GetHeap(); local
[all...]
/art/tools/ahat/src/
H A DDominatedList.java57 public long getSize(AhatInstance element, AhatHeap heap) { argument
58 return element.getRetainedSize(heap);
H A DHeapTable.java28 * Class for rendering a table that includes sizes of some kind for each heap.
32 * Configuration for a value column of a heap table.
44 long getSize(T element, AhatHeap heap); argument
67 for (AhatHeap heap : snapshot.getHeaps()) {
68 if (hasNonZeroEntry(heap, config, elements)) {
69 heaps.add(heap);
75 // Print the heap and values descriptions.
77 for (AhatHeap heap : heaps) {
78 subcols.add(new Column(heap.getName(), Column.Align.RIGHT));
98 for (AhatHeap heap
159 hasNonZeroEntry(AhatHeap heap, TableConfig<T> config, List<T> elements) argument
[all...]
/art/tools/ahat/src/heapdump/
H A DAhatPlaceHolderInstance.java36 @Override public long getRetainedSize(AhatHeap heap) { argument
H A DAhatPlaceHolderClassObj.java36 @Override public long getRetainedSize(AhatHeap heap) { argument
H A DSort.java49 * Compare instances by their retained size for a given heap index.
57 public InstanceByHeapRetainedSize(AhatHeap heap) { argument
58 mHeap = heap;
96 // Priority goes to the app heap, if we can find one.
108 * Compare Sites by the size of objects allocated on a given heap.
109 * Different object infos with the same size on the given heap are
116 public SiteByHeapSize(AhatHeap heap) { argument
117 mHeap = heap;
140 // Priority goes to the app heap, if we can find one.
166 * Compare Site.ObjectsInfo by heap nam
[all...]
/art/runtime/mirror/
H A Darray.cc135 auto* heap = Runtime::Current()->GetHeap(); local
136 gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() :
137 heap->GetCurrentNonMovingAllocator();
H A Dobject.cc29 #include "gc/heap.h"
120 gc::Heap* heap = Runtime::Current()->GetHeap(); local
126 heap->WriteBarrierArray(dest, 0, array->GetLength());
129 heap->WriteBarrierEveryFieldOf(dest);
155 gc::Heap* heap = Runtime::Current()->GetHeap(); local
161 if (heap->IsMovableObject(this)) {
162 copy = heap->AllocObject<true>(self, GetClass(), num_bytes, visitor);
164 copy = heap->AllocNonMovableObject<true>(self, GetClass(), num_bytes, visitor);
167 heap->AddFinalizerReference(self, &copy);
/art/runtime/
H A Dread_barrier-inl.h23 #include "gc/heap.h"
77 // The heap or the collector can be null at startup. TODO: avoid the need for this null check.
78 gc::Heap* heap = Runtime::Current()->GetHeap(); local
79 if (heap != nullptr && heap->GetReadBarrierTable()->IsSet(old_ref)) {
206 gc::Heap* heap = Runtime::Current()->GetHeap(); local
207 if (heap == nullptr) {
208 // During startup, the heap can be null.
211 if (heap->CurrentCollectorType() != gc::kCollectorTypeCC) {
215 gc::collector::ConcurrentCopying* collector = heap
[all...]
/art/compiler/optimizing/
H A Dintrinsics.cc233 gc::Heap* heap = runtime->GetHeap(); local
240 if (!heap->ObjectIsInBootImageSpace(info.integer_cache) || !info.integer_cache->IsInitialized()) {
249 if (!heap->ObjectIsInBootImageSpace(info.integer) || !info.integer->IsInitialized()) {
264 if (!heap->ObjectIsInBootImageSpace(info.cache)) {
/art/runtime/base/
H A Dlogging.h43 bool heap; member in struct:art::LogVerbosity
/art/runtime/gc/space/
H A Dspace_create_test.cc97 // Make space findable to the heap, will also delete space when runtime is cleaned up
171 gc::Heap* heap = Runtime::Current()->GetHeap(); local
176 heap->RemoveSpace(old_space);
178 heap->RevokeAllThreadLocalBuffers();
180 heap->IsLowMemoryMode(),
186 // Make space findable to the heap, will also delete space when runtime is cleaned up
233 // Make space findable to the heap, will also delete space when runtime is cleaned up
307 // Make space findable to the heap, will also delete space when runtime is cleaned up
H A Dspace_test.h43 Heap* heap = Runtime::Current()->GetHeap(); local
45 heap->RevokeAllThreadLocalBuffers();
50 heap->AddSpace(space);
52 heap->SetSpaceAsDefault(space);
112 // Like the proper heap object allocation, install and verify
334 // Make space findable to the heap, will also delete space when runtime is cleaned up
/art/patchoat/
H A Dpatchoat.h28 #include "gc/heap.h"
59 gc::accounting::ContinuousSpaceBitmap* bitmap, MemMap* heap, off_t delta,
61 : image_(image), bitmap_(bitmap), heap_(heap),
156 // change the heap.
178 // The bitmap over the image within the heap we are patching. This is not modified.
180 // The heap we are patching. This is not modified.
58 PatchOat(InstructionSet isa, MemMap* image, gc::accounting::ContinuousSpaceBitmap* bitmap, MemMap* heap, off_t delta, std::map<gc::space::ImageSpace*, std::unique_ptr<MemMap>>* map, TimingLogger* timings) argument

Completed in 185 milliseconds

123