Function malloc_elem_resize

dpdk/lib/eal/common/malloc_elem.c:664–702

* attempt to resize a malloc_elem by expanding into any free space * immediately after it in memory. */

 * immediately after it in memory.
 */
int
malloc_elem_resize(struct malloc_elem *elem, size_t size)
{
	const size_t new_size = size + elem->pad + MALLOC_ELEM_OVERHEAD;

	/* if we request a smaller size, then always return ok */
	if (elem->size >= new_size) {
		asan_clear_alloczone(elem);
		return 0;
	}

	/* check if there is a next element, it's free and adjacent */
	if (!elem->next || elem->next->state != ELEM_FREE ||
			!next_elem_is_adjacent(elem))
		return -1;
	if (elem->size + elem->next->size < new_size)
		return -1;

	/* we now know the element fits, so remove from free list,
	 * join the two
	 */
	malloc_elem_free_list_remove(elem->next);
	join_elem(elem, elem->next);

	if (elem->size - new_size >= MIN_DATA_SIZE + MALLOC_ELEM_OVERHEAD) {
		/* now we have a big block together. Lets cut it down a bit, by splitting */
		struct malloc_elem *split_pt = RTE_PTR_ADD(elem, new_size);
		split_pt = RTE_PTR_ALIGN_CEIL(split_pt, RTE_CACHE_LINE_SIZE);

		asan_clear_split_alloczone(split_pt);

		split_elem(elem, split_pt);
		malloc_elem_free_list_insert(split_pt);
	}

	asan_clear_alloczone(elem);

	return 0;
}

static inline const char *
elem_state_to_str(enum elem_state state)