Lines Matching full:free
67 /* initialize the free list header */ in rt_memheap_init()
76 /* set the free list to free list header */ in rt_memheap_init()
95 /* place the big memory block to free list */ in rt_memheap_init()
110 /* not in free list */ in rt_memheap_init()
117 ("memory heap: start addr 0x%08x, size %d, free list header 0x%08x\n", in rt_memheap_init()
157 /* search on free list */ in rt_memheap_alloc()
169 /* get the first free memory block */ in rt_memheap_alloc()
177 /* move to next free memory block */ in rt_memheap_alloc()
215 /* remove header ptr from free list */ in rt_memheap_alloc()
221 /* insert new_ptr to free list */ in rt_memheap_alloc()
239 /* decrement the entire free size from the available bytes count. */ in rt_memheap_alloc()
244 /* remove header_ptr from free list */ in rt_memheap_alloc()
333 /* check whether the following free space is enough to expand */ in rt_memheap_realloc()
342 * the next free node without alloc/memcpy, |*| is the control in rt_memheap_realloc()
345 * oldsize free node in rt_memheap_realloc()
352 /* decrement the entire free size from the available bytes count. */ in rt_memheap_realloc()
357 /* remove next_ptr from free list */ in rt_memheap_realloc()
373 ("new free block: block[0x%08x] nextm[0x%08x] prevm[0x%08x]", in rt_memheap_realloc()
389 /* insert next_ptr to free list */ in rt_memheap_realloc()
470 /* remove free ptr from free list */ in rt_memheap_realloc()
475 /* insert the split block to free list */ in rt_memheap_realloc()
480 RT_DEBUG_LOG(RT_DEBUG_MEMHEAP, ("new free ptr: next_free 0x%08x, prev_free 0x%08x\n", in rt_memheap_realloc()
511 RT_DEBUG_LOG(RT_DEBUG_MEMHEAP, ("free memory: memory[0x%08x], block[0x%08x]\n", in rt_memheap_free()
555 /* don't insert header to free list */ in rt_memheap_free()
575 /* remove new ptr from free list */ in rt_memheap_free()
582 /* no left merge, insert to free list */ in rt_memheap_free()
589 ("insert to free list: next_free 0x%08x, prev_free 0x%08x\n", in rt_memheap_free()