31 static void finsh_block_insert(struct finsh_block_header** list, struct finsh_block_header* header);
32 static void finsh_block_remove(struct finsh_block_header** list, struct finsh_block_header* header);
34 static void finsh_block_merge(struct finsh_block_header** list, struct finsh_block_header* header);
41     /* init free and alloc list */  in finsh_heap_init()
81     /* remove from free list */  in finsh_heap_allocate()
85     /* insert to allocate list */  in finsh_heap_allocate()
103     /* remove from allocate list */  in finsh_heap_free()
106     /* insert to free list */  in finsh_heap_free()
145  * insert a block to list
147 void finsh_block_insert(struct finsh_block_header** list, struct finsh_block_header* header)  in finsh_block_insert()  argument
151     if (*list == NULL)  in finsh_block_insert()
153         *list = header;  in finsh_block_insert()
158     node = *list;  in finsh_block_insert()
162         /* insert node in the header of list */  in finsh_block_insert()
164         *list = header;  in finsh_block_insert()
170         for (node = *list; node; node = node->next)  in finsh_block_insert()
184  * remove block from list
186 void finsh_block_remove(struct finsh_block_header** list, struct finsh_block_header* header)  in finsh_block_remove()  argument
190     node = *list;  in finsh_block_remove()
193         /* remove list header */  in finsh_block_remove()
194         *list = header->next;  in finsh_block_remove()
200     for (node = *list; node != NULL; node = node->next)  in finsh_block_remove()
229 void finsh_block_merge(struct finsh_block_header** list, struct finsh_block_header* header)  in finsh_block_merge()  argument
236     if (*list == header) prev_node = NULL;  in finsh_block_merge()
240         for (prev_node = *list; prev_node; prev_node =prev_node->next)  in finsh_block_merge()