HomeSort by relevance Sort by last modified time
    Searched defs:heap (Results 1 - 25 of 211) sorted by null

1 2 3 4 5 6 7 8 9

  /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/chromium_org/v8/src/
heap-profiler.h 31 #include "heap-snapshot-generator-inl.h"
40 #define HEAP_PROFILE(heap, call) \
42 v8::internal::HeapProfiler* profiler = heap->isolate()->heap_profiler(); \
50 explicit HeapProfiler(Heap* heap);
86 Heap* heap() const { return snapshots_->heap(); } function in class:v8::internal::HeapProfiler
ic-inl.h 83 Heap* heap = target->GetHeap(); local
95 if (heap->gc_state() == Heap::MARK_COMPACT) {
96 heap->mark_compact_collector()->RecordCodeTargetPatch(address, target);
98 heap->incremental_marking()->RecordCodeTargetPatch(address, target);
transitions-inl.h 44 #define CONDITIONAL_WRITE_BARRIER(heap, object, offset, value, mode) \
46 heap->incremental_marking()->RecordWrite( \
48 if (heap->InNewSpace(value)) { \
49 heap->RecordWrite(object->address(), offset); \
72 Heap* heap = GetHeap(); local
75 heap, this, kBackPointerStorageOffset, back_pointer, mode);
102 Heap* heap = GetHeap(); local
105 heap, this, kPrototypeTransitionsOffset, transitions, mode)
    [all...]
transitions.cc 39 Heap* heap = Isolate::Current()->heap(); local
43 MaybeObject* maybe_array = heap->AllocateFixedArray(length);
  /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)));
  /frameworks/native/services/surfaceflinger/tests/screencap/
screencap.cpp 42 sp<IMemoryHeap> heap; local
46 status_t err = composer->captureScreen(display, &heap, &w, &h, &f, 0, 0);
53 w, h, heap->getBase());
59 b.setPixels(heap->getBase());
  /art/runtime/gc/
heap_test.cc 31 Heap* heap = Runtime::Current()->GetHeap(); local
32 int64_t max_memory_before = heap->GetMaxMemory();
33 int64_t total_memory_before = heap->GetTotalMemory();
34 heap->ClearGrowthLimit();
35 int64_t max_memory_after = heap->GetMaxMemory();
36 int64_t total_memory_after = heap->GetTotalMemory();
  /art/runtime/
thread-inl.h 128 gc::Heap* heap = Runtime::Current()->GetHeap(); local
129 if (heap->IsObjectValidationEnabled()) {
  /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 64 Heap* heap = isolate->heap(); local
68 heap->CollectAllGarbage(Heap::kNoGCFlags, "counters extension");
106 AddNumber(result, heap->new_space()->Size(),
108 AddNumber(result, heap->new_space()->Available(),
110 AddNumber(result, heap->new_space()->CommittedMemory(),
112 AddNumber(result, heap->old_pointer_space()->Size(),
114 AddNumber(result, heap->old_pointer_space()->Available()
    [all...]
  /external/compiler-rt/lib/asan/lit_tests/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/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...]
  /art/runtime/mirror/
object.cc 26 #include "gc/heap.h"
47 gc::Heap* heap = Runtime::Current()->GetHeap(); local
48 SirtRef<Object> copy(self, heap->AllocObject(self, c, num_bytes));
64 heap->WriteBarrierArray(copy.get(), 0, array->GetLength());
73 heap->WriteBarrierField(copy.get(), field_offset, ref);
79 heap->AddFinalizerReference(Thread::Current(), copy.get());
object_array-inl.h 22 #include "gc/heap.h"
104 gc::Heap* heap = Runtime::Current()->GetHeap(); local
109 heap->VerifyObject(object);
124 heap->VerifyObject(object);
131 heap->WriteBarrierArray(dst, dst_pos, length);
array.cc 54 gc::Heap* heap = Runtime::Current()->GetHeap(); local
55 Array* array = down_cast<Array*>(heap->AllocObject(self, array_class, size));
  /bionic/libc/upstream-netbsd/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/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);

Completed in 1185 milliseconds

1 2 3 4 5 6 7 8 9