| /external/chromium_org/third_party/skia/src/core/ |
| SkTSort.h | 28 /* Sifts a broken heap. The input array is a heap from root to bottom
39 * @param root the one based index into array of the out-of-place root of the heap.
40 * @param bottom the one based index in the array of the last entry in the heap.
68 /* Sifts a broken heap. The input array is a heap from root to bottom
73 * @param root the one based index into array of the out-of-place root of the heap.
74 * @param bottom the one based index in the array of the last entry in the heap.
95 /** Sorts the array of size count using comparator lessThan using a Heap Sort algorithm. Be sure to
113 /** Sorts the array of size count using comparator '<' using a Heap Sort algorithm. *
[all...] |
| /external/skia/src/core/ |
| SkTSort.h | 28 /* Sifts a broken heap. The input array is a heap from root to bottom
39 * @param root the one based index into array of the out-of-place root of the heap.
40 * @param bottom the one based index in the array of the last entry in the heap.
68 /* Sifts a broken heap. The input array is a heap from root to bottom
73 * @param root the one based index into array of the out-of-place root of the heap.
74 * @param bottom the one based index in the array of the last entry in the heap.
95 /** Sorts the array of size count using comparator lessThan using a Heap Sort algorithm. Be sure to
113 /** Sorts the array of size count using comparator '<' using a Heap Sort algorithm. *
[all...] |
| /external/chromium_org/v8/src/ |
| incremental-marking.cc | 42 IncrementalMarking::IncrementalMarking(Heap* heap)
43 : heap_(heap),
85 IncrementalMarking* marking = isolate->heap()->incremental_marking();
106 IncrementalMarking* marking = isolate->heap()->incremental_marking();
235 Heap* heap = map->GetHeap(); local
248 VisitPointersWithAnchor(heap,
254 scan_until_end = heap->incremental_marking()->marking_deque()->IsFull();
258 heap->incremental_marking()->marking_deque()->UnshiftGrey(object)
277 Heap* heap = map->GetHeap(); local
[all...] |
| heap-profiler.h | 31 #include "heap-snapshot-generator-inl.h"
42 explicit HeapProfiler(Heap* heap);
88 Heap* heap() const { return ids_->heap(); } function in class:v8::internal::HeapProfiler
|
| spaces-inl.h | 31 #include "heap-profiler.h"
163 Page* Page::Initialize(Heap* heap,
173 heap->incremental_marking()->SetOldSpacePageFlags(chunk);
198 MemoryChunk* MemoryChunk::FromAnyPointerAddress(Heap* heap, Address addr) {
202 LargeObjectIterator iterator(heap->lo_space());
231 PointerChunkIterator::PointerChunkIterator(Heap* heap)
233 old_pointer_iterator_(heap->old_pointer_space())
357 Heap* heap = object->GetHeap(); local
[all...] |
| /art/runtime/gc/accounting/ |
| heap_bitmap.h | 28 class Heap;
102 explicit HeapBitmap(Heap* heap) : heap_(heap) {}
105 const Heap* const heap_;
116 friend class art::gc::Heap;
|
| /dalvik/vm/alloc/ |
| DdmHeap.cpp | 17 * DDM-related heap functions
23 #include "alloc/Heap.h"
41 * Heap Info. General information about the heap,
46 * For each heap:
47 * [u4]: heap ID
50 * [u4]: max heap size in bytes (-Xmx)
51 * [u4]: current heap size in bytes
73 ALOGW("%s(): can't lock heap to clear when", __func__);
98 /* For each heap (of which there is one) *
[all...] |
| CardTable.h | 19 * non-NULL values to heap addresses should go through an entry in
49 * an address on the heap.
54 * Returns the first address in the heap which maps to this card.
|
| DlMalloc.cpp | 26 /* Custom heap error handling. */
30 heap_error("HEAP MEMORY CORRUPTION", __FUNCTION__, NULL)
32 heap_error("ARGUMENT IS INVALID HEAP ADDRESS", __FUNCTION__, p)
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| heap-checker_unittest.sh | 35 # Runs the heap-checker unittest with various environment variables.
36 # This is necessary because we turn on features like the heap profiler
37 # and heap checker via environment variables. This test makes sure
51 HEAP_CHECKER="${1:-$BINDIR}/heap-checker_unittest"
58 # $1: value of heap-check env. var.
78 [ -e "$HEAPPROFILE.0001.heap" ] || exit 5
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| heap-checker_unittest.sh | 35 # Runs the heap-checker unittest with various environment variables.
36 # This is necessary because we turn on features like the heap profiler
37 # and heap checker via environment variables. This test makes sure
51 HEAP_CHECKER="${1:-$BINDIR}/heap-checker_unittest"
58 # $1: value of heap-check env. var.
78 [ -e "$HEAPPROFILE.0001.heap" ] || exit 5
|
| /external/chromium_org/tools/deep_memory_profiler/ |
| policy.l1.json | 16 "mmap-v8-heap-newspace",
17 "mmap-v8-heap-coderange",
18 "mmap-v8-heap-pagedspace",
108 "name": "mmap-v8-heap-newspace",
113 "name": "mmap-v8-heap-coderange",
118 "name": "mmap-v8-heap-pagedspace",
|
| /external/valgrind/main/massif/tests/ |
| deep-B.stderr.exp | 41 Massif: heap allocs: 10
42 Massif: heap reallocs: 0
43 Massif: heap frees: 0
44 Massif: ignored heap allocs: ...
45 Massif: ignored heap frees: ...
46 Massif: ignored heap reallocs: ...
|
| deep-C.stderr.exp | 44 Massif: heap allocs: 10
45 Massif: heap reallocs: 0
46 Massif: heap frees: 0
47 Massif: ignored heap allocs: ...
48 Massif: ignored heap frees: ...
49 Massif: ignored heap reallocs: ...
|
| peak2.post.exp | 3 Massif arguments: --stacks=no --time-unit=B --peak-inaccuracy=10.0 --heap-admin=128 --massif-out-file=massif.out --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)
42 86.32% (1,616B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
48 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
54 89.33% (3,216B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
60 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
66 90.39% (4,816B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc
[all...] |
| /art/runtime/gc/ |
| heap.h | 95 // How we want to sanity check the heap's correctness.
97 kHeapVerificationNotPermitted, // Too early in runtime start-up for heap to be verified.
99 kVerifyAllFast, // Sanity check all heap accesses with quick(er) tests.
100 kVerifyAll // Sanity check all heap accesses.
104 class Heap {
119 // Create a heap with the requested sizes. The possible empty
122 explicit Heap(size_t initial_size, size_t growth_limit, size_t min_free,
128 ~Heap();
138 // The given reference is believed to be to an object in the Java heap, check the soundness of it.
155 // A weaker test than IsLiveObject or VerifyObject that doesn't require the heap lock
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv30/ |
| nv30_vertprog.c | 87 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
92 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
93 while (heap->next && heap->size < vp->nr_insns) {
94 struct nouveau_heap **evict = heap->next->priv;
98 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
130 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local
135 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) {
136 while (heap->next && heap->size < vp->nr_consts)
[all...] |
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-2646.js | 28 // Flags: --heap-stats
32 heap = new ArrayBuffer(expectedItemsCount * itemSize * 8),
36 storage.push(new Float64Array(heap, 0, itemSize));
|
| /external/mesa3d/src/gallium/drivers/nv30/ |
| nv30_vertprog.c | 87 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
92 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
93 while (heap->next && heap->size < vp->nr_insns) {
94 struct nouveau_heap **evict = heap->next->priv;
98 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
130 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local
135 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) {
136 while (heap->next && heap->size < vp->nr_consts)
[all...] |
| /libcore/include/ |
| LocalArray.h | 26 * construction time, a buffer will be allocated on the heap (and deallocated
37 * internal on-stack buffer will be used. Otherwise a heap buffer will
49 * Frees the heap-allocated buffer, if there was one.
|
| /art/runtime/gc/collector/ |
| sticky_mark_sweep.cc | 17 #include "gc/heap.h"
27 StickyMarkSweep::StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix)
28 : PartialMarkSweep(heap, is_concurrent,
|
| /external/chromium/base/allocator/ |
| README | 8 the windows low-fragmentation-heap
10 jemalloc (the heap used most notably within Mozilla Firefox)
58 "winheap" - Windows default heap
59 "winlfh" - Windows Low-Fragmentation heap
|
| /external/chromium-trace/trace-viewer/src/tcmalloc/ |
| heap.js | 33 throw new Error('No heap snapshot data.');
51 // We don't want to record allocations caused by the heap profiling
56 // Walk down into the heap of stack traces.
88 ObjectSnapshot.register('memory::Heap', HeapSnapshot);
|
| /external/chromium_org/base/allocator/ |
| README | 8 the windows low-fragmentation-heap
10 jemalloc (the heap used most notably within Mozilla Firefox)
58 "winheap" - Windows default heap
59 "winlfh" - Windows Low-Fragmentation heap
|
| /external/chromium_org/third_party/WebKit/Source/core/ |
| DEPS | 4 "+heap",
|
