| /hardware/google/gfxstream/guest/mesa/src/util/ |
| D | u_mm.c | 34 u_mmDumpMemInfo(const struct mem_block *heap) in u_mmDumpMemInfo() argument
36 debug_printf("Memory heap %p:\n", (void *) heap); in u_mmDumpMemInfo()
37 if (heap == NULL) { in u_mmDumpMemInfo()
44 for (p = heap->next; p != heap; p = p->next) { in u_mmDumpMemInfo()
58 for (p = heap->next_free; p != heap; p = p->next_free) { in u_mmDumpMemInfo()
72 struct mem_block *heap, *block; in u_mmInit() local
77 heap = CALLOC_STRUCT(mem_block); in u_mmInit()
78 if (!heap) in u_mmInit()
83 FREE(heap); in u_mmInit()
87 heap->next = block; in u_mmInit()
[all …]
|
| D | vma.c | 47 util_vma_heap_init(struct util_vma_heap *heap, in util_vma_heap_init() argument
50 list_inithead(&heap->holes); in util_vma_heap_init()
51 heap->free_size = 0; in util_vma_heap_init()
53 util_vma_heap_free(heap, start, size); in util_vma_heap_init()
56 heap->alloc_high = true; in util_vma_heap_init()
59 heap->nospan_shift = 0; in util_vma_heap_init()
63 util_vma_heap_finish(struct util_vma_heap *heap) in util_vma_heap_finish() argument
65 util_vma_foreach_hole_safe(hole, heap) in util_vma_heap_finish()
71 util_vma_heap_validate(struct util_vma_heap *heap) in util_vma_heap_validate() argument
75 util_vma_foreach_hole(hole, heap) { in util_vma_heap_validate()
[all …]
|
| D | vma.h | 56 void util_vma_heap_init(struct util_vma_heap *heap,
58 void util_vma_heap_finish(struct util_vma_heap *heap);
60 uint64_t util_vma_heap_alloc(struct util_vma_heap *heap,
63 bool util_vma_heap_alloc_addr(struct util_vma_heap *heap,
66 void util_vma_heap_free(struct util_vma_heap *heap,
69 void util_vma_heap_print(struct util_vma_heap *heap, FILE *fp,
|
| D | u_mm.h | 40 struct mem_block *heap; member
64 extern struct mem_block *u_mmAllocMem(struct mem_block *heap, int size, int align2,
79 extern struct mem_block *u_mmFindBlock(struct mem_block *heap, int start);
|
| /hardware/google/graphics/common/libion/test/ |
| D | map_test.cpp | 31 struct ion_heap_data *heap = (struct ion_heap_data *)m_heap_query.heaps; in TEST_F() local
34 unsigned int heapMask = 1 << heap[i].heap_id; in TEST_F()
58 struct ion_heap_data *heap = (struct ion_heap_data *)m_heap_query.heaps; in TEST_F() local
61 unsigned int heapMask = 1 << heap[i].heap_id; in TEST_F()
92 struct ion_heap_data *heap = (struct ion_heap_data *)m_heap_query.heaps; in TEST_F() local
95 unsigned int heapMask = 1 << heap[i].heap_id; in TEST_F()
120 struct ion_heap_data *heap = (struct ion_heap_data *)m_heap_query.heaps; in TEST_F() local
123 unsigned int heapMask = 1 << heap[i].heap_id; in TEST_F()
162 struct ion_heap_data *heap = (struct ion_heap_data *)m_heap_query.heaps; in TEST_F() local
165 unsigned int heapMask = 1 << heap[i].heap_id; in TEST_F()
|
| /hardware/qcom/gps/msm8996/utils/ |
| D | LocHeap.cpp | 312 LocHeapDebug heap; in main() local
316 if (i % checks == 0 && !heap.checkTree()) { in main()
323 heap.push(dynamic_cast<LocRankable&>(*data)); in main()
326 LocRankable* rankable = heap.pop(); in main()
333 printf("%s: %d == %d\n", (r&1)?"push":"pop", treeSize, heap.getTreeSize()); in main()
334 if (treeSize != heap.getTreeSize()) { in main()
341 if (!heap.checkTree()) { in main()
347 for (LocRankable* data = heap.pop(); NULL != data; data = heap.pop()) { in main()
|
| /hardware/qcom/gps/msm8909w_3100/utils/ |
| D | LocHeap.cpp | 312 LocHeapDebug heap; in main() local
316 if (i % checks == 0 && !heap.checkTree()) { in main()
323 heap.push(dynamic_cast<LocRankable&>(*data)); in main()
326 LocRankable* rankable = heap.pop(); in main()
333 printf("%s: %d == %d\n", (r&1)?"push":"pop", treeSize, heap.getTreeSize()); in main()
334 if (treeSize != heap.getTreeSize()) { in main()
341 if (!heap.checkTree()) { in main()
347 for (LocRankable* data = heap.pop(); NULL != data; data = heap.pop()) { in main()
|
| /hardware/qcom/gps/msm8998/utils/ |
| D | LocHeap.cpp | 312 LocHeapDebug heap; in main() local
316 if (i % checks == 0 && !heap.checkTree()) { in main()
323 heap.push(dynamic_cast<LocRankable&>(*data)); in main()
326 LocRankable* rankable = heap.pop(); in main()
333 printf("%s: %d == %d\n", (r&1)?"push":"pop", treeSize, heap.getTreeSize()); in main()
334 if (treeSize != heap.getTreeSize()) { in main()
341 if (!heap.checkTree()) { in main()
347 for (LocRankable* data = heap.pop(); NULL != data; data = heap.pop()) { in main()
|
| /hardware/qcom/gps/msm8909/utils/ |
| D | LocHeap.cpp | 312 LocHeapDebug heap; in main() local
316 if (i % checks == 0 && !heap.checkTree()) { in main()
323 heap.push(dynamic_cast<LocRankable&>(*data)); in main()
326 LocRankable* rankable = heap.pop(); in main()
333 printf("%s: %d == %d\n", (r&1)?"push":"pop", treeSize, heap.getTreeSize()); in main()
334 if (treeSize != heap.getTreeSize()) { in main()
341 if (!heap.checkTree()) { in main()
347 for (LocRankable* data = heap.pop(); NULL != data; data = heap.pop()) { in main()
|
| /hardware/qcom/sm8150p/gps/utils/ |
| D | LocHeap.cpp | 312 LocHeapDebug heap; in main() local
316 if (i % checks == 0 && !heap.checkTree()) { in main()
323 heap.push(dynamic_cast<LocRankable&>(*data)); in main()
326 LocRankable* rankable = heap.pop(); in main()
333 printf("%s: %d == %d\n", (r&1)?"push":"pop", treeSize, heap.getTreeSize()); in main()
334 if (treeSize != heap.getTreeSize()) { in main()
341 if (!heap.checkTree()) { in main()
347 for (LocRankable* data = heap.pop(); NULL != data; data = heap.pop()) { in main()
|
| /hardware/qcom/sm7150/gps/utils/ |
| D | LocHeap.cpp | 312 LocHeapDebug heap; in main() local
316 if (i % checks == 0 && !heap.checkTree()) { in main()
323 heap.push(dynamic_cast<LocRankable&>(*data)); in main()
326 LocRankable* rankable = heap.pop(); in main()
333 printf("%s: %d == %d\n", (r&1)?"push":"pop", treeSize, heap.getTreeSize()); in main()
334 if (treeSize != heap.getTreeSize()) { in main()
341 if (!heap.checkTree()) { in main()
347 for (LocRankable* data = heap.pop(); NULL != data; data = heap.pop()) { in main()
|
| /hardware/google/gchips/gralloc4/src/allocator/ |
| D | mali_gralloc_ion.cpp | 75 for (const auto& heap: options) in find_first_available_heap() local
76 if (available_heaps.find(heap) != available_heaps.end()) in find_first_available_heap()
77 return heap; in find_first_available_heap()
182 for (const HeapSpecifier &heap : exact_usage_heaps) in select_dmabuf_heap() local
184 if (usage == heap.usage_bits) in select_dmabuf_heap()
186 return heap.name; in select_dmabuf_heap()
190 for (const HeapSpecifier &heap : inexact_usage_heaps) in select_dmabuf_heap() local
192 if ((usage & heap.usage_bits) == heap.usage_bits) in select_dmabuf_heap()
194 if (heap.name == kDmabufGcmaCameraUncachedHeapName && in select_dmabuf_heap()
197 else if (heap.name == kDmabufSystemUncachedHeapName && in select_dmabuf_heap()
[all …]
|
| /hardware/google/gfxstream/guest/android-emu/aemu/base/ |
| D | Pool.cpp | 303 delete info.heap; in ~Impl()
322 auto heap = mHeapInfos[index].heap; in alloc() local
324 if (heap->isFull()) { in alloc()
329 return heap->alloc(); in alloc()
349 info.heap->free(ptr); in free()
360 info.heap->freeAll(); in freeAll()
373 Heap* heap; member
|
| /hardware/google/gfxstream/codegen/vulkan/vulkan-docs-next/appendices/ |
| D | VK_EXT_memory_priority.adoc | 20 the implementation may transparently move memory from one heap to another
21 when a heap becomes full (for example, when the total memory used across all
22 processes exceeds the size of the heap).
|
| D | VK_EXT_memory_budget.adoc | 20 total memory budget for a memory heap.
25 can be used as a guideline for how much total memory from each heap the
32 display the **current process** estimated heap usage.
|
| D | VK_EXT_device_memory_report.adoc | 96 3) Should the callback be reporting which heap is used?
102 correspond to an advertised heap, rather than having a magic value
103 indicating a non-advertised heap.
121 Take the shader heap as an example.
123 same shader heap.
145 like size and heap index reported?
|
| D | VK_AMD_memory_overallocation_behavior.adoc | 22 device memory heap sizes (reported by
|
| D | VK_EXT_external_memory_host.adoc | 36 heap that is otherwise not usable for regular memory object allocation and
37 thus such a heap's size may be zero.
|
| D | VK_EXT_pageable_device_local_memory.adoc | 26 application may not be the full size of the memory heap at all times.
36 In reality the memory heap might not have been full, it just appeared to be
|
| /hardware/google/gfxstream/guest/mesa/src/util/tests/vma/ |
| D | vma_random_test.cpp | 78 util_vma_heap_init(&heap, MEM_START_PAGE * MEM_PAGE_SIZE, MEM_SIZE);
83 util_vma_heap_finish(&heap); in ~random_test()
112 uint64_t addr = util_vma_heap_alloc(&heap, size, align); in alloc()
162 util_vma_heap_free(&heap, a.start_page * MEM_PAGE_SIZE, in dealloc()
223 struct util_vma_heap heap; member
|
| /hardware/interfaces/cas/1.1/vts/functional/ |
| D | VtsHalCasV1_1TargetTest.cpp | 369 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); in descrambleTestInputBuffer() local
370 if (nullptr == heap.get()) { in descrambleTestInputBuffer()
379 sp<HidlMemory> hidlMemory = fromHeap(heap); in descrambleTestInputBuffer()
426 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); in descrambleTestOobInput() local
427 if (nullptr == heap.get()) { in descrambleTestOobInput()
433 sp<HidlMemory> hidlMemory = fromHeap(heap); in descrambleTestOobInput()
|
| /hardware/interfaces/cas/1.2/vts/functional/ |
| D | VtsHalCasV1_2TargetTest.cpp | 403 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); in descrambleTestInputBuffer() local
404 if (nullptr == heap.get()) { in descrambleTestInputBuffer()
413 sp<HidlMemory> hidlMemory = fromHeap(heap); in descrambleTestInputBuffer()
460 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); in descrambleTestOobInput() local
461 if (nullptr == heap.get()) { in descrambleTestOobInput()
467 sp<HidlMemory> hidlMemory = fromHeap(heap); in descrambleTestOobInput()
|
| /hardware/interfaces/cas/1.0/vts/functional/ |
| D | VtsHalCasV1_0TargetTest.cpp | 328 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); in descrambleTestInputBuffer() local
329 if (nullptr == heap.get()) { in descrambleTestInputBuffer()
338 sp<HidlMemory> hidlMemory = fromHeap(heap); in descrambleTestInputBuffer()
389 sp<IMemoryHeap> heap = mem->getMemory(&offset, &size); in descrambleTestOobInput() local
390 if (nullptr == heap.get()) { in descrambleTestOobInput()
396 sp<HidlMemory> hidlMemory = fromHeap(heap); in descrambleTestOobInput()
|
| /hardware/google/gfxstream/guest/mesa/src/vulkan/runtime/rmv/ |
| D | vk_rmv_tokens.h | 237 struct vk_rmv_heap_description heap; member
|
| /hardware/qcom/sm8150/media/ |
| D | configure.ac | 89 AC_ARG_ENABLE([targets-that-use-hevc-adsp-heap],
90 AC_HELP_STRING([-targets-that-use-hevc-adsp-heap],
|