| /dalvik/docs/ |
| debugmon.html | 71 <li> Overall heap status, useful for a heap bitmap display or
379 <h3>Heap Status</h3>
392 so the protocol allows the heap data to be sent in several chunks.
396 <p>All messages include a "heap ID" that can be used to differentiate
397 between multiple independent virtual heaps or perhaps a native heap. The
399 so all heap-specific information is tagged with a "heap ID".
402 <p>Request heap info.
415 <p>Heap Info. General information about the heap, suitable for a summar
[all...] |
| /external/chromium_org/v8/src/ |
| execution.cc | 58 isolate_->heap()->SetStackLimits();
66 isolate_->heap()->SetStackLimits();
224 isolate->heap()->termination_exception()) {
471 isolate_->heap()->SetStackLimits();
487 isolate_->heap()->SetStackLimits();
553 isolate_->heap()->SetStackLimits();
564 isolate_->heap()->SetStackLimits();
610 isolate_->heap()->SetStackLimits();
615 if (thread_local_.Initialize(isolate_)) isolate_->heap()->SetStackLimits();
849 return isolate->heap()->undefined_value()
[all...] |
| spaces.h | 44 // Heap structures:
46 // A JS heap consists of a young generation, an old generation, and a large
66 // buffer overflow) iterate intergenerational pointers without decoding heap
70 // the Heap::InNewSpace() predicate must be a pointer to a live heap object in
301 // any heap object.
310 static inline MemoryChunk* FromAnyPointerAddress(Heap* heap, Address addr);
623 inline Heap* heap() { return heap_; function in class:v8::internal::MemoryChunk
876 Heap* heap() const { return heap_; } function in class:v8::internal::Space
[all...] |
| string-stream.cc | 384 Heap* heap = array->GetHeap(); local
387 if (element != heap->the_hole_value()) {
459 Heap* heap = isolate->heap(); local
460 if (!heap->Contains(obj)) return;
463 !heap->Contains(map) ||
472 heap->Contains(HeapObject::cast(perhaps_context)) &&
475 if (!heap->Contains(context))
495 Heap* heap = HeapObject::cast(f)->GetHeap(); local
[all...] |
| /external/v8/src/ |
| execution.cc | 57 isolate_->heap()->SetStackLimits();
65 isolate_->heap()->SetStackLimits();
209 isolate->heap()->termination_exception()) {
436 isolate_->heap()->SetStackLimits();
454 isolate_->heap()->SetStackLimits();
507 isolate_->heap()->SetStackLimits();
517 isolate_->heap()->SetStackLimits();
563 isolate_->heap()->SetStackLimits();
568 if (thread_local_.Initialize(isolate_)) isolate_->heap()->SetStackLimits();
605 return Handle<Object>(HEAP->ToBoolean(result))
[all...] |
| heap.h | 48 // Defines all the roots in Heap.
255 typedef String* (*ExternalStringTableUpdaterCallback)(Heap* heap,
280 // The all static Heap captures the interface to the global object heap.
281 // All JavaScript contexts by this process share the same object heap.
292 explicit PromotionQueue(Heap* heap)
297 heap_(heap) { }
376 Heap* heap_
[all...] |
| bootstrapper.cc | 77 Heap* heap = isolate->heap(); local
78 if (heap->natives_source_cache()->get(index)->IsUndefined()) {
87 heap->natives_source_cache()->set(index, *source_code);
89 Handle<Object> cached_source(heap->natives_source_cache()->get(index));
154 Heap* heap() const { return isolate_->heap(); } function in class:BASE_EMBEDDED
466 Heap* heap = isolate->heap() local
661 Heap* heap = context->GetIsolate()->heap(); local
847 Heap* heap = isolate->heap(); local
[all...] |
| /device/lge/mako/camera/QCamera/HAL/core/src/ |
| QCameraHWI.cpp | [all...] |
| /external/chromium_org/tools/memory_watcher/ |
| memory_hook.cc | 297 // TODO(mbelshe): THIS map uses the standard heap!!!!
424 // It's a bit dangerous to ever close this heap; MemoryWatchers may have
425 // used this heap for their tracking data. Closing the heap while any
532 // Create a heap for our own memory.
546 void MemoryHook::OnTrack(HANDLE heap, int32 id, int32 size) {
547 // Don't notify about allocations to our internal heap.
548 if (heap == heap_)
552 watcher_->OnTrack(heap, id, size);
555 void MemoryHook::OnUntrack(HANDLE heap, int32 id, int32 size)
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| shortest-path.h | 281 vector<StateId> heap; local
291 heap.push_back(final);
293 while (!heap.empty()) {
294 pop_heap(heap.begin(), heap.end(), compare);
295 StateId state = heap.back();
297 heap.pop_back();
317 heap.push_back(next);
318 push_heap(heap.begin(), heap.end(), compare)
[all...] |
| /dalvik/vm/alloc/ |
| CardTable.cpp | 27 * non-NULL values to heap addresses should go through an entry in
30 * The heap is divided into "cards" of GC_CARD_SIZE bytes, as
35 * After any store of a non-NULL object pointer into a heap object,
101 * so cards for parts of the heap we haven't expanded into won't be
129 * the heap shrinks a lot or we somehow notice that we've been idle.)
132 * on request will be expanded to the heap maximum.
165 * an address on the heap.
176 * Returns the first address in the heap which maps to this card.
276 ALOGD("Found %p in the heap @ %p", arg, obj);
|
| /external/valgrind/main/massif/tests/ |
| insig.post.exp | 3 Massif arguments: --stacks=no --time-unit=B --heap-admin=128 --massif-out-file=massif.out --threshold=0.99 --ignore-fn=__part_load_locale --ignore-fn=__time_load_locale --ignore-fn=dwarf2_unwind_dyld_add_image_hook --ignore-fn=get_or_create_key_element
36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
48 93.48% (16,528B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
58 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
70 87.28% (16,688B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
80 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
| big-alloc.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
48 99.96% (94,371,840B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
52 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
| big-alloc.post.exp-64bit | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
48 99.96% (94,371,840B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
52 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
| new-cpp.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
44 99.73% (12,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
54 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
| overloaded-new.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
44 99.73% (12,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
54 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
| /art/runtime/gc/accounting/ |
| card_table.h | 37 class Heap;
44 // non-NULL values to heap addresses should go through an entry in
84 // Returns a value that when added to a heap address >> GC_CARD_SHIFT will address the appropriate
119 // Returns the first address in the heap which maps to this card.
122 // Returns the address of the relevant byte in the card table, given an address on the heap.
|
| /art/runtime/gc/space/ |
| dlmalloc_space.h | 88 // Returns the number of bytes that the heap is allowed to obtain from the system via MoreCore.
91 // Set the maximum number of bytes that the heap is allowed to obtain from the system via
97 // maximum reserved size of the heap.
189 // The underlying mem_map_ controls the maximum size we allow the heap to grow to. The growth
191 // Prior to forking the zygote the heap will have a maximally sized mem_map_ but the growth_limit_
|
| /external/chromium-trace/trace-viewer/src/tcmalloc/ |
| heap_instance_track.js | 21 * A track that displays heap memory data.
27 'heap-instance-track', tracing.tracks.HeadingTrack);
35 this.classList.add('heap-instance-track');
134 // heap data structure, so iterate backwards. Likewise draw from
209 'memory::Heap', HeapInstanceTrack);
|
| tcmalloc_snapshot_view.js | 17 * Displays a heap memory snapshot in a human readable form.
21 'heap-snapshot-view',
34 this.textContent = 'No heap found.';
60 * @param {Object} heapEntry The current trace heap entry.
169 'memory::Heap', TcmallocSnapshotView);
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/gperftools/ |
| heap-profiler.h | 33 * Module for heap-profiling.
96 /* Returns non-zero if we are currently profiling the heap. (Returns
104 /* Stop heap profiling. Can be restarted again with HeapProfilerStart(),
115 /* Generate current heap profiling information.
116 * Returns an empty string when heap profiling is not active.
|
| /external/llvm/test/CodeGen/Thumb2/ |
| 2010-01-06-TailDuplicateLabels.ll | 56 %heap.1 = phi %"struct.WTF::TCMalloc_ThreadCache"* [ %8, %bb13 ], [ %h.0, %bb7 ] ; <%"struct.WTF::TCMalloc_ThreadCache"*> [#uses=4]
58 %10 = getelementptr inbounds %"struct.WTF::TCMalloc_ThreadCache"* %heap.1, i32 0, i32 2
70 %13 = bitcast %"struct.WTF::TCMalloc_ThreadCache"* %heap.1 to i8*
72 ret %"struct.WTF::TCMalloc_ThreadCache"* %heap.1
75 ret %"struct.WTF::TCMalloc_ThreadCache"* %heap.1
|
| /external/valgrind/main/perf/ |
| README | 16 heap:
17 - Description: Does a lot of heap allocation and deallocation, and has a lot
18 of heap blocks live while doing so.
20 that inefficiencies in heap allocation can make a big
63 to perf/heap typically cause a small improvement.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
| priority_queue.hpp | 52 * @defgroup heap-based
58 * @defgroup heap-detail Base and Policy Classes
59 * @ingroup heap-based
63 * A priority queue composed of one specific heap policy.
156 //@} heap-based
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
| priority_queue.hpp | 52 * @defgroup heap-based
58 * @defgroup heap-detail Base and Policy Classes
59 * @ingroup heap-based
63 * A priority queue composed of one specific heap policy.
156 //@} heap-based
|
