[dpdk-dev] [PATCH 2/5] mempool: reduce wasted space on mempool populate

Andrew Rybchenko arybchenko at solarflare.com
Tue Oct 29 11:09:01 CET 2019


On 10/28/19 5:01 PM, Olivier Matz wrote:
> The size returned by rte_mempool_op_calc_mem_size_default() is aligned
> to the specified page size. Therefore, with big pages, the returned size
> can be much more that what we really need to populate the mempool.
>
> For instance, populating a mempool that requires 1.1GB of memory with
> 1GB hugepages can result in allocating 2GB of memory.
>
> This problem is hidden most of the time due to the allocation method of
> rte_mempool_populate_default(): when try_iova_contig_mempool=true, it
> first tries to allocate an iova contiguous area, without the alignment
> constraint. If it fails, it fallbacks to an aligned allocation that does
> not require to be iova-contiguous. This can also fallback into several
> smaller aligned allocations.
>
> This commit changes rte_mempool_op_calc_mem_size_default() to relax the
> alignment constraint to a cache line and to return a smaller size.
>
> Signed-off-by: Olivier Matz <olivier.matz at 6wind.com>

One may be unrelated questions below

Reviewed-by: Andrew Rybdhenko <arybchenko at solarflare.com>

[snip]

> diff --git a/lib/librte_mempool/rte_mempool_ops_default.c b/lib/librte_mempool/rte_mempool_ops_default.c
> index 4e2bfc82d..f6aea7662 100644
> --- a/lib/librte_mempool/rte_mempool_ops_default.c
> +++ b/lib/librte_mempool/rte_mempool_ops_default.c
> @@ -12,7 +12,7 @@ rte_mempool_op_calc_mem_size_default(const struct rte_mempool *mp,
>   				     size_t *min_chunk_size, size_t *align)
>   {
>   	size_t total_elt_sz;
> -	size_t obj_per_page, pg_num, pg_sz;
> +	size_t obj_per_page, pg_sz, objs_in_last_page;
>   	size_t mem_size;
>   
>   	total_elt_sz = mp->header_size + mp->elt_size + mp->trailer_size;
> @@ -33,14 +33,30 @@ rte_mempool_op_calc_mem_size_default(const struct rte_mempool *mp,
>   			mem_size =
>   				RTE_ALIGN_CEIL(total_elt_sz, pg_sz) * obj_num;
>   		} else {
> -			pg_num = (obj_num + obj_per_page - 1) / obj_per_page;
> -			mem_size = pg_num << pg_shift;
> +			/* In the best case, the allocator will return a
> +			 * page-aligned address. For example, with 5 objs,
> +			 * the required space is as below:
> +			 *  |     page0     |     page1     |  page2 (last) |
> +			 *  |obj0 |obj1 |xxx|obj2 |obj3 |xxx|obj4|
> +			 *  <------------- mem_size ------------->
> +			 */
> +			objs_in_last_page = ((obj_num - 1) % obj_per_page) + 1;
> +			/* room required for the last page */
> +			mem_size = objs_in_last_page * total_elt_sz;
> +			/* room required for other pages */
> +			mem_size += ((obj_num - objs_in_last_page) /
> +				obj_per_page) << pg_shift;
> +
> +			/* In the worst case, the allocator returns a
> +			 * non-aligned pointer, wasting up to
> +			 * total_elt_sz. Add a margin for that.
> +			 */
> +			 mem_size += total_elt_sz - 1;
>   		}
>   	}
>   
> -	*min_chunk_size = RTE_MAX((size_t)1 << pg_shift, total_elt_sz);
> -
> -	*align = RTE_MAX((size_t)RTE_CACHE_LINE_SIZE, (size_t)1 << pg_shift);
> +	*min_chunk_size = total_elt_sz;
> +	*align = RTE_CACHE_LINE_SIZE;

Not directly related to the patch, but may be RTE_MEMPOOL_ALIGN should be
used?

>   
>   	return mem_size;
>   }



More information about the dev mailing list