| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/d3d12/ |
| d3d12_descriptor_pool.cpp | 50 ID3D12DescriptorHeap *heap; member in struct:d3d12_descriptor_heap
66 struct d3d12_descriptor_heap *heap = CALLOC_STRUCT(d3d12_descriptor_heap); local
68 heap->desc.NumDescriptors = num_descriptors;
69 heap->desc.Type = type;
70 heap->desc.Flags = flags;
71 if (FAILED(dev->CreateDescriptorHeap(&heap->desc,
72 IID_PPV_ARGS(&heap->heap)))) {
73 FREE(heap);
77 heap->dev = dev
[all...] |
| d3d12_descriptor_pool.h | 40 struct d3d12_descriptor_heap *heap; member in struct:d3d12_descriptor_handle
46 return (handle->heap != NULL);
76 d3d12_descriptor_heap_free(struct d3d12_descriptor_heap *heap);
79 d3d12_descriptor_heap_get(struct d3d12_descriptor_heap *heap);
82 d2d12_descriptor_heap_get_next_handle(struct d3d12_descriptor_heap *heap,
86 d3d12_descriptor_heap_get_remaining_handles(struct d3d12_descriptor_heap *heap);
89 d3d12_descriptor_heap_alloc_handle(struct d3d12_descriptor_heap *heap,
93 d3d12_descriptor_heap_append_handles(struct d3d12_descriptor_heap *heap,
98 d3d12_descriptor_heap_clear(struct d3d12_descriptor_heap *heap);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 29 nouveau_heap_init(struct nouveau_heap **heap,
40 *heap = r;
45 nouveau_heap_destroy(struct nouveau_heap **heap)
47 if (!*heap)
49 free(*heap);
50 *heap = NULL;
54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
59 if (!heap || !size || !res || *res)
62 while (heap) {
63 if (!heap->in_use && heap->size >= size)
[all...] |
| nouveau_heap.h | 26 /* This datastructure represents a memory allocation heap. Fundamentally, this
35 * The first node will remain with in_use == 0 even if the whole heap is
38 * free nodes, they are merged into one, and the relevant heap entries are
41 * The pattern to free the whole heap is to start with the first node and then
44 * full size of the heap.
59 nouveau_heap_init(struct nouveau_heap **heap, unsigned start,
63 nouveau_heap_destroy(struct nouveau_heap **heap);
66 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 29 nouveau_heap_init(struct nouveau_heap **heap,
40 *heap = r;
45 nouveau_heap_destroy(struct nouveau_heap **heap)
47 if (!*heap)
49 free(*heap);
50 *heap = NULL;
54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
59 if (!heap || !size || !res || *res)
62 while (heap) {
63 if (!heap->in_use && heap->size >= size)
[all...] |
| nouveau_heap.h | 26 /* This datastructure represents a memory allocation heap. Fundamentally, this
35 * The first node will remain with in_use == 0 even if the whole heap is
38 * free nodes, they are merged into one, and the relevant heap entries are
41 * The pattern to free the whole heap is to start with the first node and then
44 * full size of the heap.
59 nouveau_heap_init(struct nouveau_heap **heap, unsigned start,
63 nouveau_heap_destroy(struct nouveau_heap **heap);
66 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| vma.h | 46 void util_vma_heap_init(struct util_vma_heap *heap,
48 void util_vma_heap_finish(struct util_vma_heap *heap);
50 uint64_t util_vma_heap_alloc(struct util_vma_heap *heap,
53 bool util_vma_heap_alloc_addr(struct util_vma_heap *heap,
56 void util_vma_heap_free(struct util_vma_heap *heap,
59 void util_vma_heap_print(struct util_vma_heap *heap, FILE *fp,
|
| u_mm.c | 34 u_mmDumpMemInfo(const struct mem_block *heap)
36 debug_printf("Memory heap %p:\n", (void *) heap);
37 if (heap == NULL) {
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...] |
| 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);
|
| vma.c | 46 util_vma_heap_init(struct util_vma_heap *heap,
49 list_inithead(&heap->holes);
50 util_vma_heap_free(heap, start, size);
53 heap->alloc_high = true;
57 util_vma_heap_finish(struct util_vma_heap *heap)
59 util_vma_foreach_hole_safe(hole, heap)
65 util_vma_heap_validate(struct util_vma_heap *heap)
68 util_vma_foreach_hole(hole, heap) {
72 if (&hole->link == heap->holes.next) {
91 #define util_vma_heap_validate(heap)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| vma.h | 39 void util_vma_heap_init(struct util_vma_heap *heap,
41 void util_vma_heap_finish(struct util_vma_heap *heap);
43 uint64_t util_vma_heap_alloc(struct util_vma_heap *heap,
46 void util_vma_heap_free(struct util_vma_heap *heap,
|
| vma.c | 42 util_vma_heap_init(struct util_vma_heap *heap,
45 list_inithead(&heap->holes);
46 util_vma_heap_free(heap, start, size);
50 util_vma_heap_finish(struct util_vma_heap *heap)
52 util_vma_foreach_hole_safe(hole, heap)
58 util_vma_heap_validate(struct util_vma_heap *heap)
61 util_vma_foreach_hole(hole, heap) {
65 if (&hole->link == heap->holes.next) {
84 #define util_vma_heap_validate(heap)
88 util_vma_heap_alloc(struct util_vma_heap *heap,
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/ |
| u_mm.c | 34 u_mmDumpMemInfo(const struct mem_block *heap)
36 debug_printf("Memory heap %p:\n", (void *) heap);
37 if (heap == NULL) {
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...] |
| 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);
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/main/ |
| mm.c | 33 mmDumpMemInfo(const struct mem_block *heap)
35 fprintf(stderr, "Memory heap %p:\n", (void *)heap);
36 if (heap == 0) {
37 fprintf(stderr, " heap == 0\n");
41 for(p = heap->next; p != heap; p = p->next) {
49 for(p = heap->next_free; p != heap; p = p->next_free) {
62 struct mem_block *heap, *block local
[all...] |
| 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);
|
| /xsrc/external/mit/libdrm/dist/intel/ |
| mm.c | 32 drm_private void mmDumpMemInfo(const struct mem_block *heap)
34 drmMsg("Memory heap %p:\n", (void *)heap);
35 if (heap == 0) {
36 drmMsg(" heap == 0\n");
40 for (p = heap->next; p != heap; p = p->next) {
48 for (p = heap->next_free; p != heap; p = p->next_free) {
60 struct mem_block *heap, *block local
[all...] |
| mm.h | 37 struct mem_block *heap; member in struct:mem_block
45 * return: a heap pointer if OK, NULL if error
56 * startSearch = linear offset from start of heap to begin search
59 drm_private extern struct mem_block *mmAllocMem(struct mem_block *heap,
|
| /xsrc/external/mit/libXt/dist/src/ |
| Alloc.c | 123 _XtHeapInit(Heap *heap)
125 heap->start = NULL;
126 heap->bytes_remaining = 0;
280 _XtHeapAlloc(Heap *heap, Cardinal bytes)
284 if (heap == NULL)
286 if (heap->bytes_remaining < (int) bytes) {
290 printf("allocating large segment (%d bytes) on heap %p\n",
291 bytes, heap);
354 XtPointer heap; member in struct:_Stats
[all...] |
| /xsrc/external/mit/glu/dist/src/libtess/ |
| priorityq.c | 41 /* Include all the code for the regular heap-based queue here. */
43 #include "priorityq-heap.c"
55 pq->heap = __gl_pqHeapNewPriorityQ( leq );
56 if (pq->heap == NULL) {
63 __gl_pqHeapDeletePriorityQ(pq->heap);
80 if (pq->heap != NULL) __gl_pqHeapDeletePriorityQ( pq->heap );
159 __gl_pqHeapInit( pq->heap ); /* always succeeds */
179 return __gl_pqHeapInsert( pq->heap, keyNew );
185 /* If the heap overflows, double its size. *
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/pipebuffer/ |
| pb_slab.h | 35 * meaning of each heap is treated as opaque by this library.
84 * for fulfilling allocation requests of the given size from the given heap.
94 unsigned heap,
122 /* One group per (heap, order, three_fourth_allocations). */
138 pb_slab_alloc(struct pb_slabs *slabs, unsigned size, unsigned heap);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/pipebuffer/ |
| pb_slab.h | 35 * meaning of each heap is treated as opaque by this library.
82 * for fulfilling allocation requests of the given size from the given heap.
92 unsigned heap,
119 /* One group per (heap, order) pair. */
135 pb_slab_alloc(struct pb_slabs *slabs, unsigned size, unsigned heap);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/nv30/ |
| nv30_vertprog.c | 89 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
94 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
95 while (heap->next && heap->size < vp->nr_insns) {
96 struct nouveau_heap **evict = heap->next->priv;
100 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
132 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local
137 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) {
138 while (heap->next && heap->size < vp->nr_consts)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/nv30/ |
| nv30_vertprog.c | 89 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
94 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
95 while (heap->next && heap->size < vp->nr_insns) {
96 struct nouveau_heap **evict = heap->next->priv;
100 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
132 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local
137 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) {
138 while (heap->next && heap->size < vp->nr_consts)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/amd/vulkan/winsys/amdgpu/ |
| radv_amdgpu_winsys.c | 75 struct amdgpu_heap_info heap; local
102 0, &heap);
103 return heap.heap_usage;
107 &heap);
108 return heap.heap_usage;
111 0, &heap);
112 return heap.heap_usage;
|
