131 	elem->next = NULL;  in malloc_elem_init()
181 			while (prev_elem->next < elem)  in malloc_elem_insert()
182 				prev_elem = prev_elem->next;  in malloc_elem_insert()
183 			next_elem = prev_elem->next;  in malloc_elem_insert()
194 	elem->next = next_elem;  in malloc_elem_insert()
196 		prev_elem->next = elem;  in malloc_elem_insert()
293 	struct malloc_elem *next_elem = elem->next;  in split_elem()
300 	split_pt->next = next_elem;  in split_elem()
305 	elem->next = split_pt;  in split_elem()
321 	struct malloc_elem *next, *prev;  in remove_elem()  local
322 	next = elem->next;  in remove_elem()
325 	if (next)  in remove_elem()
326 		next->prev = prev;  in remove_elem()
330 		prev->next = next;  in remove_elem()
332 		elem->heap->first = next;  in remove_elem()
335 	elem->next = NULL;  in remove_elem()
344 	return elem->next == RTE_PTR_ADD(elem, elem->size) &&  in next_elem_is_adjacent()
345 			elem->next->msl == elem->msl &&  in next_elem_is_adjacent()
347 			 elem->orig_elem == elem->next->orig_elem);  in next_elem_is_adjacent()
497 	struct malloc_elem *next = elem2->next;  in join_elem()  local
499 	if (next)  in join_elem()
500 		next->prev = elem1;  in join_elem()
503 	elem1->next = next;  in join_elem()
518 	if (elem->next != NULL && elem->next->state == ELEM_FREE &&  in malloc_elem_join_adjacent_free()
524 		erase = RTE_PTR_SUB(elem->next, MALLOC_ELEM_TRAILER_LEN);  in malloc_elem_join_adjacent_free()
525 		erase_len = MALLOC_ELEM_OVERHEAD + elem->next->pad;  in malloc_elem_join_adjacent_free()
528 		malloc_elem_free_list_remove(elem->next);  in malloc_elem_join_adjacent_free()
529 		join_elem(elem, elem->next);  in malloc_elem_join_adjacent_free()
611 	struct malloc_elem *hide_start, *hide_end, *prev, *next;  in malloc_elem_hide_region()  local
618 	next = elem->next;  in malloc_elem_hide_region()
621 	if (next && next_elem_is_adjacent(elem)) {  in malloc_elem_hide_region()
622 		len_after = RTE_PTR_DIFF(next, hide_end);  in malloc_elem_hide_region()
676 	if (!elem->next || elem->next->state != ELEM_FREE ||  in malloc_elem_resize()
679 	if (elem->size + elem->next->size < new_size)  in malloc_elem_resize()
685 	malloc_elem_free_list_remove(elem->next);  in malloc_elem_resize()
686 	join_elem(elem, elem->next);  in malloc_elem_resize()
724 	fprintf(f, "  prev: %p next: %p\n", elem->prev, elem->next);  in malloc_elem_dump()