Searched refs:prev (Results 1 – 4 of 4) sorted by relevance
52 next_ptr->next->prev = next_ptr->prev; in _remove_next_ptr()53 next_ptr->prev->next = next_ptr->next; in _remove_next_ptr()101 item->prev = RT_NULL; in rt_memheap_init()113 item->prev = RT_NULL; in rt_memheap_init()123 item->prev = item->next; in rt_memheap_init()251 header_ptr->prev, in rt_memheap_alloc()527 header_ptr->prev, in rt_memheap_realloc()542 header_ptr->next->prev = new_ptr; in rt_memheap_realloc()651 header_ptr->prev); in rt_memheap_free()658 (header_ptr->next)->prev = header_ptr->prev; in rt_memheap_free()[all …]
219 struct rt_slab_page **prev; in rt_slab_page_alloc() local225 for (prev = &slab->page_list; (b = *prev) != RT_NULL; prev = &(b->next)) in rt_slab_page_alloc()233 *prev = n; in rt_slab_page_alloc()240 *prev = b->next; in rt_slab_page_alloc()260 struct rt_slab_page **prev; in rt_slab_page_free() local269 for (prev = &slab->page_list; (b = *prev) != RT_NULL; prev = &(b->next)) in rt_slab_page_free()288 *prev = n; in rt_slab_page_free()298 *prev = n; in rt_slab_page_free()
63 rt_size_t prev; /**< prev free item */ member141 … ((struct rt_small_mem_item *)&m->heap_ptr[nmem->next])->prev = (rt_uint8_t *)mem - m->heap_ptr; in plug_holes()145 pmem = (struct rt_small_mem_item *)&m->heap_ptr[mem->prev]; in plug_holes()155 … ((struct rt_small_mem_item *)&m->heap_ptr[mem->next])->prev = (rt_uint8_t *)pmem - m->heap_ptr; in plug_holes()216 mem->prev = 0; in rt_smem_init()225 small_mem->heap_end->prev = small_mem->mem_size_aligned + SIZEOF_STRUCT_MEM; in rt_smem_init()329 mem2->prev = ptr; in rt_smem_alloc()339 ((struct rt_small_mem_item *)&small_mem->heap_ptr[mem2->next])->prev = ptr2; in rt_smem_alloc()458 mem2->prev = ptr; in rt_smem_realloc()465 ((struct rt_small_mem_item *)&small_mem->heap_ptr[mem2->next])->prev = ptr2; in rt_smem_realloc()
428 for (; row_head[row_lvl] != timer_list[row_lvl].prev; in _timer_start()
Completed in 10 milliseconds