| /dalvik/hit/src/com/android/hit/ |
| State.java | 26 * During parsing of the HPROF file HEAP_DUMP_INFO chunks change which heap
30 HashMap<Integer, Heap> mHeaps;
31 Heap mCurrentHeap;
34 mHeaps = new HashMap<Integer, Heap>();
38 public Heap setToDefaultHeap() {
42 public Heap setHeapTo(int id, String name) {
43 Heap heap = mHeaps.get(id); local
45 if (heap == null) {
46 heap = new Heap(name)
[all...] |
| Instance.java | 32 // The heap in which this object was allocated (app, zygote, etc)
33 Heap mHeap;
47 * called on all heap objects so that they can resolve their internal
52 * for in a heap other than the one this Instance is in.
89 public void setHeap(Heap heap) {
90 mHeap = heap;
|
| /art/runtime/gc/accounting/ |
| mod_union_table.h | 42 class Heap;
55 explicit ModUnionTable(Heap* heap) : heap_(heap) {}
79 Heap* GetHeap() const {
84 Heap* const heap_;
90 explicit ModUnionTableReferenceCache(Heap* heap) : ModUnionTable(heap) {}
127 explicit ModUnionTableCardCache(Heap* heap) : ModUnionTable(heap) {
[all...] |
| heap_bitmap.h | 28 class Heap;
102 explicit HeapBitmap(Heap* heap) : heap_(heap) {}
105 const Heap* const heap_;
116 friend class art::gc::Heap;
|
| mod_union_table-inl.h | 31 explicit ModUnionTableToZygoteAllocspace(Heap* heap) : ModUnionTableReferenceCache(heap) {}
50 explicit ModUnionTableToAllocspace(Heap* heap) : ModUnionTableReferenceCache(heap) {}
|
| /art/runtime/gc/collector/ |
| garbage_collector.h | 30 class Heap;
39 GarbageCollector(Heap* heap, const std::string& name);
51 Heap* GetHeap() const {
97 Heap* const heap_;
|
| partial_mark_sweep.h | 33 explicit PartialMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix = "");
|
| partial_mark_sweep.cc | 19 #include "gc/heap.h"
28 PartialMarkSweep::PartialMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix)
29 : MarkSweep(heap, is_concurrent, name_prefix + (name_prefix.empty() ? "" : " ") + "partial") {
|
| sticky_mark_sweep.h | 34 explicit StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix = "");
|
| /external/v8/src/ |
| heap-inl.h | 31 #include "heap.h"
72 SemiSpace::AssertValidRange(HEAP->new_space()->top(),
85 MaybeObject* Heap::AllocateStringFromUtf8(Vector<const char> str,
98 MaybeObject* Heap::AllocateSymbol(Vector<const char> str,
107 MaybeObject* Heap::AllocateAsciiSymbol(Vector<const char> str,
141 MaybeObject* Heap::AllocateTwoByteSymbol(Vector<const uc16> str,
173 MaybeObject* Heap::CopyFixedArray(FixedArray* src) {
178 MaybeObject* Heap::CopyFixedDoubleArray(FixedDoubleArray* src) {
183 MaybeObject* Heap::AllocateRaw(int size_in_bytes,
194 Heap::allocation_timeout_-- <= 0)
[all...] |
| mark-compact-inl.h | 48 sweep_precisely_ = ((flags & Heap::kSweepPreciselyMask) != 0);
49 reduce_memory_footprint_ = ((flags & Heap::kReduceMemoryFootprintMask) != 0);
51 ((flags & Heap::kAbortIncrementalMarkingMask) != 0);
|
| heap.cc | 38 #include "heap-profiler.h"
66 Heap::Heap()
140 previous_survival_rate_trend_(Heap::STABLE),
141 survival_rate_trend_(Heap::STABLE),
183 intptr_t Heap::Capacity() {
195 intptr_t Heap::CommittedMemory() {
207 intptr_t Heap::CommittedMemoryExecutable() {
214 intptr_t Heap::Available() {
226 bool Heap::HasBeenSetUp()
1625 Heap* heap = map->GetHeap(); local
1753 Heap* heap = map->GetHeap(); local
6315 Heap* heap = Isolate::Current()->heap(); local
[all...] |
| /external/valgrind/main/exp-sgcheck/ |
| pc_common.c | 139 } Heap;
184 xe.XE.Heap.addr = a;
185 xe.XE.Heap.sszB = is_write ? -size : size;
186 xe.XE.Heap.vseg = vseg;
352 Addr a = xe->XE.Heap.addr;
353 Seg* vseg = xe->XE.Heap.vseg;
363 readwrite(xe->XE.Heap.sszB),
364 Word__abs(xe->XE.Heap.sszB) );
373 readwrite(xe->XE.Heap.sszB),
374 Word__abs(xe->XE.Heap.sszB) )
[all...] |
| /external/chromium_org/v8/src/ |
| marking-thread.h | 38 #include "heap.h"
60 Heap* heap_;
|
| heap-inl.h | 31 #include "heap.h"
72 SemiSpace::AssertValidRange(HEAP->new_space()->top(),
85 MaybeObject* Heap::AllocateStringFromUtf8(Vector<const char> str,
102 bool inline Heap::IsOneByte(Vector<const char> str, int chars) {
110 bool inline Heap::IsOneByte(String* str, int chars) {
115 MaybeObject* Heap::AllocateInternalizedStringFromUtf8(
126 MaybeObject* Heap::AllocateInternalizedStringImpl(
135 MaybeObject* Heap::AllocateOneByteInternalizedString(Vector<const uint8_t> str,
169 MaybeObject* Heap::AllocateTwoByteInternalizedString(Vector<const uc16> str,
201 MaybeObject* Heap::CopyFixedArray(FixedArray* src)
[all...] |
| objects-visiting.h | 215 INLINE(static void IteratePointers(Heap* heap,
223 StaticVisitor::VisitPointers(heap, start_slot, end_slot);
293 INLINE(static void VisitPointers(Heap* heap, Object** start, Object** end)) {
294 for (Object** p = start; p < end; p++) StaticVisitor::VisitPointer(heap, p);
299 Heap* heap = map->GetHeap(); local
300 VisitPointers(heap,
307 heap,
[all...] |
| heap.cc | 39 #include "heap-profiler.h"
66 Heap::Heap()
139 previous_survival_rate_trend_(Heap::STABLE),
140 survival_rate_trend_(Heap::STABLE),
196 intptr_t Heap::Capacity() {
209 intptr_t Heap::CommittedMemory() {
223 size_t Heap::CommittedPhysicalMemory() {
237 intptr_t Heap::CommittedMemoryExecutable() {
244 intptr_t Heap::Available()
2086 Heap* heap = map->GetHeap(); local
2226 Heap* heap = map->GetHeap(); local
7277 Heap* heap = Isolate::Current()->heap(); local
[all...] |
| mark-compact-inl.h | 48 sweep_precisely_ = ((flags & Heap::kSweepPreciselyMask) != 0);
49 reduce_memory_footprint_ = ((flags & Heap::kReduceMemoryFootprintMask) != 0);
51 ((flags & Heap::kAbortIncrementalMarkingMask) != 0);
61 ASSERT(HEAP->Contains(obj));
|
| sweeper-thread.h | 38 #include "heap.h"
61 Heap* heap_;
|
| heap-profiler.h | 31 #include "heap-snapshot-generator-inl.h"
40 #define HEAP_PROFILE(heap, call) \
42 v8::internal::HeapProfiler* profiler = heap->isolate()->heap_profiler(); \
50 explicit HeapProfiler(Heap* heap);
86 Heap* heap() const { return snapshots_->heap(); } function in class:v8::internal::HeapProfiler
|
| /external/openfst/src/include/fst/ |
| heap.h | 19 // Implementation of a heap as in STL, but allows tracking positions
20 // in heap using a key. The key can be used to do an in-place update of
21 // values in the heap.
34 // \class Heap
35 // \brief A templated heap implementation that support in-place update
38 // The templated heap implementation is a little different from the
39 // STL priority_queue and the *_heap operations in STL. This heap
40 // supports indexing of values in the heap via an associated key.
43 // to the calling functions on heap insert. This key can be used
44 // to later update the specific value in the heap
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| heap.h | 0 // heap.h
17 // Implementation of a heap as in STL, but allows tracking positions
18 // in heap using a key. The key can be used to do an in place update of
19 // values in the heap.
30 // \class Heap
31 // \brief A templated heap implementation that support in place update
34 // The templated heap implementation is a little different from the
35 // STL priority_queue and the *_heap operations in STL. The heap
36 // supports indexing of values in the heap via an associated key.
39 // to the calling functions on heap insert. This key can be use
[all...] |
| /external/v8/src/extensions/ |
| gc-extension.cc | 43 HEAP->CollectAllGarbage(Heap::kNoGCFlags, "gc extension");
|
| /art/runtime/gc/ |
| heap.cc | 17 #include "heap.h"
69 Heap::Heap(size_t initial_size, size_t growth_limit, size_t min_free, size_t max_free,
122 * causes a lot of GC since we do a GC for alloc whenever the stack is full. When heap
140 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {
141 LOG(INFO) << "Heap() entering";
183 // Compute heap capacity. Continuous spaces are sorted in order of Begin().
212 // now. We don't create it earlier to make it clear that you can't use locks during heap
241 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {
242 LOG(INFO) << "Heap() exiting"
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-weakmaps.cc | 44 Heap* heap = isolate->heap(); local
49 Object* table_obj = ObjectHashTable::Allocate(heap, 1)->ToObjectChecked();
81 Heap* heap = isolate->heap(); local
106 heap->CollectAllGarbage(false);
124 heap->CollectAllGarbage(false);
129 heap->CollectAllGarbage(false)
141 Heap* heap = isolate->heap(); local
182 Heap* heap = isolate->heap(); local
221 Heap* heap = isolate->heap(); local
[all...] |
