| /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...] |
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_shadow_test.cc | 52 void *heap = malloc(0); local
53 free(heap);
57 CHECK(IsAppMem((uptr)heap));
61 CHECK(IsShadowMem(MemToShadow((uptr)heap)));
|
| /art/runtime/gc/ |
| heap_test.cc | 32 Heap* heap = Runtime::Current()->GetHeap(); local
33 int64_t max_memory_before = heap->GetMaxMemory();
34 int64_t total_memory_before = heap->GetTotalMemory();
35 heap->ClearGrowthLimit();
36 int64_t max_memory_after = heap->GetMaxMemory();
37 int64_t total_memory_after = heap->GetTotalMemory();
|
| /art/runtime/ |
| runtime_android.cc | 49 gc::Heap* heap = runtime->GetHeap(); local
50 if (kDumpHeapObjectOnSigsevg && heap != nullptr && info != nullptr) {
51 LOG(INTERNAL_FATAL) << "Dump heap object at fault address: ";
52 heap->DumpObject(LOG(INTERNAL_FATAL), reinterpret_cast<mirror::Object*>(info->si_addr));
|
| runtime_linux.cc | 312 gc::Heap* heap = runtime->GetHeap(); local
314 if (kDumpHeapObjectOnSigsevg && heap != nullptr && info != nullptr) {
315 LOG(INTERNAL_FATAL) << "Dump heap object at fault address: ";
316 heap->DumpObject(LOG(INTERNAL_FATAL), reinterpret_cast<mirror::Object*>(info->si_addr));
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_mm.h | 40 struct mem_block *heap; member in struct:mem_block
50 * return: a heap pointer if OK, NULL if error
61 * startSearch = linear offset from start of heap to begin search
64 extern struct mem_block *u_mmAllocMem(struct mem_block *heap, int size, int align2,
76 * input: pointer to a heap, start offset
79 extern struct mem_block *u_mmFindBlock(struct mem_block *heap, int start);
|
| u_mm.c | 34 u_mmDumpMemInfo(const struct mem_block *heap)
36 debug_printf("Memory heap %p:\n", (void *) heap);
37 if (heap == 0) {
38 debug_printf(" heap == 0\n");
44 for (p = heap->next; p != heap; p = p->next) {
58 for (p = heap->next_free; p != heap; p = p->next_free) {
72 struct mem_block *heap, *block local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| mm.h | 38 struct mem_block *heap; member in struct:mem_block
49 * return: a heap pointer if OK, NULL if error
60 * startSearch = linear offset from start of heap to begin search
63 extern struct mem_block *mmAllocMem(struct mem_block *heap, unsigned size,
75 * input: pointer to a heap, start offset
78 extern struct mem_block *mmFindBlock(struct mem_block *heap, unsigned start);
|
| mm.c | 34 mmDumpMemInfo(const struct mem_block *heap)
36 fprintf(stderr, "Memory heap %p:\n", (void *)heap);
37 if (heap == 0) {
38 fprintf(stderr, " heap == 0\n");
42 for(p = heap->next; p != heap; p = p->next) {
50 for(p = heap->next_free; p != heap; p = p->next_free) {
63 struct mem_block *heap, *block local
[all...] |
| /external/chromium_org/v8/src/extensions/ |
| statistics-extension.cc | 53 Heap* heap = isolate->heap(); local
57 heap->CollectAllGarbage(Heap::kNoGCFlags, "counters extension");
99 AddNumber(args.GetIsolate(), result, heap->new_space()->Size(),
101 AddNumber(args.GetIsolate(), result, heap->new_space()->Available(),
103 AddNumber(args.GetIsolate(), result, heap->new_space()->CommittedMemory(),
105 AddNumber(args.GetIsolate(), result, heap->old_pointer_space()->Size(),
107 AddNumber(args.GetIsolate(), result, heap->old_pointer_space()->Available()
[all...] |
| /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/compiler-rt/test/asan/TestCases/Linux/ |
| swapcontext_test.cc | 80 char *heap = new char[kStackSize + 1]; local
81 ret += Run(argc - 1, 0, heap);
84 ret += Run(argc - 1, 1, heap);
88 delete [] heap;
|
| /external/deqp/framework/delibs/depool/ |
| dePoolHeap.c | 21 * \brief Memory pool heap class.
57 * \brief Test heap functionality.
62 TestHeap* heap = TestHeap_create(pool); local
65 TestHeap_push(heap, HeapItem_create(10, 10));
66 TestHeap_push(heap, HeapItem_create(0, 10));
67 TestHeap_push(heap, HeapItem_create(20, 10));
68 DE_TEST_ASSERT(TestHeap_getNumElements(heap) == 3);
70 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 0);
71 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 10);
72 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 20)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_mm.h | 40 struct mem_block *heap; member in struct:mem_block
50 * return: a heap pointer if OK, NULL if error
61 * startSearch = linear offset from start of heap to begin search
64 extern struct mem_block *u_mmAllocMem(struct mem_block *heap, int size, int align2,
76 * input: pointer to a heap, start offset
79 extern struct mem_block *u_mmFindBlock(struct mem_block *heap, int start);
|
| u_mm.c | 34 u_mmDumpMemInfo(const struct mem_block *heap)
36 debug_printf("Memory heap %p:\n", (void *) heap);
37 if (heap == 0) {
38 debug_printf(" heap == 0\n");
44 for (p = heap->next; p != heap; p = p->next) {
58 for (p = heap->next_free; p != heap; p = p->next_free) {
72 struct mem_block *heap, *block local
[all...] |
| /external/mesa3d/src/mesa/main/ |
| mm.h | 38 struct mem_block *heap; member in struct:mem_block
49 * return: a heap pointer if OK, NULL if error
60 * startSearch = linear offset from start of heap to begin search
63 extern struct mem_block *mmAllocMem(struct mem_block *heap, unsigned size,
75 * input: pointer to a heap, start offset
78 extern struct mem_block *mmFindBlock(struct mem_block *heap, unsigned start);
|
| mm.c | 34 mmDumpMemInfo(const struct mem_block *heap)
36 fprintf(stderr, "Memory heap %p:\n", (void *)heap);
37 if (heap == 0) {
38 fprintf(stderr, " heap == 0\n");
42 for(p = heap->next; p != heap; p = p->next) {
50 for(p = heap->next_free; p != heap; p = p->next_free) {
63 struct mem_block *heap, *block local
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| heap.h | 1 /* $NetBSD: heap.h,v 1.1.1.4 2009/04/12 16:35:44 christos Exp $ */
28 void **heap; member in struct:heap_context
|
| /external/chromium_org/v8/src/ |
| heap-profiler.h | 8 #include "src/heap-snapshot-generator-inl.h"
19 explicit HeapProfiler(Heap* heap);
70 Heap* heap() const { return ids_->heap(); } function in class:v8::internal::HeapProfiler
|
| transitions-inl.h | 20 #define CONDITIONAL_WRITE_BARRIER(heap, object, offset, value, mode) \
22 heap->incremental_marking()->RecordWrite( \
24 if (heap->InNewSpace(value)) { \
25 heap->RecordWrite(object->address(), offset); \
48 Heap* heap = GetHeap(); local
51 heap, this, kBackPointerStorageOffset, back_pointer, mode);
72 Heap* heap = GetHeap(); local
75 heap, this, kPrototypeTransitionsOffset, transitions, mode)
[all...] |
| handles-inl.h | 11 #include "src/heap/heap.h"
61 Heap* heap = heap_object->GetHeap(); local
63 Object** roots_array_start = heap->roots_array_start();
65 handle < roots_array_start + Heap::kStrongRootListLength &&
66 heap->RootCanBeTreatedAsConstant(
67 static_cast<Heap::RootListIndex>(handle - roots_array_start))) {
77 return !heap->isolate()->IsDeferredHandle(handle);
|
| /art/compiler/ |
| image_test.cc | 119 gc::Heap* heap = Runtime::Current()->GetHeap(); local
120 ASSERT_TRUE(!heap->GetContinuousSpaces().empty());
121 gc::space::ContinuousSpace* space = heap->GetNonMovingSpace();
165 gc::Heap* heap = Runtime::Current()->GetHeap(); local
166 ASSERT_TRUE(heap->HasImageSpace());
167 ASSERT_TRUE(heap->GetNonMovingSpace()->IsMallocSpace());
169 gc::space::ImageSpace* image_space = heap->GetImageSpace();
|
| /external/bzip2/ |
| huffman.c | 36 zz = z; tmp = heap[zz]; \
37 while (weight[tmp] < weight[heap[zz >> 1]]) { \
38 heap[zz] = heap[zz >> 1]; \
41 heap[zz] = tmp; \
47 zz = z; tmp = heap[zz]; \
52 weight[heap[yy+1]] < weight[heap[yy]]) \
54 if (weight[tmp] < weight[heap[yy]]) break; \
55 heap[zz] = heap[yy];
75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_mm.c | 59 struct mem_block *heap; member in struct:mm_pb_manager
204 mm_buf->block = u_mmAllocMem(mm->heap, (int)size, (int)mm->align2, 0);
207 debug_printf("warning: heap full\n");
208 mmDumpMemInfo(mm->heap);
238 u_mmDestroy(mm->heap);
279 mm->heap = u_mmInit(0, (int)size);
280 if (!mm->heap)
286 if(mm->heap)
287 u_mmDestroy(mm->heap);
|
| /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...] |
