From: "Ananyev, Konstantin" <konstantin.ananyev@intel.com>
To: Honnappa Nagarahalli <honnappa.nagarahalli@arm.com>,
"olivier.matz@6wind.com" <olivier.matz@6wind.com>,
"sthemmin@microsoft.com" <sthemmin@microsoft.com>,
"jerinj@marvell.com" <jerinj@marvell.com>,
"Richardson, Bruce" <bruce.richardson@intel.com>,
"david.marchand@redhat.com" <david.marchand@redhat.com>,
"pbhagavatula@marvell.com" <pbhagavatula@marvell.com>
Cc: "dev@dpdk.org" <dev@dpdk.org>,
"dharmik.thakkar@arm.com" <dharmik.thakkar@arm.com>,
"ruifeng.wang@arm.com" <ruifeng.wang@arm.com>,
"gavin.hu@arm.com" <gavin.hu@arm.com>, "nd@arm.com" <nd@arm.com>
Subject: Re: [dpdk-dev] [PATCH v7 03/17] test/ring: add functional tests for rte_ring_xxx_elem APIs
Date: Thu, 2 Jan 2020 16:31:51 +0000 [thread overview]
Message-ID: <SN6PR11MB2558F2FEDB0D4D1BC55AF6C19A200@SN6PR11MB2558.namprd11.prod.outlook.com> (raw)
In-Reply-To: <20191220044524.32910-4-honnappa.nagarahalli@arm.com>
Hi Honnappa,
> Add basic infrastructure to test rte_ring_xxx_elem APIs. Add
> test cases for testing burst and bulk tests.
>
> Signed-off-by: Honnappa Nagarahalli <honnappa.nagarahalli@arm.com>
> Reviewed-by: Gavin Hu <gavin.hu@arm.com>
> ---
> app/test/test_ring.c | 466 ++++++++++++++++++++-----------------------
> app/test/test_ring.h | 203 +++++++++++++++++++
> 2 files changed, 419 insertions(+), 250 deletions(-)
> create mode 100644 app/test/test_ring.h
>
> diff --git a/app/test/test_ring.c b/app/test/test_ring.c
> index aaf1e70ad..e7a8b468b 100644
> --- a/app/test/test_ring.c
> +++ b/app/test/test_ring.c
> @@ -23,11 +23,13 @@
> #include <rte_branch_prediction.h>
> #include <rte_malloc.h>
> #include <rte_ring.h>
> +#include <rte_ring_elem.h>
> #include <rte_random.h>
> #include <rte_errno.h>
> #include <rte_hexdump.h>
>
> #include "test.h"
> +#include "test_ring.h"
>
> /*
> * Ring
> @@ -67,6 +69,50 @@ static rte_atomic32_t synchro;
>
> #define TEST_RING_FULL_EMTPY_ITER 8
>
> +static int esize[] = {-1, 4, 8, 16};
> +
> +static void
> +test_ring_mem_init(void *obj, unsigned int count, int esize)
> +{
> + unsigned int i;
> +
> + /* Legacy queue APIs? */
> + if (esize == -1)
> + for (i = 0; i < count; i++)
> + ((void **)obj)[i] = (void *)(unsigned long)i;
> + else
> + for (i = 0; i < (count * esize / sizeof(uint32_t)); i++)
> + ((uint32_t *)obj)[i] = i;
> +}
> +
> +static void
> +test_ring_print_test_string(const char *istr, unsigned int api_type, int esize)
> +{
> + printf("\n%s: ", istr);
> +
> + if (esize == -1)
> + printf("legacy APIs: ");
> + else
> + printf("elem APIs: element size %dB ", esize);
> +
> + if (api_type == TEST_RING_IGNORE_API_TYPE)
> + return;
> +
> + if ((api_type & TEST_RING_N) == TEST_RING_N)
> + printf(": default enqueue/dequeue: ");
> + else if ((api_type & TEST_RING_S) == TEST_RING_S)
> + printf(": SP/SC: ");
> + else if ((api_type & TEST_RING_M) == TEST_RING_M)
> + printf(": MP/MC: ");
> +
> + if ((api_type & TEST_RING_SL) == TEST_RING_SL)
> + printf("single\n");
> + else if ((api_type & TEST_RING_BL) == TEST_RING_BL)
> + printf("bulk\n");
> + else if ((api_type & TEST_RING_BR) == TEST_RING_BR)
> + printf("burst\n");
> +}
> +
> /*
> * helper routine for test_ring_basic
> */
> @@ -314,286 +360,203 @@ test_ring_basic(struct rte_ring *r)
> return -1;
> }
>
> +/*
> + * Burst and bulk operations with sp/sc, mp/mc and default (during creation)
> + */
> static int
> -test_ring_burst_basic(struct rte_ring *r)
> +test_ring_burst_bulk_tests(unsigned int api_type)
> {
> + struct rte_ring *r;
> void **src = NULL, **cur_src = NULL, **dst = NULL, **cur_dst = NULL;
> int ret;
> - unsigned i;
> + unsigned int i, j;
> + unsigned int num_elems;
>
> - /* alloc dummy object pointers */
> - src = malloc(RING_SIZE*2*sizeof(void *));
> - if (src == NULL)
> - goto fail;
> -
> - for (i = 0; i < RING_SIZE*2 ; i++) {
> - src[i] = (void *)(unsigned long)i;
> - }
> - cur_src = src;
> + for (i = 0; i < RTE_DIM(esize); i++) {
> + test_ring_print_test_string("Test standard ring", api_type,
> + esize[i]);
>
> - /* alloc some room for copied objects */
> - dst = malloc(RING_SIZE*2*sizeof(void *));
> - if (dst == NULL)
> - goto fail;
> + /* Create the ring */
> + TEST_RING_CREATE("test_ring_burst_bulk_tests", esize[i],
> + RING_SIZE, SOCKET_ID_ANY, 0, r);
>
> - memset(dst, 0, RING_SIZE*2*sizeof(void *));
> - cur_dst = dst;
> -
> - printf("Test SP & SC basic functions \n");
> - printf("enqueue 1 obj\n");
> - ret = rte_ring_sp_enqueue_burst(r, cur_src, 1, NULL);
> - cur_src += 1;
> - if (ret != 1)
> - goto fail;
> -
> - printf("enqueue 2 objs\n");
> - ret = rte_ring_sp_enqueue_burst(r, cur_src, 2, NULL);
> - cur_src += 2;
> - if (ret != 2)
> - goto fail;
> -
> - printf("enqueue MAX_BULK objs\n");
> - ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - cur_src += MAX_BULK;
> - if (ret != MAX_BULK)
> - goto fail;
> -
> - printf("dequeue 1 obj\n");
> - ret = rte_ring_sc_dequeue_burst(r, cur_dst, 1, NULL);
> - cur_dst += 1;
> - if (ret != 1)
> - goto fail;
> -
> - printf("dequeue 2 objs\n");
> - ret = rte_ring_sc_dequeue_burst(r, cur_dst, 2, NULL);
> - cur_dst += 2;
> - if (ret != 2)
> - goto fail;
> + /* alloc dummy object pointers */
> + src = test_ring_calloc(RING_SIZE * 2, esize[i]);
> + if (src == NULL)
> + goto fail;
> + test_ring_mem_init(src, RING_SIZE * 2, esize[i]);
> + cur_src = src;
>
> - printf("dequeue MAX_BULK objs\n");
> - ret = rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK, NULL);
> - cur_dst += MAX_BULK;
> - if (ret != MAX_BULK)
> - goto fail;
> + /* alloc some room for copied objects */
> + dst = test_ring_calloc(RING_SIZE * 2, esize[i]);
> + if (dst == NULL)
> + goto fail;
> + cur_dst = dst;
>
> - /* check data */
> - if (memcmp(src, dst, cur_dst - dst)) {
> - rte_hexdump(stdout, "src", src, cur_src - src);
> - rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> - printf("data after dequeue is not the same\n");
> - goto fail;
> - }
> + printf("enqueue 1 obj\n");
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], 1, ret, api_type);
> + if (ret != 1)
> + goto fail;
> + TEST_RING_INCP(cur_src, esize[i], 1);
>
> - cur_src = src;
> - cur_dst = dst;
> + printf("enqueue 2 objs\n");
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], 2, ret, api_type);
> + if (ret != 2)
> + goto fail;
> + TEST_RING_INCP(cur_src, esize[i], 2);
>
> - printf("Test enqueue without enough memory space \n");
> - for (i = 0; i< (RING_SIZE/MAX_BULK - 1); i++) {
> - ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - cur_src += MAX_BULK;
> + printf("enqueue MAX_BULK objs\n");
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], MAX_BULK, ret,
> + api_type);
> if (ret != MAX_BULK)
> goto fail;
> - }
> -
> - printf("Enqueue 2 objects, free entries = MAX_BULK - 2 \n");
> - ret = rte_ring_sp_enqueue_burst(r, cur_src, 2, NULL);
> - cur_src += 2;
> - if (ret != 2)
> - goto fail;
> + TEST_RING_INCP(cur_src, esize[i], MAX_BULK);
>
> - printf("Enqueue the remaining entries = MAX_BULK - 2 \n");
> - /* Always one free entry left */
> - ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - cur_src += MAX_BULK - 3;
> - if (ret != MAX_BULK - 3)
> - goto fail;
> -
> - printf("Test if ring is full \n");
> - if (rte_ring_full(r) != 1)
> - goto fail;
> + printf("dequeue 1 obj\n");
> + TEST_RING_DEQUEUE(r, cur_dst, esize[i], 1, ret, api_type);
> + if (ret != 1)
> + goto fail;
> + TEST_RING_INCP(cur_dst, esize[i], 1);
>
> - printf("Test enqueue for a full entry \n");
> - ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - if (ret != 0)
> - goto fail;
> + printf("dequeue 2 objs\n");
> + TEST_RING_DEQUEUE(r, cur_dst, esize[i], 2, ret, api_type);
> + if (ret != 2)
> + goto fail;
> + TEST_RING_INCP(cur_dst, esize[i], 2);
>
> - printf("Test dequeue without enough objects \n");
> - for (i = 0; i<RING_SIZE/MAX_BULK - 1; i++) {
> - ret = rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK, NULL);
> - cur_dst += MAX_BULK;
> + printf("dequeue MAX_BULK objs\n");
> + TEST_RING_DEQUEUE(r, cur_dst, esize[i], MAX_BULK, ret,
> + api_type);
> if (ret != MAX_BULK)
> goto fail;
> - }
> -
> - /* Available memory space for the exact MAX_BULK entries */
> - ret = rte_ring_sc_dequeue_burst(r, cur_dst, 2, NULL);
> - cur_dst += 2;
> - if (ret != 2)
> - goto fail;
> -
> - ret = rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK, NULL);
> - cur_dst += MAX_BULK - 3;
> - if (ret != MAX_BULK - 3)
> - goto fail;
> -
> - printf("Test if ring is empty \n");
> - /* Check if ring is empty */
> - if (1 != rte_ring_empty(r))
> - goto fail;
> -
> - /* check data */
> - if (memcmp(src, dst, cur_dst - dst)) {
> - rte_hexdump(stdout, "src", src, cur_src - src);
> - rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> - printf("data after dequeue is not the same\n");
> - goto fail;
> - }
> + TEST_RING_INCP(cur_dst, esize[i], MAX_BULK);
>
> - cur_src = src;
> - cur_dst = dst;
> -
> - printf("Test MP & MC basic functions \n");
> -
> - printf("enqueue 1 obj\n");
> - ret = rte_ring_mp_enqueue_burst(r, cur_src, 1, NULL);
> - cur_src += 1;
> - if (ret != 1)
> - goto fail;
> -
> - printf("enqueue 2 objs\n");
> - ret = rte_ring_mp_enqueue_burst(r, cur_src, 2, NULL);
> - cur_src += 2;
> - if (ret != 2)
> - goto fail;
> -
> - printf("enqueue MAX_BULK objs\n");
> - ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - cur_src += MAX_BULK;
> - if (ret != MAX_BULK)
> - goto fail;
> -
> - printf("dequeue 1 obj\n");
> - ret = rte_ring_mc_dequeue_burst(r, cur_dst, 1, NULL);
> - cur_dst += 1;
> - if (ret != 1)
> - goto fail;
> -
> - printf("dequeue 2 objs\n");
> - ret = rte_ring_mc_dequeue_burst(r, cur_dst, 2, NULL);
> - cur_dst += 2;
> - if (ret != 2)
> - goto fail;
> -
> - printf("dequeue MAX_BULK objs\n");
> - ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK, NULL);
> - cur_dst += MAX_BULK;
> - if (ret != MAX_BULK)
> - goto fail;
> -
> - /* check data */
> - if (memcmp(src, dst, cur_dst - dst)) {
> - rte_hexdump(stdout, "src", src, cur_src - src);
> - rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> - printf("data after dequeue is not the same\n");
> - goto fail;
> - }
> -
> - cur_src = src;
> - cur_dst = dst;
> + /* check data */
> + if (memcmp(src, dst, cur_dst - dst)) {
> + rte_hexdump(stdout, "src", src, cur_src - src);
> + rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> + printf("data after dequeue is not the same\n");
> + goto fail;
> + }
> +
> + cur_src = src;
> + cur_dst = dst;
> +
> + printf("fill and empty the ring\n");
> + for (j = 0; j < RING_SIZE / MAX_BULK; j++) {
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], MAX_BULK,
> + ret, api_type);
> + if (ret != MAX_BULK)
> + goto fail;
> + TEST_RING_INCP(cur_src, esize[i], MAX_BULK);
> +
> + TEST_RING_DEQUEUE(r, cur_dst, esize[i], MAX_BULK,
> + ret, api_type);
> + if (ret != MAX_BULK)
> + goto fail;
> + TEST_RING_INCP(cur_dst, esize[i], MAX_BULK);
> + }
>
> - printf("fill and empty the ring\n");
> - for (i = 0; i<RING_SIZE/MAX_BULK; i++) {
> - ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - cur_src += MAX_BULK;
> - if (ret != MAX_BULK)
> + /* check data */
> + if (memcmp(src, dst, cur_dst - dst)) {
> + rte_hexdump(stdout, "src", src, cur_src - src);
> + rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> + printf("data after dequeue is not the same\n");
> goto fail;
> - ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK, NULL);
> - cur_dst += MAX_BULK;
> - if (ret != MAX_BULK)
> + }
> +
> + cur_src = src;
> + cur_dst = dst;
> +
> + printf("Test enqueue without enough memory space\n");
> + for (j = 0; j < (RING_SIZE/MAX_BULK - 1); j++) {
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], MAX_BULK,
> + ret, api_type);
> + if (ret != MAX_BULK)
> + goto fail;
> + TEST_RING_INCP(cur_src, esize[i], MAX_BULK);
> + }
> +
> + printf("Enqueue 2 objects, free entries = MAX_BULK - 2\n");
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], 2, ret, api_type);
> + if (ret != 2)
> goto fail;
> - }
> -
> - /* check data */
> - if (memcmp(src, dst, cur_dst - dst)) {
> - rte_hexdump(stdout, "src", src, cur_src - src);
> - rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> - printf("data after dequeue is not the same\n");
> - goto fail;
> - }
> -
> - cur_src = src;
> - cur_dst = dst;
> -
> - printf("Test enqueue without enough memory space \n");
> - for (i = 0; i<RING_SIZE/MAX_BULK - 1; i++) {
> - ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - cur_src += MAX_BULK;
> - if (ret != MAX_BULK)
> + TEST_RING_INCP(cur_src, esize[i], 2);
> +
> +
> + printf("Enqueue the remaining entries = MAX_BULK - 3\n");
> + /* Bulk APIs enqueue exact number of elements */
> + if ((api_type & TEST_RING_BL) == TEST_RING_BL)
> + num_elems = MAX_BULK - 3;
> + else
> + num_elems = MAX_BULK;
> + /* Always one free entry left */
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], num_elems,
> + ret, api_type);
> + if (ret != MAX_BULK - 3)
> goto fail;
> - }
> -
> - /* Available memory space for the exact MAX_BULK objects */
> - ret = rte_ring_mp_enqueue_burst(r, cur_src, 2, NULL);
> - cur_src += 2;
> - if (ret != 2)
> - goto fail;
> + TEST_RING_INCP(cur_src, esize[i], MAX_BULK - 3);
>
> - ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK, NULL);
> - cur_src += MAX_BULK - 3;
> - if (ret != MAX_BULK - 3)
> - goto fail;
> + printf("Test if ring is full\n");
> + if (rte_ring_full(r) != 1)
> + goto fail;
>
> + printf("Test enqueue for a full entry\n");
> + TEST_RING_ENQUEUE(r, cur_src, esize[i], MAX_BULK,
> + ret, api_type);
> + if (ret != 0)
> + goto fail;
>
> - printf("Test dequeue without enough objects \n");
> - for (i = 0; i<RING_SIZE/MAX_BULK - 1; i++) {
> - ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK, NULL);
> - cur_dst += MAX_BULK;
> - if (ret != MAX_BULK)
> + printf("Test dequeue without enough objects\n");
> + for (j = 0; j < RING_SIZE / MAX_BULK - 1; j++) {
> + TEST_RING_DEQUEUE(r, cur_dst, esize[i], MAX_BULK,
> + ret, api_type);
> + if (ret != MAX_BULK)
> + goto fail;
> + TEST_RING_INCP(cur_dst, esize[i], MAX_BULK);
> + }
> +
> + /* Available memory space for the exact MAX_BULK entries */
> + TEST_RING_DEQUEUE(r, cur_dst, esize[i], 2, ret, api_type);
> + if (ret != 2)
> goto fail;
> - }
> + TEST_RING_INCP(cur_dst, esize[i], 2);
> +
> + /* Bulk APIs enqueue exact number of elements */
> + if ((api_type & TEST_RING_BL) == TEST_RING_BL)
> + num_elems = MAX_BULK - 3;
> + else
> + num_elems = MAX_BULK;
> + TEST_RING_DEQUEUE(r, cur_dst, esize[i], num_elems,
> + ret, api_type);
> + if (ret != MAX_BULK - 3)
> + goto fail;
> + TEST_RING_INCP(cur_dst, esize[i], MAX_BULK - 3);
>
> - /* Available objects - the exact MAX_BULK */
> - ret = rte_ring_mc_dequeue_burst(r, cur_dst, 2, NULL);
> - cur_dst += 2;
> - if (ret != 2)
> - goto fail;
> + printf("Test if ring is empty\n");
> + /* Check if ring is empty */
> + if (rte_ring_empty(r) != 1)
> + goto fail;
>
> - ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK, NULL);
> - cur_dst += MAX_BULK - 3;
> - if (ret != MAX_BULK - 3)
> - goto fail;
> + /* check data */
> + if (memcmp(src, dst, cur_dst - dst)) {
> + rte_hexdump(stdout, "src", src, cur_src - src);
> + rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> + printf("data after dequeue is not the same\n");
> + goto fail;
> + }
>
> - /* check data */
> - if (memcmp(src, dst, cur_dst - dst)) {
> - rte_hexdump(stdout, "src", src, cur_src - src);
> - rte_hexdump(stdout, "dst", dst, cur_dst - dst);
> - printf("data after dequeue is not the same\n");
> - goto fail;
> + /* Free memory before test completed */
> + rte_ring_free(r);
> + rte_free(src);
> + rte_free(dst);
> }
>
> - cur_src = src;
> - cur_dst = dst;
> -
> - printf("Covering rte_ring_enqueue_burst functions \n");
> -
> - ret = rte_ring_enqueue_burst(r, cur_src, 2, NULL);
> - cur_src += 2;
> - if (ret != 2)
> - goto fail;
> -
> - ret = rte_ring_dequeue_burst(r, cur_dst, 2, NULL);
> - cur_dst += 2;
> - if (ret != 2)
> - goto fail;
> -
> - /* Free memory before test completed */
> - free(src);
> - free(dst);
> return 0;
> -
> - fail:
> - free(src);
> - free(dst);
> +fail:
> + rte_ring_free(r);
> + rte_free(src);
> + rte_free(dst);
> return -1;
> }
>
> @@ -810,6 +773,7 @@ test_ring_with_exact_size(void)
> static int
> test_ring(void)
> {
> + unsigned int i, j;
> struct rte_ring *r = NULL;
>
> /* some more basic operations */
> @@ -828,9 +792,11 @@ test_ring(void)
> goto test_fail;
> }
>
> - /* burst operations */
> - if (test_ring_burst_basic(r) < 0)
> - goto test_fail;
> + /* Burst and bulk operations with sp/sc, mp/mc and default */
> + for (j = TEST_RING_BL; j <= TEST_RING_BR; j <<= 1)
> + for (i = TEST_RING_N; i <= TEST_RING_M; i <<= 1)
> + if (test_ring_burst_bulk_tests(i | j) < 0)
> + goto test_fail;
>
> /* basic operations */
> if (test_ring_basic(r) < 0)
> diff --git a/app/test/test_ring.h b/app/test/test_ring.h
> new file mode 100644
> index 000000000..19ef1b399
> --- /dev/null
> +++ b/app/test/test_ring.h
> @@ -0,0 +1,203 @@
> +/* SPDX-License-Identifier: BSD-3-Clause
> + * Copyright(c) 2019 Arm Limited
> + */
> +
> +#include <rte_malloc.h>
> +#include <rte_ring.h>
> +#include <rte_ring_elem.h>
> +
> +/* API type to call
> + * N - Calls default APIs
> + * S - Calls SP or SC API
> + * M - Calls MP or MC API
> + */
> +#define TEST_RING_N 1
> +#define TEST_RING_S 2
> +#define TEST_RING_M 4
> +
> +/* API type to call
> + * SL - Calls single element APIs
> + * BL - Calls bulk APIs
> + * BR - Calls burst APIs
> + */
> +#define TEST_RING_SL 8
> +#define TEST_RING_BL 16
> +#define TEST_RING_BR 32
> +
> +#define TEST_RING_IGNORE_API_TYPE ~0U
> +
> +#define TEST_RING_INCP(obj, esize, n) do { \
> + /* Legacy queue APIs? */ \
> + if ((esize) == -1) \
> + obj = ((void **)obj) + n; \
> + else \
> + obj = (void **)(((uint32_t *)obj) + \
> + (n * esize / sizeof(uint32_t))); \
> +} while (0)
> +
> +#define TEST_RING_CREATE(name, esize, count, socket_id, flags, r) do { \
> + /* Legacy queue APIs? */ \
> + if ((esize) == -1) \
> + r = rte_ring_create((name), (count), (socket_id), (flags)); \
> + else \
> + r = rte_ring_create_elem((name), (esize), (count), \
> + (socket_id), (flags)); \
> +} while (0)
> +
> +#define TEST_RING_ENQUEUE(r, obj, esize, n, ret, api_type) do { \
> + /* Legacy queue APIs? */ \
> + if ((esize) == -1) \
> + switch (api_type) { \
> + case (TEST_RING_N | TEST_RING_SL): \
> + ret = rte_ring_enqueue(r, obj); \
> + break; \
> + case (TEST_RING_S | TEST_RING_SL): \
> + ret = rte_ring_sp_enqueue(r, obj); \
> + break; \
> + case (TEST_RING_M | TEST_RING_SL): \
> + ret = rte_ring_mp_enqueue(r, obj); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BL): \
> + ret = rte_ring_enqueue_bulk(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BL): \
> + ret = rte_ring_sp_enqueue_bulk(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BL): \
> + ret = rte_ring_mp_enqueue_bulk(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BR): \
> + ret = rte_ring_enqueue_burst(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BR): \
> + ret = rte_ring_sp_enqueue_burst(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BR): \
> + ret = rte_ring_mp_enqueue_burst(r, obj, n, NULL); \
> + } \
> + else \
> + switch (api_type) { \
> + case (TEST_RING_N | TEST_RING_SL): \
> + ret = rte_ring_enqueue_elem(r, obj, esize); \
> + break; \
> + case (TEST_RING_S | TEST_RING_SL): \
> + ret = rte_ring_sp_enqueue_elem(r, obj, esize); \
> + break; \
> + case (TEST_RING_M | TEST_RING_SL): \
> + ret = rte_ring_mp_enqueue_elem(r, obj, esize); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BL): \
> + ret = rte_ring_enqueue_bulk_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BL): \
> + ret = rte_ring_sp_enqueue_bulk_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BL): \
> + ret = rte_ring_mp_enqueue_bulk_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BR): \
> + ret = rte_ring_enqueue_burst_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BR): \
> + ret = rte_ring_sp_enqueue_burst_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BR): \
> + ret = rte_ring_mp_enqueue_burst_elem(r, obj, esize, n, \
> + NULL); \
> + } \
> +} while (0)
> +
> +#define TEST_RING_DEQUEUE(r, obj, esize, n, ret, api_type) do { \
> + /* Legacy queue APIs? */ \
> + if ((esize) == -1) \
> + switch (api_type) { \
> + case (TEST_RING_N | TEST_RING_SL): \
> + ret = rte_ring_dequeue(r, obj); \
> + break; \
> + case (TEST_RING_S | TEST_RING_SL): \
> + ret = rte_ring_sc_dequeue(r, obj); \
> + break; \
> + case (TEST_RING_M | TEST_RING_SL): \
> + ret = rte_ring_mc_dequeue(r, obj); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BL): \
> + ret = rte_ring_dequeue_bulk(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BL): \
> + ret = rte_ring_sc_dequeue_bulk(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BL): \
> + ret = rte_ring_mc_dequeue_bulk(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BR): \
> + ret = rte_ring_dequeue_burst(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BR): \
> + ret = rte_ring_sc_dequeue_burst(r, obj, n, NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BR): \
> + ret = rte_ring_mc_dequeue_burst(r, obj, n, NULL); \
> + } \
> + else \
> + switch (api_type) { \
> + case (TEST_RING_N | TEST_RING_SL): \
> + ret = rte_ring_dequeue_elem(r, obj, esize); \
> + break; \
> + case (TEST_RING_S | TEST_RING_SL): \
> + ret = rte_ring_sc_dequeue_elem(r, obj, esize); \
> + break; \
> + case (TEST_RING_M | TEST_RING_SL): \
> + ret = rte_ring_mc_dequeue_elem(r, obj, esize); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BL): \
> + ret = rte_ring_dequeue_bulk_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BL): \
> + ret = rte_ring_sc_dequeue_bulk_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BL): \
> + ret = rte_ring_mc_dequeue_bulk_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_N | TEST_RING_BR): \
> + ret = rte_ring_dequeue_burst_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_S | TEST_RING_BR): \
> + ret = rte_ring_sc_dequeue_burst_elem(r, obj, esize, n, \
> + NULL); \
> + break; \
> + case (TEST_RING_M | TEST_RING_BR): \
> + ret = rte_ring_mc_dequeue_burst_elem(r, obj, esize, n, \
> + NULL); \
> + } \
> +} while (0)
My thought to avoid test-code duplication was a bit different.
Instead of adding extra enums/parameters and then do switch on them,
my intention was something like that:
1. mv test_ring_perf.c test_ring_perf.h
2. Inside test_ring_perf.h change rte_ring_ create/enqueue/dequeue function
calls to some not-defined function/macros invocations.
With similar name, same number of parameters, and same semantics.
Also change 'void *burst[..]' to 'RING_ELEM[...]';
3. For each test configuration we want to have (default, 4B, 8B, 16B)
create a new .c file where we:
- define used in test_ring_perf.h macros(/function)
- include test_ring_perf.h
- REGISTER_TEST_COMMAND(<test_name>, test_ring_perf);
As an example:
test_ring_perf.h:
...
static int
enqueue_bulk(void *p)
{
...
RING_ELEM burst[MAX_BURST];
memset(burst, 0, sizeof(burst));
....
const uint64_t sp_start = rte_rdtsc();
for (i = 0; i < iterations; i++)
while (RING_SP_ENQUEUE_BULK(r, burst, size, NULL) == 0)
rte_pause();
const uint64_t sp_end = rte_rdtsc();
const uint64_t mp_start = rte_rdtsc();
for (i = 0; i < iterations; i++)
while (RING_MP_ENQUEUE_BULK(r, burst, size, NULL) == 0)
rte_pause();
const uint64_t mp_end = rte_rdtsc();
....
Then in test_ring_perf.c:
....
#define RING_ELEM void *
...
#define RING_SP_ENQUEUE_BULK(ring, buf, size, spc) \
rte_ring_sp_enqueue_bulk(ring, buf, size, spc)
....
#include "test_ring_perf.h"
REGISTER_TEST_COMMAND(ring_perf_autotest, test_ring_perf);
In test_ring_elem16B_perf.c:
....
#define RING_ELEM __uint128_t
#define RING_SP_ENQUEUE_BULK(ring, buf, size, spc) \
rte_ring_sp_enqueue_bulk_elem(ring, buf, sizeof(RING_ELEM), size, spc)
....
#include "test_ring_perf.h"
REGISTER_TEST_COMMAND(ring_perf_elem16B_autotest, test_ring_perf);
In test_ring_elem4B_per.c:
....
#define RING_ELEM uint32_t
#define RING_SP_ENQUEUE_BULK(ring, buf, size, spc) \
rte_ring_sp_enqueue_bulk_elem(ring, buf, sizeof(RING_ELEM), size, spc)
....
#include "test_ring_perf.h"
REGISTER_TEST_COMMAND(ring_perf_elem4B_autotest, test_ring_perf);
And so on.
> +
> +/* This function is placed here as it is required for both
> + * performance and functional tests.
> + */
> +static __rte_always_inline void *
> +test_ring_calloc(unsigned int rsize, int esize)
> +{
> + unsigned int sz;
> + void *p;
> +
> + /* Legacy queue APIs? */
> + if (esize == -1)
> + sz = sizeof(void *);
> + else
> + sz = esize;
> +
> + p = rte_zmalloc(NULL, rsize * sz, RTE_CACHE_LINE_SIZE);
> + if (p == NULL)
> + printf("Failed to allocate memory\n");
> +
> + return p;
> +}
> --
> 2.17.1
next prev parent reply other threads:[~2020-01-02 16:31 UTC|newest]
Thread overview: 173+ messages / expand[flat|nested] mbox.gz Atom feed top
2019-08-28 14:46 [dpdk-dev] [PATCH 0/5] lib/ring: templates to support custom element size Honnappa Nagarahalli
2019-08-28 14:46 ` [dpdk-dev] [PATCH 1/5] lib/ring: apis to support configurable " Honnappa Nagarahalli
2019-08-28 14:46 ` [dpdk-dev] [PATCH 2/5] lib/ring: add template to support different element sizes Honnappa Nagarahalli
2019-10-01 11:47 ` Ananyev, Konstantin
2019-10-02 4:21 ` Honnappa Nagarahalli
2019-10-02 8:39 ` Ananyev, Konstantin
2019-10-03 3:33 ` Honnappa Nagarahalli
2019-10-03 11:51 ` Ananyev, Konstantin
2019-10-03 12:27 ` Ananyev, Konstantin
2019-10-03 22:49 ` Honnappa Nagarahalli
2019-08-28 14:46 ` [dpdk-dev] [PATCH 3/5] tools/checkpatch: relax constraints on __rte_experimental Honnappa Nagarahalli
2019-08-28 14:46 ` [dpdk-dev] [PATCH 4/5] lib/ring: add ring APIs to support 32b ring elements Honnappa Nagarahalli
2019-08-28 14:46 ` [dpdk-dev] [PATCH 5/5] lib/hash: use ring with 32b element size to save memory Honnappa Nagarahalli
2019-08-28 15:12 ` [dpdk-dev] [PATCH 0/5] lib/ring: templates to support custom element size Jerin Jacob Kollanukkaran
2019-08-28 15:16 ` Pavan Nikhilesh Bhagavatula
2019-08-28 22:59 ` Honnappa Nagarahalli
2019-09-06 19:05 ` [dpdk-dev] [PATCH v2 0/6] " Honnappa Nagarahalli
2019-09-06 19:05 ` [dpdk-dev] [PATCH v2 1/6] lib/ring: apis to support configurable " Honnappa Nagarahalli
2019-09-06 19:05 ` [dpdk-dev] [PATCH v2 2/6] lib/ring: add template to support different element sizes Honnappa Nagarahalli
2019-09-08 19:44 ` Stephen Hemminger
2019-09-09 9:01 ` Bruce Richardson
2019-09-09 22:33 ` Honnappa Nagarahalli
2019-09-06 19:05 ` [dpdk-dev] [PATCH v2 3/6] tools/checkpatch: relax constraints on __rte_experimental Honnappa Nagarahalli
2019-09-06 19:05 ` [dpdk-dev] [PATCH v2 4/6] lib/ring: add ring APIs to support 32b ring elements Honnappa Nagarahalli
2019-09-06 19:05 ` [dpdk-dev] [PATCH v2 5/6] lib/hash: use ring with 32b element size to save memory Honnappa Nagarahalli
2019-09-06 19:05 ` [dpdk-dev] [PATCH v2 6/6] lib/eventdev: use ring templates for event rings Honnappa Nagarahalli
2019-09-09 13:04 ` [dpdk-dev] [PATCH v2 0/6] lib/ring: templates to support custom element size Aaron Conole
2019-10-07 13:49 ` David Marchand
2019-10-08 19:19 ` [dpdk-dev] [PATCH v3 0/2] lib/ring: APIs " Honnappa Nagarahalli
2019-10-08 19:19 ` [dpdk-dev] [PATCH v3 1/2] lib/ring: apis to support configurable " Honnappa Nagarahalli
2019-10-08 19:19 ` [dpdk-dev] [PATCH v3 2/2] test/ring: add test cases for configurable element size ring Honnappa Nagarahalli
2019-10-09 2:47 ` [dpdk-dev] [PATCH v3 0/2] lib/ring: APIs to support custom element size Honnappa Nagarahalli
2019-10-09 2:47 ` [dpdk-dev] [PATCH v4 1/2] lib/ring: apis to support configurable " Honnappa Nagarahalli
2019-10-11 19:21 ` Honnappa Nagarahalli
2019-10-14 19:41 ` Ananyev, Konstantin
2019-10-14 23:56 ` Honnappa Nagarahalli
2019-10-15 9:34 ` Ananyev, Konstantin
2019-10-17 4:46 ` Honnappa Nagarahalli
2019-10-17 11:51 ` Ananyev, Konstantin
2019-10-17 20:16 ` Honnappa Nagarahalli
2019-10-17 23:17 ` David Christensen
2019-10-18 3:18 ` Honnappa Nagarahalli
2019-10-18 8:04 ` Jerin Jacob
2019-10-18 16:11 ` Jerin Jacob
2019-10-21 0:27 ` Honnappa Nagarahalli
2019-10-18 16:44 ` Ananyev, Konstantin
2019-10-18 19:03 ` Honnappa Nagarahalli
2019-10-21 0:36 ` Honnappa Nagarahalli
2019-10-21 9:04 ` Ananyev, Konstantin
2019-10-22 15:59 ` Ananyev, Konstantin
2019-10-22 17:57 ` Ananyev, Konstantin
2019-10-23 18:58 ` Honnappa Nagarahalli
2019-10-18 17:23 ` David Christensen
2019-10-09 2:47 ` [dpdk-dev] [PATCH v4 2/2] test/ring: add test cases for configurable element size ring Honnappa Nagarahalli
2019-10-17 20:08 ` [dpdk-dev] [PATCH v5 0/3] lib/ring: APIs to support custom element size Honnappa Nagarahalli
2019-10-17 20:08 ` [dpdk-dev] [PATCH v5 1/3] lib/ring: apis to support configurable " Honnappa Nagarahalli
2019-10-17 20:39 ` Stephen Hemminger
2019-10-17 20:40 ` Stephen Hemminger
2019-10-17 20:08 ` [dpdk-dev] [PATCH v5 2/3] test/ring: add test cases for configurable element size ring Honnappa Nagarahalli
2019-10-17 20:08 ` [dpdk-dev] [PATCH v5 3/3] lib/ring: copy ring elements using memcpy partially Honnappa Nagarahalli
2019-10-21 0:22 ` [dpdk-dev] [RFC v6 0/6] lib/ring: APIs to support custom element size Honnappa Nagarahalli
2019-10-21 0:22 ` [dpdk-dev] [RFC v6 1/6] test/ring: use division for cycle count calculation Honnappa Nagarahalli
2019-10-23 9:49 ` Olivier Matz
2019-10-21 0:22 ` [dpdk-dev] [RFC v6 2/6] lib/ring: apis to support configurable element size Honnappa Nagarahalli
2019-10-23 9:59 ` Olivier Matz
2019-10-23 19:12 ` Honnappa Nagarahalli
2019-10-21 0:22 ` [dpdk-dev] [RFC v6 3/6] test/ring: add functional tests for configurable element size ring Honnappa Nagarahalli
2019-10-23 10:01 ` Olivier Matz
2019-10-23 11:12 ` Ananyev, Konstantin
2019-10-21 0:22 ` [dpdk-dev] [RFC v6 4/6] test/ring: add perf " Honnappa Nagarahalli
2019-10-23 10:02 ` Olivier Matz
2019-10-21 0:22 ` [dpdk-dev] [RFC v6 5/6] lib/ring: copy ring elements using memcpy partially Honnappa Nagarahalli
2019-10-21 0:23 ` [dpdk-dev] [RFC v6 6/6] lib/ring: improved copy function to copy ring elements Honnappa Nagarahalli
2019-10-23 10:05 ` Olivier Matz
2019-10-23 9:48 ` [dpdk-dev] [RFC v6 0/6] lib/ring: APIs to support custom element size Olivier Matz
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 00/17] " Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 01/17] test/ring: use division for cycle count calculation Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 02/17] lib/ring: apis to support configurable element size Honnappa Nagarahalli
2020-01-02 16:42 ` Ananyev, Konstantin
2020-01-07 5:35 ` Honnappa Nagarahalli
2020-01-07 6:00 ` Honnappa Nagarahalli
2020-01-07 10:21 ` Ananyev, Konstantin
2020-01-07 15:21 ` Honnappa Nagarahalli
2020-01-07 15:41 ` Ananyev, Konstantin
2020-01-08 6:17 ` Honnappa Nagarahalli
2020-01-08 10:05 ` Ananyev, Konstantin
2020-01-08 23:40 ` Honnappa Nagarahalli
2020-01-09 0:48 ` Ananyev, Konstantin
2020-01-09 16:06 ` Honnappa Nagarahalli
2020-01-13 11:53 ` Ananyev, Konstantin
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 03/17] test/ring: add functional tests for rte_ring_xxx_elem APIs Honnappa Nagarahalli
2020-01-02 16:31 ` Ananyev, Konstantin [this message]
2020-01-07 5:13 ` Honnappa Nagarahalli
2020-01-07 16:03 ` Ananyev, Konstantin
2020-01-09 5:15 ` Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 04/17] test/ring: test burst APIs with random empty-full test case Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 05/17] test/ring: add default, single element test cases Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 06/17] test/ring: rte_ring_xxx_elem test cases for exact size ring Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 07/17] test/ring: negative test cases for rte_ring_xxx_elem APIs Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 08/17] test/ring: remove duplicate test cases Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 09/17] test/ring: removed unused variable synchro Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 10/17] test/ring: modify single element enq/deq perf test cases Honnappa Nagarahalli
2020-01-02 17:03 ` Ananyev, Konstantin
2020-01-07 5:54 ` Honnappa Nagarahalli
2020-01-07 16:13 ` Ananyev, Konstantin
2020-01-07 22:33 ` Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 11/17] test/ring: modify burst " Honnappa Nagarahalli
2020-01-02 16:57 ` Ananyev, Konstantin
2020-01-07 5:42 ` Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 12/17] test/ring: modify bulk " Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 13/17] test/ring: modify bulk empty deq " Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 14/17] test/ring: modify multi-lcore " Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 15/17] test/ring: adjust run-on-all-cores " Honnappa Nagarahalli
2020-01-02 17:00 ` Ananyev, Konstantin
2020-01-07 5:42 ` Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 16/17] lib/hash: use ring with 32b element size to save memory Honnappa Nagarahalli
2019-12-20 4:45 ` [dpdk-dev] [PATCH v7 17/17] lib/eventdev: use custom element size ring for event rings Honnappa Nagarahalli
2020-01-13 17:25 ` [dpdk-dev] [PATCH v8 0/6] lib/ring: APIs to support custom element size Honnappa Nagarahalli
2020-01-13 17:25 ` [dpdk-dev] [PATCH v8 1/6] test/ring: use division for cycle count calculation Honnappa Nagarahalli
2020-01-13 17:25 ` [dpdk-dev] [PATCH v8 2/6] lib/ring: apis to support configurable element size Honnappa Nagarahalli
2020-01-13 17:25 ` [dpdk-dev] [PATCH v8 3/6] test/ring: add functional tests for rte_ring_xxx_elem APIs Honnappa Nagarahalli
2020-01-13 17:25 ` [dpdk-dev] [PATCH v8 4/6] test/ring: modify perf test cases to use " Honnappa Nagarahalli
2020-01-13 17:25 ` [dpdk-dev] [PATCH v8 5/6] lib/hash: use ring with 32b element size to save memory Honnappa Nagarahalli
2020-01-13 17:25 ` [dpdk-dev] [PATCH v8 6/6] lib/eventdev: use custom element size ring for event rings Honnappa Nagarahalli
[not found] ` <1578977880-13011-1-git-send-email-robot@bytheb.org>
[not found] ` <VE1PR08MB5149BE79083CD66A41CBD6D198340@VE1PR08MB5149.eurprd08.prod.outlook.com>
2020-01-14 15:12 ` [dpdk-dev] FW: || pw64572 " Aaron Conole
2020-01-14 16:51 ` Aaron Conole
2020-01-14 19:35 ` Honnappa Nagarahalli
2020-01-14 20:44 ` Aaron Conole
2020-01-15 0:55 ` Honnappa Nagarahalli
2020-01-15 4:43 ` Honnappa Nagarahalli
2020-01-15 5:05 ` Honnappa Nagarahalli
2020-01-15 18:22 ` Aaron Conole
2020-01-15 18:38 ` Honnappa Nagarahalli
2020-01-16 5:27 ` Honnappa Nagarahalli
2020-01-16 5:25 ` [dpdk-dev] [PATCH v9 0/6] lib/ring: APIs to support custom element size Honnappa Nagarahalli
2020-01-16 5:25 ` [dpdk-dev] [PATCH v9 1/6] test/ring: use division for cycle count calculation Honnappa Nagarahalli
2020-01-16 5:25 ` [dpdk-dev] [PATCH v9 2/6] lib/ring: apis to support configurable element size Honnappa Nagarahalli
2020-01-17 16:34 ` Olivier Matz
2020-01-17 16:45 ` Honnappa Nagarahalli
2020-01-17 18:10 ` David Christensen
2020-01-18 12:32 ` Ananyev, Konstantin
2020-01-18 15:01 ` Honnappa Nagarahalli
2020-01-16 5:25 ` [dpdk-dev] [PATCH v9 3/6] test/ring: add functional tests for rte_ring_xxx_elem APIs Honnappa Nagarahalli
2020-01-17 17:03 ` Olivier Matz
2020-01-18 16:27 ` Honnappa Nagarahalli
2020-01-16 5:25 ` [dpdk-dev] [PATCH v9 4/6] test/ring: modify perf test cases to use " Honnappa Nagarahalli
2020-01-17 17:12 ` Olivier Matz
2020-01-18 16:28 ` Honnappa Nagarahalli
2020-01-16 5:25 ` [dpdk-dev] [PATCH v9 5/6] lib/hash: use ring with 32b element size to save memory Honnappa Nagarahalli
2020-01-17 20:27 ` David Marchand
2020-01-17 20:54 ` Honnappa Nagarahalli
2020-01-17 21:07 ` David Marchand
2020-01-17 22:24 ` Wang, Yipeng1
2020-01-16 5:25 ` [dpdk-dev] [PATCH v9 6/6] lib/eventdev: use custom element size ring for event rings Honnappa Nagarahalli
2020-01-17 14:41 ` Jerin Jacob
2020-01-17 16:12 ` David Marchand
2020-01-16 16:36 ` [dpdk-dev] [PATCH v9 0/6] lib/ring: APIs to support custom element size Honnappa Nagarahalli
2020-01-17 12:14 ` David Marchand
2020-01-17 13:34 ` Jerin Jacob
2020-01-17 16:37 ` Mattias Rönnblom
2020-01-17 14:28 ` Honnappa Nagarahalli
2020-01-17 14:36 ` Honnappa Nagarahalli
2020-01-17 16:15 ` David Marchand
2020-01-17 16:32 ` Honnappa Nagarahalli
2020-01-17 17:15 ` Olivier Matz
2020-01-18 19:32 ` [dpdk-dev] [PATCH v10 " Honnappa Nagarahalli
2020-01-18 19:32 ` [dpdk-dev] [PATCH v10 1/6] test/ring: use division for cycle count calculation Honnappa Nagarahalli
2020-01-18 19:32 ` [dpdk-dev] [PATCH v10 2/6] lib/ring: apis to support configurable element size Honnappa Nagarahalli
2020-01-18 19:32 ` [dpdk-dev] [PATCH v10 3/6] test/ring: add functional tests for rte_ring_xxx_elem APIs Honnappa Nagarahalli
2020-01-18 19:32 ` [dpdk-dev] [PATCH v10 4/6] test/ring: modify perf test cases to use " Honnappa Nagarahalli
2020-01-18 19:32 ` [dpdk-dev] [PATCH v10 5/6] lib/hash: use ring with 32b element size to save memory Honnappa Nagarahalli
2020-01-18 19:32 ` [dpdk-dev] [PATCH v10 6/6] eventdev: use custom element size ring for event rings Honnappa Nagarahalli
2020-01-19 19:31 ` [dpdk-dev] [PATCH v10 0/6] lib/ring: APIs to support custom element size David Marchand
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=SN6PR11MB2558F2FEDB0D4D1BC55AF6C19A200@SN6PR11MB2558.namprd11.prod.outlook.com \
--to=konstantin.ananyev@intel.com \
--cc=bruce.richardson@intel.com \
--cc=david.marchand@redhat.com \
--cc=dev@dpdk.org \
--cc=dharmik.thakkar@arm.com \
--cc=gavin.hu@arm.com \
--cc=honnappa.nagarahalli@arm.com \
--cc=jerinj@marvell.com \
--cc=nd@arm.com \
--cc=olivier.matz@6wind.com \
--cc=pbhagavatula@marvell.com \
--cc=ruifeng.wang@arm.com \
--cc=sthemmin@microsoft.com \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).