32 static MemBlock *mlist_find_key(MemList *head, uint64_t addr)  in mlist_find_key()  argument
35     QTAILQ_FOREACH(node, head, MLIST_ENTNAME) {  in mlist_find_key()
43 static MemBlock *mlist_find_space(MemList *head, uint64_t size)  in mlist_find_space()  argument
47     QTAILQ_FOREACH(node, head, MLIST_ENTNAME) {  in mlist_find_space()
55 static MemBlock *mlist_sort_insert(MemList *head, MemBlock *insr)  in mlist_sort_insert()  argument
58     g_assert(head && insr);  in mlist_sort_insert()
60     QTAILQ_FOREACH(node, head, MLIST_ENTNAME) {  in mlist_sort_insert()
67     QTAILQ_INSERT_TAIL(head, insr, MLIST_ENTNAME);  in mlist_sort_insert()
76 static MemBlock *mlist_join(MemList *head, MemBlock *left, MemBlock *right)  in mlist_join()  argument
78     g_assert(head && left && right);  in mlist_join()
81     mlist_delete(head, right);  in mlist_join()
85 static void mlist_coalesce(MemList *head, MemBlock *node)  in mlist_coalesce()  argument
99             node = mlist_join(head, left, node);  in mlist_coalesce()
105             node = mlist_join(head, node, right);  in mlist_coalesce()