37 #define MEMITEM_SIZE(item)      ((rt_ubase_t)item->next - (rt_ubase_t)item - RT_MEMHEAP_SIZE)
71     item->next      = RT_NULL;  in rt_memheap_init()
83     item->next      = RT_NULL;  in rt_memheap_init()
88     item->next = (struct rt_memheap_item *)  in rt_memheap_init()
90     item->prev = item->next;  in rt_memheap_init()
104     item = item->next;  in rt_memheap_init()
108     item->next      = (struct rt_memheap_item *)start_addr;  in rt_memheap_init()
177                 /* move to next free memory block */  in rt_memheap_alloc()
199                               header_ptr->next,  in rt_memheap_alloc()
211                 new_ptr->next          = header_ptr->next;  in rt_memheap_alloc()
212                 header_ptr->next->prev = new_ptr;  in rt_memheap_alloc()
213                 header_ptr->next       = new_ptr;  in rt_memheap_alloc()
328         next_ptr = header_ptr->next;  in rt_memheap_realloc()
342              * the next free node without alloc/memcpy, |*| is the control  in rt_memheap_realloc()
366                 next_ptr->next->prev = next_ptr->prev;  in rt_memheap_realloc()
367                 next_ptr->prev->next = next_ptr->next;  in rt_memheap_realloc()
375                               next_ptr->next,  in rt_memheap_realloc()
385                 next_ptr->next          = header_ptr->next;  in rt_memheap_realloc()
386                 header_ptr->next->prev = next_ptr;  in rt_memheap_realloc()
387                 header_ptr->next       = next_ptr;  in rt_memheap_realloc()
439                   header_ptr->next,  in rt_memheap_realloc()
450     new_ptr->next          = header_ptr->next;  in rt_memheap_realloc()
451     header_ptr->next->prev = new_ptr;  in rt_memheap_realloc()
452     header_ptr->next       = new_ptr;  in rt_memheap_realloc()
454     /* determine if the block can be merged with the next neighbor. */  in rt_memheap_realloc()
455     if (!RT_MEMHEAP_IS_USED(new_ptr->next))  in rt_memheap_realloc()
459         /* merge block with next neighbor. */  in rt_memheap_realloc()
460         free_ptr = new_ptr->next;  in rt_memheap_realloc()
467         free_ptr->next->prev = new_ptr;  in rt_memheap_realloc()
468         new_ptr->next   = free_ptr->next;  in rt_memheap_realloc()
518     RT_ASSERT((header_ptr->next->magic & RT_MEMHEAP_MASK) == RT_MEMHEAP_MAGIC);  in rt_memheap_free()
550         (header_ptr->prev)->next = header_ptr->next;  in rt_memheap_free()
551         (header_ptr->next)->prev = header_ptr->prev;  in rt_memheap_free()
559     /* determine if the block can be merged with the next neighbor. */  in rt_memheap_free()
560     if (!RT_MEMHEAP_IS_USED(header_ptr->next))  in rt_memheap_free()
565         /* merge block with next neighbor. */  in rt_memheap_free()
566         new_ptr = header_ptr->next;  in rt_memheap_free()
572         new_ptr->next->prev = header_ptr;  in rt_memheap_free()
573         header_ptr->next    = new_ptr->next;  in rt_memheap_free()
626         for (node  = information->object_list.next;  in rt_malloc()
628              node  = node->next)  in rt_malloc()