Lines Matching refs:node
39 struct list_node node; member
82 list_for_every_entry(&theheap.free_list, chunk, struct free_heap_chunk, node) { in miniheap_dump()
104 list_for_every_entry(&theheap.free_list, next_chunk, struct free_heap_chunk, node) { in heap_insert_free_chunk()
108 list_add_before(&next_chunk->node, &chunk->node); in heap_insert_free_chunk()
115 list_add_tail(&theheap.free_list, &chunk->node); in heap_insert_free_chunk()
119 last_chunk = list_prev_type(&theheap.free_list, &chunk->node, struct free_heap_chunk, node); in heap_insert_free_chunk()
126 list_delete(&chunk->node); in heap_insert_free_chunk()
141 list_delete(&next_chunk->node); in heap_insert_free_chunk()
208 list_for_every_entry(&theheap.free_list, chunk, struct free_heap_chunk, node) { in miniheap_alloc()
216 struct list_node *next_node = list_next(&theheap.free_list, &chunk->node); in miniheap_alloc()
217 list_delete(&chunk->node); in miniheap_alloc()
228 list_add_before(next_node, &newchunk->node); in miniheap_alloc()
230 list_add_tail(&theheap.free_list, &newchunk->node); in miniheap_alloc()
353 list_for_every_entry_safe(&theheap.free_list, chunk, next_chunk, struct free_heap_chunk, node) { in miniheap_trim()
378 list_delete(&chunk->node); in miniheap_trim()
411 list_add_after(&chunk->node, &new_chunk->node); in miniheap_trim()
417 list_delete(&chunk->node); in miniheap_trim()
447 list_for_every_entry(&theheap.free_list, chunk, struct free_heap_chunk, node) { in miniheap_get_stats()