Lines Matching full:next
19 struct finsh_block_header* next; local
44 free_list->next = NULL; in finsh_heap_init()
63 header = header->next) ; in finsh_heap_allocate()
72 header = header->next) ; in finsh_heap_allocate()
83 header->next = NULL; in finsh_heap_allocate()
134 header = header->next; in finsh_heap_gc()
163 header->next = node; in finsh_block_insert()
170 for (node = *list; node; node = node->next) in finsh_block_insert()
172 if (node->next > header) break; in finsh_block_insert()
174 if (node->next == NULL) break; in finsh_block_insert()
179 if (node->next != NULL) header->next = node->next; in finsh_block_insert()
180 node->next = header; in finsh_block_insert()
194 *list = header->next; in finsh_block_remove()
195 header->next = NULL; in finsh_block_remove()
200 for (node = *list; node != NULL; node = node->next) in finsh_block_remove()
202 if (node->next == header) in finsh_block_remove()
204 node->next = header->next; in finsh_block_remove()
215 struct finsh_block_header* next; in finsh_block_split() local
219 * header->next->... in finsh_block_split()
221 next = BLOCK_HEADER((uint8_t*)header + sizeof(struct finsh_block_header) + size); in finsh_block_split()
222 next->length = header->length - sizeof(struct finsh_block_header) - size; in finsh_block_split()
224 next->next = header->next; in finsh_block_split()
226 header->next = next; in finsh_block_split()
234 next_node = header->next; in finsh_block_merge()
240 for (prev_node = *list; prev_node; prev_node =prev_node->next) in finsh_block_merge()
242 if (prev_node->next == header) in finsh_block_merge()
254 /* is it close to next node? */ in finsh_block_merge()
263 prev_node->next = next_node->next; in finsh_block_merge()
268 prev_node->next = header->next; in finsh_block_merge()
277 header->next = next_node->next; in finsh_block_merge()