/* SPDX-License-Identifier: GPL-2.0 */ #ifndef __NVKM_MM_H__ #define __NVKM_MM_H__ #include <core/os.h> struct nvkm_mm_node { struct list_head nl_entry; struct list_head fl_entry; struct nvkm_mm_node *next; #define NVKM_MM_HEAP_ANY 0x00 u8 heap; #define NVKM_MM_TYPE_NONE 0x00 #define NVKM_MM_TYPE_HOLE 0xff u8 type; u32 offset; u32 length; }; struct nvkm_mm { struct list_head nodes; struct list_head free; u32 block_size; int heap_nodes; }; static inline bool nvkm_mm_initialised(struct nvkm_mm *mm) { return mm->heap_nodes; } int nvkm_mm_init(struct nvkm_mm *, u8 heap, u32 offset, u32 length, u32 block); int nvkm_mm_fini(struct nvkm_mm *); int nvkm_mm_head(struct nvkm_mm *, u8 heap, u8 type, u32 size_max, u32 size_min, u32 align, struct nvkm_mm_node **); int nvkm_mm_tail(struct nvkm_mm *, u8 heap, u8 type, u32 size_max, u32 size_min, u32 align, struct nvkm_mm_node **); void nvkm_mm_free(struct nvkm_mm *, struct nvkm_mm_node **); void nvkm_mm_dump(struct nvkm_mm *, const char *); static inline u32 nvkm_mm_heap_size(struct nvkm_mm *mm, u8 heap) { struct nvkm_mm_node *node; u32 size = 0; list_for_each_entry(node, &mm->nodes, nl_entry) { if (node->heap == heap) size += node->length; } return size; } static inline bool nvkm_mm_contiguous(struct nvkm_mm_node *node) { return !node->next; } static inline u32 nvkm_mm_addr(struct nvkm_mm_node *node) { if (WARN_ON(!nvkm_mm_contiguous(node))) return 0; return node->offset; } static inline u32 nvkm_mm_size(struct nvkm_mm_node *node) { u32 size = 0; do { size += node->length; } while ((node = node->next)); return size; } #endif