| /external/v8/src/heap/ |
| incremental-marking-job.h | 13 class Heap;
25 static void Step(Heap* heap);
37 void Start(Heap* heap);
41 void ScheduleTask(Heap* heap);
|
| scavenger.h | 8 #include "src/heap/objects-visiting.h"
9 #include "src/heap/slot-set.h"
19 explicit Scavenger(Heap* heap) : heap_(heap) {}
24 // Callback function passed to Heap::Iterate etc. Copies an object if
26 // ensure the precondition that the object is (a) a heap object and (b) in
27 // the heap's from space.
29 static inline SlotCallbackResult CheckAndScavengeObject(Heap* heap,
40 Heap* heap() { return heap_; } function in class:v8::internal::Scavenger
[all...] |
| scavenge-job.h | 10 #include "src/heap/gc-tracer.h"
15 class Heap;
40 void ScheduleIdleTaskIfNeeded(Heap* heap, int bytes_allocated);
45 void RescheduleIdleTask(Heap* heap);
73 void ScheduleIdleTask(Heap* heap);
|
| array-buffer-tracker.h | 17 class Heap;
33 inline static void RegisterNew(Heap* heap, JSArrayBuffer* buffer);
34 inline static void Unregister(Heap* heap, JSArrayBuffer* buffer);
38 static void FreeDeadInNewSpace(Heap* heap);
68 explicit LocalArrayBufferTracker(Heap* heap) : heap_(heap) {}
[all...] |
| incremental-marking-job.cc | 5 #include "src/heap/incremental-marking-job.h"
8 #include "src/heap/heap-inl.h"
9 #include "src/heap/heap.h"
10 #include "src/heap/incremental-marking.h"
17 void IncrementalMarkingJob::Start(Heap* heap) {
18 DCHECK(!heap->incremental_marking()->IsStopped());
19 ScheduleTask(heap);
45 Heap* heap = isolate()->heap(); local
[all...] |
| heap-inl.h | 13 #include "src/heap/heap.h"
14 #include "src/heap/incremental-marking-inl.h"
15 #include "src/heap/mark-compact.h"
16 #include "src/heap/object-stats.h"
17 #include "src/heap/remembered-set.h"
18 #include "src/heap/spaces-inl.h"
19 #include "src/heap/store-buffer.h"
60 SemiSpace::AssertValidRange(target->GetIsolate()->heap()->new_space()->top(),
123 type* Heap::name() { return type::cast(roots_[k##camel_name##RootIndex]);
[all...] |
| memory-reducer.h | 16 class Heap;
113 explicit MemoryReducer(Heap* heap)
114 : heap_(heap),
139 Heap* heap() { return heap_; } function in class:v8::internal::MemoryReducer
161 Heap* heap_;
|
| objects-visiting.cc | 5 #include "src/heap/objects-visiting.h"
7 #include "src/heap/heap-inl.h"
8 #include "src/heap/mark-compact-inl.h"
9 #include "src/heap/objects-visiting-inl.h"
222 static bool MustRecordSlots(Heap* heap) {
223 return heap->gc_state() == Heap::MARK_COMPACT &&
224 heap->mark_compact_collector()->is_compacting()
[all...] |
| scavenge-job.cc | 5 #include "src/heap/scavenge-job.h"
8 #include "src/heap/heap-inl.h"
9 #include "src/heap/heap.h"
20 Heap* heap = isolate()->heap(); local
24 double start_ms = heap->MonotonicallyIncreasingTimeInMs();
27 heap->tracer()->ScavengeSpeedInBytesPerMillisecond()
[all...] |
| scavenger-inl.h | 8 #include "src/heap/scavenger.h"
14 DCHECK(object->GetIsolate()->heap()->InFromSpace(object));
16 // We use the first word (where the map pointer usually is) of a heap
26 DCHECK(object->GetIsolate()->heap()->InFromSpace(*p));
31 object->GetHeap()->UpdateAllocationSite<Heap::kGlobal>(
40 SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap,
44 if (heap->InFromSpace(object)) {
55 if (heap->InToSpace(object)) {
65 void StaticScavengeVisitor::VisitPointer(Heap* heap, HeapObject* obj
[all...] |
| /external/v8/src/snapshot/ |
| natives-common.cc | 7 #include "src/heap/heap.h"
15 FixedArray* NativesCollection<CORE>::GetSourceCache(Heap* heap) {
16 return heap->natives_source_cache();
21 FixedArray* NativesCollection<EXPERIMENTAL>::GetSourceCache(Heap* heap) {
22 return heap->experimental_natives_source_cache();
27 FixedArray* NativesCollection<EXTRAS>::GetSourceCache(Heap* heap) {
[all...] |
| /art/tools/cpp-define-generator/ |
| constant_heap.def | 17 // Export heap values.
20 #include "gc/heap.h"
23 // Size of references to the heap on the stack.
24 DEFINE_EXPR(MIN_LARGE_OBJECT_THRESHOLD, size_t, art::gc::Heap::kMinLargeObjectThreshold)
|
| /art/runtime/gc/accounting/ |
| remembered_set.h | 39 class Heap;
50 explicit RememberedSet(const std::string& name, Heap* heap, space::ContinuousSpace* space)
51 : name_(name), heap_(heap), space_(space) {}
67 Heap* GetHeap() const {
77 Heap* const heap_;
|
| mod_union_table-inl.h | 32 Heap* heap,
34 : ModUnionTableReferenceCache(name, heap, space) {}
|
| mod_union_table.h | 44 class Heap;
52 // A callback for visiting an object in the heap.
59 explicit ModUnionTable(const std::string& name, Heap* heap, space::ContinuousSpace* space)
61 heap_(heap),
104 Heap* GetHeap() const {
114 Heap* const heap_;
121 explicit ModUnionTableReferenceCache(const std::string& name, Heap* heap,
123 : ModUnionTable(name, heap, space) {
[all...] |
| heap_bitmap.h | 30 class Heap;
66 explicit HeapBitmap(Heap* heap) : heap_(heap) {}
69 const Heap* const heap_;
86 friend class art::gc::Heap;
|
| /external/v8/src/ |
| address-map.cc | 6 #include "src/heap/heap.h"
17 for (uint32_t i = 0; i < Heap::kStrongRootListLength; i++) {
18 Heap::RootListIndex root_index = static_cast<Heap::RootListIndex>(i);
19 Object* root = isolate->heap()->root(root_index);
23 if (isolate->heap()->RootCanBeTreatedAsConstant(root_index)) {
36 CHECK(!Heap::RootIsImmortalImmovable(root_index));
|
| /art/runtime/gc/collector/ |
| partial_mark_sweep.h | 33 PartialMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix = "");
|
| /system/core/libmemunreachable/ |
| Allocator.h | 42 class Heap {
44 Heap();
45 ~Heap();
48 Heap(const Heap& other) : impl_(other.impl_), owns_impl_(false) {}
51 Heap& operator=(const Heap&) = delete;
70 bool operator==(const Heap& other) const { return impl_ == other.impl_; }
71 bool operator!=(const Heap& other) const { return !(*this == other); }
100 // STLAllocator implements the std allocator interface on top of a Heap
[all...] |
| /art/runtime/ |
| runtime_options.def | 48 RUNTIME_OPTIONS_KEY (MemoryKiB, MemoryMaximumSize, gc::Heap::kDefaultMaximumSize) // -Xmx
49 RUNTIME_OPTIONS_KEY (MemoryKiB, MemoryInitialSize, gc::Heap::kDefaultInitialSize) // -Xms
51 RUNTIME_OPTIONS_KEY (MemoryKiB, HeapMinFree, gc::Heap::kDefaultMinFree)
52 RUNTIME_OPTIONS_KEY (MemoryKiB, HeapMaxFree, gc::Heap::kDefaultMaxFree)
53 RUNTIME_OPTIONS_KEY (MemoryKiB, NonMovingSpaceCapacity, gc::Heap::kDefaultNonMovingSpaceCapacity)
54 RUNTIME_OPTIONS_KEY (double, HeapTargetUtilization, gc::Heap::kDefaultTargetUtilization)
55 RUNTIME_OPTIONS_KEY (double, ForegroundHeapGrowthMultiplier, gc::Heap::kDefaultHeapGrowthMultiplier)
61 LongPauseLogThreshold, gc::Heap::kDefaultLongPauseLogThreshold)
63 LongGCLogThreshold, gc::Heap::kDefaultLongGCLogThreshold)
96 LargeObjectSpace, gc::Heap::kDefaultLargeObjectSpaceType
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/IScsiDxe/ |
| IScsiIbft.c | 84 Add one item into the heap.
86 @param[in, out] Heap On input, the current address of the heap; On output, the address of
87 the heap after the item is added.
88 @param[in] Data The data to add into the heap.
93 IN OUT UINT8 **Heap,
101 *Heap -= Len + 1;
103 CopyMem (*Heap, Data, Len);
104 *(*Heap + Len) = 0;
111 @param[in, out] Heap The heap.
[all...] |
| /device/linaro/bootloader/edk2/NetworkPkg/IScsiDxe/ |
| IScsiIbft.c | 94 Add one item into the heap.
96 @param[in, out] Heap On input, the current address of the heap. On output, the address of
97 the heap after the item is added.
98 @param[in] Data The data to add into the heap.
104 IN OUT UINT8 **Heap,
112 *Heap -= Len + 1;
114 CopyMem (*Heap, Data, Len);
115 *(*Heap + Len) = 0;
123 @param[in, out] Heap The heap.
[all...] |
| /external/valgrind/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...] |
| /art/runtime/gc/ |
| verification.h | 36 class Heap;
40 explicit Verification(gc::Heap* heap) : heap_(heap) {}
73 gc::Heap* const heap_;
|
| heap-visit-objects-inl.h | 20 #include "heap.h"
38 inline void Heap::VisitObjects(Visitor&& visitor) {
72 inline void Heap::VisitObjectsPaused(Visitor&& visitor) {
81 inline void Heap::VisitObjectsInternalRegionSpace(Visitor&& visitor) {
106 inline void Heap::VisitObjectsInternal(Visitor&& visitor) {
146 DCHECK(Heap::rosalloc_space_ == nullptr)
|
