| /external/valgrind/main/memcheck/tests/linux/ |
| brk.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| capget.stderr.exp | 7 HEAP SUMMARY:
9 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| sigqueue.stderr.exp | 4 HEAP SUMMARY:
6 total heap usage: 1 allocs, 1 frees, 128 bytes allocated
|
| syscalls-2007.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| syslog-syscall.stderr.exp | 4 HEAP SUMMARY:
6 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| /external/valgrind/main/memcheck/tests/ |
| mallinfo.stderr.exp | 4 HEAP SUMMARY:
6 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| new_override.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| sbfragment.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| /external/chromium_org/v8/test/cctest/ |
| test-spaces.cc | 74 // Initialized Page has heap pointer, normally set by memory_allocator.
75 p->heap_ = CcTest::heap();
149 Heap* heap,
156 CHECK(memory_allocator->SetUp(heap->MaxReserved(),
157 heap->MaxExecutableSize()));
212 Heap* heap = isolate->heap(); local
213 CHECK(heap->ConfigureHeapDefault())
268 Heap* heap = isolate->heap(); local
317 Heap* heap = isolate->heap(); local
346 Heap* heap = isolate->heap(); local
[all...] |
| test-mark-compact.cc | 77 Heap* heap = CcTest::heap(); local
78 heap->ConfigureHeap(2*256*KB, 1*MB, 1*MB);
86 Object* obj = heap->AllocateFixedArray(array_length)->ToObjectChecked();
90 CHECK(heap->InSpace(*array, NEW_SPACE));
93 heap->CollectGarbage(OLD_POINTER_SPACE);
96 CHECK(heap->InSpace(*array, OLD_POINTER_SPACE));
102 Heap* heap = CcTest::heap() local
129 Heap* heap = isolate->heap(); local
261 Heap* heap = CcTest::heap(); local
[all...] |
| test-heap.cc | 45 MarkCompactCollector* collector = CcTest::heap()->mark_compact_collector();
46 IncrementalMarking* marking = CcTest::heap()->incremental_marking();
65 CHECK(CcTest::heap()->Contains(map));
67 CHECK_EQ(CcTest::heap()->meta_map(), map->map());
75 Heap* heap = CcTest::heap(); local
76 CheckMap(heap->meta_map(), MAP_TYPE, Map::kSize);
77 CheckMap(heap->heap_number_map(), HEAP_NUMBER_TYPE, HeapNumber::kSize);
78 CheckMap(heap->fixed_array_map(), FIXED_ARRAY_TYPE, kVariableSizeSentinel)
123 Heap* heap = isolate->heap(); local
154 Heap* heap = isolate->heap(); local
254 Heap* heap = isolate->heap(); local
355 Heap* heap = isolate->heap(); local
408 Heap* heap = isolate->heap(); local
449 Heap* heap = isolate->heap(); local
495 Heap* heap = isolate->heap(); local
957 Heap* heap = isolate->heap(); local
1291 Heap* heap = isolate->heap(); local
1386 Heap* heap = isolate->heap(); local
1490 Heap* heap = isolate->heap(); local
1656 Heap* heap = new_space->heap(); local
1671 Heap* heap = CcTest::heap(); local
1722 Heap* heap = CcTest::heap(); local
2667 Heap* heap = isolate->heap(); local
2761 Heap* heap = CcTest::heap(); local
3048 Heap* heap = isolate->heap(); local
3112 Heap* heap = isolate->heap(); local
3174 Heap* heap = isolate->heap(); local
3223 Heap* heap = isolate->heap(); local
3384 Heap* heap = isolate->heap(); local
3440 Heap* heap = isolate->heap(); local
3497 Heap* heap = isolate->heap(); local
3581 v8::internal::Heap* heap = CcTest::heap(); local
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/doc/ |
| pageheap.dot | 6 heap [shape=record, height=3, label="<f0>1 page|<f1>2 pages|<f2>3 pages|...|<f255>255 pages|<frest>rest"]
23 heap:f0 -> O0 -> O1 -> sep1
24 heap:f1 -> O2 -> O3 -> sep2
25 heap:f2 -> O4 -> O5 -> sep3
26 heap:f255 -> O6 -> O7 -> sep4
27 heap:frest -> O8 -> O9 -> sep5
|
| /dalvik/vm/alloc/ |
| HeapSource.h | 19 #include "alloc/Heap.h"
38 * Initializes the heap source; must be called before any other
47 * will create a new heap for post-zygote allocations.
48 * Having a separate heap should maximize the number of pages
55 * will create an additional zygote heap before the first fork().
56 * Having a separate heap should reduce the number of shared
62 * Shutdown any threads internal to the heap source. This should be
63 * called before the heap source itself is shutdown.
68 * Tears down the heap source and frees any resources associated with it.
73 * Returns the base and inclusive max addresses of the heap sourc
[all...] |
| /external/v8/test/cctest/ |
| test-spaces.cc | 74 // Initialized Page has heap pointer, normally set by memory_allocator.
75 p->heap_ = HEAP;
131 Heap* heap = isolate->heap(); local
132 CHECK(isolate->heap()->ConfigureHeapDefault());
135 CHECK(memory_allocator->SetUp(heap->MaxReserved(),
136 heap->MaxExecutableSize()));
139 OldSpace faked_space(heap,
140 heap->MaxReserved()
181 Heap* heap = isolate->heap(); local
211 Heap* heap = isolate->heap(); local
[all...] |
| test-mark-compact.cc | 89 HEAP->ConfigureHeap(2*256*KB, 8*MB, 8*MB);
99 Object* obj = HEAP->AllocateFixedArray(array_size)->ToObjectChecked();
104 CHECK(HEAP->InSpace(*array, NEW_SPACE));
107 HEAP->CollectGarbage(OLD_POINTER_SPACE);
110 CHECK(HEAP->InSpace(*array, OLD_POINTER_SPACE));
115 HEAP->ConfigureHeap(2*256*KB, 8*MB, 8*MB);
123 // Do a mark compact GC to shrink the heap.
124 HEAP->CollectGarbage(OLD_POINTER_SPACE);
128 Min(Page::kMaxNonCodeHeapObjectSize, HEAP->MaxObjectSizeInNewSpace());
131 Object* obj = i::Isolate::Current()->heap()->AllocateFixedArray(length)-
[all...] |
| test-alloc.cc | 40 Heap* heap = Isolate::Current()->heap();
43 NewSpace* new_space = heap->new_space();
47 CHECK(!heap->AllocateByteArray(0)->IsFailure());
55 CHECK(!heap->AllocateByteArray(100)->IsFailure());
56 CHECK(!heap->AllocateFixedArray(100, NOT_TENURED)->IsFailure());
60 CHECK(!heap->AllocateFixedArray(100)->IsFailure());
61 CHECK(!heap->AllocateHeapNumber(0.42)->IsFailure());
62 CHECK(!heap->AllocateArgumentsObject(Smi::FromInt(87), 10)->IsFailure())
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_heapq.py | 33 heap = []
35 self.check_invariant(heap)
39 self.module.heappush(heap, item)
40 self.check_invariant(heap)
42 while heap:
43 item = self.module.heappop(heap)
44 self.check_invariant(heap)
59 def check_invariant(self, heap):
60 # Check the heap invariant.
61 for pos, item in enumerate(heap)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_heapq.py | 33 heap = []
35 self.check_invariant(heap)
39 self.module.heappush(heap, item)
40 self.check_invariant(heap)
42 while heap:
43 item = self.module.heappop(heap)
44 self.check_invariant(heap)
59 def check_invariant(self, heap):
60 # Check the heap invariant.
61 for pos, item in enumerate(heap)
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| vecir.h | 30 DEF_VEC_ALLOC_P(tree,heap);
34 DEF_VEC_ALLOC_P(gimple,heap);
40 DEF_VEC_ALLOC_P(gimple_p,heap);
45 DEF_VEC_ALLOC_P(gimple_seq,heap);
49 DEF_VEC_ALLOC_P(rtx,heap);
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| vecir.h | 30 DEF_VEC_ALLOC_P(tree,heap);
34 DEF_VEC_ALLOC_P(gimple,heap);
40 DEF_VEC_ALLOC_P(gimple_p,heap);
45 DEF_VEC_ALLOC_P(gimple_seq,heap);
49 DEF_VEC_ALLOC_P(rtx,heap);
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| vecir.h | 30 DEF_VEC_ALLOC_P(tree,heap);
34 DEF_VEC_ALLOC_P(gimple,heap);
40 DEF_VEC_ALLOC_P(gimple_p,heap);
45 DEF_VEC_ALLOC_P(gimple_seq,heap);
49 DEF_VEC_ALLOC_P(rtx,heap);
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| vecir.h | 30 DEF_VEC_ALLOC_P(tree,heap);
34 DEF_VEC_ALLOC_P(gimple,heap);
40 DEF_VEC_ALLOC_P(gimple_p,heap);
45 DEF_VEC_ALLOC_P(gimple_seq,heap);
49 DEF_VEC_ALLOC_P(rtx,heap);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_heap.h | 0 // Heap implementation -*- C++ -*-
65 * @defgroup heap_algorithms Heap Algorithms
101 // __is_heap, a predicate testing whether or not a range is a heap.
125 // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap,
144 * @brief Push an element onto a heap.
145 * @param first Start of heap.
146 * @param last End of heap + element.
149 * This operation pushes the element at last-1 onto the valid heap over the
150 * range [first,last-1). After completion, [first,last) is a valid heap.
191 * @brief Push an element onto a heap using comparison functor
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_heap.h | 0 // Heap implementation -*- C++ -*-
67 * @defgroup heap_algorithms Heap
103 // __is_heap, a predicate testing whether or not a range is a heap.
127 // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap,
146 * @brief Push an element onto a heap.
147 * @param first Start of heap.
148 * @param last End of heap + element.
151 * This operation pushes the element at last-1 onto the valid heap over the
152 * range [first,last-1). After completion, [first,last) is a valid heap.
193 * @brief Push an element onto a heap using comparison functor
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_heap.h | 0 // Heap implementation -*- C++ -*-
67 * @defgroup heap_algorithms Heap
103 // __is_heap, a predicate testing whether or not a range is a heap.
127 // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap,
146 * @brief Push an element onto a heap.
147 * @param first Start of heap.
148 * @param last End of heap + element.
151 * This operation pushes the element at last-1 onto the valid heap over the
152 * range [first,last-1). After completion, [first,last) is a valid heap.
193 * @brief Push an element onto a heap using comparison functor
[all...] |
