139         QTAILQ_REMOVE(s->free, freenode, MLIST_ENTNAME);  in mlist_fulfill()
142         /* adjust the free node and create a new used node */  in mlist_fulfill()
160     QTAILQ_FOREACH(node, s->free, MLIST_ENTNAME) {  in mlist_check()
181     node = mlist_find_space(s->free, size);  in mlist_alloc()
205     /* Rip it out of the used list and re-insert back into the free list. */  in mlist_free()
207     mlist_sort_insert(s->free, node);  in mlist_free()
208     mlist_coalesce(s->free, node);  in mlist_free()
237     QTAILQ_FOREACH_SAFE(node, allocator->free, MLIST_ENTNAME, tmp) {  in alloc_destroy()
241                 fprintf(stderr, "Free list is corrupted.\n");  in alloc_destroy()
250     g_free(allocator->free);  in alloc_destroy()
297     s->free = g_new(MemList, 1);  in alloc_init()
299     QTAILQ_INIT(s->free);  in alloc_init()
302     QTAILQ_INSERT_HEAD(s->free, node, MLIST_ENTNAME);  in alloc_init()
327     QTAILQ_FOREACH_SAFE(node, dst->free, MLIST_ENTNAME, tmp) {  in migrate_allocator()
332     tmpfree = dst->free;  in migrate_allocator()
336     dst->free = src->free;  in migrate_allocator()
340     src->free = tmpfree;  in migrate_allocator()
342     QTAILQ_INIT(src->free);  in migrate_allocator()
344     QTAILQ_INSERT_HEAD(src->free, node, MLIST_ENTNAME);  in migrate_allocator()