| /external/v8/test/unittests/heap/ |
| heap-unittest.cc | 14 #include "src/heap/heap.h"
33 TEST(Heap, HeapGrowingFactor) {
34 CheckEqualRounded(Heap::kMaxHeapGrowingFactor,
35 Heap::HeapGrowingFactor(34, 1));
36 CheckEqualRounded(3.553, Heap::HeapGrowingFactor(45, 1));
37 CheckEqualRounded(2.830, Heap::HeapGrowingFactor(50, 1));
38 CheckEqualRounded(1.478, Heap::HeapGrowingFactor(100, 1));
39 CheckEqualRounded(1.193, Heap::HeapGrowingFactor(200, 1));
40 CheckEqualRounded(1.121, Heap::HeapGrowingFactor(300, 1))
[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...] |
| natives.h | 46 static FixedArray* GetSourceCache(Heap* heap);
47 static void UpdateSourceCache(Heap* heap);
|
| /external/v8/src/heap/ |
| incremental-marking-job.h | 13 class Heap;
31 static Progress Step(Heap* heap, double deadline_in_ms);
43 static void Step(Heap* heap);
65 void Start(Heap* heap);
70 void ScheduleIdleTask(Heap* heap);
71 void ScheduleDelayedTask(Heap* heap)
[all...] |
| scavenger.h | 8 #include "src/heap/objects-visiting.h"
18 explicit Scavenger(Heap* heap) : heap_(heap) {}
23 // Callback function passed to Heap::Iterate etc. Copies an object if
25 // ensure the precondition that the object is (a) a heap object and (b) in
26 // the heap's from space.
33 // of the heap (i.e. incremental marking, logging and profiling).
37 Heap* heap() { return heap_; function in class:v8::internal::Scavenger
[all...] |
| array-buffer-tracker.h | 16 class Heap;
21 explicit ArrayBufferTracker(Heap* heap) : heap_(heap) {}
24 inline Heap* heap() { return heap_; } function in class:v8::internal::ArrayBufferTracker
50 Heap* heap_;
|
| scavenge-job.h | 9 #include "src/heap/gc-tracer.h"
14 class Heap;
39 void ScheduleIdleTaskIfNeeded(Heap* heap, int bytes_allocated);
44 void RescheduleIdleTask(Heap* heap);
72 void ScheduleIdleTask(Heap* heap);
|
| memory-reducer.h | 15 class Heap;
109 explicit MemoryReducer(Heap* heap)
110 : heap_(heap),
129 Heap* heap() { return heap_; } function in class:v8::internal::MemoryReducer
154 Heap* heap_;
|
| 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"
18 void IncrementalMarkingJob::Start(Heap* heap) {
19 DCHECK(!heap->incremental_marking()->IsStopped());
25 ScheduleIdleTask(heap);
94 Heap* heap = isolate()->heap(); local
130 Heap* heap = isolate()->heap(); local
[all...] |
| heap.cc | 5 #include "src/heap/heap.h"
20 #include "src/heap/array-buffer-tracker.h"
21 #include "src/heap/gc-idle-time-handler.h"
22 #include "src/heap/gc-tracer.h"
23 #include "src/heap/incremental-marking.h"
24 #include "src/heap/mark-compact-inl.h"
25 #include "src/heap/mark-compact.h"
26 #include "src/heap/memory-reducer.h"
27 #include "src/heap/object-stats.h
[all...] |
| heap-inl.h | 12 #include "src/heap/heap.h"
13 #include "src/heap/incremental-marking-inl.h"
14 #include "src/heap/mark-compact.h"
15 #include "src/heap/spaces-inl.h"
16 #include "src/heap/store-buffer.h"
17 #include "src/heap/store-buffer-inl.h"
44 SemiSpace::AssertValidRange(target->GetIsolate()->heap()->new_space()->top(),
51 type* Heap::name() { return type::cast(roots_[k##camel_name##RootIndex]); }
56 Map* Heap::name##_map() { return Map::cast(roots_[k##Name##MapRootIndex]);
[all...] |
| objects-visiting.cc | 5 #include "src/heap/objects-visiting.h"
7 #include "src/heap/mark-compact-inl.h"
8 #include "src/heap/objects-visiting-inl.h"
174 static bool MustRecordSlots(Heap* heap) {
175 return heap->gc_state() == Heap::MARK_COMPACT &&
176 heap->mark_compact_collector()->is_compacting();
185 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer)
[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 static_cast<size_t>(heap->tracer()->ScavengeSpeedInBytesPerMillisecond())
[all...] |
| /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 | 39 class Heap;
51 explicit ModUnionTable(const std::string& name, Heap* heap, space::ContinuousSpace* space)
53 heap_(heap),
87 Heap* GetHeap() const {
97 Heap* const heap_;
104 explicit ModUnionTableReferenceCache(const std::string& name, Heap* heap,
106 : ModUnionTable(name, heap, space) {}
146 explicit ModUnionTableCardCache(const std::string& name, Heap* heap
[all...] |
| heap_bitmap.h | 28 class Heap;
67 explicit HeapBitmap(Heap* heap) : heap_(heap) {}
70 const Heap* const heap_;
87 friend class art::gc::Heap;
|
| /art/tools/ahat/src/ |
| HeapTable.java | 19 import com.android.tools.perflib.heap.Heap;
26 * Class for rendering a table that includes sizes of some kind for each heap.
30 * Configuration for a value column of a heap table.
42 long getSize(T element, Heap heap);
54 List<Heap> heaps = new ArrayList<Heap>();
55 for (Heap heap : snapshot.getHeaps())
[all...] |
| /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 isolate->heap()->RootCanBeTreatedAsConstant(root_index)) {
|
| identity-map.h | 14 class Heap;
27 IdentityMapBase(Heap* heap, Zone* zone)
28 : heap_(heap),
50 Heap* heap_;
61 // supplied {heap}.
65 // * The value type {V} must not be a heap type.
69 IdentityMap(Heap* heap, Zone* zone) : IdentityMapBase(heap, zone) {
[all...] |
| /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 | 40 class Heap {
42 Heap();
43 ~Heap();
46 Heap(const Heap& other) : impl_(other.impl_), owns_impl_(false) {}
49 Heap& operator=(const Heap&) = delete;
68 bool operator ==(const Heap& other) const {
71 bool operator !=(const Heap& other) const {
103 // STLAllocator implements the std allocator interface on top of a Heap
[all...] |
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| heap.h | 43 * The priority queue is implemented with a heap. A heap is a complete
48 class Heap
52 * Storage array for the heap.
55 std::vector<T> heap; member in class:cvflann::Heap
59 * Number of element in the heap
70 * sz = heap size
73 Heap(int sz)
76 heap.reserve(length);
82 * Returns: heap siz
[all...] |
| /art/runtime/ |
| runtime_options.def | 47 RUNTIME_OPTIONS_KEY (MemoryKiB, MemoryMaximumSize, gc::Heap::kDefaultMaximumSize) // -Xmx
48 RUNTIME_OPTIONS_KEY (MemoryKiB, MemoryInitialSize, gc::Heap::kDefaultInitialSize) // -Xms
50 RUNTIME_OPTIONS_KEY (MemoryKiB, HeapMinFree, gc::Heap::kDefaultMinFree)
51 RUNTIME_OPTIONS_KEY (MemoryKiB, HeapMaxFree, gc::Heap::kDefaultMaxFree)
52 RUNTIME_OPTIONS_KEY (MemoryKiB, NonMovingSpaceCapacity, gc::Heap::kDefaultNonMovingSpaceCapacity)
53 RUNTIME_OPTIONS_KEY (double, HeapTargetUtilization, gc::Heap::kDefaultTargetUtilization)
54 RUNTIME_OPTIONS_KEY (double, ForegroundHeapGrowthMultiplier, gc::Heap::kDefaultHeapGrowthMultiplier)
60 LongPauseLogThreshold, gc::Heap::kDefaultLongPauseLogThreshold)
62 LongGCLogThreshold, gc::Heap::kDefaultLongGCLogThreshold)
93 LargeObjectSpace, gc::Heap::kDefaultLargeObjectSpaceType
[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...] |
