1 /* SPDX-License-Identifier: GPL-2.0 */
7 struct list_head nl_entry;
8 struct list_head fl_entry;
9 struct nvkm_mm_node *next;
11 #define NVKM_MM_HEAP_ANY 0x00
13 #define NVKM_MM_TYPE_NONE 0x00
14 #define NVKM_MM_TYPE_HOLE 0xff
21 struct list_head nodes;
22 struct list_head free;
29 nvkm_mm_initialised(struct nvkm_mm *mm)
31 return mm->heap_nodes;
34 int nvkm_mm_init(struct nvkm_mm *, u8 heap, u32 offset, u32 length, u32 block);
35 int nvkm_mm_fini(struct nvkm_mm *);
36 int nvkm_mm_head(struct nvkm_mm *, u8 heap, u8 type, u32 size_max,
37 u32 size_min, u32 align, struct nvkm_mm_node **);
38 int nvkm_mm_tail(struct nvkm_mm *, u8 heap, u8 type, u32 size_max,
39 u32 size_min, u32 align, struct nvkm_mm_node **);
40 void nvkm_mm_free(struct nvkm_mm *, struct nvkm_mm_node **);
41 void nvkm_mm_dump(struct nvkm_mm *, const char *);
44 nvkm_mm_heap_size(struct nvkm_mm *mm, u8 heap)
46 struct nvkm_mm_node *node;
48 list_for_each_entry(node, &mm->nodes, nl_entry) {
49 if (node->heap == heap)
56 nvkm_mm_contiguous(struct nvkm_mm_node *node)
62 nvkm_mm_addr(struct nvkm_mm_node *node)
64 if (WARN_ON(!nvkm_mm_contiguous(node)))
70 nvkm_mm_size(struct nvkm_mm_node *node)
75 } while ((node = node->next));