Home
last modified time | relevance | path

Searched refs:next_chunk (Results 1 – 2 of 2) sorted by relevance

/lk-master/lib/heap/miniheap/
A Dminiheap.c96 struct free_heap_chunk *next_chunk; in heap_insert_free_chunk() local
104 list_for_every_entry(&theheap.free_list, next_chunk, struct free_heap_chunk, node) { in heap_insert_free_chunk()
105 if (chunk < next_chunk) { in heap_insert_free_chunk()
106 DEBUG_ASSERT(chunk_end <= (vaddr_t)next_chunk); in heap_insert_free_chunk()
108 list_add_before(&next_chunk->node, &chunk->node); in heap_insert_free_chunk()
135 if (next_chunk) { in heap_insert_free_chunk()
136 if ((vaddr_t)chunk + chunk->len == (vaddr_t)next_chunk) { in heap_insert_free_chunk()
138 chunk->len += next_chunk->len; in heap_insert_free_chunk()
141 list_delete(&next_chunk->node); in heap_insert_free_chunk()
352 struct free_heap_chunk *next_chunk; in miniheap_trim() local
[all …]
/lk-master/external/lib/heap/dlmalloc/
A Ddlmalloc.c2329 #define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~FLAG_BITS))) macro
2333 #define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT)
3311 assert(is_mmapped(p) || pinuse(p) || next_chunk(prev_chunk(p)) == p); in do_check_inuse_chunk()
3432 q = next_chunk(p); in do_check_smallbin()
3498 q = next_chunk(q); in traverse_and_check()
3560 q = next_chunk(q); in internal_mallinfo()
3600 q = next_chunk(q); in internal_malloc_stats()
4245 mchunkptr mn = next_chunk(mem2chunk(m)); in sys_alloc()
5170 mchunkptr next = next_chunk(p); in internal_bulk_free()
5206 mchunkptr next = next_chunk(q); in internal_inspect_all()
[all …]

Completed in 16 milliseconds