| /external/chromium_org/third_party/WebKit/Source/web/ |
| WebHeap.cpp | 34 #include "platform/heap/Handle.h"
50 Heap::collectGarbage(ThreadState::HeapPointersOnStack);
55 Heap::collectAllGarbage();
|
| /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/ |
| remembered_set.h | 38 class Heap;
49 explicit RememberedSet(const std::string& name, Heap* heap, space::ContinuousSpace* space)
50 : name_(name), heap_(heap), space_(space) {}
67 Heap* GetHeap() const {
77 Heap* const heap_;
|
| heap_bitmap.h | 28 class Heap;
60 explicit HeapBitmap(Heap* heap) : heap_(heap) {}
63 const Heap* const heap_;
80 friend class art::gc::Heap;
|
| mod_union_table-inl.h | 31 explicit ModUnionTableToZygoteAllocspace(const std::string& name, Heap* heap,
33 : ModUnionTableReferenceCache(name, heap, space) {}
|
| mod_union_table.h | 43 class Heap;
56 explicit ModUnionTable(const std::string& name, Heap* heap, space::ContinuousSpace* space)
58 heap_(heap),
84 Heap* GetHeap() const {
93 Heap* const heap_;
100 explicit ModUnionTableReferenceCache(const std::string& name, Heap* heap,
102 : ModUnionTable(name, heap, space) {}
136 explicit ModUnionTableCardCache(const std::string& name, Heap* heap, space::ContinuousSpace* space
[all...] |
| /external/chromium_org/v8/src/heap/ |
| objects-visiting.cc | 7 #include "src/heap/objects-visiting.h"
180 static bool MustRecordSlots(Heap* heap) {
181 return heap->gc_state() == Heap::MARK_COMPACT &&
182 heap->mark_compact_collector()->is_compacting();
191 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer) {
192 Object* undefined = heap->undefined_value();
195 MarkCompactCollector* collector = heap->mark_compact_collector()
[all...] |
| sweeper-thread.h | 13 #include "src/heap/spaces.h"
15 #include "src/heap/heap.h"
35 Heap* heap_;
|
| heap-inl.h | 12 #include "src/heap/heap.h"
13 #include "src/heap/store-buffer.h"
14 #include "src/heap/store-buffer-inl.h"
15 #include "src/heap-profiler.h"
47 SemiSpace::AssertValidRange(target->GetIsolate()->heap()->new_space()->top(),
54 bool inline Heap::IsOneByte(Vector<const char> str, int chars) {
61 bool inline Heap::IsOneByte(String* str, int chars) {
66 AllocationResult Heap::AllocateInternalizedStringFromUtf8(
77 AllocationResult Heap::AllocateInternalizedStringImpl(T t, int chars
538 Heap* heap = object->GetHeap(); local
[all...] |
| heap.cc | 20 #include "src/heap/gc-idle-time-handler.h"
21 #include "src/heap/incremental-marking.h"
22 #include "src/heap/mark-compact.h"
23 #include "src/heap/objects-visiting-inl.h"
24 #include "src/heap/objects-visiting.h"
25 #include "src/heap/store-buffer.h"
26 #include "src/heap-profiler.h"
53 Heap::Heap()
160 intptr_t Heap::Capacity()
1951 Heap* heap = map->GetHeap(); local
1991 Heap* heap = map->GetHeap(); local
2040 Heap* heap = map->GetHeap(); local
2149 Heap* heap = map->GetHeap(); local
[all...] |
| objects-visiting.h | 189 INLINE(static void IteratePointers(Heap* heap, HeapObject* object,
195 StaticVisitor::VisitPointers(heap, start_slot, end_slot);
257 INLINE(static void VisitPointers(Heap* heap, Object** start, Object** end)) {
258 for (Object** p = start; p < end; p++) StaticVisitor::VisitPointer(heap, p);
263 Heap* heap = map->GetHeap(); local
264 VisitPointers(heap,
271 heap, HeapObject::RawField(object
[all...] |
| /art/runtime/gc/collector/ |
| partial_mark_sweep.h | 33 explicit PartialMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix = "");
|
| concurrent_copying.h | 28 explicit ConcurrentCopying(Heap* heap, bool generational = false,
30 : GarbageCollector(heap,
|
| garbage_collector.h | 32 class Heap;
120 GarbageCollector(Heap* heap, const std::string& name);
134 Heap* GetHeap() const {
188 Heap* const heap_;
|
| 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.empty() ? "partial " : name_prefix) {
|
| sticky_mark_sweep.h | 33 explicit StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix = "");
|
| /external/chromium_org/third_party/WebKit/Source/platform/heap/ |
| HeapTerminatedArray.h | 8 #include "platform/heap/Heap.h"
36 return reinterpret_cast<HeapTerminatedArray*>(Heap::allocate<HeapTerminatedArray>(capacity * sizeof(T)));
41 return reinterpret_cast<HeapTerminatedArray*>(Heap::reallocate<HeapTerminatedArray>(ptr, capacity * sizeof(T)));
|
| HeapTest.cpp | 34 #include "platform/heap/Handle.h"
35 #include "platform/heap/Heap.h"
36 #include "platform/heap/HeapLinkedStack.h"
37 #include "platform/heap/HeapTerminatedArrayBuilder.h"
38 #include "platform/heap/ThreadState.h"
39 #include "platform/heap/Visitor.h"
231 Heap::getStats(stats);
379 Heap::collectGarbage(ThreadState::NoHeapPointersOnStack);
492 Heap::collectGarbage(ThreadState::NoHeapPointersOnStack)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/testing/ |
| RunAllTests.cpp | 36 #include "platform/heap/Heap.h"
62 blink::Heap::init();
69 blink::Heap::shutdown();
|
| /external/chromium_org/v8/test/cctest/ |
| test-mementos.cc | 35 Heap* heap = isolate->heap(); local
36 NewSpace* new_space = heap->new_space();
39 heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask);
50 memento->set_map_no_write_barrier(heap->allocation_memento_map());
66 CcTest::i_isolate()->heap()->CollectAllGarbage(
67 Heap::kAbortIncrementalMarkingMask);
79 CcTest::i_isolate()->heap()->CollectGarbage(i::NEW_SPACE)
90 Heap* heap = isolate->heap(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/modules/indexeddb/ |
| IDBTransactionTest.cpp | 108 Heap::collectAllGarbage();
114 Heap::collectAllGarbage();
123 Heap::collectAllGarbage();
138 Heap::collectAllGarbage();
143 Heap::collectAllGarbage();
148 Heap::collectAllGarbage();
159 Heap::collectAllGarbage();
|
| /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/chromium_org/third_party/WebKit/Source/core/dom/ |
| DocumentMarkerControllerTest.cpp | 101 Heap::collectAllGarbage();
117 Heap::collectAllGarbage();
129 Heap::collectAllGarbage();
143 Heap::collectAllGarbage();
157 Heap::collectAllGarbage();
171 Heap::collectAllGarbage();
185 Heap::collectAllGarbage();
199 Heap::collectAllGarbage();
|
| /art/runtime/gc/ |
| heap-inl.h | 20 #include "heap.h"
39 inline mirror::Object* Heap::AllocObjectWithAllocator(Thread* self, mirror::Class* klass,
172 inline void Heap::PushOnAllocationStack(Thread* self, mirror::Object** obj) {
183 inline mirror::Object* Heap::AllocLargeObject(Thread* self, mirror::Class** klass,
195 inline mirror::Object* Heap::TryToAllocate(Thread* self, AllocatorType allocator_type,
276 inline Heap::AllocationTimer::AllocationTimer(Heap* heap, mirror::Object** allocated_obj_ptr)
277 : heap_(heap), allocated_obj_ptr_(allocated_obj_ptr) {
283 inline Heap::AllocationTimer::~AllocationTimer()
[all...] |
